{"meta":{"query_hash":"f1d7e4ccf1b5","filters":{"topic":"Graph Labeling and Dimension Problems"},"cohort_total":807,"direct_labels_cover":1,"predictions_cover":807,"exported":807,"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/f1d7e4ccf1b5","api":"https://metacan.xera.ac/api/v1/cohort?topic=Graph+Labeling+and+Dimension+Problems"},"results":[{"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":"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":"W103171531","doi":"","title":"Investigating the Minimal 4-Regular Matchstick Graph","year":2011,"lang":"en","type":"article","venue":"Sound Ideas (University of Puget Sound)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.029859096301462953,"score_gpt":0.19851668139276937,"score_spread":0.1686575850913064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W103171531","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9301288,0.0001932085,0.06573259,0.00047105292,0.00033171405,0.00012519285,0.000003585057,0.00017961331,0.0028342563],"genre_scores_gemma":[0.95580894,0.000008261768,0.043403327,0.000202525,0.000007991481,3.1950938e-7,0.000002244211,0.000008758389,0.0005576103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986237,0.000118308264,0.00017822548,0.00038140026,0.0003619542,0.0003363576],"domain_scores_gemma":[0.9986188,0.00009818105,0.00021786828,0.00073204335,0.00017456136,0.00015854035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005337191,0.00016366362,0.00020611094,0.00016590294,0.00062902045,0.00006599246,0.0013473277,0.000090994195,0.00006032084],"category_scores_gemma":[0.00005689153,0.00015142944,0.00017080235,0.0006614655,0.00065147004,0.00050753594,0.00044488415,0.00018766952,0.000095616204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004333785,0.000046924684,0.0035248282,0.000017367383,0.00004476149,0.000009818706,0.0071876985,0.00003213814,0.000098681405,0.987898,0.001064713,0.00007076146],"study_design_scores_gemma":[0.0003302092,0.000077029275,0.0037655563,0.000024876419,0.000035020752,0.000015629588,0.002197459,0.0015976573,0.000019050944,0.9916328,0.000121124955,0.00018359428],"about_ca_topic_score_codex":0.0007004788,"about_ca_topic_score_gemma":0.00011311313,"teacher_disagreement_score":0.025680173,"about_ca_system_score_codex":0.000019609433,"about_ca_system_score_gemma":0.000070780756,"threshold_uncertainty_score":0.61751133},"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"W113038098","doi":"10.1017/cbo9780511721328.009","title":"Thresholds for colourability and satisfiability in random graphs and boolean formulae","year":2001,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto","keywords":"Satisfiability; Boolean satisfiability problem; Combinatorics; Mathematics; Discrete mathematics; Computer science","score_opus":0.01892958969263517,"score_gpt":0.19935138272686428,"score_spread":0.18042179303422912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W113038098","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.053118784,0.0010629972,0.008101,0.00016346971,0.00029563,0.0027670204,0.00020443505,0.00035443486,0.93393224],"genre_scores_gemma":[0.2541018,0.0007946426,0.005705853,0.00029560126,0.000016547365,0.000014364816,0.000039876344,0.0000701196,0.7389612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99815947,0.00005797468,0.0003064173,0.000930763,0.00020046964,0.00034489532],"domain_scores_gemma":[0.9984026,0.0003252968,0.00018070237,0.0007162627,0.00016024901,0.00021492026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005843946,0.00036182144,0.0005617782,0.00025868724,0.00023654461,0.000098473734,0.00046071748,0.00035570466,5.946077e-7],"category_scores_gemma":[0.000031837437,0.0003895198,0.00015129722,0.000023419358,0.00043052444,0.00020479613,0.0005454704,0.00033573763,4.071562e-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.00017274258,0.000016112319,0.0003710105,0.0001363922,0.00003613122,0.00003378557,0.00009168245,0.0000039392703,0.000021939837,0.99434376,0.0012061214,0.0035664106],"study_design_scores_gemma":[0.029166577,0.0011639189,0.0040435325,0.0010808003,0.0005305934,0.00019716268,0.00010294267,0.0146038085,0.00041274098,0.18330918,0.761585,0.0038037116],"about_ca_topic_score_codex":0.00026498525,"about_ca_topic_score_gemma":0.00004837172,"teacher_disagreement_score":0.81103456,"about_ca_system_score_codex":0.00007673193,"about_ca_system_score_gemma":0.00009127499,"threshold_uncertainty_score":0.9998557},"labels":[],"label_agreement":null},{"id":"W1149759637","doi":"10.1016/j.laa.2015.08.007","title":"Proof of a conjectured lower bound on the chromatic number of a graph","year":2015,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics; Graph; Friendship graph; Upper and lower bounds; Windmill graph; Discrete mathematics; Voltage graph; Line graph","score_opus":0.022544371930424516,"score_gpt":0.2594626552656268,"score_spread":0.23691828333520226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1149759637","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9455144,0.00072769646,0.046067476,0.0030589192,0.00009075019,0.000981348,0.000013897275,0.00008034921,0.0034652099],"genre_scores_gemma":[0.9962599,0.000007918096,0.0032980805,0.00024853463,0.0000067277597,0.00007524267,0.0000019209422,0.0000047622025,0.00009691394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935097,0.000027816322,0.00020161789,0.00016184243,0.00016705929,0.000090710935],"domain_scores_gemma":[0.99916136,0.00010115618,0.00011160336,0.00039760565,0.00016544164,0.00006283936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019932912,0.00007346059,0.00011939226,0.000040105177,0.00006433973,0.000018936473,0.00025876227,0.00003590725,0.000008273788],"category_scores_gemma":[0.00003935554,0.00004636744,0.000036299763,0.00039623858,0.00008432843,0.00005256644,0.00006145526,0.000062245526,0.000017749986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004564407,0.0001667634,0.000065990476,0.000027899336,0.000022236612,1.6360895e-7,0.00061896205,0.00004283242,0.0019467516,0.9953126,0.00092186563,0.0008694227],"study_design_scores_gemma":[0.00095135585,0.00033354652,0.0003678707,0.000104234976,0.000046330126,0.00002359394,0.00010696914,0.036068402,0.058995053,0.8965885,0.006139812,0.0002743404],"about_ca_topic_score_codex":0.00000915872,"about_ca_topic_score_gemma":0.000001283343,"teacher_disagreement_score":0.09872406,"about_ca_system_score_codex":0.0000026571643,"about_ca_system_score_gemma":0.000046402434,"threshold_uncertainty_score":0.18908092},"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":"W118899274","doi":"10.1016/j.dam.2015.06.012","title":"The simultaneous metric dimension of graph families","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Metric dimension; Mathematics; Combinatorics; Vertex (graph theory); Intrinsic metric; Metric (unit); Discrete mathematics; Generator (circuit theory); Convex metric space; Graph; Metric space; Line graph; Pathwidth","score_opus":0.018101287191006572,"score_gpt":0.23859046555515936,"score_spread":0.2204891783641528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W118899274","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.1839868,0.002326638,0.7749028,0.000759181,0.0008030571,0.0011227989,0.000008413114,0.0007238491,0.03536642],"genre_scores_gemma":[0.8775969,0.000061570514,0.12217285,0.000058640588,0.000004371862,0.00001565508,0.0000017920929,0.000013200112,0.0000750348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985177,0.000020685115,0.00042043757,0.00023082196,0.00054897054,0.0002613907],"domain_scores_gemma":[0.99793684,0.0006844571,0.00022975495,0.00085492106,0.00017201043,0.00012203529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000676943,0.00016150098,0.00023992502,0.00014524999,0.00015536732,0.00008232998,0.00073938555,0.000058194135,6.234502e-7],"category_scores_gemma":[0.000240604,0.00009721112,0.00007529447,0.0009107991,0.0001483914,0.00007017106,0.00028719127,0.00010390648,0.000038793547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064375345,0.00006712538,0.000006736672,0.000038233462,0.000027993934,0.0000028575912,0.0018769152,0.0027364623,0.002858382,0.9865781,0.0005884565,0.0052122683],"study_design_scores_gemma":[0.0005095373,0.00010015025,0.0000038396806,0.000032984517,0.000030494955,0.00001010183,0.0017998745,0.13863409,0.012014897,0.84586495,0.0007551288,0.00024395535],"about_ca_topic_score_codex":0.000009120819,"about_ca_topic_score_gemma":0.0000019055763,"teacher_disagreement_score":0.6936101,"about_ca_system_score_codex":0.000012001672,"about_ca_system_score_gemma":0.0000427369,"threshold_uncertainty_score":0.39641547},"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"W1498272613","doi":"10.46298/dmtcs.1258","title":"List circular backbone colouring","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Chromatic scale; Bounded function; Graph; Discrete mathematics","score_opus":0.010712726340983204,"score_gpt":0.2351696714341264,"score_spread":0.2244569450931432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498272613","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.03472332,0.000029075936,0.9547432,0.0011237842,0.000510944,0.00018139774,8.51236e-7,0.00038565125,0.00830176],"genre_scores_gemma":[0.6243374,0.0000018000798,0.37514672,0.00045923304,0.000024091663,0.0000065425556,6.14535e-7,0.0000116718065,0.000011947661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655545,0.00011564404,0.0005163363,0.000904867,0.0011067053,0.0008010161],"domain_scores_gemma":[0.9971581,0.00037539945,0.00015345417,0.0016020875,0.00026181887,0.00044912475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031198491,0.00029182693,0.0003690121,0.00024595673,0.00066160224,0.00096547883,0.0029509736,0.00007595677,0.000041972096],"category_scores_gemma":[0.0002856081,0.00023057399,0.0001376912,0.0012623701,0.00229887,0.0005312877,0.0014265525,0.00025084638,0.00018080225],"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":[9.4884297e-7,0.00007050846,0.00001750517,0.000035929443,0.0000056243243,0.0000053333656,0.00059153617,0.00013671294,0.002567143,0.99447215,0.000054179232,0.0020424323],"study_design_scores_gemma":[0.00014058073,0.00008051968,0.000028224611,0.000057593057,0.0000057647435,0.000029944884,0.0000075750304,0.51365215,0.0016185369,0.48408374,0.00009277238,0.00020259863],"about_ca_topic_score_codex":0.0000028546333,"about_ca_topic_score_gemma":2.749738e-7,"teacher_disagreement_score":0.5896141,"about_ca_system_score_codex":0.000032384345,"about_ca_system_score_gemma":0.000072357056,"threshold_uncertainty_score":0.94025344},"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":"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":"W1548662877","doi":"10.37236/508","title":"Digraphs are $2$-Weight Choosable","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Natural Sciences and Engineering Research Council of Canada; University of Ottawa; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Digraph; Algebraic number; Graph; Weighting; Discrete mathematics","score_opus":0.013918262938280582,"score_gpt":0.1897037726936705,"score_spread":0.17578550975538992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548662877","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5626351,0.08895954,0.3076968,0.010083754,0.009980182,0.0005435589,0.0000011246982,0.00041068136,0.019689236],"genre_scores_gemma":[0.9978515,0.0014648002,0.00023155415,0.0002062505,0.000015182921,0.0000014202208,7.2545156e-8,0.000009976028,0.00021924735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840015,0.00011518164,0.00038265967,0.0001343438,0.00042327584,0.0005443991],"domain_scores_gemma":[0.9984762,0.00007594323,0.0005129465,0.0005005512,0.0003275218,0.000106829335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012510169,0.0001378478,0.00022135614,0.00015563265,0.00018228256,0.000057123656,0.0015734686,0.00005435899,0.000011360667],"category_scores_gemma":[0.00004742718,0.00008393298,0.00015709214,0.0007794536,0.00005946072,0.00035089545,0.00011211239,0.000591633,0.000019852423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011218777,0.0001355173,0.00066481356,0.0000040586383,0.000052055027,0.000011927597,0.000350974,0.0000070367187,0.00007458294,0.99654394,0.0016897512,0.00045413602],"study_design_scores_gemma":[0.00052318233,0.00040382094,0.00061111274,0.00002393899,0.00002496994,0.00020436125,0.00003394659,0.00021430958,0.002824472,0.9894481,0.0055728885,0.00011490919],"about_ca_topic_score_codex":0.000009318669,"about_ca_topic_score_gemma":0.0000018529306,"teacher_disagreement_score":0.43521637,"about_ca_system_score_codex":0.00006933714,"about_ca_system_score_gemma":0.00024693544,"threshold_uncertainty_score":0.34226876},"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":"W1561296992","doi":"","title":"Searching and sweeping graphs: A brief survey","year":2006,"lang":"en","type":"article","venue":"","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":162,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Variety (cybernetics); Graph; Term (time); Combinatorics; Statistics","score_opus":0.017009467148376752,"score_gpt":0.2289722551929002,"score_spread":0.21196278804452345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561296992","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8132925,0.00046585355,0.17200148,0.0007088168,0.0001545725,0.00009403723,8.2735806e-7,0.00040622626,0.012875692],"genre_scores_gemma":[0.9700805,0.0000068830536,0.02940271,0.00030997046,0.0000025618742,0.0000014733731,0.0000017202156,0.00000385054,0.00019036031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991681,0.0000854742,0.00012944483,0.00026363332,0.00014888639,0.00020446755],"domain_scores_gemma":[0.9995226,0.00012705158,0.000024918312,0.00023219064,0.000034688666,0.00005854834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006028163,0.00006950036,0.000080785765,0.000107860804,0.00014360336,0.0001996564,0.00019836452,0.000024600427,0.0000025641202],"category_scores_gemma":[0.00002683213,0.00005879921,0.000021490905,0.0003451165,0.000039349383,0.00020562837,0.0001495337,0.000073335286,0.0000068418894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011550096,0.000023199073,0.021797914,0.0000058835676,0.0000041370918,0.0000049531754,0.00008169589,0.00010231978,0.0027429536,0.9660909,0.00070888683,0.008435956],"study_design_scores_gemma":[0.00058000773,0.00006532351,0.31328925,0.000036247802,0.0000027965084,0.00003575425,0.000009640711,0.06563607,0.0028153989,0.6166213,0.0005566144,0.0003515897],"about_ca_topic_score_codex":0.0054385145,"about_ca_topic_score_gemma":0.0003109096,"teacher_disagreement_score":0.34946966,"about_ca_system_score_codex":0.0000022413908,"about_ca_system_score_gemma":0.00001529421,"threshold_uncertainty_score":0.8221444},"labels":[],"label_agreement":null},{"id":"W1576203101","doi":"10.11650/twjm/1500404993","title":"A METHOD TO OBTAIN LOWER BOUNDS FOR CIRCULAR CHROMATIC NUMBER","year":2008,"lang":"en","type":"article","venue":"Taiwanese Journal of Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Science Council","keywords":"Omega; Combinatorics; Mathematics; Graph; Upper and lower bounds; Physics; Mathematical analysis","score_opus":0.028906863064989054,"score_gpt":0.2965467046067998,"score_spread":0.26763984154181075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576203101","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.16798632,0.00011182968,0.83023,0.0009293005,0.00024788646,0.0002026698,0.0000010620655,0.000041801755,0.00024912244],"genre_scores_gemma":[0.16155897,0.0000065322597,0.8376811,0.00042497893,0.000032684384,0.0000083059385,2.1404337e-7,0.000019124669,0.00026806098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806654,0.00007652874,0.00079415296,0.00017007942,0.0005890451,0.0003036671],"domain_scores_gemma":[0.9979274,0.00035166868,0.00046579845,0.00046469114,0.0005435319,0.00024685444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019787897,0.00017938168,0.00047519422,0.00018962371,0.00017468391,0.00009161866,0.000764131,0.000072263414,0.000024349862],"category_scores_gemma":[0.000308164,0.0001359253,0.00026160426,0.00045763847,0.000038933504,0.00027391108,0.00009676197,0.00015281222,0.00007265912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001648054,0.007378183,0.00077108195,0.0036630807,0.001522539,0.0027272773,0.094702475,0.011203725,0.09613907,0.63387656,0.13144359,0.016407631],"study_design_scores_gemma":[0.0026480253,0.0011150814,0.000093472474,0.0006938823,0.0001544955,0.015587199,0.0005031858,0.07510089,0.006375965,0.8854221,0.011524457,0.00078124716],"about_ca_topic_score_codex":0.000002210521,"about_ca_topic_score_gemma":3.477001e-7,"teacher_disagreement_score":0.25154555,"about_ca_system_score_codex":0.000046888894,"about_ca_system_score_gemma":0.00017717373,"threshold_uncertainty_score":0.55428725},"labels":[],"label_agreement":null},{"id":"W1578871531","doi":"","title":"Product-cordial index and friendly index of regular graphs","year":2012,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Index (typography); Product (mathematics); Mathematics; Computer science; World Wide Web; Geometry","score_opus":0.12423852838854808,"score_gpt":0.46586536266158335,"score_spread":0.34162683427303525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578871531","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96493685,0.027255727,0.004445433,0.00021897136,0.0012374946,0.0004072696,0.000008372662,0.000065425396,0.0014244776],"genre_scores_gemma":[0.9957399,0.0017585115,0.002144257,0.00016519931,0.000052369975,0.000017110291,0.0000019232057,0.000026942342,0.00009378866],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9968608,0.00026617525,0.00088825444,0.00054782163,0.00088539586,0.00055154384],"domain_scores_gemma":[0.997126,0.00016533681,0.00090815045,0.00094847847,0.00043030927,0.0004217467],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022636831,0.00031146972,0.000703354,0.0010655631,0.00024111371,0.00071191497,0.0029947923,0.000115771196,0.00033538602],"category_scores_gemma":[0.00021236922,0.00026965258,0.00015854681,0.0017317256,0.00027350863,0.004045781,0.0017200351,0.00037774772,0.0000053328195],"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.00010839885,0.00040242486,0.8761323,0.00009912044,0.0001545062,0.000009227463,0.0004892145,0.00010184132,0.06672571,0.011400085,0.015994165,0.028383002],"study_design_scores_gemma":[0.0010086455,0.000037664384,0.81927025,0.00032715846,0.00005654463,0.000052452117,0.000044235396,0.0004860703,0.052904926,0.12075619,0.0044368077,0.00061903056],"about_ca_topic_score_codex":0.0006365231,"about_ca_topic_score_gemma":0.000010125202,"teacher_disagreement_score":0.1093561,"about_ca_system_score_codex":0.000021711887,"about_ca_system_score_gemma":0.00011077514,"threshold_uncertainty_score":0.99997556},"labels":[],"label_agreement":null},{"id":"W1581738587","doi":"10.1007/978-3-540-85097-7_34","title":"Magic Labelings on Cycles and Wheels","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"MAGIC (telescope); Enumeration; Vertex (graph theory); Computer science; Combinatorics; Algorithm; Discrete mathematics; Theoretical computer science; Mathematics; Graph; Physics; Astronomy","score_opus":0.017068912504524556,"score_gpt":0.2276480715780396,"score_spread":0.21057915907351504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581738587","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.0017221203,0.0025541438,0.98637587,0.0020305896,0.0015324814,0.00033068494,0.000004013453,0.00032256526,0.005127552],"genre_scores_gemma":[0.32321823,0.001457795,0.66193914,0.011589162,0.00021391302,0.000009491459,0.0000058179708,0.00009182606,0.0014745977],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963389,0.000028923725,0.00044180534,0.0016637021,0.0009225102,0.0006041314],"domain_scores_gemma":[0.99778676,0.00039429657,0.00021143472,0.0011907856,0.00018991006,0.00022680762],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006280598,0.00051966537,0.0004787271,0.00091571506,0.00033417443,0.0004193889,0.0018332072,0.00029160577,0.000008652228],"category_scores_gemma":[0.00007088294,0.00044511547,0.00009207175,0.00047124567,0.00094845844,0.00036207074,0.0009726133,0.0007679756,0.000088587534],"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.000009644498,0.000065779626,0.00010516265,0.0000552983,0.000017981012,0.0002998649,0.0015776292,0.015552166,0.000410829,0.11485234,0.00037985967,0.86667347],"study_design_scores_gemma":[0.0005799082,0.0004565317,0.00018093215,0.0008781953,0.000009447351,0.00033643923,1.1209546e-7,0.2246021,0.0018247447,0.76616204,0.0037757873,0.0011937384],"about_ca_topic_score_codex":0.000023506718,"about_ca_topic_score_gemma":0.000013292622,"teacher_disagreement_score":0.8654797,"about_ca_system_score_codex":0.00008269974,"about_ca_system_score_gemma":0.0002407458,"threshold_uncertainty_score":0.9998001},"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":"W1588217500","doi":"10.37236/2639","title":"Metric Dimension for Random Graphs","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Microsoft Research; National Science Foundation","keywords":"Metric dimension; Combinatorics; Mathematics; Vertex (graph theory); Dimension (graph theory); Packing dimension; Graph; Discrete mathematics; Metric (unit); Random graph; Minkowski–Bouligand dimension; Chordal graph; 1-planar graph","score_opus":0.006990342412215714,"score_gpt":0.21530067841576891,"score_spread":0.2083103360035532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588217500","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.40027326,0.015942683,0.5749079,0.005950332,0.0019782293,0.0006420271,2.4794255e-7,0.00007606761,0.00022922289],"genre_scores_gemma":[0.99862325,0.00045580606,0.0005453469,0.00019813223,0.00001273604,0.000010887094,2.1500465e-7,0.00001058324,0.0001430179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837327,0.000120225086,0.0004389278,0.00013216259,0.00041636976,0.00051901693],"domain_scores_gemma":[0.9979149,0.00055306463,0.00040810264,0.00036929417,0.00065905665,0.00009557977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018195934,0.00013180118,0.00025983225,0.00028460388,0.00021458235,0.00011688685,0.0010284048,0.00005300035,0.0000034313962],"category_scores_gemma":[0.00018377903,0.00007734321,0.00022107428,0.0010674676,0.000039366427,0.0003638247,0.00007914743,0.00038405138,0.000013243608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001824659,0.00007549295,0.000051540883,0.0000045076276,0.000052864347,5.5829423e-7,0.00007987514,0.00012868349,0.0008012035,0.99443537,0.0025070133,0.0018446671],"study_design_scores_gemma":[0.0022301977,0.00067776354,0.00006632039,0.000013074415,0.00003270206,0.00008360064,0.000020216989,0.004911378,0.0020440926,0.98864704,0.0011728,0.00010080007],"about_ca_topic_score_codex":0.0000089992045,"about_ca_topic_score_gemma":3.493123e-7,"teacher_disagreement_score":0.59835,"about_ca_system_score_codex":0.00007541386,"about_ca_system_score_gemma":0.00020995356,"threshold_uncertainty_score":0.31539646},"labels":[],"label_agreement":null},{"id":"W1590128845","doi":"10.37236/2407","title":"Graphs with Large Distinguishing Chromatic Number","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Multipartite; Chromatic scale; Graph; Discrete mathematics; Clique number; Automorphism; Quantum","score_opus":0.0037720654523230837,"score_gpt":0.19695430225689617,"score_spread":0.19318223680457308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590128845","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88137555,0.0017404748,0.111625366,0.0026817773,0.00055623555,0.00018271971,1.5108441e-7,0.000078955636,0.0017587644],"genre_scores_gemma":[0.9991327,0.00007310374,0.00043634637,0.0001984197,0.000011336937,0.00000344654,1.6057756e-7,0.000011871556,0.00013263749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983117,0.000115380884,0.00035183766,0.00012063919,0.0005076518,0.0005927865],"domain_scores_gemma":[0.9985135,0.00016839255,0.00041779393,0.00039243497,0.00041066736,0.000097177515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001163233,0.00013698879,0.0002131787,0.00007299249,0.00023654288,0.00021246314,0.0010711029,0.000037015092,0.00001541229],"category_scores_gemma":[0.000084711646,0.00007533423,0.00008645874,0.00069110375,0.000046005553,0.0004500447,0.0000961672,0.00058741577,0.000038791823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027240665,0.000088371584,0.000974986,0.000006846525,0.000049614344,0.0000061155556,0.00033196495,0.0000240547,0.000086112566,0.99713707,0.0010367547,0.00025539732],"study_design_scores_gemma":[0.00069113396,0.00031675922,0.0005695093,0.000053747248,0.000023391618,0.00042959448,0.00005302161,0.0018669708,0.0002323468,0.9950466,0.00059770053,0.000119183336],"about_ca_topic_score_codex":0.000018085626,"about_ca_topic_score_gemma":0.0000026243229,"teacher_disagreement_score":0.11775713,"about_ca_system_score_codex":0.0000765739,"about_ca_system_score_gemma":0.00023144844,"threshold_uncertainty_score":0.30720407},"labels":[],"label_agreement":null},{"id":"W1601736385","doi":"10.37236/638","title":"Chromatic Roots of a Ring of Four Cliques","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Division of Mathematical Sciences; Isaac Newton Institute for Mathematical Sciences","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Chromatic scale; Graph; Chromatic polynomial; Discrete mathematics","score_opus":0.0224879710711412,"score_gpt":0.21891899077507954,"score_spread":0.19643101970393834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601736385","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.941215,0.0040880824,0.0530859,0.00018518981,0.0003406707,0.000074073636,1.2453961e-7,0.000019320752,0.0009916751],"genre_scores_gemma":[0.9989059,0.00028595352,0.0007474629,0.000021330705,0.0000048084135,5.9474655e-7,2.5892774e-8,0.000006753488,0.000027180791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855024,0.00012655067,0.00057748536,0.00007837489,0.00037538054,0.00029198092],"domain_scores_gemma":[0.9982765,0.000120556746,0.0008222943,0.00036132184,0.00037015966,0.000049177102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001599176,0.00009486525,0.00028257017,0.00014834752,0.000048482867,0.000010977799,0.0010294771,0.000039766426,0.0000033670663],"category_scores_gemma":[0.000078227495,0.00006189321,0.00013238305,0.00045828853,0.00006132838,0.00018600258,0.00010101828,0.00031126148,0.0000013090528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013509022,0.00013251748,0.00032541543,0.000026029089,0.000066388646,0.0000034055818,0.00073746144,0.000024716877,0.003166509,0.9949188,0.00004590968,0.0005393423],"study_design_scores_gemma":[0.00046171056,0.0009657744,0.0010237519,0.00009686136,0.00003265807,0.00011826883,0.00002942136,0.0010284914,0.034499094,0.96164775,0.000030188603,0.00006600377],"about_ca_topic_score_codex":0.000018271743,"about_ca_topic_score_gemma":0.0000017242147,"teacher_disagreement_score":0.057690926,"about_ca_system_score_codex":0.000046061217,"about_ca_system_score_gemma":0.00029604312,"threshold_uncertainty_score":0.2523932},"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":"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":"W1644304657","doi":"10.1007/s11464-009-0014-8","title":"On vertex-coloring edge-weighting of graphs","year":2009,"lang":"en","type":"article","venue":"Frontiers of Mathematics in China","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Combinatorics; Weighting; Mathematics; Vertex (graph theory); Edge coloring; Graph; Complete coloring; Graph coloring; Discrete mathematics; Line graph; Physics; Graph power","score_opus":0.009792150442763903,"score_gpt":0.2238827849337982,"score_spread":0.2140906344910343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1644304657","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9178557,0.0005305347,0.07285185,0.00028652156,0.000632415,0.00017227736,0.0000011723008,0.000071932984,0.007597607],"genre_scores_gemma":[0.7414079,0.000019691524,0.25850418,0.000030997187,0.0000012102336,0.0000014936924,3.0259108e-7,0.000004578447,0.000029658251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884087,0.000025210667,0.0004538519,0.00019835136,0.00028872184,0.00019298012],"domain_scores_gemma":[0.99910486,0.00008429391,0.00024610606,0.00047916724,0.000042814714,0.000042748896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053521735,0.00012003978,0.00031357602,0.00032289425,0.00003804397,0.000015377085,0.0005693084,0.000058908412,0.0000016292636],"category_scores_gemma":[0.00015408541,0.00010493576,0.000085771266,0.0004402848,0.0000448618,0.00012228827,0.000059160633,0.00013642796,0.0000021276826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056922945,0.00046839876,0.00075316144,0.000079668396,0.00001490559,0.0000044209555,0.0027478088,0.0007096559,0.0012907443,0.9856931,0.00330154,0.0049309186],"study_design_scores_gemma":[0.000337756,0.00018919466,0.0012518498,0.00025105765,0.0000052714213,0.000001997012,0.00006375343,0.041680675,0.00917095,0.9469277,0.000009864207,0.00010990273],"about_ca_topic_score_codex":0.000006346051,"about_ca_topic_score_gemma":8.6784e-7,"teacher_disagreement_score":0.18565232,"about_ca_system_score_codex":0.000015910617,"about_ca_system_score_gemma":0.000020704436,"threshold_uncertainty_score":0.4279156},"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":"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":"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":"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":"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":"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":"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":"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":"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":"W1747715124","doi":"10.37236/1914","title":"Splitting Numbers of Grids","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Antichain; Combinatorics; Mathematics; Partially ordered set; Crystallography; Chemistry","score_opus":0.004558685025001118,"score_gpt":0.20918134240293912,"score_spread":0.204622657377938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1747715124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87083983,0.010187258,0.108523875,0.006719303,0.0010149701,0.00010639464,2.1383785e-7,0.000051174076,0.002556954],"genre_scores_gemma":[0.99873245,0.0002814605,0.00067736476,0.00012858158,0.000025084051,3.7437025e-7,5.611432e-8,0.000006539941,0.00014810037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985403,0.000092060596,0.00047656655,0.000088720204,0.00042860763,0.00037376184],"domain_scores_gemma":[0.9986635,0.00015196174,0.000510314,0.00032481246,0.00028950835,0.000059933398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018555067,0.00009316758,0.0001973038,0.00010035958,0.000093533716,0.000032209093,0.0010332498,0.000038585953,0.0000033668705],"category_scores_gemma":[0.00007107619,0.00006144752,0.00012640795,0.0005309681,0.000049935923,0.00024601107,0.00008838775,0.00046460805,0.000005881386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060683615,0.00007387033,0.0001395823,0.0000041770136,0.000034259898,0.0000013757402,0.00031384148,0.000448821,0.0007471924,0.9944074,0.00050170545,0.0033217203],"study_design_scores_gemma":[0.00067230844,0.00037807136,0.000085120395,0.00003343687,0.000023780209,0.00019533113,0.00004208006,0.0026324904,0.008727594,0.9824697,0.0046448214,0.00009529346],"about_ca_topic_score_codex":0.000005365503,"about_ca_topic_score_gemma":0.0000012057912,"teacher_disagreement_score":0.12789258,"about_ca_system_score_codex":0.00009613394,"about_ca_system_score_gemma":0.0003068613,"threshold_uncertainty_score":0.25057572},"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":"W1767926957","doi":"10.48550/arxiv.1203.6143","title":"Some Results on incidence coloring, star arboricity and domination number","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Arboricity; Mathematics; Combinatorics; Chromatic scale; Cartesian product; Incidence (geometry); Upper and lower bounds; Graph; Star (game theory); Discrete mathematics; Planar graph","score_opus":0.05837230030061886,"score_gpt":0.19803950815749946,"score_spread":0.1396672078568806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1767926957","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98540986,0.000104961364,0.011376178,0.00017537388,0.0009785475,0.0002459094,0.00001474117,0.00024837683,0.001446084],"genre_scores_gemma":[0.996964,0.00030854717,0.0018398192,0.00014294071,0.00003941778,0.000001086333,0.000008288281,0.000010890871,0.00068503973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981028,0.00014721436,0.00022674298,0.0010197571,0.00015231459,0.00035120905],"domain_scores_gemma":[0.99817055,0.0001782624,0.00030945492,0.0009494828,0.00017227711,0.00021996377],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006312799,0.00027551228,0.0002612792,0.00020471615,0.00020031614,0.000113284594,0.0007977692,0.00026692293,0.000005119398],"category_scores_gemma":[0.000086450316,0.00029847244,0.00008484906,0.00038571353,0.00011688153,0.0005888022,0.0013876321,0.0005336162,0.000116859286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009979248,0.00016097426,0.003078826,0.00005812225,0.00004192053,0.0000967974,0.00047342893,0.014258933,0.00009612635,0.98075396,0.00049670914,0.00038438948],"study_design_scores_gemma":[0.002329053,0.00019209385,0.01984855,0.0004345029,0.00012244096,0.000013112172,0.000055428092,0.25950226,0.0013623798,0.71386176,0.00096856104,0.0013098803],"about_ca_topic_score_codex":0.0002897116,"about_ca_topic_score_gemma":0.000015965628,"teacher_disagreement_score":0.26689225,"about_ca_system_score_codex":0.00014377035,"about_ca_system_score_gemma":0.0000902717,"threshold_uncertainty_score":0.9999467},"labels":[],"label_agreement":null},{"id":"W1772204473","doi":"","title":"An Efficient On-Line Algorithm for Edge-Ranking of Trees","year":2008,"lang":"en","type":"article","venue":"Americanae (AECID Library)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ranking (information retrieval); Computer science; Combinatorics; Graph; Enhanced Data Rates for GSM Evolution; Algorithm; Learning to rank; Line (geometry); Path (computing); Time complexity; Mathematics; Artificial intelligence","score_opus":0.02087993031207536,"score_gpt":0.24150179858362908,"score_spread":0.22062186827155372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1772204473","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5003995,0.00027574963,0.49678996,0.00087296107,0.00043251156,0.0002848523,0.000021406302,0.00041405615,0.0005090408],"genre_scores_gemma":[0.7162057,0.000028054419,0.28256798,0.00096034387,0.000028295788,0.000019679197,0.000012636648,0.000021758664,0.00015556048],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850357,0.000055949942,0.00033386287,0.0004798703,0.00029671108,0.00033003627],"domain_scores_gemma":[0.9986975,0.00016593261,0.00018618158,0.00072256837,0.00005760957,0.00017016743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000106878506,0.0001803753,0.00029980286,0.00024946302,0.00017615069,0.000021808175,0.0007945119,0.000042438878,0.000020232706],"category_scores_gemma":[0.000018112092,0.00015658601,0.00013014789,0.00080672186,0.00020552656,0.0003894093,0.00009959288,0.0000887164,0.000011966199],"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.00006928261,0.001998964,0.011238808,0.00003186327,0.00014193483,0.000089609515,0.002205134,0.057132762,0.0035208648,0.09583695,0.021816717,0.8059171],"study_design_scores_gemma":[0.00119906,0.0025321378,0.013041804,0.000058081958,0.00001502942,0.000019088558,0.000053522,0.9519327,0.025125539,0.003981966,0.0015326818,0.0005083616],"about_ca_topic_score_codex":0.0005329339,"about_ca_topic_score_gemma":0.0000010991022,"teacher_disagreement_score":0.89479995,"about_ca_system_score_codex":0.0000073779265,"about_ca_system_score_gemma":0.00009719697,"threshold_uncertainty_score":0.63853925},"labels":[],"label_agreement":null},{"id":"W1791109262","doi":"10.1007/978-3-642-34191-5_3","title":"A History of Flips in Combinatorial Triangulations","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematical proof; Computer science; Enhanced Data Rates for GSM Evolution; Theoretical computer science; Combinatorics; Artificial intelligence; Mathematics; Geometry","score_opus":0.02310466757687248,"score_gpt":0.2283262121548195,"score_spread":0.205221544577947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1791109262","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.00036980078,0.004626266,0.9812843,0.00031434174,0.009008721,0.0003685812,0.0000026366665,0.00010546571,0.0039198487],"genre_scores_gemma":[0.7613086,0.00007318289,0.23685074,0.0007046334,0.00022298493,0.000014437999,0.0000063773446,0.00004541091,0.000773641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99722356,0.000045047313,0.00065868633,0.00081450096,0.00077393884,0.00048424167],"domain_scores_gemma":[0.9978317,0.0003927965,0.0003444231,0.0010926075,0.00019972154,0.00013874026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001166561,0.00032383433,0.0005209661,0.0012846902,0.000055924527,0.000056216657,0.0017584687,0.00029787034,0.000023245639],"category_scores_gemma":[0.000116473784,0.00031086945,0.00012309181,0.00056888774,0.0005960356,0.000455034,0.0006395413,0.0005801796,0.000016178008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014329617,0.00017902764,0.00025615632,0.00006851272,0.000011981302,0.00003078044,0.0032953003,0.011879607,0.0006805954,0.6662734,0.000180704,0.3171296],"study_design_scores_gemma":[0.0011304991,0.00016554925,0.00031481378,0.0004953883,0.000010701899,0.000022407286,1.0039403e-7,0.1648202,0.00045246366,0.82661647,0.0053248308,0.000646585],"about_ca_topic_score_codex":0.000073182106,"about_ca_topic_score_gemma":0.000041974406,"teacher_disagreement_score":0.76093876,"about_ca_system_score_codex":0.0005518938,"about_ca_system_score_gemma":0.00096031325,"threshold_uncertainty_score":0.9999343},"labels":[],"label_agreement":null},{"id":"W1798981749","doi":"10.37236/999","title":"On the Quantum Chromatic Number of a Graph","year":2007,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; University of Bristol","keywords":"Mathematics; Combinatorics; Chromatic scale; Discrete mathematics; Critical graph; Windmill graph; Friendship graph; Graph; Clique number; Quantum; Brooks' theorem; Graph power; Line graph; Quantum mechanics; Physics","score_opus":0.008306689640085747,"score_gpt":0.23958491300243911,"score_spread":0.23127822336235337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1798981749","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9095691,0.0014054046,0.084789366,0.0025444492,0.0006063349,0.0000965058,1.0548036e-7,0.000020250263,0.00096850167],"genre_scores_gemma":[0.99948514,0.00013738222,0.000061413455,0.00025013858,0.000008492238,6.1070506e-7,4.240193e-8,0.0000075209055,0.000049254857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822783,0.00014156074,0.000495997,0.00008926017,0.0006106902,0.0004346424],"domain_scores_gemma":[0.9978218,0.00082959974,0.0005523761,0.00047935676,0.0002602292,0.000056640492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004197172,0.00011373876,0.00020224742,0.000105910556,0.00015012326,0.00003480129,0.0012697042,0.000041967676,0.0000069577823],"category_scores_gemma":[0.00014522288,0.00005611205,0.0001576924,0.00087146455,0.00008845272,0.000103961764,0.000066803615,0.00058431784,0.000012116885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014853634,0.000118248994,0.00006357295,0.0000047164676,0.000047236088,0.0000040821947,0.00028615206,0.0000372082,0.00039533924,0.99813175,0.00069734774,0.00019950721],"study_design_scores_gemma":[0.00037908248,0.0004605622,0.00016817843,0.000045650904,0.000019277755,0.00018801795,0.000046432167,0.0006698661,0.003135105,0.9946373,0.00018402188,0.000066506356],"about_ca_topic_score_codex":0.0000062796553,"about_ca_topic_score_gemma":0.0000012079178,"teacher_disagreement_score":0.089916065,"about_ca_system_score_codex":0.00006609964,"about_ca_system_score_gemma":0.00021151912,"threshold_uncertainty_score":0.25386027},"labels":[],"label_agreement":null},{"id":"W1802444145","doi":"10.37236/2698","title":"Product Dimension of Forests and Bounded Treewidth Graphs","year":2013,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Microsoft Research","keywords":"Combinatorics; Treewidth; Mathematics; Bounded function; Dimension (graph theory); Upper and lower bounds; Discrete mathematics; Graph; Product (mathematics); Partial k-tree; Chordal graph; Pathwidth; 1-planar graph; Line graph; Geometry","score_opus":0.009660454865182485,"score_gpt":0.22381918689416724,"score_spread":0.21415873202898475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1802444145","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95787454,0.030434957,0.007884265,0.0019053546,0.0014328293,0.0003427214,6.310654e-7,0.00003511464,0.0000895929],"genre_scores_gemma":[0.9966078,0.0027348658,0.00047553718,0.00004757236,0.000016149586,0.0000048374386,8.6017656e-7,0.00001935184,0.000093049486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973381,0.00025147063,0.00081201986,0.00032381536,0.00072741054,0.0005471502],"domain_scores_gemma":[0.99652964,0.00017726776,0.0014474755,0.0009423591,0.000782838,0.000120427474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020314106,0.00029697389,0.0006077669,0.0003262639,0.00014626986,0.0001428503,0.0015428849,0.00014729465,0.0000016079645],"category_scores_gemma":[0.000115842246,0.00018987419,0.00022301417,0.00047935604,0.00017095744,0.0002221949,0.0008204235,0.0015063916,0.0000016613269],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000179592,0.00013912353,0.00038750394,0.000066801804,0.00014634198,0.0000036292586,0.00034491663,0.000145486,0.00041350175,0.9962704,0.0005930896,0.0014712375],"study_design_scores_gemma":[0.00061946874,0.00059201923,0.0006085626,0.00017293016,0.00008582542,0.00015638123,0.0000102617205,0.0014372848,0.0028690954,0.9930759,0.00018304246,0.00018919852],"about_ca_topic_score_codex":0.00004473817,"about_ca_topic_score_gemma":0.000006229554,"teacher_disagreement_score":0.038733244,"about_ca_system_score_codex":0.00010593901,"about_ca_system_score_gemma":0.0007963225,"threshold_uncertainty_score":0.7742845},"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":"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":"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":"W1825578166","doi":"10.3968/j.sms.1923845220120202.002","title":"Fibonacci and Super Fibonacci Graceful Labeling of Some Graphs","year":2011,"lang":"en","type":"article","venue":"Studies in mathematical sciences","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":"Fibonacci number; Combinatorics; Vertex (graph theory); Graph; Mathematics; Discrete mathematics; Computer science","score_opus":0.14562649879565046,"score_gpt":0.3307151263444197,"score_spread":0.18508862754876923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1825578166","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9884325,0.0054965033,0.0009686407,0.0005016615,0.0002795565,0.00019027507,9.88429e-7,0.00008539436,0.0040444573],"genre_scores_gemma":[0.8632658,0.00035268592,0.13619836,0.00012476831,0.000003203575,0.000014141806,5.6163234e-8,0.0000036539361,0.000037298803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984047,0.000058522866,0.00042556552,0.0003986146,0.0003775253,0.00033510645],"domain_scores_gemma":[0.99909294,0.00041245457,0.00009019829,0.0002545024,0.00008124024,0.00006864482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014689512,0.00014113174,0.00033043636,0.0002008812,0.000191316,0.000032861553,0.0005939737,0.00004174764,0.000015977868],"category_scores_gemma":[0.00039169803,0.000094435665,0.00004855578,0.00077249174,0.0012125325,0.00043378162,0.0005164537,0.00009293531,0.000010370535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016464264,0.00008302754,0.0031370888,0.000086469736,0.000014407885,0.000004500719,0.007144274,0.0000047166577,0.00030220096,0.98823947,0.00006477826,0.000917449],"study_design_scores_gemma":[0.00015391962,0.00012688553,0.0006041011,0.00017476964,0.000005991632,0.0000085818065,0.0015234244,0.0018495185,0.001155433,0.9942571,0.000008001622,0.00013229816],"about_ca_topic_score_codex":0.000019904634,"about_ca_topic_score_gemma":0.000008336972,"teacher_disagreement_score":0.1352297,"about_ca_system_score_codex":0.00000750403,"about_ca_system_score_gemma":0.000023803703,"threshold_uncertainty_score":0.44676268},"labels":[],"label_agreement":null},{"id":"W183082810","doi":"","title":"On integer-magic spectra of caterpillars","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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 (telescope); Combinatorics; Mathematics; Graph; Vertex (graph theory); Integer (computer science); Physics; Astrophysics; Computer science","score_opus":0.011539199979142175,"score_gpt":0.24639006519748652,"score_spread":0.23485086521834433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W183082810","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86627644,0.00035222125,0.11434828,0.0001807593,0.016671443,0.00018030389,5.9054236e-7,0.00005378717,0.0019361551],"genre_scores_gemma":[0.9796626,0.000018633196,0.02007106,0.000043108805,0.00018110385,1.7090049e-7,2.296202e-7,0.000018747882,0.000004377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99701935,0.00007331982,0.001431234,0.00023738766,0.00086233276,0.00037634827],"domain_scores_gemma":[0.9962498,0.0010606343,0.0013793265,0.0003945897,0.00068482844,0.00023080476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034987985,0.00026339944,0.00071427476,0.00043279526,0.00014507503,0.00014747668,0.0007872046,0.00014311724,0.0000027997987],"category_scores_gemma":[0.0004813596,0.00021774617,0.00020633281,0.0005466582,0.00010991683,0.00020871684,0.00025198585,0.00047984772,0.0000034190791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054074462,0.00049082283,0.00007665222,0.00007830579,0.000054707933,0.000038123566,0.0008687724,0.000058519585,0.001794106,0.9946865,0.00016495438,0.0016344826],"study_design_scores_gemma":[0.0025108755,0.0014647376,0.00007740293,0.00040645362,0.00003241317,0.0001299073,0.00011555955,0.004008456,0.008629485,0.98228395,0.00011050793,0.00023024817],"about_ca_topic_score_codex":0.0000074386912,"about_ca_topic_score_gemma":2.015429e-7,"teacher_disagreement_score":0.1133861,"about_ca_system_score_codex":0.000054510023,"about_ca_system_score_gemma":0.000111705485,"threshold_uncertainty_score":0.88794315},"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":"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":"W1869584441","doi":"","title":"On cliques of signed and switchable signed graphs","year":2014,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Graph homomorphism; Discrete mathematics; Symmetric graph; Line graph; Signed graph; Windmill graph; 1-planar graph; Vertex (graph theory); Graph power; Voltage graph; Graph","score_opus":0.027129508185545066,"score_gpt":0.15499188625773705,"score_spread":0.12786237807219197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1869584441","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8545388,0.000026486226,0.14242092,0.000075495285,0.0000765585,0.00007235009,6.893865e-7,0.00012901638,0.0026596996],"genre_scores_gemma":[0.9980901,0.000019266337,0.0013604026,0.00020392162,0.0000019401562,1.5521901e-7,5.5689196e-7,0.000005388967,0.0003182961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991454,0.000087393455,0.0001147761,0.00040764228,0.00006194844,0.0001828374],"domain_scores_gemma":[0.9990934,0.00017462036,0.00009318253,0.00044491,0.00008708044,0.00010678801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026763254,0.00011348772,0.00016048117,0.00019340194,0.00010260839,0.000025705527,0.0003679296,0.000061841,0.0000075084436],"category_scores_gemma":[0.000035520778,0.00011130631,0.00005746121,0.00049426104,0.00009334813,0.00021768971,0.00013006781,0.00007134029,0.00001669068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001946522,0.000051960098,0.00080472906,0.000009713326,0.00001349192,0.00000692887,0.00007075578,0.0018186902,0.0035527009,0.99308753,0.00014655112,0.00041749456],"study_design_scores_gemma":[0.0007152118,0.00049610407,0.00048689998,0.000038058693,0.000017592514,0.000001593978,0.000019673073,0.11970138,0.005553732,0.87268853,0.000089311565,0.00019189197],"about_ca_topic_score_codex":0.00007578198,"about_ca_topic_score_gemma":0.000007636076,"teacher_disagreement_score":0.14355129,"about_ca_system_score_codex":0.000008549874,"about_ca_system_score_gemma":0.00001716299,"threshold_uncertainty_score":0.45389396},"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":"W1879394092","doi":"10.46298/dmtcs.2145","title":"The inapproximability for the $(0,1)$-additive number","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.013001358155591008,"score_gpt":0.2612078213346106,"score_spread":0.24820646317901962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1879394092","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.0021308071,0.000040837775,0.9827862,0.012284037,0.0006230175,0.0005964278,0.000008302954,0.00016221002,0.0013681966],"genre_scores_gemma":[0.7620769,0.000015741285,0.23730053,0.00038851445,0.000036522306,0.00011320405,2.686642e-7,0.000011874618,0.00005643338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971419,0.000104915525,0.0004526752,0.0007045091,0.0008325336,0.0007634869],"domain_scores_gemma":[0.99161166,0.0057604965,0.00015732403,0.0017967715,0.0004724575,0.000201269],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.00463852,0.00023729967,0.00021357056,0.000041327217,0.0019080583,0.000834481,0.0039196224,0.000051951294,0.000020661892],"category_scores_gemma":[0.0009419788,0.00008757456,0.00017456709,0.00071899174,0.0066324063,0.00043298092,0.0012272216,0.00014064634,0.00009047248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054018237,0.00003826992,0.000010067649,0.000006920229,0.000009884729,5.214971e-7,0.00045815815,0.0000037000575,0.0001748242,0.96902925,0.00032958822,0.029933423],"study_design_scores_gemma":[0.00020276397,0.00006538622,0.00004539554,0.000038062826,0.0000088074885,0.000015198874,0.000031766256,0.25346774,0.0015120171,0.74387765,0.000585869,0.00014936231],"about_ca_topic_score_codex":0.0000012563656,"about_ca_topic_score_gemma":7.128376e-7,"teacher_disagreement_score":0.7599461,"about_ca_system_score_codex":0.00004069361,"about_ca_system_score_gemma":0.0001265884,"threshold_uncertainty_score":0.9993913},"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":"W1897223594","doi":"10.1090/s0025-5718-05-01777-1","title":"An old conjecture of Erdos–Turán on additive bases","year":2005,"lang":"lv","type":"article","venue":"Mathematics of Computation","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Algorithm; Conjecture; Artificial intelligence; Mathematics; Computer science; Combinatorics","score_opus":0.018099139655915628,"score_gpt":0.27288815737612626,"score_spread":0.2547890177202106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1897223594","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6798013,0.00029375163,0.31612003,0.00082838815,0.00035913498,0.0005275588,0.00010594481,0.0001288146,0.0018350828],"genre_scores_gemma":[0.84041417,0.000015198884,0.15920186,0.00020911777,0.000027803342,0.0000040528275,0.000028363884,0.000018511446,0.00008094325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977472,0.00013057662,0.00086021784,0.00037499244,0.00064916944,0.00023787268],"domain_scores_gemma":[0.9973393,0.0006247737,0.00088066724,0.0005497113,0.00049244496,0.00011307927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053005695,0.0002664667,0.00049906655,0.00029242577,0.00008965323,0.00007289891,0.00045160364,0.0001456118,0.00004835231],"category_scores_gemma":[0.00011378232,0.00024359045,0.00014139847,0.0004434095,0.000158084,0.0003075577,0.00007413956,0.00017311284,0.000051190378],"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.000042084528,0.0031561577,0.000031726675,0.0007632285,0.00013507325,0.0000057651737,0.017399471,0.28360853,0.005780424,0.6011349,0.0027640169,0.08517861],"study_design_scores_gemma":[0.00071928825,0.0010040338,0.00015368019,0.0007787512,0.000057980684,0.000009431717,0.00023148986,0.8259574,0.04076646,0.12998664,0.00008472033,0.00025012332],"about_ca_topic_score_codex":0.000020486958,"about_ca_topic_score_gemma":0.0000054376583,"teacher_disagreement_score":0.54234886,"about_ca_system_score_codex":0.000028041264,"about_ca_system_score_gemma":0.000088509434,"threshold_uncertainty_score":0.993333},"labels":[],"label_agreement":null},{"id":"W1904355337","doi":"10.1002/jgt.20635","title":"A Characterization of b‐Perfect Graphs","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Graph coloring; Complete coloring; Fractional coloring; Discrete mathematics; Chromatic polynomial; List coloring; Edge coloring; Graph factorization; Graph power; Wheel graph; Graph; Vertex (graph theory); Line graph","score_opus":0.018008865210613765,"score_gpt":0.20675210563390428,"score_spread":0.18874324042329052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1904355337","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9232814,0.00025641685,0.074894816,0.00004543119,0.00055658136,0.00004472645,9.125801e-7,0.000023107705,0.00089664233],"genre_scores_gemma":[0.9922417,0.000093003015,0.007502632,0.00012365812,0.000006177678,6.5160344e-7,2.7770437e-7,0.000005945103,0.000025967453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989167,0.00017433592,0.0004498486,0.00010107953,0.00023176549,0.00012627395],"domain_scores_gemma":[0.9987447,0.000055587316,0.0005769089,0.00026219932,0.0002811415,0.000079449106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013816592,0.00008755729,0.0002035382,0.00048499246,0.00004621518,0.000016829988,0.000514481,0.000046634297,0.000027487516],"category_scores_gemma":[0.000044958513,0.00006483428,0.00020243817,0.00051459967,0.00008862394,0.00039318405,0.000048273563,0.00012944004,0.0000035986116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060047405,0.00013692431,0.0014660642,0.000012834443,0.000058182384,0.00001311679,0.0015572231,0.0000016536915,0.2062361,0.7846569,0.000033774955,0.0057672085],"study_design_scores_gemma":[0.00037651864,0.0004123832,0.009780096,0.00008175543,0.000025195443,0.00010091184,0.00002973857,0.000048972415,0.08445002,0.9045473,0.000053074913,0.00009407274],"about_ca_topic_score_codex":0.0000025589138,"about_ca_topic_score_gemma":2.0719527e-7,"teacher_disagreement_score":0.121786065,"about_ca_system_score_codex":0.000003863965,"about_ca_system_score_gemma":0.000039605256,"threshold_uncertainty_score":0.26438653},"labels":[],"label_agreement":null},{"id":"W1907059769","doi":"10.37236/165","title":"Distinguishing Chromatic Numbers of Bipartite Graphs","year":2009,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Bipartite graph; Mathematics; Chromatic scale; Delta; Graph; Discrete mathematics; Physics","score_opus":0.005713564834732197,"score_gpt":0.218584882256818,"score_spread":0.2128713174220858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1907059769","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94271874,0.0060794987,0.046286482,0.002799646,0.0007486606,0.00010225954,1.8714776e-7,0.000052193624,0.001212338],"genre_scores_gemma":[0.99922705,0.00020432145,0.00038450884,0.00013414689,0.000007227345,3.2170294e-7,1.09518254e-7,0.000005223251,0.000037069152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837047,0.000111775866,0.0005290752,0.00010065107,0.0004820399,0.00040599666],"domain_scores_gemma":[0.99846923,0.0001556833,0.0006492266,0.00037079098,0.00028222933,0.00007283023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015939861,0.00011379945,0.00025551132,0.00013700346,0.00012304107,0.000060725313,0.0010910571,0.00003794342,0.0000015487406],"category_scores_gemma":[0.00017556135,0.00007517031,0.000149918,0.0008618353,0.000052406827,0.00023710799,0.000047416095,0.00043231383,0.0000022444692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005723487,0.0000944688,0.000134448,0.000006347004,0.000030089304,0.000004355244,0.00039199897,0.00016527191,0.0011544933,0.9968465,0.00027676823,0.0008895591],"study_design_scores_gemma":[0.00042993663,0.00061204337,0.00037269018,0.00006593899,0.000027039008,0.00012698099,0.000023090406,0.0012997579,0.002252372,0.9944866,0.0002191129,0.0000844482],"about_ca_topic_score_codex":0.0000067268834,"about_ca_topic_score_gemma":9.4626625e-7,"teacher_disagreement_score":0.056508336,"about_ca_system_score_codex":0.00006463117,"about_ca_system_score_gemma":0.00022657144,"threshold_uncertainty_score":0.30653563},"labels":[],"label_agreement":null},{"id":"W1909458272","doi":"10.3968/j.sms.1923845220110302.220","title":"A Class of ‘n’ Distant Graceful Trees","year":2011,"lang":"en","type":"article","venue":"Studies in mathematical sciences","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); Combinatorics; Mathematics; Tree (set theory); Integer (computer science); Discrete mathematics; Computer science; Graph","score_opus":0.15619254258825982,"score_gpt":0.3392599156995638,"score_spread":0.183067373111304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1909458272","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85637665,0.0038689335,0.037332755,0.0014842522,0.0009305285,0.0004374743,0.0000017001466,0.00023631794,0.0993314],"genre_scores_gemma":[0.91373575,0.000051743416,0.08611162,0.00004326895,0.0000016379759,0.000010958994,1.8689999e-8,0.0000016463649,0.000043380824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987355,0.00004906346,0.00034614664,0.00027564834,0.00034752625,0.00024614745],"domain_scores_gemma":[0.9992949,0.00026110036,0.00009011143,0.00025204278,0.000059267182,0.000042628297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011591001,0.000092740316,0.00024674434,0.000111299196,0.00010798697,0.000017938022,0.00071200286,0.000022980845,0.000014997434],"category_scores_gemma":[0.00034883668,0.000056537847,0.000047142534,0.0008069679,0.001330282,0.00018116491,0.000328475,0.00005575276,0.000017240665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013094401,0.00011207804,0.0007870347,0.00003667509,0.000008123848,0.000004593074,0.0076968563,0.000005239358,0.00012649788,0.99032104,0.000097965705,0.0008025589],"study_design_scores_gemma":[0.00009194754,0.00013543885,0.0004223922,0.00012598345,0.0000031716697,0.000003786219,0.0018066191,0.0036503912,0.0010669635,0.9925871,0.00002140769,0.00008482117],"about_ca_topic_score_codex":0.000012684834,"about_ca_topic_score_gemma":0.000021839867,"teacher_disagreement_score":0.09928802,"about_ca_system_score_codex":0.000009707315,"about_ca_system_score_gemma":0.000022576489,"threshold_uncertainty_score":0.49014795},"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":"W1930124199","doi":"10.26493/1855-3974.196.0df","title":"Gray code numbers for graphs","year":2011,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Gray code; Vertex (graph theory); Graph; Discrete mathematics; Algorithm","score_opus":0.06167349681544703,"score_gpt":0.25360880754050263,"score_spread":0.1919353107250556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1930124199","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.072757706,0.00039517746,0.8319501,0.002199378,0.0012108904,0.0020647326,0.000027562708,0.0016675723,0.08772683],"genre_scores_gemma":[0.8024287,0.0000055270043,0.1964199,0.00044483703,0.000002420175,0.000102389706,0.0000029583748,0.000020728803,0.00057252974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985141,0.000043583437,0.00044096063,0.00041636362,0.00023248617,0.000352494],"domain_scores_gemma":[0.99851334,0.00019104584,0.00018223401,0.00080387405,0.00014995236,0.00015954355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068623974,0.00020127722,0.0003039095,0.00012508541,0.00015282625,0.00007176751,0.00077104714,0.00007480984,0.000031504605],"category_scores_gemma":[0.00009675308,0.00016546999,0.00018614116,0.00028106073,0.00010430534,0.000289905,0.000089848094,0.000084712345,0.00014241696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010320712,0.00013992519,0.00013948104,0.00007212693,0.000040265004,0.00000762718,0.0026556903,5.3103656e-7,0.00062796916,0.99111956,0.0045710145,0.0006154693],"study_design_scores_gemma":[0.0007114709,0.00011456936,0.000025374455,0.000067086185,0.000017135257,0.000022218646,0.00008673798,0.0032189228,0.0033926764,0.99082214,0.0012720418,0.00024962082],"about_ca_topic_score_codex":0.000035444285,"about_ca_topic_score_gemma":0.00001105392,"teacher_disagreement_score":0.729671,"about_ca_system_score_codex":0.000008255348,"about_ca_system_score_gemma":0.00004161703,"threshold_uncertainty_score":0.674767},"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":"W1945551230","doi":"10.37236/292","title":"Distinguishing Number of Countable Homogeneous Relational Structures","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; University of Calgary","keywords":"Mathematics; Countable set; Combinatorics; Conjecture; Homogeneous; Automorphism; Discrete mathematics; Graph","score_opus":0.006701448224600764,"score_gpt":0.2318128234633887,"score_spread":0.22511137523878794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1945551230","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9648225,0.0012988043,0.030132381,0.00066575024,0.0016803857,0.00005791158,8.5612675e-7,0.000023973726,0.001317467],"genre_scores_gemma":[0.9981672,0.000057822035,0.0015913494,0.000046473517,0.000023950262,4.1468635e-7,3.5561334e-7,0.000007460197,0.000104953164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986407,0.000059284386,0.00039023056,0.00009475555,0.0005109536,0.00030406172],"domain_scores_gemma":[0.99836963,0.00024028566,0.0005168139,0.00031301906,0.0005049644,0.000055275625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012385081,0.00009536582,0.00017583364,0.000059239414,0.00016226161,0.000054421478,0.00086637656,0.00005940138,0.000016035774],"category_scores_gemma":[0.00022878265,0.000063166255,0.00009031953,0.00037035602,0.00007035836,0.00018675468,0.00008521117,0.00081985065,0.0000033684469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006322467,0.00003864701,0.0013682777,0.0000036575057,0.000030555468,0.0000029951816,0.00015020205,0.00023067291,0.0020083913,0.9956789,0.00026686655,0.00021449378],"study_design_scores_gemma":[0.00033391867,0.000092620554,0.000391121,0.0000100357565,0.000018349538,0.00063946866,0.000009163704,0.001428669,0.002688952,0.99230236,0.0020115431,0.0000737824],"about_ca_topic_score_codex":0.000017393955,"about_ca_topic_score_gemma":0.0000053728513,"teacher_disagreement_score":0.033344753,"about_ca_system_score_codex":0.000042459178,"about_ca_system_score_gemma":0.00042281995,"threshold_uncertainty_score":0.35618886},"labels":[],"label_agreement":null},{"id":"W1949222424","doi":"","title":"Enumerating super edge-magic labelings for some types of path-like trees","year":2010,"lang":"en","type":"article","venue":"Utilitas Mathematica","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; Corollary; MAGIC (telescope); Kronecker product; Path (computing); Enhanced Data Rates for GSM Evolution; Type (biology); Discrete mathematics; Kronecker delta; Artificial intelligence; Computer science","score_opus":0.01528467967349586,"score_gpt":0.24755962807965387,"score_spread":0.232274948406158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1949222424","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91446406,0.0016490697,0.07529418,0.00200697,0.0018374942,0.0010536625,0.000040196835,0.0005961224,0.0030582573],"genre_scores_gemma":[0.7582064,0.0000052511004,0.24122235,0.00018415175,0.000018000592,0.000028683733,0.0000031721463,0.000015895068,0.00031608169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862885,0.000027100781,0.00045378355,0.0003397945,0.0002456048,0.00030487138],"domain_scores_gemma":[0.9984147,0.00046278923,0.00012893131,0.0007135897,0.00018544895,0.00009457313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072964194,0.00016722699,0.00030019032,0.00010059806,0.00012167193,0.00007089484,0.000558052,0.00007631178,0.00005774984],"category_scores_gemma":[0.00041067082,0.00013304768,0.00012999336,0.00019481749,0.00010685255,0.00027787348,0.00013926344,0.00015144849,0.00007259295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043608984,0.00019042249,0.000052982283,0.00021960874,0.00003104548,0.0000013639047,0.0018800391,0.000008335254,0.060258813,0.93072146,0.0019033684,0.004728197],"study_design_scores_gemma":[0.00051692943,0.00015649825,0.000048997055,0.0001273298,0.00003548962,0.000015512192,0.000103020284,0.100045264,0.019321634,0.87733096,0.00202383,0.0002745517],"about_ca_topic_score_codex":0.000009694844,"about_ca_topic_score_gemma":0.000004866153,"teacher_disagreement_score":0.16592817,"about_ca_system_score_codex":0.0000044910735,"about_ca_system_score_gemma":0.00005261658,"threshold_uncertainty_score":0.54255265},"labels":[],"label_agreement":null},{"id":"W1965786138","doi":"10.1002/(sici)1097-0118(200004)33:4<246::aid-jgt6>3.0.co;2-6","title":"A characterization of Zm-well-covered graphs of girth 6 or more","year":2000,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Combinatorics; Mathematics; Odd graph; Discrete mathematics; Girth (graph theory); Modulo; Chordal graph; Characterization (materials science); Indifference graph; Triangle-free graph; Metric dimension; Graph; 1-planar graph","score_opus":0.009007229496477588,"score_gpt":0.22273383895900156,"score_spread":0.21372660946252398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965786138","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9912965,0.0002501452,0.007497385,0.00016965061,0.00024011858,0.00007478289,0.000006093397,0.000017926126,0.0004473569],"genre_scores_gemma":[0.9956824,0.00042186244,0.003392746,0.00020892269,0.000009542851,8.257034e-7,0.0000014516439,0.000009434591,0.00027281928],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983557,0.00017359137,0.0007520911,0.00014130729,0.000414082,0.00016325069],"domain_scores_gemma":[0.9983612,0.0001130496,0.00076376164,0.00035488186,0.00031456354,0.000092570524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001029409,0.00012695948,0.0003521106,0.00047201655,0.000051816485,0.000024011199,0.0005922343,0.000069642534,0.00021447946],"category_scores_gemma":[0.00003719413,0.00008777947,0.0002577913,0.0007364986,0.0001468065,0.0004103447,0.000035773155,0.00015214387,0.000004841051],"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.0015048868,0.00082920905,0.0020376265,0.0001557514,0.00035135588,0.00006559109,0.0037925856,0.00044625238,0.5271286,0.40720874,0.00041299622,0.05606641],"study_design_scores_gemma":[0.0027577723,0.0015528959,0.015647372,0.00060407387,0.000114989816,0.0003444025,0.0001509684,0.0009043312,0.1426384,0.8339959,0.0009134224,0.00037550647],"about_ca_topic_score_codex":0.0000044141843,"about_ca_topic_score_gemma":5.012061e-7,"teacher_disagreement_score":0.42678714,"about_ca_system_score_codex":0.0000059734525,"about_ca_system_score_gemma":0.000084413914,"threshold_uncertainty_score":0.3579543},"labels":[],"label_agreement":null},{"id":"W1966038695","doi":"","title":"L(2,1)-labelling of graphs","year":2008,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Labelling; Graph; Mathematics; Conjecture; Bound graph; Discrete mathematics; Span (engineering); Graph power; Line graph","score_opus":0.015187588083879334,"score_gpt":0.20268542096497613,"score_spread":0.1874978328810968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966038695","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.47611043,0.0011504848,0.49194393,0.0041551082,0.00016150759,0.00015246935,0.0000031372226,0.00034482457,0.025978118],"genre_scores_gemma":[0.82876617,0.00026093866,0.16942704,0.000092538474,0.0000012077014,0.0000064632973,0.000007980372,0.0000103541615,0.0014273196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99734604,0.0012539558,0.00038164953,0.0004101029,0.00035600128,0.0002522558],"domain_scores_gemma":[0.9962896,0.00064228836,0.00023767978,0.0014058559,0.0012962541,0.00012830507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002564009,0.00013997745,0.00019506221,0.0001920754,0.0003357291,0.0000794698,0.0011022714,0.000074106385,0.000022696388],"category_scores_gemma":[0.00039655893,0.00013901971,0.0001186307,0.0008514803,0.00023601916,0.00030287553,0.00031785102,0.00015793879,0.000032371285],"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.000002056753,0.0002931607,0.0023834533,0.000020516074,0.000019914543,0.0000055377336,0.0050404626,0.000048970644,0.015228484,0.9638909,0.0006230193,0.0124435155],"study_design_scores_gemma":[0.0017111984,0.0000021478195,0.006254431,0.0009375537,0.000024959058,0.0001250889,0.00009659515,0.08702241,0.71820456,0.17744774,0.0073832264,0.00079009536],"about_ca_topic_score_codex":0.00030747568,"about_ca_topic_score_gemma":0.000050141054,"teacher_disagreement_score":0.7864432,"about_ca_system_score_codex":0.000012530391,"about_ca_system_score_gemma":0.00009804264,"threshold_uncertainty_score":0.566906},"labels":[],"label_agreement":null},{"id":"W1966311297","doi":"10.1006/jctb.2001.2094","title":"Disjoint Cycles in Eulerian Digraphs and the Diameter of Interchange Graphs","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Digraph; Combinatorics; Eulerian path; Disjoint sets; Vertex (graph theory); Mathematics; Partition (number theory); Bipartite graph; Upper and lower bounds; Graph; Discrete mathematics; Lagrangian","score_opus":0.012725503802215814,"score_gpt":0.2055984673701304,"score_spread":0.19287296356791458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966311297","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98062885,0.00543394,0.0028115595,0.0035184543,0.0059431326,0.00024593962,0.000002418142,0.000031149088,0.0013845556],"genre_scores_gemma":[0.99804974,0.00053832715,0.0012523034,0.00010071998,0.000023480125,0.0000027355404,7.747126e-8,0.00000686508,0.00002577187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838495,0.00046777973,0.0005790758,0.00012652767,0.0002713078,0.00017036458],"domain_scores_gemma":[0.9986507,0.0004403875,0.00040744455,0.00028896503,0.00013787462,0.00007458625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019259518,0.00012900861,0.00037750846,0.0002766453,0.000067599685,0.00008557836,0.00055603683,0.00005603366,0.000018408015],"category_scores_gemma":[0.00023702695,0.00007733673,0.00015888525,0.0004037928,0.0005124922,0.0005292039,0.0001304294,0.00023858252,8.6464206e-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.00026143863,0.00009536921,0.00040661203,0.000012328655,0.000036944028,0.0000114230725,0.0041635954,0.0000039926963,0.0004929299,0.99105287,0.000114505565,0.0033480078],"study_design_scores_gemma":[0.0023867341,0.0003782332,0.0005468276,0.00010600241,0.000013840758,0.000062786225,0.00026829718,0.00011019795,0.001647472,0.9940973,0.00029000358,0.00009228283],"about_ca_topic_score_codex":0.000009933551,"about_ca_topic_score_gemma":0.0000032829266,"teacher_disagreement_score":0.017420867,"about_ca_system_score_codex":0.0000091628945,"about_ca_system_score_gemma":0.000011909875,"threshold_uncertainty_score":0.31537002},"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":"W1969856863","doi":"10.1137/120898528","title":"On the Maximum Density of Graphs with Unique-Path Labelings","year":2013,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Edge-graceful labeling; Vertex (graph theory); Lemma (botany); Path graph; Path (computing); Graph labeling; Graph; Discrete mathematics; Induced path; Upper and lower bounds; Simple graph; Longest path problem; Graph power; Shortest path problem; Line graph; Computer science","score_opus":0.011614582477812458,"score_gpt":0.21200822000759925,"score_spread":0.20039363752978678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969856863","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9280582,0.00005604411,0.06374734,0.0041840784,0.00013919368,0.00033932488,0.0000018215804,0.00008580936,0.0033882135],"genre_scores_gemma":[0.92576635,0.000035188197,0.073079675,0.00091224536,0.000006152798,0.00000786932,3.9423918e-7,0.000020352629,0.00017176103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823433,0.00010560614,0.00045752875,0.00020517033,0.0006956763,0.0003016824],"domain_scores_gemma":[0.99795276,0.00037183327,0.00047523054,0.0007184821,0.00032416967,0.00015755022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084237236,0.00021707898,0.00028391992,0.00015396473,0.0002605485,0.00023716156,0.0008245114,0.00006083285,0.00004740983],"category_scores_gemma":[0.00012861557,0.00010661581,0.00012984067,0.00041538067,0.00013077717,0.00021080615,0.00010261635,0.00044674744,0.00008228142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010074937,0.00016830975,0.00008259999,0.00003892644,0.000057804973,0.00001570071,0.0010749439,0.00017442662,0.0010740618,0.99400973,0.0027606383,0.0005327913],"study_design_scores_gemma":[0.00034190857,0.0006397748,0.0001367165,0.00051527016,0.000019193936,0.0001518308,0.00020053411,0.010649684,0.004168018,0.98294735,0.00004553275,0.00018421355],"about_ca_topic_score_codex":0.000011447287,"about_ca_topic_score_gemma":0.000001321061,"teacher_disagreement_score":0.011062398,"about_ca_system_score_codex":0.000017890787,"about_ca_system_score_gemma":0.000054294323,"threshold_uncertainty_score":0.43476665},"labels":[],"label_agreement":null},{"id":"W1973204071","doi":"10.1016/j.tcs.2014.04.019","title":"Locating a backtracking robber on a tree","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"","keywords":"Vertex (graph theory); Backtracking; Combinatorics; Graph; Mathematics; Game tree; Computer science; Algorithm; Mathematical economics; Game theory; Sequential game","score_opus":0.009239208138844948,"score_gpt":0.23010799290770806,"score_spread":0.22086878476886312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973204071","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.041456748,0.000009897694,0.9407775,0.0015992159,0.00059797225,0.00008951885,1.3342795e-7,0.00035687373,0.015112184],"genre_scores_gemma":[0.7988077,4.4197463e-7,0.19909456,0.0020395217,0.00003742413,0.000003602315,1.7524292e-7,0.000007071367,0.000009515058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728096,0.0001381213,0.00028057268,0.00086562906,0.000784008,0.0006507151],"domain_scores_gemma":[0.9979786,0.0003992389,0.00007462383,0.0010619531,0.0001805546,0.00030501225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025126624,0.00019333606,0.00019230334,0.00023398336,0.00053513877,0.0005558438,0.0021522448,0.000048353213,0.000016684457],"category_scores_gemma":[0.00020854529,0.00014925849,0.00006718692,0.0012770424,0.001520595,0.0004129217,0.0007086035,0.00023787572,0.00027917072],"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.0000022610484,0.000041098276,0.000023452418,0.000003626427,0.0000011971699,0.0000023527991,0.00018498246,0.00079463,0.0007555119,0.8832781,0.000038104736,0.1148747],"study_design_scores_gemma":[0.00016271793,0.0002178245,0.00022019437,0.000042669835,0.0000016820464,0.000015699346,0.000001437131,0.6156619,0.003490983,0.37993878,0.00008202313,0.00016407088],"about_ca_topic_score_codex":0.0000029690325,"about_ca_topic_score_gemma":4.7986794e-7,"teacher_disagreement_score":0.7573509,"about_ca_system_score_codex":0.000030551455,"about_ca_system_score_gemma":0.00006223509,"threshold_uncertainty_score":0.6086585},"labels":[],"label_agreement":null},{"id":"W1974760523","doi":"10.5539/mas.v4n10p65","title":"Odd Graceful Labeling of Some New Graphs","year":2010,"lang":"en","type":"article","venue":"Modern Applied Science","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":"Tensor product; Combinatorics; Enhanced Data Rates for GSM Evolution; Graph; Computer science; Path (computing); Star (game theory); Mathematics; Discrete mathematics; Computer network; Pure mathematics; Telecommunications","score_opus":0.011115511433945444,"score_gpt":0.22559513829771682,"score_spread":0.21447962686377137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974760523","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55109847,0.00021633311,0.43961856,0.0008142358,0.0014059659,0.0003252023,0.0000018193867,0.0004929011,0.0060264864],"genre_scores_gemma":[0.86118114,0.000005547814,0.13834725,0.0003324886,0.000010056883,0.0000056979993,3.2738626e-7,0.000007739153,0.00010974392],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760514,0.000008754428,0.00031882874,0.00072914147,0.00082629395,0.0005118636],"domain_scores_gemma":[0.9982478,0.000051893985,0.00015538136,0.0010942618,0.00014202541,0.0003086614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010981611,0.00016498787,0.00019980743,0.0003644459,0.00032706282,0.00018476551,0.0021437,0.00007214347,0.000008603579],"category_scores_gemma":[0.0000556498,0.00014455071,0.00005938974,0.0014985615,0.0005791117,0.0005979745,0.00047337852,0.0003000039,0.000048705857],"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.0000016759642,0.000021783884,0.000045796052,0.0000028448167,0.0000012593277,5.096972e-7,0.0002590553,0.00012146559,0.5512445,0.4379552,0.000042428066,0.0103034945],"study_design_scores_gemma":[0.00028098776,0.00003043201,0.00017722356,0.000008654451,0.000003359887,0.0000056801973,0.0000074369627,0.100108854,0.14938833,0.7496143,0.00018098817,0.00019375395],"about_ca_topic_score_codex":0.00005873551,"about_ca_topic_score_gemma":0.000011352638,"teacher_disagreement_score":0.40185615,"about_ca_system_score_codex":0.0000095590985,"about_ca_system_score_gemma":0.00035419335,"threshold_uncertainty_score":0.5894607},"labels":[],"label_agreement":null},{"id":"W1974864886","doi":"10.5539/mas.v4n7p82","title":"Strongly Multiplicative Labeling for Some Cycle Related Graphs","year":2010,"lang":"en","type":"article","venue":"Modern Applied Science","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":"Multiplicative function; Combinatorics; Mathematics; Chord (peer-to-peer); Chordal graph; Discrete mathematics; Graph; Computer science","score_opus":0.011193354057006506,"score_gpt":0.2426508149321898,"score_spread":0.2314574608751833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974864886","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.47911453,0.00008911533,0.5149203,0.00065884704,0.00087119325,0.0008619829,0.000007605037,0.00075373816,0.002722716],"genre_scores_gemma":[0.8554726,0.0000024344213,0.14410676,0.00020991733,0.0000066795237,0.000105218955,0.0000016496645,0.000012297957,0.00008239031],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748904,0.000010070317,0.00030934607,0.0010173294,0.00051819225,0.00065605144],"domain_scores_gemma":[0.99827427,0.000121862104,0.00015038563,0.0010084247,0.00019732995,0.00024774217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012534267,0.00019180684,0.00018217984,0.00026993925,0.00082426,0.00027889814,0.0018743887,0.00007904492,0.000003041619],"category_scores_gemma":[0.00008871175,0.00017122137,0.000069355636,0.0010495321,0.0006243416,0.0006440523,0.00036034733,0.00033004873,0.00005026866],"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.0000025515226,0.000033175806,0.000018019118,0.0000024427736,0.0000025308373,2.979295e-7,0.00032980353,0.0006177145,0.51539147,0.47501117,0.000014576309,0.008576247],"study_design_scores_gemma":[0.00037703707,0.000021023152,0.00010076268,0.000003881551,0.0000028510358,0.0000029699802,0.000010302484,0.49156037,0.03771092,0.46995038,0.00009382587,0.00016565215],"about_ca_topic_score_codex":0.000012632242,"about_ca_topic_score_gemma":0.000005452217,"teacher_disagreement_score":0.49094266,"about_ca_system_score_codex":0.000021301472,"about_ca_system_score_gemma":0.00016800594,"threshold_uncertainty_score":0.6982205},"labels":[],"label_agreement":null},{"id":"W1979685415","doi":"10.1016/j.disc.2012.04.009","title":"An improved bound on parity vertex colourings of outerplane graphs","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; St. Francis Xavier University","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Bipartite graph; Parity (physics); Chromatic scale; Upper and lower bounds; Graph; Discrete mathematics; Physics","score_opus":0.01660307506976808,"score_gpt":0.261172423748193,"score_spread":0.24456934867842492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979685415","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97479117,0.00010171446,0.022443682,0.00013355154,0.0004083242,0.00022023114,0.000011310362,0.0001842977,0.0017056975],"genre_scores_gemma":[0.9474471,0.0000063154107,0.052324463,0.00014390518,0.0000054336415,0.00000792152,0.000005584439,0.000012026657,0.000047240817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988179,0.000041591127,0.0003282629,0.00020458561,0.00027113367,0.00033648685],"domain_scores_gemma":[0.99866825,0.00010290039,0.0001881717,0.0008013363,0.00006051868,0.00017881005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053825177,0.00015809858,0.00024781912,0.000096652475,0.000093851886,0.000076863565,0.0005418186,0.00007303488,0.000009347546],"category_scores_gemma":[0.00004850527,0.00012494685,0.00008040326,0.00020215542,0.00007334452,0.00032087695,0.000101162615,0.00011550245,0.000029642177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011994921,0.0007012257,0.0013547994,0.00017248644,0.000040123945,0.0000017833374,0.004740905,0.00001753616,0.010187263,0.9814006,0.00048898923,0.00088229496],"study_design_scores_gemma":[0.0012821081,0.0014319681,0.0028018055,0.00029632944,0.00008050858,0.000037730886,0.00044083016,0.1745511,0.0431955,0.7746369,0.00036831756,0.00087688304],"about_ca_topic_score_codex":0.00002136619,"about_ca_topic_score_gemma":0.0000025771265,"teacher_disagreement_score":0.20676368,"about_ca_system_score_codex":0.000010361084,"about_ca_system_score_gemma":0.000017786419,"threshold_uncertainty_score":0.50951844},"labels":[],"label_agreement":null},{"id":"W1983401788","doi":"10.1016/j.ejc.2010.08.002","title":"Vertex-coloring 2-edge-weighting of graphs","year":2010,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Nankai University","keywords":"Combinatorics; Mathematics; Edge coloring; Bipartite graph; Vertex (graph theory); Weighting; Discrete mathematics; Complete coloring; Graph coloring; Fractional coloring; Edge cover; Graph; Graph power; Line graph; Physics","score_opus":0.00992254455779144,"score_gpt":0.20449213558362553,"score_spread":0.1945695910258341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983401788","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9762799,0.00030780255,0.008919479,0.0002402712,0.0051071546,0.000038647617,2.6150056e-7,0.000046307086,0.009060155],"genre_scores_gemma":[0.98994195,0.000034298846,0.009887708,0.000055588476,0.000014314698,1.205235e-7,1.021101e-7,0.000015515938,0.000050380295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838316,0.00018597723,0.0006523269,0.00014431203,0.0004253886,0.0002088404],"domain_scores_gemma":[0.9980981,0.00012794099,0.000660483,0.00039586725,0.00054775213,0.00016989418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021188764,0.00012317383,0.00023593844,0.00028959467,0.00010671212,0.000073610834,0.0011222134,0.000026904727,0.0000052420996],"category_scores_gemma":[0.00024477887,0.00010335786,0.00015258227,0.00061000825,0.0000637044,0.00033792804,0.00019720769,0.000555515,0.00001489643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007699593,0.00017064906,0.002979332,0.000019997096,0.000032699634,0.00017693157,0.000493783,0.00004314332,0.03176776,0.9551285,0.001021921,0.008157575],"study_design_scores_gemma":[0.0050064162,0.002291063,0.020683726,0.00046095334,0.00008625041,0.00096636434,0.000103378996,0.0038304813,0.06816186,0.8789701,0.018595144,0.00084430043],"about_ca_topic_score_codex":9.2056507e-7,"about_ca_topic_score_gemma":1.4758673e-7,"teacher_disagreement_score":0.07615845,"about_ca_system_score_codex":0.000008458482,"about_ca_system_score_gemma":0.00006210604,"threshold_uncertainty_score":0.42148113},"labels":[],"label_agreement":null},{"id":"W1984405480","doi":"10.1016/j.disc.2012.07.029","title":"Locating a robber on a graph","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"Environment and Climate Change Canada","keywords":"Vertex (graph theory); Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.023369833768689657,"score_gpt":0.25447043938538544,"score_spread":0.2311006056166958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984405480","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.146564,0.00056136405,0.8082233,0.0012344863,0.0008009101,0.00035636398,0.0000028708364,0.00076011923,0.04149655],"genre_scores_gemma":[0.8260798,0.0000029737982,0.1732564,0.0003940694,0.000013992575,0.000013601607,0.0000012443898,0.0000126924815,0.00022527922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894685,0.000026945261,0.00022614464,0.0001691895,0.00027333625,0.0003575113],"domain_scores_gemma":[0.9990286,0.000102438156,0.00009831532,0.0005956338,0.000038634324,0.00013636042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043377563,0.00013506346,0.0001416572,0.000092952374,0.0001168004,0.00008603805,0.00037477782,0.00004357546,0.0000131375655],"category_scores_gemma":[0.00007455305,0.00010166155,0.00007499381,0.00032576473,0.000032945783,0.00022674135,0.0001269611,0.00010769982,0.00030199895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.7735554e-7,0.00011797749,0.00014865014,0.000043289696,0.0000106285215,0.0000010742448,0.0028232893,0.000074949254,0.00036869885,0.9943434,0.0006619678,0.001405478],"study_design_scores_gemma":[0.0006836453,0.00018892794,0.00033211353,0.00037169896,0.000041552084,0.00006755015,0.0005706929,0.10262237,0.008423372,0.8841818,0.0016419867,0.0008743133],"about_ca_topic_score_codex":0.000003694123,"about_ca_topic_score_gemma":3.6120784e-7,"teacher_disagreement_score":0.6795158,"about_ca_system_score_codex":0.00000996182,"about_ca_system_score_gemma":0.000010777805,"threshold_uncertainty_score":0.41456375},"labels":[],"label_agreement":null},{"id":"W1986410747","doi":"10.1145/1247069.1247098","title":"There are not too many magic configurations","year":2007,"lang":"en","type":"article","venue":"","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; MAGIC (telescope); Physics; Astronomy","score_opus":0.02135952498607583,"score_gpt":0.24482495748904037,"score_spread":0.22346543250296455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986410747","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.06743538,0.00016730961,0.75259066,0.007629834,0.00052759517,0.00014134821,0.0000014621118,0.00057465665,0.17093179],"genre_scores_gemma":[0.96480733,0.000004206395,0.024074947,0.0033326366,0.0000073628553,0.0000014436549,8.752101e-7,0.0000041529356,0.007767024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922895,0.000014074347,0.00016375756,0.00021636266,0.00017073336,0.00020611659],"domain_scores_gemma":[0.9993238,0.000058561098,0.000048146245,0.0003928946,0.00009269952,0.00008389226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031072283,0.00007632731,0.00007395108,0.000073463954,0.00010641991,0.00010333492,0.0003258988,0.00003993684,0.000120011995],"category_scores_gemma":[0.00001568822,0.000058779096,0.000039764363,0.0002487975,0.000028435776,0.00016962203,0.000060042534,0.00007421656,0.000525116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013603371,0.00003506261,0.00036258157,0.0000024735464,0.0000047197345,0.000016634905,0.000097251264,0.000022419239,0.004976153,0.9830961,0.007382575,0.004002665],"study_design_scores_gemma":[0.0026598184,0.0003592526,0.13240659,0.00011885619,0.000032811102,0.00019677581,0.0010060371,0.06729271,0.17958722,0.48473448,0.12977333,0.0018321373],"about_ca_topic_score_codex":0.00003696511,"about_ca_topic_score_gemma":0.000025839741,"teacher_disagreement_score":0.89737195,"about_ca_system_score_codex":0.0000074676796,"about_ca_system_score_gemma":0.000018022412,"threshold_uncertainty_score":0.6749479},"labels":[],"label_agreement":null},{"id":"W1988315105","doi":"10.5539/jmr.v3n1p66","title":"Some Results on Prime and k-Prime Labeling","year":2011,"lang":"en","type":"article","venue":"Journal of Mathematics Research","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":"Mathematics; Combinatorics; Prime (order theory); Graph labeling; Graph; Edge-graceful labeling; Prime number; Discrete mathematics; Graph power; Line graph","score_opus":0.19796065877364089,"score_gpt":0.3612184441609494,"score_spread":0.1632577853873085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988315105","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96301115,0.003195858,0.016763644,0.004208927,0.00081603153,0.0004535452,0.0000038214134,0.00010960902,0.0114374105],"genre_scores_gemma":[0.6889279,0.00040687682,0.30995736,0.00010377279,0.000056376088,0.0000019607885,1.4674869e-7,0.000018327395,0.0005272778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997689,0.0001596676,0.00058825384,0.00017847151,0.0010593137,0.000325265],"domain_scores_gemma":[0.99790037,0.0005603174,0.00026777387,0.000469056,0.00059422845,0.00020824072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00664033,0.000097599055,0.000222919,0.0005329726,0.00015683802,0.00013479235,0.0007595641,0.00006753899,0.000005377693],"category_scores_gemma":[0.0008639945,0.000068391055,0.000058028592,0.00033523477,0.00010354988,0.0003207974,0.00027871257,0.0005772793,0.000059036993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017231079,0.0018440621,0.000098059085,0.0001963664,0.00015262792,0.00035723313,0.020000132,0.00003584048,0.036834747,0.91557467,0.007255639,0.017478326],"study_design_scores_gemma":[0.0013886984,0.0014135813,0.0001813572,0.0006176702,0.000009731368,0.0002617488,0.00029960411,0.011329452,0.05639643,0.927521,0.0003972513,0.00018351385],"about_ca_topic_score_codex":0.000010286723,"about_ca_topic_score_gemma":4.7147591e-7,"teacher_disagreement_score":0.2931937,"about_ca_system_score_codex":0.000026333346,"about_ca_system_score_gemma":0.000115913506,"threshold_uncertainty_score":0.27889064},"labels":[],"label_agreement":null},{"id":"W1990401792","doi":"10.1016/j.dam.2007.05.052","title":"Fractionally total colouring <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>G</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:math>","year":2007,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","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":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Graph; Mathematics; Algorithm; Combinatorics","score_opus":0.01713641632784357,"score_gpt":0.23797400099233587,"score_spread":0.2208375846644923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990401792","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.46030232,0.0011700595,0.0087966,0.00075177726,0.0034171387,0.00009491957,0.0002374489,0.0005326474,0.52469707],"genre_scores_gemma":[0.96926033,0.0008666559,0.02220594,0.0023171902,0.001622735,0.0013185024,0.000815433,0.0011211913,0.00047204024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98476404,0.00037626323,0.00333334,0.0029032032,0.0046596797,0.0039634593],"domain_scores_gemma":[0.98750395,0.0028791968,0.0035781786,0.0037569667,0.0003549702,0.0019267626],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.0043015755,0.0014585884,0.00061727356,0.0009884784,0.002922515,0.0028837454,0.003816297,0.0032346079,0.25262],"category_scores_gemma":[0.0016897413,0.002810938,0.0024848403,0.002218244,0.0021500823,0.001969343,0.0037415796,0.0027660131,0.004555724],"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.0010289277,0.00059007015,0.000009438059,0.0018543417,0.0018183298,0.001260406,0.0039371634,0.0039771767,0.0066071944,0.7389287,0.23775174,0.0022365476],"study_design_scores_gemma":[0.0028213854,0.001632025,0.00006156602,0.0019045197,0.0017634357,0.0021283706,0.003232986,0.060989425,0.9146926,0.005670992,0.002304513,0.0027982092],"about_ca_topic_score_codex":0.0012402483,"about_ca_topic_score_gemma":0.000868019,"teacher_disagreement_score":0.9080854,"about_ca_system_score_codex":0.000034656667,"about_ca_system_score_gemma":0.0020922206,"threshold_uncertainty_score":0.99981636},"labels":[],"label_agreement":null},{"id":"W1994013009","doi":"10.1016/j.disc.2010.05.022","title":"On a construction of graphs with high chromatic capacity and large girth","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Combinatorics; Mathematics; Chromatic scale; Integer (computer science); Graph; Discrete mathematics; Girth (graph theory); Edge coloring; Enhanced Data Rates for GSM Evolution; Graph power; Computer science; Line graph","score_opus":0.006859558722335785,"score_gpt":0.1984460313042129,"score_spread":0.1915864725818771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994013009","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9372579,0.0000072769126,0.061814576,0.00010177369,0.00010083718,0.00011954364,0.0000073101687,0.00006994333,0.00052087166],"genre_scores_gemma":[0.72895575,0.0000019463407,0.27099127,0.000029801186,0.0000013430762,0.000004173855,0.0000010233899,0.0000055543096,0.000009162481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992187,0.000017113769,0.00020467174,0.00018166854,0.00022799252,0.00014984058],"domain_scores_gemma":[0.9991724,0.00009332208,0.00016009391,0.00044401528,0.00006383603,0.000066340115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023005607,0.000115685754,0.00018999333,0.0000944205,0.00008336746,0.000047581238,0.00017884542,0.0000495359,0.000009054126],"category_scores_gemma":[0.000047026373,0.00007852381,0.000029318042,0.00021375506,0.00016737074,0.00011428898,0.000053822903,0.00013747688,0.000004711021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001898282,0.000057810263,0.0002172465,0.000111320485,0.000014221939,0.0000010752826,0.0007713322,0.000004260898,0.0023546543,0.99624646,0.0000175818,0.00020211295],"study_design_scores_gemma":[0.000555463,0.00020601023,0.0004649214,0.00014788366,0.000019570563,0.000062954234,0.00009064184,0.023402667,0.00620507,0.9686771,0.0000106572625,0.00015707052],"about_ca_topic_score_codex":0.000011662634,"about_ca_topic_score_gemma":0.000015375274,"teacher_disagreement_score":0.20917669,"about_ca_system_score_codex":0.0000023484567,"about_ca_system_score_gemma":0.000015286658,"threshold_uncertainty_score":0.3202108},"labels":[],"label_agreement":null},{"id":"W2000477684","doi":"10.1016/j.disc.2010.04.001","title":"Corrigendum to “<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mrow><mml:mo>(</mml:mo><mml:mi>p</mml:mi><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>-total labelling of graphs” [Discrete Math. 308 (2008) 496–513]","year":2010,"lang":"lv","type":"erratum","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of the Fraser Valley","funders":"","keywords":"Scroll; Algorithm; Mathematics; Computer science; Discrete mathematics; Theology; Philosophy","score_opus":0.019285442878727937,"score_gpt":0.23935867092090632,"score_spread":0.22007322804217838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000477684","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88655716,0.0041510607,0.017294127,0.0012300323,0.021548875,0.0005301447,0.0028451595,0.0013320234,0.06451141],"genre_scores_gemma":[0.9456353,0.0022915923,0.037586372,0.0022992932,0.0026638855,0.0018613411,0.0030053903,0.0020818515,0.0025749644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97811234,0.0007148822,0.005344256,0.0045208945,0.0061985357,0.0051091197],"domain_scores_gemma":[0.9830385,0.002138697,0.005853051,0.0053878855,0.00090953376,0.0026723645],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.004766032,0.0028827237,0.0016332867,0.0015761418,0.0033018056,0.003420941,0.0063884933,0.0055607525,0.0068027056],"category_scores_gemma":[0.0027664418,0.0042986404,0.004269808,0.0032169905,0.0030078737,0.0022856386,0.0053332006,0.0053632497,0.0038427599],"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.0007819665,0.0007913517,0.000008386568,0.0038668497,0.0023087654,0.0010904993,0.005694577,0.0022316747,0.004805359,0.8530954,0.12402854,0.00129661],"study_design_scores_gemma":[0.003185493,0.0033441551,0.000024147053,0.006789172,0.0035543526,0.0029218602,0.003035709,0.70473576,0.24366726,0.014474979,0.009284163,0.00498296],"about_ca_topic_score_codex":0.0017522348,"about_ca_topic_score_gemma":0.00072394026,"teacher_disagreement_score":0.8386204,"about_ca_system_score_codex":0.000060694583,"about_ca_system_score_gemma":0.0026101358,"threshold_uncertainty_score":0.9997054},"labels":[],"label_agreement":null},{"id":"W2003367147","doi":"10.1016/j.disc.2007.03.034","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>p</mml:mi><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy=\"false\">)</mml:mo></mml:math>-Total labelling of graphs","year":2007,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of the Fraser Valley","funders":"Centre National de la Recherche Scientifique","keywords":"Conjecture; Combinatorics; Mathematics; Graph; Vertex (graph theory); Discrete mathematics; Algorithm","score_opus":0.019255804216648024,"score_gpt":0.2429960172408542,"score_spread":0.22374021302420619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003367147","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97655267,0.0030747585,0.009106807,0.00056501396,0.0031171287,0.00030721864,0.0008091589,0.0008103389,0.005656907],"genre_scores_gemma":[0.9677074,0.0013410342,0.026787227,0.001079056,0.00083307596,0.00045154226,0.00062504964,0.00094392244,0.00023172448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9820583,0.0005743497,0.0047293385,0.0034071982,0.004952708,0.004278116],"domain_scores_gemma":[0.98631954,0.0027144449,0.0044086296,0.0038809248,0.0007368414,0.0019396316],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.005533184,0.0021583026,0.0013914665,0.0011947406,0.0025087248,0.0024100165,0.00439582,0.0030726616,0.00085314404],"category_scores_gemma":[0.0018068436,0.0030464386,0.0030745869,0.0029407712,0.0024241076,0.0020241446,0.0034313458,0.002926781,0.002295562],"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.00060341705,0.0010940891,0.00003512239,0.002775506,0.0019777762,0.0008466803,0.007583351,0.0037054333,0.004990359,0.96510893,0.007892749,0.0033866146],"study_design_scores_gemma":[0.0035950667,0.0027364546,0.000032480108,0.0046009375,0.0024167309,0.0016130528,0.005116016,0.58222437,0.2529734,0.13962606,0.001429296,0.0036361318],"about_ca_topic_score_codex":0.0013150603,"about_ca_topic_score_gemma":0.00043640344,"teacher_disagreement_score":0.82548285,"about_ca_system_score_codex":0.00006967842,"about_ca_system_score_gemma":0.001326131,"threshold_uncertainty_score":0.9993735},"labels":[],"label_agreement":null},{"id":"W2005117665","doi":"10.1007/s00493-007-0041-6","title":"Vertex-Colouring Edge-Weightings","year":2007,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":114,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Neighbourhood (mathematics); Discrete mathematics","score_opus":0.008634628087088286,"score_gpt":0.22095935191402125,"score_spread":0.21232472382693296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005117665","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7437551,0.0022433917,0.14521497,0.0028608039,0.008947708,0.0004003305,5.2492237e-7,0.0024000995,0.09417707],"genre_scores_gemma":[0.99116564,0.000009221741,0.0078364555,0.00041642296,0.00000685636,0.0000033796866,4.570421e-7,0.000010041076,0.0005515236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868006,0.000021815944,0.00023943982,0.0003480694,0.00028127656,0.0004293713],"domain_scores_gemma":[0.99895614,0.00013519112,0.00007741354,0.0005378476,0.00011232729,0.00018107204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064556516,0.00012710868,0.00014084062,0.0001547117,0.00022616789,0.00009031363,0.00072406005,0.00007194352,0.000008732624],"category_scores_gemma":[0.00007169175,0.00011793172,0.0000648182,0.0007090719,0.00003539945,0.00021385311,0.00026866526,0.00017176426,0.00020529258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025732404,0.00010604124,0.0010299677,0.0000076226966,0.000007824154,0.00004204517,0.00025332658,0.0000026244177,0.0013485942,0.97846377,0.0051966324,0.013539008],"study_design_scores_gemma":[0.0011349171,0.00021297201,0.0049430123,0.000051815972,0.000009461482,0.00004318994,0.000023613584,0.0031866224,0.026989497,0.9203276,0.042570584,0.000506721],"about_ca_topic_score_codex":0.000015042737,"about_ca_topic_score_gemma":6.30595e-7,"teacher_disagreement_score":0.24741054,"about_ca_system_score_codex":0.000049280974,"about_ca_system_score_gemma":0.000033571912,"threshold_uncertainty_score":0.48091158},"labels":[],"label_agreement":null},{"id":"W2012559794","doi":"10.5539/jmr.v4n1p54","title":"Some Graceful Graphs","year":2012,"lang":"en","type":"article","venue":"Journal of Mathematics Research","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; Graph; Star (game theory); Tensor product; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.126638544243284,"score_gpt":0.38338410713649784,"score_spread":0.2567455628932138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012559794","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9370061,0.011689498,0.040952634,0.0048675244,0.0019332848,0.0002782594,9.998176e-7,0.00008277431,0.0031888816],"genre_scores_gemma":[0.8384,0.00029294548,0.16076818,0.000077158846,0.00008804954,0.000002393831,8.544606e-8,0.000012467545,0.0003586944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973754,0.00017089152,0.00047437722,0.00008535718,0.0013939553,0.00049999164],"domain_scores_gemma":[0.99792254,0.00049205765,0.00021447439,0.00042105414,0.0006392914,0.00031056826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008050086,0.00008180196,0.00020304741,0.000634281,0.00014986572,0.00014444122,0.0009784411,0.0000573589,0.000016366454],"category_scores_gemma":[0.0004549549,0.00005691762,0.00012223778,0.0006236957,0.00009050005,0.0008616038,0.00024630493,0.00053668604,0.00013511837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002368958,0.000498107,0.00034565126,0.000058675356,0.000030323681,0.000015452595,0.0017843513,0.000011655222,0.0041117575,0.9814385,0.010119205,0.0015839114],"study_design_scores_gemma":[0.0002958193,0.00017267752,0.00019605317,0.00010850978,0.0000056215013,0.00029692423,0.0002474933,0.0019150333,0.0046951068,0.9898975,0.0020746682,0.00009458119],"about_ca_topic_score_codex":0.0000025016225,"about_ca_topic_score_gemma":1.7233532e-7,"teacher_disagreement_score":0.11981555,"about_ca_system_score_codex":0.000029057057,"about_ca_system_score_gemma":0.00008981494,"threshold_uncertainty_score":0.2790015},"labels":[],"label_agreement":null},{"id":"W2013391382","doi":"10.1016/j.disc.2008.12.022","title":"Variable neighborhood search for extremal graphs. 23. On the Randić index and the chromatic number","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Simple graph; Chromatic scale; Connectivity; Edge coloring; Discrete mathematics; Graph power; Line graph","score_opus":0.018016093211178613,"score_gpt":0.24976792240660425,"score_spread":0.23175182919542564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013391382","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.05406484,0.00037813335,0.89715815,0.013220364,0.00024257087,0.0022170078,0.000011414679,0.00026115566,0.032446347],"genre_scores_gemma":[0.96358675,0.000013190221,0.034784134,0.0011216486,0.000011894795,0.000058368314,0.0000023958085,0.000013716261,0.00040792255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859756,0.0000997521,0.00031525784,0.0002686199,0.000385258,0.00033355868],"domain_scores_gemma":[0.9978892,0.0010792575,0.00010941655,0.0007715034,0.000077651894,0.000072976945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013422432,0.00018837377,0.00026358428,0.000048601592,0.0004296976,0.00034476563,0.00065387425,0.000061761624,0.00001929969],"category_scores_gemma":[0.00013749355,0.000089154215,0.00010833763,0.0003709301,0.0001597262,0.00012327074,0.00010522218,0.00017141375,0.00002831357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001816364,0.00005569206,0.000023574796,0.00004095013,0.000025284193,0.0000010353954,0.0015387421,0.000048311373,0.000053873246,0.99703455,0.0007851034,0.00037471938],"study_design_scores_gemma":[0.0011942635,0.000060973325,0.000040845454,0.000081320155,0.000020012214,0.00002420902,0.00016719008,0.2609887,0.00015464815,0.7371075,0.000048385577,0.0001119181],"about_ca_topic_score_codex":0.000006925031,"about_ca_topic_score_gemma":4.8565374e-7,"teacher_disagreement_score":0.9095219,"about_ca_system_score_codex":0.000010425932,"about_ca_system_score_gemma":0.000031481155,"threshold_uncertainty_score":0.36356035},"labels":[],"label_agreement":null},{"id":"W2013432922","doi":"10.5539/mas.v4n8p119","title":"Prime Cordial Labeling For Some Graphs","year":2010,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","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":"Prime (order theory); Combinatorics; Computer science; Graph; Edge-graceful labeling; Mathematics; Line graph","score_opus":0.012991145506071257,"score_gpt":0.2405855064599759,"score_spread":0.22759436095390465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013432922","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.21325256,0.00006376066,0.781141,0.0004890594,0.0018080416,0.00055272074,0.000003676346,0.0005295999,0.0021595892],"genre_scores_gemma":[0.85407794,0.000002200633,0.1451068,0.0006398075,0.000021016598,0.00006261133,9.568357e-7,0.000010028047,0.000078646604],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976884,0.000006772026,0.00024258762,0.00084566185,0.00057674287,0.0006398264],"domain_scores_gemma":[0.9985423,0.00008373163,0.00010040384,0.0008804953,0.00015265522,0.00024040442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013558998,0.00016729937,0.00016683406,0.00026474387,0.0007431231,0.00038776483,0.0018437341,0.0000616726,0.0000032409546],"category_scores_gemma":[0.0000701325,0.0001489727,0.00006541293,0.0008298147,0.0005081991,0.0005646134,0.0003583155,0.0002424049,0.00004443516],"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.000002737238,0.000021923483,0.000014435051,0.000002244892,0.0000011517217,3.4534085e-7,0.00010587459,0.000045969413,0.54643387,0.43844527,0.000036241854,0.01488997],"study_design_scores_gemma":[0.00036246786,0.00002917197,0.000065524575,0.0000035758048,0.0000030704311,0.0000050835374,0.0000032856526,0.28707427,0.103594124,0.60816556,0.000486123,0.0002076971],"about_ca_topic_score_codex":0.000010944269,"about_ca_topic_score_gemma":0.0000054822563,"teacher_disagreement_score":0.6408254,"about_ca_system_score_codex":0.000014123758,"about_ca_system_score_gemma":0.0002505089,"threshold_uncertainty_score":0.60749304},"labels":[],"label_agreement":null},{"id":"W2014803743","doi":"10.1016/j.aam.2014.08.002","title":"When does a biased graph come from a group labelling?","year":2014,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Discrete mathematics; Graph","score_opus":0.00893912167333614,"score_gpt":0.2256887496741622,"score_spread":0.21674962800082606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014803743","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.03380158,0.0006613043,0.9581499,0.00020420774,0.00038650964,0.00029950432,0.000004882641,0.0003895911,0.0061024805],"genre_scores_gemma":[0.39503887,0.000087926266,0.60441023,0.00036820082,0.000011165787,0.00004731239,0.000004745236,0.000014640059,0.000016897262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983953,0.000028037215,0.00046323336,0.0004543519,0.00032907826,0.00032998176],"domain_scores_gemma":[0.9981295,0.0007425189,0.00019935242,0.0008104658,0.000027459679,0.000090744106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005057721,0.00020994271,0.00034522792,0.0001699133,0.00008847297,0.000096714015,0.0008115598,0.00007933564,0.000011412316],"category_scores_gemma":[0.00006527696,0.00015805433,0.000054591008,0.00040839013,0.00009253907,0.00022651194,0.00017427186,0.00017623369,0.000069276764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003845246,0.00018950705,0.00021907537,0.000078841025,0.0000069574676,0.0000021956046,0.0011980274,0.00033329535,0.0017388216,0.98549414,0.00005457088,0.01068073],"study_design_scores_gemma":[0.0006065942,0.000028040095,0.000016347247,0.00010016447,0.000006815784,0.0000010580942,0.000062863575,0.03402706,0.0015387344,0.96043694,0.0029392384,0.00023617003],"about_ca_topic_score_codex":0.00001711,"about_ca_topic_score_gemma":0.000053164276,"teacher_disagreement_score":0.36123732,"about_ca_system_score_codex":0.000014549216,"about_ca_system_score_gemma":0.0000093997505,"threshold_uncertainty_score":0.64452684},"labels":[],"label_agreement":null},{"id":"W2016258894","doi":"10.1016/j.tcs.2010.03.013","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>L</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>-Labelings on the composition of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>n</mml:mi></mml:math> graphs","year":2010,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Combinatorics; Graph; Vertex (graph theory); Mathematics; Degree (music); Discrete mathematics; Physics","score_opus":0.014065416741891294,"score_gpt":0.23569754119939718,"score_spread":0.22163212445750588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016258894","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.952843,0.0013400587,0.01187462,0.002248963,0.007758736,0.00028133512,0.0008900301,0.0009986961,0.021764573],"genre_scores_gemma":[0.96944064,0.0011743187,0.017961545,0.0055402555,0.0023327111,0.0012322976,0.0010530775,0.0011348075,0.0001303448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9739895,0.0013059309,0.004931924,0.0058146915,0.007875321,0.006082671],"domain_scores_gemma":[0.9798998,0.0051372675,0.0045828624,0.0061939135,0.0010359694,0.003150134],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.008894083,0.0027724942,0.0013305056,0.0015057343,0.006011828,0.005289183,0.009308501,0.004266897,0.0055795517],"category_scores_gemma":[0.002926146,0.0038869842,0.0039383704,0.004530299,0.011080155,0.0038880405,0.007891159,0.0055396943,0.0044834036],"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.0022807799,0.0015411968,0.000016585316,0.0013484338,0.0015287184,0.0013399037,0.0034708912,0.005082993,0.014005072,0.94419324,0.021332782,0.003859419],"study_design_scores_gemma":[0.002801857,0.0036637636,0.00006534185,0.0024831062,0.001518379,0.0022979497,0.00068125397,0.6588201,0.31135747,0.011806094,0.0017380276,0.0027666679],"about_ca_topic_score_codex":0.0015795929,"about_ca_topic_score_gemma":0.0004738375,"teacher_disagreement_score":0.9323871,"about_ca_system_score_codex":0.00007508569,"about_ca_system_score_gemma":0.0031116586,"threshold_uncertainty_score":0.99850076},"labels":[],"label_agreement":null},{"id":"W2017914065","doi":"10.1016/j.dam.2005.04.001","title":"On the b-dominating coloring of graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Bipartite graph; Vertex (graph theory); Edge coloring; Chromatic scale; Graph; Existential quantification; Perfect graph; Discrete mathematics; Induced subgraph; Graph power; Line graph","score_opus":0.01573717360601393,"score_gpt":0.22825541704617913,"score_spread":0.2125182434401652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017914065","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67163295,0.00008658326,0.23130712,0.0021710938,0.00014606403,0.0006699752,0.0000031889165,0.00030276502,0.09368028],"genre_scores_gemma":[0.84260905,0.0000035352182,0.15708347,0.00022625434,0.0000038086823,0.000026140757,4.2701186e-7,0.0000086258,0.00003869892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990272,0.000011379229,0.00030396876,0.00017738012,0.000292759,0.00018734645],"domain_scores_gemma":[0.9987198,0.0004441704,0.00018300452,0.00057551544,0.00003812863,0.00003934685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051403843,0.000117044816,0.00016281019,0.000069229245,0.00012784265,0.000047517977,0.0005746269,0.000034767236,0.0000111283725],"category_scores_gemma":[0.000059962298,0.000073429546,0.00006487125,0.0002967274,0.00006730016,0.000060669347,0.00014519649,0.0001125998,0.000044449444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013202903,0.000045165056,0.0000014418046,0.000024014696,0.000010132161,2.4765993e-7,0.0012384092,0.00037433702,0.0075293398,0.9883359,0.00022606822,0.0022136397],"study_design_scores_gemma":[0.00024781423,0.00003631361,0.000009042307,0.00007310137,0.000010482456,0.000002390112,0.00026599623,0.06255598,0.053738922,0.8828055,0.00011147983,0.00014297946],"about_ca_topic_score_codex":0.0000012438919,"about_ca_topic_score_gemma":6.931946e-7,"teacher_disagreement_score":0.1709761,"about_ca_system_score_codex":0.000008672863,"about_ca_system_score_gemma":0.0000125241495,"threshold_uncertainty_score":0.29943702},"labels":[],"label_agreement":null},{"id":"W2017934789","doi":"10.1007/s11464-008-0041-x","title":"On vertex-coloring 13-edge-weighting","year":2008,"lang":"en","type":"article","venue":"Frontiers of Mathematics in China","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Mathematics; Combinatorics; Weighting; Vertex (graph theory); Edge coloring; Conjecture; Graph coloring; Fractional coloring; Graph; Discrete mathematics; Line graph; Graph power; Physics","score_opus":0.015975624667108397,"score_gpt":0.21713098857674548,"score_spread":0.2011553639096371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017934789","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8980385,0.00037118924,0.09189581,0.00019328108,0.0008629446,0.00013945794,7.9005014e-7,0.00010689298,0.008391134],"genre_scores_gemma":[0.72705364,0.000036390917,0.27269334,0.000038771763,0.0000031693817,0.000005313504,4.070761e-7,0.000009644573,0.0001593083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878234,0.000028042621,0.00038670818,0.00024597975,0.00031626847,0.00024067245],"domain_scores_gemma":[0.9991144,0.00010864635,0.00016712288,0.0005166747,0.00003545373,0.00005771428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004256971,0.00013571052,0.00028100377,0.0002488423,0.000103834944,0.000017765775,0.0006019513,0.00006397572,0.0000032958337],"category_scores_gemma":[0.00019223931,0.00011975272,0.000072353716,0.00035994555,0.00007041118,0.00015465452,0.0001301529,0.00017968185,0.000016026512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013731087,0.0011903008,0.010122149,0.00023499531,0.00005993147,0.00010146367,0.018195666,0.0038841246,0.00088864414,0.9193743,0.04234943,0.003585256],"study_design_scores_gemma":[0.00074616336,0.00015486688,0.0023971654,0.00027657853,0.000006273149,0.000029327854,0.000119751516,0.18296562,0.0053246813,0.8075942,0.00010377627,0.00028161297],"about_ca_topic_score_codex":0.00001561349,"about_ca_topic_score_gemma":0.0000023808907,"teacher_disagreement_score":0.18079752,"about_ca_system_score_codex":0.0000309351,"about_ca_system_score_gemma":0.00003393142,"threshold_uncertainty_score":0.48833743},"labels":[],"label_agreement":null},{"id":"W2026211607","doi":"10.1007/s004930070006","title":"Hedetniemi's Conjecture and the Retracts of a Product of Graphs","year":2000,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; Champlain Regional College","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Product (mathematics); Discrete mathematics; Geometry","score_opus":0.004598761815875983,"score_gpt":0.18767523242924197,"score_spread":0.183076470613366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026211607","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.985181,0.005854955,0.00011689401,0.002557496,0.00023087564,0.0002843385,0.0000015030458,0.00008659357,0.00568639],"genre_scores_gemma":[0.99864125,0.00018803976,0.0008590043,0.000092487266,0.0000015308967,0.0000041872922,3.178873e-7,0.000003818097,0.000209368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991706,0.000076884004,0.00022000818,0.0002080971,0.00019998926,0.0001243933],"domain_scores_gemma":[0.9990974,0.0001258624,0.000105406456,0.00053880765,0.00008901801,0.000043477306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003930236,0.00008385534,0.00020795713,0.00005493434,0.000065388434,0.000018204812,0.0003951249,0.000036306068,0.000012081127],"category_scores_gemma":[0.00006172039,0.00005165663,0.00005354331,0.0005490298,0.00023374017,0.00007828415,0.0000663869,0.00010851679,0.0000024361332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023333057,0.000091720314,0.0003860641,0.00003169576,0.000018403362,0.000001701935,0.00073633954,0.000009364827,0.0006759158,0.9859166,0.0019598028,0.010149056],"study_design_scores_gemma":[0.0017415975,0.00016543063,0.0019232613,0.000046967936,0.000016364247,0.000022918728,0.000009470129,0.0007012234,0.012355668,0.98019344,0.002705829,0.00011785698],"about_ca_topic_score_codex":0.000047405643,"about_ca_topic_score_gemma":3.7990912e-7,"teacher_disagreement_score":0.0134602925,"about_ca_system_score_codex":0.0000031850152,"about_ca_system_score_gemma":0.000028586965,"threshold_uncertainty_score":0.21064962},"labels":[],"label_agreement":null},{"id":"W2027773048","doi":"10.5539/jmr.v2n2p98","title":"Prime Labeling for Some Cycle Related Graphs","year":2010,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":23,"is_retracted":false,"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; Prime (order theory); Vertex (graph theory); Graph; Edge-graceful labeling; Discrete mathematics; Line graph; Graph power","score_opus":0.05991306246819427,"score_gpt":0.36572207859945405,"score_spread":0.30580901613125977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027773048","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9662318,0.00061549334,0.02745977,0.0034641724,0.001127638,0.00037938135,0.0000017000583,0.000067260444,0.00065277825],"genre_scores_gemma":[0.5503399,0.00007612432,0.44909927,0.000045550783,0.00003447069,0.000007222278,3.2740192e-7,0.000021484148,0.0003756486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773127,0.00008077581,0.00065577554,0.0001594573,0.00097150094,0.0004012008],"domain_scores_gemma":[0.99696946,0.0009281239,0.00030105768,0.00049184024,0.0011095299,0.0001999776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008030706,0.00009509242,0.00024140404,0.0006006722,0.00024387578,0.00021407499,0.0011205261,0.00009532071,0.000013592942],"category_scores_gemma":[0.001253155,0.00007086284,0.00015617581,0.00055036205,0.00010659013,0.0004203159,0.00018426294,0.00095529127,0.000034508288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006383561,0.00033903634,0.00002870025,0.00008370896,0.00004897505,0.000020596766,0.0008958645,0.000070198286,0.13764895,0.8548198,0.0017233555,0.004314431],"study_design_scores_gemma":[0.00058146927,0.00021169262,0.0000133859085,0.00009642603,0.000006609763,0.00016901601,0.0000622961,0.039109584,0.017661897,0.94141763,0.0005840621,0.000085901134],"about_ca_topic_score_codex":0.0000031365994,"about_ca_topic_score_gemma":0.0000012639309,"teacher_disagreement_score":0.4216395,"about_ca_system_score_codex":0.000016312215,"about_ca_system_score_gemma":0.00019112279,"threshold_uncertainty_score":0.41503182},"labels":[],"label_agreement":null},{"id":"W2028483249","doi":"10.1007/s00010-005-2800-z","title":"The partition dimension of Cayley digraphs","year":2006,"lang":"en","type":"article","venue":"Aequationes Mathematicae","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Partition (number theory); Cayley graph; Vertex (graph theory); Metric dimension; Conjecture; Dimension (graph theory); Discrete mathematics; Abelian group; Graph; Chordal graph","score_opus":0.00950302882682094,"score_gpt":0.2121605023997894,"score_spread":0.20265747357296846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028483249","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.35444862,0.0008082948,0.6330347,0.0036679537,0.00041592584,0.00045516397,0.000001973598,0.00034420905,0.0068231355],"genre_scores_gemma":[0.98191553,0.0000122147,0.017811144,0.000038150407,0.000005378034,0.000021826625,0.0000034409347,0.0000052048895,0.00018710943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896145,0.000051958166,0.00037033344,0.00015739315,0.00030844082,0.00015042983],"domain_scores_gemma":[0.9987899,0.00035349655,0.00018982716,0.00049735163,0.00014364494,0.000025790257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005112329,0.000082186125,0.00010935472,0.000059620572,0.00022398833,0.00006796053,0.00027832942,0.000030308067,0.000005609211],"category_scores_gemma":[0.00007946594,0.000052442712,0.00006207533,0.00034769266,0.000078422796,0.00018420715,0.000059921294,0.000040841773,0.00007415712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013894263,0.00005822479,0.000088781926,0.000012700909,0.0000049233017,3.4577653e-7,0.0001167775,0.00015331553,0.0036029257,0.99392134,0.0007770266,0.0012622764],"study_design_scores_gemma":[0.00014061293,0.00002845828,0.0009953085,0.000036216432,0.000008135782,0.0000040061036,0.000020263342,0.029012823,0.009825822,0.95958817,0.00026113662,0.00007906102],"about_ca_topic_score_codex":0.000044000055,"about_ca_topic_score_gemma":0.000015702479,"teacher_disagreement_score":0.6274669,"about_ca_system_score_codex":0.0000061234887,"about_ca_system_score_gemma":0.000017323026,"threshold_uncertainty_score":0.21385516},"labels":[],"label_agreement":null},{"id":"W2033074019","doi":"10.5539/jmr.v4n1p105","title":"The Graph of Simplex Vertices","year":2012,"lang":"en","type":"article","venue":"Journal of Mathematics Research","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; Graph; Simplex; Graph homomorphism; Discrete mathematics; Line graph; Voltage graph","score_opus":0.14345644499702034,"score_gpt":0.4029914510609873,"score_spread":0.25953500606396696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033074019","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9435872,0.008004961,0.039629042,0.00396356,0.00077037106,0.00021353444,7.957053e-7,0.000022350061,0.0038082052],"genre_scores_gemma":[0.96216005,0.00025440814,0.03743552,0.000014830611,0.000021982843,0.0000011631166,2.4115307e-8,0.0000051946677,0.00010683802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774873,0.0001813232,0.0004915757,0.000050592793,0.0011848407,0.00034296422],"domain_scores_gemma":[0.9969092,0.0015181553,0.00027743084,0.00038546507,0.0007691009,0.00014064158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074152234,0.000053883898,0.00014938498,0.00023176716,0.00019352265,0.00009857847,0.0010613903,0.00003225632,0.000007225532],"category_scores_gemma":[0.0007586063,0.000028564553,0.000094923016,0.0005218436,0.00015610275,0.0003064768,0.00021043918,0.00030331436,0.000016410031],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011743723,0.00060412026,0.0005440284,0.00014603493,0.00009525271,0.0000057106886,0.005035766,0.000051117175,0.013888952,0.95685303,0.011762822,0.011001445],"study_design_scores_gemma":[0.00047121523,0.00038404757,0.00065812754,0.00021280539,0.000015334297,0.00015280332,0.0014754022,0.0069709974,0.025452647,0.95597386,0.008117437,0.00011529412],"about_ca_topic_score_codex":0.0000041856406,"about_ca_topic_score_gemma":8.5240913e-7,"teacher_disagreement_score":0.018572858,"about_ca_system_score_codex":0.000012703017,"about_ca_system_score_gemma":0.000080133854,"threshold_uncertainty_score":0.25699833},"labels":[],"label_agreement":null},{"id":"W2034442645","doi":"10.1016/j.jctb.2007.02.009","title":"Triangular embeddings of complete graphs from graceful labellings of paths","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Embedding; Graph; Path (computing); Discrete mathematics; Order (exchange); Computer science","score_opus":0.010585111727271383,"score_gpt":0.23038380038414827,"score_spread":0.21979868865687688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034442645","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9583733,0.0015197572,0.032603692,0.00019980533,0.0066993777,0.0001246059,0.000012371736,0.00003675541,0.00043034446],"genre_scores_gemma":[0.98435014,0.00009809409,0.0153729655,0.00006362414,0.000065752174,4.393817e-7,0.0000014022098,0.0000148515555,0.00003272833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720806,0.00023661432,0.001350171,0.0001984185,0.000724283,0.00028242945],"domain_scores_gemma":[0.9960237,0.00074212684,0.0016682632,0.0004644458,0.00093101163,0.00017042183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041528554,0.00020057589,0.0007046291,0.0003703289,0.00009225676,0.0000458785,0.0010298515,0.00013485928,0.000029753466],"category_scores_gemma":[0.00031877254,0.00016765553,0.00034389537,0.0006830616,0.00029332447,0.0005880187,0.000149901,0.00030723822,0.0000020831365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007895025,0.00020089175,0.00027812508,0.000022800812,0.00013092965,0.00003607719,0.001633453,0.000027524913,0.04539838,0.9497404,0.0002143517,0.0015275817],"study_design_scores_gemma":[0.0019974173,0.0008795833,0.0001661175,0.00014179494,0.00004590805,0.000028057795,0.00024646785,0.000033233682,0.109088175,0.88547707,0.0017483423,0.00014785657],"about_ca_topic_score_codex":0.000025862288,"about_ca_topic_score_gemma":8.815987e-7,"teacher_disagreement_score":0.06426334,"about_ca_system_score_codex":0.000019877207,"about_ca_system_score_gemma":0.00009930255,"threshold_uncertainty_score":0.6836794},"labels":[],"label_agreement":null},{"id":"W2037298352","doi":"10.1016/s0166-218x(00)00198-0","title":"Resolvability in graphs and the metric dimension of a graph","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":982,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Metric dimension; Vertex (graph theory); Graph; Connectivity; Dimension (graph theory); Discrete mathematics; Line graph; Pathwidth","score_opus":0.009040591071365865,"score_gpt":0.21914114404383414,"score_spread":0.21010055297246827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037298352","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9804764,0.0005442077,0.009080304,0.00040598545,0.000032581254,0.0005957548,0.0000020027735,0.00009731455,0.008765465],"genre_scores_gemma":[0.94498575,0.00011616158,0.054751713,0.000087991924,7.3936434e-7,0.000029460794,8.3007615e-7,0.0000069455464,0.00002040643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987776,0.000042869124,0.00043949462,0.0002697421,0.00027853865,0.00019172393],"domain_scores_gemma":[0.9987454,0.0003722379,0.00011314014,0.0006914442,0.000028919065,0.000048894242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010867445,0.00013231041,0.00030443352,0.00018193021,0.000073552605,0.000038290298,0.00038326712,0.000053140982,0.000009761005],"category_scores_gemma":[0.0000432623,0.00007995146,0.000068036585,0.0011617288,0.0002890164,0.00007196876,0.00012308128,0.00012279837,0.000006553396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022215712,0.00007817009,0.000069330534,0.00006373533,0.000010115565,5.684969e-7,0.0019996017,0.0001460566,0.0005937528,0.99203455,0.000031906453,0.004949997],"study_design_scores_gemma":[0.0011230514,0.000022187662,0.00031797367,0.000035793906,0.000013713234,0.0000030669928,0.00013969508,0.021151692,0.0011399376,0.9759241,0.000018357254,0.000110447],"about_ca_topic_score_codex":0.000034029916,"about_ca_topic_score_gemma":0.0000046138516,"teacher_disagreement_score":0.045671407,"about_ca_system_score_codex":0.0000051044794,"about_ca_system_score_gemma":0.000012061028,"threshold_uncertainty_score":0.3260326},"labels":[],"label_agreement":null},{"id":"W2037787135","doi":"10.1016/j.laa.2008.10.032","title":"Magic square spectra","year":2008,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Manitoba","funders":"","keywords":"Magic square; Mathematics; Eigenvalues and eigenvectors; Combinatorics; Diagonal; Geometry","score_opus":0.018264399012777308,"score_gpt":0.2314869489308074,"score_spread":0.21322254991803008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037787135","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.3640722,0.0075322045,0.59437686,0.010766472,0.00024740878,0.0012989495,0.000021436272,0.0014545328,0.020229941],"genre_scores_gemma":[0.96525484,0.00041136084,0.03222698,0.00069326884,0.000036660036,0.000059597824,0.000008352497,0.000009436087,0.0012995128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929714,0.000011956679,0.0001391471,0.00028376104,0.00011477924,0.0001532154],"domain_scores_gemma":[0.9994177,0.000032935688,0.000036232042,0.00034104657,0.000066255816,0.00010580138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005921815,0.00008494397,0.000084872234,0.00006337754,0.00026373027,0.000029801768,0.00024826083,0.00003885748,0.000019698104],"category_scores_gemma":[0.0000074169825,0.000075269774,0.00003103676,0.00036390967,0.00004239171,0.00013858818,0.00007803411,0.00008644135,0.00036030172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.22253e-7,0.00006809345,0.00022560346,0.000008146436,0.0000054762677,0.0000024363915,0.00020554445,0.000013742468,0.0013698472,0.99468684,0.0011063019,0.0023074634],"study_design_scores_gemma":[0.0015340127,0.0002665919,0.012700295,0.000043551,0.000038106253,0.0005868873,0.000072161,0.13057536,0.019834468,0.56010437,0.27303368,0.0012105426],"about_ca_topic_score_codex":0.0000055100654,"about_ca_topic_score_gemma":8.37447e-7,"teacher_disagreement_score":0.60118264,"about_ca_system_score_codex":0.000003901453,"about_ca_system_score_gemma":0.0000257433,"threshold_uncertainty_score":0.463107},"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":"W2044760886","doi":"10.1016/j.aml.2007.08.010","title":"The <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>L</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>-labeling on Cartesian sum of graphs","year":2008,"lang":"lv","type":"article","venue":"Applied Mathematics Letters","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Conjecture; Combinatorics; Mathematics; Graph; Cartesian product; Vertex (graph theory); Simple graph","score_opus":0.017586771780748,"score_gpt":0.22422784745373478,"score_spread":0.20664107567298678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044760886","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9360203,0.0017954069,0.006842746,0.0025857647,0.003951093,0.000292608,0.0005488314,0.0008410029,0.047122244],"genre_scores_gemma":[0.96694916,0.0016146518,0.020517888,0.0058983495,0.0012469037,0.0015959232,0.0007479279,0.0012092729,0.00021993357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9820618,0.00056979834,0.0041667605,0.0035596096,0.0051860493,0.004455996],"domain_scores_gemma":[0.98521125,0.0037863245,0.004242215,0.0045330524,0.0004530519,0.0017740953],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.0043874322,0.0020851807,0.0010636196,0.0011026155,0.0041172216,0.0023793487,0.005188737,0.0029059388,0.004513693],"category_scores_gemma":[0.0014703348,0.0031205437,0.002947447,0.0026955404,0.0034236447,0.0015719093,0.0032498022,0.0033082808,0.002720281],"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.00083577796,0.0008987262,0.000009908324,0.0018434438,0.0020932604,0.000971636,0.0050337855,0.004135743,0.016201569,0.85154253,0.11441258,0.0020210457],"study_design_scores_gemma":[0.004105821,0.0021060081,0.00003168952,0.002886102,0.0024129613,0.0021609946,0.0026833436,0.26308915,0.70165277,0.010895469,0.0042670346,0.0037086632],"about_ca_topic_score_codex":0.0012230144,"about_ca_topic_score_gemma":0.0004863268,"teacher_disagreement_score":0.84064704,"about_ca_system_score_codex":0.00005702641,"about_ca_system_score_gemma":0.0014905488,"threshold_uncertainty_score":0.99928844},"labels":[],"label_agreement":null},{"id":"W2048818404","doi":"10.4153/cmb-2013-036-1","title":"A Problem on Edge-magic Labelings of Cycles","year":2013,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Graph Labeling and Dimension Problems","field":"Computer 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":"Combinatorics; Mathematics; MAGIC (telescope); Conjecture; Bijection; Simple graph; Graph; Petersen graph; Discrete mathematics; Voltage graph; Line graph; Physics","score_opus":0.009866899221766307,"score_gpt":0.19850928266341178,"score_spread":0.18864238344164547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048818404","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55210036,0.00058282557,0.023701113,0.13180132,0.00045381565,0.0024243528,0.000021561702,0.00068854506,0.28822613],"genre_scores_gemma":[0.92402023,0.0000043323557,0.07074761,0.002984104,0.000009251732,0.000046078243,0.0000017484919,0.00002023057,0.0021664244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986281,0.00004343582,0.00035596435,0.00030314835,0.00024226938,0.00042709496],"domain_scores_gemma":[0.9985308,0.00016994699,0.00008006241,0.0005370037,0.00015267942,0.0005294761],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00029666114,0.00015318739,0.00023422785,0.00020897505,0.00007812745,0.00010209807,0.00059222686,0.000085520245,0.0028036407],"category_scores_gemma":[0.00017520324,0.00012537513,0.00007335462,0.0002595742,0.000104205435,0.00005307368,0.00006260809,0.0001485916,0.020873629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.679852e-7,0.00007353822,0.00002509064,0.0000849573,0.000011229674,0.000009223329,0.00029605147,0.000026193797,0.0004921476,0.9382407,0.055978715,0.004761355],"study_design_scores_gemma":[0.00029994204,0.00013649324,0.000115470306,0.00028604575,0.000007848698,0.000019203018,0.000037257676,0.005080783,0.0012646095,0.974777,0.017683664,0.0002916764],"about_ca_topic_score_codex":0.0021125376,"about_ca_topic_score_gemma":0.000095328716,"teacher_disagreement_score":0.37191987,"about_ca_system_score_codex":0.00003565044,"about_ca_system_score_gemma":0.00012510738,"threshold_uncertainty_score":0.9981079},"labels":[],"label_agreement":null},{"id":"W2051752542","doi":"10.1016/j.aml.2007.12.020","title":"The <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>L</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>-labeling of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si3.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math>-free graphs and its applications","year":2008,"lang":"lv","type":"article","venue":"Applied Mathematics Letters","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph","score_opus":0.01771375619106385,"score_gpt":0.2301670961705764,"score_spread":0.21245333997951255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051752542","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7647965,0.005610471,0.0072026686,0.0030755552,0.006776693,0.0004073701,0.00222752,0.0016185099,0.20828469],"genre_scores_gemma":[0.9505142,0.005898631,0.01866065,0.006738077,0.0037420965,0.0069145937,0.0037079644,0.0033183747,0.00050539523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9662411,0.0013698066,0.007700591,0.006941476,0.009258256,0.008488751],"domain_scores_gemma":[0.9702168,0.007219838,0.008818505,0.008591189,0.00096136803,0.004192261],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.00778312,0.0039263694,0.0016584159,0.0023507962,0.007818292,0.0056488696,0.010157165,0.0073480536,0.082883775],"category_scores_gemma":[0.004688624,0.0070215003,0.0062343427,0.0053995973,0.0071266675,0.004488978,0.00895295,0.0065763653,0.005641161],"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.0024878425,0.0013598632,0.000015399619,0.0037041856,0.004651703,0.0020984602,0.0045404416,0.0051045185,0.012581629,0.6802094,0.28053933,0.0027072327],"study_design_scores_gemma":[0.0063351267,0.0032275734,0.00005296165,0.003918293,0.0053151846,0.00539,0.003834726,0.17214976,0.7816263,0.00380925,0.008366879,0.005973958],"about_ca_topic_score_codex":0.0031319112,"about_ca_topic_score_gemma":0.0022843017,"teacher_disagreement_score":0.76904464,"about_ca_system_score_codex":0.00009180664,"about_ca_system_score_gemma":0.0044005276,"threshold_uncertainty_score":0.9990625},"labels":[],"label_agreement":null},{"id":"W2055120783","doi":"10.1016/j.jctb.2005.04.002","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi mathvariant=\"normal\">Δ</mml:mi><mml:mo>+</mml:mo><mml:mn>300</mml:mn></mml:math> is a bound on the adjacent vertex distinguishing edge chromatic number","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":126,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Vertex (graph theory); Graph; Edge coloring; Mathematics; Scroll; Combinatorics; Algorithm; Line graph","score_opus":0.013034258144863281,"score_gpt":0.22761261120423784,"score_spread":0.21457835305937456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055120783","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97855157,0.0004947809,0.00069782935,0.001414942,0.007053411,0.000060541446,0.000025949874,0.00014866938,0.011552301],"genre_scores_gemma":[0.9948043,0.00019024372,0.0021032575,0.0016442079,0.00093253946,0.000056689652,0.000014246609,0.00012743806,0.00012703208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99521095,0.0004202127,0.0012528601,0.00060436793,0.0015785699,0.0009330475],"domain_scores_gemma":[0.99569166,0.0010420647,0.0014818483,0.0010980964,0.0002521696,0.00043419123],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0032674992,0.00047297502,0.00036331327,0.00017175908,0.0013192113,0.001412263,0.0017759993,0.000507179,0.0007461085],"category_scores_gemma":[0.0012362195,0.0005097427,0.0007277389,0.00055659265,0.00052519393,0.0014475072,0.00083837815,0.0010896935,0.0006035693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006166212,0.0003010777,0.000005315101,0.0001379755,0.00039988515,0.000263666,0.002897115,0.00031333615,0.00072650594,0.9780723,0.015141732,0.0011244691],"study_design_scores_gemma":[0.005548268,0.003643219,0.00008586237,0.0029215983,0.0008767057,0.004029308,0.0019624967,0.25026295,0.15963224,0.5325967,0.03650763,0.001933055],"about_ca_topic_score_codex":0.00008883815,"about_ca_topic_score_gemma":0.000017154418,"teacher_disagreement_score":0.4454756,"about_ca_system_score_codex":0.000043680855,"about_ca_system_score_gemma":0.000592258,"threshold_uncertainty_score":0.9999809},"labels":[],"label_agreement":null},{"id":"W2055714468","doi":"10.1016/j.disc.2004.02.026","title":"IC-Colorings and IC-Indices of graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Graph; Integer (computer science); Edge coloring; Discrete mathematics; Graph power; Computer science; Line graph","score_opus":0.011820432619405085,"score_gpt":0.23298965538140437,"score_spread":0.2211692227619993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055714468","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9556116,0.000610555,0.035683822,0.0011305034,0.00008625157,0.00016877837,0.000003489376,0.00016479494,0.0065401937],"genre_scores_gemma":[0.8278698,0.000041107643,0.17182782,0.000108922846,0.0000031879697,0.0000051124903,6.615754e-7,0.000007227646,0.00013615059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999098,0.000014290718,0.00028865793,0.00019440844,0.00022864007,0.00017597027],"domain_scores_gemma":[0.9992588,0.00008463816,0.00015860776,0.00037324688,0.000048872145,0.00007582469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002868116,0.00011247145,0.00019000414,0.00011187846,0.00006948389,0.00006337152,0.00034308538,0.00004453627,0.000007560528],"category_scores_gemma":[0.000034795423,0.00008850195,0.000053146676,0.00023533088,0.00008588945,0.0002276137,0.00016442644,0.0000684226,0.000016242417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001091764,0.000057042944,0.0002569963,0.000108374494,0.00001851428,0.0000013282435,0.0035006332,0.000016990294,0.002793739,0.99051154,0.00016517515,0.002568587],"study_design_scores_gemma":[0.00069288374,0.0001831634,0.000539147,0.00022511273,0.00004436503,0.00003794724,0.000452624,0.045639116,0.03648576,0.9138641,0.0014101074,0.00042568377],"about_ca_topic_score_codex":0.000007121001,"about_ca_topic_score_gemma":0.0000037712018,"teacher_disagreement_score":0.13614401,"about_ca_system_score_codex":0.0000043434666,"about_ca_system_score_gemma":0.000012930512,"threshold_uncertainty_score":0.36090046},"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":"W2060271192","doi":"10.5539/jmr.v1n1p72","title":"Some More Results on Root Square Mean Graphs","year":2015,"lang":"en","type":"article","venue":"Journal of Mathematics Research","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; Quadrilateral; Combinatorics; Square root; Square (algebra); Graph; Root mean square; Enhanced Data Rates for GSM Evolution; Path (computing); Root (linguistics); Geometry; Computer science; Artificial intelligence; Physics","score_opus":0.1723791747161142,"score_gpt":0.39216457347946604,"score_spread":0.21978539876335185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060271192","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9616039,0.001828912,0.007069825,0.020682754,0.001322445,0.00045750837,0.0000081513535,0.00012574044,0.006900804],"genre_scores_gemma":[0.93597966,0.0000704068,0.062975734,0.00013112534,0.000087663364,0.0000036584759,7.258267e-7,0.000023587092,0.00072742294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99578804,0.00024134909,0.00070832757,0.00020021002,0.002653415,0.0004086444],"domain_scores_gemma":[0.9963118,0.00058986864,0.0003156895,0.00071520545,0.0016244588,0.0004430071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00933017,0.00012286213,0.00027580064,0.0008526858,0.00013827755,0.00024379713,0.0013252832,0.00008064804,0.0000025515621],"category_scores_gemma":[0.0014094613,0.000084333245,0.00012929928,0.0007747889,0.00011285571,0.00038019224,0.0002588183,0.00073228375,0.000107947555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013520246,0.0014483391,0.00007869644,0.00015194814,0.00009195253,0.0006039487,0.016082393,0.001699835,0.0011926595,0.85390395,0.12162586,0.0029852048],"study_design_scores_gemma":[0.0015340364,0.0012947073,0.000052237618,0.00042814555,0.000005869012,0.00025664995,0.0010703345,0.012998362,0.002439207,0.97848445,0.0012931555,0.00014282319],"about_ca_topic_score_codex":0.000009270459,"about_ca_topic_score_gemma":0.0000030943525,"teacher_disagreement_score":0.12458052,"about_ca_system_score_codex":0.00007079637,"about_ca_system_score_gemma":0.00028114082,"threshold_uncertainty_score":0.343901},"labels":[],"label_agreement":null},{"id":"W2063812540","doi":"10.1016/j.jctb.2005.01.001","title":"Vertex colouring edge partitions","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":109,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Multiset; Vertex (graph theory); Mathematics; Partition (number theory); Graph; Frequency partition of a graph; Neighbourhood (mathematics); Multiplicity (mathematics); Discrete mathematics; Graph power; Line graph; Geometry","score_opus":0.009189915335832617,"score_gpt":0.22500586900062178,"score_spread":0.21581595366478917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063812540","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8836869,0.0030471173,0.034359008,0.014369429,0.04368235,0.00031079992,0.0000040806503,0.0003855992,0.020154718],"genre_scores_gemma":[0.9926975,0.000047561676,0.0065505565,0.00023394222,0.00018043192,0.0000016843329,2.1372911e-7,0.000007761967,0.00028034972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987762,0.00016197548,0.000438325,0.000114145456,0.00030156074,0.00020782386],"domain_scores_gemma":[0.9988322,0.00016918316,0.00028269374,0.00026843426,0.00030053107,0.0001469516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011392519,0.00010847367,0.00021418872,0.00013296929,0.00019317571,0.00013466761,0.00058833655,0.000060011847,0.00005006082],"category_scores_gemma":[0.00017908057,0.00009083906,0.00012936752,0.00025925206,0.00009078553,0.0010706729,0.00010927328,0.00022819822,0.000032179225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006653398,0.000113107744,0.000027567814,0.0000033527779,0.000028943723,0.000014745271,0.00038153987,0.00020193153,0.0010589707,0.99209094,0.0034808205,0.0025315252],"study_design_scores_gemma":[0.00085183315,0.00035215946,0.00005429943,0.000040596762,0.000014156492,0.00014029835,0.00004831447,0.000107835614,0.008116319,0.94836223,0.041799337,0.00011262062],"about_ca_topic_score_codex":6.28161e-7,"about_ca_topic_score_gemma":4.268971e-7,"teacher_disagreement_score":0.1090106,"about_ca_system_score_codex":0.00003892286,"about_ca_system_score_gemma":0.00011428802,"threshold_uncertainty_score":0.37043092},"labels":[],"label_agreement":null},{"id":"W2066522339","doi":"10.1006/jctb.2000.2003","title":"Chromatic Number and the 2-Rank of a Graph","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Chromatic scale; Combinatorics; Graph; Rank (graph theory); Friendship graph; Adjacency matrix; Mathematics; Windmill graph; Discrete mathematics; Line graph; Graph power","score_opus":0.006015949863867088,"score_gpt":0.2158930395992454,"score_spread":0.20987708973537833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066522339","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9806479,0.001434926,0.006948226,0.0023015032,0.0050519514,0.00014495147,5.060138e-7,0.00003079852,0.0034391899],"genre_scores_gemma":[0.99786186,0.0002651983,0.0016444082,0.000101782236,0.00004183247,0.0000011406815,5.6210595e-8,0.000005215292,0.000078485355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986598,0.00033154406,0.00047384237,0.00008521704,0.00031991536,0.00012971614],"domain_scores_gemma":[0.9985287,0.00042619856,0.00045416737,0.00027558152,0.0002469716,0.0000683605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022459386,0.00009841083,0.00031279845,0.000075553486,0.00010912081,0.00007326641,0.0005131003,0.000044120363,0.000022951395],"category_scores_gemma":[0.0002207252,0.000056760233,0.00012432101,0.00034105818,0.00040109456,0.00044637558,0.000104038874,0.00015990983,0.0000022451968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039100638,0.000050261548,0.00017448515,0.000011072231,0.000054462387,0.000012761528,0.0010032008,0.000008491044,0.00033548273,0.9969829,0.00023048017,0.00074544037],"study_design_scores_gemma":[0.0025956766,0.00020466448,0.0001238794,0.000059539478,0.000026984393,0.00050776405,0.00011953211,0.000053482014,0.00086689857,0.9942819,0.001093673,0.000066028915],"about_ca_topic_score_codex":0.000004293792,"about_ca_topic_score_gemma":2.1305159e-7,"teacher_disagreement_score":0.017213933,"about_ca_system_score_codex":0.0000059157414,"about_ca_system_score_gemma":0.00005057125,"threshold_uncertainty_score":0.23146151},"labels":[],"label_agreement":null},{"id":"W2066705994","doi":"10.1016/j.disc.2014.06.023","title":"On the strong metric dimension of Cartesian and direct products of graphs","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Metric dimension; Mathematics; Combinatorics; Vertex (graph theory); Cartesian product; Discrete mathematics; Packing dimension; Dimension (graph theory); Graph; Chordal graph; Minkowski–Bouligand dimension; 1-planar graph","score_opus":0.01435913185574652,"score_gpt":0.22230911527552924,"score_spread":0.2079499834197827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066705994","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96917975,0.00032467424,0.023584532,0.0008269878,0.00013743516,0.00034119983,0.000003869367,0.00006965694,0.005531922],"genre_scores_gemma":[0.9787663,0.000008854081,0.021151265,0.000030770363,0.0000017824409,0.0000035914172,6.135345e-7,0.000006971027,0.000029808794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990462,0.00007226156,0.000269289,0.00019211379,0.00029009656,0.00013001925],"domain_scores_gemma":[0.99856293,0.00045019106,0.00020681591,0.00064404926,0.00009879704,0.00003722326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007195244,0.00010610041,0.00022345388,0.00014317426,0.00006321397,0.00002311946,0.0002848053,0.000028352037,0.000001327001],"category_scores_gemma":[0.0004036028,0.00006097199,0.0000462768,0.0005654968,0.00009857264,0.000058469286,0.00011077488,0.00006149409,0.0000020600755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013175412,0.00004920949,0.00009060211,0.00011497267,0.000015450356,1.7986109e-7,0.000809813,0.000075523996,0.003577427,0.99438983,0.00012596312,0.0007497282],"study_design_scores_gemma":[0.0004067923,0.00052654813,0.0005156219,0.000407637,0.00006111252,0.0000060566804,0.00024912303,0.17034487,0.10089791,0.7262759,0.000045663914,0.00026274813],"about_ca_topic_score_codex":0.000008639173,"about_ca_topic_score_gemma":6.2044023e-7,"teacher_disagreement_score":0.26811388,"about_ca_system_score_codex":0.000002668166,"about_ca_system_score_gemma":0.000010441887,"threshold_uncertainty_score":0.24863656},"labels":[],"label_agreement":null},{"id":"W2073490544","doi":"10.1016/j.disc.2005.09.015","title":"The metric dimension of Cayley digraphs","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":118,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Metric dimension; Cayley graph; Vertex (graph theory); Discrete mathematics; Connectivity; Graph; Line graph; Pathwidth","score_opus":0.008927144760715572,"score_gpt":0.2222670857452978,"score_spread":0.21333994098458223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073490544","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.4733408,0.0051978235,0.4886785,0.0020168144,0.00096060015,0.0007618027,0.000010784432,0.00060592894,0.02842697],"genre_scores_gemma":[0.9450737,0.000030165902,0.054496367,0.000028733855,0.000005231292,0.0000069291887,0.0000018755828,0.000009547899,0.00034742377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998789,0.00003455896,0.0003947009,0.00017928987,0.0003808541,0.00022158057],"domain_scores_gemma":[0.99859494,0.0003147422,0.00020762118,0.0007330565,0.00010928611,0.00004033031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004873976,0.000118139826,0.00016880617,0.0001240933,0.00019365465,0.00009024906,0.00057637173,0.000040359,0.0000016883221],"category_scores_gemma":[0.000076191,0.000068977715,0.00010915983,0.000824007,0.000098148535,0.00010351577,0.00016666696,0.00007415148,0.000019434383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.04664e-7,0.000055487188,0.00017178777,0.00002720067,0.000011160663,0.0000015160338,0.00020938402,0.00019460618,0.0018100529,0.99555326,0.0010289253,0.00093570125],"study_design_scores_gemma":[0.00025158297,0.000062386614,0.00035960728,0.00006098839,0.000021802854,0.0000102925205,0.00012215742,0.07670529,0.013282375,0.90818316,0.00075352704,0.00018684806],"about_ca_topic_score_codex":0.000051915496,"about_ca_topic_score_gemma":0.0000068089735,"teacher_disagreement_score":0.4717329,"about_ca_system_score_codex":0.0000067682377,"about_ca_system_score_gemma":0.00001799864,"threshold_uncertainty_score":0.28128296},"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":"W2077309477","doi":"10.1007/s10878-008-9155-z","title":"Foreword: selected papers from the Franco-Canadian workshop on combinatorial algorithms","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","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":false,"route_about_ca":true,"ca_institutions":"McMaster University; University of New Brunswick","funders":"","keywords":"Theory of computation; Computer science; Operations research; Algorithm; Mathematics","score_opus":0.011765711029413277,"score_gpt":0.2126057162043196,"score_spread":0.2008400051749063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077309477","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.18416196,0.0028855286,0.5360879,0.02734876,0.2369085,0.0021736901,0.00006551544,0.0006987789,0.00966937],"genre_scores_gemma":[0.962805,0.00022795971,0.035434227,0.0007969102,0.00064558926,0.000004686408,0.000013638064,0.000028671164,0.00004336461],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977487,0.00023393615,0.00062454643,0.00025208527,0.00079742837,0.000343329],"domain_scores_gemma":[0.99740714,0.00046038965,0.00050646975,0.0004277663,0.00088044937,0.00031779846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005436636,0.00021641901,0.00032462986,0.00024121067,0.0005699932,0.00013725422,0.00095816446,0.00020686601,0.000040355782],"category_scores_gemma":[0.0005068406,0.00015750276,0.00015291336,0.001236564,0.00008176097,0.00046144778,0.00005270833,0.00054187997,0.000013602841],"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.0005179565,0.0008857212,0.00193716,0.0000069547273,0.0004312248,0.0002745734,0.0041599013,0.54942757,0.00025775365,0.35483953,0.07958252,0.007679152],"study_design_scores_gemma":[0.026246741,0.0028385457,0.0056707263,0.0006458578,0.00022272098,0.00034127934,0.00022252012,0.6385344,0.0018392946,0.28272507,0.038865358,0.0018474723],"about_ca_topic_score_codex":0.0008010189,"about_ca_topic_score_gemma":0.000038531052,"teacher_disagreement_score":0.778643,"about_ca_system_score_codex":0.00013912728,"about_ca_system_score_gemma":0.000628615,"threshold_uncertainty_score":0.6422776},"labels":[],"label_agreement":null},{"id":"W2078743813","doi":"10.1016/j.dam.2011.12.018","title":"A survey of Nordhaus–Gaddum type relations","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":203,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Graph; Combinatorics; Windmill graph; Complement (music); Chromatic scale; Petersen graph; Discrete mathematics; Line graph; Voltage graph","score_opus":0.03774536950012889,"score_gpt":0.26342814145880217,"score_spread":0.22568277195867328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078743813","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.2582674,0.0006784663,0.6819796,0.00020209588,0.0007047052,0.0006092923,0.000024897241,0.00043063867,0.057102922],"genre_scores_gemma":[0.83358335,0.000005235548,0.16618894,0.00004060925,0.0000043710616,0.000007796152,0.000012290223,0.000011330685,0.0001460929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990017,0.000021351665,0.00033513756,0.00014299124,0.00024517087,0.00025365394],"domain_scores_gemma":[0.9987857,0.00020773162,0.00017551263,0.00060972763,0.00011953277,0.00010180492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007144947,0.000116116564,0.00019968348,0.0000787756,0.000072270224,0.000026784273,0.00036384616,0.00006438437,0.000024655796],"category_scores_gemma":[0.000104219784,0.00009633029,0.00003699962,0.0006097024,0.000051538158,0.00014099083,0.000159219,0.00009349909,0.00020543709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020555672,0.00013360458,0.0012541863,0.00004188931,0.000022137918,1.3883174e-7,0.0016395922,0.000053854335,0.0024889142,0.99260086,0.0012648078,0.00049793243],"study_design_scores_gemma":[0.002084816,0.00027063902,0.06161675,0.00026193872,0.00019706125,0.000028061198,0.000726323,0.111061856,0.024224972,0.7949843,0.002511242,0.0020320576],"about_ca_topic_score_codex":0.000024247925,"about_ca_topic_score_gemma":0.000005002616,"teacher_disagreement_score":0.57531595,"about_ca_system_score_codex":0.0000087051385,"about_ca_system_score_gemma":0.00003353817,"threshold_uncertainty_score":0.39282352},"labels":[],"label_agreement":null},{"id":"W2083420236","doi":"10.1016/j.tcs.2008.02.048","title":"Improved upper bounds on the L(2,1) -labeling of the skew and converse skew product graphs","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Skew; Converse; Mathematics; Combinatorics; Product (mathematics); Upper and lower bounds; Discrete mathematics; Computer science; Telecommunications","score_opus":0.011870947777317311,"score_gpt":0.21092350078615546,"score_spread":0.19905255300883815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083420236","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91792154,0.00020228383,0.07148884,0.0075685387,0.0013217406,0.00047434872,0.0000013664936,0.00014914395,0.000872171],"genre_scores_gemma":[0.96918076,0.0000201085,0.0290199,0.0017325195,0.000015343701,0.0000063462235,1.0342381e-7,0.0000071245736,0.000017766415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754757,0.0001760444,0.0003244735,0.00073857675,0.0007301499,0.00048315962],"domain_scores_gemma":[0.9976705,0.00036154973,0.00012368157,0.0014260933,0.00025751762,0.00016069761],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001813442,0.00020265514,0.00020898871,0.00012766036,0.0011488871,0.0001819405,0.001998375,0.000040640178,0.00000970264],"category_scores_gemma":[0.00020334126,0.00010224716,0.00009509028,0.0014414233,0.0074347146,0.00026635246,0.001107776,0.00029537652,0.000008713562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005182745,0.000052223008,0.00022237869,0.0000064209053,0.000005258669,0.0000028138732,0.00069221674,0.000021526916,0.0069581815,0.9900308,0.00010034163,0.0019026094],"study_design_scores_gemma":[0.00036528375,0.00034567725,0.0019471874,0.00010271555,0.000011898343,0.00018897641,0.000010809495,0.19849999,0.04772329,0.75037277,0.00011860081,0.00031281475],"about_ca_topic_score_codex":0.000011936638,"about_ca_topic_score_gemma":3.4797142e-7,"teacher_disagreement_score":0.2396581,"about_ca_system_score_codex":0.000015730975,"about_ca_system_score_gemma":0.00016721884,"threshold_uncertainty_score":0.9952665},"labels":[],"label_agreement":null},{"id":"W2086552038","doi":"10.1016/j.dam.2006.06.009","title":"The strong metric dimension of graphs and digraphs","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":174,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Metric dimension; Vertex (graph theory); Distance; Discrete mathematics; Neighbourhood (mathematics); Graph; Bound graph; Shortest path problem; Graph power; Line graph; Pathwidth","score_opus":0.008347250750734546,"score_gpt":0.21421262712170225,"score_spread":0.2058653763709677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086552038","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6925774,0.003601594,0.2745395,0.0005425427,0.00027679768,0.0009538907,0.000008588398,0.0004828445,0.027016804],"genre_scores_gemma":[0.9306274,0.000057508416,0.069221154,0.000018867893,0.000002201849,0.000015225818,0.000002079149,0.000010316456,0.000045267643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881035,0.000013140202,0.0003789237,0.00023085652,0.00032900125,0.00023773294],"domain_scores_gemma":[0.99882126,0.00029259545,0.00021010832,0.0005715071,0.000054301036,0.00005023105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004065869,0.00014595897,0.00020046235,0.00014630095,0.00022937453,0.000099925994,0.0003833493,0.000047623704,7.318373e-7],"category_scores_gemma":[0.000018205781,0.00009072653,0.000064697815,0.0006811886,0.00016285264,0.000077242556,0.00019750609,0.000085359985,0.000004098014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015794146,0.00003525169,0.00006343639,0.000032266133,0.000012271606,4.6491726e-7,0.00013898789,0.00006636246,0.0049354685,0.9928786,0.00020957975,0.0016257421],"study_design_scores_gemma":[0.00028428162,0.00003318073,0.0002894914,0.000025324545,0.000023541554,0.0000046399273,0.00017969194,0.016816163,0.007935799,0.97415024,0.000106823296,0.000150814],"about_ca_topic_score_codex":0.000018879104,"about_ca_topic_score_gemma":0.0000040863715,"teacher_disagreement_score":0.23804992,"about_ca_system_score_codex":0.000004385972,"about_ca_system_score_gemma":0.000011816643,"threshold_uncertainty_score":0.36997205},"labels":[],"label_agreement":null},{"id":"W2088548234","doi":"10.4153/cmb-2015-008-7","title":"Coloring Four-uniform Hypergraphs on Nine Vertices","year":2015,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","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":"Uniwersytet Wrocławski","keywords":"Mathematics; Hypergraph; Combinatorics; Property (philosophy); Discrete mathematics","score_opus":0.046098562159172955,"score_gpt":0.22176659674845361,"score_spread":0.17566803458928065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088548234","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.42156655,0.00044037733,0.020823916,0.0879355,0.001422985,0.0008458492,0.000012623513,0.00093237957,0.4660198],"genre_scores_gemma":[0.96869755,0.000003261855,0.02499763,0.0036501794,0.000020158324,0.00002564647,0.000001757186,0.000018714467,0.002585132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986068,0.000039133014,0.00024308411,0.0003043824,0.00031995832,0.00048661622],"domain_scores_gemma":[0.99803483,0.00014090899,0.00004403647,0.0005213512,0.0001084545,0.0011504121],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00053661625,0.00015591251,0.00019250457,0.00022078493,0.00013223305,0.00015235352,0.0005859959,0.000079922844,0.0005459338],"category_scores_gemma":[0.0004050832,0.0001314464,0.00005979288,0.0003116485,0.00006839284,0.00006352999,0.0000682032,0.00016085438,0.010209192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044499584,0.000042434887,0.000041002033,0.000020877196,0.000013814225,0.00009689475,0.00030631537,0.00011812157,0.000033351684,0.9466621,0.05104317,0.0016174325],"study_design_scores_gemma":[0.0012124238,0.00054624485,0.00010753645,0.00027521193,0.000024726472,0.00013308934,0.00017052842,0.02619831,0.00076472654,0.6690673,0.30074367,0.00075619976],"about_ca_topic_score_codex":0.00077380607,"about_ca_topic_score_gemma":0.0003652244,"teacher_disagreement_score":0.54713094,"about_ca_system_score_codex":0.000089953624,"about_ca_system_score_gemma":0.00020484478,"threshold_uncertainty_score":0.9905615},"labels":[],"label_agreement":null},{"id":"W2091876458","doi":"10.1016/j.dam.2008.03.011","title":"Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Independence number; Upper and lower bounds; Chromatic scale; Independent set; Invariant (physics); Cardinality (data modeling); Independence (probability theory); Graph; Matching (statistics); Discrete mathematics; Statistics","score_opus":0.026732982838881217,"score_gpt":0.2558371971350205,"score_spread":0.2291042142961393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091876458","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.04623018,0.0003426882,0.90682316,0.000804825,0.00020384301,0.0014410611,0.0000509981,0.00033146402,0.043771777],"genre_scores_gemma":[0.7480824,0.000038779926,0.251254,0.0002662545,0.000012567529,0.00009007616,0.0000074028544,0.000020032447,0.00022845769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811184,0.000025241674,0.00046426101,0.00047746595,0.00048959727,0.00043157485],"domain_scores_gemma":[0.9981939,0.0005787977,0.00016405876,0.0008095782,0.00013244552,0.000121183126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009105871,0.00022752066,0.0002671062,0.000058452006,0.00057099416,0.00017224325,0.00070609164,0.00012294634,0.000008728036],"category_scores_gemma":[0.00007787329,0.00014713014,0.00006725055,0.0003754275,0.00023966869,0.00013332184,0.0002868407,0.00024007281,0.000020778101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019232619,0.000048167392,0.00004561009,0.00006920369,0.000028590171,0.000004103097,0.003248609,0.00012457889,0.0010818841,0.99382937,0.0010746273,0.00042601922],"study_design_scores_gemma":[0.0014254636,0.00006144156,0.00017657093,0.00006233986,0.000030899897,0.00023430276,0.00032047252,0.042930637,0.0042317514,0.94965845,0.00048696552,0.00038068468],"about_ca_topic_score_codex":0.000019639188,"about_ca_topic_score_gemma":0.0000015109181,"teacher_disagreement_score":0.70185226,"about_ca_system_score_codex":0.000008774406,"about_ca_system_score_gemma":0.00008335499,"threshold_uncertainty_score":0.5999793},"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":"W2101726701","doi":"","title":"Algebraic Analysis of Vertex-Distinguishing Edge-Colorings","year":2006,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Vertex (graph theory); Combinatorics; Mathematics; Eigenvalues and eigenvectors; Discrete mathematics; Graph; Physics","score_opus":0.008712264482093038,"score_gpt":0.1938542400556795,"score_spread":0.18514197557358647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101726701","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9970301,0.00018572724,0.00026449712,0.00016598306,0.00038728619,0.0001129171,0.00001653353,0.00011646507,0.00172054],"genre_scores_gemma":[0.75948113,0.00004196443,0.014743118,0.000021002923,0.000006616926,4.4036594e-7,0.0006032234,0.000024640203,0.22507787],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.9983821,0.000057361416,0.00025266016,0.0005563011,0.00046237343,0.00028921894],"domain_scores_gemma":[0.9981701,0.00007598861,0.0006100869,0.0006407955,0.00041287797,0.00009016797],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026285,0.00024167524,0.0007019948,0.0012383456,0.00019056849,0.000042981435,0.0011067113,0.0002575163,0.00003707035],"category_scores_gemma":[0.000032737527,0.00028478514,0.00045085867,0.0017401619,0.00008244638,0.00028129568,0.00015722,0.0002178411,0.000013425174],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044064273,0.0016163881,0.023512974,0.0032976144,0.012351005,0.00044719968,0.55026966,0.011675368,0.0733853,0.2679184,0.024651047,0.030434377],"study_design_scores_gemma":[0.009436686,0.002134028,0.40254042,0.0048753778,0.030069552,0.000016238922,0.16836901,0.21367258,0.06697107,0.08955707,0.0035291538,0.008828819],"about_ca_topic_score_codex":0.06378301,"about_ca_topic_score_gemma":0.02891842,"teacher_disagreement_score":0.38190067,"about_ca_system_score_codex":0.000043012384,"about_ca_system_score_gemma":0.000091214664,"threshold_uncertainty_score":0.9999604},"labels":[],"label_agreement":null},{"id":"W2105006345","doi":"10.1007/s00373-010-0946-5","title":"Zero-Sum Flows in Regular Graphs","year":2010,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Zero (linguistics); Vertex (graph theory); Graph; Conjecture; Discrete mathematics; Flow (mathematics)","score_opus":0.0072069046876433495,"score_gpt":0.20222801365725615,"score_spread":0.1950211089696128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105006345","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9946884,0.0006875458,0.0009805362,0.0005067101,0.0016799117,0.00013510589,0.0000010661707,0.00020857879,0.0011121708],"genre_scores_gemma":[0.9959549,0.00014726486,0.0035490922,0.00021596166,0.0000018116223,0.000015099592,0.0000017091536,0.000010865608,0.00010330957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986033,0.000039505663,0.0002654525,0.00045887244,0.00026998873,0.00036287322],"domain_scores_gemma":[0.9989656,0.000050751656,0.00006707023,0.0006500028,0.00008893306,0.00017762103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004735751,0.00018168883,0.00020706332,0.00036545726,0.00016779316,0.00015027841,0.0005252497,0.00014727186,0.0000035055693],"category_scores_gemma":[0.000028490454,0.00016556219,0.00007561514,0.0012589112,0.00008130114,0.0002555483,0.00019440279,0.000404853,0.000008903729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018291443,0.00009853473,0.009370791,0.000009589847,0.0000053605518,0.000017041037,0.00013887517,0.000003433837,0.0024297037,0.9841363,0.00057119405,0.0032173446],"study_design_scores_gemma":[0.0006412969,0.00007479697,0.0042490256,0.000014355237,0.0000042564448,0.000017929156,0.000010921331,0.0034703498,0.0006588045,0.9884615,0.002168404,0.00022834261],"about_ca_topic_score_codex":0.000073859046,"about_ca_topic_score_gemma":0.000033099153,"teacher_disagreement_score":0.0051217647,"about_ca_system_score_codex":0.0000052854607,"about_ca_system_score_gemma":0.00003096775,"threshold_uncertainty_score":0.675143},"labels":[],"label_agreement":null},{"id":"W2105566363","doi":"","title":"Some edge-magic cubic graphs","year":2002,"lang":"en","type":"article","venue":"HKBU Institutional Repository (Hong Kong Baptist University)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; MAGIC (telescope); Cubic graph; Mathematics; Simple graph; Conjecture; Enhanced Data Rates for GSM Evolution; Simple (philosophy); Edge coloring; Graph; Discrete mathematics; Line graph; Computer science; Physics; Voltage graph; Graph power; Telecommunications; Quantum mechanics","score_opus":0.014630704202493853,"score_gpt":0.17258426144721534,"score_spread":0.1579535572447215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105566363","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63017106,0.004560151,0.04724045,0.0019267584,0.009995855,0.0006578931,0.000022981305,0.0024901829,0.30293468],"genre_scores_gemma":[0.9779217,0.00010212111,0.005215262,0.00020656855,0.00006669882,9.742881e-7,0.0000058922546,0.0000104585015,0.016470296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980285,0.00009901718,0.00025873986,0.0006768216,0.00053417013,0.00040273095],"domain_scores_gemma":[0.99867094,0.00006567832,0.0001352471,0.0006495498,0.00020167726,0.00027688543],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012839984,0.00024439566,0.0002090295,0.0005886679,0.0012488107,0.0001913545,0.0009950338,0.00013553118,0.000032655174],"category_scores_gemma":[0.000028120456,0.00026842076,0.00019415612,0.0010420042,0.0005018886,0.0015131204,0.00029646046,0.00028505287,0.00036796264],"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.0000065260783,0.00016519042,0.0016276689,0.000015582655,0.000043963933,0.0012073212,0.00008401674,0.0012201575,0.0029786655,0.9896458,0.002271563,0.0007335624],"study_design_scores_gemma":[0.008988624,0.0009258207,0.032047387,0.0010343118,0.00038952942,0.005150745,0.00031477681,0.1700149,0.017064078,0.18969634,0.5688406,0.0055328654],"about_ca_topic_score_codex":0.00009665246,"about_ca_topic_score_gemma":0.000005669801,"teacher_disagreement_score":0.79994947,"about_ca_system_score_codex":0.00019143742,"about_ca_system_score_gemma":0.00013921919,"threshold_uncertainty_score":0.9999768},"labels":[],"label_agreement":null},{"id":"W2106653152","doi":"10.1016/j.disc.2005.04.024","title":"Labeling trees with a condition at distance two","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Combinatorics; Mathematics; Degree (music); Span (engineering); Graph; Integer (computer science); Edge-graceful labeling; Discrete mathematics; Graph power; Physics; Computer science","score_opus":0.008680740982188557,"score_gpt":0.2300537654908175,"score_spread":0.22137302450862895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106653152","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.27212727,0.0002669634,0.7174869,0.0004901484,0.00009455164,0.00020277784,0.000011555891,0.00041279732,0.008907033],"genre_scores_gemma":[0.81705755,0.0000029749544,0.18178792,0.00007804813,0.000009205074,0.000015973485,0.000016917971,0.000014287844,0.0010170974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989193,0.00001936683,0.00024936293,0.00026472096,0.00030542264,0.00024183394],"domain_scores_gemma":[0.9991814,0.00007251836,0.00014367509,0.0004804711,0.000068609654,0.000053350966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016427995,0.00015005468,0.00016854305,0.00005748559,0.00018684308,0.00013067303,0.00029319353,0.000029095327,0.000012248815],"category_scores_gemma":[0.000011493217,0.00010784364,0.00004489483,0.00027054758,0.00007280863,0.00020073574,0.00009563875,0.00006568961,0.000066591405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003689306,0.000071660164,0.00042507958,0.000046901147,0.000012104141,0.00001576248,0.00047237435,0.0014656641,0.0034250834,0.9930887,0.0007976271,0.00017532981],"study_design_scores_gemma":[0.0014319848,0.00013054715,0.00028347498,0.00035403244,0.00004149857,0.00008447872,0.00010832349,0.22031009,0.010659123,0.7647636,0.0012472008,0.0005856623],"about_ca_topic_score_codex":0.000026625876,"about_ca_topic_score_gemma":0.00011055447,"teacher_disagreement_score":0.5449303,"about_ca_system_score_codex":0.000027649672,"about_ca_system_score_gemma":0.000015509153,"threshold_uncertainty_score":0.4397736},"labels":[],"label_agreement":null},{"id":"W2108792210","doi":"10.1016/j.dam.2009.02.023","title":"On minimally b-imperfect graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Imperfect; Combinatorics; Discrete mathematics","score_opus":0.010895283184130326,"score_gpt":0.23200242214121836,"score_spread":0.22110713895708803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108792210","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41884282,0.00017752149,0.3066423,0.0025216904,0.00037927533,0.0010248764,0.000006500901,0.0018222887,0.26858273],"genre_scores_gemma":[0.816421,0.000008043642,0.1821212,0.0013235434,0.0000047409353,0.000014354656,0.0000029900166,0.000011989806,0.00009218508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985966,0.000010698744,0.00030688875,0.0003758631,0.00037354333,0.00033638766],"domain_scores_gemma":[0.99876404,0.00012504704,0.00011647336,0.0008330555,0.00003548394,0.0001258874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002788399,0.00021740644,0.00024105338,0.00014054248,0.0001348085,0.00014007944,0.0006617738,0.00007458478,0.000012190835],"category_scores_gemma":[0.000030194791,0.00017076281,0.00010390401,0.0003934168,0.000040619154,0.00009064819,0.00007207174,0.00014748232,0.000250175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004133558,0.00011704029,8.566744e-7,0.000014518499,0.000008936569,0.000004321866,0.0004892114,0.000059606675,0.009353838,0.9852592,0.0013988618,0.0032894996],"study_design_scores_gemma":[0.00034799392,0.00020066762,0.000040269315,0.000038667327,0.000010438426,0.000007045019,0.00003189776,0.007395622,0.0067486838,0.98480284,0.00012445533,0.0002514349],"about_ca_topic_score_codex":5.774907e-7,"about_ca_topic_score_gemma":2.5447093e-7,"teacher_disagreement_score":0.39757815,"about_ca_system_score_codex":0.000011551932,"about_ca_system_score_gemma":0.000021929358,"threshold_uncertainty_score":0.6963505},"labels":[],"label_agreement":null},{"id":"W2116562963","doi":"10.37236/1621","title":"Relaxed Graceful Labellings of Trees","year":2002,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Bijection; Vertex (graph theory); Combinatorics; Mathematics; Upper and lower bounds; Graph; Discrete mathematics","score_opus":0.010711134484280299,"score_gpt":0.19398446871472116,"score_spread":0.18327333423044087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116562963","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8398716,0.049162265,0.096588336,0.010658679,0.0016174141,0.00018987377,5.0133474e-7,0.0000919864,0.001819377],"genre_scores_gemma":[0.9970942,0.0021015892,0.00021233025,0.00008973161,0.000009926517,5.93578e-7,5.7525053e-8,0.0000086219825,0.0004829323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836546,0.00012000089,0.00050717103,0.000111258945,0.0004989106,0.00039719275],"domain_scores_gemma":[0.99836385,0.00020061138,0.0005905958,0.0004203272,0.00035610216,0.000068488174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012714127,0.000117197036,0.00025282634,0.00014607256,0.00011153823,0.000037045087,0.0012010634,0.00005429836,0.00000916031],"category_scores_gemma":[0.00007699198,0.000075785974,0.00014642788,0.000780656,0.00007238019,0.00022053497,0.00007637502,0.0005413182,0.000010513546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006713487,0.00016083596,0.00012883126,0.000004724521,0.00004913309,0.0000045819174,0.00047964658,0.00016972423,0.0009951709,0.9948494,0.0018958444,0.0012554057],"study_design_scores_gemma":[0.0007705772,0.0007988713,0.00006335105,0.0000337493,0.00003110161,0.00015033425,0.000024474897,0.003962647,0.0067893118,0.98419064,0.0030828973,0.000102032005],"about_ca_topic_score_codex":0.000004444009,"about_ca_topic_score_gemma":0.0000017405793,"teacher_disagreement_score":0.15722264,"about_ca_system_score_codex":0.000060146278,"about_ca_system_score_gemma":0.00009413613,"threshold_uncertainty_score":0.30904624},"labels":[],"label_agreement":null},{"id":"W2119786326","doi":"10.1007/978-3-319-21840-3_7","title":"Generation of Colourings and Distinguishing Colourings of Graphs","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Combinatorics; Mathematics","score_opus":0.043798299287756484,"score_gpt":0.2535629484291135,"score_spread":0.209764649141357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119786326","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.023308417,0.001479911,0.97239184,0.0002701235,0.001014095,0.000298635,0.0000053700824,0.000076760196,0.0011548178],"genre_scores_gemma":[0.7644119,0.00003346129,0.23529683,0.0001362584,0.000033414828,0.0000024653343,0.0000023078846,0.000014605261,0.00006874054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746805,0.000026845837,0.0005804855,0.0008340362,0.0007854153,0.00030517683],"domain_scores_gemma":[0.99783313,0.00021767411,0.00054163253,0.0006654884,0.00060720346,0.00013487446],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001344304,0.00028638358,0.0004979306,0.00067244633,0.000118056305,0.00014453573,0.0011726512,0.00020236964,0.000002232126],"category_scores_gemma":[0.00021143247,0.00026232222,0.00006997818,0.0004709421,0.0008081585,0.00029371795,0.0008878787,0.00033467045,0.0000010044236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017022303,0.000100403864,0.0012260918,0.00036017312,0.000041702137,0.00005157839,0.004530514,0.038872972,0.013753606,0.6608103,0.00018555486,0.2800501],"study_design_scores_gemma":[0.00041695745,0.00038104475,0.00014534537,0.0006571233,0.000015719663,0.00004524888,3.083059e-7,0.31512323,0.012401519,0.67012924,0.00021233177,0.0004719357],"about_ca_topic_score_codex":0.000081991726,"about_ca_topic_score_gemma":0.00004130294,"teacher_disagreement_score":0.74110353,"about_ca_system_score_codex":0.00005551396,"about_ca_system_score_gemma":0.00025842927,"threshold_uncertainty_score":0.9999829},"labels":[],"label_agreement":null},{"id":"W2122198415","doi":"10.1112/blms/bdq096","title":"Base size, metric dimension and other invariants of groups and graphs","year":2011,"lang":"en","type":"article","venue":"Bulletin of the London Mathematical Society","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":264,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Permutation group; Base (topology); Metric dimension; Terminology; Wreath product; Association scheme; Metric (unit); Dimension (graph theory); Combinatorics; Graph isomorphism; Isomorphism (crystallography); Discrete mathematics; Graph; Product (mathematics); Permutation (music); Chordal graph; Line graph; 1-planar graph; Geometry; Mathematical analysis","score_opus":0.020733701608796302,"score_gpt":0.20776086707190305,"score_spread":0.18702716546310674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122198415","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9825227,0.000943768,0.011929837,0.0017374776,0.00011202926,0.00040677242,0.000005317438,0.000071194634,0.002270882],"genre_scores_gemma":[0.8477661,0.00004396719,0.15140018,0.00065392116,0.0000017369243,0.000004453036,5.776303e-8,0.000009420175,0.0001201653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989151,0.000088426845,0.00032740334,0.00023627223,0.00027017723,0.00016264002],"domain_scores_gemma":[0.99877363,0.0004433837,0.00018857553,0.00045316323,0.0000620172,0.00007920194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008095562,0.00012346952,0.00026050545,0.000027848466,0.00008517249,0.000016180804,0.00034968823,0.00008196968,0.00008919264],"category_scores_gemma":[0.00024590304,0.000075325894,0.00014521676,0.00030766087,0.00030103375,0.000027013848,0.00046289375,0.00010459747,0.000006715507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017634764,0.00045765995,0.003131705,0.00043711232,0.00009333614,0.0000011056076,0.0036176487,0.0000024197857,0.0060661924,0.98013264,0.005102939,0.00093958894],"study_design_scores_gemma":[0.0011628086,0.00017099958,0.0040033762,0.0002656723,0.000073093324,0.000029959487,0.00017847262,0.0051063453,0.017036803,0.9713868,0.00034744263,0.00023823057],"about_ca_topic_score_codex":0.00005522803,"about_ca_topic_score_gemma":2.911874e-7,"teacher_disagreement_score":0.13947034,"about_ca_system_score_codex":0.0000036244548,"about_ca_system_score_gemma":0.000009168939,"threshold_uncertainty_score":0.3071701},"labels":[],"label_agreement":null},{"id":"W2124994312","doi":"10.1016/j.dam.2007.05.059","title":"Degree constrained subgraphs","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":121,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Weighting; Degree (music); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.024134379307381403,"score_gpt":0.24711142689510557,"score_spread":0.22297704758772416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124994312","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.021330636,0.00005957402,0.8734045,0.00016784917,0.00014017787,0.00024065527,0.000001989264,0.00045894377,0.10419564],"genre_scores_gemma":[0.591892,0.0000039974193,0.407764,0.0002332923,0.0000063637153,0.000008259903,0.000003122313,0.000012752894,0.000076241566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984644,0.0000059176136,0.00041624674,0.00032379056,0.00035421626,0.00043540538],"domain_scores_gemma":[0.99871206,0.00017854777,0.00014426622,0.0007356959,0.00006008585,0.00016936673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008169932,0.00019137248,0.00022367045,0.00015498065,0.00013795939,0.00010385434,0.00062997726,0.00008674746,0.000017255095],"category_scores_gemma":[0.000029708568,0.00015861973,0.00008627707,0.00050116,0.00012993619,0.00009794553,0.00015996801,0.00013960508,0.00014048177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022288023,0.000050861294,0.000012037317,0.000031311956,0.000015677442,0.000008721487,0.0007015106,0.0000068679205,0.010314169,0.98231953,0.0002926216,0.0062444727],"study_design_scores_gemma":[0.0006786647,0.00004359539,0.0001218821,0.000039870996,0.000021078376,0.00003853304,0.00041752862,0.0060204663,0.021549636,0.9699855,0.0006447687,0.00043849996],"about_ca_topic_score_codex":0.0000032447688,"about_ca_topic_score_gemma":0.000004446068,"teacher_disagreement_score":0.57056135,"about_ca_system_score_codex":0.000011612383,"about_ca_system_score_gemma":0.000029836494,"threshold_uncertainty_score":0.6468325},"labels":[],"label_agreement":null},{"id":"W2125110392","doi":"10.4310/joc.2010.v1.n2.a4","title":"Distinguishing number and adjacency properties","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Adjacency list; Combinatorics; Adjacency matrix; Graph","score_opus":0.009317139015940886,"score_gpt":0.2123947591885158,"score_spread":0.2030776201725749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125110392","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9917706,0.0004081847,0.0025275752,0.0008428182,0.0026298084,0.000030670068,9.838261e-8,0.00003175453,0.001758447],"genre_scores_gemma":[0.99018323,0.00003275546,0.009547617,0.00007668483,0.000017418639,3.5219702e-7,2.935886e-8,0.000005046071,0.00013687702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991972,0.00002583195,0.00027422913,0.000093107585,0.0002777162,0.00013191809],"domain_scores_gemma":[0.9990514,0.000050488765,0.0002329911,0.0001769708,0.00036757506,0.00012059817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057680625,0.00007612953,0.00014005657,0.000062000254,0.00010842696,0.00018054356,0.00036967333,0.000048210128,0.000004030808],"category_scores_gemma":[0.00033031503,0.00005471767,0.000042026124,0.00020005075,0.00004313482,0.0003928847,0.000113199414,0.00039069497,0.000005430431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004481475,0.00012020803,0.018646523,0.000024241383,0.000014559907,0.00003980663,0.00068581005,0.00000521319,0.011856842,0.96307385,0.0018736272,0.0036548255],"study_design_scores_gemma":[0.0010545464,0.00021993567,0.0063304924,0.00013255778,0.000020904083,0.0010682951,0.00004676009,0.0022459326,0.0062065073,0.9706832,0.01170902,0.00028182825],"about_ca_topic_score_codex":0.000004949022,"about_ca_topic_score_gemma":7.3628127e-7,"teacher_disagreement_score":0.01231603,"about_ca_system_score_codex":0.000006224788,"about_ca_system_score_gemma":0.00005990049,"threshold_uncertainty_score":0.22313218},"labels":[],"label_agreement":null},{"id":"W213233986","doi":"10.1016/j.tcs.2013.02.002","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>L</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>-labelings on the modular product of two graphs","year":2013,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Combinatorics; Graph; Vertex (graph theory); Product (mathematics); Mathematics; Algorithm; Geometry","score_opus":0.01497110216309254,"score_gpt":0.2328032701847388,"score_spread":0.21783216802164623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W213233986","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94355047,0.0016103754,0.015945282,0.0030209417,0.0055707633,0.00026696865,0.00032331693,0.0007221183,0.028989749],"genre_scores_gemma":[0.9724685,0.0006931569,0.018906804,0.0045192163,0.0014505319,0.0008820648,0.0002867844,0.0006611652,0.00013178421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9796236,0.0011496712,0.0034189324,0.0048056846,0.006215036,0.0047870497],"domain_scores_gemma":[0.9856633,0.003199833,0.002797426,0.005034229,0.00097006024,0.0023351454],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.0076059187,0.0018640641,0.0009086534,0.0011451152,0.0040282854,0.004149722,0.008311265,0.0020767453,0.010035815],"category_scores_gemma":[0.0026924915,0.0025495107,0.0024532762,0.0042294175,0.010012086,0.0029788257,0.00659662,0.0033041723,0.0033676794],"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.00076409307,0.0008900971,0.000013970797,0.0007611693,0.00087272574,0.0005453393,0.0028319345,0.005478456,0.008613776,0.93781906,0.035818722,0.005590677],"study_design_scores_gemma":[0.0017496772,0.002618228,0.00005209161,0.0015850202,0.0007697727,0.0010730713,0.00039649315,0.5208978,0.4366535,0.03133286,0.00091137685,0.0019600878],"about_ca_topic_score_codex":0.0014409426,"about_ca_topic_score_gemma":0.00016070904,"teacher_disagreement_score":0.90648615,"about_ca_system_score_codex":0.00004797491,"about_ca_system_score_gemma":0.002101507,"threshold_uncertainty_score":0.9994104},"labels":[],"label_agreement":null},{"id":"W2135716534","doi":"10.46298/dmtcs.532","title":"On the metric dimension of Grassmann graphs","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Linear subspace; Vertex (graph theory); Metric dimension; Dimension (graph theory); Graph; Subspace topology; Metric (unit); Grassmannian; Discrete mathematics; Pure mathematics; Pathwidth; Line graph","score_opus":0.01632379254665654,"score_gpt":0.2504834117644909,"score_spread":0.23415961921783437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135716534","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.17134716,0.00009829734,0.82262063,0.001048086,0.0006439723,0.0002745003,0.0000016385089,0.00014027467,0.0038254154],"genre_scores_gemma":[0.85033524,0.000004462734,0.14919324,0.00043249765,0.000010943377,0.000008300214,4.20384e-7,0.000010120336,0.0000047736958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968661,0.00014304645,0.00049507763,0.00046092676,0.0013165396,0.00071831833],"domain_scores_gemma":[0.99644816,0.0012963092,0.00021720341,0.001502355,0.00023507293,0.00030089996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038543285,0.00025010228,0.0003056233,0.00041596463,0.0004726486,0.00021569073,0.002438671,0.000058269365,0.000027412298],"category_scores_gemma":[0.00040618816,0.00013860299,0.00016254392,0.0028029433,0.0023118027,0.00045804484,0.0010107743,0.00023630718,0.00008301363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020014168,0.00017089682,0.00004927981,0.000015888714,0.00000816542,8.070961e-7,0.00091741415,0.00007292807,0.0008824537,0.9969203,0.0001271971,0.00083270506],"study_design_scores_gemma":[0.000096375195,0.00012233829,0.00010439556,0.000065238426,0.000010739573,0.000012585485,0.00002922019,0.26379922,0.006276274,0.7293163,0.0000071696295,0.00016014687],"about_ca_topic_score_codex":0.0000017073845,"about_ca_topic_score_gemma":5.0860894e-8,"teacher_disagreement_score":0.6789881,"about_ca_system_score_codex":0.00001870463,"about_ca_system_score_gemma":0.000043477965,"threshold_uncertainty_score":0.85179335},"labels":[],"label_agreement":null},{"id":"W2143157065","doi":"10.1016/j.disc.2008.04.052","title":"Nordhaus–Gaddum inequalities for the fractional and circular chromatic numbers","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Chromatic scale; Graph; Inequality; Discrete mathematics; Rational number; Windmill graph; Integer (computer science); Graph power; Line graph; Mathematical analysis","score_opus":0.03739885792471782,"score_gpt":0.25553148185387725,"score_spread":0.21813262392915944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143157065","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.12896983,0.000676684,0.86642146,0.0021056016,0.00030183402,0.00044429736,0.000011791705,0.00018398362,0.00088450307],"genre_scores_gemma":[0.8841001,0.00007424459,0.1147704,0.00045799333,0.000021972732,0.000078194505,0.000005478626,0.000017231505,0.00047442154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905944,0.000022152026,0.000263163,0.00018684076,0.00027297088,0.00019544119],"domain_scores_gemma":[0.99875724,0.0005759566,0.00011527038,0.00041836273,0.000074222145,0.0000589197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033405732,0.00012652465,0.00016314401,0.000043868873,0.00043512994,0.000092262926,0.00031161262,0.000043222233,0.000009503043],"category_scores_gemma":[0.00013058691,0.000082957085,0.00007575523,0.0001447921,0.00014158174,0.00018659238,0.000097238866,0.0000803764,0.000016128484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028271002,0.00008071159,0.00025207506,0.0003586702,0.00010833706,0.0000063558646,0.0115891425,0.00023708565,0.0003081052,0.982266,0.0041264496,0.00066420855],"study_design_scores_gemma":[0.0006476474,0.00008190692,0.00056410115,0.000100576544,0.000051480987,0.00026418897,0.0012131827,0.34677425,0.00045629145,0.6469929,0.0024865195,0.00036694916],"about_ca_topic_score_codex":0.000017118153,"about_ca_topic_score_gemma":0.0000016660791,"teacher_disagreement_score":0.75513023,"about_ca_system_score_codex":0.000010034794,"about_ca_system_score_gemma":0.000037168033,"threshold_uncertainty_score":0.33828917},"labels":[],"label_agreement":null},{"id":"W2143635860","doi":"10.5539/jmr.v7n4p97","title":"Irregularity Strength of Corona Product of a Graph with Star Graph","year":2015,"lang":"en","type":"article","venue":"Journal of Mathematics Research","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; Graph; Vertex (graph theory); Graph power; Quartic graph; Wheel graph; Complement graph; Windmill graph; Distance-regular graph; Path graph; Butterfly graph; Discrete mathematics; Voltage graph; Line graph","score_opus":0.12871764411984268,"score_gpt":0.3522789284258459,"score_spread":0.22356128430600322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143635860","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9828882,0.0009603837,0.014814564,0.00056259223,0.00010691564,0.00020800628,0.0000033697388,0.000012725368,0.00044325044],"genre_scores_gemma":[0.78431296,0.000053099317,0.21554957,0.000004432874,0.000008673105,0.0000015203906,2.453866e-7,0.000009136966,0.000060329123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99621636,0.00023776152,0.00074560987,0.00016639743,0.002340254,0.00029359828],"domain_scores_gemma":[0.994812,0.00030858774,0.0006202152,0.0006694219,0.0033505682,0.00023919718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070222276,0.00011230212,0.0004237009,0.00073574943,0.000054948618,0.00004975175,0.0010424854,0.00004639616,0.0000053485064],"category_scores_gemma":[0.00057699933,0.00007280102,0.00010657732,0.0012153329,0.00033257515,0.00027295548,0.00021087675,0.00044403697,0.0000022049335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061137194,0.011563768,0.008360506,0.0036283245,0.0011664766,0.00030290888,0.02979413,0.0021970228,0.050303336,0.85895604,0.021423845,0.011692246],"study_design_scores_gemma":[0.002496677,0.0038428337,0.0008708084,0.0011119584,0.00004528398,0.00038637008,0.0018875763,0.0068252906,0.057522688,0.9245702,0.00019450593,0.0002457788],"about_ca_topic_score_codex":0.00003511293,"about_ca_topic_score_gemma":0.000008186975,"teacher_disagreement_score":0.20073502,"about_ca_system_score_codex":0.000025100808,"about_ca_system_score_gemma":0.00055320567,"threshold_uncertainty_score":0.29687393},"labels":[],"label_agreement":null},{"id":"W2144158529","doi":"10.1007/s00373-011-1063-9","title":"Coloring Eulerian Triangulations of the Klein Bottle","year":2011,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Klein bottle; Eulerian path; Mathematics; Combinatorics; Chromatic scale; Triangulation; Bottle; Graph; Point set triangulation; Delaunay triangulation; Geometry; Mathematical analysis; Lagrangian","score_opus":0.026032249480378265,"score_gpt":0.18251163230335274,"score_spread":0.15647938282297447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144158529","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9892771,0.00059017976,0.002369238,0.00024547314,0.0011977657,0.00015909222,0.0000017302841,0.00009848464,0.006060908],"genre_scores_gemma":[0.99831575,0.00002766663,0.0014859072,0.000046634697,8.6111334e-7,0.000005345603,1.847336e-7,0.0000036185268,0.00011405336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941516,0.000033216296,0.00015654597,0.00014512199,0.00012874612,0.000121192126],"domain_scores_gemma":[0.9994216,0.000026946229,0.000080994214,0.00035301238,0.00006749554,0.000049931605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001791747,0.00006798051,0.00009571097,0.00006908291,0.00016148204,0.000023552344,0.0003293287,0.00003816225,0.0000038687795],"category_scores_gemma":[0.000018682,0.00004816468,0.0000557505,0.0006218768,0.00006644801,0.00009844944,0.00014606708,0.00006723518,0.0000013423125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001258434,0.00004648469,0.0071984497,0.000004891206,0.000006703073,4.958786e-7,0.0004964187,0.0000015741547,0.000218175,0.9912049,0.00013265299,0.00068799517],"study_design_scores_gemma":[0.00036962348,0.000067645225,0.03741642,0.00001568191,0.000009032143,0.000003320996,0.00003588921,0.00075669994,0.0028310835,0.9580033,0.00040517832,0.00008611914],"about_ca_topic_score_codex":0.000060745115,"about_ca_topic_score_gemma":0.0000031776785,"teacher_disagreement_score":0.033201598,"about_ca_system_score_codex":0.0000036606946,"about_ca_system_score_gemma":0.000021071231,"threshold_uncertainty_score":0.19640987},"labels":[],"label_agreement":null},{"id":"W2150373920","doi":"10.55016/ojs/cdm.v12i2.62601","title":"Group Irregular Labelings of Disconnected Graphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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":"Combinatorics; Group (periodic table); Totally disconnected space; Mathematics; Geography; Physics; Locally compact space","score_opus":0.013796895176866024,"score_gpt":0.28265791971028714,"score_spread":0.26886102453342114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150373920","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.14636703,0.00023990966,0.8453747,0.0050032837,0.00042378603,0.0005876187,0.00017242174,0.0002843895,0.0015468883],"genre_scores_gemma":[0.9088077,0.000010380917,0.090901986,0.000086286505,0.0000069366506,0.000033535744,0.000012323116,0.000012108183,0.00012875663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984364,0.00003772813,0.000494936,0.00033793788,0.00032648855,0.00036649214],"domain_scores_gemma":[0.9968365,0.0001278504,0.00037900364,0.002002297,0.00044823406,0.00020615383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006062865,0.00018910166,0.00036577054,0.00016562558,0.0006951067,0.00031984018,0.0015380882,0.000083467305,0.0000119808],"category_scores_gemma":[0.0011107649,0.00015818556,0.0001580198,0.00025404117,0.00018629894,0.00037497474,0.0005725112,0.00011616164,0.00007122692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022955041,0.000098724864,0.00010714458,0.00003285834,0.000035537978,0.000003015472,0.00039141276,0.000018763956,0.007809533,0.9904187,0.00043518675,0.0006468696],"study_design_scores_gemma":[0.00084592134,0.00013828729,0.00082030083,0.0002646817,0.000056963185,0.000012037075,0.0000631561,0.0187968,0.01005871,0.9677651,0.00081798364,0.00036008467],"about_ca_topic_score_codex":0.00003495342,"about_ca_topic_score_gemma":0.000011563189,"teacher_disagreement_score":0.7624407,"about_ca_system_score_codex":0.000023407434,"about_ca_system_score_gemma":0.000043184344,"threshold_uncertainty_score":0.64506197},"labels":[],"label_agreement":null},{"id":"W2151378894","doi":"10.1007/s00373-010-0929-6","title":"Rigidity and Separation Indices of Graphs in Surfaces","year":2010,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Embedding; Mathematics; Bounded function; Combinatorics; Rigidity (electromagnetism); Book embedding; 1-planar graph; Euler characteristic; Discrete mathematics; Chordal graph; Graph; Computer science; Mathematical analysis","score_opus":0.008431144429055935,"score_gpt":0.23632081290382262,"score_spread":0.2278896684747667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151378894","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9983978,0.0006363504,0.000084422056,0.00010811449,0.0003595487,0.00007184935,0.0000012513963,0.000038937676,0.00030168565],"genre_scores_gemma":[0.99871886,0.00026982147,0.00096342235,0.000028801405,5.526325e-7,0.0000035100547,0.0000010143955,0.0000029059995,0.000011109326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925774,0.000030156234,0.00019098372,0.00023099873,0.00015483434,0.00013527612],"domain_scores_gemma":[0.99950194,0.000064120584,0.00009380158,0.00020893515,0.00006283869,0.00006834735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038020752,0.00009289541,0.00014671599,0.00021814958,0.000083271,0.000064066466,0.00017294793,0.00008139094,0.0000010962804],"category_scores_gemma":[0.000017685688,0.0000816195,0.000023101136,0.000620277,0.00010740333,0.00024563205,0.000087084685,0.00016328495,4.1481792e-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.0000017944126,0.000060296305,0.12501211,0.000017282215,0.0000037527193,0.0000013833657,0.0003074312,0.000002747396,0.002211494,0.87120295,0.000052146836,0.0011266097],"study_design_scores_gemma":[0.00039455548,0.00008671694,0.08993158,0.000011490951,0.0000036624638,0.0000048169927,0.000021911206,0.0022362142,0.0018042808,0.9052764,0.00012108029,0.00010725581],"about_ca_topic_score_codex":0.00015325799,"about_ca_topic_score_gemma":0.00007415137,"teacher_disagreement_score":0.035080537,"about_ca_system_score_codex":0.0000015407044,"about_ca_system_score_gemma":0.00001763238,"threshold_uncertainty_score":0.33283466},"labels":[],"label_agreement":null},{"id":"W2167976352","doi":"10.3968/j.sms.1923845220110302.175","title":"E-Cordial Labeling for Cartesian Product of Some Graphs","year":2011,"lang":"en","type":"article","venue":"Studies in mathematical sciences","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":"Cartesian product; Product (mathematics); Edge-graceful labeling; Mathematics; Cartesian coordinate system; Combinatorics; Enhanced Data Rates for GSM Evolution; Key (lock); Computer science; Graph; Artificial intelligence; Geometry; Line graph; Computer security","score_opus":0.17526828727780389,"score_gpt":0.34929225293288096,"score_spread":0.17402396565507708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167976352","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9384578,0.009369735,0.033005025,0.0020241207,0.0025349753,0.0017963682,0.000005631808,0.0003492046,0.0124571305],"genre_scores_gemma":[0.7419624,0.00005018091,0.25784355,0.00006415383,0.000007537587,0.000046126348,5.8793923e-8,0.0000030808576,0.00002296037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859995,0.00003851749,0.00038403212,0.0003678341,0.0002889437,0.00032074642],"domain_scores_gemma":[0.9991777,0.00031316082,0.00010240943,0.00025235853,0.000110535795,0.00004381503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00170974,0.0001089447,0.0002888857,0.00015792319,0.00017594428,0.000020474365,0.0006637298,0.0000227505,0.000004021466],"category_scores_gemma":[0.0006515997,0.000073325544,0.00006821559,0.00069719594,0.0008942503,0.00027814403,0.00021204233,0.000053363387,0.000005525456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023584241,0.00009348192,0.00049911457,0.00010925607,0.0000127272115,0.0000010777832,0.004713353,0.000008284835,0.00039296196,0.9926206,0.00008643373,0.0014603572],"study_design_scores_gemma":[0.000149854,0.00017204374,0.000090450616,0.00011472064,0.000006200242,0.000002446333,0.0006439178,0.0021142988,0.003488531,0.99310595,0.000008851789,0.000102733306],"about_ca_topic_score_codex":0.000010954723,"about_ca_topic_score_gemma":0.000005769424,"teacher_disagreement_score":0.22483853,"about_ca_system_score_codex":0.000007954695,"about_ca_system_score_gemma":0.00003693366,"threshold_uncertainty_score":0.32949024},"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":"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":"W2202143156","doi":"10.1002/jgt.22146","title":"On the structure of (pan, even hole)‐free graphs","year":2017,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; European Science Foundation","keywords":"Combinatorics; Clique number; Mathematics; Vertex (graph theory); Brooks' theorem; Graph; Split graph; Perfect graph; Clique graph; Discrete mathematics; Chordal graph; 1-planar graph; Pathwidth; Line graph; Graph power","score_opus":0.016997553811456862,"score_gpt":0.24560040152122248,"score_spread":0.2286028477097656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2202143156","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96058434,0.0068410644,0.017339112,0.0055577704,0.006458797,0.0004968902,0.000111138506,0.00007859005,0.0025323234],"genre_scores_gemma":[0.9953618,0.00028441203,0.0038057857,0.00039839654,0.000042138025,0.000001182955,0.0000012642301,0.00002111715,0.000083923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99695754,0.0005831991,0.0008654243,0.00036024154,0.0009452893,0.00028828072],"domain_scores_gemma":[0.9927015,0.0006800231,0.002863683,0.002987198,0.000633755,0.00013388167],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0027808987,0.00035514505,0.0006695004,0.00068435306,0.0002847351,0.00023241824,0.0064053647,0.00031755326,0.000024900693],"category_scores_gemma":[0.00071294256,0.00020407717,0.0008336591,0.00023293395,0.00042853894,0.00018508841,0.0012902977,0.0017256049,0.0000027090662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080009675,0.000079917314,0.00008883985,0.000055066877,0.00030379512,0.000029208104,0.00047574914,0.0008785318,0.002564376,0.9849774,0.007185213,0.003281845],"study_design_scores_gemma":[0.00042606634,0.00023381533,0.00065001426,0.0007159648,0.000079005215,0.00005722634,0.000039887065,0.000090207104,0.003939904,0.99343216,0.00012519244,0.00021052781],"about_ca_topic_score_codex":0.000015230146,"about_ca_topic_score_gemma":0.0000048389647,"teacher_disagreement_score":0.034777466,"about_ca_system_score_codex":0.000018431918,"about_ca_system_score_gemma":0.00025095287,"threshold_uncertainty_score":0.99897045},"labels":[],"label_agreement":null},{"id":"W2209026667","doi":"10.1016/j.akcej.2015.06.006","title":"On k-edge-magic labelings of maximal outerplanar graphs","year":2015,"lang":"en","type":"article","venue":"AKCE International Journal of Graphs and Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Edge-graceful labeling; Conjecture; Discrete mathematics; Graph; 1-planar graph; Chordal graph; Graph power; Line graph","score_opus":0.018041805258217802,"score_gpt":0.2503031048051269,"score_spread":0.2322612995469091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2209026667","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9873874,0.0012248948,0.0045532575,0.0019347711,0.0036602272,0.00005785254,0.0000050738427,0.00003281036,0.0011437003],"genre_scores_gemma":[0.99672806,0.00025874906,0.0025058133,0.0004279099,0.000008844102,6.7349197e-7,0.000001319209,0.000008009756,0.000060594226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981576,0.000055282548,0.00054453406,0.00018373462,0.0008978657,0.00016093894],"domain_scores_gemma":[0.99757963,0.00013308565,0.0005079034,0.00020123442,0.001365742,0.00021241447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070415705,0.0001475823,0.0002517814,0.0005724928,0.00004057892,0.000105789346,0.000918527,0.000068456975,0.0000027916712],"category_scores_gemma":[0.00014013094,0.00012070305,0.00013919632,0.0003876315,0.00008645351,0.00035800712,0.00014168005,0.00024328241,0.0000044766725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065175016,0.00025857557,0.005648431,0.0000059402164,0.000090648915,0.00007879775,0.0003275116,0.000058250465,0.00015303469,0.9880099,0.0030550205,0.002248661],"study_design_scores_gemma":[0.0015453212,0.0009722167,0.0008086877,0.00009641079,0.000017342823,0.00021475727,0.000056068104,0.0011886774,0.0006856269,0.99337065,0.00090617925,0.00013807892],"about_ca_topic_score_codex":0.000023415972,"about_ca_topic_score_gemma":7.672438e-7,"teacher_disagreement_score":0.009340675,"about_ca_system_score_codex":0.000026734186,"about_ca_system_score_gemma":0.000093262046,"threshold_uncertainty_score":0.49221277},"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":"W2245479836","doi":"10.1016/j.dam.2016.06.025","title":"A sharp lower bound on the number of non-equivalent colorings of graphs of order <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si8.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>n</mml:mi></mml:math> and maximum degree <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si11.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>n</mml:mi><mml:mo>−</mml:mo><mml:mn>3</mml:mn></mml:math>","year":2016,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Fédération Wallonie-Bruxelles; Polytechnique Montréal","keywords":"Combinatorics; Mathematics; Partition (number theory); Vertex (graph theory); Upper and lower bounds; Graph; Discrete mathematics","score_opus":0.02050798474540309,"score_gpt":0.24456167879940435,"score_spread":0.22405369405400127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2245479836","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98088443,0.0007725614,0.0049556023,0.00068474066,0.0017464348,0.0004016066,0.0010301035,0.0003593266,0.009165189],"genre_scores_gemma":[0.9757752,0.001366746,0.018732691,0.0011054294,0.00044877484,0.0011568072,0.00039906113,0.000784878,0.00023040682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9857366,0.00028761366,0.004029134,0.002868734,0.0041221953,0.0029556989],"domain_scores_gemma":[0.9862037,0.0028796606,0.0047182697,0.0044699786,0.00055353536,0.0011748688],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts"],"category_scores_codex":[0.003613842,0.0019683705,0.0014117176,0.0006125427,0.0017851411,0.0012434559,0.0036520283,0.0023040993,0.0005285735],"category_scores_gemma":[0.0011789949,0.0021163202,0.0022326354,0.0018137656,0.0030909611,0.001413494,0.003834478,0.0019120986,0.0015870039],"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.0015692388,0.0014476478,0.000021291145,0.003418881,0.0020059342,0.00036394,0.003946798,0.00087181805,0.011319164,0.9705694,0.0032078065,0.0012580972],"study_design_scores_gemma":[0.004642693,0.0024167474,0.00007301786,0.0050482145,0.0023532142,0.00084416673,0.0021524217,0.85553694,0.097672895,0.02511257,0.0016658045,0.0024813223],"about_ca_topic_score_codex":0.0006856855,"about_ca_topic_score_gemma":0.0002404936,"teacher_disagreement_score":0.9454568,"about_ca_system_score_codex":0.000053745294,"about_ca_system_score_gemma":0.0013387508,"threshold_uncertainty_score":0.99979335},"labels":[],"label_agreement":null},{"id":"W2245840520","doi":"10.46298/dmtcs.3417","title":"Labeling planar graphs with a condition at distance two","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Ministrstvo za visoko šolstvo, znanost in tehnologijo; Technische Universität Berlin","keywords":"Combinatorics; Mathematics; Planar graph; Conjecture; Graph; Degree (music); Planar; Delta; Physics; Computer science","score_opus":0.00933332684692764,"score_gpt":0.24531112560698753,"score_spread":0.2359777987600599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2245840520","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.05811948,0.00009424657,0.9365994,0.0014433971,0.00016819623,0.00023747515,0.0000061427586,0.00036680646,0.0029648826],"genre_scores_gemma":[0.56720537,0.0000034348934,0.43230417,0.00042930042,0.000014587537,0.0000108159875,0.0000027216788,0.000011609962,0.000017961824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966063,0.00006486553,0.0004783361,0.00091574056,0.0011613874,0.0007733751],"domain_scores_gemma":[0.9977306,0.00026216017,0.0001925917,0.0011762922,0.00025237375,0.00038595757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001276552,0.00032637818,0.00033199452,0.00023913124,0.00082589855,0.0005866671,0.0018680296,0.000051651008,0.000039230046],"category_scores_gemma":[0.000047272708,0.00023001675,0.00009023955,0.0013026682,0.0024624758,0.00079913356,0.0005675198,0.0002225168,0.0001479688],"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.000007729048,0.00008379389,0.000040533952,0.00002182812,0.00000964282,0.000012719769,0.0010186497,0.00049521733,0.0012783402,0.9950844,0.00007522025,0.0018719468],"study_design_scores_gemma":[0.00041067545,0.00013068196,0.000016576352,0.00012546388,0.000011692593,0.000091016365,0.00001606169,0.52005893,0.003045769,0.47570652,0.00009031639,0.0002963136],"about_ca_topic_score_codex":0.0000022651557,"about_ca_topic_score_gemma":0.00000612047,"teacher_disagreement_score":0.5195637,"about_ca_system_score_codex":0.000073613715,"about_ca_system_score_gemma":0.00007864069,"threshold_uncertainty_score":0.9379811},"labels":[],"label_agreement":null},{"id":"W2252707282","doi":"10.47749/t/unicamp.2014.932506","title":"Sobre a coloração total semiforte","year":2014,"lang":"pt","type":"dissertation","venue":"","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Humanities; Combinatorics; Physics; Mathematics; Philosophy","score_opus":0.013434423130502318,"score_gpt":0.24812632116540909,"score_spread":0.23469189803490675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2252707282","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5188699,0.002438204,0.2323539,0.0031066781,0.030959567,0.0030667575,0.00006106955,0.0032801027,0.20586388],"genre_scores_gemma":[0.8157091,0.0000821644,0.0069380077,0.001231543,0.000041817584,0.000060794926,0.0003908385,0.00007053546,0.17547518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99607986,0.00014565926,0.00085685647,0.0013132843,0.0008221087,0.00078222674],"domain_scores_gemma":[0.99724936,0.00014577075,0.0004993149,0.0011724134,0.0005388645,0.00039424474],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00067336607,0.0006634155,0.0007061746,0.00038773197,0.00046944796,0.000535551,0.0010603395,0.0006831188,0.00030220003],"category_scores_gemma":[0.00007839319,0.0006000052,0.00038427237,0.0008046198,0.00007224302,0.0002990471,0.00022217761,0.00060906354,0.002362246],"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.00019592472,0.0009306197,0.00076060963,0.0013714645,0.000601425,0.00012988536,0.011299993,0.0020636315,0.008252188,0.693442,0.08917901,0.19177328],"study_design_scores_gemma":[0.0026708418,0.0014858692,0.0013459051,0.0015238342,0.00033016026,0.00016424987,0.0012724281,0.9247395,0.006808791,0.04492369,0.0111388825,0.003595882],"about_ca_topic_score_codex":0.0003395749,"about_ca_topic_score_gemma":0.0001238683,"teacher_disagreement_score":0.92267585,"about_ca_system_score_codex":0.000039167702,"about_ca_system_score_gemma":0.00037487288,"threshold_uncertainty_score":0.9996451},"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":"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":"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":"W2283418076","doi":"","title":"Vertex magic total labeling of unions of generalized Petersen graphs and unions of special circulant graphs","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Graph Labeling and Dimension Problems","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":"Toronto Metropolitan University","funders":"","keywords":"Circulant matrix; Mathematics; Combinatorics; MAGIC (telescope); Vertex (graph theory); Circulant graph; Discrete mathematics; Graph; Line graph; Physics","score_opus":0.012969957709401344,"score_gpt":0.23636737829894897,"score_spread":0.22339742058954762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2283418076","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9899424,0.0005712664,0.0025089362,0.00015031353,0.0063249916,0.00019463991,0.0000045499414,0.000024291612,0.00027864956],"genre_scores_gemma":[0.9795536,0.000114833645,0.020190515,0.000017086635,0.00010636054,2.8929566e-7,0.0000010976055,0.000014202541,0.0000020289717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99675906,0.0001671574,0.0017310776,0.00025599753,0.00077412167,0.0003126154],"domain_scores_gemma":[0.9961909,0.0004844183,0.0018500598,0.00038249462,0.0008809209,0.00021120765],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015438409,0.00028662634,0.0011130761,0.00052829814,0.00016560178,0.00008365559,0.0005533357,0.00015118315,0.000002579129],"category_scores_gemma":[0.0002588105,0.00025451282,0.0002892935,0.0007571216,0.00019909225,0.00023497184,0.00024422235,0.00034141,1.9895934e-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.000045712804,0.0005855615,0.00015076986,0.00014124856,0.00010910795,0.00001054405,0.0013134414,0.00011492834,0.018703893,0.9777326,0.00006819524,0.0010240229],"study_design_scores_gemma":[0.004563845,0.0013016078,0.00042768737,0.00063228345,0.00012694807,0.00014193593,0.00017114652,0.0080512725,0.003834712,0.98048735,0.000015106423,0.00024613287],"about_ca_topic_score_codex":0.000022620497,"about_ca_topic_score_gemma":3.006064e-7,"teacher_disagreement_score":0.017681578,"about_ca_system_score_codex":0.000020718917,"about_ca_system_score_gemma":0.00015479568,"threshold_uncertainty_score":0.9999907},"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":"W2295471604","doi":"10.46298/dmtcs.2154","title":"Edge-partitioning graphs into regular and locally irregular components","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"European Commission","keywords":"Mathematics; Combinatorics; Conjecture; Bipartite graph; Partition (number theory); Upper and lower bounds; Prime (order theory); Graph; Discrete mathematics","score_opus":0.010474687591296827,"score_gpt":0.23086652874578822,"score_spread":0.2203918411544914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295471604","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.09900626,0.00008100982,0.8966211,0.0029839242,0.0003147804,0.00019371632,0.0000014183314,0.00026185715,0.00053592876],"genre_scores_gemma":[0.6477915,0.000010388113,0.3519137,0.0002389971,0.000010522643,0.000008884756,5.850285e-7,0.0000114598315,0.0000139993335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967293,0.00010412236,0.0005258396,0.0009696876,0.0009832475,0.00068778085],"domain_scores_gemma":[0.997486,0.00038029067,0.00015237505,0.0012217227,0.00027903763,0.00048055913],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018872455,0.00030385703,0.0003438534,0.00029068466,0.00071544363,0.00064578705,0.0018064466,0.00007959178,0.000023713517],"category_scores_gemma":[0.00017954997,0.0001927822,0.00010018072,0.00090153905,0.0044722105,0.00082730944,0.0014840908,0.0001377067,0.000070219816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028874306,0.000058564605,0.000040230367,0.000029076797,0.000009128616,0.000009521758,0.00077542086,0.000011341535,0.013658877,0.9783992,0.00005010408,0.0069556283],"study_design_scores_gemma":[0.00032011047,0.0000987488,0.000098040495,0.0002797055,0.00000932558,0.000050158018,0.000015019142,0.22030896,0.004799328,0.7737008,0.000043938126,0.00027591927],"about_ca_topic_score_codex":0.0000025366514,"about_ca_topic_score_gemma":5.4204423e-7,"teacher_disagreement_score":0.5487852,"about_ca_system_score_codex":0.00003194681,"about_ca_system_score_gemma":0.00006517412,"threshold_uncertainty_score":0.9982371},"labels":[],"label_agreement":null},{"id":"W2295838866","doi":"10.1080/00029890.2007.11920471","title":"The Map-Coloring Game","year":2007,"lang":"en","type":"article","venue":"American Mathematical Monthly","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Passion; Habilitation; Championship; Mathematics; Graph; Mathematics education; Art; Psychology; Combinatorics; Humanities; History","score_opus":0.009838390673122718,"score_gpt":0.2432806390205084,"score_spread":0.23344224834738567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295838866","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.077907436,0.0005373644,0.7541492,0.009290097,0.00069560285,0.00047325334,0.0000013112266,0.0010277479,0.155918],"genre_scores_gemma":[0.9208014,0.000005076426,0.078120515,0.00063609146,0.000015293606,0.000013620235,2.3317314e-7,0.000011928522,0.0003958408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985144,0.000037239377,0.0003353042,0.00026671987,0.0003508726,0.00049543305],"domain_scores_gemma":[0.99809825,0.00086301577,0.00012351137,0.0006771056,0.000059880927,0.00017823982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010226171,0.00013019939,0.00018318207,0.000053933956,0.00021061827,0.00015047577,0.0007581018,0.00002457298,0.0000060421576],"category_scores_gemma":[0.0001878514,0.00008092987,0.000082625,0.00045299684,0.0003596943,0.000114699615,0.00019874693,0.0001530339,0.00035508434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004606087,0.00004690884,0.00005268251,0.0000061759833,0.000012660899,0.000014717915,0.00032714277,0.000025594241,0.0002498309,0.98208916,0.00063081976,0.01653971],"study_design_scores_gemma":[0.00012959931,0.00013257009,0.00071636506,0.000025351219,0.0000064460055,0.000008888585,0.00019136515,0.015924916,0.0008055361,0.9744175,0.007459441,0.00018202871],"about_ca_topic_score_codex":0.000028801567,"about_ca_topic_score_gemma":0.000006894568,"teacher_disagreement_score":0.84289396,"about_ca_system_score_codex":0.000021521371,"about_ca_system_score_gemma":0.00002027851,"threshold_uncertainty_score":0.45640093},"labels":[],"label_agreement":null},{"id":"W2301955550","doi":"","title":"A Survey of Nordhaus-Gaddum Type Relations","year":2010,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Graph; Mathematics; Combinatorics","score_opus":0.02563547579872708,"score_gpt":0.23818977799189342,"score_spread":0.21255430219316634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2301955550","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9599258,0.004526135,0.013507509,0.006910825,0.010224001,0.00020882516,0.000053667023,0.00013996592,0.004503299],"genre_scores_gemma":[0.9428643,0.00011704066,0.040470306,0.0003421447,0.00004406465,0.0000036712809,0.000025089244,0.000022955743,0.016110409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99817526,0.00025422985,0.0004521828,0.00042517515,0.00030503378,0.0003880974],"domain_scores_gemma":[0.9976385,0.00044384223,0.00022096993,0.0007799097,0.0007139111,0.00020287247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011356783,0.00020399886,0.00027690773,0.00017797212,0.00032623872,0.00010552836,0.00054182136,0.00040112276,0.0002526422],"category_scores_gemma":[0.0007356142,0.00021040242,0.000102102254,0.0012318755,0.0007297241,0.00029413524,0.00011625803,0.00082889554,0.0003303265],"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.00001479543,0.00020526416,0.036665313,0.00003676058,0.00006081278,0.000017247547,0.002502355,0.0001374202,0.0039929785,0.92413914,0.01776287,0.014465045],"study_design_scores_gemma":[0.002157334,0.00078109954,0.49271667,0.0002367533,0.00017054465,0.00018071449,0.00011173599,0.06506259,0.0032417946,0.29301357,0.14077944,0.0015477366],"about_ca_topic_score_codex":0.0045961565,"about_ca_topic_score_gemma":0.0016889126,"teacher_disagreement_score":0.63112557,"about_ca_system_score_codex":0.00002471897,"about_ca_system_score_gemma":0.0002655719,"threshold_uncertainty_score":0.85799617},"labels":[],"label_agreement":null},{"id":"W2316101779","doi":"10.4310/jsg.2015.v13.n4.a1","title":"Upper bound for the Gromov width of flag manifolds","year":2015,"lang":"en","type":"article","venue":"Journal of Symplectic Geometry","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Flag (linear algebra); Mathematics; Combinatorics; Upper and lower bounds; Pure mathematics; Algebra over a field; Mathematical analysis","score_opus":0.035301929639193715,"score_gpt":0.2646725211401162,"score_spread":0.22937059150092248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2316101779","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7296736,0.005318312,0.2571118,0.0042048134,0.0029238998,0.00023155946,0.0000024791184,0.0000322452,0.0005013097],"genre_scores_gemma":[0.980497,0.00003105181,0.018927306,0.00030468142,0.00005673766,0.0000021743451,1.8124811e-7,0.000009042963,0.00017181497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852264,0.0000514271,0.00052590785,0.00013363756,0.00053037377,0.00023598985],"domain_scores_gemma":[0.99778426,0.00044819113,0.00049572124,0.00036003377,0.00076097844,0.00015082418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020206834,0.00010827311,0.00025265853,0.00035220676,0.00010992368,0.00010717276,0.00078366074,0.00005813993,0.000009018453],"category_scores_gemma":[0.00046595844,0.00006624919,0.00019324764,0.00080614403,0.00006189174,0.00029712636,0.000099240846,0.00016451819,0.0000068713116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048930914,0.0014459264,0.032952674,0.00038999927,0.0017297354,0.000110408255,0.007190784,0.0059415386,0.020339344,0.6928685,0.17659461,0.059947215],"study_design_scores_gemma":[0.004065108,0.0033626514,0.008433906,0.00020046328,0.00023750577,0.0017897822,0.0005952604,0.012067994,0.008110334,0.94967926,0.01103881,0.00041892182],"about_ca_topic_score_codex":0.000017555358,"about_ca_topic_score_gemma":0.00000297258,"teacher_disagreement_score":0.2568108,"about_ca_system_score_codex":0.000036959525,"about_ca_system_score_gemma":0.00022403825,"threshold_uncertainty_score":0.27015635},"labels":[],"label_agreement":null},{"id":"W2321141083","doi":"10.4153/cmb-2016-015-5","title":"The Metric Dimension of the Total Graph of a Finite Commutative Ring","year":2016,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","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":"Mathematics; Commutative ring; Graph; Dimension (graph theory); Commutative property; Pure mathematics; Ring (chemistry); Discrete mathematics; Combinatorics","score_opus":0.010826920822537079,"score_gpt":0.204817375359755,"score_spread":0.19399045453721792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2321141083","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8170164,0.0012789895,0.09454842,0.07045832,0.0007100353,0.0010973499,0.000047378788,0.00011539189,0.014727711],"genre_scores_gemma":[0.9965317,0.0000068009954,0.0028552446,0.00014452953,0.0000021526434,0.000007515954,1.0319768e-7,0.0000062963163,0.00044562636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886596,0.00013107814,0.00032832354,0.00015125879,0.00025991056,0.00026346152],"domain_scores_gemma":[0.99724346,0.0016819924,0.00014240078,0.0006302417,0.00013383152,0.00016804138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006404417,0.00009644647,0.00016933387,0.0001303955,0.00019618677,0.00002427515,0.0006648616,0.000044421602,0.00009179618],"category_scores_gemma":[0.0010001957,0.00004184103,0.000110414796,0.00056280714,0.00030616287,0.000026199652,0.00015726905,0.00008784068,0.00017607324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034094078,0.000032892036,0.00007971555,0.000032055083,0.000031859247,0.000003170468,0.0005538163,0.000073302006,0.0016897365,0.9907009,0.0021462138,0.004652919],"study_design_scores_gemma":[0.0007867196,0.00015969713,0.001405748,0.000783024,0.000035189787,0.000033339642,0.00020752045,0.006643892,0.016709745,0.9701409,0.0027892601,0.00030501172],"about_ca_topic_score_codex":0.00045880902,"about_ca_topic_score_gemma":0.00011674561,"teacher_disagreement_score":0.17951533,"about_ca_system_score_codex":0.000026849355,"about_ca_system_score_gemma":0.0001057541,"threshold_uncertainty_score":0.22631241},"labels":[],"label_agreement":null},{"id":"W2321717160","doi":"","title":"Magic coverings and the Kronecker product","year":2009,"lang":"en","type":"article","venue":"Utilitas Mathematica","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":"MAGIC (telescope); Mathematics; Kronecker product; Arithmetic; Product (mathematics); Kronecker delta; Geometry","score_opus":0.008426062970966961,"score_gpt":0.21415170340233255,"score_spread":0.2057256404313656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2321717160","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51205695,0.015432878,0.15900443,0.1444062,0.000880215,0.0031538047,0.000006073249,0.0015135474,0.16354589],"genre_scores_gemma":[0.9508843,0.000025387424,0.047572467,0.0009297434,0.000005489495,0.00000563729,2.8031883e-7,0.0000041238336,0.000572567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990723,0.000046112218,0.00020394834,0.00027638848,0.00020288106,0.00019834962],"domain_scores_gemma":[0.99905556,0.000133211,0.000053938915,0.0006568115,0.000042129464,0.000058345915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000715464,0.000110610155,0.0001662407,0.000040267878,0.00011262522,0.00012463554,0.00036710937,0.000020738515,0.000023734156],"category_scores_gemma":[0.00016152492,0.000062929896,0.000045526023,0.00018859714,0.00015254627,0.0001591773,0.00010535538,0.00008846547,0.00013886695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005743871,0.00004497744,0.0000057226325,0.00001761002,0.0000071275663,0.0000019727222,0.0013664,0.0000022119036,0.00020574604,0.987075,0.0018387906,0.009428741],"study_design_scores_gemma":[0.0005062424,0.00004166837,0.00030082083,0.000035526915,0.000010967939,0.0000478317,0.000027920649,0.017410785,0.00036842926,0.9792269,0.0019171473,0.00010574443],"about_ca_topic_score_codex":0.0000033699969,"about_ca_topic_score_gemma":1.7918929e-7,"teacher_disagreement_score":0.43882734,"about_ca_system_score_codex":0.0000049514283,"about_ca_system_score_gemma":0.000014317074,"threshold_uncertainty_score":0.25662068},"labels":[],"label_agreement":null},{"id":"W2335881901","doi":"10.1007/s00373-017-1816-1","title":"New Bounds for Facial Nonrepetitive Colouring","year":2017,"lang":"en","type":"preprint","venue":"Graphs and Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Artificial intelligence; Mathematics","score_opus":0.024942534201698157,"score_gpt":0.26368803032448707,"score_spread":0.23874549612278892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2335881901","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.22130255,0.018872747,0.68953675,0.0069444533,0.042173855,0.0042555695,0.00020678034,0.00219671,0.014510561],"genre_scores_gemma":[0.9662877,0.00087501516,0.029739646,0.00022344616,0.00004259211,0.00013097987,0.00002845303,0.000040198698,0.0026320135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981921,0.000030360032,0.00028834096,0.0008056883,0.00028908995,0.00039445175],"domain_scores_gemma":[0.9980882,0.000090481044,0.00032655674,0.0009875802,0.00024983645,0.00025735344],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004009637,0.00032520856,0.0004190219,0.0002043236,0.0006939959,0.0009959688,0.0011231517,0.0003365615,0.000001718948],"category_scores_gemma":[0.00007522099,0.0003231459,0.00021754179,0.00012428137,0.000085349835,0.00016654651,0.0013907315,0.0004190936,0.0000031059865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008115819,0.00004277467,0.00050216954,0.000087926295,0.000051757783,0.0000079419115,0.00034013504,0.000012522662,0.000017105811,0.9834912,0.0037995372,0.011638859],"study_design_scores_gemma":[0.00079056644,0.00015104486,0.0005553437,0.00012129101,0.000033715984,0.0000059399426,0.0000099637,0.0019965277,0.0001888816,0.9873541,0.0083909985,0.00040164846],"about_ca_topic_score_codex":0.00019102712,"about_ca_topic_score_gemma":0.000010373747,"teacher_disagreement_score":0.7449851,"about_ca_system_score_codex":0.000027317894,"about_ca_system_score_gemma":0.00029980554,"threshold_uncertainty_score":0.99992204},"labels":[],"label_agreement":null},{"id":"W2346390550","doi":"10.1080/09728600.2005.12088800","title":"Eternally Secure Sets, Independence Sets and Cliques","year":2005,"lang":"en","type":"article","venue":"AKCE International Journal of Graphs and Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Independence number; Mathematics; Combinatorics; Independence (probability theory); Conjecture; Clique number; Discrete mathematics; Counterexample; Complement (music); Chromatic scale; Graph; Statistics","score_opus":0.008757905566550069,"score_gpt":0.2544217706820318,"score_spread":0.24566386511548174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2346390550","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98652214,0.0030755845,0.0039631925,0.0048229666,0.0011570272,0.000046102617,0.0000029899386,0.000038228383,0.0003717839],"genre_scores_gemma":[0.9902289,0.0021841633,0.006699356,0.0008173141,0.000015461721,8.9294895e-7,6.524374e-7,0.0000065522927,0.000046703077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998518,0.00004999479,0.00040354137,0.00019260484,0.0006823166,0.00015357081],"domain_scores_gemma":[0.9985669,0.00009581362,0.00032891607,0.00013623647,0.0007102022,0.00016187731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056497596,0.00013442761,0.00017170486,0.00028769794,0.000083576124,0.00027496836,0.00068000273,0.00008517637,0.0000041468747],"category_scores_gemma":[0.00005009325,0.000112881826,0.00007449099,0.0001719054,0.00006483956,0.0007583516,0.00021590698,0.0003267284,0.0000019308354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028666922,0.00016188365,0.024872968,0.000009209424,0.00011405993,0.0001273891,0.0006626656,0.000028535947,0.00029161808,0.9282936,0.001470063,0.043939367],"study_design_scores_gemma":[0.0012899421,0.0004390861,0.010959247,0.0001431912,0.000020055066,0.0014214172,0.000047881887,0.004704438,0.0007353595,0.97478366,0.0052078855,0.00024783766],"about_ca_topic_score_codex":0.000014675259,"about_ca_topic_score_gemma":0.0000049049713,"teacher_disagreement_score":0.046490088,"about_ca_system_score_codex":0.000023929246,"about_ca_system_score_gemma":0.000060920254,"threshold_uncertainty_score":0.4603187},"labels":[],"label_agreement":null},{"id":"W2353686205","doi":"","title":"A Method for Constructing Arbitrary 16k-order Franklin Perfect Magic Square","year":2013,"lang":"en","type":"article","venue":"Journal of Hainan Normal University","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Petro-Canada","funders":"","keywords":"Magic square; MAGIC (telescope); Square (algebra); Homogeneous space; Mathematics; Order (exchange); Square number; Combinatorics; Arithmetic; Physics; Geometry; Quantum mechanics","score_opus":0.008517278076527095,"score_gpt":0.21241645424308742,"score_spread":0.2038991761665603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2353686205","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.360897,0.00013630097,0.6352506,0.001284014,0.00038845232,0.0001728812,0.000002630992,0.000042233074,0.0018258521],"genre_scores_gemma":[0.35054472,0.000011016084,0.64887935,0.0002402686,0.000022829847,1.5294401e-7,4.4910942e-7,0.000005661405,0.00029556165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895805,0.00013586118,0.00025351468,0.00017398741,0.00021637518,0.0002622222],"domain_scores_gemma":[0.99843675,0.00022539918,0.00033453078,0.00018527458,0.0006583545,0.00015968486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007156061,0.00011992478,0.0002370183,0.00027004644,0.00023488817,0.00007935524,0.0005559761,0.00007280809,0.000043283817],"category_scores_gemma":[0.000059597936,0.000106758336,0.00020312051,0.0003790377,0.000056053952,0.0010213519,0.00013259795,0.0002836117,0.000009433154],"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.00060141075,0.0010189039,0.05026106,0.00058052054,0.00088735786,0.0013694112,0.008407796,0.0060929633,0.022089306,0.6222269,0.03231533,0.25414905],"study_design_scores_gemma":[0.03166827,0.008581245,0.027450807,0.0013458608,0.0008008786,0.009323126,0.019572664,0.45217276,0.021932852,0.32246223,0.100652814,0.004036515],"about_ca_topic_score_codex":0.00008008357,"about_ca_topic_score_gemma":0.000002887694,"teacher_disagreement_score":0.4460798,"about_ca_system_score_codex":0.00004280981,"about_ca_system_score_gemma":0.00015386396,"threshold_uncertainty_score":0.43534786},"labels":[],"label_agreement":null},{"id":"W2360652001","doi":"","title":"On 2-strong edge coloring of some graphs","year":2007,"lang":"en","type":"article","venue":"Journal of Dalian Maritime University","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Bipartite graph; Edge coloring; Combinatorics; Enhanced Data Rates for GSM Evolution; Mathematics; Brooks' theorem; Complete coloring; Indifference graph; Chordal graph; Graph coloring; Tree (set theory); 1-planar graph; Discrete mathematics; Graph; Computer science; Line graph; Telecommunications; Graph power","score_opus":0.010907640855438844,"score_gpt":0.20634631770544398,"score_spread":0.19543867685000513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2360652001","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9613665,0.000106909145,0.030304484,0.0005769132,0.0007601038,0.00006735732,0.0000045187517,0.000037160702,0.0067760795],"genre_scores_gemma":[0.98751986,0.000015930807,0.0119478535,0.00008834469,0.000010901096,6.519422e-9,2.8730057e-7,0.000003364166,0.00041344104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908745,0.00004690131,0.00024940356,0.00011994566,0.0003027185,0.0001935548],"domain_scores_gemma":[0.9989777,0.00012809932,0.00031311455,0.0002026547,0.00022178525,0.00015660767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007939976,0.00008200716,0.00018616671,0.0004660763,0.00010062484,0.000018802028,0.00057268084,0.000056773613,0.000014913277],"category_scores_gemma":[0.000034168315,0.00008165479,0.00014628684,0.00037636186,0.00007108476,0.00048661107,0.00011533436,0.00021538718,0.000006270322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012586701,0.00020380408,0.0039680838,0.000018885901,0.000066517685,0.0004131909,0.00021449984,0.00022128988,0.00271979,0.9861979,0.00259034,0.003259843],"study_design_scores_gemma":[0.019067803,0.008763067,0.14477868,0.0020586327,0.0004312666,0.0009545356,0.0024587684,0.005411952,0.073298074,0.70378155,0.036750093,0.002245608],"about_ca_topic_score_codex":0.000024445739,"about_ca_topic_score_gemma":0.000003895632,"teacher_disagreement_score":0.28241637,"about_ca_system_score_codex":0.00005497823,"about_ca_system_score_gemma":0.00006507772,"threshold_uncertainty_score":0.33297858},"labels":[],"label_agreement":null},{"id":"W2362223432","doi":"","title":"Lobsters Having Perfect Matchings Are Strongly Graceful","year":2012,"lang":"en","type":"article","venue":"Journal of Southwest University","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"","keywords":"Combinatorics; Mathematics; Matching (statistics); Tree (set theory); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Statistics; Telecommunications","score_opus":0.011540814227121471,"score_gpt":0.19046400769314156,"score_spread":0.1789231934660201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2362223432","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9810119,0.00019209468,0.017441995,0.0004127486,0.0006379876,0.000029459723,0.0000021003596,0.00004014105,0.00023157058],"genre_scores_gemma":[0.98886406,0.000008103709,0.010856448,0.00006815127,0.000027544393,1.420909e-8,2.1592611e-7,0.000004907659,0.00017056633],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9990643,0.00008051706,0.00017543073,0.00011423667,0.00029350567,0.00027195827],"domain_scores_gemma":[0.99888784,0.00005931614,0.00041728228,0.00021044319,0.00017388405,0.00025124813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005341638,0.00010762075,0.00018294207,0.00022843324,0.00020251324,0.000059764297,0.0005711122,0.000054140077,0.000010020999],"category_scores_gemma":[0.000026710266,0.00009718981,0.00015674494,0.00026590817,0.00004713606,0.0012296569,0.00016145686,0.0002689978,0.000029398903],"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.00009987195,0.00053864386,0.932639,0.000055013974,0.00020864852,0.0004321606,0.023154337,0.0015378488,0.0041314955,0.031005107,0.0028744598,0.0033234262],"study_design_scores_gemma":[0.008033222,0.0011028377,0.90162796,0.0010486428,0.0005105776,0.0019917807,0.029947774,0.0029525603,0.0019796498,0.006362978,0.042458232,0.0019838002],"about_ca_topic_score_codex":0.00004523036,"about_ca_topic_score_gemma":0.000004238883,"teacher_disagreement_score":0.039583772,"about_ca_system_score_codex":0.000078319244,"about_ca_system_score_gemma":0.000049528844,"threshold_uncertainty_score":0.39632854},"labels":[],"label_agreement":null},{"id":"W2365681620","doi":"","title":"On the(λ,μ)-majical Labeling of Generalized d_m-uniformly Lobsters","year":2010,"lang":"en","type":"article","venue":"Journal of Gansu Normal Colleges","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"","keywords":"Sign (mathematics); Class (philosophy); Graph; Graph theory; Mathematics; Pure mathematics; Computer science; Discrete mathematics; Combinatorics; Artificial intelligence; Mathematical analysis","score_opus":0.010923904711737029,"score_gpt":0.2216663252779253,"score_spread":0.21074242056618825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2365681620","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9914422,0.0001713667,0.0017746311,0.00411058,0.0013054756,0.00008755064,0.0000030458739,0.000021744649,0.0010834062],"genre_scores_gemma":[0.9737504,0.000036654743,0.025286106,0.0007063019,0.000039249266,0.0000013143207,2.450051e-7,0.00000892828,0.00017081392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99826324,0.00009388052,0.00064816047,0.00013817109,0.0006050841,0.00025148204],"domain_scores_gemma":[0.9981278,0.0004192837,0.0005103295,0.00037932122,0.00041543803,0.00014779429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012713416,0.0001451716,0.00029655825,0.00022030185,0.00016612814,0.0000839711,0.0009550185,0.0000907965,0.000048377417],"category_scores_gemma":[0.00025750304,0.00008776329,0.0001969136,0.00041508576,0.000115268376,0.00030919933,0.00010546708,0.0005522189,0.0000095327505],"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.00021620367,0.00029215313,0.0009766213,0.000029231865,0.00012094398,0.00008083152,0.00077899895,0.0018796639,0.17994195,0.8059498,0.007873042,0.0018605646],"study_design_scores_gemma":[0.015551477,0.0072412896,0.005352706,0.001128806,0.000307632,0.00262987,0.0007875203,0.04579132,0.5317122,0.35554287,0.031919744,0.0020345792],"about_ca_topic_score_codex":0.000012760645,"about_ca_topic_score_gemma":0.000010253158,"teacher_disagreement_score":0.4504069,"about_ca_system_score_codex":0.000012023889,"about_ca_system_score_gemma":0.00013155496,"threshold_uncertainty_score":0.3578883},"labels":[],"label_agreement":null},{"id":"W23801234","doi":"10.1701/1295.14331","title":"On vertex-magic and edge-magic total injections of graphs","year":2002,"lang":"en","type":"article","venue":"The Australasian Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; MAGIC (telescope); Vertex (graph theory); Mathematics; Graph; Discrete mathematics; Physics; Quantum mechanics","score_opus":0.015049336506013632,"score_gpt":0.21743340742892694,"score_spread":0.2023840709229133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W23801234","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9900748,0.00088023837,0.0013392473,0.0030954264,0.001622401,0.00009304757,0.0000012077071,0.000029403935,0.0028642416],"genre_scores_gemma":[0.9990387,0.00011305089,0.00039082018,0.00007033909,0.0000063126713,3.7468953e-7,7.673462e-8,0.0000071722357,0.0003731387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987636,0.000101701386,0.00042141095,0.00013040853,0.00037925882,0.0002036128],"domain_scores_gemma":[0.99873334,0.00017399955,0.00035001026,0.0003594963,0.00024245713,0.0001406892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004285109,0.00013361197,0.00022954195,0.00026426392,0.00012832816,0.00007663994,0.00053838635,0.000056043547,0.000017913651],"category_scores_gemma":[0.00008390693,0.0000906492,0.00012298184,0.0007299383,0.0001593727,0.00027628714,0.00006865559,0.000396708,0.0000143099105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009260104,0.00029727945,0.00066841074,0.000014055078,0.00005226834,0.000026476097,0.0008084425,0.00031477158,0.00037159407,0.98900664,0.005870437,0.0025603895],"study_design_scores_gemma":[0.0010248509,0.0013028292,0.003422815,0.000098859775,0.000043301552,0.00082214543,0.000087347296,0.0022424643,0.0010044854,0.98962843,0.0001753876,0.00014705132],"about_ca_topic_score_codex":0.0000038349435,"about_ca_topic_score_gemma":2.3405364e-7,"teacher_disagreement_score":0.008963929,"about_ca_system_score_codex":0.000018237562,"about_ca_system_score_gemma":0.000026217192,"threshold_uncertainty_score":0.3696567},"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":"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":"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":"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":"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":"W2395165879","doi":"","title":"Cosine Infinite Product: 11210.","year":2007,"lang":"en","type":"article","venue":"American Mathematical Monthly","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":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Grossman; Combinatorics; Mathematics; Product (mathematics); Group (periodic table); Philosophy; Humanities; Physics; Demography; Economics; Geometry; Sociology","score_opus":0.011264894109245744,"score_gpt":0.2462845448247279,"score_spread":0.23501965071548214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395165879","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.11885631,0.0003131856,0.6318848,0.006709582,0.00033515,0.00063020067,0.000004599458,0.0014272481,0.2398389],"genre_scores_gemma":[0.78018504,0.0000023441746,0.21835567,0.0011227157,0.000018588886,0.00000945058,0.0000014137461,0.0000145666145,0.00029021996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982104,0.000036086123,0.0004285235,0.00042687767,0.0004053162,0.00049285265],"domain_scores_gemma":[0.9983498,0.000305764,0.0001578643,0.00082399714,0.000112772745,0.00024982405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007861845,0.00018121698,0.00030142098,0.00014474384,0.00010229828,0.0000881347,0.0005873084,0.000026687838,0.000025643474],"category_scores_gemma":[0.00029151762,0.00014472884,0.00008112582,0.0009346362,0.00032458946,0.00018287404,0.00018797083,0.00016484052,0.0004659573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009239793,0.00027364484,0.00030277637,0.000028782619,0.000021996557,0.00004115553,0.00057026383,0.00004132307,0.0014500197,0.9730942,0.0019409762,0.02222562],"study_design_scores_gemma":[0.00038648373,0.00034983043,0.0028016013,0.000096858625,0.000016954336,0.00003899044,0.00011304863,0.01349379,0.0045635365,0.97231823,0.005306364,0.00051428075],"about_ca_topic_score_codex":0.000047376296,"about_ca_topic_score_gemma":0.0000048081347,"teacher_disagreement_score":0.66132873,"about_ca_system_score_codex":0.000019361314,"about_ca_system_score_gemma":0.000030259653,"threshold_uncertainty_score":0.5989094},"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"W2402914599","doi":"","title":"Characterization of 3-regular halin graphs with edge-face total chromatic number equal to four","year":2014,"lang":"en","type":"article","venue":"HKBU Institutional Repository (Hong Kong Baptist University)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics; Characterization (materials science); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.0074326846844066366,"score_gpt":0.17153015405309152,"score_spread":0.16409746936868488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402914599","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6404802,0.0000037225066,0.3550103,0.00008293967,0.00034721082,0.00012712649,0.000004377608,0.00010965946,0.0038344474],"genre_scores_gemma":[0.9840206,0.0000012856345,0.014261333,0.000054880602,0.000023276021,0.0000015745884,0.000015977383,0.00000912627,0.0016119779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99839866,0.00011742098,0.00026021333,0.0004687081,0.0005104263,0.0002445883],"domain_scores_gemma":[0.99879557,0.0000503839,0.00019115004,0.0004752262,0.00028743807,0.0002002334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018358234,0.00019433215,0.00023208719,0.0002993182,0.0005064726,0.00008776329,0.0004972198,0.000090991525,0.000007108635],"category_scores_gemma":[0.000028566257,0.0001931486,0.000088875124,0.0008844246,0.000252555,0.00067911093,0.00018191578,0.000120288736,0.000044048047],"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.00005408699,0.000151067,0.0046342607,0.00006260058,0.00007226516,0.0001752698,0.00025338496,0.0063693197,0.1410121,0.8464895,0.00005070572,0.0006754379],"study_design_scores_gemma":[0.013245649,0.003350229,0.39616337,0.004688554,0.0007115375,0.0059295124,0.00048432936,0.18810435,0.3222466,0.023846496,0.034896694,0.0063326755],"about_ca_topic_score_codex":0.00007721633,"about_ca_topic_score_gemma":0.000007607277,"teacher_disagreement_score":0.822643,"about_ca_system_score_codex":0.00009875637,"about_ca_system_score_gemma":0.00019267776,"threshold_uncertainty_score":0.7876371},"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"W2407557179","doi":"","title":"On the number of longest and almost longest cycles in cubic graphs","year":2012,"lang":"en","type":"article","venue":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.015028047264565305,"score_gpt":0.21435697845807938,"score_spread":0.19932893119351408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407557179","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97823745,0.00045440492,0.0043984954,0.0020290038,0.00011754846,0.00055815425,0.00003392688,0.00016494676,0.014006041],"genre_scores_gemma":[0.98655504,0.0005404322,0.012414169,0.000091015325,0.0000056545946,2.6697657e-7,0.000004291445,0.000018421952,0.00037068938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99686134,0.00036233844,0.0005098374,0.0007442018,0.0008216977,0.0007005846],"domain_scores_gemma":[0.9961494,0.0013194497,0.00053458725,0.001333748,0.00028096023,0.00038182447],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001373462,0.000404187,0.0008341286,0.0005333107,0.00030629712,0.0000209635,0.0024196496,0.0005631345,0.00033316368],"category_scores_gemma":[0.00024022174,0.00040280848,0.0003785543,0.0017277261,0.0019397101,0.00062369835,0.0016591947,0.00087095523,0.00008684767],"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.0009975752,0.0036702377,0.10598283,0.0003142005,0.0002556833,0.00030365403,0.0010268489,0.0001053637,0.019976247,0.85094213,0.010017159,0.006408089],"study_design_scores_gemma":[0.010840261,0.0023009828,0.85754573,0.0028964246,0.0008063961,0.0006968295,0.003890806,0.0020898818,0.008864024,0.09893398,0.0074992594,0.0036353918],"about_ca_topic_score_codex":0.0007376543,"about_ca_topic_score_gemma":0.00045126647,"teacher_disagreement_score":0.75200814,"about_ca_system_score_codex":0.00013058039,"about_ca_system_score_gemma":0.00011734932,"threshold_uncertainty_score":0.9998424},"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"W2482026737","doi":"10.1016/j.dam.2017.08.003","title":"The geometric–arithmetic index and the chromatic number of connected graphs","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","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":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics; Graph; Upper and lower bounds; Discrete mathematics; Clique number; Critical graph; Arithmetic; Graph power; Line graph","score_opus":0.011429767381227902,"score_gpt":0.2472710161311256,"score_spread":0.2358412487498977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2482026737","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65192574,0.0009331258,0.28956583,0.0044593257,0.00052512786,0.0021307277,0.000009952702,0.00032662725,0.05012356],"genre_scores_gemma":[0.9758853,0.00008207788,0.023828063,0.00006796829,0.0000035097812,0.000048354377,6.260127e-7,0.0000119945225,0.00007212963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986993,0.000029129458,0.00041517723,0.00022161365,0.00038623964,0.00024854462],"domain_scores_gemma":[0.9967668,0.00093727536,0.0005257571,0.001618995,0.00008607985,0.00006510905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010190811,0.0001633264,0.0003116147,0.00006414316,0.0009288097,0.00048734774,0.0013785247,0.00005929696,0.000004278334],"category_scores_gemma":[0.00036217595,0.000080524245,0.0000794062,0.00030429527,0.00086563046,0.000104727595,0.000530484,0.00014435161,0.000017667284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006239552,0.000024317775,0.000083300336,0.00006651018,0.00004840275,6.3606046e-7,0.00074499624,0.00000451163,0.00017544725,0.9966695,0.0001154462,0.0020607298],"study_design_scores_gemma":[0.001285777,0.000012037609,0.0007247236,0.000048107722,0.00003986773,0.000017384162,0.00021072397,0.03669981,0.00082122406,0.9599439,0.00005613642,0.00014031418],"about_ca_topic_score_codex":0.000028424583,"about_ca_topic_score_gemma":0.0000041757194,"teacher_disagreement_score":0.32395956,"about_ca_system_score_codex":0.0000048128254,"about_ca_system_score_gemma":0.000022720862,"threshold_uncertainty_score":0.7143747},"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":"W2491086478","doi":"10.4153/cmb-2016-048-1","title":"The Metric Dimension of Circulant Graphs","year":2016,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Graph Labeling and Dimension Problems","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":"Mathematics; Combinatorics; Conjecture; Vertex (graph theory); Graph; Dimension (graph theory); Circulant matrix; Metric dimension; Discrete mathematics; Line graph; Pathwidth","score_opus":0.010192367293578978,"score_gpt":0.19852955127851837,"score_spread":0.1883371839849394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2491086478","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44151276,0.0045060115,0.2467939,0.2539134,0.001798765,0.0017149025,0.000039680323,0.0006487179,0.049071856],"genre_scores_gemma":[0.9949622,0.00002745914,0.00397641,0.0003833962,0.0000031581944,0.000009443019,2.2025901e-7,0.000007923884,0.00062976277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882346,0.000063561274,0.00028966198,0.0002124593,0.00025197133,0.00035890666],"domain_scores_gemma":[0.9982219,0.00061779335,0.000072423114,0.00062599545,0.0001056533,0.00035623639],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00064990186,0.000100317564,0.00015162828,0.0001921709,0.00017408517,0.00004542763,0.00059529155,0.0000536223,0.00024939727],"category_scores_gemma":[0.0005092539,0.000048605514,0.00008351995,0.000432711,0.00015277465,0.00002755054,0.00006894384,0.000058863792,0.0019900294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.827761e-7,0.000012378228,0.000037178463,0.000009584153,0.000010044338,0.000008463321,0.000037094265,0.0000010467796,0.00086152874,0.98200655,0.008881078,0.008134251],"study_design_scores_gemma":[0.00028858832,0.000058539972,0.00020725584,0.00014202885,0.000010051469,0.00003493445,0.000019474226,0.00076346274,0.002067614,0.96378654,0.032440078,0.00018142711],"about_ca_topic_score_codex":0.00032654408,"about_ca_topic_score_gemma":0.00010452441,"teacher_disagreement_score":0.55344945,"about_ca_system_score_codex":0.000033570934,"about_ca_system_score_gemma":0.000107833985,"threshold_uncertainty_score":0.99878705},"labels":[],"label_agreement":null},{"id":"W2492614083","doi":"10.1016/j.dam.2017.11.012","title":"Infection in hypergraphs","year":2017,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; University of Regina","keywords":"Hypergraph; Combinatorics; Bipartite graph; Mathematics; Discrete mathematics; Interval (graph theory); Graph","score_opus":0.02514417235462804,"score_gpt":0.26820127831009205,"score_spread":0.243057105955464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2492614083","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.27058274,0.00059174607,0.58256656,0.0009856622,0.0025011806,0.0021274558,0.000019990195,0.001384481,0.1392402],"genre_scores_gemma":[0.786214,0.00026068452,0.21300101,0.000095214345,0.000019236228,0.00021714062,0.000024089068,0.000039047234,0.00012957248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981484,0.000017165772,0.0005019712,0.00063403184,0.0003608217,0.00033765114],"domain_scores_gemma":[0.99717045,0.000059042344,0.00047100603,0.0021527843,0.000055250977,0.00009143933],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054465275,0.00033749256,0.00048544732,0.0003205342,0.00015416116,0.00045069272,0.0012342116,0.00032922064,0.000004999509],"category_scores_gemma":[0.000051400497,0.00030582864,0.00014917323,0.00016270738,0.000084718995,0.000113763024,0.0015999329,0.00062195223,0.0000842948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018779699,0.00012943792,0.00018448915,0.0004818385,0.000031769858,0.000008973939,0.0011983361,0.0011128893,0.0005661869,0.9928899,0.00038394527,0.0030103768],"study_design_scores_gemma":[0.00026607735,0.000011205458,0.00035015636,0.00030042083,0.00001809876,0.0000044696435,0.000011990256,0.03167182,0.0006889812,0.9661063,0.00017871357,0.0003917859],"about_ca_topic_score_codex":0.00011129505,"about_ca_topic_score_gemma":0.0000392386,"teacher_disagreement_score":0.51563126,"about_ca_system_score_codex":0.00003581397,"about_ca_system_score_gemma":0.00008667411,"threshold_uncertainty_score":0.9999394},"labels":[],"label_agreement":null},{"id":"W2494429694","doi":"10.1007/978-3-642-30979-3","title":"Advances in Combinatorics","year":2013,"lang":"en","type":"book","venue":"","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Algebraic combinatorics; Combinatorics; Computer science; Mathematics","score_opus":0.0067392729314816775,"score_gpt":0.20561253754739034,"score_spread":0.19887326461590865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2494429694","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.0000029676405,0.0052330126,0.0055097938,0.00019287721,0.0007888112,0.00013601733,3.2781477e-7,0.000194663,0.9879415],"genre_scores_gemma":[0.00028889684,0.0011927568,0.006126891,0.00035298115,0.0000054430307,0.000014389506,0.000004421943,0.000012123568,0.99200207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989322,0.000017037431,0.000236578,0.00036684392,0.00024309424,0.00020427872],"domain_scores_gemma":[0.99918526,0.00006314041,0.00008706532,0.0005205219,0.000076988355,0.000067005196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013531432,0.00016646436,0.0002199623,0.00021788797,0.0000284986,0.00008349481,0.0007261294,0.0001690619,0.000049589642],"category_scores_gemma":[0.000010212453,0.00013757555,0.000049634895,0.00016751929,0.000030940453,0.0003707566,0.00021507383,0.0002489281,0.00064327294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.1240315e-7,0.00001455598,0.0000077592495,0.00001677643,0.0000011242613,0.0000054326433,0.000018067029,0.000010918347,7.1434874e-7,0.9282584,0.06199463,0.009671474],"study_design_scores_gemma":[0.00010526,0.000022071303,0.0000026574855,0.00005676659,8.3140685e-7,0.0000017701934,5.957931e-7,0.0012363647,0.0000065464637,0.7148279,0.2835952,0.00014405734],"about_ca_topic_score_codex":0.000012946708,"about_ca_topic_score_gemma":0.00000826861,"teacher_disagreement_score":0.22160056,"about_ca_system_score_codex":0.000046901478,"about_ca_system_score_gemma":0.00014477572,"threshold_uncertainty_score":0.82681865},"labels":[],"label_agreement":null},{"id":"W2498290661","doi":"10.1090/cbms/117/12","title":"Virtually special quotients","year":2012,"lang":"en","type":"book-chapter","venue":"Regional conference series in mathematics","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":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Quotient; Pure mathematics; Mathematics","score_opus":0.052159941244193354,"score_gpt":0.24133260782516106,"score_spread":0.1891726665809677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2498290661","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.00015629204,0.00073035836,0.012713023,0.0011444327,0.0015139002,0.00047585837,0.000017024475,0.00024225103,0.98300683],"genre_scores_gemma":[0.007011864,0.0021113013,0.16150421,0.0006758229,0.0006267301,0.00003901919,0.00007382028,0.00014305458,0.82781416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769974,0.000022749324,0.0006535823,0.00046506914,0.0007536544,0.00040522366],"domain_scores_gemma":[0.9982238,0.00011760367,0.00039160645,0.0008557513,0.00025324975,0.00015799585],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034932472,0.00043556828,0.0005485408,0.0002794057,0.000094224844,0.00015127183,0.0011386332,0.00036842996,0.0003649695],"category_scores_gemma":[0.00004106,0.00040731987,0.00014826295,0.000084198175,0.00028823,0.00044806412,0.00044723807,0.00048742318,0.00052647694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004780517,0.000054533604,0.000004007938,0.00008646998,0.000021286134,0.000016573094,0.0010276788,0.0000040159443,0.000016565824,0.9927754,0.0027268832,0.0032617957],"study_design_scores_gemma":[0.00016308799,0.00006849185,0.000008274516,0.0006014969,0.000013652853,0.0000660268,0.000034084325,0.00037798766,0.000024810619,0.91599864,0.08219959,0.000443891],"about_ca_topic_score_codex":0.0000025805598,"about_ca_topic_score_gemma":0.00002165182,"teacher_disagreement_score":0.15519269,"about_ca_system_score_codex":0.00006594351,"about_ca_system_score_gemma":0.0002522817,"threshold_uncertainty_score":0.9998379},"labels":[],"label_agreement":null},{"id":"W2517927273","doi":"10.1142/s1793525319500286","title":"Regular finite decomposition complexity","year":2018,"lang":"en","type":"article","venue":"Journal of Topology and Analysis","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Quotient; Metric (unit); Decomposition; Metric space; Finite set; Dimension (graph theory)","score_opus":0.019835813342562222,"score_gpt":0.2896183107464865,"score_spread":0.26978249740392424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2517927273","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4994301,0.0004768005,0.49485943,0.0046597808,0.0002255051,0.000012521701,7.22426e-7,0.000014186146,0.00032097506],"genre_scores_gemma":[0.95459265,0.00003813648,0.044811495,0.0004827956,0.000025188652,1.09638194e-7,6.2840166e-7,0.0000010982664,0.000047931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993696,0.00009100676,0.0002492709,0.00010620952,0.00008528359,0.000098626806],"domain_scores_gemma":[0.99928576,0.000061803374,0.00021588709,0.0001544637,0.00021231554,0.00006975801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045512957,0.000053332853,0.00020998172,0.00035833954,0.00015201063,0.000034649907,0.0001999501,0.000045924287,0.000040233917],"category_scores_gemma":[0.000030007599,0.000040613544,0.000128999,0.00050836103,0.0002391247,0.00015036114,0.000055136454,0.000086765314,0.0000050772423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011571973,0.00035835122,0.072531484,0.000017454566,0.0039482275,0.00012436217,0.0018253954,0.0010374334,0.008347568,0.8829408,0.0034624985,0.025290668],"study_design_scores_gemma":[0.0008600854,0.0009971898,0.044285372,0.000025390604,0.0010919083,0.0003458769,0.00006921628,0.1216756,0.0037220917,0.82474124,0.0019465698,0.00023944654],"about_ca_topic_score_codex":0.000013504827,"about_ca_topic_score_gemma":0.000013370181,"teacher_disagreement_score":0.45516253,"about_ca_system_score_codex":0.000005283196,"about_ca_system_score_gemma":0.000014608156,"threshold_uncertainty_score":0.16561723},"labels":[],"label_agreement":null},{"id":"W2521291831","doi":"10.5539/jmr.v8n5p29","title":"Super Lehmer-3 Mean Labeling","year":2016,"lang":"en","type":"article","venue":"Journal of Mathematics Research","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; Injective function; Graph; Path (computing)","score_opus":0.1252837588298523,"score_gpt":0.37315727480741534,"score_spread":0.24787351597756305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2521291831","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.656246,0.0013764467,0.3201123,0.016917849,0.0007601251,0.00021923357,0.0000015916285,0.00008309981,0.004283351],"genre_scores_gemma":[0.77098703,0.00023809288,0.22738296,0.00006127355,0.00004571498,0.0000019517663,3.6326853e-8,0.000016050524,0.0012668796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973887,0.00016262206,0.00053524645,0.00014048694,0.0013975626,0.00037538537],"domain_scores_gemma":[0.9969549,0.001043137,0.00016398901,0.0004702736,0.0011728344,0.000194836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006459722,0.00008486253,0.0002111858,0.00047977382,0.00013950071,0.00014078607,0.0011182739,0.00005598156,0.000049901344],"category_scores_gemma":[0.0008713916,0.000045125395,0.00010061121,0.00045254835,0.00010344745,0.00040528236,0.00026797157,0.00031235866,0.00018180364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012828172,0.0006469673,0.00029065582,0.00013456184,0.00010501995,0.00015908098,0.0050752372,0.000032230026,0.26665357,0.67121446,0.021249365,0.03442603],"study_design_scores_gemma":[0.0012603228,0.0004929687,0.00003683205,0.00094988104,0.0000096903495,0.00043331712,0.0005780342,0.003893054,0.04425217,0.9439769,0.0039057161,0.00021111687],"about_ca_topic_score_codex":0.0000037587781,"about_ca_topic_score_gemma":0.0000015480799,"teacher_disagreement_score":0.27276245,"about_ca_system_score_codex":0.000046035362,"about_ca_system_score_gemma":0.00016057568,"threshold_uncertainty_score":0.23367786},"labels":[],"label_agreement":null},{"id":"W2525136984","doi":"10.5539/jmr.v8n5p48","title":"Degree Splitting of Heronian Mean Graphs","year":2016,"lang":"en","type":"article","venue":"Journal of Mathematics Research","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":"Span (engineering); Life span; Mathematics; Medicine","score_opus":0.17264571576399948,"score_gpt":0.37133044703165896,"score_spread":0.19868473126765948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2525136984","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90113413,0.00061374664,0.091799855,0.0031523425,0.00024518307,0.00014254905,0.0000012018342,0.000026503167,0.0028844797],"genre_scores_gemma":[0.86956304,0.000094536095,0.13005903,0.0000117333875,0.000011975176,9.228518e-7,1.7846931e-8,0.000009291696,0.0002494664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997529,0.00017448148,0.0006944872,0.00012443353,0.0011535238,0.00032410593],"domain_scores_gemma":[0.99689114,0.00091849273,0.0004000599,0.00048496155,0.0011441525,0.00016120945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070783384,0.00008040726,0.00025330117,0.00056417147,0.00009152139,0.00006275148,0.0011195303,0.00005388303,0.00002198585],"category_scores_gemma":[0.0006936303,0.000044591157,0.00013137516,0.000553072,0.0001520023,0.00026437172,0.0002483278,0.00026534256,0.000025680189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014000775,0.0005415378,0.0008642155,0.00026706432,0.000103584214,0.000052231706,0.0037470735,0.000014543515,0.16495006,0.7602618,0.0027070066,0.06647688],"study_design_scores_gemma":[0.0008080183,0.00049267657,0.00023653422,0.0011306353,0.000007767468,0.00018790674,0.0003699534,0.0025220024,0.03251523,0.9613504,0.00026406863,0.00011480737],"about_ca_topic_score_codex":0.0000060256407,"about_ca_topic_score_gemma":0.0000028436416,"teacher_disagreement_score":0.20108859,"about_ca_system_score_codex":0.00003140557,"about_ca_system_score_gemma":0.00015246014,"threshold_uncertainty_score":0.2453225},"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":"W2557089399","doi":"10.1016/j.dam.2016.10.019","title":"Colorful edge decomposition of graphs: Some polynomial cases","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Bipartite graph; Neighbourhood (mathematics); Graph; Degree (music); Bound graph; Discrete mathematics; Graph power; Line graph","score_opus":0.014900855999108661,"score_gpt":0.25000016638817546,"score_spread":0.23509931038906678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2557089399","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.737573,0.00017433136,0.25528985,0.0007572913,0.0003665465,0.0005317153,0.000032406988,0.0003848233,0.0048899828],"genre_scores_gemma":[0.9042463,0.000021464166,0.09552723,0.00010144317,0.00000979409,0.000027348819,0.0000028147288,0.000013798485,0.000049811042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987964,0.000014198107,0.00040999762,0.00027118094,0.00025879956,0.0002493954],"domain_scores_gemma":[0.9987773,0.00026378487,0.00022796326,0.000578199,0.000058522062,0.00009423352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022922507,0.00016144456,0.00026409488,0.00013746669,0.00008459991,0.000039381703,0.00046569153,0.00007238436,0.000013722288],"category_scores_gemma":[0.0000279506,0.00010584543,0.000095263975,0.00022025655,0.00012571408,0.0001984988,0.00017358141,0.000050699487,0.00007623122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008355015,0.000090079375,0.000010714275,0.000052129526,0.000020185513,0.000003573349,0.00030183882,0.0000046243854,0.14862524,0.8477394,0.0010033865,0.0021404512],"study_design_scores_gemma":[0.0010600904,0.00015857536,0.000060895876,0.00017285222,0.000036863454,0.000037797927,0.000086347754,0.0014726594,0.20102425,0.7953102,0.00022453416,0.0003549325],"about_ca_topic_score_codex":0.000005280614,"about_ca_topic_score_gemma":0.000001256839,"teacher_disagreement_score":0.16667324,"about_ca_system_score_codex":0.000015821262,"about_ca_system_score_gemma":0.00003321296,"threshold_uncertainty_score":0.43162513},"labels":[],"label_agreement":null},{"id":"W2560469491","doi":"10.1016/j.dam.2016.10.028","title":"On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Bipartite graph; Graph; Neighbourhood (mathematics); Discrete mathematics; Bound graph; Natural number; Graph power; Line graph","score_opus":0.032713960018532925,"score_gpt":0.2527626002009583,"score_spread":0.22004864018242537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560469491","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78842705,0.000023314358,0.18463281,0.0012182238,0.00023341518,0.00074929115,0.000035802157,0.00019693335,0.024483174],"genre_scores_gemma":[0.9276338,0.0000065980576,0.07221446,0.00007432953,0.0000026245657,0.000023614006,0.0000012490641,0.000013649311,0.000029634231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984996,0.000027132604,0.0004964408,0.00026408702,0.00046458573,0.00024819357],"domain_scores_gemma":[0.99791473,0.00070355216,0.00040705316,0.00080611394,0.00010465654,0.000063915606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005414267,0.00017512379,0.00032437834,0.000051680792,0.000103221966,0.00002982593,0.0007864214,0.000052664855,0.000027470898],"category_scores_gemma":[0.00015768659,0.00009260185,0.00011159147,0.00030352152,0.00033583876,0.000058299145,0.00024655907,0.0000977249,0.000031529922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006575251,0.000098109944,0.000030179082,0.00007256889,0.000027333008,5.8475126e-7,0.0007012995,0.000003942231,0.013236673,0.9845723,0.00023807025,0.0010123699],"study_design_scores_gemma":[0.0004342738,0.000039148043,0.00012437934,0.0002458635,0.00001615886,0.0000025457045,0.00010172586,0.0032818217,0.028715225,0.96686554,0.000030073346,0.00014325227],"about_ca_topic_score_codex":0.0000130349545,"about_ca_topic_score_gemma":0.0000012405211,"teacher_disagreement_score":0.1392068,"about_ca_system_score_codex":0.000016413449,"about_ca_system_score_gemma":0.000025451829,"threshold_uncertainty_score":0.37761936},"labels":[],"label_agreement":null},{"id":"W2561327776","doi":"10.1002/jgt.22447","title":"List coloring with requests","year":2019,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McGill University","funders":"Grantová Agentura České Republiky; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"List coloring; Graph coloring; Combinatorics; Fractional coloring; Computer science; Graph; Context (archaeology); Complete coloring; Edge coloring; Information retrieval; Mathematics; Theoretical computer science; Graph power; Geography; Line graph","score_opus":0.012991545565198168,"score_gpt":0.23166689249630712,"score_spread":0.21867534693110896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561327776","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.673893,0.009938674,0.29558733,0.0016724522,0.009082891,0.0004927461,0.000006533625,0.00023954596,0.009086868],"genre_scores_gemma":[0.96690416,0.00028501626,0.03202192,0.00035649101,0.00005899801,0.0000032051569,8.621487e-7,0.000025550476,0.00034379706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978713,0.00028889033,0.0006209773,0.000344016,0.0005993911,0.00027546086],"domain_scores_gemma":[0.9969371,0.00024016033,0.0012084555,0.00088269735,0.00056332257,0.00016829376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002630833,0.00026848234,0.00053428824,0.0006147247,0.000088570116,0.00026103505,0.0016061807,0.00019748343,0.0000103300235],"category_scores_gemma":[0.00007431926,0.000185997,0.00030480517,0.00033056963,0.00012272573,0.0003062075,0.00058017846,0.0012001521,0.000012360194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025096716,0.00018584359,0.0023546985,0.00022578599,0.00047072727,0.00037050847,0.0010943421,0.008419404,0.0010243998,0.9788413,0.0023062797,0.004455722],"study_design_scores_gemma":[0.0006336073,0.000511499,0.0006538826,0.0013589858,0.00007637872,0.00040557657,0.000040842326,0.000383883,0.00081375905,0.99395496,0.00081936363,0.00034723635],"about_ca_topic_score_codex":0.000008881538,"about_ca_topic_score_gemma":0.0000020691493,"teacher_disagreement_score":0.29301122,"about_ca_system_score_codex":0.000041536958,"about_ca_system_score_gemma":0.0003555541,"threshold_uncertainty_score":0.7584738},"labels":[],"label_agreement":null},{"id":"W2567527899","doi":"10.1007/s10878-016-0107-8","title":"Is there any polynomial upper bound for the universal labeling of graphs?","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Graph; Upper and lower bounds; Edge-graceful labeling; Graph labeling; Bound graph; Theory of computation; Complement graph; Time complexity","score_opus":0.012562332345063607,"score_gpt":0.23358023687300947,"score_spread":0.22101790452794587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567527899","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.0333217,0.00088994147,0.9495563,0.007576619,0.008279381,0.00023631412,0.0000060018806,0.000027789576,0.000105938256],"genre_scores_gemma":[0.9237513,0.00026753187,0.075644,0.00014798291,0.00010634838,0.0000015475883,3.6309171e-7,0.000013098083,0.00006784126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989494,0.00006110705,0.00041971685,0.00011344494,0.00031003117,0.00014631022],"domain_scores_gemma":[0.99804413,0.0003437448,0.00056863215,0.00022137737,0.0007476633,0.000074431184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067384786,0.00009418465,0.00018331806,0.00014665157,0.00014567446,0.00007106295,0.00050720363,0.00007394146,0.000013950852],"category_scores_gemma":[0.00018327504,0.000051692823,0.0001656959,0.0002831678,0.00006659534,0.00050777866,0.000053516713,0.00007598106,8.058804e-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.00060570793,0.0003681732,0.0020601328,0.000036705682,0.00038154586,0.000004971436,0.0013479526,0.05741605,0.013958959,0.8972253,0.020334497,0.0062599625],"study_design_scores_gemma":[0.024760926,0.0031939277,0.00048924144,0.00078314147,0.0003805899,0.00007205777,0.0002483233,0.2056333,0.041398585,0.7106303,0.011654777,0.0007548212],"about_ca_topic_score_codex":0.0000071501076,"about_ca_topic_score_gemma":1.188124e-7,"teacher_disagreement_score":0.89042956,"about_ca_system_score_codex":0.000030799554,"about_ca_system_score_gemma":0.00018684652,"threshold_uncertainty_score":0.21079722},"labels":[],"label_agreement":null},{"id":"W2569327627","doi":"10.5539/jmr.v9n1p62","title":"Some New Results on Super Heronian Mean","year":2017,"lang":"en","type":"article","venue":"Journal of Mathematics Research","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; Graph; Combinatorics","score_opus":0.1930091791461418,"score_gpt":0.4075550989231595,"score_spread":0.2145459197770177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2569327627","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8374292,0.0015580567,0.01604056,0.11135961,0.0032950167,0.0006624932,0.000006648127,0.00012503949,0.029523337],"genre_scores_gemma":[0.86419356,0.00027265467,0.12864949,0.00015708886,0.00031167644,0.0000013839248,2.0182651e-7,0.00002539722,0.0063885725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997407,0.00011612287,0.0005389922,0.00017928753,0.001383069,0.0003754898],"domain_scores_gemma":[0.9970142,0.0004154643,0.00037508743,0.0013205438,0.00055019633,0.000324488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006010129,0.00009998454,0.0002339614,0.0003697341,0.0005160704,0.0007885218,0.002407688,0.00007058892,0.000009579314],"category_scores_gemma":[0.0015044007,0.0000689741,0.00011012848,0.00012508043,0.00011708372,0.00058591354,0.0003784336,0.00066833437,0.00018626431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007533473,0.00075402146,0.000058146506,0.000090830305,0.00009020197,0.00023551552,0.006780689,0.00017546327,0.004855649,0.8604089,0.110191,0.016284259],"study_design_scores_gemma":[0.001847562,0.00094422436,0.0002950896,0.0006107428,0.000006046957,0.00014149178,0.00019321914,0.0075285155,0.006341236,0.97665435,0.0052728555,0.00016465611],"about_ca_topic_score_codex":0.00003533699,"about_ca_topic_score_gemma":0.000007532307,"teacher_disagreement_score":0.11624547,"about_ca_system_score_codex":0.000046548314,"about_ca_system_score_gemma":0.0002903715,"threshold_uncertainty_score":0.76037335},"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"W2578469740","doi":"10.1016/j.dam.2016.12.020","title":"Comparing the metric and strong dimensions of graphs","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Combinatorics; Metric dimension; Mathematics; Vertex (graph theory); Distance; Discrete mathematics; Graph; Shortest path problem; Pathwidth; Line graph","score_opus":0.03617348319051178,"score_gpt":0.26470515853816484,"score_spread":0.22853167534765306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578469740","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71874493,0.0006014488,0.24545039,0.0008020976,0.0002533315,0.00067571516,0.0000046511773,0.00019403514,0.033273403],"genre_scores_gemma":[0.925342,0.000031036696,0.07455487,0.000025005154,0.0000019313254,0.0000105503,5.4246715e-7,0.0000072164057,0.000026838825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912816,0.00000930128,0.0002535776,0.0001963101,0.00023463268,0.00017799014],"domain_scores_gemma":[0.9982569,0.00015620026,0.00029900967,0.0011861091,0.000040749066,0.00006103151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040727964,0.00011681322,0.000226142,0.00008527402,0.00054149923,0.00019142726,0.0008396552,0.000033703123,0.000001225364],"category_scores_gemma":[0.000056934783,0.00006493889,0.00004892989,0.0001506723,0.00022048621,0.00011378739,0.00059312466,0.00010361473,0.0000054675174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.809277e-7,0.000023756036,0.00035008971,0.000034338816,0.00002087552,4.3531543e-7,0.00057748886,0.000044630626,0.0016622973,0.99649894,0.000069280504,0.0007171119],"study_design_scores_gemma":[0.000566759,0.000033642817,0.0033625741,0.000084586085,0.00006379073,0.000009055709,0.0004165045,0.094146065,0.005491257,0.89547825,0.00010062966,0.00024691405],"about_ca_topic_score_codex":0.000017759043,"about_ca_topic_score_gemma":0.000003585312,"teacher_disagreement_score":0.20659707,"about_ca_system_score_codex":0.0000032527705,"about_ca_system_score_gemma":0.000011645732,"threshold_uncertainty_score":0.4164829},"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":"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":"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":"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":"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":"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":"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":"W2580517118","doi":"10.5539/jmr.v9n1p90","title":"$\\ga$-Max Labelings of Graphs","year":2017,"lang":"en","type":"article","venue":"Journal of Mathematics Research","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; Graph; Order (exchange); Value (mathematics); Statistics","score_opus":0.1496076923604602,"score_gpt":0.4124399501363448,"score_spread":0.2628322577758846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2580517118","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94814944,0.0013441964,0.030713107,0.009076884,0.00079126726,0.00025599467,0.000002452616,0.000032734435,0.009633899],"genre_scores_gemma":[0.84955055,0.00020737335,0.14984693,0.000018857942,0.0000184439,0.0000011510974,5.3697175e-8,0.000009696084,0.0003469466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99739546,0.00009673676,0.0006411085,0.0001248545,0.0014470136,0.000294842],"domain_scores_gemma":[0.99595195,0.00041011468,0.0007701516,0.0010311396,0.0016794533,0.00015717132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068417224,0.0000843057,0.00030484694,0.0004894796,0.00035405796,0.00030568842,0.0025102603,0.000065844004,0.000015180832],"category_scores_gemma":[0.0016111303,0.000060716837,0.00014471548,0.00023911535,0.00025770118,0.00042510525,0.00049435237,0.00047796205,0.000025665999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001511463,0.00058624183,0.00087439513,0.0003761382,0.00011885549,0.0001038696,0.002888071,0.0000558488,0.04224839,0.9345249,0.006604833,0.011603319],"study_design_scores_gemma":[0.0006007259,0.00035161426,0.00038561996,0.0004669577,0.000009057042,0.00011563007,0.0001476798,0.007374642,0.01893619,0.97087455,0.0006414233,0.00009590515],"about_ca_topic_score_codex":0.000019454894,"about_ca_topic_score_gemma":0.0000022090119,"teacher_disagreement_score":0.11913382,"about_ca_system_score_codex":0.000012566379,"about_ca_system_score_gemma":0.00016824268,"threshold_uncertainty_score":0.466473},"labels":[],"label_agreement":null},{"id":"W2582851771","doi":"10.1016/j.tcs.2017.01.028","title":"Algorithmic complexity of weakly semiregular partitioning and the representation number","year":2017,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","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":false,"route_about_ca":false,"ca_institutions":"Western University; Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Injective function; Bipartite graph; Vertex (graph theory); Graph; Conjecture; Modulo; Degree (music); Discrete mathematics; Induced subgraph; Physics","score_opus":0.031946229294501596,"score_gpt":0.29685800832948783,"score_spread":0.26491177903498625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582851771","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.060497027,0.00015099722,0.9304885,0.0048985053,0.0011290109,0.00043708025,0.0000053437097,0.000145039,0.0022484583],"genre_scores_gemma":[0.8349707,0.000028342965,0.16477935,0.00015298926,0.00003458333,0.000016217724,0.0000023318662,0.0000064605506,0.000009042738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969268,0.0003280948,0.00047772267,0.000984927,0.0008893149,0.00039317142],"domain_scores_gemma":[0.9964586,0.00033469152,0.00043614313,0.0021683369,0.00043118524,0.00017104635],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0035208885,0.00024219375,0.00045996765,0.00010709953,0.00094312464,0.0009993549,0.002904066,0.00011238116,0.000013291847],"category_scores_gemma":[0.0002177554,0.00016451051,0.00013005623,0.000318139,0.020713525,0.00036873532,0.0056903902,0.00046694843,0.000013113469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010366136,0.000024145962,0.00010778704,0.000027090096,0.000011574068,0.0000031039765,0.0006489741,0.0003885809,0.00009216134,0.99218124,0.000044926666,0.0064600473],"study_design_scores_gemma":[0.00025223923,0.000015044464,0.0007457657,0.00011143272,0.000010842003,0.000022253851,0.0000030644976,0.43057388,0.0011520775,0.5669924,0.0000049219475,0.000116083254],"about_ca_topic_score_codex":0.00010125147,"about_ca_topic_score_gemma":0.0000013431753,"teacher_disagreement_score":0.77447367,"about_ca_system_score_codex":0.000022826473,"about_ca_system_score_gemma":0.00016934866,"threshold_uncertainty_score":0.98195153},"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":"W2592359012","doi":"","title":"Recognition of certain square geometric graphs.","year":2015,"lang":"en","type":"article","venue":"Cologne Twente Workshop on Graphs and Combinatorial Optimization","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":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Square (algebra); Computer science; Combinatorics; Mathematics; Discrete mathematics; Geometry","score_opus":0.028525369718188715,"score_gpt":0.24278333765265558,"score_spread":0.21425796793446686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592359012","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6875706,0.0038251975,0.2790812,0.0023622438,0.019221375,0.0020796258,0.000028172573,0.0011687686,0.004662885],"genre_scores_gemma":[0.9869564,0.00043849705,0.012238497,0.00018977637,0.0000121833955,0.000035999576,0.000053211974,0.000017233133,0.00005818503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982312,0.00016977558,0.00042912224,0.00047040955,0.00042254978,0.00027697545],"domain_scores_gemma":[0.9983474,0.00019222121,0.00028937013,0.00037403704,0.00057311915,0.00022383375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064400927,0.00021455468,0.00031154367,0.0008573948,0.00015123856,0.00011017049,0.00031950636,0.00019811573,0.000009127953],"category_scores_gemma":[0.00030521798,0.00020165204,0.00009752528,0.0027822114,0.000109186534,0.00032098702,0.00013102796,0.00018201402,0.0000052757937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043835695,0.0012975221,0.0023627318,0.00006299986,0.00010380173,0.000014328945,0.00063013565,0.07386598,0.00008034035,0.8587288,0.0063269082,0.05608806],"study_design_scores_gemma":[0.00787937,0.002646253,0.0005447959,0.0002925135,0.00008943984,0.000014089153,0.00027300086,0.13175105,0.0008542972,0.85422945,0.0006276077,0.0007981181],"about_ca_topic_score_codex":0.000020673322,"about_ca_topic_score_gemma":0.0000014117585,"teacher_disagreement_score":0.29938588,"about_ca_system_score_codex":0.000029443463,"about_ca_system_score_gemma":0.000063069085,"threshold_uncertainty_score":0.8223132},"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":"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":"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":"W2596078115","doi":"","title":"Variable Neighborhood Search for Extremal Graphs. 23. On the Randic Index and the Chromatic Number","year":2006,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Graph; Vertex (graph theory); Simple graph; Connectivity; Chromatic scale; Bound graph; Degree (music); Discrete mathematics; Graph power; Physics; Line graph","score_opus":0.007890478338472364,"score_gpt":0.19889675716680183,"score_spread":0.19100627882832946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2596078115","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59414923,0.0009740605,0.3689033,0.015574441,0.0005925648,0.0015412975,0.000009388862,0.00028808723,0.017967623],"genre_scores_gemma":[0.99055463,0.000014643626,0.0074188355,0.0012053703,0.000029089972,0.00008225437,0.0000032563817,0.000013491077,0.0006784054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986216,0.00018237319,0.00022233582,0.0003247022,0.0003065586,0.00034243375],"domain_scores_gemma":[0.9983202,0.0009885913,0.00007104103,0.00049816,0.00006627362,0.000055728346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010546618,0.00016250127,0.00018936495,0.00006813039,0.0008018165,0.0002814137,0.00049106893,0.00009554599,0.000017585151],"category_scores_gemma":[0.000048491256,0.00008550107,0.00009431776,0.00042831802,0.000425967,0.000114594135,0.00007371226,0.0002520546,0.00001812873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039202798,0.000036898724,0.00088918075,0.000015671914,0.000023921106,0.0000029187927,0.0005549638,0.00012912528,0.00008023553,0.9946613,0.0027080358,0.0008585959],"study_design_scores_gemma":[0.0028410088,0.00004987023,0.00084237347,0.00002830559,0.00001918227,0.000041457937,0.00006222919,0.05879502,0.00022098729,0.93613863,0.0007976917,0.00016321748],"about_ca_topic_score_codex":0.00018026451,"about_ca_topic_score_gemma":0.0000047935214,"teacher_disagreement_score":0.39640543,"about_ca_system_score_codex":0.000018583167,"about_ca_system_score_gemma":0.00003872527,"threshold_uncertainty_score":0.61670053},"labels":[],"label_agreement":null},{"id":"W2604074509","doi":"","title":"On a Reduction of the Interval Coloring Problem to a Series of Bandwidth Coloring Problems","year":2007,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; Université Laval","funders":"","keywords":"Mathematics; Combinatorics; Fractional coloring; Complete coloring; Graph coloring; Edge coloring; Greedy coloring; Vertex (graph theory); Discrete mathematics; Integer (computer science); Interval (graph theory); Graph; Computer science; Graph power","score_opus":0.012243409374160056,"score_gpt":0.22165136163024504,"score_spread":0.209407952256085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604074509","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.636723,0.0001513943,0.35836738,0.0024179379,0.00034757974,0.0010585419,0.0000051809507,0.00033002172,0.0005989948],"genre_scores_gemma":[0.88227606,0.000011669678,0.11697297,0.00027010325,0.000013984902,0.00014035088,7.737811e-7,0.000022971592,0.000291099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99765164,0.00009674743,0.00074092933,0.00044894227,0.00051019917,0.0005515321],"domain_scores_gemma":[0.9980554,0.00010316553,0.00041346898,0.0009821147,0.00026011062,0.0001857567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016944108,0.00024602032,0.00035139656,0.00049905776,0.00019637744,0.00007416537,0.0010082105,0.00014801657,0.0000028787317],"category_scores_gemma":[0.00016503793,0.0001947424,0.00017376003,0.0015097759,0.000120549754,0.00035881536,0.00050564855,0.0003101921,0.0000027315857],"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.00027542823,0.0004458984,0.0051226704,0.00017562445,0.000064803855,0.000008063719,0.0030931681,0.021308035,0.30239686,0.6529597,0.00074445445,0.013405252],"study_design_scores_gemma":[0.0008209179,0.0017856904,0.012572915,0.0010820057,0.0000328625,0.00017438536,0.00024585205,0.014737003,0.88964415,0.077712595,0.0006461217,0.00054552604],"about_ca_topic_score_codex":0.0019534598,"about_ca_topic_score_gemma":0.0006998184,"teacher_disagreement_score":0.58724725,"about_ca_system_score_codex":0.00018152164,"about_ca_system_score_gemma":0.00014616613,"threshold_uncertainty_score":0.79413646},"labels":[],"label_agreement":null},{"id":"W2605053740","doi":"","title":"The minimum labeling Hamiltonian cycle problem","year":2011,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Hamiltonian path; Computer science; Hamiltonian (control theory); Hamiltonian path problem; Mathematical optimization; Mathematics; Theoretical computer science; Graph","score_opus":0.014594101821550643,"score_gpt":0.21321894146383924,"score_spread":0.1986248396422886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605053740","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.069736205,0.012530795,0.60677606,0.06033817,0.0025525754,0.0020507516,0.000043153,0.0027264776,0.24324581],"genre_scores_gemma":[0.5705806,0.0014393722,0.4145609,0.00037556404,0.000016876407,0.00019509508,0.00007842543,0.00008170708,0.01267143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929969,0.0038087894,0.000760971,0.0011810949,0.00059771613,0.00065454876],"domain_scores_gemma":[0.99097645,0.0013463949,0.0006731799,0.004499569,0.0022346638,0.0002697675],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.008663789,0.0004324018,0.0003710296,0.00018807534,0.0011890855,0.0012969751,0.004488283,0.0003294234,0.000021707992],"category_scores_gemma":[0.0007212921,0.00035865337,0.00027225746,0.00055963517,0.00035675016,0.00022292991,0.004107356,0.0009559287,0.00013025536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048886395,0.0003257747,0.00024236382,0.000089016394,0.000088100904,0.0000062701383,0.009996727,0.000148767,0.0016499612,0.92471063,0.0021431288,0.060594376],"study_design_scores_gemma":[0.00088121765,0.000001388333,0.0006731329,0.0029215328,0.000067619934,0.00002957456,0.0001088608,0.11003573,0.035633713,0.81817985,0.030179543,0.0012878288],"about_ca_topic_score_codex":0.0012647135,"about_ca_topic_score_gemma":0.0010171063,"teacher_disagreement_score":0.5008444,"about_ca_system_score_codex":0.000067756795,"about_ca_system_score_gemma":0.00040711573,"threshold_uncertainty_score":0.9998866},"labels":[],"label_agreement":null},{"id":"W2608743836","doi":"10.1090/crmp/043/02","title":"Elementary additive combinatorics","year":2007,"lang":"en","type":"book-chapter","venue":"CRM proceedings & lecture notes","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; Algebraic combinatorics; Mathematics","score_opus":0.020394583924042763,"score_gpt":0.23568122646594988,"score_spread":0.21528664254190713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608743836","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.00013672729,0.0031367582,0.02637787,0.0013582801,0.0014441377,0.0005778455,0.00003194056,0.0009667926,0.9659696],"genre_scores_gemma":[0.9519334,0.0012866798,0.016567336,0.014496787,0.00089840253,0.00008423248,0.00032842456,0.0005231123,0.013881623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969199,0.0000038863336,0.00053856306,0.0010941798,0.0008096785,0.00063380547],"domain_scores_gemma":[0.9979182,0.00018179584,0.00046800793,0.0003784727,0.0007949852,0.00025857857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004226745,0.0006978895,0.00055905804,0.0005289931,0.00031657965,0.00029736667,0.0010898077,0.00069143635,0.00012816],"category_scores_gemma":[0.00011803081,0.0006408018,0.0002527634,0.00025317312,0.00014070942,0.00030983612,0.00042833842,0.0011126595,0.00017854047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008180979,0.000026880016,0.000021546362,0.000056328576,0.00008049175,0.000023144607,0.00036703094,0.0000020605523,0.00016860597,0.9738576,0.0019731068,0.023415022],"study_design_scores_gemma":[0.00028811887,0.00021830131,0.000008894477,0.00027025383,0.00006282932,0.000041008832,0.0000051708307,0.00017005682,0.0039421828,0.8923995,0.10192228,0.0006714412],"about_ca_topic_score_codex":0.000013386545,"about_ca_topic_score_gemma":0.000004207328,"teacher_disagreement_score":0.952088,"about_ca_system_score_codex":0.00013207285,"about_ca_system_score_gemma":0.00011902154,"threshold_uncertainty_score":0.99960434},"labels":[],"label_agreement":null},{"id":"W2609109031","doi":"10.1090/crmm/013/08","title":"Hulls of aperiodic solids and gap labeling theorems","year":2000,"lang":"en","type":"book-chapter","venue":"CRM monograph series","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Aperiodic graph; Hull; Mathematics; Environmental science; Materials science; Combinatorics; Composite material","score_opus":0.01689712500396351,"score_gpt":0.2093794853660456,"score_spread":0.19248236036208208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2609109031","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.01745344,0.049226593,0.001986902,0.00095799076,0.0015423315,0.0009609316,0.000094619885,0.0011539168,0.9266233],"genre_scores_gemma":[0.6463296,0.07529231,0.102808625,0.0028174415,0.0002657152,0.00013895289,0.00018498863,0.0006121178,0.17155027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803185,0.000027207745,0.00057930173,0.00066366274,0.00034696827,0.00035097665],"domain_scores_gemma":[0.99843276,0.00007256167,0.00029442023,0.00090360333,0.0001417062,0.00015494949],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002746174,0.00046310003,0.0006249421,0.0005344132,0.000243276,0.0002091568,0.00063871447,0.0003521759,0.00008821126],"category_scores_gemma":[0.000008626164,0.0004196903,0.00024005766,0.00016705405,0.00087795965,0.00034915033,0.0002573269,0.00033445645,0.000022598833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019502239,0.000014967676,0.00005005333,0.00008199941,0.0000867886,0.000012853612,0.0009364695,0.000015395059,0.00041571807,0.98445046,0.00023482859,0.013680985],"study_design_scores_gemma":[0.00026687127,0.0002456482,0.000019096313,0.00042975481,0.000057242072,0.00004862083,0.000035301364,0.0001363202,0.0006833554,0.96841073,0.029131625,0.0005354078],"about_ca_topic_score_codex":0.000018503824,"about_ca_topic_score_gemma":0.000006663377,"teacher_disagreement_score":0.755073,"about_ca_system_score_codex":0.0000062531635,"about_ca_system_score_gemma":0.00006522236,"threshold_uncertainty_score":0.9998255},"labels":[],"label_agreement":null},{"id":"W2609797714","doi":"10.7494/opmath.2017.37.4.509","title":"The metric dimension of circulant graphs and their Cartesian products","year":2017,"lang":"en","type":"article","venue":"Opuscula Mathematica","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Circulant matrix; Dimension (graph theory); Cartesian product; Metric dimension; Combinatorics; Metric (unit); Discrete mathematics; Pure mathematics; Chordal graph; Graph","score_opus":0.01731345232753533,"score_gpt":0.23363241100494803,"score_spread":0.2163189586774127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2609797714","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9578879,0.005319581,0.0200451,0.009190583,0.0008517751,0.0010669805,0.000004142032,0.00027833073,0.005355619],"genre_scores_gemma":[0.9884892,0.000101517304,0.011261469,0.00002408627,0.0000031525838,0.000011660341,3.5419626e-7,0.000008600064,0.00009994423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989149,0.00005309159,0.0002646472,0.00030406314,0.00024013128,0.00022319202],"domain_scores_gemma":[0.9975334,0.00017099002,0.00026215275,0.0018172615,0.00014183018,0.00007435946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008981779,0.00013908818,0.0002288864,0.00009283701,0.0007714578,0.0002808855,0.00085193367,0.000039898114,8.454888e-7],"category_scores_gemma":[0.00041604377,0.00007354293,0.00007468733,0.00021614341,0.00023017413,0.00019041455,0.0003436244,0.000078901496,0.000008202975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025462584,0.00009286715,0.00029864797,0.00015546483,0.00006398519,0.0000043882924,0.0012479019,0.000007014468,0.01407535,0.96641016,0.00038886725,0.017252801],"study_design_scores_gemma":[0.00042124453,0.0000970957,0.0026198921,0.00020722205,0.000030299425,0.000075995886,0.00014538119,0.028745105,0.027819548,0.9391006,0.00047497757,0.00026258713],"about_ca_topic_score_codex":0.000020083504,"about_ca_topic_score_gemma":0.0000016159369,"teacher_disagreement_score":0.030601328,"about_ca_system_score_codex":0.000004985429,"about_ca_system_score_gemma":0.000029537661,"threshold_uncertainty_score":0.59335077},"labels":[],"label_agreement":null},{"id":"W2610356145","doi":"","title":"Full friendly index sets and full product-cordial index sets of some permutation petersen graphs","year":2013,"lang":"en","type":"article","venue":"HKBU Institutional Repository (Hong Kong Baptist University)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Index (typography); Permutation (music); Combinatorics; Mathematics; Product (mathematics); Discrete mathematics; Computer science; World Wide Web; Art","score_opus":0.006995533678889896,"score_gpt":0.18465219322190046,"score_spread":0.17765665954301058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610356145","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9867948,0.00014097373,0.007884595,0.00021250152,0.00094781176,0.000318139,0.0000103466,0.00016474066,0.0035260904],"genre_scores_gemma":[0.99535125,0.0000177161,0.0040579964,0.000046779216,0.000026243682,0.000003220329,0.000016497364,0.000009477392,0.0004708044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99797183,0.00011936903,0.00033837534,0.00069360516,0.0005558296,0.00032100186],"domain_scores_gemma":[0.99856323,0.00006412386,0.00025806972,0.00046076096,0.0004252913,0.00022850918],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016211347,0.00024773108,0.0002531834,0.0006276127,0.00070923765,0.00015991663,0.00049687305,0.0001316745,0.000009571501],"category_scores_gemma":[0.000038978622,0.0002669696,0.00011330119,0.0006743583,0.00060944696,0.0019193785,0.00030230352,0.00024621672,0.00002361394],"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.00036664735,0.00054459943,0.054741964,0.00025440773,0.0002964252,0.00089596363,0.0012155442,0.008063917,0.09604711,0.8298442,0.0011179217,0.00661132],"study_design_scores_gemma":[0.008777168,0.0023500537,0.77755785,0.0009211955,0.0002978607,0.0033948775,0.0011772822,0.11044703,0.009355734,0.07439212,0.007883925,0.0034448917],"about_ca_topic_score_codex":0.00058341346,"about_ca_topic_score_gemma":0.000030897445,"teacher_disagreement_score":0.75545204,"about_ca_system_score_codex":0.0001170471,"about_ca_system_score_gemma":0.00035972436,"threshold_uncertainty_score":0.99997824},"labels":[],"label_agreement":null},{"id":"W2611890383","doi":"","title":"On the alpha-labeling number of bipartite graphs","year":2000,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":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; Alpha (finance); Graph; Statistics","score_opus":0.018893353001895607,"score_gpt":0.25394341498076656,"score_spread":0.23505006197887096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611890383","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9191398,0.0002796862,0.0032577168,0.0028047564,0.0001645561,0.00036325792,0.0000058757587,0.00030633964,0.07367803],"genre_scores_gemma":[0.9771813,0.000018348057,0.021528006,0.0005411799,0.0000024771252,0.000018924164,6.014148e-7,0.000010480184,0.00069865695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986645,0.00008046173,0.00037217364,0.00026362488,0.0003609444,0.00025828675],"domain_scores_gemma":[0.9983619,0.00045258403,0.00008072296,0.0009724604,0.00006296629,0.00006936703],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000681604,0.0001402459,0.00019470252,0.000053982047,0.00013647141,0.00004990549,0.00065846567,0.000044285236,0.0013852689],"category_scores_gemma":[0.000117842705,0.00008576291,0.00011424173,0.00046254462,0.00012144741,0.00010951274,0.00006695255,0.000116486546,0.0011624949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003965792,0.00014583883,0.00002744826,0.000028116177,0.000021734617,0.0000015869399,0.00077415316,0.000025587315,0.00019205024,0.99069333,0.0030223797,0.005063829],"study_design_scores_gemma":[0.0001580825,0.000043608165,0.000038162867,0.00013590744,0.0000108473705,0.000011892913,0.000028417424,0.022514842,0.0012776224,0.97507185,0.0005958456,0.00011289669],"about_ca_topic_score_codex":0.0000086192085,"about_ca_topic_score_gemma":4.156652e-7,"teacher_disagreement_score":0.072979376,"about_ca_system_score_codex":0.0000051826746,"about_ca_system_score_gemma":0.000018773926,"threshold_uncertainty_score":0.9996152},"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":"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":"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":"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":"W2617869480","doi":"","title":"Harmonic Mean Labeling for Some Special Graphs","year":2013,"lang":"en","type":"article","venue":"Journal of Mathematics Research","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":"Mathematics; Combinatorics; Graph; Harmonic mean; Enhanced Data Rates for GSM Evolution; Harmonic; Geometry; Physics; Artificial intelligence; Quantum mechanics; Computer science","score_opus":0.11294825846908643,"score_gpt":0.35899460926918175,"score_spread":0.24604635080009532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617869480","genre_codex":"empirical","genre_gemma":"methods","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.89087594,0.0022616123,0.091675706,0.010057306,0.0019680238,0.0012732515,0.0000030687215,0.0000858988,0.0017991774],"genre_scores_gemma":[0.34520012,0.0003737456,0.65269977,0.00019443916,0.0004734386,0.00003686253,5.026239e-7,0.000039485694,0.0009816631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974877,0.000103451915,0.0006388843,0.000159666,0.0011444625,0.00046584068],"domain_scores_gemma":[0.99691266,0.0007794383,0.00026178765,0.00038821014,0.0014414095,0.00021648269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004726844,0.0001038113,0.00026598072,0.0006108313,0.00023245461,0.00040634978,0.0011612759,0.000056137516,0.000051807863],"category_scores_gemma":[0.00051397004,0.00007582552,0.00017638989,0.00046665862,0.000086199696,0.0006333737,0.0002025896,0.00045678596,0.00012582325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007744626,0.0004679091,0.000024381863,0.00020579486,0.000086111635,0.000020255029,0.0022685223,0.00007074688,0.023440221,0.90297323,0.056854654,0.013580407],"study_design_scores_gemma":[0.0005473419,0.0002885392,0.000013750033,0.00013324399,0.000006048228,0.00006829334,0.00023594225,0.018085517,0.006370601,0.9732063,0.00095088175,0.0000935545],"about_ca_topic_score_codex":0.000007790774,"about_ca_topic_score_gemma":0.0000013182884,"teacher_disagreement_score":0.561024,"about_ca_system_score_codex":0.000041204203,"about_ca_system_score_gemma":0.00016757488,"threshold_uncertainty_score":0.39184403},"labels":[],"label_agreement":null},{"id":"W2736029126","doi":"10.1016/j.disc.2018.03.001","title":"On the metric dimension of incidence graphs","year":2018,"lang":"en","type":"preprint","venue":"Discrete Mathematics","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Memorial University of Newfoundland","keywords":"Metric dimension; Combinatorics; Mathematics; Bipartite graph; Vertex (graph theory); Chordal graph; Antipodal point; Dimension (graph theory); Discrete mathematics; Indifference graph; Graph; 1-planar graph; Geometry","score_opus":0.02706137648428678,"score_gpt":0.2649673037469288,"score_spread":0.237905927262642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736029126","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70431477,0.00093000557,0.28134575,0.0019543413,0.0019453127,0.0013229573,0.000033140765,0.00044628826,0.0077074575],"genre_scores_gemma":[0.9214988,0.000059149188,0.07802854,0.00025358237,0.000008756457,0.000031735362,0.000005293393,0.000024152541,0.00009001396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99757546,0.0001245117,0.0006427654,0.00052659534,0.0008538476,0.0002768276],"domain_scores_gemma":[0.9956727,0.0008309228,0.0007045186,0.002408177,0.0003018362,0.00008184646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012852222,0.00032508592,0.00045987256,0.00036979027,0.00014972682,0.00014098876,0.0020410593,0.0001976411,0.000019357956],"category_scores_gemma":[0.0006425396,0.0001920048,0.000261316,0.0008230195,0.0002341339,0.000072784,0.0020365494,0.00044646944,0.000088720895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023439125,0.000094461626,0.00002375382,0.00023619918,0.000051567084,0.000003080522,0.001305873,0.0004600967,0.00024511534,0.99490744,0.0024483483,0.0002217229],"study_design_scores_gemma":[0.000077086566,0.00010073782,0.000028534965,0.0007352378,0.000033854052,0.000004155135,0.000047481743,0.09681416,0.0041517913,0.8977746,0.000015074493,0.00021732245],"about_ca_topic_score_codex":0.000021677204,"about_ca_topic_score_gemma":0.0000011921494,"teacher_disagreement_score":0.21718402,"about_ca_system_score_codex":0.000020318914,"about_ca_system_score_gemma":0.00008042155,"threshold_uncertainty_score":0.7829728},"labels":[],"label_agreement":null},{"id":"W2740436644","doi":"","title":"ℤ k -magic labellings of fans and wheels with magic value zero.","year":2009,"lang":"en","type":"article","venue":"The Australasian Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"MAGIC (telescope); Mathematics; Zero (linguistics); Combinatorics; Physics; Philosophy; Linguistics; Astronomy","score_opus":0.007878301333030588,"score_gpt":0.21294287892108904,"score_spread":0.20506457758805846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740436644","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9446206,0.0013466555,0.040180314,0.01202585,0.00045613508,0.00015617636,0.0000010294187,0.000039930306,0.0011733208],"genre_scores_gemma":[0.9938329,0.00015074771,0.0056080846,0.00018094557,0.000007655906,1.4738666e-7,1.1294872e-7,0.000007080646,0.00021234331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985783,0.00009859244,0.00045832002,0.00014597237,0.00047216794,0.0002466604],"domain_scores_gemma":[0.9985285,0.000090318434,0.00051678537,0.00037316245,0.00033505625,0.0001561979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008107803,0.000158883,0.00030085817,0.00015926466,0.00008932182,0.00009477617,0.0007806407,0.000055543405,0.0000022587315],"category_scores_gemma":[0.000024107117,0.0000954521,0.000074678355,0.00059358036,0.00015139666,0.0003396636,0.00004397335,0.00036571908,0.0000030441815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003583812,0.00023271763,0.0016044958,0.000024717508,0.000057807156,0.00007497,0.0015649487,0.00089152687,0.002372814,0.9894189,0.001128549,0.0025926956],"study_design_scores_gemma":[0.0012979286,0.0019032002,0.0035116693,0.00018295906,0.00006551514,0.00072002143,0.00007571956,0.0008011608,0.0061002453,0.9848074,0.00036066465,0.0001735221],"about_ca_topic_score_codex":0.0000039640786,"about_ca_topic_score_gemma":1.2344633e-7,"teacher_disagreement_score":0.049212296,"about_ca_system_score_codex":0.000015879412,"about_ca_system_score_gemma":0.00008442936,"threshold_uncertainty_score":0.38924238},"labels":[],"label_agreement":null},{"id":"W2741039047","doi":"","title":"Group-magic labelings and null sets of complete n-partite graphs with a deleted edge","year":2013,"lang":"en","type":"article","venue":"HKBU Institutional Repository (Hong Kong Baptist University)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; MAGIC (telescope); Enhanced Data Rates for GSM Evolution; Group (periodic table); Graph; Discrete mathematics; Computer science; Physics; Artificial intelligence","score_opus":0.008530074050837267,"score_gpt":0.16266730822019282,"score_spread":0.15413723416935554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741039047","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9744479,0.0001991533,0.018574279,0.00016901975,0.00026690078,0.00025120607,0.000009272416,0.00018621219,0.0058960565],"genre_scores_gemma":[0.97908324,0.000018031173,0.020258628,0.00008734525,0.000006863742,0.0000018205226,0.000011002505,0.000008164374,0.00052491395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9984649,0.00008081674,0.00025711753,0.0005185281,0.00039237927,0.0002862916],"domain_scores_gemma":[0.99872017,0.00007595766,0.00019088437,0.0003986748,0.00039759226,0.00021674455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000116637166,0.00021068244,0.00024190005,0.0003911862,0.00058733305,0.00012440649,0.00046955966,0.00008746507,0.000008435209],"category_scores_gemma":[0.000015557405,0.00020007623,0.00007301209,0.0007968131,0.00069597835,0.0009446924,0.00022891602,0.0001824541,0.000025346852],"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.000049313836,0.00018746831,0.020535395,0.00008272339,0.00012485983,0.00040619823,0.00022605089,0.0006877992,0.04148619,0.93505037,0.00033794716,0.00082567544],"study_design_scores_gemma":[0.024120884,0.0044819196,0.51698256,0.004262141,0.00092163886,0.0072103543,0.0011983626,0.22748439,0.023556227,0.11617254,0.06629967,0.0073093246],"about_ca_topic_score_codex":0.0006451699,"about_ca_topic_score_gemma":0.000029906152,"teacher_disagreement_score":0.8188778,"about_ca_system_score_codex":0.00006301725,"about_ca_system_score_gemma":0.00014831152,"threshold_uncertainty_score":0.8158872},"labels":[],"label_agreement":null},{"id":"W2741543018","doi":"","title":"An algebraic approach for finding balance index sets","year":2009,"lang":"en","type":"article","venue":"","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Graph; Algebraic number; Index (typography); Set (abstract data type); Balance (ability); Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.021550933569375173,"score_gpt":0.26848445286439754,"score_spread":0.24693351929502236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741543018","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.02576414,0.00005548975,0.96954054,0.0005413011,0.00009971543,0.00016830281,7.3847013e-7,0.00028148858,0.003548296],"genre_scores_gemma":[0.70025027,0.0000011195573,0.2982731,0.0013251257,0.000005392521,0.000007437805,0.000004451489,0.000003099485,0.00013003079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990523,0.000015899854,0.00014248783,0.0003728831,0.00014810168,0.00026835475],"domain_scores_gemma":[0.99932754,0.000026918518,0.000041119205,0.00044961864,0.00005099693,0.00010380556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029314193,0.00009868236,0.00010796849,0.000087015775,0.00013366523,0.0001342059,0.00053152244,0.00005444408,0.0000040799864],"category_scores_gemma":[0.0000133120575,0.0000813196,0.000044144974,0.00027357112,0.000013599813,0.00036042975,0.000028472368,0.00006356457,0.000007733475],"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.000006233948,0.00021391072,0.0011151084,0.000010310915,0.0000070470464,0.0000015903252,0.00031133354,0.0018955286,0.0065488853,0.9474898,0.004490219,0.037910055],"study_design_scores_gemma":[0.00040599145,0.00018206687,0.0018067774,0.0000057698076,0.0000018955765,0.0000078872135,0.00001244316,0.8254108,0.0023088204,0.16945417,0.00022578692,0.00017763018],"about_ca_topic_score_codex":0.0000054726697,"about_ca_topic_score_gemma":4.586777e-7,"teacher_disagreement_score":0.82351524,"about_ca_system_score_codex":0.000007805744,"about_ca_system_score_gemma":0.000022617862,"threshold_uncertainty_score":0.33161172},"labels":[],"label_agreement":null},{"id":"W2742125785","doi":"","title":"On several classes of monographs.","year":2007,"lang":"en","type":"article","venue":"The Australasian Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.013254445672268222,"score_gpt":0.24929224185780893,"score_spread":0.23603779618554072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742125785","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95230466,0.00025484856,0.0417893,0.0019252016,0.0016782741,0.00008275152,8.0236333e-7,0.00003193648,0.0019322472],"genre_scores_gemma":[0.99735314,0.0000286481,0.0023835392,0.000113365066,0.000011368871,1.8249341e-7,1.1588241e-7,0.0000065788367,0.00010308957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984855,0.00007257827,0.0005609269,0.000100809506,0.00052619074,0.00025398337],"domain_scores_gemma":[0.9983469,0.00026251216,0.00054392917,0.00039396092,0.00031760964,0.00013504278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015231927,0.00012133346,0.00022229107,0.00027603412,0.000089498004,0.000045869467,0.0010270531,0.00006151789,0.0000039550814],"category_scores_gemma":[0.00007058398,0.00007738384,0.00017371462,0.00079580693,0.000101951344,0.00021612001,0.000059053025,0.00037091417,0.0000046223713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036198213,0.00020883996,0.0011732776,0.000009670446,0.000047501475,0.000046248428,0.0004701652,0.00042923493,0.00041549423,0.9914253,0.0039794203,0.0017586482],"study_design_scores_gemma":[0.00097221596,0.0012221196,0.007402159,0.00009945908,0.000027172115,0.00024228547,0.00012692134,0.00024752822,0.012790794,0.97590715,0.00081602804,0.00014614857],"about_ca_topic_score_codex":0.0000022057798,"about_ca_topic_score_gemma":3.4552278e-7,"teacher_disagreement_score":0.045048475,"about_ca_system_score_codex":0.000021258676,"about_ca_system_score_gemma":0.00006731742,"threshold_uncertainty_score":0.31556213},"labels":[],"label_agreement":null},{"id":"W2743017711","doi":"10.1007/978-3-642-12200-2_51","title":"The Interval Constrained 3-Coloring Problem","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","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":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Deutsche Forschungsgemeinschaft; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Interval (graph theory); Time complexity; Computer science; Combinatorics; Computational complexity theory; NP-complete; Mathematics; Discrete mathematics; Algorithm","score_opus":0.010344334271980213,"score_gpt":0.2383458001660845,"score_spread":0.2280014658941043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743017711","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.095607914,0.000050202136,0.8976537,0.003743992,0.0024935356,0.00017202186,2.2846231e-7,0.00017804571,0.00010034766],"genre_scores_gemma":[0.6547386,0.0000021315138,0.34469825,0.00051749806,0.000029542598,0.000008753345,1.09071124e-7,0.000003847826,0.0000012579528],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978528,0.00004825833,0.00030885695,0.0006786333,0.0004830931,0.0006283342],"domain_scores_gemma":[0.9981504,0.0005465156,0.000094420524,0.00089875056,0.00017380035,0.00013612448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018767606,0.0001746241,0.00014694792,0.00020687695,0.0006462986,0.0008542145,0.0026882922,0.00007146385,0.0000027733881],"category_scores_gemma":[0.00022314816,0.00011363103,0.000055371594,0.0016771553,0.0009835496,0.00048781023,0.0008163667,0.0006035909,0.000018547908],"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.0000037627622,0.0000462822,0.0013085617,0.000006400559,0.00000411146,0.000017397826,0.0010728947,0.008965393,0.031730596,0.084114894,0.00001667949,0.872713],"study_design_scores_gemma":[0.00027896173,0.000099208664,0.00082140014,0.000036248406,0.000001287973,0.00008900949,7.5266485e-7,0.7070195,0.02271466,0.26839602,0.00030978082,0.0002331455],"about_ca_topic_score_codex":0.000035401787,"about_ca_topic_score_gemma":0.00016528425,"teacher_disagreement_score":0.87247986,"about_ca_system_score_codex":0.000026930607,"about_ca_system_score_gemma":0.00024732138,"threshold_uncertainty_score":0.823721},"labels":[],"label_agreement":null},{"id":"W2743898050","doi":"","title":"Competitive routing in the half-theta_6-graph","year":2012,"lang":"en","type":"article","venue":"University of Southern Denmark Research Portal (University of Southern Denmark)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Graph; Computer science; Mathematics","score_opus":0.03292995683237021,"score_gpt":0.24266694747340506,"score_spread":0.20973699064103485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743898050","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9317252,0.00040705875,0.003434742,0.000934513,0.00010302285,0.00058217335,0.0001590465,0.00007195121,0.06258226],"genre_scores_gemma":[0.99400604,0.00006012751,0.0033001292,0.000031652165,0.000014543859,1.5174054e-7,0.000010555638,0.000017624632,0.0025591545],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99571484,0.0010164862,0.0002836008,0.0005601564,0.0014496164,0.0009752767],"domain_scores_gemma":[0.9972781,0.0005842139,0.0003602623,0.0009718533,0.0005096776,0.00029592193],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.004417639,0.00026624126,0.00045536648,0.0008638035,0.00077839155,0.000049597485,0.0028708219,0.00022685225,0.001060673],"category_scores_gemma":[0.00009895095,0.00027335127,0.00034630237,0.0019227507,0.0012973399,0.0005086472,0.0009726655,0.0007996082,0.00095474103],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006788801,0.0023974706,0.22750214,0.00028125444,0.00062768813,0.0009867677,0.38055027,0.00016000448,0.0032120626,0.3707368,0.004314416,0.008552243],"study_design_scores_gemma":[0.003237945,0.00031693056,0.012332229,0.0004437488,0.000102070415,0.00006553919,0.9666164,0.001965189,0.00014390475,0.009445693,0.0045343833,0.00079598586],"about_ca_topic_score_codex":0.00456352,"about_ca_topic_score_gemma":0.0020701096,"teacher_disagreement_score":0.5860661,"about_ca_system_score_codex":0.000052576866,"about_ca_system_score_gemma":0.0001866131,"threshold_uncertainty_score":0.99997187},"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"W2761354496","doi":"10.1016/j.disc.2017.09.011","title":"Game of cops and robbers in oriented quotients of the integer grid","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Quotient; Digraph; Vertex (graph theory); Grid; Integer (computer science); Transitive relation; Combinatorics; Discrete mathematics; Computer science; Graph; Geometry","score_opus":0.012398138186278645,"score_gpt":0.24427439189744554,"score_spread":0.2318762537111669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761354496","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9898712,0.00005303982,0.008067246,0.00024722904,0.000273456,0.0001478253,0.000005385626,0.000012387808,0.0013222506],"genre_scores_gemma":[0.9893978,0.000007431663,0.010492837,0.000019972953,0.0000013548303,0.0000022312963,4.3844142e-7,0.000004307308,0.00007359502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992693,0.000022327662,0.00027798684,0.00012653343,0.00019462053,0.000109201945],"domain_scores_gemma":[0.99875563,0.000047720718,0.0003154637,0.0007896914,0.000062194435,0.000029293606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027707207,0.000075204545,0.00017330043,0.00004838114,0.000056964418,0.0000333658,0.00060192513,0.000031491483,0.0000017319178],"category_scores_gemma":[0.00016249833,0.000046677855,0.00004332627,0.00010230149,0.00018953015,0.000119897806,0.0003914236,0.00006982098,0.00000128327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000800041,0.00024728378,0.037255585,0.0004975076,0.000040635292,0.0000028075292,0.0154188275,0.00017365612,0.00316552,0.94190633,0.0002539318,0.0010299225],"study_design_scores_gemma":[0.0030126895,0.0002579292,0.04328502,0.0032734263,0.00006158884,0.00002260591,0.001322368,0.2617046,0.041056182,0.64514315,0.00026633692,0.0005941038],"about_ca_topic_score_codex":0.000046287187,"about_ca_topic_score_gemma":0.000011865662,"teacher_disagreement_score":0.29676315,"about_ca_system_score_codex":0.000004950958,"about_ca_system_score_gemma":0.000017406932,"threshold_uncertainty_score":0.19034676},"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":"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":"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":"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":"W2768173427","doi":"10.1007/s00013-023-01829-2","title":"Metric dimension of dual polar graphs","year":2023,"lang":"en","type":"article","venue":"Archiv der Mathematik","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Memorial University of Newfoundland","keywords":"Dimension (graph theory); Mathematics; Vertex (graph theory); Combinatorics; Algorithm; Rank (graph theory); Graph","score_opus":0.019941226015474427,"score_gpt":0.24536860231334784,"score_spread":0.2254273762978734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768173427","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9586017,0.00046836678,0.034442898,0.001021038,0.00041649363,0.00027033628,0.000008147876,0.0009201823,0.0038508174],"genre_scores_gemma":[0.95851254,0.00003182501,0.041103676,0.000111099966,0.0000033913748,0.000007123261,0.000005382637,0.000013394858,0.00021157014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863225,0.00006411809,0.00031865883,0.00030034874,0.0003962368,0.00028837536],"domain_scores_gemma":[0.99879974,0.00029742782,0.000116608135,0.0006367106,0.00005748287,0.000092048285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005154796,0.00012719452,0.00021119663,0.0007088352,0.00010309013,0.00003375992,0.00041705635,0.00003470744,0.000008514248],"category_scores_gemma":[0.000094541436,0.000102442675,0.00011362023,0.00201655,0.000060782353,0.00015774393,0.00034295264,0.00009778854,0.00030439868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028297827,0.000113945025,0.00043129173,0.000088824585,0.000047978534,0.000023698825,0.0024038227,0.00016649177,0.019094516,0.9674371,0.005253759,0.004935749],"study_design_scores_gemma":[0.00029583235,0.00007574624,0.0020286543,0.00006724692,0.000013261945,0.00002956987,0.00005503979,0.027034068,0.009943629,0.9601231,0.00016368549,0.00017012446],"about_ca_topic_score_codex":0.000022865797,"about_ca_topic_score_gemma":0.0000010271601,"teacher_disagreement_score":0.026867576,"about_ca_system_score_codex":0.00000381604,"about_ca_system_score_gemma":0.00002666095,"threshold_uncertainty_score":0.4177491},"labels":[],"label_agreement":null},{"id":"W2774020439","doi":"","title":"A survey of face-antimagic evaluations of graphs","year":2017,"lang":"en","type":"article","venue":"NOVA (University of Newcastle, Australia)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Agentúra na Podporu Výskumu a Vývoja","keywords":"Mathematics; Combinatorics; Face (sociological concept); Statistics; Philosophy; Linguistics","score_opus":0.2904169436315516,"score_gpt":0.3615912638817479,"score_spread":0.07117432025019627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774020439","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98726577,0.00002507785,0.010869925,0.00046085,0.00021089677,0.00012574015,0.00005877915,0.000023298195,0.00095966534],"genre_scores_gemma":[0.98565197,0.000010651172,0.01340036,0.000005295164,9.655237e-7,5.1150476e-8,0.0000069068524,0.0000035870023,0.0009202217],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9988755,0.0000877219,0.00020227979,0.00026821066,0.00038865238,0.00017766071],"domain_scores_gemma":[0.9976131,0.000068242276,0.0005587124,0.0010221576,0.0006586485,0.00007918119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066579913,0.000104530445,0.0002915755,0.00024154012,0.00020303059,0.00002291935,0.0013004829,0.000079807956,0.00011325957],"category_scores_gemma":[0.00009859647,0.00012348573,0.00013191979,0.0003922792,0.00043779763,0.00047020434,0.00029045402,0.00009952988,0.00002421296],"study_design_candidate":"observational","study_design_consensus":"observational","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.00022932419,0.0019026619,0.60184014,0.0005303696,0.0008506212,0.00007834443,0.007977098,0.0037974534,0.10098941,0.21441643,0.027364032,0.040024117],"study_design_scores_gemma":[0.0009922875,0.0001644931,0.98466784,0.00007623592,0.00004545072,0.0000044039534,0.00012754879,0.005478877,0.0019658958,0.0062656277,0.000049343886,0.00016198786],"about_ca_topic_score_codex":0.014642515,"about_ca_topic_score_gemma":0.0010447586,"teacher_disagreement_score":0.3828277,"about_ca_system_score_codex":0.000008669392,"about_ca_system_score_gemma":0.00008915731,"threshold_uncertainty_score":0.99191904},"labels":[],"label_agreement":null},{"id":"W2775467933","doi":"","title":"The integer-magic spectra and null sets of the cartesian product of trees","year":2018,"lang":"en","type":"article","venue":"HKBU Institutional Repository (Hong Kong Baptist University)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Cartesian product; Mathematics; Combinatorics; Integer (computer science); MAGIC (telescope); Null (SQL); Product (mathematics); Discrete mathematics; Computer science; Geometry; Physics; Data mining","score_opus":0.006774484959245633,"score_gpt":0.17738474969885284,"score_spread":0.17061026473960722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775467933","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9535405,0.00052579574,0.0057303966,0.00093083375,0.0015538955,0.0002594211,0.000007489307,0.0000791028,0.03737255],"genre_scores_gemma":[0.99670655,0.0000145066215,0.0015690747,0.000017215663,0.000023984485,2.5071992e-7,5.5519723e-7,0.0000031278719,0.0016647411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99894744,0.00009688164,0.0001951227,0.0002944679,0.00030986237,0.00015620523],"domain_scores_gemma":[0.99887353,0.00007946846,0.00017551753,0.00052590994,0.00028505878,0.00006052878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019250235,0.00011071965,0.00012535499,0.000112541835,0.000864467,0.000049061364,0.00069088564,0.000040354502,0.000001558112],"category_scores_gemma":[0.00005330598,0.0000755206,0.000078639794,0.0005381307,0.0016872203,0.0002659175,0.00026321298,0.00012374845,0.0000029193252],"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.000031446758,0.00007959648,0.015123574,0.000023923547,0.000060024086,0.000041992782,0.00041431712,0.00021348146,0.021379212,0.9609691,0.00038145238,0.0012818738],"study_design_scores_gemma":[0.003100413,0.0010796512,0.5697935,0.0012911119,0.0003048693,0.0015660003,0.0010833314,0.020833278,0.28411838,0.04293876,0.07249837,0.0013923168],"about_ca_topic_score_codex":0.00016845127,"about_ca_topic_score_gemma":0.00013337797,"teacher_disagreement_score":0.9180303,"about_ca_system_score_codex":0.00005162301,"about_ca_system_score_gemma":0.00027931292,"threshold_uncertainty_score":0.6648869},"labels":[],"label_agreement":null},{"id":"W2783047605","doi":"","title":"Further results on super edge-magic total labeling of extended w-trees","year":2016,"lang":"en","type":"article","venue":"Utilitas Mathematica","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; Horticulture; Artificial intelligence; Biology; Computer science; Physics; Astrophysics","score_opus":0.020760320195132215,"score_gpt":0.24768611536398438,"score_spread":0.22692579516885217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783047605","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87297225,0.0010347598,0.052142423,0.013713203,0.0011026756,0.0009273247,0.00009302067,0.0010735099,0.056940828],"genre_scores_gemma":[0.9541509,0.000009030221,0.044330493,0.0000996229,0.000009434095,0.000008342356,8.854612e-7,0.00001534641,0.0013759187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816597,0.000078855934,0.00054872356,0.00045114735,0.0004210493,0.00033426948],"domain_scores_gemma":[0.9978731,0.00061150215,0.0001359227,0.0011223457,0.00014574172,0.000111373396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071799994,0.00019106241,0.00028693557,0.0001503845,0.00005946234,0.00003455216,0.00052904355,0.00007307142,0.00009840568],"category_scores_gemma":[0.0004954439,0.00011268754,0.00012077738,0.0002613426,0.00013172705,0.00019248319,0.00017755824,0.0000783745,0.00053682266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008320309,0.0007860002,0.00004209311,0.00011503445,0.00008178343,0.000014439937,0.0041065607,0.000021087893,0.059291862,0.901221,0.004704916,0.029532032],"study_design_scores_gemma":[0.0024671373,0.0006374877,0.00063416106,0.0012168618,0.0000331909,0.000037880694,0.00022059567,0.0064624357,0.04641922,0.9406612,0.0006761079,0.00053374475],"about_ca_topic_score_codex":0.0000059457884,"about_ca_topic_score_gemma":0.0000014245663,"teacher_disagreement_score":0.08117867,"about_ca_system_score_codex":0.000015982501,"about_ca_system_score_gemma":0.00003701743,"threshold_uncertainty_score":0.6899948},"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":"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":"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":"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":"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":"W2801352158","doi":"10.22215/etd/2012-09573","title":"Derived colourings of graphs","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Library and Archives Canada","funders":"","keywords":"Combinatorics; Humanities; Mathematics; Computer science; Art","score_opus":0.011637410679477987,"score_gpt":0.23439618277407512,"score_spread":0.22275877209459713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801352158","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94365007,0.0016263344,0.0021236606,0.00007282574,0.0021193868,0.00022663121,0.0000016765941,0.00030561758,0.049873777],"genre_scores_gemma":[0.973862,0.000037343903,0.018950624,0.00006632054,0.0000034379052,0.000011922629,0.00004126235,0.000012548589,0.00701452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99903864,0.00002086206,0.00026831665,0.00023406875,0.00024054154,0.0001975647],"domain_scores_gemma":[0.9990974,0.000032512413,0.0002144978,0.00040468507,0.00017205138,0.00007885287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001610971,0.00014531182,0.00022046709,0.0002086386,0.000047563528,0.00002599915,0.0005160011,0.00016213859,0.00005816345],"category_scores_gemma":[0.000014222486,0.00012360643,0.000111880705,0.00028633224,0.000018252618,0.00013762101,0.00004426921,0.000118383294,0.000043424447],"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.0000113963115,0.00013967865,0.0005364648,0.0002025939,0.00006703623,0.0000020344582,0.0019588897,0.0000052901764,0.060929514,0.9250655,0.0029336407,0.008147963],"study_design_scores_gemma":[0.001023411,0.00027716183,0.044237364,0.00048825046,0.00013032524,0.000012283208,0.0004435953,0.0009235031,0.5617816,0.3875566,0.0017935758,0.0013323384],"about_ca_topic_score_codex":0.000096238386,"about_ca_topic_score_gemma":0.00003760794,"teacher_disagreement_score":0.5375089,"about_ca_system_score_codex":0.0000047012886,"about_ca_system_score_gemma":0.0000543984,"threshold_uncertainty_score":0.5040524},"labels":[],"label_agreement":null},{"id":"W2803448323","doi":"","title":"On a construction of supermagic graphs","year":2002,"lang":"en","type":"article","venue":"HKBU Institutional Repository (Hong Kong Baptist University)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Discrete mathematics","score_opus":0.011153064182400405,"score_gpt":0.16137305163476623,"score_spread":0.1502199874523658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803448323","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8569606,0.0001762178,0.019870248,0.0002283938,0.0015952382,0.00015471702,0.000009221417,0.0002987741,0.120706595],"genre_scores_gemma":[0.9906523,0.000026439002,0.007849079,0.000050611245,0.000009344505,4.3900525e-7,0.0000029115647,0.0000042665697,0.0014045577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987671,0.00007036528,0.000206705,0.00038065886,0.00038939784,0.00018579369],"domain_scores_gemma":[0.9991199,0.000067223526,0.00011911838,0.00038985113,0.00018627306,0.00011765227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007743128,0.00014174449,0.00015390904,0.00047793606,0.00054487627,0.00004751068,0.000448596,0.00008557189,0.00002693367],"category_scores_gemma":[0.000025716423,0.0001527417,0.00012427542,0.0007651172,0.0005271898,0.0005223978,0.00009984132,0.00015988543,0.000044346416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011064503,0.000120474266,0.0017207145,0.0000128159045,0.000026835201,0.00024432363,0.0000640188,0.0012092578,0.0032076184,0.99224585,0.00029093586,0.0008460944],"study_design_scores_gemma":[0.019915346,0.004241406,0.068678565,0.003207699,0.0006256681,0.01081653,0.0010476207,0.27665058,0.110468216,0.38611397,0.111242294,0.006992098],"about_ca_topic_score_codex":0.000055576103,"about_ca_topic_score_gemma":0.0000022706859,"teacher_disagreement_score":0.60613185,"about_ca_system_score_codex":0.000093624185,"about_ca_system_score_gemma":0.00007885478,"threshold_uncertainty_score":0.6228626},"labels":[],"label_agreement":null},{"id":"W2805500874","doi":"","title":"Some k-fold edge-graceful labelings of (p; p ¡ 1)-graphs","year":2001,"lang":"en","type":"article","venue":"","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Fold (higher-order function); Edge-graceful labeling; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Graph; Line graph; Computer science; Artificial intelligence","score_opus":0.015369407791738284,"score_gpt":0.2294883962308126,"score_spread":0.21411898843907431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805500874","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9331936,0.0041505415,0.037690226,0.0050587244,0.0014652462,0.0003108661,0.0000024403882,0.0011261668,0.017002193],"genre_scores_gemma":[0.951408,0.00029945094,0.04427858,0.0014247366,0.000013460852,0.0000066545927,0.0000014384257,0.000011690643,0.0025559638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986415,0.000032228374,0.00033992823,0.00036011392,0.00031308393,0.00031313873],"domain_scores_gemma":[0.998864,0.00006645469,0.00010730102,0.0006719898,0.00016308985,0.00012715177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003638921,0.00014007365,0.00020233744,0.00023385532,0.000084376894,0.000056093653,0.00069532084,0.00007256799,0.00004269953],"category_scores_gemma":[0.00003441811,0.00011431251,0.000110940135,0.0008140973,0.00007165446,0.00041549446,0.00019074454,0.00010427514,0.00012464885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041534363,0.000115809446,0.0027076087,0.000010151995,0.000017711256,0.000009822605,0.00015641861,0.000061117615,0.009023525,0.9763651,0.0047094068,0.0068191793],"study_design_scores_gemma":[0.0010279581,0.00024360431,0.0013177523,0.00006305102,0.0000160909,0.00005038607,0.00004071206,0.014882587,0.02813072,0.9436962,0.010075501,0.00045541654],"about_ca_topic_score_codex":0.000112952264,"about_ca_topic_score_gemma":0.0000068304744,"teacher_disagreement_score":0.032668874,"about_ca_system_score_codex":0.000006391951,"about_ca_system_score_gemma":0.00003708799,"threshold_uncertainty_score":0.4661529},"labels":[],"label_agreement":null},{"id":"W2807476228","doi":"10.1016/j.disc.2018.05.016","title":"Distinguishing chromatic numbers of complements of Cartesian products of complete graphs","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cartesian product; Chromatic scale; Mathematics; Combinatorics; Graph; Discrete mathematics; Class (philosophy); Computer science","score_opus":0.030084909417892134,"score_gpt":0.2666163669998542,"score_spread":0.23653145758196206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807476228","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.932942,0.00009460337,0.060104966,0.00018620271,0.00031101037,0.0004970654,0.000053192685,0.00009548312,0.00571552],"genre_scores_gemma":[0.7670336,0.0000014620693,0.23291403,0.000012882005,0.0000039428037,0.00000285515,0.000005687329,0.000010288763,0.000015286218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981267,0.000052168318,0.0008548322,0.0002445048,0.0004872583,0.00023453559],"domain_scores_gemma":[0.99771565,0.00012711436,0.0007854292,0.00086154905,0.0004490521,0.00006122708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055449555,0.00015871302,0.0004755847,0.00013826924,0.00007387471,0.000022810105,0.0007250379,0.000034188288,0.0000122975025],"category_scores_gemma":[0.000273516,0.00013385632,0.00009723147,0.0006323402,0.00036693335,0.0001222882,0.00023620977,0.000060231338,0.0000054606776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054888324,0.0003351701,0.002243788,0.0028569621,0.00015091071,0.0000020813643,0.01745468,0.000028570768,0.065714546,0.91017556,0.0005848438,0.00044741225],"study_design_scores_gemma":[0.0014813562,0.00090309244,0.0023016974,0.0027165178,0.00016750638,0.000025868048,0.0014773137,0.119535476,0.15827282,0.7123142,0.0001298164,0.0006743428],"about_ca_topic_score_codex":0.00008107037,"about_ca_topic_score_gemma":0.000009497957,"teacher_disagreement_score":0.19786136,"about_ca_system_score_codex":0.000007642545,"about_ca_system_score_gemma":0.00004111404,"threshold_uncertainty_score":0.5458502},"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":"W2859178089","doi":"10.61091/jcmcc119-18","title":"On Minimal Edge Version of Doubly Resolving Sets of a Graph","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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":"Combinatorics; Graph; Edge contraction; Mathematics; Line graph; Complement graph; Voltage graph; Discrete mathematics","score_opus":0.013630908019285834,"score_gpt":0.2512582568390946,"score_spread":0.23762734881980874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2859178089","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9699616,0.0013255938,0.0090670455,0.0001715208,0.018472861,0.00017257617,0.0000027305334,0.00005947042,0.00076662586],"genre_scores_gemma":[0.98748606,0.000038075446,0.012327479,0.000011782861,0.000112847374,4.8211774e-7,4.5264707e-7,0.00001973886,0.0000030517197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99713,0.000108920365,0.0013273095,0.00026495996,0.0009015805,0.00026724295],"domain_scores_gemma":[0.9967011,0.0012597905,0.0009414113,0.00034209143,0.0006006812,0.00015491417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021343092,0.00024401357,0.0007283174,0.0005631838,0.00013383378,0.000177292,0.0006686885,0.0001489666,0.0000031156696],"category_scores_gemma":[0.00035646465,0.00020266171,0.00028873657,0.00073910604,0.000112129135,0.00028249156,0.00032533627,0.0004308767,0.0000019456165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000798462,0.00039998,0.000023839522,0.00049427844,0.00010146698,0.000031213145,0.001419623,0.000103981045,0.0035669291,0.99145854,0.00067666033,0.0016436372],"study_design_scores_gemma":[0.0024371168,0.0019170984,0.000027912005,0.0023211304,0.0000719517,0.00007502467,0.00008911812,0.024818348,0.0069236634,0.9609571,0.00015020045,0.00021130044],"about_ca_topic_score_codex":0.000007473347,"about_ca_topic_score_gemma":6.280667e-8,"teacher_disagreement_score":0.03050141,"about_ca_system_score_codex":0.00003549066,"about_ca_system_score_gemma":0.00018540167,"threshold_uncertainty_score":0.8264305},"labels":[],"label_agreement":null},{"id":"W2884305241","doi":"","title":"Constructing distance magic graphs from regular graphs","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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; MAGIC (telescope); Combinatorics; Discrete mathematics; Astronomy","score_opus":0.017534542797908358,"score_gpt":0.22268329414831262,"score_spread":0.20514875135040425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884305241","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8865504,0.0012703021,0.08130298,0.00014558659,0.02732035,0.00028008161,0.000004094477,0.00017573689,0.0029504402],"genre_scores_gemma":[0.8972168,0.00003702238,0.10254658,0.000036109494,0.00013141807,8.538639e-7,9.4056804e-7,0.000026813917,0.0000034517968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966788,0.00016287476,0.0014690043,0.00040910242,0.0008173358,0.0004628355],"domain_scores_gemma":[0.99622613,0.0005325935,0.0016363171,0.00057709805,0.0007019938,0.00032584323],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016192324,0.00037740337,0.0008592666,0.00032192297,0.00032680054,0.00034434142,0.0011507638,0.000184943,0.000008756039],"category_scores_gemma":[0.000296145,0.00033352314,0.0002818962,0.0006747922,0.0002215774,0.0005401637,0.00043844007,0.00058915577,0.0000042931715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031795284,0.000301023,0.00083497044,0.00004702689,0.000107006075,0.00005700389,0.0017403504,0.000002165709,0.00035078422,0.99398446,0.000116048825,0.0024273659],"study_design_scores_gemma":[0.002718506,0.00040974954,0.00009886568,0.00037575533,0.0000736218,0.00013239126,0.00041993306,0.004266565,0.0021402999,0.98889136,0.00010494177,0.0003680153],"about_ca_topic_score_codex":0.0000434314,"about_ca_topic_score_gemma":7.108347e-7,"teacher_disagreement_score":0.027188933,"about_ca_system_score_codex":0.000050924114,"about_ca_system_score_gemma":0.00011985302,"threshold_uncertainty_score":0.99991167},"labels":[],"label_agreement":null},{"id":"W2890013260","doi":"10.28924/2291-8639-16-2018-733","title":"Cubic Graphs with Application","year":2018,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":27,"is_retracted":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; Cubic graph; Graph product; Mathematics; Indifference graph; Join (topology); Product (mathematics); Cubic form; Pathwidth; Cubic crystal system; Chordal graph; Cartesian coordinate system; Cubic function; Combinatorics; 1-planar graph; Graph; Geometry; Line graph; Physics; Condensed matter physics","score_opus":0.005245315939358627,"score_gpt":0.25025258080953516,"score_spread":0.24500726487017654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890013260","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.03813479,0.00011851485,0.9595053,0.0015755974,0.000038939168,0.000049135517,0.0000017914238,0.000017202316,0.000558735],"genre_scores_gemma":[0.9682092,0.00007026326,0.03138428,0.000236959,0.00004824853,0.000010954911,0.0000030421122,0.0000026956948,0.00003433203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917483,0.000015352705,0.0002695712,0.00015383614,0.00031609484,0.000070296],"domain_scores_gemma":[0.998412,0.00003382606,0.00030138038,0.00020594467,0.00097218837,0.00007461955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022735533,0.00006366979,0.00012161376,0.0004974024,0.00008905004,0.00011932409,0.0005222709,0.000021871687,0.000008433849],"category_scores_gemma":[0.000005620018,0.000045907964,0.00008615819,0.0009486214,0.000097369244,0.0002163429,0.00005104337,0.00006292908,0.000008585867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019354185,0.00018039587,0.015640918,0.000002086144,0.0015851507,0.000003407511,0.00021866919,0.00033256513,0.0046971375,0.87630904,0.00029294493,0.10071832],"study_design_scores_gemma":[0.0025530674,0.0009058984,0.07282391,0.000074250325,0.0020195611,0.0005841946,0.00023436222,0.09414237,0.01672931,0.71235144,0.09673222,0.0008494224],"about_ca_topic_score_codex":0.000021021684,"about_ca_topic_score_gemma":0.00002081238,"teacher_disagreement_score":0.93007445,"about_ca_system_score_codex":0.000010609359,"about_ca_system_score_gemma":0.000029585679,"threshold_uncertainty_score":0.18720725},"labels":[],"label_agreement":null},{"id":"W2890365631","doi":"","title":"Maximum variances and minimum statuses of connected Weighted Graphs","year":2017,"lang":"en","type":"article","venue":"Utilitas Mathematica","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; Statistics; Combinatorics","score_opus":0.022719638800605856,"score_gpt":0.2596377089601727,"score_spread":0.23691807015956684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890365631","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9617873,0.0013335038,0.020542873,0.0017284298,0.00041598076,0.0004169365,0.00002454666,0.00029404418,0.013456423],"genre_scores_gemma":[0.91847825,0.000040053106,0.08132833,0.000046656736,0.0000020511804,0.000008739881,9.526644e-7,0.000007315901,0.00008766674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988182,0.000045816967,0.00033974706,0.00032184276,0.00023562076,0.00023878235],"domain_scores_gemma":[0.9980903,0.00022047583,0.0002756266,0.0011738961,0.00013319541,0.000106482505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039236085,0.00014539271,0.00029562943,0.0001036132,0.00028867248,0.00016747083,0.0007330208,0.00005873298,0.0000362014],"category_scores_gemma":[0.000299552,0.0001132058,0.00005766994,0.000113455906,0.00033693257,0.00032496505,0.00028634802,0.0000711655,0.000017798406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075358607,0.00012538095,0.0004702711,0.00017731564,0.000048631762,0.000006265269,0.0010884819,1.8503611e-7,0.0016127125,0.9915863,0.0006844842,0.0041924086],"study_design_scores_gemma":[0.00043339623,0.00009127776,0.0020719827,0.00014415005,0.00002017041,0.0000118407825,0.000072956536,0.010682745,0.0021988729,0.9839121,0.00021292029,0.00014759626],"about_ca_topic_score_codex":0.000029012925,"about_ca_topic_score_gemma":0.0000035747505,"teacher_disagreement_score":0.060785457,"about_ca_system_score_codex":0.0000031360833,"about_ca_system_score_gemma":0.00003409923,"threshold_uncertainty_score":0.46163988},"labels":[],"label_agreement":null},{"id":"W2894691817","doi":"10.20429/tag.2018.050203","title":"Integer-antimagic spectra of disjoint unions of cycles","year":2018,"lang":"en","type":"article","venue":"Theory and Applications of Graphs","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Graph; Integer (computer science); Disjoint sets; Injective function; Simple graph; Abelian group; Vertex (graph theory); Discrete mathematics; Computer science","score_opus":0.007929184231454549,"score_gpt":0.24439009584812538,"score_spread":0.23646091161667082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894691817","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51173127,0.00068199536,0.4816507,0.0002766317,0.000040138108,0.000249902,0.0000206512,0.00006251851,0.005286174],"genre_scores_gemma":[0.9894386,0.00006843683,0.010422342,0.000027094826,0.0000031783154,0.000011036965,0.0000016394941,0.000003314478,0.000024364363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999346,0.000055910892,0.0002611088,0.00016375272,0.000088187044,0.00008504835],"domain_scores_gemma":[0.9989959,0.00014130196,0.00016314417,0.0005128945,0.00014762771,0.00003912714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049493957,0.00006731082,0.00014851024,0.00016981499,0.00007200429,0.000006378019,0.00034511718,0.000026608333,0.000011086989],"category_scores_gemma":[0.00001693015,0.000055490545,0.000056612495,0.0005345831,0.0007640695,0.00007401325,0.000095254036,0.000045376182,0.000003030181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006551735,0.000118436066,0.00021825345,0.000019391158,0.000013997438,3.2941692e-8,0.0002690725,0.0000023694915,0.02584802,0.96598154,0.000027473,0.007494858],"study_design_scores_gemma":[0.00009262134,0.000075315955,0.0008156845,0.00002884775,0.000012481298,0.0000024777994,0.00008881582,0.00020728889,0.1180265,0.88052285,0.000075407865,0.00005170725],"about_ca_topic_score_codex":0.00001857812,"about_ca_topic_score_gemma":0.0000017047753,"teacher_disagreement_score":0.47770733,"about_ca_system_score_codex":0.0000011417264,"about_ca_system_score_gemma":0.00001668572,"threshold_uncertainty_score":0.28152457},"labels":[],"label_agreement":null},{"id":"W2896542756","doi":"10.25077/jmu.7.4.87-92.2018","title":"BILANGAN KROMATIK LOKASI UNTUK GALAKSI DAN HUTAN LINIER","year":2019,"lang":"id","type":"article","venue":"Jurnal Matematika UNAND","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Adidas (Canada)","funders":"","keywords":"Physics","score_opus":0.011100728156517345,"score_gpt":0.2280151392002526,"score_spread":0.21691441104373527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896542756","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96686876,0.0036340605,0.0010064346,0.0027404411,0.005179914,0.001110959,0.000021405303,0.0003949828,0.019043034],"genre_scores_gemma":[0.97551394,0.00021080354,0.0033357127,0.0010839684,0.00011006475,0.000019196892,0.000014636705,0.0000878762,0.019623805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99467283,0.00036446215,0.0015219736,0.0011250052,0.0012343891,0.0010813366],"domain_scores_gemma":[0.99616575,0.00024924712,0.0008851744,0.0017366444,0.00039086374,0.00057234155],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013219648,0.00070828793,0.0010769723,0.0004658384,0.00039318865,0.0016441237,0.0014553891,0.0003888632,0.0003162974],"category_scores_gemma":[0.000112204616,0.00057149585,0.00037289332,0.001026726,0.00018072833,0.0009926499,0.00052973576,0.0007120212,0.003853075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039396645,0.0036463114,0.11788631,0.015522984,0.0018058233,0.0012826483,0.01866757,0.0010971813,0.14258839,0.63120186,0.052123114,0.013783859],"study_design_scores_gemma":[0.029984599,0.010632904,0.11379299,0.042180758,0.0017532763,0.00564338,0.0045617917,0.15714468,0.124570966,0.2888557,0.20430522,0.016573729],"about_ca_topic_score_codex":0.000061102444,"about_ca_topic_score_gemma":0.000012943888,"teacher_disagreement_score":0.34234613,"about_ca_system_score_codex":0.000084822444,"about_ca_system_score_gemma":0.00026217234,"threshold_uncertainty_score":0.99967366},"labels":[],"label_agreement":null},{"id":"W2898625438","doi":"","title":"Super-edge-graceful labelings of multi-level wheel graphs, fan graphs and actinia graphs","year":2005,"lang":"en","type":"article","venue":"HKBU Institutional Repository (Hong Kong Baptist University)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Combinatorics; 1-planar graph; Mathematics; Computer science; Graph; Chordal graph; Artificial intelligence","score_opus":0.022547572906362775,"score_gpt":0.20885146498630242,"score_spread":0.18630389207993964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898625438","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98011196,0.00084694754,0.012594032,0.00031493607,0.0008737463,0.0002639347,0.000036943016,0.00037309097,0.004584387],"genre_scores_gemma":[0.9552994,0.00015282007,0.04242748,0.00010511007,0.000014557869,0.0000018691624,0.000014055443,0.000015374417,0.001969384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9974587,0.0001265446,0.00047802867,0.000868502,0.0006100556,0.0004581439],"domain_scores_gemma":[0.99810886,0.0001375912,0.0002806083,0.0006513974,0.00047520892,0.00034632886],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003066195,0.00036393348,0.00037843556,0.00096988946,0.001189895,0.00014647907,0.0008936983,0.00022470589,0.0000074235068],"category_scores_gemma":[0.00006716023,0.00039500374,0.00023741917,0.0013351894,0.0009710177,0.0013944774,0.0003969016,0.00037902716,0.00001586073],"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.00005913556,0.00045024816,0.020395381,0.00007067252,0.0001619218,0.00029083708,0.0005589369,0.00083407114,0.041625865,0.930887,0.00034919707,0.0043167584],"study_design_scores_gemma":[0.032130007,0.0021478278,0.45723358,0.0034424367,0.0013611926,0.0052020336,0.002884785,0.07641914,0.17755826,0.07891395,0.15253685,0.01016994],"about_ca_topic_score_codex":0.0003336753,"about_ca_topic_score_gemma":0.00011108247,"teacher_disagreement_score":0.851973,"about_ca_system_score_codex":0.00011049472,"about_ca_system_score_gemma":0.00032728352,"threshold_uncertainty_score":0.9998502},"labels":[],"label_agreement":null},{"id":"W2899256795","doi":"","title":"The non-edge-magic simple connected cubic graph of order 10","year":2012,"lang":"en","type":"article","venue":"HKBU Institutional Repository (Hong Kong Baptist University)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Cubic graph; Simple (philosophy); MAGIC (telescope); Graph; Enhanced Data Rates for GSM Evolution; Order (exchange); Discrete mathematics; Line graph; Voltage graph; Computer science; Artificial intelligence; Physics; Business","score_opus":0.008914227614334002,"score_gpt":0.18918036856413123,"score_spread":0.18026614094979723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899256795","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8179659,0.0009528105,0.084596805,0.0003398928,0.0033390925,0.0004084226,0.000014627889,0.00039423897,0.0919882],"genre_scores_gemma":[0.9921109,0.000022195258,0.0031129064,0.000039796265,0.000037493057,9.4777016e-7,0.000009504681,0.0000072558714,0.004658984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984265,0.000113030976,0.00027725703,0.00033463855,0.00044125685,0.00040729536],"domain_scores_gemma":[0.9982903,0.00020409984,0.00019871979,0.0005933864,0.0005049106,0.00020859067],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00028624822,0.00018652185,0.00018682398,0.00027707705,0.0013821687,0.00008918404,0.00085154246,0.00010368128,0.000017901848],"category_scores_gemma":[0.000081901395,0.00016080275,0.00013682946,0.0012888353,0.0006693296,0.00082346244,0.00029802142,0.00019248713,0.000063530715],"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.00004467038,0.00022259561,0.010712052,0.000026826061,0.000112093316,0.0001041166,0.0001971199,0.0016227042,0.010858702,0.97318506,0.0022503042,0.00066374755],"study_design_scores_gemma":[0.008048885,0.00081882597,0.16180144,0.0006213411,0.000511219,0.0014454161,0.001255367,0.039195027,0.06626733,0.03192325,0.6845759,0.003535973],"about_ca_topic_score_codex":0.00015866802,"about_ca_topic_score_gemma":0.000015211272,"teacher_disagreement_score":0.9412618,"about_ca_system_score_codex":0.00010292174,"about_ca_system_score_gemma":0.0003387848,"threshold_uncertainty_score":0.9999179},"labels":[],"label_agreement":null},{"id":"W2904851722","doi":"10.1016/j.disc.2018.10.008","title":"Oriented colourings of graphs with maximum degree three and four","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Degree (music); Graph; Discrete mathematics; Orientation (vector space)","score_opus":0.026081442622298667,"score_gpt":0.22886300690060454,"score_spread":0.20278156427830588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904851722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69331855,0.000056090885,0.3036345,0.00021888042,0.00007165083,0.00017052307,0.0000027720473,0.00010489105,0.002422133],"genre_scores_gemma":[0.71805596,0.000004172187,0.2818225,0.000047302907,0.000003105034,0.000005381318,5.60577e-7,0.000009961515,0.00005102456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906135,0.000012581501,0.00023355866,0.00022849247,0.00026443263,0.00019960498],"domain_scores_gemma":[0.99901974,0.00005905921,0.0001609858,0.00049613015,0.00018121401,0.00008287373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023621725,0.00013093415,0.00019987533,0.000097154356,0.00010009931,0.000047318954,0.00030620454,0.0000422152,0.0000061797377],"category_scores_gemma":[0.000034507186,0.00008965552,0.000033811368,0.0003603111,0.00026097344,0.00013168185,0.0001789447,0.00006301917,0.000009081314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013604241,0.00007487454,0.0025246455,0.000155067,0.0000548409,0.000009079349,0.0025889815,0.0000033240187,0.001311612,0.99114573,0.00021517341,0.0019030806],"study_design_scores_gemma":[0.0008514125,0.0007524712,0.0016873971,0.00028831296,0.000042215703,0.000081697384,0.00017312779,0.03545355,0.006320455,0.95390385,0.00014998738,0.00029554428],"about_ca_topic_score_codex":0.000015260564,"about_ca_topic_score_gemma":0.000029386209,"teacher_disagreement_score":0.037241887,"about_ca_system_score_codex":0.0000039624915,"about_ca_system_score_gemma":0.000022001692,"threshold_uncertainty_score":0.3656046},"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":"W2911081932","doi":"","title":"The odd harmonious labeling of dumbbell and generalized prism graphs","year":2013,"lang":"en","type":"article","venue":"AKCE International Journal of Graphs and Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Dumbbell; Mathematics; Prism; Combinatorics; Pure mathematics; Physics; Biology; Optics","score_opus":0.008012686591782872,"score_gpt":0.21803430674744229,"score_spread":0.21002162015565942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911081932","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98706466,0.0063451896,0.0019018659,0.0029141314,0.0015319573,0.00008493054,7.81196e-7,0.00001792845,0.00013854158],"genre_scores_gemma":[0.9901231,0.0054597803,0.004103962,0.00022321664,0.000006745222,0.0000028213512,3.924354e-7,0.0000068806435,0.00007312577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858546,0.00006451846,0.0005184849,0.00014714166,0.0005253311,0.00015907871],"domain_scores_gemma":[0.99818724,0.00022244244,0.00047506386,0.0001715677,0.0008256558,0.000117999196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056412356,0.000121003315,0.00018696193,0.00022322795,0.00016076895,0.00026716152,0.00070202333,0.00005399027,0.0000021355834],"category_scores_gemma":[0.00007128656,0.000081423466,0.000098541605,0.0002561456,0.00013018741,0.00036665864,0.0001864369,0.0002020369,0.0000010470394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018737019,0.00010097039,0.0068649934,0.0000072967914,0.00015232187,0.0000152045095,0.00031019124,0.000010096365,0.0029497691,0.97068185,0.0015045726,0.017384022],"study_design_scores_gemma":[0.0010882556,0.00021760102,0.003687159,0.000055098833,0.000017675846,0.00016751014,0.00005091488,0.0029582358,0.0013535118,0.9892332,0.0010542533,0.000116604766],"about_ca_topic_score_codex":0.000077753524,"about_ca_topic_score_gemma":0.000001250811,"teacher_disagreement_score":0.018551355,"about_ca_system_score_codex":0.000010367789,"about_ca_system_score_gemma":0.000039651357,"threshold_uncertainty_score":0.33203524},"labels":[],"label_agreement":null},{"id":"W2913238166","doi":"10.25077/jmu.8.2.33-36.2019","title":"BILANGAN KROMATIK LOKASI GRAF TAK TERHUBUNG DENGAN GRAF LINGKARAN SEBAGAI KOMPONEN-KOMPONENNYA","year":2019,"lang":"id","type":"article","venue":"Jurnal Matematika UNAND","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Adidas (Canada)","funders":"","keywords":"Physics","score_opus":0.01085759970982905,"score_gpt":0.21819969350135876,"score_spread":0.2073420937915297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913238166","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97947717,0.004749028,0.0015500254,0.002051605,0.005304882,0.0015547205,0.000037623242,0.00069088995,0.004584062],"genre_scores_gemma":[0.9815803,0.0003114366,0.009255766,0.0008047324,0.00016420703,0.00004032547,0.00004233949,0.00016689002,0.007634],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99153596,0.0007134725,0.0023592615,0.0018136117,0.0018532012,0.0017245089],"domain_scores_gemma":[0.99424917,0.00048734475,0.0014346276,0.0023608692,0.00054819195,0.0009197822],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0022448252,0.0012482777,0.0017143785,0.0009616068,0.00082912704,0.002499075,0.0022832644,0.0006292346,0.00015651692],"category_scores_gemma":[0.00016137575,0.0010575049,0.0006774423,0.0015710617,0.00028062315,0.0015122213,0.00077837374,0.0012465277,0.0031889891],"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.00047018303,0.003221086,0.03455474,0.012371737,0.0019211707,0.0014154415,0.013972329,0.0012919201,0.703668,0.20814298,0.013796803,0.0051736142],"study_design_scores_gemma":[0.034090117,0.0076750675,0.08532947,0.047084913,0.0025321401,0.007755271,0.0034933623,0.16960198,0.23789248,0.33865857,0.046055894,0.01983074],"about_ca_topic_score_codex":0.00024448588,"about_ca_topic_score_gemma":0.000031594373,"teacher_disagreement_score":0.46577552,"about_ca_system_score_codex":0.00016899256,"about_ca_system_score_gemma":0.00031102778,"threshold_uncertainty_score":0.9991875},"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"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":"W2947688929","doi":"10.1016/j.dam.2019.05.004","title":"On <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e1568\" altimg=\"si87.svg\"><mml:mi>α</mml:mi></mml:math>-labellings of lobsters and trees with a perfect matching","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Conjecture; Mathematics; Combinatorics; Injective function; Tree (set theory); Degree (music); Discrete mathematics; Physics","score_opus":0.010839778074132132,"score_gpt":0.21717242276201382,"score_spread":0.20633264468788168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947688929","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98140144,0.000106443644,0.01561554,0.00012619531,0.0001524485,0.00013480803,0.000018264898,0.00015864549,0.0022862395],"genre_scores_gemma":[0.9430948,0.00006137962,0.056295183,0.00029842756,0.000020885916,0.00007341834,0.000028954813,0.00007992511,0.000047046928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756736,0.000025032905,0.00057592464,0.00062121276,0.00071243977,0.0004980628],"domain_scores_gemma":[0.99773425,0.00047539014,0.00055183575,0.0010144379,0.000046298515,0.00017779726],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056098046,0.0003603476,0.00033697748,0.0001289659,0.0002404642,0.00026525193,0.0006308529,0.00022005859,0.000007838144],"category_scores_gemma":[0.0000402886,0.00032717668,0.00015892531,0.00028827117,0.00020866195,0.00026053522,0.0003975394,0.00032936153,0.00024721125],"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.000064599735,0.00012123944,0.0000061146243,0.0006317703,0.00011693248,0.000018812036,0.0035614264,0.0012887953,0.007661449,0.98603576,0.000050326486,0.0004427688],"study_design_scores_gemma":[0.0009236067,0.00052171084,0.000011081795,0.000791031,0.00013958095,0.00007918593,0.0008954992,0.9506005,0.0113542,0.0341627,0.00007402332,0.0004468903],"about_ca_topic_score_codex":0.000046575893,"about_ca_topic_score_gemma":0.000014782905,"teacher_disagreement_score":0.95187306,"about_ca_system_score_codex":0.000007910717,"about_ca_system_score_gemma":0.000084252475,"threshold_uncertainty_score":0.99991804},"labels":[],"label_agreement":null},{"id":"W2949600989","doi":"10.48550/arxiv.1812.05510","title":"Oriented Colourings of Graphs with Maximum Degree Three and Four","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Saskatchewan","funders":"","keywords":"Degree (music); Graph; Combinatorics; Mathematics; Orientation (vector space); Computer science; Discrete mathematics; Physics; Geometry","score_opus":0.07173950489355561,"score_gpt":0.1700112206124229,"score_spread":0.0982717157188673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949600989","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8183109,0.00006575585,0.18004176,0.000057924713,0.00022464558,0.00021509688,0.000006698779,0.00015288006,0.0009243184],"genre_scores_gemma":[0.98912084,0.00006258881,0.01055546,0.000043603275,0.000005119184,6.908318e-7,0.0000029773862,0.000014374923,0.00019434266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983595,0.000055524713,0.00019210951,0.00096421054,0.00012877506,0.00029989643],"domain_scores_gemma":[0.99799275,0.00005980931,0.00032456793,0.0010609676,0.0003882485,0.00017363527],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024911994,0.00028096605,0.00034808918,0.00035526505,0.00013871344,0.000052015774,0.0009358629,0.00021034369,0.000008475081],"category_scores_gemma":[0.000016856717,0.000263331,0.00010079159,0.0006998771,0.00040172614,0.00019348596,0.0015421208,0.0003149507,0.00001000324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002146183,0.0002166495,0.08583929,0.0003056623,0.0003803601,0.0004589711,0.0004640531,0.007743231,0.0001960095,0.90261793,0.0005239598,0.0010392913],"study_design_scores_gemma":[0.0016952753,0.0006049723,0.013177317,0.00045218976,0.00016791468,0.000033904562,0.000045529825,0.099967204,0.00065346225,0.8823044,0.00017473157,0.0007231022],"about_ca_topic_score_codex":0.0002722609,"about_ca_topic_score_gemma":0.00016126967,"teacher_disagreement_score":0.17080992,"about_ca_system_score_codex":0.000028726032,"about_ca_system_score_gemma":0.00012948204,"threshold_uncertainty_score":0.9999819},"labels":[],"label_agreement":null},{"id":"W2950131895","doi":"","title":"Uniformly Weighted Star-Factors of Graphs","year":2007,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Combinatorics; Star (game theory); Weighting; Mathematics; Omega; Graph; Discrete mathematics; Function (biology); Physics","score_opus":0.06091463087630726,"score_gpt":0.18180229238260875,"score_spread":0.1208876615063015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950131895","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91814154,0.00012578169,0.078101255,0.00002745972,0.0007152968,0.00019956288,0.00001847922,0.00030359454,0.0023670478],"genre_scores_gemma":[0.9938308,0.00015747831,0.0053485613,0.000044005315,0.000004896472,1.7943691e-7,0.000022534756,0.000016965092,0.0005745647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795437,0.00009319018,0.00036144102,0.00097389385,0.00018018356,0.00043689957],"domain_scores_gemma":[0.99732465,0.00012868246,0.00044365288,0.0015052849,0.00035445573,0.00024326288],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004247273,0.0003623455,0.0004427304,0.00083920447,0.00012726958,0.000052918167,0.0018679041,0.00039077192,0.000026924376],"category_scores_gemma":[0.000020070705,0.00036821398,0.00033976682,0.001376266,0.00020530209,0.00027173635,0.0014585619,0.00057858817,0.000025192194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022359352,0.00014767826,0.007752803,0.000088912435,0.0001237509,0.00011060054,0.00027023486,0.0069812518,0.00015754625,0.9839183,0.00023231775,0.00019420763],"study_design_scores_gemma":[0.00066357094,0.00013518977,0.0031188088,0.0001827384,0.00009385064,0.000002758242,0.000098163175,0.10136133,0.0034221145,0.8898287,0.00038985105,0.0007029587],"about_ca_topic_score_codex":0.0004565899,"about_ca_topic_score_gemma":0.000041671716,"teacher_disagreement_score":0.09438007,"about_ca_system_score_codex":0.00007110069,"about_ca_system_score_gemma":0.00022189606,"threshold_uncertainty_score":0.999877},"labels":[],"label_agreement":null},{"id":"W2951867195","doi":"10.55016/ojs/cdm.v9i1.62101","title":"Determination of the prime bound of a graph","year":2014,"lang":"en","type":"preprint","venue":"Contributions to Discrete Mathematics","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; Omega; Graph; Mathematics; Prime (order theory); Integer (computer science); Discrete mathematics; Physics; Computer science","score_opus":0.01369475596781104,"score_gpt":0.27628647856044986,"score_spread":0.2625917225926388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951867195","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.029517801,0.0001473351,0.9674235,0.0011068763,0.0004490092,0.00073680456,0.0001773578,0.00006778396,0.0003735623],"genre_scores_gemma":[0.8739129,0.000007707571,0.12583192,0.000057747777,0.000008746005,0.000059273418,0.00001273792,0.0000122841175,0.000096706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980861,0.00012118945,0.00078461634,0.00032157518,0.0004580945,0.00022844323],"domain_scores_gemma":[0.9962214,0.00022574852,0.000807414,0.0018284294,0.0008297756,0.00008718279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000843231,0.00021547444,0.00049493037,0.00020878072,0.00013353108,0.00008267564,0.0014910337,0.00018718305,0.000003561763],"category_scores_gemma":[0.0008945053,0.00015304139,0.00031642415,0.00049448706,0.00017069568,0.000059625618,0.0015681834,0.00024748273,0.000008132347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028114364,0.00020351556,0.000037985912,0.0005500603,0.00006273059,4.9217823e-7,0.0016030896,0.0007964797,0.006630905,0.98762655,0.0004643462,0.0020210382],"study_design_scores_gemma":[0.00025423535,0.000058810576,0.00023102964,0.0009579852,0.00010173117,0.000006779098,0.000017652024,0.07726591,0.024722805,0.89599735,0.00015219461,0.00023352048],"about_ca_topic_score_codex":0.000019280304,"about_ca_topic_score_gemma":0.000005413257,"teacher_disagreement_score":0.8443951,"about_ca_system_score_codex":0.000043110616,"about_ca_system_score_gemma":0.00019492928,"threshold_uncertainty_score":0.62408465},"labels":[],"label_agreement":null},{"id":"W2952163554","doi":"","title":"Construction of group-magic graphs and some A-magic graphs with A of even order","year":2004,"lang":"en","type":"article","venue":"HKBU Institutional Repository (Hong Kong Baptist University)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"MAGIC (telescope); Combinatorics; Mathematics; Group (periodic table); Computer science; Discrete mathematics; Physics; Astronomy","score_opus":0.00524433113849688,"score_gpt":0.16116077227153033,"score_spread":0.15591644113303346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952163554","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9697247,0.00025783546,0.025069574,0.000095416064,0.00036999633,0.00016089762,0.00000790924,0.000108034554,0.004205629],"genre_scores_gemma":[0.96707934,0.000043200962,0.032673042,0.000022139153,0.000005089125,4.845614e-7,0.0000055737346,0.000005888496,0.00016525766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863875,0.000054465065,0.00026630308,0.000432265,0.00041328714,0.00019494677],"domain_scores_gemma":[0.9989145,0.000040952847,0.00025377263,0.0003378403,0.00032659393,0.00012634008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011604409,0.00017858659,0.00024299194,0.0005780297,0.00035205725,0.000037585476,0.00034267537,0.00009209943,0.000002168466],"category_scores_gemma":[0.000015441863,0.00017315951,0.00008288031,0.0011209509,0.0012630314,0.0008897831,0.00013563376,0.00015384013,0.000002184105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048963073,0.000121897836,0.009125248,0.000051530762,0.00007098889,0.00016618037,0.000106152744,0.0024804582,0.007593473,0.97996104,0.0000060240845,0.00026805484],"study_design_scores_gemma":[0.017283985,0.0028129702,0.1421329,0.0027301286,0.00063849054,0.0061877775,0.0011848141,0.004183244,0.043492142,0.7737804,0.0029186537,0.0026544814],"about_ca_topic_score_codex":0.00042109523,"about_ca_topic_score_gemma":0.000026032365,"teacher_disagreement_score":0.20618062,"about_ca_system_score_codex":0.000074179836,"about_ca_system_score_gemma":0.0003456591,"threshold_uncertainty_score":0.706124},"labels":[],"label_agreement":null},{"id":"W2953293297","doi":"10.48550/arxiv.1312.4973","title":"The metric dimension of small distance-regular and strongly regular\\n graphs","year":2013,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Metric dimension; Combinatorics; Mathematics; Valency; Strongly regular graph; Chordal graph; Vertex (graph theory); Discrete mathematics; Distance; Indifference graph; Random regular graph; Odd graph; Graph; Pathwidth; 1-planar graph; Line graph; Shortest path problem","score_opus":0.03989409703358735,"score_gpt":0.16615060136013862,"score_spread":0.12625650432655128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953293297","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8776071,0.004883349,0.11450021,0.00024393732,0.0012636126,0.0009423227,0.00001890923,0.0001364897,0.00040405666],"genre_scores_gemma":[0.9903327,0.004758539,0.0027219984,0.00003519946,0.000013801942,0.0000027700894,0.000009421684,0.00004119161,0.0020843549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946932,0.0006534618,0.00089471985,0.0023878906,0.00037719664,0.000993489],"domain_scores_gemma":[0.99316454,0.00066041155,0.0013005687,0.0033110527,0.0010129117,0.0005504905],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014035474,0.0008420058,0.00094339804,0.00083411223,0.001132391,0.0003937689,0.0027477064,0.00056244974,0.000016518143],"category_scores_gemma":[0.00012957667,0.0007235411,0.0005681979,0.0031217504,0.0016606016,0.0004922093,0.0035950837,0.00095657655,0.0000396457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091487556,0.00018941936,0.0037602868,0.00017215015,0.00031229763,0.00006117232,0.00022425973,0.065615386,0.00038422906,0.9255562,0.00016086276,0.0034722718],"study_design_scores_gemma":[0.0012837498,0.00031659534,0.002575517,0.00042186133,0.00035124345,0.000011327101,0.00033694733,0.49140188,0.0006901961,0.5011356,0.00063860224,0.0008365167],"about_ca_topic_score_codex":0.0006372323,"about_ca_topic_score_gemma":0.00007895893,"teacher_disagreement_score":0.4257865,"about_ca_system_score_codex":0.00012321054,"about_ca_system_score_gemma":0.000260516,"threshold_uncertainty_score":0.99952155},"labels":[],"label_agreement":null},{"id":"W2959266175","doi":"","title":"Regular handicap graphs of odd order","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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; Order (exchange); Combinatorics; Business","score_opus":0.015484899698017019,"score_gpt":0.25345894141383263,"score_spread":0.2379740417158156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2959266175","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9415652,0.000786805,0.031649943,0.00061656226,0.02358302,0.00026059468,0.0000012828226,0.00006115794,0.0014754478],"genre_scores_gemma":[0.963682,0.00005520276,0.036064457,0.000016565258,0.00015384569,6.617148e-7,2.406938e-7,0.00001912747,0.000007917011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997213,0.00009122817,0.0012468614,0.0002597446,0.0008583142,0.00033085054],"domain_scores_gemma":[0.99463224,0.00034797506,0.0027398404,0.000895564,0.0011543233,0.00023002899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022901865,0.0002641276,0.0008426621,0.00026836552,0.0006816137,0.0005490013,0.0016709244,0.00016661157,0.0000029631105],"category_scores_gemma":[0.00095189776,0.00022207039,0.00022748102,0.00026421953,0.0002561138,0.00051400444,0.00068940246,0.00039451555,0.0000016356868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023800552,0.00035148772,0.00021188974,0.00011596311,0.000092283335,0.000021104664,0.000534859,0.000016468493,0.0014602107,0.99462664,0.0002321197,0.002313164],"study_design_scores_gemma":[0.003661963,0.0007962285,0.00016929129,0.00046496198,0.000059154157,0.00009103215,0.00005636778,0.006342252,0.0033651683,0.98448396,0.00026780873,0.00024179836],"about_ca_topic_score_codex":0.000017096561,"about_ca_topic_score_gemma":2.0552162e-7,"teacher_disagreement_score":0.023429172,"about_ca_system_score_codex":0.000021846596,"about_ca_system_score_gemma":0.00017061995,"threshold_uncertainty_score":0.90557677},"labels":[],"label_agreement":null},{"id":"W2960283505","doi":"10.1007/978-3-030-25070-6_4","title":"Strongly n-e.c. Graphs and Independent Distinguishing Labellings","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of Saskatchewan","funders":"","keywords":"Countable set; Adjacency list; Enumeration; Combinatorics; Vertex (graph theory); Discrete mathematics; Probabilistic logic; Computer science; Graph; Mathematics; Artificial intelligence","score_opus":0.01359819183333387,"score_gpt":0.22313630744698792,"score_spread":0.20953811561365404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2960283505","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.0023522847,0.0014612597,0.98972195,0.0005925209,0.0022219263,0.00036765749,0.000004508842,0.00026679313,0.0030110667],"genre_scores_gemma":[0.63281834,0.00017538157,0.36435124,0.0014798582,0.00008345709,0.000005664559,0.00000711831,0.00006564469,0.0010133034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99578804,0.000029219798,0.0005338326,0.0018476045,0.0010906765,0.00071064883],"domain_scores_gemma":[0.9974924,0.0004131701,0.00033131515,0.0012659521,0.0002664893,0.00023067956],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011863603,0.0005434368,0.00054457167,0.0008614637,0.00030934092,0.00095559796,0.0022833014,0.0003341217,0.000006943123],"category_scores_gemma":[0.00009162138,0.00048907433,0.000106268126,0.0005152609,0.0006112607,0.00052620354,0.0016899281,0.0010181596,0.000044863285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006734133,0.000041288742,0.0009050179,0.00012006399,0.00002726438,0.00012724899,0.001337529,0.019070502,0.00033320396,0.62540615,0.000050298557,0.3525747],"study_design_scores_gemma":[0.00036450036,0.00017547848,0.00015422053,0.000579729,0.000010827698,0.00007692449,2.257768e-7,0.24552113,0.00031311729,0.7512872,0.0007770249,0.00073958543],"about_ca_topic_score_codex":0.00005388129,"about_ca_topic_score_gemma":0.000049331145,"teacher_disagreement_score":0.63046604,"about_ca_system_score_codex":0.00009973159,"about_ca_system_score_gemma":0.00038778718,"threshold_uncertainty_score":0.9997561},"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":"W2963088540","doi":"10.37236/2678","title":"Partitions and Compositions over Finite Fields","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Finite field; Order (exchange); Field (mathematics); Combinatorics; Finite set; Algebraic number field; Finite element method; Discrete mathematics; Pure mathematics; Mathematical analysis; Physics","score_opus":0.005151596893328243,"score_gpt":0.20179915786150818,"score_spread":0.19664756096817992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963088540","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66671646,0.0057511395,0.30539453,0.020175815,0.0007179934,0.00018112376,5.614756e-7,0.00005753978,0.0010048432],"genre_scores_gemma":[0.9988894,0.00038678563,0.00015816835,0.00043648598,0.000009077226,0.000003011823,1.9293186e-7,0.0000036698364,0.00011323191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919075,0.000069069094,0.00022209398,0.00007132982,0.0001878577,0.0002588942],"domain_scores_gemma":[0.99917364,0.0002143057,0.00014528772,0.00021174613,0.00018460046,0.00007039496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036054038,0.00007031242,0.00010775905,0.00007212124,0.00019903215,0.00011476251,0.00038130497,0.000034530698,0.000014116061],"category_scores_gemma":[0.000029875739,0.0000460619,0.000053743384,0.00027541554,0.000049055663,0.0002972059,0.000069816546,0.0003769922,0.000012093597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010835633,0.000049837217,0.00009966576,0.0000016715953,0.000022063783,0.0000011950098,0.00014212435,0.00016981446,0.00017368572,0.99512947,0.003975412,0.00023395645],"study_design_scores_gemma":[0.00031838263,0.00025758863,0.0006420035,0.000012849649,0.000014316971,0.00009364342,0.000014001928,0.0043450957,0.00022118165,0.9929302,0.0010902988,0.000060466027],"about_ca_topic_score_codex":0.000013600582,"about_ca_topic_score_gemma":0.0000017725683,"teacher_disagreement_score":0.3321729,"about_ca_system_score_codex":0.000027883792,"about_ca_system_score_gemma":0.00010016733,"threshold_uncertainty_score":0.18783498},"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":"W2963621023","doi":"10.7151/dmgt.2087","title":"Error-Correcting codes fromk-resolving sets","year":2019,"lang":"en","type":"article","venue":"RODIN (Universidad de Cádiz)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics; Arithmetic","score_opus":0.012220075431460767,"score_gpt":0.23982154486649523,"score_spread":0.22760146943503445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963621023","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95438844,0.00025466055,0.026707228,0.0008757057,0.0009392843,0.00016163128,0.0000036235108,0.00053576485,0.016133675],"genre_scores_gemma":[0.97036594,0.000009567184,0.027311796,0.0003845073,0.000010506463,0.0000014069159,0.0000046952723,0.0000152242865,0.0018963845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984229,0.000096106814,0.00016273498,0.0005352078,0.0002850055,0.00049801933],"domain_scores_gemma":[0.9987767,0.00018730962,0.00012163884,0.0006500122,0.000090917776,0.00017342404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046238553,0.00017855695,0.00021595281,0.00027717737,0.00026666524,0.00016767862,0.00082376157,0.0001292889,0.00013717575],"category_scores_gemma":[0.00005342208,0.00019312168,0.00009942387,0.00061345135,0.0000369643,0.00063102174,0.00034667936,0.0002780663,0.0006744407],"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.00011231937,0.0004996071,0.09973522,0.00026436758,0.00035750496,0.0006890735,0.03408192,0.026841257,0.1307837,0.53500384,0.049652137,0.121979035],"study_design_scores_gemma":[0.003847502,0.0004690161,0.015836567,0.00059714034,0.00007822721,0.00034108091,0.0046468414,0.89481777,0.014263095,0.047662932,0.015354165,0.0020856585],"about_ca_topic_score_codex":0.0002939956,"about_ca_topic_score_gemma":0.000027604974,"teacher_disagreement_score":0.86797655,"about_ca_system_score_codex":0.00009276595,"about_ca_system_score_gemma":0.00009751899,"threshold_uncertainty_score":0.8668796},"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":"W2967599115","doi":"","title":"Incidence coloring of graphs with bounded maximum average degree","year":2018,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Degree (music); Bounded function; Mathematics; Incidence (geometry); Graph coloring; Computer science; Combinatorics; Discrete mathematics; Graph; Physics; Mathematical analysis; Geometry","score_opus":0.020220495256036704,"score_gpt":0.2204528692569603,"score_spread":0.2002323740009236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967599115","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.4037032,0.0007812068,0.57065094,0.0026052897,0.00041698792,0.00050046074,0.00001804895,0.00045666614,0.020867191],"genre_scores_gemma":[0.7491302,0.0001699448,0.2496486,0.00007495719,0.00000392346,0.00004202085,0.00003695141,0.000027691574,0.0008657127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948428,0.0022220234,0.000654638,0.0010791845,0.0007568443,0.00044450568],"domain_scores_gemma":[0.9910566,0.00080966164,0.00085217145,0.003607234,0.0034570107,0.00021728617],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005117794,0.00038594913,0.00048361375,0.00037026047,0.00038469682,0.0004927212,0.0030503208,0.00026614292,0.000032997857],"category_scores_gemma":[0.0005847922,0.00036276015,0.00018853853,0.0008644283,0.00057492673,0.00028883212,0.0028763392,0.0005975249,0.000027161792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003977083,0.0008248331,0.008381865,0.00048203184,0.00022647395,0.000030346291,0.012962699,0.00044569044,0.00529823,0.94238806,0.00095974945,0.02796028],"study_design_scores_gemma":[0.0018011312,0.000008412027,0.008518037,0.008868897,0.000103446146,0.000078164594,0.000076674456,0.07681962,0.21439536,0.6852242,0.002461616,0.0016444576],"about_ca_topic_score_codex":0.001238776,"about_ca_topic_score_gemma":0.0009823997,"teacher_disagreement_score":0.34542698,"about_ca_system_score_codex":0.000067976165,"about_ca_system_score_gemma":0.00049118174,"threshold_uncertainty_score":0.99988246},"labels":[],"label_agreement":null},{"id":"W2971295615","doi":"10.1007/s40305-019-00261-0","title":"Preface: Special Issue on Combinatorial Optimization","year":2019,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of China","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":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Operations research; Mathematical economics; Combinatorics; Mathematics","score_opus":0.021705015648237767,"score_gpt":0.31200613692723445,"score_spread":0.29030112127899665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971295615","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8317366,0.00054973376,0.034435295,0.093849234,0.01588445,0.0019643095,0.000012666496,0.000057289384,0.021510381],"genre_scores_gemma":[0.89708483,0.00039007122,0.09515947,0.0003408602,0.0013282263,0.0000045074307,0.0000014321283,0.000018682513,0.005671934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794877,0.0002886237,0.0003358688,0.0001238787,0.0011325807,0.00017029779],"domain_scores_gemma":[0.9985203,0.00010136287,0.00010724536,0.00041645265,0.00078866637,0.00006595765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021331937,0.00006982561,0.00015241736,0.00008440321,0.00035191647,0.0001649783,0.0009744664,0.00006504773,0.00015244099],"category_scores_gemma":[0.00017307587,0.00004373652,0.00021522096,0.00061817945,0.00010498794,0.00039578913,0.00020789774,0.00053403055,0.000023289474],"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.000025563755,0.0002895418,0.000121656376,0.000020208085,0.000051395167,3.9515007e-7,0.0026846328,0.8425207,0.0035727439,0.04692553,0.102878384,0.00090921065],"study_design_scores_gemma":[0.0033621078,0.0018215994,0.0016268366,0.0004291388,0.00001525976,0.000027930233,0.00037844287,0.92266154,0.017925922,0.030570174,0.020944586,0.00023647021],"about_ca_topic_score_codex":0.00001804853,"about_ca_topic_score_gemma":8.691143e-7,"teacher_disagreement_score":0.09350837,"about_ca_system_score_codex":0.000060997023,"about_ca_system_score_gemma":0.0003009527,"threshold_uncertainty_score":0.27066925},"labels":[],"label_agreement":null},{"id":"W2971863873","doi":"","title":"Super (a, d)-vertex antimagic total labeling on a disjoint union of regular graphs","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"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; Disjoint sets; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.010294113318167765,"score_gpt":0.23194292895178276,"score_spread":0.221648815633615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971863873","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97678435,0.00054183725,0.011164984,0.00062031933,0.010085961,0.00022216042,0.0000010552161,0.000070592025,0.0005087418],"genre_scores_gemma":[0.9775417,0.000043062024,0.022218626,0.000060645245,0.00011314259,3.631877e-7,6.474526e-7,0.000017594206,0.0000042336196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99676186,0.00017303565,0.0013892626,0.00031614324,0.0009766162,0.00038311115],"domain_scores_gemma":[0.9968967,0.0004995846,0.0011509272,0.00048504706,0.0007392984,0.00022843199],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022534844,0.00032891447,0.0008768683,0.00042067235,0.0002443025,0.0002237514,0.0006849327,0.0001584476,0.0000020466416],"category_scores_gemma":[0.00037909584,0.00027519866,0.00028655236,0.0006546604,0.000094000374,0.0003615487,0.0002015959,0.00049654994,0.0000018778262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041549578,0.0008199178,0.000043156095,0.00006547838,0.000054270324,0.000022435801,0.0007568869,0.00020879612,0.0067233774,0.9868908,0.00016544142,0.004207925],"study_design_scores_gemma":[0.0036349427,0.0023251935,0.00017848404,0.0007735612,0.000053591048,0.00013031544,0.00009269173,0.019196412,0.0051018978,0.96816874,0.000041011557,0.00030315213],"about_ca_topic_score_codex":0.000006016238,"about_ca_topic_score_gemma":4.0310955e-8,"teacher_disagreement_score":0.018987615,"about_ca_system_score_codex":0.000041250867,"about_ca_system_score_gemma":0.00009925572,"threshold_uncertainty_score":0.99997},"labels":[],"label_agreement":null},{"id":"W2972117245","doi":"","title":"Super edge-antimagic total labelings","year":2006,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":13,"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; Enhanced Data Rates for GSM Evolution; Arithmetic; Combinatorics; Telecommunications; Computer science","score_opus":0.009141523871078985,"score_gpt":0.213803388938798,"score_spread":0.204661865067719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972117245","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70182717,0.0021427674,0.16645494,0.0058928835,0.001063286,0.0007128761,0.000014526429,0.0021726433,0.119718924],"genre_scores_gemma":[0.87950885,0.0000027667427,0.11808627,0.000245405,0.000017820985,0.000015574351,0.0000042828456,0.000016940523,0.0021020595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983475,0.000039851395,0.00040676634,0.00042518313,0.0003710807,0.00040958723],"domain_scores_gemma":[0.99872905,0.0001700066,0.000068637506,0.00082080753,0.000117335345,0.000094148716],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00044607287,0.00019308385,0.00024008051,0.000122782,0.00015113181,0.000159804,0.00053336483,0.000069917754,0.00015483658],"category_scores_gemma":[0.0000925474,0.00015806321,0.0001197992,0.00039001458,0.000100971585,0.00029420515,0.00021350874,0.00012991848,0.00092729623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001500402,0.00022953977,0.00012105676,0.000056359626,0.0000127718195,0.000012612123,0.00033990445,0.00002639332,0.0021564548,0.9788763,0.017162872,0.0010042497],"study_design_scores_gemma":[0.00039328044,0.000054114684,0.0003930995,0.000072022194,0.000018628476,0.00009204158,0.000038601218,0.043950375,0.0029627099,0.94977015,0.0019349582,0.00032001323],"about_ca_topic_score_codex":0.000040511008,"about_ca_topic_score_gemma":0.0000010913105,"teacher_disagreement_score":0.17768173,"about_ca_system_score_codex":0.000015714219,"about_ca_system_score_gemma":0.00003527552,"threshold_uncertainty_score":0.9998506},"labels":[],"label_agreement":null},{"id":"W2972255214","doi":"","title":"Edge antimagic total labeling on paths and unicycles","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","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":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Arithmetic; Computer science; Telecommunications","score_opus":0.0170136617437347,"score_gpt":0.2381651390073427,"score_spread":0.221151477263608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972255214","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9847503,0.0008055332,0.0045473855,0.0002855308,0.008774784,0.00014701228,7.377711e-7,0.00007547039,0.00061328465],"genre_scores_gemma":[0.97709894,0.0001438383,0.022402989,0.00006511426,0.0002579283,6.231974e-7,3.2037295e-7,0.000022566925,0.000007659789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975474,0.0001044992,0.0009809945,0.00031293702,0.0006925987,0.0003616027],"domain_scores_gemma":[0.99753743,0.00062070397,0.00077355147,0.0003386979,0.0004580555,0.00027158463],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013349712,0.00030088497,0.00066866697,0.00028054888,0.0005411389,0.00025433206,0.0004927943,0.00013706206,0.0000014370396],"category_scores_gemma":[0.00034400276,0.00025472487,0.00013422556,0.00037562946,0.00015091454,0.00034645814,0.0003928584,0.000513277,0.000003248934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000273204,0.00042500455,0.00017916864,0.00006491839,0.000053368258,0.00009848385,0.0013507901,0.00006989506,0.0010501718,0.9936199,0.0002133049,0.0028476405],"study_design_scores_gemma":[0.005068286,0.001458035,0.00030269517,0.000532046,0.000046309593,0.0013689052,0.000118534954,0.029549422,0.0014692751,0.9593521,0.00026680963,0.00046760784],"about_ca_topic_score_codex":0.000005436707,"about_ca_topic_score_gemma":4.0027608e-8,"teacher_disagreement_score":0.034267858,"about_ca_system_score_codex":0.000033022166,"about_ca_system_score_gemma":0.00012707432,"threshold_uncertainty_score":0.9999905},"labels":[],"label_agreement":null},{"id":"W2974906356","doi":"","title":"Super edge-antimagic labelings of the generalized Petersen graph P(n, (n - 1)/2)","year":2006,"lang":"en","type":"article","venue":"FedUni ResearchOnline (Federation University Australia)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Graph; Combinatorics; Petersen graph; Line graph; Voltage graph","score_opus":0.03177634143353071,"score_gpt":0.2554689947965728,"score_spread":0.22369265336304212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2974906356","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97703636,0.00004889653,0.010052825,0.010119041,0.00038739905,0.00042250784,0.000037579553,0.00017449995,0.0017208696],"genre_scores_gemma":[0.9624947,0.000028083825,0.020333458,0.000120076926,0.000032139764,8.6698054e-7,0.000043724685,0.000010824553,0.01693617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977772,0.00033788386,0.0002984911,0.00044686548,0.00072179403,0.0004177511],"domain_scores_gemma":[0.99841475,0.00008862241,0.00014244646,0.00070486614,0.00052855664,0.0001207456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049320905,0.0001764048,0.00021006587,0.00033289415,0.0007142295,0.00020509223,0.0010604686,0.000114668976,0.00006347208],"category_scores_gemma":[0.00006970483,0.00015085917,0.00019398757,0.0011573146,0.00030557622,0.0005548271,0.0003923503,0.00033251225,0.0000365568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113849,0.000704285,0.009280261,0.000091378446,0.000108220695,0.00006805255,0.0005551076,0.007956497,0.19280192,0.7294919,0.058219496,0.0006090471],"study_design_scores_gemma":[0.022153147,0.0012923147,0.13710463,0.00076205115,0.00032185816,0.00022935617,0.001748404,0.21279013,0.2168794,0.22075328,0.18192618,0.0040392485],"about_ca_topic_score_codex":0.0020180736,"about_ca_topic_score_gemma":0.0003599929,"teacher_disagreement_score":0.5087386,"about_ca_system_score_codex":0.000057305762,"about_ca_system_score_gemma":0.00017346535,"threshold_uncertainty_score":0.61518586},"labels":[],"label_agreement":null},{"id":"W2978723903","doi":"10.1007/978-3-319-91908-9_3","title":"Computing in Combinatorial Optimization","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Combinatorial optimization; Subject (documents); Linear programming; Development (topology); Work (physics); Optimization problem; Theoretical computer science; Operations research; Algorithm; Mathematics; World Wide Web","score_opus":0.011562044705810645,"score_gpt":0.2257654991211383,"score_spread":0.21420345441532765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978723903","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.00018664313,0.00029993663,0.9893878,0.0003771071,0.005716863,0.0004002567,0.0000012279086,0.00017298284,0.0034571695],"genre_scores_gemma":[0.2914395,0.000036801062,0.70682555,0.0012895792,0.00015145748,0.0000028019101,0.00000974409,0.00004901374,0.00019551851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961351,0.000049811253,0.0006680567,0.0015442776,0.0009382781,0.0006644743],"domain_scores_gemma":[0.9976857,0.0004102391,0.0003168658,0.0012152903,0.0002437557,0.00012816672],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012819575,0.0004639529,0.0005676765,0.0012823284,0.00016436777,0.00047965796,0.0024535365,0.00038043622,0.00001257251],"category_scores_gemma":[0.00008831555,0.00045236578,0.00010320591,0.0009966968,0.00034545237,0.0005024053,0.001289414,0.00087725656,0.00005588021],"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.0000032467146,0.000028298777,0.00012705418,0.000023444489,0.0000033471424,0.000032272797,0.00030788156,0.80587524,0.00002632092,0.1348504,0.0000101517,0.058712337],"study_design_scores_gemma":[0.00050234376,0.00009716422,0.000037714093,0.00039769214,0.0000023766677,0.000017836672,6.16312e-8,0.7960158,0.00013446501,0.20225193,0.000111333335,0.0004313141],"about_ca_topic_score_codex":0.000039256396,"about_ca_topic_score_gemma":0.00001704792,"teacher_disagreement_score":0.29125288,"about_ca_system_score_codex":0.00024577102,"about_ca_system_score_gemma":0.0006594529,"threshold_uncertainty_score":0.9997928},"labels":[],"label_agreement":null},{"id":"W2993701604","doi":"10.46298/dmtcs.570","title":"Vertex-colouring edge-weightings with two edge weights","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Weighting; Discrete mathematics","score_opus":0.01134346464713837,"score_gpt":0.24126704247485,"score_spread":0.22992357782771164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2993701604","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.16548008,0.00009240876,0.82292694,0.0005770214,0.0007634778,0.00027617905,0.0000011920632,0.00040449298,0.0094781965],"genre_scores_gemma":[0.60029733,0.0000020582938,0.39932728,0.00028604592,0.00003882574,0.000011960331,6.7770986e-7,0.000017388214,0.00001843387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99583566,0.00009457232,0.00053184555,0.00084407296,0.0013011812,0.0013926864],"domain_scores_gemma":[0.9968777,0.00042195283,0.00020694248,0.0014458852,0.00028981327,0.0007577391],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023638827,0.0004179581,0.00042958988,0.00031110973,0.0008524631,0.00077327987,0.0026929958,0.00007399078,0.000040331466],"category_scores_gemma":[0.0000917802,0.00027642213,0.00012300297,0.0015359025,0.0024168422,0.0014129708,0.0013803141,0.00033830124,0.00022663173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004131759,0.00016684002,0.00016323754,0.000033334123,0.000012596073,0.000008192294,0.0025613136,0.000037376707,0.0005897119,0.9947489,0.00005961547,0.001614746],"study_design_scores_gemma":[0.00047314295,0.00018875542,0.00012914644,0.00021053209,0.000024710836,0.00015339607,0.000038687624,0.40074486,0.0066570533,0.5907594,0.000095291136,0.0005250073],"about_ca_topic_score_codex":0.0000034058385,"about_ca_topic_score_gemma":4.100012e-7,"teacher_disagreement_score":0.43481725,"about_ca_system_score_codex":0.00005353553,"about_ca_system_score_gemma":0.00011913115,"threshold_uncertainty_score":0.99996877},"labels":[],"label_agreement":null},{"id":"W2996927339","doi":"10.30538/psrp-odam2019.0021","title":"On graceful difference labelings of disjoint unions of circuits","year":2019,"lang":"en","type":"article","venue":"Open Journal of Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Bijection; Conjecture; Disjoint sets; Vertex (graph theory); Combinatorics; Mathematics; Arc (geometry); Electronic circuit; Graph; Set (abstract data type); Discrete mathematics; Computer science; Physics; Geometry","score_opus":0.018546878991419085,"score_gpt":0.2528436077341566,"score_spread":0.23429672874273752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996927339","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8574087,0.00009393615,0.12714605,0.00039359537,0.00025744474,0.00054342044,0.000009826208,0.000016149022,0.014130852],"genre_scores_gemma":[0.91059315,0.000020253323,0.08919286,0.00006728132,0.0000030275626,0.0000025842069,7.444191e-7,0.0000127837375,0.00010732446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808925,0.000028801811,0.0009528795,0.00018117507,0.0005586584,0.00018925556],"domain_scores_gemma":[0.9972802,0.00030002504,0.0013619929,0.00068020675,0.0002621326,0.000115454284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008870167,0.000164469,0.0006341081,0.0001666431,0.00004525706,0.00008331587,0.0017475412,0.000058655754,0.0000312331],"category_scores_gemma":[0.00007574573,0.00011684935,0.00012506827,0.0003622518,0.00007091605,0.0001810583,0.00042179745,0.00021797202,0.00001837868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011739402,0.0002831507,0.00003758771,0.00015326518,0.0000564918,0.0000024472724,0.0013146889,0.00031923494,0.06367596,0.9319515,0.00011373875,0.0020801655],"study_design_scores_gemma":[0.0015473234,0.00067564996,0.00021465399,0.0011429848,0.00005731595,0.000043563043,0.0004580146,0.003740387,0.05334316,0.9384897,0.000034707544,0.00025255236],"about_ca_topic_score_codex":0.000004645364,"about_ca_topic_score_gemma":5.8511176e-7,"teacher_disagreement_score":0.053184416,"about_ca_system_score_codex":0.000013588394,"about_ca_system_score_gemma":0.00010267727,"threshold_uncertainty_score":0.4764978},"labels":[],"label_agreement":null},{"id":"W2999040677","doi":"10.37236/1158","title":"The Circular Chromatic Index of Flower Snarks","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Technische Universität Berlin; National Science Foundation","keywords":"Mathematics; Combinatorics; Integer (computer science); Chromatic scale; Edge coloring; Index (typography); Graph","score_opus":0.002675496058256494,"score_gpt":0.18386389701004804,"score_spread":0.18118840095179156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999040677","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.767444,0.031976953,0.19269106,0.0046929987,0.0016313872,0.00021319055,2.3052353e-7,0.000046005458,0.0013041607],"genre_scores_gemma":[0.9994896,0.00027005945,0.00004231791,0.000052822696,0.000016832835,0.000001178302,1.04367096e-7,0.000007997608,0.00011910153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981738,0.00015660147,0.0005457073,0.00009238248,0.00060351874,0.000427999],"domain_scores_gemma":[0.9982892,0.0002750252,0.000548401,0.0005098049,0.0003375427,0.000040008064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020645463,0.000113002876,0.00020528391,0.00008607009,0.00024286784,0.00007616772,0.0014016464,0.000049073464,0.0000018028712],"category_scores_gemma":[0.00005999566,0.00005960656,0.00015416334,0.00062441727,0.00010134726,0.00014775828,0.000091104404,0.0004927058,0.0000030959789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006585763,0.00008623831,0.00015906044,0.000006175294,0.000046212346,0.000003825121,0.0000789354,0.00068612193,0.0008163129,0.9967519,0.00096834876,0.0003902985],"study_design_scores_gemma":[0.0005118595,0.00022862168,0.00042806705,0.000025166635,0.000023149176,0.00014900808,0.000019549489,0.004886479,0.0019475116,0.98992133,0.00178354,0.0000757295],"about_ca_topic_score_codex":0.000017165296,"about_ca_topic_score_gemma":0.0000039574793,"teacher_disagreement_score":0.23204558,"about_ca_system_score_codex":0.00009129387,"about_ca_system_score_gemma":0.00037101278,"threshold_uncertainty_score":0.2604631},"labels":[],"label_agreement":null},{"id":"W3000916183","doi":"10.1016/j.dam.2020.08.007","title":"The threshold dimension of a graph","year":2020,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto; University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Metric dimension; Vertex (graph theory); Graph; Discrete mathematics; Dimension (graph theory); Bound graph; Graph power; Line graph; Pathwidth","score_opus":0.02559084689143243,"score_gpt":0.24836980972496245,"score_spread":0.22277896283353002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000916183","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.02804438,0.0026192702,0.91775817,0.006429825,0.0016125096,0.0028112598,0.000045740802,0.001185837,0.039493017],"genre_scores_gemma":[0.74170804,0.0002676574,0.25747636,0.0002727146,0.000018327582,0.00013258238,0.00001963831,0.000050895964,0.000053781096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976571,0.00001974352,0.000755602,0.0005781616,0.0006636039,0.0003257819],"domain_scores_gemma":[0.9969517,0.00024070663,0.00064383924,0.00192165,0.00011280797,0.00012927852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053309987,0.0003548888,0.0005372587,0.000086436885,0.00020902687,0.00020540948,0.001927603,0.00020626589,0.0000023615871],"category_scores_gemma":[0.000045507462,0.00022840165,0.00025437525,0.00035320738,0.00019462222,0.000041384425,0.0027356034,0.0005557553,0.000033701748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048622323,0.000045242403,0.0000017146524,0.00034357698,0.000070286325,0.0000023267955,0.0014260156,0.0004477459,0.005198816,0.9903957,0.0013901526,0.00067351485],"study_design_scores_gemma":[0.00017187437,0.000027251115,0.000004701018,0.00017081166,0.000046789155,0.0000021860776,0.000112167516,0.043517787,0.006324202,0.94919753,0.00016430223,0.0002603693],"about_ca_topic_score_codex":0.0000051488196,"about_ca_topic_score_gemma":0.0000013826352,"teacher_disagreement_score":0.7136637,"about_ca_system_score_codex":0.000012393229,"about_ca_system_score_gemma":0.00009187449,"threshold_uncertainty_score":0.9313949},"labels":[],"label_agreement":null},{"id":"W3006616331","doi":"10.1016/j.jctb.2020.02.001","title":"Corrigendum to “Bisimplicial vertices in even-hole-free graphs”","year":2020,"lang":"en","type":"erratum","venue":"Journal of Combinatorial Theory Series B","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Army Research Office; Air Force Office of Scientific Research; National Science Foundation","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.015395560638991857,"score_gpt":0.238693414439034,"score_spread":0.22329785380004213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006616331","genre_codex":"editorial","genre_gemma":"empirical","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.004032249,0.004692319,0.0030740278,0.011868351,0.95505416,0.00079662364,0.00004186424,0.00026361368,0.020176802],"genre_scores_gemma":[0.6653142,0.0071924482,0.05340177,0.03355899,0.040693153,0.00026253736,0.00020836713,0.0017006538,0.19766788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956681,0.0005812601,0.0014339444,0.00052249455,0.0012176426,0.00057654205],"domain_scores_gemma":[0.9965834,0.0001711944,0.0011014326,0.0010168368,0.000613341,0.0005138204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018874137,0.0005142958,0.0011798085,0.00082214404,0.00017257423,0.00038253798,0.0041409996,0.00054348115,0.000033211105],"category_scores_gemma":[0.0012718611,0.0004551911,0.00043265813,0.0014594633,0.00013814408,0.0008668592,0.00097024144,0.0020070402,0.000030481908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042552644,0.00009647777,0.000011594285,0.00003542575,0.00006360881,0.00018312837,0.00068417547,0.000019689558,0.00008998486,0.5362514,0.46157926,0.00055969984],"study_design_scores_gemma":[0.0011290632,0.0012764005,0.000033565277,0.00032283168,0.000037267746,0.000047601832,0.00012244344,0.000028684637,0.00016578965,0.6866104,0.30986655,0.00035942515],"about_ca_topic_score_codex":0.00001561674,"about_ca_topic_score_gemma":0.00001342995,"teacher_disagreement_score":0.914361,"about_ca_system_score_codex":0.00011095225,"about_ca_system_score_gemma":0.00084304996,"threshold_uncertainty_score":0.99978995},"labels":[],"label_agreement":null},{"id":"W3006791922","doi":"10.1142/s1793830920500354","title":"Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Planar graph; Edge coloring; Graph; Discrete mathematics; Line graph; Graph power","score_opus":0.027274697744840797,"score_gpt":0.25649152647945705,"score_spread":0.22921682873461627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006791922","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.015544993,0.00047233663,0.9805401,0.001277992,0.000046370915,0.0004529031,0.000031541593,0.00018865753,0.001445086],"genre_scores_gemma":[0.62876576,0.000081096325,0.37081507,0.00016718276,0.000017063297,0.000106125815,0.000012570305,0.000017093867,0.000018011073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989583,0.0000131519055,0.00034284586,0.00030906335,0.00020349417,0.00017313033],"domain_scores_gemma":[0.99915457,0.00009560579,0.00018184232,0.00032682606,0.00008000283,0.00016116787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015777677,0.00013559197,0.00023685582,0.00004890522,0.00018738885,0.00010443892,0.00038562185,0.000039053684,0.0000020419209],"category_scores_gemma":[0.00004486625,0.00011688491,0.00005601737,0.00034497544,0.00008398222,0.00010859449,0.00014979069,0.000095353505,0.0000060060947],"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.0000010487763,0.00006308166,0.00032893362,0.00015834562,0.000027110473,8.0028553e-7,0.0019246808,0.000048868842,0.0013437076,0.9868927,0.00011611611,0.009094622],"study_design_scores_gemma":[0.0005645472,0.00009877966,0.0005381054,0.00017485925,0.00006069033,0.0000112690595,0.00075328,0.51690066,0.0024603638,0.4757749,0.0022295034,0.00043302323],"about_ca_topic_score_codex":0.00001479596,"about_ca_topic_score_gemma":0.000001103064,"teacher_disagreement_score":0.6132208,"about_ca_system_score_codex":0.000005167129,"about_ca_system_score_gemma":0.000019567486,"threshold_uncertainty_score":0.47664285},"labels":[],"label_agreement":null},{"id":"W3007549497","doi":"10.5753/etc.2016.9831","title":"Some families of 0-rotatable graceful caterpillars","year":2016,"lang":"en","type":"article","venue":"","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Combinatorics; Vertex (graph theory); Conjecture; Injective function; Mathematics; Tree (set theory); Biology; Graph","score_opus":0.010616707143095958,"score_gpt":0.20953497631679835,"score_spread":0.1989182691737024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007549497","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9209285,0.0009771684,0.06725273,0.004443783,0.00081976946,0.00017225082,0.000005198637,0.00049366604,0.0049069338],"genre_scores_gemma":[0.9770847,0.0001418646,0.020070152,0.0002878958,0.000004533778,0.0000042262513,2.3625151e-7,0.0000046039363,0.002401807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999239,0.000020004542,0.00017735809,0.00020803086,0.00016935682,0.00018623818],"domain_scores_gemma":[0.9992994,0.000059038688,0.000051970925,0.00045655642,0.000076017066,0.000057002264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017486261,0.000073810406,0.00011279101,0.00009849162,0.00003944927,0.00002084755,0.00039252455,0.000027913851,0.000018899169],"category_scores_gemma":[0.000022958919,0.000040465457,0.000041100157,0.00018786606,0.0000640496,0.00039330835,0.00015348336,0.000020989197,0.0001144152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021746334,0.000036280468,0.0022261315,0.0000094096595,0.000010218855,0.0000024022406,0.00010864519,0.0000095406385,0.113413654,0.86659014,0.004079643,0.013511731],"study_design_scores_gemma":[0.0007150679,0.00014891103,0.0014127556,0.00007175781,0.000005020421,0.000010378354,0.00003279604,0.00067097397,0.4762245,0.5143638,0.006079206,0.00026476756],"about_ca_topic_score_codex":0.0000715095,"about_ca_topic_score_gemma":0.0000042492698,"teacher_disagreement_score":0.36281085,"about_ca_system_score_codex":0.000005773362,"about_ca_system_score_gemma":0.000028149554,"threshold_uncertainty_score":0.16501334},"labels":[],"label_agreement":null},{"id":"W3007984159","doi":"10.7151/dmgt.2359","title":"The threshold dimension and irreducible graphs","year":2020,"lang":"en","type":"preprint","venue":"Discussiones Mathematicae Graph Theory","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Winnipeg","funders":"","keywords":"Combinatorics; Metric dimension; Mathematics; Vertex (graph theory); Dimension (graph theory); Graph; Discrete mathematics; Chordal graph; 1-planar graph","score_opus":0.023276330664994398,"score_gpt":0.25142615005723523,"score_spread":0.22814981939224083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007984159","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.3070056,0.08047375,0.34311607,0.19910388,0.017226698,0.010711061,0.00015019895,0.009361676,0.03285106],"genre_scores_gemma":[0.9758045,0.0015280944,0.020806389,0.00079008925,0.000030449664,0.00027548178,0.000020616335,0.00009429335,0.00065005705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961403,0.00038546996,0.00081019796,0.0013288697,0.0007382772,0.0005969096],"domain_scores_gemma":[0.99580914,0.0007043512,0.00047046,0.002501489,0.00013369534,0.00038084385],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020890094,0.00064274395,0.0006734192,0.0002696955,0.0010524323,0.00080986065,0.0020272168,0.00030632506,0.000012786234],"category_scores_gemma":[0.0002581056,0.00032272158,0.00041987307,0.00062568724,0.0006271623,0.00022201879,0.0040622405,0.0009173474,0.00006867685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021205813,0.00009136759,0.000023909311,0.0002423444,0.00010583281,0.000011976447,0.0020041938,0.000026071648,0.00055754,0.99045855,0.002857951,0.0035990332],"study_design_scores_gemma":[0.00023865038,0.00005259537,0.000100175785,0.0005804303,0.0000775678,0.00002476791,0.0003418437,0.0057724607,0.00045738273,0.99153674,0.0003138253,0.0005035438],"about_ca_topic_score_codex":0.0000037296054,"about_ca_topic_score_gemma":0.0000013528415,"teacher_disagreement_score":0.6687989,"about_ca_system_score_codex":0.000012993698,"about_ca_system_score_gemma":0.000094256204,"threshold_uncertainty_score":0.9999225},"labels":[],"label_agreement":null},{"id":"W3009498706","doi":"10.1109/focs46700.2020.00060","title":"Adjacency Labelling for Planar Graphs (and Beyond)","year":2020,"lang":"en","type":"article","venue":"","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Combinatorics; Adjacency list; Planar graph; Vertex (graph theory); Mathematics; Bounded function; Discrete mathematics; Graph","score_opus":0.02590588498453407,"score_gpt":0.22478355072696415,"score_spread":0.1988776657424301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009498706","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.0433232,0.0018267233,0.9152406,0.031042125,0.00039325078,0.00042273823,0.0000065476424,0.0009764254,0.006768394],"genre_scores_gemma":[0.5740572,0.00009073439,0.41354313,0.012037997,0.000008999979,0.000016195654,0.00000343746,0.000011378948,0.0002309111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927735,0.000010728721,0.00013351644,0.0003037773,0.00009989331,0.00017475741],"domain_scores_gemma":[0.99955297,0.00006991952,0.000029665496,0.00015471804,0.00004481754,0.00014789749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011823297,0.000081816346,0.0000997384,0.000040505503,0.0001117284,0.00007204591,0.00025071096,0.000033534106,0.000005703512],"category_scores_gemma":[0.000026367634,0.0000672453,0.00003823293,0.00021977662,0.000021459433,0.00014632099,0.00005568215,0.00005283866,0.000016605483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003363767,0.000010289056,0.00017985112,0.000017103046,0.000007503295,0.0000015194184,0.00044082332,0.00002130193,0.0032444175,0.9857544,0.005812656,0.0045067854],"study_design_scores_gemma":[0.00095480477,0.00034211637,0.000058390666,0.000013754566,0.000011917516,0.0000066575953,0.00007212586,0.13009436,0.008979705,0.8492958,0.0098532075,0.00031717803],"about_ca_topic_score_codex":0.000007308756,"about_ca_topic_score_gemma":0.000001381171,"teacher_disagreement_score":0.530734,"about_ca_system_score_codex":0.0000014777848,"about_ca_system_score_gemma":0.000014221454,"threshold_uncertainty_score":0.27421838},"labels":[],"label_agreement":null},{"id":"W3010016474","doi":"10.1007/11534273","title":"Algorithms and Data Structures","year":2005,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Data structure; Theoretical computer science; Programming language","score_opus":0.02530740534750959,"score_gpt":0.27250278019102586,"score_spread":0.24719537484351628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010016474","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.000068883775,0.003077778,0.9930316,0.0011055568,0.0015629835,0.00022931372,0.00001494039,0.00020351872,0.0007054253],"genre_scores_gemma":[0.009537059,0.00014652446,0.9868911,0.0025298328,0.00029422183,0.000003607947,0.0000310406,0.000028416087,0.00053821044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955519,0.000051036743,0.00044706665,0.0023411824,0.0009401915,0.000668667],"domain_scores_gemma":[0.9958339,0.00034051665,0.0002084123,0.003237836,0.00015268923,0.00022665161],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011495219,0.00046718097,0.00046259095,0.0007303621,0.00028729625,0.00088149414,0.0064120702,0.00029915274,0.0000072392154],"category_scores_gemma":[0.000111875175,0.00039379662,0.000044465305,0.0008947446,0.00087525137,0.00092631235,0.005243961,0.0007820481,0.00001596924],"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.0000012137907,0.000016646334,0.000026864976,0.00002692571,0.000008081178,0.000038006605,0.0003086812,0.005905942,0.000039754166,0.010499797,0.00084285607,0.9822852],"study_design_scores_gemma":[0.00022084005,0.00006572011,0.00011024753,0.00014333634,0.0000069171956,0.00012299615,5.9959135e-8,0.600757,0.00017354715,0.39292726,0.00497778,0.00049427047],"about_ca_topic_score_codex":0.000027615946,"about_ca_topic_score_gemma":0.00004727308,"teacher_disagreement_score":0.98179096,"about_ca_system_score_codex":0.00011333338,"about_ca_system_score_gemma":0.0009249176,"threshold_uncertainty_score":0.9998514},"labels":[],"label_agreement":null},{"id":"W3013722319","doi":"10.5441/002/edbt.2020.52","title":"Efficient Enumeration of Four Node Graphlets at Trillion-Scale","year":2020,"lang":"en","type":"article","venue":"Movebank","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Enumeration; Computer science; Node (physics); Scale (ratio); Theoretical computer science; Mathematics; Combinatorics; Physics","score_opus":0.02019951112302901,"score_gpt":0.2071172790414876,"score_spread":0.1869177679184586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013722319","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8986108,0.0002941688,0.09598181,0.003423373,0.00031294045,0.00013916858,0.0000049227033,0.0001664442,0.0010664114],"genre_scores_gemma":[0.98738027,0.0000063426,0.011310168,0.0011805694,0.000011105125,0.0000049957184,0.0000028576217,0.0000065834515,0.00009712085],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892646,0.000042806794,0.00025295786,0.0003093259,0.00030025234,0.00016820712],"domain_scores_gemma":[0.9993165,0.00004049081,0.00010268879,0.0003132073,0.00011786596,0.000109231376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001654747,0.00009775098,0.00014398008,0.00007235325,0.00009285434,0.000034977056,0.00030717973,0.00004784737,0.000022133125],"category_scores_gemma":[0.000040257783,0.00008668086,0.00008114983,0.0006081003,0.000035750065,0.00005729053,0.00016293116,0.000065987086,0.000085228305],"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.00014745844,0.00053768227,0.032620214,0.00022530861,0.000106004,0.0000561946,0.008723698,0.24520037,0.5158975,0.15183225,0.022977114,0.021676214],"study_design_scores_gemma":[0.0013562546,0.0002230172,0.0077009327,0.000038348117,0.000014452003,0.0000103807915,0.000010390087,0.8672278,0.11423462,0.00508098,0.0037556018,0.0003472591],"about_ca_topic_score_codex":0.000015998974,"about_ca_topic_score_gemma":0.000001578987,"teacher_disagreement_score":0.6220274,"about_ca_system_score_codex":0.000012150958,"about_ca_system_score_gemma":0.000021526266,"threshold_uncertainty_score":0.3534743},"labels":[],"label_agreement":null},{"id":"W3022142029","doi":"","title":"New constructions of A-magic graphs using labeling matrices","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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; MAGIC (telescope); Combinatorics; Arithmetic; Astronomy; Physics","score_opus":0.022013441299921683,"score_gpt":0.250683089911664,"score_spread":0.2286696486117423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022142029","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8955784,0.0014875669,0.08935029,0.00007824408,0.013030398,0.00015325665,8.637185e-7,0.00005825066,0.00026276984],"genre_scores_gemma":[0.7853059,0.00009732097,0.21441004,0.00001100609,0.00015663393,1.4765904e-7,1.7562078e-7,0.000015691123,0.00000308431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971671,0.00009466466,0.0014229764,0.00023748861,0.0007621572,0.00031559664],"domain_scores_gemma":[0.9964026,0.00048610845,0.0016717878,0.00033905377,0.00083413173,0.00026629644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010666949,0.00025914385,0.0007796773,0.00047307872,0.0003766238,0.00013004089,0.00068919576,0.0001383253,0.0000036471124],"category_scores_gemma":[0.00025888995,0.00023262587,0.00023150753,0.000896667,0.00015094283,0.0004301325,0.00030114022,0.000390478,0.0000011938838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016115575,0.00021309001,0.00042544224,0.00008692958,0.00009069819,0.000026331603,0.001174945,0.00026768044,0.0033502723,0.9933409,0.00016286843,0.00084473944],"study_design_scores_gemma":[0.0031333459,0.00043998414,0.000036903326,0.00040605408,0.00008453878,0.0010981779,0.00014681158,0.020117298,0.0027619652,0.9714249,0.00007535658,0.00027469377],"about_ca_topic_score_codex":0.00004587474,"about_ca_topic_score_gemma":1.2732757e-7,"teacher_disagreement_score":0.12505975,"about_ca_system_score_codex":0.000035182777,"about_ca_system_score_gemma":0.0004015035,"threshold_uncertainty_score":0.94862074},"labels":[],"label_agreement":null},{"id":"W3023039235","doi":"","title":"Vertex-antimagic total labeling of the union of suns","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","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":"Toronto Metropolitan University","funders":"","keywords":"Suns in alchemy; Mathematics; Vertex (graph theory); Combinatorics; Physics; Graph; Astronomy","score_opus":0.01037254989242579,"score_gpt":0.23310775615505502,"score_spread":0.22273520626262924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023039235","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97854316,0.00050784234,0.007969096,0.00070530304,0.011741514,0.00017937571,8.727816e-7,0.000026584157,0.000326239],"genre_scores_gemma":[0.98620296,0.000020900135,0.013644207,0.000036045993,0.00008310879,1.5485226e-7,1.5567255e-7,0.000009881043,0.000002594422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972982,0.00015691434,0.0013118325,0.00017873473,0.00080151774,0.00025282693],"domain_scores_gemma":[0.9965217,0.0004248797,0.0016932104,0.00043468174,0.00081357075,0.00011195784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020047138,0.00020973926,0.0006874443,0.00018380974,0.00018226539,0.00009464887,0.0008841328,0.00011428426,0.000001034832],"category_scores_gemma":[0.00041224988,0.00014974366,0.00025546498,0.000636588,0.00010924032,0.0002397881,0.00029403516,0.00037355558,3.3790198e-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.000017271806,0.00048994843,0.00016431541,0.00008369682,0.00004583832,0.000003696653,0.0008459582,0.00020873868,0.011187609,0.98450166,0.00011633651,0.002334913],"study_design_scores_gemma":[0.0026919302,0.0008783372,0.00038847083,0.0006911971,0.00006538476,0.00010382593,0.000078349774,0.016492141,0.013281817,0.9651138,0.00003164383,0.0001830595],"about_ca_topic_score_codex":0.000008597371,"about_ca_topic_score_gemma":7.039605e-8,"teacher_disagreement_score":0.019387834,"about_ca_system_score_codex":0.000025563231,"about_ca_system_score_gemma":0.00012778518,"threshold_uncertainty_score":0.61063695},"labels":[],"label_agreement":null},{"id":"W3036828194","doi":"10.1088/1742-6596/1538/1/012015","title":"Odd harmonious labeling on squid graph and double squid graph","year":2020,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Graph; Vertex (graph theory); Injective function; Mathematics; Windmill graph; Wheel graph; Discrete mathematics; Graph power; Line graph","score_opus":0.04530975128021035,"score_gpt":0.24158851789537458,"score_spread":0.19627876661516425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036828194","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75779754,0.0019038522,0.21138436,0.025170289,0.0015639224,0.00031249766,0.000011644857,0.00028003336,0.0015758512],"genre_scores_gemma":[0.98856646,0.0003962547,0.009778771,0.0011431337,0.00007283838,0.0000019165834,9.328433e-7,0.000013284535,0.000026387603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841547,0.00005724175,0.00046489184,0.00030306252,0.00047388306,0.00028546012],"domain_scores_gemma":[0.9984782,0.000058340167,0.00041001444,0.0002605545,0.00051120186,0.0002816945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002689033,0.0002282276,0.00038309066,0.00011065421,0.0002048519,0.0003883513,0.0006007601,0.000061529856,0.00000743203],"category_scores_gemma":[0.000032177722,0.00018768321,0.00014066903,0.0005187725,0.00016545203,0.0010351173,0.00016898,0.000396495,0.00001166372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004059176,0.00015712754,0.00028564225,0.00008658938,0.00013582845,0.00008489156,0.005275773,0.0010834174,0.083649784,0.87525433,0.0015638222,0.03201689],"study_design_scores_gemma":[0.002967174,0.0032911499,0.00027820995,0.00038112397,0.00007653467,0.00013717625,0.0005929426,0.0022831068,0.3850724,0.6025953,0.0016158852,0.00070897065],"about_ca_topic_score_codex":0.0000105326,"about_ca_topic_score_gemma":0.0000016229764,"teacher_disagreement_score":0.30142263,"about_ca_system_score_codex":0.000008888312,"about_ca_system_score_gemma":0.00014606056,"threshold_uncertainty_score":0.7653499},"labels":[],"label_agreement":null},{"id":"W3039055740","doi":"10.48550/arxiv.2006.16396","title":"Applying Skolem Sequences to Gracefully Label New Families of Triangular Windmills","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Conjecture; Combinatorics; Graph; Windmill; Enhanced Data Rates for GSM Evolution; Labelling; Mathematics; Computer science; Function (biology); Discrete mathematics; Artificial intelligence; Engineering; Chemistry; Biology","score_opus":0.10151441572908086,"score_gpt":0.20396489768789047,"score_spread":0.10245048195880961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3039055740","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.40160295,0.00048185012,0.59213907,0.0012889969,0.0010480928,0.0012647052,0.000033577555,0.00059106335,0.0015497209],"genre_scores_gemma":[0.9719465,0.00015556459,0.02641975,0.00056647963,0.000027097922,0.0000032818132,0.000009102969,0.000020953372,0.0008513225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99751717,0.00013763404,0.00038662902,0.0013428219,0.00021723226,0.00039852542],"domain_scores_gemma":[0.99763817,0.000114861876,0.0003585061,0.001209278,0.00022421354,0.00045495882],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032365657,0.0003825744,0.0005966155,0.00046562753,0.00013606886,0.00011505136,0.0023103587,0.00026075068,0.000013554829],"category_scores_gemma":[0.0001003704,0.00041785193,0.00024479136,0.0015267269,0.000109362176,0.00025472278,0.0022330421,0.00046844882,0.000096260665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001089259,0.00017874301,0.0018001018,0.000341822,0.00034001982,0.000512725,0.0024821758,0.2630514,0.008781052,0.70816237,0.0040857187,0.01015496],"study_design_scores_gemma":[0.0023156924,0.00048451632,0.00035347728,0.0007817649,0.00023830285,0.000008946817,0.00060678937,0.17190894,0.009985694,0.8069833,0.004680706,0.0016518563],"about_ca_topic_score_codex":0.0008211791,"about_ca_topic_score_gemma":0.000036300164,"teacher_disagreement_score":0.5703435,"about_ca_system_score_codex":0.00006837007,"about_ca_system_score_gemma":0.00049905333,"threshold_uncertainty_score":0.9998273},"labels":[],"label_agreement":null},{"id":"W3047886978","doi":"10.1016/j.disc.2021.112402","title":"The threshold strong dimension of a graph","year":2021,"lang":"en","type":"preprint","venue":"Discrete Mathematics","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; University of Minnesota","keywords":"Combinatorics; Mathematics; Discrete mathematics; Vertex (graph theory); Graph","score_opus":0.025044511893581728,"score_gpt":0.26067824739411466,"score_spread":0.23563373550053293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047886978","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.32071665,0.011032507,0.6507139,0.002461679,0.0037513606,0.001360106,0.000032824584,0.0005798628,0.009351102],"genre_scores_gemma":[0.8610456,0.0003723689,0.13815488,0.0000635217,0.0000117445625,0.000042875232,0.000021446564,0.000034490735,0.00025304986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777615,0.000067332345,0.00069957494,0.00047991768,0.0006524855,0.00032453117],"domain_scores_gemma":[0.99662644,0.00024027909,0.000545947,0.0022313735,0.0002672289,0.0000887452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007493065,0.00029547265,0.0004629356,0.000097474396,0.0002133988,0.00038382894,0.0014703339,0.00018469077,0.000004548143],"category_scores_gemma":[0.00009792448,0.00019028853,0.0003382288,0.00030226307,0.00016319424,0.000093542825,0.002520523,0.0004736677,0.0000058345504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022199556,0.00011556791,0.000044068525,0.0005046729,0.0001434537,0.00001217838,0.0029606214,0.0021311492,0.0010221587,0.99157906,0.0006325905,0.00085227337],"study_design_scores_gemma":[0.00021331149,0.000049699545,0.000033348377,0.0011297993,0.000074834374,0.000012806866,0.0006139681,0.18316706,0.004695313,0.80953807,0.00007512501,0.00039668145],"about_ca_topic_score_codex":0.000016554703,"about_ca_topic_score_gemma":0.000009111262,"teacher_disagreement_score":0.540329,"about_ca_system_score_codex":0.000015101307,"about_ca_system_score_gemma":0.00012904836,"threshold_uncertainty_score":0.7759741},"labels":[],"label_agreement":null},{"id":"W3048753990","doi":"10.55016/ojs/cdm.v18i1.71209","title":"The localization number and metric dimension of graphs of diameter 2","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Vancouver Island University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Metric dimension; Mathematics; Dimension (graph theory); Metric (unit); Combinatorics; Upper and lower bounds; Chordal graph; Discrete mathematics; Metric space; Graph; 1-planar graph; Mathematical analysis","score_opus":0.011312506953026867,"score_gpt":0.2742144988106574,"score_spread":0.2629019918576305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048753990","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.12659276,0.00026619885,0.8708092,0.0013452495,0.00017583136,0.0003964519,0.000050896437,0.00013508754,0.00022834465],"genre_scores_gemma":[0.9864028,0.00008434257,0.0133755775,0.000037732585,0.0000018657195,0.00001200623,0.0000069058156,0.0000065889544,0.00007218636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989723,0.00005132829,0.00038680783,0.00015313397,0.00025343854,0.00018296862],"domain_scores_gemma":[0.9984009,0.00054483843,0.00016175026,0.00046261257,0.00035803157,0.00007185537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007150348,0.000088690875,0.00018787828,0.00018700701,0.00019375133,0.00004445819,0.0002567572,0.000042307223,0.0000018717329],"category_scores_gemma":[0.00081739237,0.000058264097,0.00006290033,0.002076775,0.00010887788,0.00008678139,0.0002388506,0.000046219477,0.0000240991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021911321,0.00003354554,0.0004308376,0.000045926772,0.000029069124,5.457344e-7,0.00067240896,0.0005336164,0.0020003957,0.993642,0.0014173418,0.0011921598],"study_design_scores_gemma":[0.00042708626,0.00009779765,0.00079763524,0.00015398025,0.000051204166,0.000006613796,0.00024738465,0.2791075,0.015036867,0.703374,0.0005222338,0.00017764716],"about_ca_topic_score_codex":0.000008560813,"about_ca_topic_score_gemma":0.0000016584621,"teacher_disagreement_score":0.85981005,"about_ca_system_score_codex":0.000009224515,"about_ca_system_score_gemma":0.000022328537,"threshold_uncertainty_score":0.2375941},"labels":[],"label_agreement":null},{"id":"W3080338863","doi":"10.1016/j.disc.2020.112122","title":"Towards generalizing MacDougall’s conjecture on vertex-magic total labelings","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics","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":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Norwich University","keywords":"Combinatorics; Conjecture; Mathematics; MAGIC (telescope); Discrete mathematics; Graph; Regular graph; Vertex (graph theory); Degree (music); Line graph; Graph power","score_opus":0.027085922607382854,"score_gpt":0.24275146228219907,"score_spread":0.21566553967481622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080338863","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46837762,0.001157486,0.45053357,0.04632689,0.0016468988,0.0010317366,0.000048202546,0.0023903241,0.028487267],"genre_scores_gemma":[0.8321495,0.000020855663,0.16159238,0.005898445,0.000038827486,0.000010436268,0.000010634104,0.000041259194,0.00023765421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825567,0.0000400398,0.00037432727,0.00046876055,0.00049308955,0.00036814183],"domain_scores_gemma":[0.9989233,0.000069959366,0.00013789044,0.00054757076,0.000074672986,0.0002465887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020292618,0.00027007653,0.00031772855,0.000066203116,0.00013228318,0.00025280257,0.00068820437,0.0000968095,0.000044963766],"category_scores_gemma":[0.00014608075,0.00021301815,0.00014011323,0.00040734984,0.00004959517,0.00017059324,0.0002786656,0.00025256583,0.000346546],"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.0000068830377,0.00007845337,0.000020308817,0.00018484598,0.000055326855,0.000048019665,0.0067000287,0.0015641728,0.0057591847,0.9772072,0.005702875,0.0026727428],"study_design_scores_gemma":[0.0012454437,0.0005496061,0.000037320657,0.00026515787,0.00005596546,0.00006716325,0.00024004771,0.68524563,0.014328556,0.29476076,0.0022887485,0.0009155867],"about_ca_topic_score_codex":0.00001140517,"about_ca_topic_score_gemma":6.294343e-7,"teacher_disagreement_score":0.6836815,"about_ca_system_score_codex":0.000019545505,"about_ca_system_score_gemma":0.00005276089,"threshold_uncertainty_score":0.86866283},"labels":[],"label_agreement":null},{"id":"W3082929499","doi":"10.1016/j.disc.2020.112123","title":"Antimagic orientations of graphs with large maximum degree","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"National Science Foundation","keywords":"Combinatorics; Mathematics; Bijection; Conjecture; Vertex (graph theory); Bipartite graph; Graph; Digraph; Degree (music); Edge-graceful labeling; Complete bipartite graph; Orientation (vector space); Discrete mathematics; Line graph; Graph power; Geometry","score_opus":0.031605313835322016,"score_gpt":0.24652833615189235,"score_spread":0.21492302231657034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082929499","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.07673219,0.00009210739,0.9164914,0.0017258595,0.000058983132,0.00020431976,0.000019694711,0.00019346802,0.004481969],"genre_scores_gemma":[0.7090241,0.0000055930886,0.2906361,0.00028882088,0.000002095046,0.000005009144,0.000005215585,0.000010239295,0.000022845197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901456,0.000018424711,0.0002635521,0.00021347943,0.000299649,0.00019034468],"domain_scores_gemma":[0.9991882,0.000048756254,0.00015040171,0.00038714558,0.00011703331,0.00010850745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012930298,0.0001171563,0.00019845262,0.000061519204,0.000076338205,0.000050254403,0.00041073773,0.000026778245,0.000016195081],"category_scores_gemma":[0.000042589258,0.00008418844,0.000061823695,0.0006422407,0.00006278964,0.00017583168,0.000120428704,0.00007745135,0.00003179151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033220679,0.00009510878,0.00063792017,0.00014328565,0.00003140516,0.000008732491,0.0050990065,0.00007424586,0.0008957322,0.99223006,0.00048106644,0.0003000921],"study_design_scores_gemma":[0.0017144522,0.00052791,0.0004790852,0.0002150295,0.0000893991,0.000032350592,0.001384651,0.2037036,0.008489713,0.7823206,0.00049497996,0.0005481979],"about_ca_topic_score_codex":0.0000031207746,"about_ca_topic_score_gemma":0.0000016220071,"teacher_disagreement_score":0.6322919,"about_ca_system_score_codex":0.0000027206277,"about_ca_system_score_gemma":0.000030296938,"threshold_uncertainty_score":0.34331048},"labels":[],"label_agreement":null},{"id":"W3083401482","doi":"10.1007/s00373-020-02226-0","title":"On 0-Rotatable Graceful Caterpillars","year":2020,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Combinatorics; Mathematics; Conjecture; Tree (set theory); Vertex (graph theory); Graph","score_opus":0.013567465246669089,"score_gpt":0.19355580303783934,"score_spread":0.17998833779117024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083401482","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9762393,0.001959814,0.0063519287,0.009123789,0.0010938608,0.00027410543,0.000004856299,0.00077811896,0.004174191],"genre_scores_gemma":[0.9962431,0.00013386225,0.0007445032,0.0027980052,0.0000019162323,0.0000067710084,0.0000016170613,0.000008441727,0.00006176835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898446,0.00002856828,0.00014909847,0.0003732691,0.00022773116,0.00023687616],"domain_scores_gemma":[0.9993212,0.000046215875,0.000049810642,0.00028906163,0.00005860326,0.00023508248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011508117,0.00013632119,0.00014798802,0.000075191056,0.0001778432,0.00014258035,0.00034376318,0.0000505588,0.0000036224992],"category_scores_gemma":[0.000028856926,0.00011799483,0.000047809037,0.0006903779,0.0000387259,0.00014945201,0.00015038776,0.00014186988,0.000035615907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037405305,0.0000388006,0.00074610545,0.000011582679,0.000007285582,0.000013353138,0.00020635332,0.000017487862,0.00019288066,0.9924844,0.004815704,0.0014623073],"study_design_scores_gemma":[0.00051385764,0.00038143076,0.00036766086,0.000012130964,0.000005517127,0.000006265678,0.000017746615,0.0043179267,0.001009864,0.98907644,0.004086229,0.00020491422],"about_ca_topic_score_codex":0.000014155658,"about_ca_topic_score_gemma":2.8970229e-7,"teacher_disagreement_score":0.020003779,"about_ca_system_score_codex":0.000005265566,"about_ca_system_score_gemma":0.000018515122,"threshold_uncertainty_score":0.48116896},"labels":[],"label_agreement":null},{"id":"W3085158163","doi":"","title":"On path-supermagic labelings of cycles","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"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; Arithmetic; Computer science; Computer network","score_opus":0.012339162529433362,"score_gpt":0.23691134436114056,"score_spread":0.22457218183170718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3085158163","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9615204,0.00032782473,0.026168646,0.000604402,0.010677311,0.0001516391,0.0000017396056,0.000058668218,0.00048940314],"genre_scores_gemma":[0.98578507,0.000055175613,0.013944516,0.000045581157,0.00014336141,6.539714e-7,1.2208037e-7,0.000019698733,0.000005817543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99725616,0.00011327612,0.001238832,0.000252735,0.0008217014,0.0003173051],"domain_scores_gemma":[0.9961354,0.0013170313,0.0011978179,0.0004103677,0.00073701475,0.00020234736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017520518,0.00025947884,0.00070319814,0.0002810289,0.00015935244,0.00012080049,0.00079915114,0.00013355934,0.0000041984663],"category_scores_gemma":[0.0007077102,0.0001694021,0.00019971807,0.00035207026,0.00012390832,0.00030836576,0.00030386433,0.0002567676,0.000004816116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033878132,0.0004177367,0.00008812152,0.000069705035,0.00005104508,0.000014745313,0.0004960441,0.000011061881,0.00779401,0.98664623,0.00023332305,0.0041440986],"study_design_scores_gemma":[0.003924308,0.0011490562,0.000046922767,0.000947046,0.000031718984,0.00006691761,0.000038485152,0.0020083804,0.0070737624,0.9843601,0.00012653013,0.00022677206],"about_ca_topic_score_codex":0.000003863399,"about_ca_topic_score_gemma":4.112918e-8,"teacher_disagreement_score":0.024264708,"about_ca_system_score_codex":0.000038238897,"about_ca_system_score_gemma":0.000116686155,"threshold_uncertainty_score":0.69080174},"labels":[],"label_agreement":null},{"id":"W3088577461","doi":"10.7151/dmgt.2359","title":"The Threshold Dimension and Irreducible Graphs","year":2023,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto; University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Metric dimension; Vertex (graph theory); Dimension (graph theory); Graph; Discrete mathematics; Chordal graph; 1-planar graph","score_opus":0.22269809208894617,"score_gpt":0.5088636380636222,"score_spread":0.286165545974676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088577461","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9617176,0.030124092,0.00033410572,0.0024824452,0.0017587555,0.0004405435,0.0000061543924,0.00026088342,0.0028754298],"genre_scores_gemma":[0.9786886,0.019728936,0.0005399139,0.00040173045,0.000019138008,0.000028267552,0.000002734241,0.000028122418,0.00056256313],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973384,0.00016913483,0.0006352377,0.0005923165,0.0007603874,0.00050453714],"domain_scores_gemma":[0.9975565,0.00050357677,0.00043092936,0.00097026594,0.00026147065,0.0002772503],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002669124,0.00025444932,0.0004088407,0.0007640027,0.000944461,0.0028558366,0.003702696,0.00008281277,0.00013352392],"category_scores_gemma":[0.00017095137,0.00017421473,0.00013712792,0.0027542564,0.00021904339,0.0020259276,0.0026580163,0.00033426698,0.000038714283],"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.00009741591,0.00024094537,0.17354618,0.00008621198,0.00027637783,0.000113317445,0.00076337124,0.0010519708,0.18040536,0.10069765,0.48025984,0.062461358],"study_design_scores_gemma":[0.00068266474,0.00002686025,0.21987267,0.00039093825,0.000040979856,0.000042044616,0.00008214213,0.006833318,0.020799471,0.7374338,0.01320941,0.00058568874],"about_ca_topic_score_codex":0.000225139,"about_ca_topic_score_gemma":0.000015489954,"teacher_disagreement_score":0.63673615,"about_ca_system_score_codex":0.000017131182,"about_ca_system_score_gemma":0.00008655158,"threshold_uncertainty_score":0.9981793},"labels":[],"label_agreement":null},{"id":"W3114818018","doi":"10.48550/arxiv.2012.10341","title":"Graceful Labellings of Various Cyclic Snakes","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science","score_opus":0.07402644810900674,"score_gpt":0.17770819182915537,"score_spread":0.10368174372014863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114818018","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5096071,0.00039237825,0.48474503,0.0008602643,0.00095195405,0.00033329867,0.000021218277,0.0006271348,0.002461653],"genre_scores_gemma":[0.99322206,0.00029212487,0.0057021556,0.00022336707,0.000012417728,5.144673e-7,0.000010642214,0.000018987064,0.000517745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979134,0.00011628507,0.0003174461,0.0011784942,0.00014365121,0.0003306912],"domain_scores_gemma":[0.9977518,0.000109173016,0.00042095236,0.0012597861,0.00022885727,0.00022947682],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023361898,0.00032404804,0.00047933607,0.0002792527,0.00011505961,0.00007674791,0.002007351,0.00029347144,0.000016482001],"category_scores_gemma":[0.00004061647,0.0003614275,0.00028006794,0.00091439876,0.00015763291,0.00019465717,0.0018856566,0.0006114194,0.00010003184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028543851,0.00018924646,0.0018867298,0.0002421316,0.0001854533,0.00035441873,0.0008141384,0.11262896,0.0011754078,0.8807447,0.0011421823,0.00060809054],"study_design_scores_gemma":[0.0005810543,0.0001248227,0.00027655825,0.0001691281,0.00010975538,0.0000054486095,0.000035233355,0.26893023,0.0024963333,0.7258707,0.00081920414,0.0005815338],"about_ca_topic_score_codex":0.00029595805,"about_ca_topic_score_gemma":0.000014636866,"teacher_disagreement_score":0.48361495,"about_ca_system_score_codex":0.00004430638,"about_ca_system_score_gemma":0.0001791377,"threshold_uncertainty_score":0.9998838},"labels":[],"label_agreement":null},{"id":"W3117130048","doi":"10.1016/j.dam.2021.07.018","title":"A note on connected greedy edge colouring","year":2021,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Fonds De La Recherche Scientifique - FNRS; Fonds National de la Recherche Luxembourg; Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Edge coloring; Bipartite graph; Chromatic scale; Graph; Greedy algorithm; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Algorithm; Line graph; Graph power; Artificial intelligence","score_opus":0.02276349048740975,"score_gpt":0.25534694529312396,"score_spread":0.2325834548057142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117130048","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.14810917,0.000319874,0.80337167,0.0010978447,0.0017684086,0.0016822862,0.0000346311,0.0017103149,0.041905787],"genre_scores_gemma":[0.5827524,0.00003597126,0.41614118,0.0005426798,0.000034119123,0.00019425854,0.00007299815,0.00006830584,0.00015808518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99708104,0.00003813647,0.0006861698,0.0010269036,0.0006557058,0.0005120479],"domain_scores_gemma":[0.99667805,0.0003022194,0.0004722004,0.0021854118,0.000164307,0.00019779835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045856446,0.0005371682,0.00074480346,0.00021443577,0.00019191082,0.0006015793,0.0014415662,0.0004038179,0.00002432501],"category_scores_gemma":[0.00010289619,0.00049050606,0.00023734431,0.00038794626,0.000082673156,0.00006757324,0.0023069142,0.000884022,0.00013803678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007882989,0.0002986931,0.0000017821018,0.0009047156,0.00012359906,0.000061730156,0.0051196283,0.003539773,0.0075984583,0.97990555,0.0007923594,0.001645803],"study_design_scores_gemma":[0.001114495,0.00010136679,0.000037121725,0.0016977227,0.00014166816,0.000028961449,0.00044207796,0.23257369,0.021633686,0.740295,0.00029905545,0.0016351702],"about_ca_topic_score_codex":0.000012023148,"about_ca_topic_score_gemma":0.0000063891653,"teacher_disagreement_score":0.4346432,"about_ca_system_score_codex":0.00006726915,"about_ca_system_score_gemma":0.00019714091,"threshold_uncertainty_score":0.99975467},"labels":[],"label_agreement":null},{"id":"W3118675093","doi":"10.3390/math9020166","title":"Removing Symmetry in Circulant Graphs and Point-Block Incidence Graphs","year":2021,"lang":"en","type":"article","venue":"Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Science Foundation","keywords":"Combinatorics; Circulant matrix; Mathematics; Automorphism; Circulant graph; Discrete mathematics; Vertex (graph theory); Graph automorphism; Vertex-transitive graph; Symmetric graph; Graph; Line graph; Graph power; Voltage graph","score_opus":0.014457205412243476,"score_gpt":0.22892485129591406,"score_spread":0.21446764588367057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118675093","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9846149,0.0014482897,0.01138863,0.00065329997,0.00019748582,0.00011572495,0.0000010366941,0.00017699224,0.001403608],"genre_scores_gemma":[0.83194715,0.000107853935,0.1674653,0.00037209416,0.0000016397463,0.0000052718174,8.563275e-7,0.000010707801,0.00008914519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986725,0.000053145774,0.00036155747,0.00036469786,0.0002796706,0.00026843898],"domain_scores_gemma":[0.99891526,0.00019776792,0.00009829139,0.0006014667,0.00009103605,0.00009621213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057736284,0.00014049506,0.00023392585,0.00021937625,0.000087735134,0.0001552469,0.00031659516,0.00006823631,0.00000409341],"category_scores_gemma":[0.0002448372,0.00013027409,0.000055831006,0.0009446931,0.000050520823,0.00020237509,0.00032154968,0.00016518307,0.000018263907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.3645837e-7,0.00014868744,0.004158188,0.00021223044,0.000014495453,0.00025435275,0.002272544,0.00003257716,0.006975261,0.9837056,0.00029923458,0.0019262366],"study_design_scores_gemma":[0.00026919966,0.000019246778,0.001267846,0.0003331974,0.000008043681,0.00043053148,0.00022013595,0.029136634,0.0027978825,0.965266,0.00003572175,0.00021558137],"about_ca_topic_score_codex":0.00001983627,"about_ca_topic_score_gemma":0.000022943525,"teacher_disagreement_score":0.15607667,"about_ca_system_score_codex":0.000013927853,"about_ca_system_score_gemma":0.000050138584,"threshold_uncertainty_score":0.5312423},"labels":[],"label_agreement":null},{"id":"W3119206545","doi":"10.5539/jmr.v13n1p16","title":"Total Edge Irregularity Strength of q Tuple Book Graphs","year":2021,"lang":"en","type":"article","venue":"Journal of Mathematics Research","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); Enhanced Data Rates for GSM Evolution; Graph; Tuple; Simple graph; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.0713936951571235,"score_gpt":0.3489291344115771,"score_spread":0.27753543925445356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119206545","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.956304,0.0066326144,0.029838629,0.0027197753,0.0005671084,0.00017195228,0.0000051261727,0.000031663865,0.0037291008],"genre_scores_gemma":[0.7725857,0.00036069448,0.2252485,0.00005073603,0.000026776024,0.0000021566473,7.320131e-7,0.000016335714,0.0017083887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971916,0.00022726602,0.0006629607,0.00015191479,0.0014641135,0.0003021077],"domain_scores_gemma":[0.99655485,0.0005411984,0.00028316656,0.00056208,0.0018814395,0.0001772747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003531032,0.00008889923,0.00031612572,0.000386955,0.00010952923,0.00011975146,0.0007214209,0.00006962439,0.00006696336],"category_scores_gemma":[0.0006975549,0.00007001752,0.00018656942,0.0008136179,0.00013078107,0.00028408377,0.0003802971,0.0005324347,0.000013799362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014778952,0.00246018,0.00029747013,0.0006051916,0.00019633879,0.00037621314,0.0032442713,0.00016934161,0.06536552,0.8924518,0.02903651,0.0057823393],"study_design_scores_gemma":[0.001071765,0.0005066125,0.00040337295,0.00059277954,0.000021259248,0.0009688956,0.0007631428,0.020395923,0.14975414,0.823836,0.0014876322,0.00019846526],"about_ca_topic_score_codex":0.000005845015,"about_ca_topic_score_gemma":0.0000019006803,"teacher_disagreement_score":0.19540986,"about_ca_system_score_codex":0.000025959886,"about_ca_system_score_gemma":0.00043156403,"threshold_uncertainty_score":0.28552318},"labels":[],"label_agreement":null},{"id":"W3119622264","doi":"10.55016/ojs/cdm.v15i1.62679","title":"Total colouring of some cartesian and direct product graphs","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cartesian product; Combinatorics; Mathematics; Bipartite graph; Chromatic scale; Graph; Direct product; Windmill graph; Discrete mathematics; Graph power; Line graph","score_opus":0.01224504562014082,"score_gpt":0.24493825443889572,"score_spread":0.2326932088187549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119622264","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7015033,0.0022590675,0.25988623,0.03179319,0.00034775777,0.001620506,0.00029878045,0.00072221394,0.0015689777],"genre_scores_gemma":[0.9679458,0.000009853262,0.03178486,0.000187042,0.000010419916,0.000019205663,0.0000034141237,0.000007682154,0.000031708278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989363,0.000032842167,0.00031827547,0.000290444,0.00019051795,0.0002316444],"domain_scores_gemma":[0.9990436,0.00009034663,0.000101330035,0.00036411016,0.00017113816,0.00022949789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024168739,0.00012788156,0.00028112213,0.00008197605,0.00013712919,0.000075724995,0.00026565674,0.00003223851,0.000002726415],"category_scores_gemma":[0.000511629,0.00011076878,0.00006630031,0.0004872398,0.00006774523,0.00017986738,0.00024234595,0.000080770944,0.000013567327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039925426,0.00006251668,0.00014280195,0.00012380553,0.00004365755,0.00000466524,0.0025947893,0.00022225281,0.016670246,0.9787825,0.0008155613,0.0005332081],"study_design_scores_gemma":[0.0025490972,0.0011824301,0.0020987373,0.00064463465,0.00024915248,0.00009333685,0.0005440617,0.21192247,0.15401419,0.6237539,0.0014520603,0.0014959411],"about_ca_topic_score_codex":0.0000061360724,"about_ca_topic_score_gemma":7.420834e-7,"teacher_disagreement_score":0.35502863,"about_ca_system_score_codex":0.000011806377,"about_ca_system_score_gemma":0.000041498653,"threshold_uncertainty_score":0.45170197},"labels":[],"label_agreement":null},{"id":"W3119677583","doi":"10.5539/jmr.v13n1p28","title":"Graceful Labeling of Hypertrees","year":2021,"lang":"en","type":"article","venue":"Journal of Mathematics Research","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":"Hyperbolic tree; Edge-graceful labeling; Graph labeling; Mathematics; Combinatorics; Numbering; Vertex (graph theory); Graph; Discrete mathematics; Hyperbolic geometry; Pure mathematics; Graph power; Algorithm; Line graph","score_opus":0.12331776473225389,"score_gpt":0.378568248921108,"score_spread":0.2552504841888541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119677583","genre_codex":"empirical","genre_gemma":"methods","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.91877466,0.006144469,0.06660058,0.0046138186,0.0004903644,0.00010875694,0.0000017980735,0.000027971751,0.0032375522],"genre_scores_gemma":[0.47602695,0.00033657288,0.52315456,0.000034353827,0.00001855706,7.973601e-7,1.7715568e-7,0.00000950393,0.0004185041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99768436,0.00016773044,0.0005810354,0.000107842854,0.0012309293,0.00022812627],"domain_scores_gemma":[0.99624425,0.00071229856,0.00024461563,0.00041517976,0.0022719058,0.000111775604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039462117,0.00006304305,0.00025409678,0.0003287529,0.000082760394,0.00009620515,0.00068760547,0.000047181817,0.000024484396],"category_scores_gemma":[0.0012010868,0.00004700184,0.00011062204,0.00077049737,0.00007399423,0.00018822098,0.0002820978,0.00037613566,0.000015045412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010921047,0.0016376923,0.00052276877,0.0006209162,0.0001791777,0.0005274358,0.004945256,0.00066231226,0.39473176,0.57526857,0.007893867,0.012999359],"study_design_scores_gemma":[0.0007934441,0.00036510112,0.000071814975,0.0008550738,0.00001601295,0.0008518359,0.0013594987,0.020552289,0.23900197,0.73457056,0.0014132306,0.0001491736],"about_ca_topic_score_codex":0.000004335673,"about_ca_topic_score_gemma":0.0000021963365,"teacher_disagreement_score":0.456554,"about_ca_system_score_codex":0.000017842563,"about_ca_system_score_gemma":0.0003020854,"threshold_uncertainty_score":0.19166794},"labels":[],"label_agreement":null},{"id":"W3126258396","doi":"","title":"Group magicness of complete n-partite graphs","year":2006,"lang":"en","type":"article","venue":"","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Group (periodic table); Discrete mathematics","score_opus":0.012032417188478585,"score_gpt":0.2012445531539214,"score_spread":0.1892121359654428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126258396","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5051764,0.00042252135,0.46493694,0.0008813981,0.00057547376,0.00018038055,0.0000044206954,0.00054331904,0.027279098],"genre_scores_gemma":[0.9504025,0.0000026006164,0.049029943,0.00019550818,0.0000029151267,0.0000029698967,0.0000028658267,0.000003869513,0.00035681637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991325,0.000028031207,0.00023947425,0.0002202304,0.00019887667,0.00018087127],"domain_scores_gemma":[0.9993784,0.000034598248,0.00006884746,0.00040045648,0.000076627,0.000041086016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017947827,0.000082363054,0.0001270771,0.000110957764,0.000053899257,0.000039070415,0.00038392242,0.000027510025,0.00002489147],"category_scores_gemma":[0.000003284684,0.00006610878,0.00006557677,0.0004430817,0.00008524195,0.0001609534,0.000103675375,0.000043852564,0.000047867106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010585005,0.000054117543,0.002366492,0.0000067618203,0.0000030204696,0.000002159588,0.000014362863,0.000068955116,0.015443953,0.97947246,0.0019746395,0.0005920062],"study_design_scores_gemma":[0.00043719448,0.00006978505,0.008921961,0.000017347767,0.00000460985,0.00000961461,0.000005167995,0.013941307,0.0087384265,0.96541053,0.0022636491,0.00018040017],"about_ca_topic_score_codex":0.00034083726,"about_ca_topic_score_gemma":0.00002581615,"teacher_disagreement_score":0.44522607,"about_ca_system_score_codex":0.0000028502898,"about_ca_system_score_gemma":0.000007967719,"threshold_uncertainty_score":0.2695838},"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":"W3135578464","doi":"","title":"A note on the Boolean dimension of a graph and other related parameters","year":2020,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Dimension (graph theory); Boolean function; Discrete mathematics; Graph; Binary number; Boolean expression; Combinatorics; Arithmetic","score_opus":0.020081159476420894,"score_gpt":0.22262571793257455,"score_spread":0.20254455845615366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135578464","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6196076,0.0020332295,0.2306776,0.12374345,0.0006138616,0.0013928288,0.00005434207,0.0007891518,0.021087876],"genre_scores_gemma":[0.941197,0.00016598069,0.057341427,0.0008448077,0.0000014434022,0.000025665264,0.000017491135,0.000027471102,0.00037874395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948211,0.0032209577,0.00050230854,0.000790785,0.00042790038,0.00023696237],"domain_scores_gemma":[0.9947363,0.0016944519,0.0005472815,0.0022576835,0.0006154114,0.00014885279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036609375,0.00027738587,0.00033173343,0.00017828961,0.0002451558,0.00024305766,0.0013929248,0.00020635946,0.00001138301],"category_scores_gemma":[0.00093186967,0.00021472725,0.00018459317,0.0005292571,0.0003261365,0.00006958412,0.0016469993,0.00065673975,0.000017950057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012585639,0.00023844189,0.0003264131,0.0000860669,0.000087107874,0.000003971246,0.01362517,0.00025812135,0.0064000585,0.9650512,0.00094696943,0.012963897],"study_design_scores_gemma":[0.0011655918,0.000005781887,0.0014047412,0.0051941695,0.00009862235,0.000019246869,0.00011968148,0.2323209,0.12123744,0.6341991,0.0032957697,0.00093893823],"about_ca_topic_score_codex":0.0005567845,"about_ca_topic_score_gemma":0.000072099254,"teacher_disagreement_score":0.3308521,"about_ca_system_score_codex":0.00002039343,"about_ca_system_score_gemma":0.00010260533,"threshold_uncertainty_score":0.8756323},"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":"W3142143633","doi":"","title":"Edge colored complete graphs and a generalization of self-complementarity","year":2016,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Complementarity (molecular biology); Colored; Generalization; Combinatorics; Discrete mathematics; Sociology","score_opus":0.02533350222738299,"score_gpt":0.24251408926330978,"score_spread":0.2171805870359268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3142143633","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8013887,0.0003332403,0.19347008,0.0017962367,0.00017151766,0.00054636074,0.000041638814,0.00045160417,0.0018006358],"genre_scores_gemma":[0.84943485,0.00001882509,0.15038994,0.00009841173,0.0000013492566,0.000012893026,0.000002032975,0.0000059449058,0.00003574323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989263,0.00006571,0.00034773318,0.0002620703,0.00021017306,0.00018802733],"domain_scores_gemma":[0.99905974,0.0001807826,0.00012261172,0.0004527034,0.00010425726,0.00007989565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003976081,0.00011294327,0.00020897899,0.000103470746,0.00008480592,0.000026859369,0.0002850594,0.00003358704,0.00005454031],"category_scores_gemma":[0.000051043437,0.000074396055,0.000048424983,0.00021875676,0.00010690723,0.0001574986,0.00018173133,0.000027282515,0.000017131344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027605392,0.000108987224,0.0007025848,0.000084400664,0.000028427625,6.910214e-7,0.0007718011,3.332627e-7,0.010137288,0.9858919,0.0012023787,0.0010684488],"study_design_scores_gemma":[0.0007035321,0.00012423075,0.0017155516,0.00010075549,0.000021824551,0.000010983842,0.000028453112,0.010616116,0.0035075492,0.98220795,0.0008127678,0.00015026664],"about_ca_topic_score_codex":0.000017121376,"about_ca_topic_score_gemma":0.0000051014663,"teacher_disagreement_score":0.048046168,"about_ca_system_score_codex":0.000011272994,"about_ca_system_score_gemma":0.000020361,"threshold_uncertainty_score":0.3033783},"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":"W3154860730","doi":"10.37236/10018","title":"A Vertex-Weighted Tutte Symmetric Function, and Constructing Graphs with Equal Chromatic Symmetric Function","year":2021,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Chromatic polynomial; Combinatorics; Mathematics; Tutte polynomial; Chromatic scale; Symmetric function; Vertex (graph theory); Spanning tree; Discrete mathematics; Graph; Line graph","score_opus":0.006401905112446869,"score_gpt":0.19128108511107558,"score_spread":0.1848791799986287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3154860730","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.759703,0.022079295,0.21545132,0.0007745841,0.0013252241,0.00013261402,2.9481703e-7,0.00007813755,0.0004555756],"genre_scores_gemma":[0.99877346,0.0005606068,0.00038415732,0.00019881756,0.000013719457,0.0000022919185,7.4009347e-7,0.000015575031,0.000050665443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976791,0.00026587266,0.0005365481,0.00025953425,0.0007005114,0.00055839063],"domain_scores_gemma":[0.99761117,0.0004950326,0.00057763915,0.00039427276,0.0007874176,0.0001344601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013881498,0.0002089387,0.00035122104,0.00062638405,0.00035702367,0.00021556171,0.00042960473,0.000076761746,0.0000046673094],"category_scores_gemma":[0.00018166358,0.00013771483,0.00010377745,0.00519624,0.000095137,0.00044256542,0.00011035699,0.00075690274,0.0000040436216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002997445,0.00012275104,0.0014262198,0.000022366645,0.00018563383,0.000020118796,0.00007913747,0.00002420636,0.00033115738,0.9935243,0.00009027779,0.004143834],"study_design_scores_gemma":[0.0019318227,0.0016300416,0.0012794608,0.00008142746,0.0002174526,0.0023450335,0.00014359003,0.0031162614,0.0006092973,0.9882565,0.00019495963,0.00019415481],"about_ca_topic_score_codex":0.0000057607153,"about_ca_topic_score_gemma":0.0000018266899,"teacher_disagreement_score":0.23907048,"about_ca_system_score_codex":0.00013340882,"about_ca_system_score_gemma":0.00069563114,"threshold_uncertainty_score":0.5615848},"labels":[],"label_agreement":null},{"id":"W3156518500","doi":"10.55016/ojs/cdm.v16i1.67834","title":"Note on group distance magicness on product graphs","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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; Abelian group; Vertex (graph theory); MAGIC (telescope); Lexicographical order; Discrete mathematics; Graph; Physics","score_opus":0.012756938084583776,"score_gpt":0.2739200354274208,"score_spread":0.26116309734283705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3156518500","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.011071259,0.0002415016,0.97198606,0.011429075,0.0007035488,0.000506124,0.0001753167,0.0004034576,0.0034836584],"genre_scores_gemma":[0.93278396,0.000018615354,0.06475095,0.0013548266,0.000026221995,0.00009244533,0.000048832877,0.000023200442,0.00090092607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797654,0.00008385546,0.00039669304,0.0006271554,0.0004660204,0.00044975817],"domain_scores_gemma":[0.9975019,0.00024310629,0.0001144585,0.0014794043,0.00043679334,0.00022430881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004267327,0.0002434506,0.00030712283,0.00014283459,0.00036459806,0.0002641458,0.00058477104,0.00006010366,0.000016105489],"category_scores_gemma":[0.00083514996,0.0002045206,0.00014297514,0.0011192082,0.00008122889,0.00015070986,0.00021055306,0.00021540035,0.00038453334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005337785,0.0002652416,0.0000115044,0.000030291261,0.000015482121,0.000027509015,0.00028417047,0.00027609133,0.0016592166,0.9940256,0.0022358554,0.0011637398],"study_design_scores_gemma":[0.0008808297,0.0002491794,0.00024738573,0.0005743322,0.00004038547,0.000039953702,0.00005915371,0.016407324,0.025914943,0.9393755,0.01552109,0.0006899196],"about_ca_topic_score_codex":0.0000022403742,"about_ca_topic_score_gemma":0.0000064316864,"teacher_disagreement_score":0.9217127,"about_ca_system_score_codex":0.00007641469,"about_ca_system_score_gemma":0.00007608363,"threshold_uncertainty_score":0.83401084},"labels":[],"label_agreement":null},{"id":"W3157723870","doi":"10.1016/j.dam.2022.08.011","title":"Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph","year":2022,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Combinatorics; Chordal graph; Fractional coloring; Greedy coloring; Graph coloring; Complete coloring; Discrete mathematics; Conjecture; List coloring; Edge coloring; Graph; Graph power; Line graph","score_opus":0.021172280236653487,"score_gpt":0.24166617480234112,"score_spread":0.22049389456568763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157723870","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9710233,0.00013654643,0.02445349,0.00061116973,0.00008451399,0.0012423473,0.000011779063,0.000022687494,0.0024141395],"genre_scores_gemma":[0.9884887,0.000015093655,0.010895697,0.00013103834,0.0000014412049,0.00041392236,8.607587e-7,0.000008112738,0.00004512982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901813,0.000018848841,0.0003218507,0.00016088028,0.00031887577,0.00016140546],"domain_scores_gemma":[0.9990644,0.00028312812,0.00018429532,0.000415302,0.000035099165,0.000017760414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008958861,0.000101756734,0.00019584163,0.00004775705,0.00019197377,0.000037971266,0.0006035569,0.00002106106,0.000005746054],"category_scores_gemma":[0.00001752368,0.00005602111,0.00006290573,0.00032425192,0.00015733474,0.000042943982,0.0003180457,0.000105783576,5.838007e-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.00003902073,0.00021219172,0.00007410273,0.00031495318,0.00003648929,9.675151e-7,0.017987538,0.0010739445,0.0056004077,0.9742235,0.00024834165,0.00018856408],"study_design_scores_gemma":[0.0020342187,0.00049660093,0.00027245807,0.0001277243,0.00009697683,0.000033166292,0.011833354,0.0789812,0.009364127,0.8949592,0.0013872233,0.0004137654],"about_ca_topic_score_codex":0.000016119533,"about_ca_topic_score_gemma":0.0000025239597,"teacher_disagreement_score":0.07926429,"about_ca_system_score_codex":0.000008417898,"about_ca_system_score_gemma":0.000028334363,"threshold_uncertainty_score":0.22844745},"labels":[],"label_agreement":null},{"id":"W3159107677","doi":"10.1007/s00373-023-02637-9","title":"Upper Bounds on the Average Number of Colors in the Non-equivalent Colorings of a Graph","year":2023,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Fonds De La Recherche Scientifique - FNRS","keywords":"Combinatorics; Mathematics; Partition (number theory); Fractional coloring; Vertex (graph theory); Greedy coloring; Complete coloring; Graph; Edge coloring; List coloring; Discrete mathematics; Upper and lower bounds; Graph power; Line graph","score_opus":0.01736158579766832,"score_gpt":0.24347185915124925,"score_spread":0.22611027335358092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159107677","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9959523,0.00007375872,0.000042495056,0.0010729791,0.00024185455,0.00018255762,0.0000022592008,0.000035093424,0.0023966657],"genre_scores_gemma":[0.9993611,0.00023080899,0.000042455566,0.00025447193,7.289245e-7,0.000028659699,8.54055e-7,0.0000055265155,0.00007541672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881417,0.000084295156,0.000265986,0.00021865097,0.00039041313,0.00022651024],"domain_scores_gemma":[0.9989654,0.00034220418,0.000117530704,0.0004601384,0.00007769341,0.00003704408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009638162,0.00011844467,0.00018134354,0.00019116852,0.00014293421,0.000047086407,0.0006034536,0.000056365803,0.0000030426431],"category_scores_gemma":[0.000029847344,0.00006911547,0.000095695264,0.002286942,0.0001495778,0.000069907124,0.00015884118,0.00016979851,0.0000057432185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000656023,0.00011663373,0.019211603,0.000022962307,0.000012175425,0.0000055815117,0.0013230399,0.000032973534,0.00011073826,0.978023,0.0010134737,0.00012123569],"study_design_scores_gemma":[0.00051202596,0.00024693026,0.032554407,0.000057876663,0.000007578756,0.000005025139,0.00030067778,0.0011437929,0.0006394684,0.96393853,0.00048122354,0.00011245568],"about_ca_topic_score_codex":0.000081192265,"about_ca_topic_score_gemma":0.0000027739618,"teacher_disagreement_score":0.0140844835,"about_ca_system_score_codex":0.0000061418204,"about_ca_system_score_gemma":0.000025576468,"threshold_uncertainty_score":0.2818447},"labels":[],"label_agreement":null},{"id":"W3159853692","doi":"","title":"Towards the graceful tree conjecture","year":2000,"lang":"en","type":"dissertation","venue":"Library and Archives Canada (Government of Canada)","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":"Conjecture; Tree (set theory); Mathematics; Combinatorics","score_opus":0.003501007615163374,"score_gpt":0.1462290253795602,"score_spread":0.14272801776439684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159853692","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.078264035,0.0041512237,0.00013721392,0.016326139,0.0016966772,0.00046404364,0.0001674505,0.00006740221,0.8987258],"genre_scores_gemma":[0.93571293,0.00056869665,0.0018180662,0.0030843702,0.000033507113,0.000017606562,0.000059107504,0.000032457872,0.058673274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99718404,0.00007177134,0.00031004372,0.00037033693,0.0017692931,0.00029452535],"domain_scores_gemma":[0.99898684,0.00015256897,0.00020931027,0.00046418453,7.3964776e-7,0.00018633461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000013573783,0.00027252262,0.00028507636,0.00003040203,0.000274277,0.00007738551,0.00082406605,0.00006218924,0.000032388547],"category_scores_gemma":[0.00000218434,0.00019528774,0.000053414795,0.00014597541,0.000051640745,0.00024071486,0.0000929044,0.00028617313,4.778699e-9],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.0003157261,0.000033524713,0.0003442086,0.0002516484,0.0001639209,0.00011842997,0.00064349733,0.00013349208,0.002682309,0.81869864,0.009601902,0.16701268],"study_design_scores_gemma":[0.0018952526,0.00048374303,0.07151922,0.0012966614,0.00022194124,0.00007652673,0.0062920926,0.013862437,0.2415408,0.29842764,0.36171004,0.0026736483],"about_ca_topic_score_codex":0.003461712,"about_ca_topic_score_gemma":0.061414078,"teacher_disagreement_score":0.8574489,"about_ca_system_score_codex":0.0000034960433,"about_ca_system_score_gemma":0.0027525625,"threshold_uncertainty_score":0.9557127},"labels":[],"label_agreement":null},{"id":"W3196602131","doi":"","title":"Sun toughness and P ≥3 -factors in graphs.","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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":"Combinatorics; Mathematics; Toughness; Discrete mathematics; Composite material; Materials science","score_opus":0.010436303664367408,"score_gpt":0.25557560084099556,"score_spread":0.24513929717662816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196602131","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9207708,0.00014473115,0.07616392,0.0012933087,0.00020916121,0.00045099028,0.000029636922,0.00013342773,0.0008039958],"genre_scores_gemma":[0.986694,0.000008582967,0.012960369,0.000121772995,0.0000019868319,0.000017901468,0.0000061177807,0.000007451358,0.00018184588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891335,0.000032094158,0.00028858954,0.00028697023,0.0001781859,0.00030080174],"domain_scores_gemma":[0.9989887,0.00016892012,0.000060730083,0.0005287037,0.00011098821,0.00014196998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003461852,0.000140234,0.00024138593,0.00021420597,0.00008462017,0.00013327057,0.0003428036,0.00006305846,0.000013327046],"category_scores_gemma":[0.00018639988,0.0001145067,0.000048892038,0.00066113827,0.000036442674,0.000210273,0.00022678185,0.000107683416,0.00008709869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011386339,0.000049327115,0.0052782986,0.000027813652,0.00000794698,0.0000020376704,0.0009918517,0.00010551457,0.0009611105,0.9922553,0.00017573005,0.00014394232],"study_design_scores_gemma":[0.0013268221,0.00016489989,0.012067814,0.0003023963,0.000020369094,0.000018094346,0.0004337718,0.057505563,0.0042072935,0.9219741,0.0013374675,0.0006413915],"about_ca_topic_score_codex":0.000021736703,"about_ca_topic_score_gemma":0.000011795781,"teacher_disagreement_score":0.07028117,"about_ca_system_score_codex":0.000029680481,"about_ca_system_score_gemma":0.000032405398,"threshold_uncertainty_score":0.46694475},"labels":[],"label_agreement":null},{"id":"W3197135893","doi":"","title":"Further results on SD-prime labeling","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":6,"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; Prime (order theory); Arithmetic; Combinatorics","score_opus":0.01654925114387481,"score_gpt":0.24645547473800988,"score_spread":0.22990622359413507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197135893","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86833,0.00063518964,0.07413234,0.0058158743,0.047082353,0.00047974847,0.000005434126,0.0003119749,0.0032070791],"genre_scores_gemma":[0.9798634,0.0000434232,0.01955675,0.00008253672,0.00040173516,8.5944134e-7,2.0197378e-7,0.00002789993,0.000023169365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99679625,0.00015144385,0.001356841,0.00036323068,0.00089966523,0.00043257687],"domain_scores_gemma":[0.99584895,0.0013914243,0.0012565363,0.00055510394,0.00066890195,0.0002790723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027500256,0.00031742454,0.00064945273,0.00030322812,0.0002582748,0.00028653402,0.0009042877,0.00016796129,0.000002999347],"category_scores_gemma":[0.0010117091,0.00020639866,0.0001926922,0.00039413734,0.00009215316,0.00035744952,0.00035908443,0.000360786,0.000018165438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009693437,0.00038974313,0.000026441683,0.00002605053,0.00006632676,0.000030610496,0.00084198714,0.000017368418,0.0043895943,0.98366183,0.00044313245,0.010009985],"study_design_scores_gemma":[0.007935646,0.0014081273,0.000028073617,0.0009274991,0.00003378179,0.00009975061,0.000056954035,0.0025151854,0.006414163,0.97920823,0.0010106426,0.0003619724],"about_ca_topic_score_codex":0.0000037948046,"about_ca_topic_score_gemma":8.947072e-8,"teacher_disagreement_score":0.11153342,"about_ca_system_score_codex":0.00006804504,"about_ca_system_score_gemma":0.00013342856,"threshold_uncertainty_score":0.8416693},"labels":[],"label_agreement":null},{"id":"W3197765233","doi":"","title":"On SD-prime labeling of graphs","year":2018,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph Labeling and Dimension Problems","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; Prime (order theory); Combinatorics; Arithmetic","score_opus":0.018390166044543903,"score_gpt":0.25669841888597994,"score_spread":0.23830825284143603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197765233","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7911213,0.0006216058,0.12097603,0.0014619632,0.0010578904,0.0006295248,0.000010598544,0.0009568955,0.08316419],"genre_scores_gemma":[0.88441926,0.0000028989016,0.115185365,0.00020642356,0.00000469425,0.000005601878,5.134498e-7,0.000009075835,0.00016616799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871606,0.00004514639,0.00035694844,0.000301891,0.00033083503,0.0002490945],"domain_scores_gemma":[0.9984975,0.00021115356,0.00011656915,0.00092182745,0.00016708845,0.000085857835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005511567,0.00013286903,0.00021883337,0.00016590933,0.0001031176,0.00003277529,0.000592531,0.00005434518,0.000104892264],"category_scores_gemma":[0.00023898265,0.00010498164,0.00008866676,0.00043740988,0.000176499,0.000106688894,0.00015159645,0.000082616585,0.00045121688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041167737,0.00013593103,0.00001271156,0.000037754784,0.000017105864,0.0000012490142,0.0008576863,0.000001693076,0.003900897,0.99118274,0.0013361203,0.0025119947],"study_design_scores_gemma":[0.00021522086,0.00026925968,0.000030106183,0.00016220193,0.0000091346365,0.000005650928,0.000027870998,0.014309816,0.021398582,0.9632915,0.00015576289,0.00012487166],"about_ca_topic_score_codex":0.000006777535,"about_ca_topic_score_gemma":7.5340085e-7,"teacher_disagreement_score":0.09329796,"about_ca_system_score_codex":0.000007077313,"about_ca_system_score_gemma":0.000028335653,"threshold_uncertainty_score":0.579963},"labels":[],"label_agreement":null},{"id":"W3204189941","doi":"10.4310/joc.2023.v14.n4.a4","title":"Pursuit-evasion games on Latin square graphs","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; McMaster University; Toronto Metropolitan University","funders":"","keywords":"Latin square; Mathematics; Combinatorics; Circulant matrix; Upper and lower bounds; Dimension (graph theory); Square (algebra); Discrete mathematics; Graph; Geometry; Mathematical analysis","score_opus":0.02611686496365846,"score_gpt":0.25391061871910264,"score_spread":0.2277937537554442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204189941","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9841292,0.0005789664,0.002694151,0.005383388,0.0052139685,0.0001121503,9.580712e-7,0.00026713012,0.0016200929],"genre_scores_gemma":[0.99832475,0.00016143148,0.0008434341,0.00022566383,0.000013735108,0.0000012082108,6.140585e-7,0.0000111276395,0.0004180142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824953,0.00008102423,0.00041892094,0.00015999391,0.0008455534,0.0002449728],"domain_scores_gemma":[0.9985917,0.0002044863,0.0003472492,0.00034206908,0.0003572203,0.00015724948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097388215,0.00012548955,0.00022249548,0.00056242273,0.00012847963,0.00013686695,0.0007516466,0.000074954936,0.000004120971],"category_scores_gemma":[0.00017235466,0.00009775502,0.0001670321,0.0016212598,0.000024794706,0.0002598063,0.00012771518,0.00031270026,0.000074429954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000118951275,0.00017310452,0.0022425565,0.000019246409,0.000022054417,0.00013831102,0.00033016354,0.0006488224,0.0008894652,0.9560826,0.033005334,0.0064364946],"study_design_scores_gemma":[0.00096976577,0.0009374418,0.009203305,0.00015915779,0.000011265295,0.00004497932,0.00004487802,0.0025996687,0.0019706357,0.97599345,0.007893673,0.00017175595],"about_ca_topic_score_codex":0.0000014572979,"about_ca_topic_score_gemma":2.613705e-7,"teacher_disagreement_score":0.02511166,"about_ca_system_score_codex":0.000031670297,"about_ca_system_score_gemma":0.000072270734,"threshold_uncertainty_score":0.39863342},"labels":[],"label_agreement":null},{"id":"W3204812806","doi":"10.1145/3477542","title":"Adjacency Labelling for Planar Graphs (and Beyond)","year":2021,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Adjacency list; Planar graph; Vertex (graph theory); 1-planar graph; Discrete mathematics; Pathwidth; Bounded function; Chordal graph; Graph; Line graph","score_opus":0.02032145312571858,"score_gpt":0.2416427083824907,"score_spread":0.2213212552567721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204812806","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8731633,0.015172836,0.030899435,0.07596566,0.00403836,0.00016349347,0.000004684497,0.00004705456,0.00054521515],"genre_scores_gemma":[0.53613585,0.00058864534,0.45905724,0.0035948616,0.000043251937,0.0000017412649,3.2902312e-7,0.000012606765,0.0005654777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935424,0.000039070186,0.0002172661,0.00009720707,0.00017448088,0.00011771438],"domain_scores_gemma":[0.99880946,0.00015968939,0.00018296529,0.00058074883,0.00020788715,0.000059273927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044285101,0.00005614756,0.00011424429,0.000050214738,0.00013552193,0.00007327971,0.0010447602,0.000028587778,0.0000018671765],"category_scores_gemma":[0.00047979178,0.000034563436,0.00011306903,0.00020674772,0.000021627407,0.00014353225,0.000252805,0.00012480188,0.000001046018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041814394,0.00022184802,0.004984572,0.00008767762,0.00023447993,0.00009197432,0.0022705237,0.0006005298,0.10395192,0.78657216,0.07722705,0.023715446],"study_design_scores_gemma":[0.00045513993,0.00006762652,0.00037705537,0.00006148644,0.000021209351,0.00027403524,0.00003863789,0.0007378879,0.014752107,0.9798019,0.0033493869,0.00006351408],"about_ca_topic_score_codex":0.0000011273021,"about_ca_topic_score_gemma":0.0000013068735,"teacher_disagreement_score":0.4281578,"about_ca_system_score_codex":0.0000053893273,"about_ca_system_score_gemma":0.0000647468,"threshold_uncertainty_score":0.19414417},"labels":[],"label_agreement":null},{"id":"W3213336928","doi":"","title":"On Bock's Conjecture Regarding the Adam Optimizer.","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Conjecture; Argument (complex analysis); Lemma (botany); Convergence (economics); Key (lock); Mathematical economics; Adam smith; Mathematics; Philosophy; Epistemology; Computer science; Combinatorics; Economics; Neoclassical economics","score_opus":0.05290045696617976,"score_gpt":0.17247526233067662,"score_spread":0.11957480536449686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213336928","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.4842126,0.000693161,0.4970691,0.0023679333,0.0031820487,0.0005616872,0.000011215214,0.00078166963,0.011120592],"genre_scores_gemma":[0.9946253,0.0001577786,0.0025160033,0.00087369466,0.000020871212,0.000001084451,0.000010626369,0.000018253826,0.0017764041],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775237,0.00025504432,0.00019200776,0.0012628621,0.00015846407,0.00037928135],"domain_scores_gemma":[0.99707747,0.0002684762,0.00022478786,0.0020927826,0.00018681142,0.00014968328],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038058314,0.00034707092,0.00034345666,0.00017773011,0.00038549618,0.0003665184,0.0020473578,0.0003145366,0.00003910069],"category_scores_gemma":[0.000076615026,0.00028359078,0.00033827793,0.0006666494,0.00012417411,0.00018375077,0.0021858,0.0010395966,0.000051208484],"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.000012033636,0.000044006814,0.00005963742,0.000020517527,0.00008188927,0.00033192875,0.0001947966,0.57182163,0.000024015375,0.4249819,0.0022439787,0.00018368986],"study_design_scores_gemma":[0.0011491864,0.00011561819,0.00011812235,0.00048839406,0.00013618157,0.000031718377,0.00022438062,0.670433,0.00063358946,0.3245573,0.0012038973,0.00090861536],"about_ca_topic_score_codex":0.00010979046,"about_ca_topic_score_gemma":0.000018398208,"teacher_disagreement_score":0.5104127,"about_ca_system_score_codex":0.00009305269,"about_ca_system_score_gemma":0.00022164386,"threshold_uncertainty_score":0.9999616},"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":"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":"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":"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":"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":"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":"W4212769937","doi":"10.46298/dmtcs.639","title":"List circular backbone colouring","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Pacific Institute for the Mathematical Sciences","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics; Chromatic scale; Bounded function; Graph; Discrete mathematics","score_opus":0.010712726340983204,"score_gpt":0.2351696714341264,"score_spread":0.2244569450931432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212769937","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.03472332,0.000029075936,0.9547432,0.0011237842,0.000510944,0.00018139774,8.51236e-7,0.00038565125,0.00830176],"genre_scores_gemma":[0.6243374,0.0000018000798,0.37514672,0.00045923304,0.000024091663,0.0000065425556,6.14535e-7,0.0000116718065,0.000011947661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655545,0.00011564404,0.0005163363,0.000904867,0.0011067053,0.0008010161],"domain_scores_gemma":[0.9971581,0.00037539945,0.00015345417,0.0016020875,0.00026181887,0.00044912475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031198491,0.00029182693,0.0003690121,0.00024595673,0.00066160224,0.00096547883,0.0029509736,0.00007595677,0.000041972096],"category_scores_gemma":[0.0002856081,0.00023057399,0.0001376912,0.0012623701,0.00229887,0.0005312877,0.0014265525,0.00025084638,0.00018080225],"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":[9.4884297e-7,0.00007050846,0.00001750517,0.000035929443,0.0000056243243,0.0000053333656,0.00059153617,0.00013671294,0.002567143,0.99447215,0.000054179232,0.0020424323],"study_design_scores_gemma":[0.00014058073,0.00008051968,0.000028224611,0.000057593057,0.0000057647435,0.000029944884,0.0000075750304,0.51365215,0.0016185369,0.48408374,0.00009277238,0.00020259863],"about_ca_topic_score_codex":0.0000028546333,"about_ca_topic_score_gemma":2.749738e-7,"teacher_disagreement_score":0.5896141,"about_ca_system_score_codex":0.000032384345,"about_ca_system_score_gemma":0.000072357056,"threshold_uncertainty_score":0.94025344},"labels":[],"label_agreement":null},{"id":"W4226124909","doi":"10.4230/lipics.fun.2026.23","title":"Combinatorial Gray codes-an updated survey","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Gray code; Computer science; Gray (unit); Combinatorics; Vertex (graph theory); Class (philosophy); Theoretical computer science; Graph; Mathematics; Algorithm; Artificial intelligence","score_opus":0.029575244443663298,"score_gpt":0.2819583446586847,"score_spread":0.2523831002150214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226124909","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6739858,0.00038334235,0.20380846,0.0009790008,0.08216008,0.009199804,0.015780028,0.0047045765,0.008998951],"genre_scores_gemma":[0.93542075,0.00006548405,0.03050386,0.0016322148,0.0001642178,0.00059789716,0.031028053,0.00018483176,0.0004027007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99327284,0.00049545075,0.0023410548,0.0010505541,0.0015023814,0.0013377325],"domain_scores_gemma":[0.9933719,0.00025259162,0.0014202943,0.0034235264,0.00094423373,0.00058746105],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0040034247,0.0010347534,0.0012664321,0.0007373409,0.00097411865,0.001642181,0.005242837,0.00074150105,0.00015313602],"category_scores_gemma":[0.00017433135,0.0010062364,0.0005811047,0.00081493077,0.00020317509,0.0014861667,0.005543718,0.0022689742,0.00012582281],"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.0009909904,0.005382961,0.029853981,0.0027788621,0.002319708,0.000059005208,0.027386203,0.015190986,0.00010234741,0.7360554,0.17138067,0.008498905],"study_design_scores_gemma":[0.01598722,0.0023769685,0.0047687837,0.00050085376,0.00031647025,0.00013276435,0.00091445073,0.50966525,0.000729218,0.24619806,0.21217063,0.0062393337],"about_ca_topic_score_codex":0.00052924635,"about_ca_topic_score_gemma":0.00007455713,"teacher_disagreement_score":0.49447426,"about_ca_system_score_codex":0.00027840422,"about_ca_system_score_gemma":0.00054666144,"threshold_uncertainty_score":0.99939424},"labels":[],"label_agreement":null},{"id":"W4244068002","doi":"10.1090/crmp/043","title":"Additive Combinatorics","year":2007,"lang":"en","type":"book","venue":"CRM proceedings & lecture notes","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; Algebraic combinatorics; Mathematics","score_opus":0.011781308463054538,"score_gpt":0.22446517934790222,"score_spread":0.2126838708848477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244068002","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.000077091296,0.0032249975,0.043660887,0.0009367037,0.001716837,0.0004858215,0.00001765859,0.0012075312,0.9486725],"genre_scores_gemma":[0.88965666,0.0009992076,0.0144542055,0.014283258,0.0016306356,0.00018335995,0.00039765603,0.0007277566,0.077667266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967851,0.000007462409,0.0004925633,0.0011442887,0.0008440062,0.0007265754],"domain_scores_gemma":[0.99743944,0.0002950842,0.00048137305,0.0004088738,0.001095566,0.00027966732],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004910135,0.00068104186,0.0006207503,0.00057979755,0.00031502696,0.0004423033,0.0013978045,0.0009764642,0.000032267515],"category_scores_gemma":[0.0003762328,0.00061156246,0.00025655428,0.000657302,0.00016941663,0.0003219343,0.00041764608,0.0013271823,0.00020566606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058310807,0.00003851415,0.000013437418,0.00009260624,0.000053415613,0.000019613333,0.0005972697,0.0000033966376,0.00013226943,0.97141445,0.015880615,0.011748571],"study_design_scores_gemma":[0.0002510206,0.00017276326,0.000010132096,0.0003096833,0.000046632613,0.00004569005,0.0000035420042,0.0002574585,0.0035107522,0.8786361,0.116111785,0.0006444358],"about_ca_topic_score_codex":0.000006611721,"about_ca_topic_score_gemma":0.0000016381605,"teacher_disagreement_score":0.88957953,"about_ca_system_score_codex":0.00020095105,"about_ca_system_score_gemma":0.0003900452,"threshold_uncertainty_score":0.99963355},"labels":[],"label_agreement":null},{"id":"W4245876577","doi":"10.1002/jgt.20300","title":"An improved bound for the strong chromatic number","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Chromatic scale; Vertex (graph theory); Graph; Fractional coloring; Existential quantification; Friendship graph; Degree (music); List coloring; Discrete mathematics; Class (philosophy); Upper and lower bounds; Graph power; Line graph; Computer science; Physics","score_opus":0.018613625486388168,"score_gpt":0.26167220035098676,"score_spread":0.2430585748645986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245876577","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.511248,0.0011493508,0.4856942,0.00053466944,0.00094057334,0.00016995912,0.0000013389617,0.000042927997,0.00021900475],"genre_scores_gemma":[0.97887045,0.000067963796,0.02056672,0.00035651374,0.000044510303,0.0000044288163,1.9802738e-7,0.000009573816,0.0000796114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989374,0.0001350955,0.00036956955,0.00012269625,0.0002279396,0.00020724817],"domain_scores_gemma":[0.9984763,0.00044135324,0.00033488593,0.00041712038,0.00022369961,0.00010664386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017430594,0.00010432714,0.00017393683,0.000098599034,0.0003972822,0.00009276498,0.0008345331,0.000041155152,0.000013566018],"category_scores_gemma":[0.00007247682,0.000060334813,0.0002151603,0.000228317,0.00015837135,0.00046031416,0.000035629266,0.00016738713,0.000004666538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001482857,0.0003550746,0.0009607174,0.00003160638,0.00029159788,0.00003706106,0.003167669,0.0005465594,0.015217315,0.96117914,0.0047206013,0.013344384],"study_design_scores_gemma":[0.0010899894,0.0005140368,0.001544888,0.000041608,0.00005034674,0.0008302006,0.00018751212,0.0139569035,0.0015695737,0.97947276,0.00057648687,0.0001656961],"about_ca_topic_score_codex":0.000003818648,"about_ca_topic_score_gemma":0.0000011161114,"teacher_disagreement_score":0.4676225,"about_ca_system_score_codex":0.000010829342,"about_ca_system_score_gemma":0.00009229859,"threshold_uncertainty_score":0.30556136},"labels":[],"label_agreement":null},{"id":"W4252527004","doi":"10.1002/qsar.200590050","title":"Literature Highlights in Combinatorial Science: QSAR Comb. Sci. 9/2005","year":2005,"lang":"en","type":"article","venue":"QSAR & Combinatorial Science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Quantitative structure–activity relationship; Citation; Computer science; Information retrieval; World Wide Web; Machine learning","score_opus":0.008269674004765974,"score_gpt":0.24330059151383862,"score_spread":0.23503091750907265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252527004","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90733516,0.00169805,0.00080179423,0.013243092,0.056298424,0.0014704457,0.000012141693,0.0013173713,0.017823545],"genre_scores_gemma":[0.9931294,0.00007166861,0.0057276743,0.0005146546,0.0003459196,0.000027744161,0.00000302749,0.000022976785,0.00015694529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99114734,0.00019222396,0.0009008464,0.0021397816,0.0034667905,0.0021530222],"domain_scores_gemma":[0.9956438,0.00018842008,0.00031171538,0.0019299712,0.0009690417,0.00095705723],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.0067982213,0.00054597994,0.0005788325,0.0017173949,0.001835424,0.0023379715,0.0065388503,0.00026498642,0.000025768613],"category_scores_gemma":[0.00066355686,0.00048346116,0.00014967701,0.011986295,0.0028027345,0.0051491987,0.0015553427,0.0007806727,0.00027337842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020852844,0.00046574304,0.00029923787,0.00000972959,0.0000034691323,0.000031165502,0.0010844986,0.00012196406,0.022698604,0.9723227,0.0011677962,0.001774249],"study_design_scores_gemma":[0.008986195,0.00078159024,0.0040237536,0.00050762406,0.000019863199,0.00009176898,0.0000712331,0.031842463,0.083091944,0.78716606,0.08120914,0.002208361],"about_ca_topic_score_codex":0.00014238655,"about_ca_topic_score_gemma":0.000024693496,"teacher_disagreement_score":0.18515663,"about_ca_system_score_codex":0.00071635155,"about_ca_system_score_gemma":0.0020359734,"threshold_uncertainty_score":0.99991107},"labels":[],"label_agreement":null},{"id":"W4255335948","doi":"10.5539/jmr.v1n1p1","title":"Eccentric Coloring of a Graph","year":2015,"lang":"en","type":"article","venue":"Journal of Mathematics Research","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; Vertex (graph theory); Lexicographical order; Graph; Eccentric; Chromatic scale; Physics","score_opus":0.23319665940462267,"score_gpt":0.3957999091492464,"score_spread":0.16260324974462373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255335948","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87692493,0.0018084531,0.114560165,0.0013349098,0.0005309208,0.00019225919,6.542298e-7,0.000026436503,0.0046212464],"genre_scores_gemma":[0.84204465,0.00007637644,0.15772104,0.000010475926,0.00001386968,0.0000010887007,3.8170942e-8,0.0000062173967,0.00012626188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755603,0.00013537318,0.0005249398,0.00008241148,0.0014629104,0.00023832556],"domain_scores_gemma":[0.99704546,0.00038944968,0.00028906696,0.0003103335,0.0017463197,0.00021936337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069293883,0.000057073434,0.00021870587,0.00073378574,0.000048220565,0.000071309056,0.00087808154,0.000039450366,0.000004456099],"category_scores_gemma":[0.0009321053,0.00004105029,0.00008232616,0.0010612602,0.00007891481,0.0002138646,0.00022963056,0.00031625622,0.000016754844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004789913,0.0020174943,0.0014012817,0.00051974267,0.00017575607,0.00025445363,0.012965997,0.0022126078,0.013527835,0.93071884,0.029207347,0.006950744],"study_design_scores_gemma":[0.0011035835,0.0008294638,0.00006851848,0.00033301907,0.000009635267,0.00029113205,0.00100412,0.024014682,0.013559847,0.95793617,0.00074576336,0.0001040437],"about_ca_topic_score_codex":0.000006599204,"about_ca_topic_score_gemma":5.1857006e-7,"teacher_disagreement_score":0.043160886,"about_ca_system_score_codex":0.000034910183,"about_ca_system_score_gemma":0.0002768045,"threshold_uncertainty_score":0.24016015},"labels":[],"label_agreement":null},{"id":"W4281652320","doi":"10.4230/lipics.icalp.2023.57","title":"Optimal Adjacency Labels for Subgraphs of Cartesian Products","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo; Agence Nationale de la Recherche","keywords":"Adjacency list; Combinatorics; Cartesian product; Mathematics; Cartesian coordinate system; Graph; Class (philosophy); Discrete mathematics; Adjacency matrix; Computer science; Artificial intelligence","score_opus":0.06837309668492549,"score_gpt":0.18973252924230768,"score_spread":0.1213594325573822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281652320","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80824876,0.0007559874,0.18505037,0.0005032167,0.0019745433,0.0014094749,0.00013404076,0.00048794597,0.0014356606],"genre_scores_gemma":[0.97927845,0.00010832427,0.01911749,0.000054057142,0.000012979457,0.0000067038363,0.000037474085,0.000022631286,0.0013618813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976682,0.00013083895,0.00030373933,0.0013347409,0.00014939957,0.00041305722],"domain_scores_gemma":[0.99732834,0.000104850966,0.0003971244,0.0016183612,0.0004111671,0.00014014046],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004990764,0.00030571653,0.0004442546,0.0004472141,0.00022643259,0.000050214603,0.0019479621,0.00017551357,0.000031061136],"category_scores_gemma":[0.00006464252,0.0003582561,0.00029334694,0.0011204485,0.00012995246,0.00021111667,0.0018073962,0.0004270343,0.0000063421126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050166585,0.00028228213,0.0016202863,0.00037975397,0.00015042549,0.00006698666,0.00054279447,0.24700685,0.00073340756,0.7471851,0.0016493639,0.00033257497],"study_design_scores_gemma":[0.0036098931,0.0012234533,0.0011973629,0.00036020527,0.00049168477,0.000017218526,0.0004429648,0.4353167,0.0100773005,0.538186,0.0065989946,0.0024781968],"about_ca_topic_score_codex":0.00013404305,"about_ca_topic_score_gemma":0.000008198877,"teacher_disagreement_score":0.20899908,"about_ca_system_score_codex":0.00006989993,"about_ca_system_score_gemma":0.00036661178,"threshold_uncertainty_score":0.99988693},"labels":[],"label_agreement":null},{"id":"W4289242372","doi":"10.48550/arxiv.1811.11116","title":"Counterexamples to a conjecture of Harris on Hall ratio","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission; National Science Foundation","keywords":"Counterexample; Conjecture; Combinatorics; Mathematics; Graph; Upper and lower bounds; Chromatic scale; Mathematical physics; Physics; Discrete mathematics; Mathematical analysis","score_opus":0.08063691049511595,"score_gpt":0.19078726290366885,"score_spread":0.11015035240855289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289242372","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65912706,0.00004354752,0.3363485,0.00031692005,0.0008527321,0.00037217722,0.000041282885,0.00022869039,0.0026691176],"genre_scores_gemma":[0.99550486,0.000024281917,0.003207367,0.00047481857,0.000018256724,7.9345625e-7,0.000009100018,0.000013161596,0.00074736314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982965,0.00010055681,0.00022083217,0.0009872935,0.00012949981,0.00026528872],"domain_scores_gemma":[0.997778,0.00009785038,0.00024004416,0.0013997747,0.0003045647,0.00017978944],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002482438,0.0002752204,0.00034781243,0.00035616057,0.00010196135,0.00008255173,0.0014806876,0.00023702365,0.000042306372],"category_scores_gemma":[0.000045887657,0.0002800822,0.00016580275,0.00048484365,0.00011916032,0.00011114808,0.0011646972,0.00030983475,0.00015338729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074340496,0.00017081389,0.0011331988,0.00011338639,0.00014308494,0.000101819736,0.0008930092,0.14772409,0.0005350276,0.84006786,0.008708086,0.00033529918],"study_design_scores_gemma":[0.0018386844,0.0013053778,0.0020250112,0.0012551865,0.00016277876,0.000011708411,0.000108117536,0.32667693,0.011777609,0.6469221,0.0061867144,0.0017297906],"about_ca_topic_score_codex":0.00030064597,"about_ca_topic_score_gemma":0.00006490326,"teacher_disagreement_score":0.33637783,"about_ca_system_score_codex":0.00006528959,"about_ca_system_score_gemma":0.00016510076,"threshold_uncertainty_score":0.99996513},"labels":[],"label_agreement":null},{"id":"W4293248372","doi":"","title":"Partitionnement de graphes en multiples noyaux et une périphérie","year":2015,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Computer science; Physics","score_opus":0.0287196383265463,"score_gpt":0.24870802278229037,"score_spread":0.21998838445574406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293248372","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.08448525,0.006315735,0.70091045,0.16019078,0.0013738105,0.00096768443,0.00013273663,0.00085188495,0.044771664],"genre_scores_gemma":[0.7089596,0.0014693174,0.27564058,0.0007508345,0.00002177563,0.00017325739,0.00040159994,0.000065819004,0.01251725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98292255,0.012671495,0.0010658352,0.0015073039,0.0009385817,0.00089420873],"domain_scores_gemma":[0.98819447,0.0023079847,0.0008063062,0.0034613505,0.004531581,0.00069833914],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.01786663,0.00065551983,0.0006264882,0.00032191345,0.00069923425,0.0012238466,0.002651379,0.00050239585,0.00011669293],"category_scores_gemma":[0.0025626614,0.0007096471,0.00041061838,0.001104884,0.0006463293,0.0004614356,0.0028256048,0.0010416053,0.0002554519],"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.000010396404,0.0011552725,0.002483158,0.00014897127,0.0001299562,0.00001806258,0.033841502,0.0028776876,0.002150156,0.9294234,0.007792262,0.019969162],"study_design_scores_gemma":[0.002267388,0.000004009022,0.0080793835,0.0053747944,0.00017452799,0.00008130487,0.0007399643,0.29312715,0.034018558,0.5310988,0.12330929,0.0017248619],"about_ca_topic_score_codex":0.009554548,"about_ca_topic_score_gemma":0.006872284,"teacher_disagreement_score":0.62447435,"about_ca_system_score_codex":0.00025232768,"about_ca_system_score_gemma":0.001081663,"threshold_uncertainty_score":0.99981296},"labels":[],"label_agreement":null},{"id":"W4293278553","doi":"","title":"Incidence coloring of some special classes of graphs","year":2018,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Incidence (geometry); Computer science; Graph coloring; Edge coloring; Mathematics; Theoretical computer science; Graph","score_opus":0.017251811254447448,"score_gpt":0.2316325899147422,"score_spread":0.21438077866029476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293278553","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83618677,0.0018475597,0.13290568,0.0032004956,0.0016200609,0.0005614876,0.000044839053,0.00032929366,0.023303797],"genre_scores_gemma":[0.86821777,0.00047258753,0.13053033,0.00004659223,0.000023961169,0.000021282724,0.00002945195,0.000020596051,0.000637414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953569,0.0020737937,0.0008332711,0.0007725886,0.0006495755,0.00031386167],"domain_scores_gemma":[0.9917078,0.0010561681,0.0010872371,0.0027103394,0.0032962295,0.00014224598],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0048819534,0.0002785174,0.0005075378,0.00039652167,0.00018239931,0.00017290995,0.00281229,0.00025511696,0.000040081963],"category_scores_gemma":[0.0011430928,0.0002906417,0.000255032,0.0006796635,0.0005714304,0.0002843305,0.0031062576,0.00042126593,0.00001595929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008464782,0.0004030208,0.002775049,0.00026398135,0.000066001856,0.0000027726453,0.00485656,0.00009830987,0.008876285,0.97297204,0.0013602971,0.008317236],"study_design_scores_gemma":[0.0005945601,0.0000029571522,0.0050772955,0.004182522,0.00005020981,0.000009011293,0.000055898574,0.018579148,0.4251059,0.5441109,0.0016233658,0.00060820254],"about_ca_topic_score_codex":0.0006917121,"about_ca_topic_score_gemma":0.00027982352,"teacher_disagreement_score":0.4288611,"about_ca_system_score_codex":0.000041148192,"about_ca_system_score_gemma":0.00041412885,"threshold_uncertainty_score":0.9999546},"labels":[],"label_agreement":null},{"id":"W4293374375","doi":"","title":"Bounds for the (m,n)-mixed chromatic number and the oriented chromatic number","year":2013,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Chromatic scale; Mathematics; Computer science; Combinatorics","score_opus":0.010896191418775163,"score_gpt":0.22310889959835264,"score_spread":0.2122127081795775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293374375","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.17893553,0.0030023218,0.71925664,0.07939072,0.0014038564,0.003178278,0.000031283453,0.00069316186,0.014108229],"genre_scores_gemma":[0.8832687,0.0004917181,0.106766894,0.0005828876,0.000018908882,0.00092112424,0.000081941864,0.00005635993,0.0078114546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939384,0.0034854084,0.000717283,0.0008494587,0.0005442533,0.00046523864],"domain_scores_gemma":[0.9878794,0.0058891643,0.00067608495,0.003662525,0.0017254221,0.00016741738],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00768817,0.00041335027,0.00049244775,0.00007328182,0.0011708465,0.0015023211,0.0026023886,0.00023081152,0.00010176868],"category_scores_gemma":[0.0017149363,0.0002603059,0.00028598963,0.00046985925,0.0008380395,0.00022907245,0.0025568304,0.0005819522,0.00015217849],"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.000009458733,0.00022608487,0.0003976147,0.0002691318,0.00021186755,9.639696e-7,0.012874267,0.00005525815,0.00019052753,0.9608805,0.010047463,0.014836815],"study_design_scores_gemma":[0.0028855663,8.1616434e-7,0.001620338,0.0019180912,0.00020587836,0.00006778991,0.00020447017,0.645354,0.0034799608,0.3238692,0.01961764,0.0007762673],"about_ca_topic_score_codex":0.0039779134,"about_ca_topic_score_gemma":0.0008683798,"teacher_disagreement_score":0.7043332,"about_ca_system_score_codex":0.00006895137,"about_ca_system_score_gemma":0.00032112031,"threshold_uncertainty_score":0.9999849},"labels":[],"label_agreement":null},{"id":"W4293915036","doi":"10.7151/dmgt.2468","title":"On the Strong Path Partition Conjecture","year":2022,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Conjecture; Partition (number theory); Combinatorics; Path (computing); Discrete mathematics; Computer science","score_opus":0.01399524355016314,"score_gpt":0.21898789988232675,"score_spread":0.20499265633216363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293915036","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.33389914,0.00073497614,0.6088147,0.03281117,0.0020501297,0.0018344409,0.000063228814,0.0015626984,0.018229485],"genre_scores_gemma":[0.9967306,0.0000038647345,0.0013218652,0.0011658138,0.000006414036,0.0002457319,0.0000067381716,0.000017216353,0.0005017322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978086,0.0006441895,0.00028433307,0.00037838315,0.00058076053,0.00030377455],"domain_scores_gemma":[0.99804926,0.0006294528,0.00020534454,0.0010046673,0.00002835938,0.00008290551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016939066,0.00019202933,0.00018259612,0.00014122816,0.0011304527,0.00010633734,0.0009306516,0.000033039796,0.0006274117],"category_scores_gemma":[0.00014415811,0.000092952316,0.00017561483,0.00057821523,0.00012209856,0.00012030294,0.00041662488,0.00032342496,0.000090155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001116865,0.00017493346,0.0000069537386,0.000011806781,0.000019784855,0.0000063029047,0.0014818136,0.00032632684,0.00023726917,0.99336255,0.0030836933,0.001277425],"study_design_scores_gemma":[0.0001867124,0.00011862863,0.000034227232,0.000042239655,0.000012089381,0.000020000954,0.00090744987,0.0027443052,0.00027832235,0.9951217,0.0003696129,0.00016466968],"about_ca_topic_score_codex":9.825332e-7,"about_ca_topic_score_gemma":2.2682893e-7,"teacher_disagreement_score":0.6628315,"about_ca_system_score_codex":0.00001725487,"about_ca_system_score_gemma":0.000027857599,"threshold_uncertainty_score":0.8694643},"labels":[],"label_agreement":null},{"id":"W4297416040","doi":"10.4230/lipics.cp.2022.6","title":"Acquiring Maps of Interrelated Conjectures on Sharp Bounds","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science","score_opus":0.021980698048406112,"score_gpt":0.26933426744177313,"score_spread":0.24735356939336703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297416040","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7030138,0.0018165053,0.19821171,0.0027683272,0.031107664,0.00938647,0.008640209,0.003457208,0.041598096],"genre_scores_gemma":[0.9700009,0.00009399067,0.024165798,0.0022339812,0.00005688589,0.00036298358,0.0023527227,0.00011150358,0.00062120287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99503523,0.00010612272,0.0021735816,0.0007172943,0.0010722145,0.00089558575],"domain_scores_gemma":[0.99531627,0.00025391392,0.0015302452,0.0022237857,0.00042263535,0.00025316968],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011788696,0.00079535606,0.0010447816,0.00094368716,0.0004595909,0.00063920603,0.0034189252,0.00057071616,0.00011190439],"category_scores_gemma":[0.00015380539,0.00073420745,0.00071305304,0.00049796706,0.00021895593,0.0006170282,0.004785923,0.0018319641,0.000061830906],"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.0012295014,0.0036584297,0.0055551403,0.012633716,0.004284323,0.00009391329,0.10130475,0.10041652,0.0006741235,0.6063758,0.12808631,0.035687484],"study_design_scores_gemma":[0.01395537,0.0038358134,0.0006834826,0.005891236,0.00045642158,0.00022803547,0.0029372585,0.52343184,0.009329578,0.19734104,0.23615874,0.005751202],"about_ca_topic_score_codex":0.00006073937,"about_ca_topic_score_gemma":0.0000070442916,"teacher_disagreement_score":0.4230153,"about_ca_system_score_codex":0.00021966423,"about_ca_system_score_gemma":0.00025159764,"threshold_uncertainty_score":0.9995109},"labels":[],"label_agreement":null},{"id":"W4313358784","doi":"10.4171/aihpd/156","title":"Motives of melonic graphs","year":2022,"lang":"en","type":"article","venue":"Annales de l’Institut Henri Poincaré D Combinatorics Physics and their Interactions","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Computer science","score_opus":0.015614807103387477,"score_gpt":0.2345841696252278,"score_spread":0.21896936252184032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313358784","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9217339,0.0035203332,0.06070749,0.0014280998,0.0022900484,0.00035217422,0.00007727303,0.00030930276,0.009581351],"genre_scores_gemma":[0.99882126,0.00017352779,0.00055521313,0.00022078857,0.0000086971895,0.000046636014,0.000010626167,0.000012604192,0.00015062139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874264,0.00012601605,0.00028415583,0.00034554774,0.00020991277,0.0002917259],"domain_scores_gemma":[0.9988699,0.00016798548,0.0001910559,0.0004891091,0.00016582485,0.00011610195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027478993,0.00019040224,0.0002438254,0.00018709304,0.0007175287,0.000082038685,0.0005545397,0.000026699088,0.000010199231],"category_scores_gemma":[0.000018473222,0.0001815682,0.00017070693,0.0007848934,0.0001332172,0.0004281303,0.000572738,0.00038662393,0.0000037801444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059757294,0.00040720002,0.00090577017,0.000018176595,0.00008324968,0.0000054590446,0.0017171162,0.0007831331,0.001612578,0.9909153,0.0005725131,0.0029735554],"study_design_scores_gemma":[0.00037411824,0.00020531706,0.00040443995,0.000026570751,0.000014731005,0.00007164548,0.00040307108,0.016773572,0.0031338646,0.9677431,0.010628581,0.00022099294],"about_ca_topic_score_codex":0.000083553525,"about_ca_topic_score_gemma":0.0000053879276,"teacher_disagreement_score":0.07708736,"about_ca_system_score_codex":0.00005681946,"about_ca_system_score_gemma":0.00013038384,"threshold_uncertainty_score":0.74041367},"labels":[],"label_agreement":null},{"id":"W4313905169","doi":"10.7151/dmgt.2480","title":"On the <i>k</i>-independence number of graph products","year":2023,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Fonds Wetenschappelijk Onderzoek","keywords":"Mathematics; Independence number; Combinatorics; Graph; Independence (probability theory); Discrete mathematics; Statistics","score_opus":0.01918261965728592,"score_gpt":0.2552629948764604,"score_spread":0.2360803752191745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313905169","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88633657,0.00026415766,0.059610683,0.021617636,0.0018514793,0.001804988,0.000025300675,0.002357238,0.026131937],"genre_scores_gemma":[0.99457645,0.00003493854,0.003567616,0.00035973202,0.000007883106,0.00008948185,0.0000031714185,0.000027079788,0.001333644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973726,0.00035915407,0.00048259055,0.0005316182,0.0008390891,0.0004149414],"domain_scores_gemma":[0.9967036,0.0010938707,0.0002424984,0.0016922704,0.00016937891,0.00009834923],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0028909277,0.00025619453,0.00030926292,0.00027743293,0.00032675275,0.00007585496,0.0014070286,0.00008748565,0.00009810261],"category_scores_gemma":[0.00066697854,0.00012053124,0.00020830882,0.0025888241,0.00032611133,0.00021073697,0.00037113327,0.00024565213,0.0008096787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011520053,0.00014807943,0.00005323411,0.00008369982,0.0000325491,0.00000647013,0.0014467073,0.000028090166,0.00183597,0.991663,0.0037285895,0.00096211745],"study_design_scores_gemma":[0.00015828086,0.000036151458,0.00022184296,0.00025019734,0.000014480047,0.000016181739,0.00035182334,0.00050091825,0.006638526,0.9915658,0.00005325105,0.00019250801],"about_ca_topic_score_codex":0.0000020501695,"about_ca_topic_score_gemma":3.2027225e-7,"teacher_disagreement_score":0.108239874,"about_ca_system_score_codex":0.0000049318246,"about_ca_system_score_gemma":0.000044116812,"threshold_uncertainty_score":0.9999683},"labels":[],"label_agreement":null},{"id":"W4320185519","doi":"10.2139/ssrn.4355814","title":"Induced Forests in Some Distance-Regular Graphs","year":2023,"lang":"en","type":"article","venue":"SSRN Electronic Journal","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":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Manitoba; University of Lethbridge; RTDS Technologies (Canada)","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.011668773741931806,"score_gpt":0.23682506684606802,"score_spread":0.2251562931041362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320185519","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9838585,0.0017623117,0.010990814,0.0024202613,0.0005280292,0.00010560514,4.274464e-7,0.00023167596,0.000102322265],"genre_scores_gemma":[0.9983123,0.0009609931,0.00021107182,0.00012238862,0.000020664433,0.000007860533,0.0000015237972,0.00001437498,0.00034883036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965961,0.000088438814,0.0003232574,0.0003079637,0.0003803805,0.0023038655],"domain_scores_gemma":[0.9993344,0.00004186936,0.00011067154,0.0003491207,0.00005534354,0.000108578504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020881614,0.00014968458,0.00017589962,0.0005432873,0.00019147729,0.00011925134,0.00077399344,0.00007699174,0.0000016620746],"category_scores_gemma":[0.00004310836,0.00013002954,0.00010826795,0.0015560584,0.000030678024,0.0005313556,0.0001143297,0.0012436266,0.000079920654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005612183,0.000028784592,0.002713691,0.0000026441262,0.000020512873,0.00002501781,0.00013332322,0.00019800616,0.0012165945,0.9840947,0.00014584634,0.011415314],"study_design_scores_gemma":[0.0006479064,0.00014439398,0.0032963955,0.00002977613,0.000003117811,0.00010043375,0.0000942855,0.003733059,0.00027390014,0.9913387,0.00017481782,0.00016323866],"about_ca_topic_score_codex":0.000044569384,"about_ca_topic_score_gemma":0.000841024,"teacher_disagreement_score":0.01445374,"about_ca_system_score_codex":0.0002276905,"about_ca_system_score_gemma":0.0008399604,"threshold_uncertainty_score":0.5403008},"labels":[],"label_agreement":null},{"id":"W4321763399","doi":"10.1016/j.jctb.2023.02.003","title":"Proper orientations and proper chromatic number","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Windmill graph; Chromatic scale; Friendship graph; Graph; Vertex (graph theory); Critical graph; Orientation (vector space); Mathematical proof; Discrete mathematics; Graph power; Line graph; Geometry","score_opus":0.010523207752898929,"score_gpt":0.24193141275374938,"score_spread":0.23140820500085046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321763399","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98245806,0.0001998566,0.0019483701,0.0022616696,0.008946415,0.00022264842,0.0000012448637,0.00018688872,0.0037748662],"genre_scores_gemma":[0.9955677,0.000056653873,0.0031725094,0.000095289506,0.00007528935,0.0000052370397,5.219374e-7,0.000011476482,0.0010153562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988197,0.00017652081,0.00037111773,0.0001276116,0.0003290959,0.0001759579],"domain_scores_gemma":[0.99904406,0.000120836135,0.00020982811,0.00021177,0.00030154438,0.00011194291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012051953,0.000105495055,0.00020092918,0.00012359496,0.00018519354,0.00017511606,0.0003325654,0.000046813824,0.00003288272],"category_scores_gemma":[0.0002108945,0.00007258745,0.000060772603,0.0005680909,0.00012638309,0.0008682933,0.00014026932,0.00015548464,0.000060627175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043317745,0.000046472367,0.00019767458,0.000018966139,0.00003385482,0.000030323274,0.0015450135,0.000018206169,0.001175056,0.9939168,0.0020273821,0.000946928],"study_design_scores_gemma":[0.00080191105,0.0002838789,0.0003315162,0.00006470731,0.000016743237,0.00021832874,0.00023908258,0.00012832382,0.0015966538,0.99112576,0.0050775586,0.000115525894],"about_ca_topic_score_codex":0.0000013676182,"about_ca_topic_score_gemma":1.3558592e-7,"teacher_disagreement_score":0.013109626,"about_ca_system_score_codex":0.000014368187,"about_ca_system_score_gemma":0.00010568328,"threshold_uncertainty_score":0.296003},"labels":[],"label_agreement":null},{"id":"W4323828043","doi":"10.4171/owr/2022/1","title":"Graph Theory","year":2023,"lang":"en","type":"article","venue":"Oberwolfach Reports","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Graph theory; Conjecture; Computer science; Graph; Range (aeronautics); Theoretical computer science; Mathematics; Discrete mathematics; Engineering; Combinatorics","score_opus":0.01580870636334688,"score_gpt":0.23330098348047304,"score_spread":0.21749227711712615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323828043","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7800798,0.0013256873,0.098061584,0.004055735,0.0074057993,0.00064004294,0.000002790515,0.009371224,0.09905738],"genre_scores_gemma":[0.98826224,0.000025341216,0.0050298017,0.0004038857,0.000011858349,0.000024001745,0.000007721466,0.000014671948,0.0062204693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842054,0.00006645202,0.000333681,0.00048206875,0.00034930662,0.00034796828],"domain_scores_gemma":[0.9985931,0.000077407305,0.00012974034,0.0009969225,0.000073981166,0.0001288449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001384624,0.00012383617,0.00013604622,0.00024218821,0.00017231295,0.00010656509,0.0002974951,0.000061917744,0.000028161476],"category_scores_gemma":[0.00011571185,0.00010500397,0.00010479319,0.001218953,0.00004912089,0.00021675577,0.00022992007,0.00011278046,0.00035283653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027671501,0.00007306715,0.00630448,0.000020939862,0.00004391687,0.00306701,0.00059706,0.0004976301,0.0041936864,0.88578826,0.05491385,0.04449731],"study_design_scores_gemma":[0.00008698018,0.000028934914,0.004964576,0.00001752913,0.000005728662,0.00039848697,0.000016844424,0.0010899564,0.0021696715,0.9760466,0.014966747,0.00020794586],"about_ca_topic_score_codex":0.000019298606,"about_ca_topic_score_gemma":0.0000016244828,"teacher_disagreement_score":0.20818248,"about_ca_system_score_codex":0.000008130494,"about_ca_system_score_gemma":0.000045597997,"threshold_uncertainty_score":0.45351174},"labels":[],"label_agreement":null},{"id":"W4323847849","doi":"10.3390/math11061322","title":"Fixing Numbers of Point-Block Incidence Graphs","year":2023,"lang":"en","type":"article","venue":"Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Science Foundation","keywords":"Combinatorics; Mathematics; Discrete mathematics; Graph automorphism; Symmetric graph; Vertex (graph theory); Graph; Line graph; Voltage graph","score_opus":0.019379360397624085,"score_gpt":0.24819761395567758,"score_spread":0.2288182535580535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323847849","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9617639,0.000085834006,0.031850975,0.00078386994,0.00046438372,0.00019203706,0.00000303533,0.0008249027,0.0040310156],"genre_scores_gemma":[0.88344485,0.00001770402,0.11608236,0.00009597031,0.0000035719459,0.0000066062976,0.0000010759268,0.00001073893,0.0003370965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899673,0.000018949511,0.00030400036,0.00017521533,0.00030094592,0.00020414064],"domain_scores_gemma":[0.9990167,0.00018702075,0.0001327035,0.00052599085,0.00008022779,0.0000573308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005329136,0.000090563844,0.00016308266,0.00016861757,0.00006763267,0.000039736347,0.00051508314,0.00003989134,0.000005244185],"category_scores_gemma":[0.00013738881,0.00007921832,0.00007011654,0.0010371762,0.000047632133,0.00014326362,0.00023325605,0.0000708816,0.00017802198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012391581,0.00013845455,0.0012275463,0.00040584354,0.00003798815,0.00003156795,0.0096094385,0.0009791293,0.009909433,0.96281725,0.013276882,0.0015652019],"study_design_scores_gemma":[0.00018318166,0.000039736067,0.0001721661,0.0002096372,0.000008587832,0.00002629135,0.00025030837,0.085986674,0.008306785,0.90449107,0.00015082267,0.00017472728],"about_ca_topic_score_codex":0.000015727923,"about_ca_topic_score_gemma":0.0000024989595,"teacher_disagreement_score":0.08500755,"about_ca_system_score_codex":0.000005866541,"about_ca_system_score_gemma":0.000023738161,"threshold_uncertainty_score":0.32304293},"labels":[],"label_agreement":null},{"id":"W4380928971","doi":"10.1016/j.dam.2023.06.003","title":"The localization game on oriented graphs","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Random graph; Discrete mathematics; Upper and lower bounds; Extension (predicate logic); Graph; Computer science","score_opus":0.014268984376270022,"score_gpt":0.2398075032930202,"score_spread":0.22553851891675017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380928971","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.022393975,0.000054495988,0.95143884,0.0017002848,0.0006076487,0.00069378765,0.000004627701,0.0019090994,0.021197233],"genre_scores_gemma":[0.97275275,0.0001231163,0.025292713,0.00078728027,0.000014012443,0.00016373495,0.000031802596,0.000047600977,0.0007869957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987636,0.000014780077,0.00026734456,0.00025787612,0.00040080404,0.00029560013],"domain_scores_gemma":[0.9987866,0.0002366336,0.00010829705,0.00074814534,0.000050800933,0.000069511705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044153913,0.00013738133,0.0001236165,0.000106687825,0.0003260988,0.00015103401,0.0005118051,0.000048900994,0.000002605295],"category_scores_gemma":[0.00005234766,0.00008624818,0.000055940145,0.0011524844,0.00007553095,0.00005512512,0.00015966303,0.000098505116,0.0005105064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020889709,0.000020910047,0.000002697723,0.000016042803,0.000010173138,0.0000014748209,0.0007393588,0.00094714045,0.00046041404,0.9931171,0.0029694692,0.0017131084],"study_design_scores_gemma":[0.0002019286,0.000029685743,0.000015811162,0.000027195285,0.000006297473,0.0000014235178,0.00020411168,0.21361843,0.0016852985,0.78024995,0.0038229346,0.00013691037],"about_ca_topic_score_codex":0.0000013049358,"about_ca_topic_score_gemma":0.0000010222568,"teacher_disagreement_score":0.95035875,"about_ca_system_score_codex":0.000009763814,"about_ca_system_score_gemma":0.000016578319,"threshold_uncertainty_score":0.6561697},"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":"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":"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":"W4385397173","doi":"10.61091/jcmcc","title":"Journal of Combinatorial Mathematics and Combinatorial Computing","year":2023,"lang":"en","type":"paratext","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":237,"is_retracted":false,"has_abstract":true,"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.02095889035569519,"score_gpt":0.2673314439731945,"score_spread":0.24637255361749932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385397173","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.27093655,0.0113834245,0.04636216,0.0011519849,0.6604633,0.002655672,0.000073450356,0.00048824784,0.0064852657],"genre_scores_gemma":[0.9002227,0.002942671,0.07964531,0.00018598931,0.015686452,0.000011276581,0.000037449157,0.00082323776,0.00044490266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98537046,0.0007197948,0.0072461176,0.0011198348,0.003960617,0.0015831937],"domain_scores_gemma":[0.9760698,0.0046928837,0.012150482,0.0013465354,0.0045565986,0.001183713],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.009793662,0.0018116127,0.005377069,0.0019642075,0.0011388524,0.002174058,0.0038009612,0.0016394876,0.000024238827],"category_scores_gemma":[0.0025505547,0.0016460761,0.0012057304,0.0019766293,0.000628108,0.0010154058,0.0027187779,0.004107635,0.000084754545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021694953,0.0021706289,0.000025678293,0.002407372,0.0012569196,0.00032846263,0.0045938483,0.00023978922,0.0005550354,0.9433678,0.042627502,0.002210015],"study_design_scores_gemma":[0.019616436,0.004521449,0.000016450322,0.0066910875,0.00091388647,0.00176212,0.0008163682,0.016856842,0.000860217,0.93738526,0.0084587755,0.0021010935],"about_ca_topic_score_codex":0.000037996437,"about_ca_topic_score_gemma":5.052622e-7,"teacher_disagreement_score":0.6447768,"about_ca_system_score_codex":0.00037332156,"about_ca_system_score_gemma":0.001575034,"threshold_uncertainty_score":0.9996566},"labels":[],"label_agreement":null},{"id":"W4385403310","doi":"10.61091/jcmcc117-02","title":"Cycles and Paths Related Vertex-Equitable Graphs","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":13,"is_retracted":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); Combinatorics; Mathematics; Graph; Computer science","score_opus":0.01467007478408068,"score_gpt":0.24408552399169045,"score_spread":0.22941544920760976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385403310","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97947145,0.00086014444,0.0018668721,0.00045748893,0.016303647,0.00018900912,9.704702e-7,0.00022699709,0.00062340347],"genre_scores_gemma":[0.99337584,0.00019356146,0.006284302,0.000030923107,0.000073606,0.0000012310448,8.14009e-7,0.000025819105,0.000013889845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972838,0.00011903075,0.0010934587,0.00031112987,0.000689694,0.0005028794],"domain_scores_gemma":[0.99739414,0.0007834673,0.00078896194,0.00034239682,0.00040957675,0.0002814608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002741484,0.0002767786,0.0006646605,0.0004598381,0.0004777193,0.00045380823,0.0006135231,0.00017505215,0.0000019230492],"category_scores_gemma":[0.0004411633,0.00023959726,0.00014855375,0.001049441,0.00011589844,0.00045243674,0.0006931646,0.00044891483,0.000007989906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011369435,0.00014768944,0.00019345837,0.00009073554,0.00007051397,0.00005223328,0.0013408839,0.000036134268,0.00078519736,0.9935817,0.0006515395,0.0030385158],"study_design_scores_gemma":[0.002724355,0.0004739726,0.00019604103,0.00029723922,0.000041845182,0.00017631767,0.00019887941,0.030186728,0.00032858184,0.96492845,0.0001852954,0.00026231972],"about_ca_topic_score_codex":0.0000073960396,"about_ca_topic_score_gemma":1.0249809e-7,"teacher_disagreement_score":0.030150594,"about_ca_system_score_codex":0.000025876612,"about_ca_system_score_gemma":0.00010103637,"threshold_uncertainty_score":0.9770493},"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":"W4386516382","doi":"10.1016/j.disc.2023.113685","title":"New bounds for the average genus and average number of faces of a simple graph","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Conjecture; Simple graph; Graph; Simple (philosophy); Degree (music); Upper and lower bounds; Discrete mathematics","score_opus":0.022763598297855937,"score_gpt":0.2775163825757442,"score_spread":0.2547527842778882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386516382","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.35374373,0.0002581337,0.64421195,0.0004888217,0.00014563843,0.00039594763,0.000035864454,0.0001155496,0.0006043826],"genre_scores_gemma":[0.93319577,0.00007980334,0.066068806,0.000046561952,0.0000058384676,0.0000151280565,0.0000048254037,0.000013775294,0.00056949246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912345,0.000015746913,0.00030213714,0.0001610776,0.00022023331,0.00017737807],"domain_scores_gemma":[0.99883044,0.00043868716,0.00016741604,0.00044680558,0.0000640374,0.0000525992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000395946,0.00010520668,0.00020971755,0.00006239483,0.00010201738,0.00005872954,0.00037715223,0.000038450442,0.00001055292],"category_scores_gemma":[0.000077351906,0.00006832273,0.00009547598,0.00041515386,0.00007181048,0.00008888518,0.00018068879,0.00004736747,0.000007044146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000087852695,0.000056346933,0.00070396,0.000756064,0.00015469735,0.0000031599693,0.015556525,0.0015411888,0.0025754604,0.96382654,0.007412918,0.0074043334],"study_design_scores_gemma":[0.00040162983,0.000053365548,0.00018970748,0.000062413834,0.000027013404,0.00000818758,0.0002473935,0.12766467,0.003081808,0.8674093,0.0007273013,0.00012722742],"about_ca_topic_score_codex":0.00003948966,"about_ca_topic_score_gemma":0.000004326288,"teacher_disagreement_score":0.57945204,"about_ca_system_score_codex":0.0000023233722,"about_ca_system_score_gemma":0.000029104163,"threshold_uncertainty_score":0.27861202},"labels":[],"label_agreement":null},{"id":"W4387121408","doi":"10.4153/s0008439523000759","title":"On the metric dimension of circulant graphs","year":2023,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","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":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Circulant matrix; Dimension (graph theory); Conjecture; Graph","score_opus":0.01910128730984028,"score_gpt":0.21351592935524233,"score_spread":0.19441464204540204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387121408","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8753317,0.00021694317,0.0076426943,0.08536217,0.00053787505,0.0007972212,0.000018070024,0.00053229765,0.029561028],"genre_scores_gemma":[0.9971372,0.000005721677,0.0009901001,0.0014647106,0.0000023337577,0.000014023345,0.0000016502462,0.000009299706,0.0003749478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882764,0.00007146512,0.00023599828,0.0002245931,0.00030583725,0.00033447138],"domain_scores_gemma":[0.9982754,0.0007318018,0.000052852454,0.0006084602,0.00006324545,0.00026822241],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00077324663,0.00010480159,0.00016065217,0.0004579016,0.00013928676,0.000043224423,0.0005398082,0.000054270196,0.00055363774],"category_scores_gemma":[0.0006064026,0.00006621712,0.00008719034,0.0014318426,0.00007993393,0.0000144493615,0.000068279594,0.00012064385,0.008391821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.7422913e-7,0.000013577002,0.000007821902,0.000015404612,0.0000080047585,0.000019566463,0.0000989375,0.0000568077,0.00014785252,0.9583086,0.04091061,0.0004123888],"study_design_scores_gemma":[0.00011659337,0.000056325036,0.0001556693,0.000093139904,0.0000067971378,0.000010959469,0.000042266463,0.013221002,0.0005983534,0.98224777,0.003320555,0.0001305576],"about_ca_topic_score_codex":0.00038148052,"about_ca_topic_score_gemma":0.000035013654,"teacher_disagreement_score":0.12180551,"about_ca_system_score_codex":0.000022075808,"about_ca_system_score_gemma":0.00007633795,"threshold_uncertainty_score":0.99238026},"labels":[],"label_agreement":null},{"id":"W4387333634","doi":"10.28924/2291-8639-21-2023-111","title":"On Degree-Based Topological Indices of Toeplitz Graphs","year":2023,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","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":"Toeplitz matrix; Mathematics; Graph; Degree (music); Metric (unit); Index (typography); Combinatorics; Discrete mathematics; Pure mathematics; Computer science","score_opus":0.02567644761965609,"score_gpt":0.29774943780987523,"score_spread":0.27207299019021913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387333634","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6305741,0.0001621958,0.3637024,0.00475242,0.000113211776,0.000066965484,0.000014056942,0.000038638023,0.00057602156],"genre_scores_gemma":[0.9949322,0.000069155336,0.0047324947,0.00021986588,0.000010501936,0.0000054937705,0.000005525991,0.0000016457354,0.00002315605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990765,0.00002673602,0.00033768298,0.00012529358,0.00036638262,0.0000674303],"domain_scores_gemma":[0.99892044,0.00020488369,0.00031752905,0.00015098775,0.0003482272,0.000057936126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035812584,0.000055763845,0.00015189199,0.00087628595,0.000050223447,0.00005190977,0.00050641416,0.000029075665,0.0000147471255],"category_scores_gemma":[0.0000314942,0.000041045452,0.00017813996,0.0012148219,0.000060483228,0.00007840492,0.000052194977,0.00007481538,0.000005561964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015812175,0.0002037787,0.011412137,0.000003645422,0.0007122774,0.0000083635,0.00007886042,0.007187456,0.0015428499,0.950019,0.00035786664,0.028457955],"study_design_scores_gemma":[0.0010717737,0.00038271258,0.120664105,0.000058277117,0.0004130694,0.000020325917,0.000108249566,0.057167783,0.005825832,0.8116727,0.0023668404,0.00024835224],"about_ca_topic_score_codex":0.000015699101,"about_ca_topic_score_gemma":0.0000042639185,"teacher_disagreement_score":0.36435807,"about_ca_system_score_codex":0.0000071495742,"about_ca_system_score_gemma":0.00002743416,"threshold_uncertainty_score":0.16737849},"labels":[],"label_agreement":null},{"id":"W4390012497","doi":"10.2139/ssrn.4670200","title":"Graphs of Large Girth and Small Cop Number","year":2023,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Girth (graph theory); Combinatorics; Mathematics; Computer science","score_opus":0.01710454247755043,"score_gpt":0.25423377091874777,"score_spread":0.23712922844119733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390012497","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7979126,0.013316266,0.18139601,0.0030116534,0.0027061517,0.0004115854,0.000024082754,0.00044926937,0.00077238696],"genre_scores_gemma":[0.98077387,0.013143431,0.00448572,0.00012560058,0.00003234991,0.00000825625,0.0000066732932,0.000038735783,0.0013853488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964761,0.00014519271,0.00052835786,0.0005166664,0.00038355213,0.001950136],"domain_scores_gemma":[0.99851185,0.00007956808,0.0004631946,0.0005783784,0.00022425193,0.00014274292],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0031582734,0.000274531,0.0004159195,0.00028077755,0.00018107114,0.00015107142,0.0010208405,0.00023497533,0.000006312467],"category_scores_gemma":[0.00005814644,0.00024270751,0.00022240284,0.00036479995,0.00006796834,0.000102755796,0.0010481494,0.0032804334,0.000031779422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000086973805,0.000066625216,0.0035433173,0.000054865657,0.00022616267,0.000010432834,0.0002538414,0.00010951397,0.00009705995,0.99166477,0.00033606493,0.003628637],"study_design_scores_gemma":[0.0005220098,0.00010778042,0.00052094995,0.00014413592,0.000034518554,0.00029137495,0.00009009399,0.001640771,0.00009127096,0.9960678,0.00023923967,0.00025003043],"about_ca_topic_score_codex":0.00015036734,"about_ca_topic_score_gemma":0.0004374406,"teacher_disagreement_score":0.1828613,"about_ca_system_score_codex":0.000113679416,"about_ca_system_score_gemma":0.001858019,"threshold_uncertainty_score":0.999019},"labels":[],"label_agreement":null},{"id":"W4390714284","doi":"10.55016/ojs/cdm.v17i2.62707","title":"Brooks' theorem for 2-fold coloring","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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; Brooks' theorem; Graph; Edge coloring; Vertex (graph theory); Wheel graph; Windmill graph; Graph coloring; List coloring; Discrete mathematics; Complete coloring; Graph power; Line graph","score_opus":0.016673213339947403,"score_gpt":0.27662019205305416,"score_spread":0.25994697871310674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390714284","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.007820285,0.00013050257,0.98472136,0.00403387,0.00042383972,0.00083931966,0.00026571215,0.00032648363,0.0014386071],"genre_scores_gemma":[0.8442783,0.0000020987152,0.15295964,0.0007261263,0.000018626604,0.00095127994,0.00002797239,0.000020266625,0.0010157131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986618,0.00004884296,0.00032406673,0.00030071285,0.00028105656,0.00038350737],"domain_scores_gemma":[0.99859834,0.00031074355,0.0001017104,0.0006395053,0.00020618385,0.00014354347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086810545,0.00013481406,0.00021020162,0.00013848428,0.000917626,0.00013802105,0.00077385386,0.00002853253,0.000027805521],"category_scores_gemma":[0.0003874595,0.00012640998,0.00012863932,0.00052706915,0.000031803283,0.00010992872,0.0006134176,0.00012417635,0.000051602747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003877864,0.00006610804,0.000004822699,0.000014932899,0.000017802397,0.0000014876201,0.000644729,0.0012827476,0.0013640244,0.99224186,0.0040233796,0.00033424693],"study_design_scores_gemma":[0.00068360794,0.00024846935,0.000010197534,0.000027668928,0.00002970793,0.000022538217,0.00025839487,0.12083241,0.0026864833,0.8428227,0.032080524,0.00029729505],"about_ca_topic_score_codex":0.0000034575842,"about_ca_topic_score_gemma":0.0000011883081,"teacher_disagreement_score":0.83645797,"about_ca_system_score_codex":0.00010806684,"about_ca_system_score_gemma":0.00007801236,"threshold_uncertainty_score":0.70577306},"labels":[],"label_agreement":null},{"id":"W4390937016","doi":"10.1090/mcom/3943","title":"Few hamiltonian cycles in graphs with one or two vertex degrees","year":2024,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Dawson College","funders":"KU Leuven; Fonds Wetenschappelijk Onderzoek; Natural Sciences and Engineering Research Council of Canada; Vlaamse regering; Japan Society for the Promotion of Science; Onderzoeksraad, KU Leuven; Vlaams Supercomputer Centrum","keywords":"Vertex (graph theory); Combinatorics; Hamiltonian (control theory); Hamiltonian path; Mathematics; Hamiltonian path problem; Graph; Mathematical optimization","score_opus":0.031301575136898664,"score_gpt":0.28079871192876094,"score_spread":0.24949713679186228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390937016","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.48743558,0.0003204122,0.510788,0.00032905268,0.00012343787,0.00018479988,0.0000012380557,0.00021607385,0.0006014129],"genre_scores_gemma":[0.70179063,0.000008129135,0.29813796,0.000019723826,0.0000013673116,0.000005641208,0.0000017942449,0.000008491326,0.00002627515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989898,0.000028887624,0.00032226404,0.00021672413,0.0002992415,0.00014303756],"domain_scores_gemma":[0.99935067,0.00024107567,0.00008063581,0.00021112678,0.00007717231,0.000039295723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003058639,0.0001115108,0.0001939409,0.00032833312,0.000035494726,0.00012570496,0.00023502811,0.00003077953,0.0000036410722],"category_scores_gemma":[0.00002053281,0.00008096999,0.000035895537,0.00077939214,0.00004973912,0.00023198048,0.0000562784,0.00008236179,0.000018363542],"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.000014583769,0.00037829977,0.0002026408,0.0008182101,0.00006242791,0.000041089075,0.0059090373,0.036267687,0.001660109,0.9148617,0.00017241125,0.03961185],"study_design_scores_gemma":[0.00028173393,0.000102016515,0.00042388504,0.0006915137,0.0000096223175,0.000015254815,0.000042317894,0.5963414,0.0006830192,0.4013063,0.0000059422105,0.00009699925],"about_ca_topic_score_codex":0.00003389254,"about_ca_topic_score_gemma":0.00007316958,"teacher_disagreement_score":0.56007373,"about_ca_system_score_codex":0.0000140262,"about_ca_system_score_gemma":0.00006473637,"threshold_uncertainty_score":0.33018604},"labels":[],"label_agreement":null},{"id":"W4391055591","doi":"10.1016/j.ejc.2024.103926","title":"Exact values and improved bounds on <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e2259\" altimg=\"si125.svg\"><mml:mi>k</mml:mi></mml:math>-neighborly families of boxes","year":2024,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Institute for Basic Science","keywords":"Mathematics; Combinatorics","score_opus":0.013248280040866227,"score_gpt":0.22916540398566357,"score_spread":0.21591712394479734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391055591","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99031556,0.0025921715,0.0022608025,0.00033316526,0.0021985914,0.000029118772,0.000010589328,0.0001076487,0.0021523398],"genre_scores_gemma":[0.9965387,0.0008647668,0.0020822247,0.00023411534,0.00010426828,0.0000029822759,0.0000056160857,0.000071262584,0.00009604005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746746,0.00021260172,0.000804538,0.00039585217,0.00073540985,0.00038414405],"domain_scores_gemma":[0.9980406,0.0003718441,0.00059207523,0.0005713201,0.00017896813,0.00024515865],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016839523,0.00027412796,0.0002529907,0.00026957164,0.00028579673,0.0005795503,0.0008244034,0.000105319756,0.0000035277528],"category_scores_gemma":[0.00024137142,0.0002612583,0.00028163413,0.00045514695,0.0002231875,0.00058428635,0.00042123513,0.00058942335,0.00009135978],"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.000054961314,0.00014485985,0.000019244848,0.00017936324,0.00014216937,0.00045844528,0.0010692538,0.00013758385,0.0022403782,0.9918916,0.0008515163,0.002810573],"study_design_scores_gemma":[0.0015354336,0.0042784764,0.0005147637,0.001446311,0.00024323384,0.0007796777,0.00038542572,0.93830293,0.008241958,0.03664614,0.0070294472,0.0005961865],"about_ca_topic_score_codex":0.000016680226,"about_ca_topic_score_gemma":0.0000012241753,"teacher_disagreement_score":0.9552455,"about_ca_system_score_codex":0.00001328129,"about_ca_system_score_gemma":0.00020944251,"threshold_uncertainty_score":0.99998397},"labels":[],"label_agreement":null},{"id":"W4391127074","doi":"10.61091/um118-05","title":"Odd Graceful Labeling of W -Tree W T ( n , k ) and its Disjoint Union","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","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; Combinatorics; Disjoint union (topology); Tree (set theory); Discrete mathematics","score_opus":0.018872323194234163,"score_gpt":0.2500113839871136,"score_spread":0.23113906079287944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127074","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6703819,0.06253773,0.23265845,0.009889438,0.001591612,0.0011359089,0.000033129585,0.002175701,0.01959615],"genre_scores_gemma":[0.94766945,0.00007996503,0.051891997,0.00003922219,0.0000046211426,0.00000820399,0.000001150061,0.000011525162,0.0002938686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885124,0.00005158203,0.000334181,0.00032240528,0.0002442012,0.00019641817],"domain_scores_gemma":[0.9991403,0.00025942296,0.00004877118,0.00039640046,0.00006920766,0.0000858763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007426503,0.00012889074,0.00020139242,0.00015002362,0.00006061031,0.00009220199,0.00026489768,0.000049788163,0.00002422278],"category_scores_gemma":[0.00012832164,0.00009927476,0.00006181087,0.00038281808,0.000052342224,0.00022476181,0.00022519396,0.00010397609,0.00007646931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010174753,0.000052114112,0.000008858757,0.0005864379,0.000024465582,0.000007041084,0.0014635059,0.000007731359,0.006979966,0.9802292,0.0004467125,0.01019297],"study_design_scores_gemma":[0.00014468699,0.000086661035,0.000048246155,0.0007560353,0.000027209206,0.000033737157,0.00009036327,0.25814673,0.008128527,0.7316497,0.00071945315,0.00016866592],"about_ca_topic_score_codex":0.000004605785,"about_ca_topic_score_gemma":0.0000012417651,"teacher_disagreement_score":0.27728757,"about_ca_system_score_codex":0.000008324954,"about_ca_system_score_gemma":0.000030070521,"threshold_uncertainty_score":0.4048307},"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":"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":"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":"W4391127604","doi":"10.61091/jcmcc117-19","title":"Perfect Matching and Zero-Sum 3-Magic Labeling","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); MAGIC (telescope); Graph; Conjecture; Abelian group; Discrete mathematics; Physics","score_opus":0.015650891564612083,"score_gpt":0.2501830057876979,"score_spread":0.23453211422308584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127604","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9663282,0.00067082664,0.018491548,0.0004908036,0.013283358,0.00018285122,7.1688885e-7,0.00021125519,0.00034043164],"genre_scores_gemma":[0.9796022,0.00012724574,0.019952895,0.000049955554,0.00022449727,9.078997e-7,6.0645806e-7,0.000030356547,0.000011327178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972765,0.00013574949,0.0010484732,0.00033398962,0.0007370282,0.00046827004],"domain_scores_gemma":[0.99721366,0.00094089017,0.0007950862,0.00033371174,0.00043728654,0.00027934092],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0032131316,0.00030576094,0.0007008871,0.00043879758,0.0004631761,0.00062787806,0.000627653,0.00014827173,0.0000014494854],"category_scores_gemma":[0.0003956611,0.0002662036,0.00014610217,0.000814612,0.0000892284,0.00044282622,0.000689259,0.00054467446,0.000009923237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000130642975,0.00012610506,0.00013283378,0.00015494392,0.0000625374,0.00005299557,0.0020505069,0.00014093872,0.0023259425,0.9921462,0.00026376874,0.00253017],"study_design_scores_gemma":[0.002381689,0.0004240972,0.00006850061,0.00040345415,0.00004398095,0.00020763415,0.00019479857,0.02889492,0.0004432168,0.9664237,0.00021869567,0.00029529884],"about_ca_topic_score_codex":0.000011045817,"about_ca_topic_score_gemma":1.2110948e-7,"teacher_disagreement_score":0.028753981,"about_ca_system_score_codex":0.00003444537,"about_ca_system_score_gemma":0.000103462364,"threshold_uncertainty_score":0.999979},"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":"W4391127893","doi":"10.61091/jcmcc117-06","title":"On Regular Distance Magic Graphs of Odd Order","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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; MAGIC (telescope); Order (exchange); Combinatorics; Discrete mathematics; Business; Physics; Astronomy","score_opus":0.012910544011925758,"score_gpt":0.242308400404577,"score_spread":0.22939785639265123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127893","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94665146,0.00039937042,0.030477233,0.0005166336,0.020499304,0.00028080356,0.000002223194,0.00016789557,0.0010050709],"genre_scores_gemma":[0.98939764,0.000054255393,0.010372474,0.000033780772,0.00009998953,8.462058e-7,7.6634035e-7,0.000024395378,0.000015876021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970188,0.00012045762,0.0012170705,0.0002814122,0.0009914278,0.0003708321],"domain_scores_gemma":[0.99636894,0.0008765915,0.0012263923,0.00049276487,0.0008442855,0.00019102266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002185205,0.00026964184,0.00073972275,0.00047923185,0.00020848117,0.00017542105,0.0008527421,0.00013369552,0.0000026018138],"category_scores_gemma":[0.00061659317,0.00022703485,0.00020453926,0.0015659094,0.0001221947,0.00023052271,0.00033048543,0.00039578087,0.000007621923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003289323,0.00030597934,0.000049053426,0.00013095692,0.000059115908,0.00003071071,0.00059821573,0.00023671593,0.0006331846,0.99614954,0.00085864484,0.0009149729],"study_design_scores_gemma":[0.00254319,0.0008181861,0.00005573196,0.00047411013,0.000030799583,0.000038532417,0.00007907475,0.020156413,0.0011428777,0.97418785,0.00024778873,0.00022544013],"about_ca_topic_score_codex":0.000004147169,"about_ca_topic_score_gemma":9.0797e-8,"teacher_disagreement_score":0.04274615,"about_ca_system_score_codex":0.000029321063,"about_ca_system_score_gemma":0.00012102275,"threshold_uncertainty_score":0.92582124},"labels":[],"label_agreement":null},{"id":"W4391148156","doi":"10.55016/ojs/cdm.v18i2.62607","title":"Resolvability in Hypergraphs","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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","score_opus":0.015678541215553475,"score_gpt":0.29367569208763117,"score_spread":0.2779971508720777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391148156","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.43461895,0.00016049316,0.53510654,0.021885045,0.00059983775,0.0012225185,0.00014682903,0.0020064223,0.0042534],"genre_scores_gemma":[0.9666509,0.0000110159535,0.03273264,0.00021079423,0.0000058724745,0.00009720982,0.000013754566,0.000009685168,0.000268109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985886,0.00005525315,0.00038028724,0.0003209264,0.00024297323,0.00041194627],"domain_scores_gemma":[0.99857396,0.00023483852,0.00004973226,0.000827596,0.00015954136,0.0001543627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010080718,0.00012438526,0.00021179026,0.0003682169,0.00014660213,0.000103217295,0.00056058465,0.000062659805,0.0000076991155],"category_scores_gemma":[0.0009530464,0.000109235414,0.00008057541,0.0025987802,0.000047943333,0.00014829825,0.00031802003,0.00012141663,0.0006046554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015358991,0.00007583124,0.00039271583,0.000022360779,0.0000072965936,0.000007914515,0.00086427695,0.00061940326,0.0013233502,0.99259377,0.0034718818,0.0006196608],"study_design_scores_gemma":[0.00045491668,0.000054813816,0.0026040173,0.00009651143,0.0000067481337,0.000004702507,0.00011828452,0.094170734,0.0012269848,0.89867437,0.0023207702,0.00026716746],"about_ca_topic_score_codex":0.00001610904,"about_ca_topic_score_gemma":0.000018207691,"teacher_disagreement_score":0.53203195,"about_ca_system_score_codex":0.000050047398,"about_ca_system_score_gemma":0.0000531031,"threshold_uncertainty_score":0.7771824},"labels":[],"label_agreement":null},{"id":"W4391148187","doi":"10.55016/ojs/cdm.v18i2.70912","title":"Total dominator total coloring of a graph","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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; Fractional coloring; List coloring; Complete coloring; Total coloring; Edge coloring; Graph coloring; Greedy coloring; Graph; Graph power; Line graph","score_opus":0.012886857894524775,"score_gpt":0.27473355643379,"score_spread":0.26184669853926523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391148187","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5856014,0.00008672665,0.40986246,0.001890523,0.00047248355,0.00053258246,0.00016481178,0.00060245744,0.000786582],"genre_scores_gemma":[0.9709804,0.000004925846,0.02847102,0.000034595865,0.0000092648825,0.000068475776,0.000011003505,0.000011293456,0.00040903996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858207,0.00003239246,0.00043313095,0.00026126005,0.00031276673,0.00037838882],"domain_scores_gemma":[0.998565,0.00023000881,0.0001228511,0.0006113233,0.0002933227,0.00017747078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005562154,0.00014461722,0.00028886044,0.00031136652,0.00018475871,0.00008031677,0.00041199411,0.00006370158,0.0000093590315],"category_scores_gemma":[0.0005506359,0.0001280902,0.00014454233,0.0016753301,0.00006656996,0.00015894917,0.00039196567,0.0000945684,0.00021502523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036229758,0.00007339579,0.000029254763,0.000055293258,0.000038538405,0.000008696649,0.0011422925,0.0009735352,0.011502736,0.9838758,0.0018774262,0.00041942287],"study_design_scores_gemma":[0.0019815087,0.00047866904,0.0015575534,0.0005335802,0.00009833219,0.00010037899,0.0007210026,0.22642171,0.043810904,0.72281516,0.0005885698,0.00089261465],"about_ca_topic_score_codex":0.000007961328,"about_ca_topic_score_gemma":0.0000010863336,"teacher_disagreement_score":0.38537902,"about_ca_system_score_codex":0.00003143269,"about_ca_system_score_gemma":0.000061826555,"threshold_uncertainty_score":0.5223367},"labels":[],"label_agreement":null},{"id":"W4392059732","doi":"10.33044/revuma.3154","title":"Summing the largest prime factor over integer sequences","year":2024,"lang":"es","type":"article","venue":"Revista de la Unión Matemática Argentina","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Prime factor; Integer (computer science); Factor (programming language); Prime (order theory); Mathematics; Combinatorics; Computer science; Programming language","score_opus":0.012452849034134838,"score_gpt":0.283547290301628,"score_spread":0.27109444126749316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392059732","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8529725,0.09680822,0.025172379,0.008785229,0.0032609503,0.0012000409,0.00015751985,0.0016633926,0.009979739],"genre_scores_gemma":[0.993761,0.0022065274,0.0016388913,0.00042938266,0.00009042871,0.000021392907,0.000009237742,0.000061333565,0.0017818087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99598753,0.0008504999,0.0007102185,0.000906774,0.00062746357,0.0009175072],"domain_scores_gemma":[0.997392,0.0009006634,0.00018690719,0.0011062669,0.00014463351,0.00026954286],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0022075155,0.00048449836,0.00043664142,0.00024279363,0.0004726554,0.005639418,0.0013406373,0.00023821912,0.00046887828],"category_scores_gemma":[0.0002682102,0.0003236747,0.00034240834,0.0012127024,0.00048744696,0.00048718206,0.0005743268,0.00076424284,0.000808424],"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.00000589804,0.00012419542,0.004257722,0.0009127835,0.00016253258,0.00025915066,0.00073833583,0.000016002954,0.009009688,0.97594213,0.0050478424,0.003523708],"study_design_scores_gemma":[0.00030823675,0.00013616656,0.005885793,0.0049898257,0.00028094678,0.00026196052,0.00010515685,0.04991677,0.0044017634,0.02091194,0.9117555,0.0010459496],"about_ca_topic_score_codex":0.00009115939,"about_ca_topic_score_gemma":0.0000012670039,"teacher_disagreement_score":0.9550302,"about_ca_system_score_codex":0.000111410576,"about_ca_system_score_gemma":0.00037285453,"threshold_uncertainty_score":0.99996954},"labels":[],"label_agreement":null},{"id":"W4392191377","doi":"10.18280/mmep.110222","title":"Fuzzy Anti-Magic Labeling on Comb and Twing Graphs","year":2024,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","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":"MAGIC (telescope); Fuzzy logic; Computer science; Artificial intelligence; Mathematics; Physics; Astronomy","score_opus":0.019999405997964043,"score_gpt":0.20955746183541424,"score_spread":0.1895580558374502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392191377","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.14318398,0.0041326634,0.8500478,0.0005505632,0.0002676833,0.00016386349,0.0000012530301,0.0010004239,0.00065176934],"genre_scores_gemma":[0.8972777,0.00024520323,0.102297485,0.00006240508,0.000010209903,0.000012512143,9.815868e-7,0.000031604788,0.000061910876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854,0.000015742686,0.00032306122,0.0005112306,0.00023474474,0.00037524797],"domain_scores_gemma":[0.9992235,0.0002643905,0.000023172062,0.00028558637,0.000029099305,0.00017426642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054696505,0.00024856732,0.00027234267,0.00025691924,0.000115558185,0.0005104361,0.0001837203,0.00009248677,0.0000016002624],"category_scores_gemma":[0.000025064108,0.00020436,0.000057297395,0.00034485912,0.000041874748,0.00021890145,0.00011437159,0.0003220701,0.000031017677],"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":[4.900507e-7,0.000022279128,0.0000036600716,0.0006141838,0.000021213116,0.000009949002,0.00059728714,0.34155598,0.0009985394,0.6551568,0.000018292907,0.0010013173],"study_design_scores_gemma":[0.00008637573,0.000038528728,0.0000010846928,0.0008662248,0.000010861746,0.00003432765,0.000004836753,0.66250575,0.00013804824,0.33602273,0.00011670791,0.00017454624],"about_ca_topic_score_codex":0.000005758437,"about_ca_topic_score_gemma":6.1575776e-8,"teacher_disagreement_score":0.7540937,"about_ca_system_score_codex":0.000009739318,"about_ca_system_score_gemma":0.000010385129,"threshold_uncertainty_score":0.8333559},"labels":[],"label_agreement":null},{"id":"W4392199470","doi":"10.18280/mmep.110225","title":"Pell Labeling in Special Graph Classes: An Exploration of Cycles, Stars, and Related Structures","year":2024,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","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":"Stars; Graph; Computer science; Psychology; Combinatorics; Mathematics; Computer vision","score_opus":0.03184347847797924,"score_gpt":0.23283774387950537,"score_spread":0.20099426540152612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392199470","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.27395302,0.0016643739,0.723684,0.00009856739,0.00015817923,0.00013414068,0.0000014073922,0.00021390358,0.00009240031],"genre_scores_gemma":[0.88479346,0.00024576418,0.114899285,0.0000044572644,0.000014799261,0.000007620243,0.000002718828,0.000018129904,0.000013746441],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881876,0.000022237,0.00042107326,0.00034867993,0.0001752236,0.00021402794],"domain_scores_gemma":[0.99954665,0.000104163795,0.000034351127,0.00019338049,0.000028752325,0.000092708426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004542512,0.000161078,0.00022759286,0.0002790673,0.000038311016,0.00017816474,0.0001300438,0.00009905409,0.0000030005879],"category_scores_gemma":[0.000018058374,0.00013959449,0.000029781238,0.00035632093,0.000037653055,0.00069815025,0.000059010225,0.0002199889,0.0000017383029],"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.0000011834587,0.000020198515,0.000003954077,0.00045531182,0.000009675693,0.000004268106,0.0027269542,0.5287516,0.0012717688,0.4658343,0.0000031792397,0.0009176227],"study_design_scores_gemma":[0.0000836391,0.000032556392,0.0000026482257,0.00031938913,0.000005633861,0.000008666936,0.00002630974,0.568197,0.00014678483,0.43107343,0.00001177109,0.00009214021],"about_ca_topic_score_codex":0.000014233853,"about_ca_topic_score_gemma":0.0000015122324,"teacher_disagreement_score":0.61084044,"about_ca_system_score_codex":0.0000093065855,"about_ca_system_score_gemma":0.000014716605,"threshold_uncertainty_score":0.56924975},"labels":[],"label_agreement":null},{"id":"W4392733148","doi":"10.1017/9781108874144.017","title":"Combinatorial applications","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.015721735518161837,"score_gpt":0.1926229667973629,"score_spread":0.17690123127920107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392733148","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.000001937124,0.00042496735,0.009488768,0.000053154527,0.0010547831,0.0003580063,0.00006311355,0.0006571624,0.9878981],"genre_scores_gemma":[0.00044561163,0.000051791732,0.00060355215,0.000059403857,0.000052940133,0.0000023637106,0.000019657458,0.000029254874,0.9987354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986336,0.000013450912,0.00016700283,0.0006789863,0.00028437361,0.00022253903],"domain_scores_gemma":[0.99856937,0.000046361918,0.00011332281,0.0009381186,0.00015963078,0.0001731896],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0000931251,0.00028125293,0.0002568458,0.00023861753,0.00019631245,0.00014797277,0.001118105,0.00029323352,0.0000012586054],"category_scores_gemma":[0.0000017301189,0.0003215782,0.00020427775,0.000021625947,0.00015079588,0.000092087415,0.0008406493,0.00046109394,0.0001704687],"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.0000037838495,0.0000069269245,4.9806662e-8,0.00004957119,0.00006391086,0.00009341052,0.000015203895,0.0000017406359,0.000019969772,0.9692744,0.02956851,0.00090252346],"study_design_scores_gemma":[0.00024646384,0.000028557242,1.4973602e-7,0.00009355551,0.00008818072,0.000012687657,0.0000019952454,0.00034106898,0.00010211436,0.023068208,0.9756832,0.0003338295],"about_ca_topic_score_codex":0.00003508035,"about_ca_topic_score_gemma":2.4165897e-7,"teacher_disagreement_score":0.9462062,"about_ca_system_score_codex":0.000086397806,"about_ca_system_score_gemma":0.00011199229,"threshold_uncertainty_score":0.99992365},"labels":[],"label_agreement":null},{"id":"W4394737032","doi":"10.4230/lipics.itcs.2025.89","title":"Optimal Communication Complexity of Chained Index","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Index (typography); Communication complexity; Computer science; Mathematics; Algorithm; World Wide Web","score_opus":0.10204601405692855,"score_gpt":0.20259423470847596,"score_spread":0.10054822065154741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394737032","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7266452,0.0005644683,0.26661745,0.00063436263,0.0005887465,0.00030768875,0.000025899782,0.0005383328,0.0040778946],"genre_scores_gemma":[0.9911862,0.00010859294,0.008072744,0.00004665488,0.0000050912417,6.277221e-7,0.00001913968,0.000012174222,0.0005487483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985885,0.00014937767,0.00025078378,0.0006969318,0.000103198436,0.00021121146],"domain_scores_gemma":[0.9975676,0.00006684333,0.00024583022,0.0017922727,0.00022367263,0.000103762424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036899807,0.00021897262,0.0003102605,0.00033291164,0.00010388602,0.00007543747,0.0019290134,0.00022326315,0.000015417841],"category_scores_gemma":[0.000017870612,0.00024346971,0.00019724623,0.00067969825,0.00034781412,0.00011478901,0.004830409,0.0006479673,0.0000514306],"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.000011286591,0.000069212285,0.00029066013,0.000114469556,0.00006577335,0.000024699928,0.00025814475,0.15872763,0.00005998307,0.83994126,0.00030162497,0.00013525972],"study_design_scores_gemma":[0.00016749844,0.000021909735,0.00022769299,0.00013476842,0.000026872856,0.0000016218547,0.00002453209,0.546803,0.00014656234,0.45223644,0.000048150738,0.00016097129],"about_ca_topic_score_codex":0.00038939182,"about_ca_topic_score_gemma":0.000028393402,"teacher_disagreement_score":0.38807535,"about_ca_system_score_codex":0.0000652108,"about_ca_system_score_gemma":0.00015981586,"threshold_uncertainty_score":0.99284065},"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":"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":"W4395443554","doi":"10.48550/arxiv.2404.14940","title":"Defective and Clustered Colouring of Graphs with Given Girth","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Australian Government","keywords":"Girth (graph theory); Combinatorics; Mathematics","score_opus":0.03617265969134468,"score_gpt":0.1642033243124293,"score_spread":0.12803066462108462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395443554","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9656763,0.00037132387,0.031656664,0.00008083345,0.00024392421,0.00026061563,0.000011886837,0.00020654516,0.001491893],"genre_scores_gemma":[0.99717355,0.00010173213,0.002350664,0.000026799153,0.0000032472913,8.2557585e-7,0.0000022715885,0.000014313513,0.0003265912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985451,0.00008363776,0.0001522582,0.0009102153,0.00008654215,0.00022222224],"domain_scores_gemma":[0.9988047,0.00008433953,0.00017847678,0.0006493848,0.00016139148,0.00012170503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019283527,0.000241133,0.0003138046,0.00039633608,0.000086268534,0.00007707622,0.00058683014,0.00016392715,0.0000027532728],"category_scores_gemma":[0.000009473612,0.00022661584,0.00011467723,0.0006392613,0.0001946585,0.000115875235,0.0020723622,0.00044838226,0.000008459835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099163306,0.000112862464,0.0090589775,0.0006614096,0.00047319976,0.00049572234,0.0014552678,0.08751336,0.00019459083,0.8990995,0.00017610681,0.0006598371],"study_design_scores_gemma":[0.0008045904,0.00028865004,0.0018685741,0.00072315364,0.00019909273,0.000021496924,0.00013299781,0.18544807,0.0007335939,0.80924153,0.000037854832,0.00050037995],"about_ca_topic_score_codex":0.00018874838,"about_ca_topic_score_gemma":0.00006044891,"teacher_disagreement_score":0.09793471,"about_ca_system_score_codex":0.000039509883,"about_ca_system_score_gemma":0.00012411708,"threshold_uncertainty_score":0.92411256},"labels":[],"label_agreement":null},{"id":"W4395687853","doi":"10.20382/jocg.v11i1a9","title":"Expected complexity of routing in $\\Theta_6$ and half-$\\Theta_6$ graphs","year":2020,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Agence Nationale de la Recherche","keywords":"Theta function; Combinatorics; Mathematics; Psychology; Pure mathematics","score_opus":0.35128389359031303,"score_gpt":0.5006933731427237,"score_spread":0.14940947955241063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395687853","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9854213,0.008089863,0.0031263432,0.0012391539,0.00026139026,0.00039509693,0.00001073282,0.000094712675,0.0013614077],"genre_scores_gemma":[0.9937359,0.0011629459,0.004534695,0.0005033226,0.000012400359,0.000010735895,0.0000029188166,0.000024071182,0.000012995339],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99666905,0.0003949962,0.0011702192,0.00066504045,0.000673018,0.00042766647],"domain_scores_gemma":[0.99757373,0.0002773908,0.00091883144,0.0005766012,0.00029525303,0.00035816166],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013463366,0.00031254755,0.00091163104,0.0007359729,0.00019378356,0.0008070559,0.0032780105,0.000101185135,0.0003994587],"category_scores_gemma":[0.0003362338,0.0002831895,0.00017039821,0.0023634029,0.00031879332,0.0020198233,0.0018611883,0.0004420231,0.0000046677847],"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.0001754638,0.0005566774,0.68934935,0.00022513264,0.0002194753,0.000088171866,0.0038470668,0.00046456873,0.22052668,0.06589376,0.003994657,0.014658975],"study_design_scores_gemma":[0.0022319807,0.000064786735,0.6573536,0.0008521294,0.000058869948,0.000035787158,0.00024651556,0.0173304,0.04093715,0.2795701,0.00040687417,0.00091181154],"about_ca_topic_score_codex":0.00104281,"about_ca_topic_score_gemma":0.000059018505,"teacher_disagreement_score":0.21367635,"about_ca_system_score_codex":0.000023148074,"about_ca_system_score_gemma":0.00009785325,"threshold_uncertainty_score":0.99996203},"labels":[],"label_agreement":null},{"id":"W4396212950","doi":"10.61091/jcmcc119-17","title":"Computing Metric Dimension of Two Types of Claw-free Cubic Graphs with Applications","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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":"Combinatorics; Metric dimension; Vertex (graph theory); Mathematics; Embedding; Graph; Discrete mathematics; Computer science; Line graph; Artificial intelligence; Pathwidth","score_opus":0.011428518929651315,"score_gpt":0.2531279304407938,"score_spread":0.24169941151114246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396212950","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69339806,0.0051092566,0.29080385,0.00022354169,0.00915463,0.0005435954,0.000003830074,0.00014789964,0.0006153055],"genre_scores_gemma":[0.93343294,0.000043804732,0.06635694,0.000008897484,0.00012816695,0.0000012689089,6.666432e-7,0.000025166597,0.0000021572291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969961,0.00011020639,0.001395814,0.0003041587,0.00090715685,0.00028656737],"domain_scores_gemma":[0.9959539,0.0011654022,0.0012110297,0.0005473575,0.00096106925,0.00016120783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019266979,0.00027494767,0.0008504636,0.000731836,0.00018037675,0.00018961268,0.000919807,0.00011081749,0.0000013112578],"category_scores_gemma":[0.00017524976,0.00021176127,0.00021298222,0.0018594454,0.00016210767,0.00028135057,0.00047437337,0.00043007618,0.0000010442694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021817537,0.00035901085,0.00012086682,0.00048923766,0.00016934359,0.000012232142,0.00066213193,0.00057161256,0.002023369,0.9924678,0.00007673476,0.003025816],"study_design_scores_gemma":[0.0025417123,0.00095924654,0.000023312945,0.0011648785,0.0001600977,0.00013109417,0.000089822795,0.06319494,0.0047472785,0.9266562,0.00009722929,0.0002342102],"about_ca_topic_score_codex":0.000016483109,"about_ca_topic_score_gemma":2.5126766e-7,"teacher_disagreement_score":0.24003485,"about_ca_system_score_codex":0.000034039527,"about_ca_system_score_gemma":0.00021671888,"threshold_uncertainty_score":0.86353743},"labels":[],"label_agreement":null},{"id":"W4396213274","doi":"10.61091/jcmcc119-26","title":"The Integer-Magic Spectra of Trees","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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; MAGIC (telescope); Integer (computer science); Graph; Spectral line; Vertex (graph theory); Mathematics; Physics; Computer science; Quantum mechanics","score_opus":0.012112439385698472,"score_gpt":0.24671071111428486,"score_spread":0.23459827172858638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396213274","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65961087,0.02304685,0.19269094,0.003359987,0.1160848,0.000636422,0.0000027738852,0.00033808863,0.004229262],"genre_scores_gemma":[0.9916253,0.00015085889,0.00789429,0.000012304411,0.00028391977,5.4376136e-7,1.3985887e-7,0.00001787525,0.000014771861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750704,0.00010753557,0.0011781685,0.00020873838,0.00070732046,0.0002911876],"domain_scores_gemma":[0.9967814,0.0015999752,0.0006400421,0.00036068627,0.0004806438,0.00013725665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026594368,0.00021893758,0.000512488,0.00022063851,0.0002530714,0.00063801126,0.0009231897,0.00009628976,0.0000016303757],"category_scores_gemma":[0.00036859952,0.00014125039,0.00024039096,0.0005984435,0.00015940487,0.00028850167,0.00031530304,0.0004928188,0.000003311136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001301823,0.00013446697,0.000020227775,0.00010633193,0.000092320115,0.000023617922,0.0009315711,0.000032101863,0.0009768328,0.99266905,0.0005300319,0.0044704545],"study_design_scores_gemma":[0.00083628844,0.00055084296,0.000021004016,0.00055371394,0.00004603698,0.00014874591,0.00013661808,0.04002087,0.0017335061,0.9543335,0.0014643649,0.00015449863],"about_ca_topic_score_codex":0.0000055677924,"about_ca_topic_score_gemma":4.1448826e-7,"teacher_disagreement_score":0.3320144,"about_ca_system_score_codex":0.000036295653,"about_ca_system_score_gemma":0.0001948072,"threshold_uncertainty_score":0.61523575},"labels":[],"label_agreement":null},{"id":"W4396214823","doi":"10.61091/jcmcc119-32","title":"Locating Chromatic Number of Middle Graph of Path, Cycle, Star, Wheel, Gear and Helm Graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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; Chromatic scale; Vertex (graph theory); Mathematics; Graph; Partition (number theory); Wheel graph; Discrete mathematics; Graph power","score_opus":0.012644731587118936,"score_gpt":0.24207284508501922,"score_spread":0.2294281134979003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396214823","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9795604,0.0026295476,0.009501783,0.00008759798,0.007713709,0.00019656897,0.0000023694022,0.00006243554,0.0002455984],"genre_scores_gemma":[0.9661597,0.00012249287,0.03357738,0.000010959545,0.00009712069,0.0000011224453,4.796751e-7,0.0000282059,0.0000025210793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99667376,0.00014141314,0.0016992755,0.00030913597,0.0008446049,0.0003318103],"domain_scores_gemma":[0.99671054,0.0009124677,0.0011727869,0.00036751045,0.0006323376,0.00020438072],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023039682,0.00030849295,0.00094433385,0.0003659034,0.00017492118,0.00027334385,0.0005733671,0.0001579062,0.0000035250368],"category_scores_gemma":[0.0002633419,0.00026268288,0.00023865767,0.00086487096,0.00020286899,0.00040488018,0.00038892202,0.0004350132,0.0000012907069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018661098,0.0003417899,0.00016394006,0.0017622575,0.00015364452,0.000024932891,0.003087538,0.000033176533,0.0021963618,0.9905578,0.00006200197,0.0015979022],"study_design_scores_gemma":[0.001675521,0.000664773,0.00004514426,0.002405346,0.00010860271,0.00021785845,0.00027498958,0.041347668,0.0018982135,0.951082,0.000027391628,0.00025250053],"about_ca_topic_score_codex":0.000026063539,"about_ca_topic_score_gemma":2.0020909e-7,"teacher_disagreement_score":0.04131449,"about_ca_system_score_codex":0.000025331583,"about_ca_system_score_gemma":0.00016960794,"threshold_uncertainty_score":0.99998254},"labels":[],"label_agreement":null},{"id":"W4396214824","doi":"10.61091/jcmcc119-30","title":"Harmonious Labelings of Families of Disjoint Unions of an Odd Cycle and Certain Trees","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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; Disjoint sets; Neighbourhood (mathematics); Path (computing); Graph; Tree (set theory); Function (biology); Discrete mathematics; Computer science","score_opus":0.012094427113017428,"score_gpt":0.24716611964144164,"score_spread":0.23507169252842422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396214824","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9871841,0.0017540224,0.0059932666,0.00013859944,0.0046413625,0.00013482595,0.0000043777945,0.00003657524,0.00011289097],"genre_scores_gemma":[0.9825097,0.00014297462,0.017242553,0.0000063737957,0.00007651995,5.725762e-7,6.19657e-7,0.000018700726,0.000002006229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973864,0.00012688446,0.0014251049,0.00023278108,0.00060760044,0.00022121111],"domain_scores_gemma":[0.9971897,0.00075292814,0.0009706448,0.0003144396,0.000612375,0.0001599167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018251007,0.00022496447,0.00083328516,0.00039830236,0.00011176196,0.00013408357,0.0005037742,0.000120379336,0.0000011143302],"category_scores_gemma":[0.00026259111,0.00018594768,0.00016436937,0.0005464909,0.00020811433,0.00033163882,0.0003227065,0.00029600793,1.7822089e-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.000027418522,0.00048874796,0.00010047873,0.0005819103,0.00011514638,0.000011871005,0.003765575,0.00016596248,0.011772564,0.97882074,0.000029594861,0.004119986],"study_design_scores_gemma":[0.0018275592,0.0014699036,0.00011950843,0.0012393425,0.0001013705,0.00007335567,0.0005008004,0.07969337,0.013371444,0.9013575,0.00004817929,0.00019770513],"about_ca_topic_score_codex":0.000058607802,"about_ca_topic_score_gemma":8.413253e-7,"teacher_disagreement_score":0.07952741,"about_ca_system_score_codex":0.00001846975,"about_ca_system_score_gemma":0.0001578488,"threshold_uncertainty_score":0.75827265},"labels":[],"label_agreement":null},{"id":"W4396830254","doi":"10.14445/22315373/ijmtt-v70i4p105","title":"Heinz Quarter Mean Labeling of Some Special Graphs","year":2024,"lang":"en","type":"article","venue":"International Journal of Mathematics Trends and Technology","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":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Quarter (Canadian coin); Combinatorics; Statistics; Geography","score_opus":0.010532320902117996,"score_gpt":0.2569648855040761,"score_spread":0.2464325646019581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396830254","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84435064,0.011807291,0.07341023,0.05773801,0.008783013,0.00009680841,0.000020972144,0.00038283132,0.0034101822],"genre_scores_gemma":[0.93652445,0.00021466352,0.063055724,0.0000370645,0.00008177403,8.1846497e-7,4.7109478e-7,0.0000068299187,0.00007818598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989781,0.0000094540255,0.00048295734,0.00011795078,0.0003120526,0.00009951182],"domain_scores_gemma":[0.9992781,0.00007443315,0.00021435505,0.00013462934,0.00026399473,0.000034475757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031897725,0.000086591135,0.00019165143,0.0013565517,0.0000217594,0.0000807065,0.00055749033,0.000077177996,0.000018598548],"category_scores_gemma":[0.00003272827,0.00006532668,0.00008385786,0.00038043995,0.00009153178,0.00022987094,0.00011671918,0.00018241262,0.0000038184658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018607832,0.00007890055,0.000048300677,0.000019450956,0.00013452733,0.00006996308,0.00050135975,0.000006030407,0.0032304444,0.93281674,0.0007289533,0.062363453],"study_design_scores_gemma":[0.00029334667,0.00017116552,0.000012775185,0.000263689,0.00002060961,0.00065999076,0.00011548638,0.0053547886,0.004213698,0.9875594,0.0012573107,0.000077754536],"about_ca_topic_score_codex":0.0000015548942,"about_ca_topic_score_gemma":0.000001851535,"teacher_disagreement_score":0.09217381,"about_ca_system_score_codex":0.000010887453,"about_ca_system_score_gemma":0.000029933688,"threshold_uncertainty_score":0.26639447},"labels":[],"label_agreement":null},{"id":"W4399425163","doi":"10.1016/j.disc.2024.114103","title":"Circular external difference families, graceful labellings and cyclotomy","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.01264351024282437,"score_gpt":0.23448091944222596,"score_spread":0.2218374091994016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399425163","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.31307608,0.0048202407,0.6795735,0.0005095923,0.00031860033,0.00017001774,0.000005269768,0.0005223174,0.0010044235],"genre_scores_gemma":[0.8709161,0.00045909677,0.12775727,0.00017105069,0.000014336714,0.000019426778,0.000002398511,0.00002475731,0.00063551666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871486,0.000024174473,0.00027576997,0.00040046533,0.00032051583,0.00026422285],"domain_scores_gemma":[0.99918306,0.00013309658,0.000049694947,0.0004713978,0.000041884425,0.000120856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028750714,0.00018785127,0.0001971324,0.00013532971,0.00011308867,0.0005209269,0.00041878538,0.000061826715,0.0000076058964],"category_scores_gemma":[0.000029007862,0.00014449398,0.00006774519,0.00034256763,0.00009067252,0.00019383055,0.00022451482,0.00017001992,0.00006480925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.6489437e-7,0.00004229038,0.00017593197,0.0005576193,0.000035199046,0.00007688814,0.0040204385,0.000020784371,0.007218867,0.97729987,0.00021426895,0.010337098],"study_design_scores_gemma":[0.00014301606,0.00004155122,0.00015018402,0.00053198443,0.000026638101,0.00010160346,0.00009283671,0.29433998,0.0016427464,0.7013599,0.0012786924,0.0002908302],"about_ca_topic_score_codex":0.000016726619,"about_ca_topic_score_gemma":8.968686e-7,"teacher_disagreement_score":0.55784005,"about_ca_system_score_codex":0.000011325863,"about_ca_system_score_gemma":0.000029026052,"threshold_uncertainty_score":0.58922935},"labels":[],"label_agreement":null},{"id":"W4399544156","doi":"10.1007/s00493-024-00109-z","title":"List-Avoiding Orientations","year":2024,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.00929819383538542,"score_gpt":0.2415265926093738,"score_spread":0.2322283987739884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399544156","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.12188036,0.02265543,0.6958832,0.021245997,0.031436168,0.0005979872,0.0000067180113,0.009473409,0.096820705],"genre_scores_gemma":[0.9953323,0.00002835009,0.0032905133,0.00016719883,0.000007884521,0.000012278112,0.0000014262059,0.000007731456,0.0011523459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920136,0.000038262486,0.00013140916,0.0002826092,0.00017201577,0.00017435402],"domain_scores_gemma":[0.9993891,0.00013527271,0.000016122913,0.00032234113,0.00005370924,0.00008346393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022349879,0.00007743936,0.00007200715,0.0001351794,0.00021071952,0.0002965185,0.00035567235,0.000033004013,0.000016381706],"category_scores_gemma":[0.00004848984,0.00006917705,0.000051769053,0.0009852577,0.000021278336,0.0002907586,0.00012529329,0.00015795119,0.0002882508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.5258358e-7,0.000022203783,0.000053371197,0.000010509699,0.0000064294063,0.000017296261,0.00035588528,0.0000053160993,0.00060635956,0.98156595,0.01399628,0.0033602165],"study_design_scores_gemma":[0.00012217634,0.00004934382,0.00008441002,0.000047980746,0.0000070048677,0.000016242966,0.000021827636,0.021370713,0.0013598854,0.8942739,0.0824893,0.00015722886],"about_ca_topic_score_codex":0.000011501144,"about_ca_topic_score_gemma":2.3199476e-7,"teacher_disagreement_score":0.8734519,"about_ca_system_score_codex":0.00003190287,"about_ca_system_score_gemma":0.000051544495,"threshold_uncertainty_score":0.37049767},"labels":[],"label_agreement":null},{"id":"W4400484687","doi":"10.61091/jcmcc120-33","title":"Total Labelings of Graphs with Prescribed Weights","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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","score_opus":0.009556581239050642,"score_gpt":0.22686533130350378,"score_spread":0.21730875006445313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400484687","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9520935,0.0030029367,0.028355664,0.00028421628,0.0153326625,0.00024311367,0.0000016272045,0.00013910676,0.0005471848],"genre_scores_gemma":[0.96486354,0.000038869992,0.03490389,0.000012282305,0.00014606724,0.0000010132476,3.9219358e-7,0.00002550061,0.000008470308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973454,0.000080965474,0.0011064702,0.0002900701,0.0008652045,0.00031192394],"domain_scores_gemma":[0.997469,0.00061716273,0.0006776596,0.00033265958,0.0007067955,0.00019673794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014305019,0.0002797861,0.0006930224,0.00041130942,0.00016053142,0.00040579913,0.0005986593,0.00012859567,0.0000024337353],"category_scores_gemma":[0.00013065642,0.00020225858,0.00019613336,0.0007822581,0.00012605957,0.00045940478,0.00025997104,0.0004600572,0.0000016646529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034235793,0.0002709955,0.00004240821,0.000323411,0.00015816456,0.00005320907,0.001718641,0.000043352935,0.0013870226,0.99437916,0.00015994433,0.0014294705],"study_design_scores_gemma":[0.0020854266,0.0013482012,0.000025011022,0.0013827634,0.000100237725,0.0003280284,0.00007104011,0.027856896,0.0033674329,0.9629211,0.00024751434,0.00026634737],"about_ca_topic_score_codex":0.000010707878,"about_ca_topic_score_gemma":1.1438075e-7,"teacher_disagreement_score":0.031458043,"about_ca_system_score_codex":0.000027945156,"about_ca_system_score_gemma":0.00021904806,"threshold_uncertainty_score":0.82478654},"labels":[],"label_agreement":null},{"id":"W4400486241","doi":"10.61091/jcmcc121-06","title":"Cordial Digraphs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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":"Computer science; Mathematics","score_opus":0.012677258184634395,"score_gpt":0.24674896278712158,"score_spread":0.2340717046024872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400486241","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68079567,0.008214447,0.1729252,0.0015426823,0.13155518,0.00047045102,0.0000026448602,0.00062236167,0.0038713408],"genre_scores_gemma":[0.9811814,0.000076029355,0.018180512,0.00004033962,0.00048598478,9.366373e-7,3.6408412e-7,0.000025002479,0.000009454196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750185,0.00008778339,0.0010281218,0.00029507,0.0007386939,0.00034850946],"domain_scores_gemma":[0.9978515,0.000735356,0.00043159485,0.00032187827,0.00041322145,0.00024646078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018719533,0.00026915452,0.00057280425,0.00041163547,0.00023292119,0.000974257,0.00074358215,0.00014188436,0.000003732392],"category_scores_gemma":[0.00023717627,0.00021981589,0.00026181922,0.00073644455,0.0000928231,0.0005242493,0.00034277595,0.0005431667,0.000008457302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010809359,0.00016908598,0.00002444723,0.00013797452,0.00008732571,0.0000850907,0.0008915903,0.000016600981,0.00061381626,0.9909335,0.000869605,0.006160177],"study_design_scores_gemma":[0.0012785401,0.00056901184,0.000017372087,0.00051377993,0.000053818945,0.0003150346,0.000058121914,0.030336844,0.0005422297,0.9634224,0.0026357616,0.00025709413],"about_ca_topic_score_codex":0.000005779009,"about_ca_topic_score_gemma":8.149498e-8,"teacher_disagreement_score":0.30038568,"about_ca_system_score_codex":0.000040127954,"about_ca_system_score_gemma":0.00020042254,"threshold_uncertainty_score":0.9394783},"labels":[],"label_agreement":null},{"id":"W4400486437","doi":"10.61091/jcmcc121-03","title":"Signed Magic Rectangles With Two Filled Cells in Each Column","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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":"Column (typography); MAGIC (telescope); Combinatorics; Art; Mathematics; Physics; Geometry; Astronomy","score_opus":0.010119436041364855,"score_gpt":0.23641721561882933,"score_spread":0.22629777957746447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400486437","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9421554,0.0021240988,0.028857023,0.0005487371,0.024030296,0.00049193454,0.0000017991842,0.0002175674,0.0015731216],"genre_scores_gemma":[0.9722856,0.0000310712,0.027382588,0.000030120724,0.00022036103,0.0000017866817,4.6424853e-7,0.00003187671,0.000016114964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720263,0.00016490133,0.001090595,0.00036612237,0.0007615263,0.00041420793],"domain_scores_gemma":[0.9976764,0.0009287333,0.0004928129,0.00032479624,0.00037421964,0.00020308112],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00202624,0.00031321292,0.000726634,0.00048267908,0.00015752578,0.00079549314,0.0006733488,0.0001231746,0.000004519138],"category_scores_gemma":[0.000126922,0.00024585222,0.00014273453,0.001024321,0.000089240675,0.0004289196,0.00025743633,0.000622923,0.0000061791684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005093201,0.00037779103,0.000052623334,0.00021345289,0.000078555866,0.00028351397,0.0017433559,0.0002024958,0.002355464,0.99228686,0.00046050793,0.0018944311],"study_design_scores_gemma":[0.0047490634,0.0012119319,0.000014840282,0.0014468392,0.00005710029,0.00028389876,0.0001608784,0.07837636,0.0020986316,0.9106378,0.00055964175,0.0004030022],"about_ca_topic_score_codex":0.00002241499,"about_ca_topic_score_gemma":0.0000016004832,"teacher_disagreement_score":0.081649065,"about_ca_system_score_codex":0.000085342166,"about_ca_system_score_gemma":0.00025886853,"threshold_uncertainty_score":0.99999934},"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":"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":"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":"W4400538358","doi":"10.1137/23m1553273","title":"Graphs with Large Girth and Chromatic Number are Hard for Nullstellensatz","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Chromatic scale; Combinatorics; Girth (graph theory); Discrete mathematics","score_opus":0.015509146590443845,"score_gpt":0.2532355052430149,"score_spread":0.23772635865257108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400538358","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.35545444,0.0026336645,0.6309325,0.0053434144,0.001117269,0.00085487694,0.00004648675,0.0005761971,0.0030411244],"genre_scores_gemma":[0.7671129,0.00020228942,0.23106796,0.0004520403,0.00003887289,0.000024710811,0.0000023614168,0.00006166711,0.0010371566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845874,0.000038463288,0.0003938637,0.000306798,0.00042524887,0.00037690956],"domain_scores_gemma":[0.99886715,0.00026856276,0.00018695678,0.0003696862,0.000103108774,0.00020453152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067342375,0.00023948078,0.00031315486,0.0001637398,0.00028339718,0.0007826106,0.00033439734,0.00006510649,0.000026290878],"category_scores_gemma":[0.000053288233,0.00014904789,0.0001382307,0.00032092287,0.00005883016,0.00031481823,0.0000727791,0.00028713816,0.00006195365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017457629,0.00017387938,0.00020656796,0.0012201793,0.00022021006,0.0001728076,0.003264654,0.00006963664,0.00018428105,0.9851677,0.007844676,0.0014579553],"study_design_scores_gemma":[0.001275,0.00062596163,0.00014140194,0.003719055,0.00011400997,0.0020581267,0.00057963113,0.14098606,0.00040913207,0.845033,0.0045101056,0.00054850575],"about_ca_topic_score_codex":4.0682963e-7,"about_ca_topic_score_gemma":0.000001361681,"teacher_disagreement_score":0.4116585,"about_ca_system_score_codex":0.000019637228,"about_ca_system_score_gemma":0.000052152587,"threshold_uncertainty_score":0.7546732},"labels":[],"label_agreement":null},{"id":"W4400596777","doi":"10.55016/ojs/cdm.v14i1.62665","title":"Distinguishing number and distinguishing index of neighbourhood corona of two graphs","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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; Neighbourhood (mathematics); Automorphism; Mathematics; Vertex (graph theory); Graph; Star (game theory); Discrete mathematics","score_opus":0.008566774733699252,"score_gpt":0.2773433885324417,"score_spread":0.26877661379874246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596777","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67399716,0.00012444981,0.32067406,0.00033335897,0.00023656632,0.0004179641,0.00011000079,0.000103207676,0.0040032417],"genre_scores_gemma":[0.9482863,0.0000035448327,0.051573593,0.000041608015,0.000005467327,0.000008621391,0.000007617322,0.000012013943,0.00006125776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983835,0.000048844937,0.00061587465,0.00030748505,0.00033917357,0.00030512107],"domain_scores_gemma":[0.99789834,0.00042305596,0.00037537646,0.00066026207,0.00049047597,0.0001524682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006666571,0.00017598287,0.00044028813,0.00011538127,0.00012184623,0.00011928717,0.0005018998,0.00006106529,0.000026409023],"category_scores_gemma":[0.0013010753,0.00015522396,0.000100428464,0.00056175434,0.000095809,0.00021675415,0.00043732693,0.00014322023,0.000019626506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030638878,0.000074493066,0.023247616,0.00013780857,0.00003464366,0.000001406514,0.0012527304,0.00017671233,0.00230746,0.97212577,0.000073413656,0.0005648817],"study_design_scores_gemma":[0.0016669835,0.00014804552,0.009062065,0.0010189932,0.000075964206,0.000037579677,0.00030491487,0.10482289,0.0041660047,0.87808514,0.00011113771,0.00050026603],"about_ca_topic_score_codex":0.00009831042,"about_ca_topic_score_gemma":0.000008158369,"teacher_disagreement_score":0.27428913,"about_ca_system_score_codex":0.000022955512,"about_ca_system_score_gemma":0.000053193653,"threshold_uncertainty_score":0.63298494},"labels":[],"label_agreement":null},{"id":"W4400596821","doi":"10.55016/ojs/cdm.v16i1.62717","title":"Coloring permutation-gain graphs","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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; Greedy coloring; Edge coloring; Graph coloring; Fractional coloring; Complete coloring; Discrete mathematics; List coloring; Permutation graph; Graph; Line graph; Graph power","score_opus":0.013859159797262998,"score_gpt":0.2784190764770123,"score_spread":0.2645599166797493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596821","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.026893893,0.00026953866,0.96400636,0.00548477,0.00031189542,0.00023722948,0.000057306126,0.00032458632,0.002414406],"genre_scores_gemma":[0.80181867,0.000014767468,0.19670966,0.0006109692,0.00001114095,0.000073378804,0.00003146284,0.0000133711765,0.00071656035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986346,0.000056808578,0.00035607436,0.00033054972,0.00028065697,0.00034133694],"domain_scores_gemma":[0.9981924,0.00020657436,0.00007988626,0.0006908777,0.0006211937,0.0002090654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037922835,0.00014370037,0.00021540854,0.00012930551,0.00034317104,0.0002692558,0.0003940677,0.000059412643,0.000027687418],"category_scores_gemma":[0.0008610037,0.00013581525,0.00011337615,0.0010273334,0.000038648686,0.00020504603,0.00026066668,0.00011511658,0.0002332026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.816629e-7,0.0000641529,0.00003051056,0.00001683213,0.000021747128,0.000018906592,0.00075605215,0.00054991303,0.0038362967,0.993106,0.0011953271,0.00040369088],"study_design_scores_gemma":[0.0005470521,0.00005677029,0.0001503944,0.000139104,0.000037792943,0.00007321764,0.00033617136,0.07072176,0.021045594,0.90340376,0.0030968364,0.00039154003],"about_ca_topic_score_codex":0.0000040077753,"about_ca_topic_score_gemma":0.000005703797,"teacher_disagreement_score":0.7749248,"about_ca_system_score_codex":0.000052647243,"about_ca_system_score_gemma":0.00014273751,"threshold_uncertainty_score":0.55383855},"labels":[],"label_agreement":null},{"id":"W4402832042","doi":"10.1080/00150517.2014.12427920","title":"Spanning Paths in Fibonacci-Sum Graphs","year":2014,"lang":"en","type":"article","venue":"˜The œFibonacci quarterly","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Fibonacci number; Combinatorics; Mathematics; Discrete mathematics","score_opus":0.009225763928214397,"score_gpt":0.21591586568241966,"score_spread":0.20669010175420527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402832042","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89679295,0.0009169687,0.08359043,0.0056629777,0.0024891265,0.0007195117,0.000004651486,0.0010577892,0.008765572],"genre_scores_gemma":[0.9934932,0.0000045955844,0.0047314637,0.0013117089,0.000031681873,0.000043668777,0.000004135073,0.000025811729,0.0003537391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720824,0.0003012037,0.00056503376,0.0007152939,0.00049173913,0.00071851694],"domain_scores_gemma":[0.997916,0.00030332716,0.0001806092,0.0013305504,0.00009924539,0.00017029957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012860127,0.0003125077,0.00032663287,0.00031822402,0.00029218764,0.0003191374,0.0014580461,0.00013029324,0.00001699039],"category_scores_gemma":[0.00001953415,0.00023673386,0.00017174285,0.0009792912,0.000090464106,0.0004323218,0.00011680964,0.00039609754,0.00031256917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033751705,0.0003233038,0.011667827,0.00004798657,0.00004810929,0.00005871795,0.010203229,0.0004749791,0.0039912006,0.6493554,0.007783642,0.31601182],"study_design_scores_gemma":[0.0022509845,0.0012717835,0.030810062,0.00018243141,0.000022620632,0.00007863859,0.00049183425,0.10352539,0.00029223264,0.8388032,0.021147354,0.0011234821],"about_ca_topic_score_codex":0.00036533753,"about_ca_topic_score_gemma":0.00033416238,"teacher_disagreement_score":0.31488833,"about_ca_system_score_codex":0.000028422277,"about_ca_system_score_gemma":0.00005575965,"threshold_uncertainty_score":0.9653727},"labels":[],"label_agreement":null},{"id":"W4403094255","doi":"10.1016/j.disc.2024.114272","title":"The hat guessing game on cactus graphs and cycles","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Cactus; Combinatorics; Discrete mathematics; Biology","score_opus":0.01584206968029182,"score_gpt":0.2596635021553093,"score_spread":0.2438214324750175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403094255","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6334743,0.023815596,0.28545743,0.024500258,0.0041347905,0.0009428251,0.000017586943,0.0032210494,0.024436131],"genre_scores_gemma":[0.9828343,0.00021240338,0.016286165,0.00018147804,0.000007093795,0.0000096687545,9.933901e-7,0.000017067876,0.0004508326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910724,0.000026385947,0.00018861706,0.00023533028,0.00023362628,0.00020880852],"domain_scores_gemma":[0.9990744,0.0003641628,0.000040298706,0.00043401585,0.000021968843,0.000065154636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036214833,0.0001254917,0.000109083994,0.00007159245,0.00023402915,0.000890317,0.0003047821,0.000036890695,0.000001896621],"category_scores_gemma":[0.00004612726,0.00007055715,0.000057333444,0.00021861344,0.00010538264,0.00014894718,0.00012983556,0.00012670738,0.000048434846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.0797544e-7,0.000010010356,0.0000059293257,0.00006431664,0.000015857197,0.000010040113,0.0019049919,0.00002520107,0.00024508536,0.98374736,0.0006669767,0.01330362],"study_design_scores_gemma":[0.00005958457,0.000033486907,0.000031815074,0.00030110127,0.00001111513,0.000024082807,0.00014408532,0.15320334,0.00066836993,0.843662,0.0017370827,0.00012392101],"about_ca_topic_score_codex":0.0000036738718,"about_ca_topic_score_gemma":0.0000018964888,"teacher_disagreement_score":0.34936,"about_ca_system_score_codex":0.0000071253166,"about_ca_system_score_gemma":0.000016978061,"threshold_uncertainty_score":0.85853475},"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":"W4403165760","doi":"10.61091/jcmcc122-07","title":"On δ ( k ) -colouring of Some Wheel Related Graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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; Computer science","score_opus":0.010859524492380193,"score_gpt":0.23903705778508813,"score_spread":0.22817753329270793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165760","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95797396,0.002224647,0.0052403826,0.00039297916,0.03300157,0.00020791378,0.0000010804623,0.00015206057,0.00080542447],"genre_scores_gemma":[0.99323744,0.00006544432,0.006514698,0.000025075627,0.00012176253,7.99677e-7,2.8599132e-7,0.000026100344,0.000008407029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997115,0.000107650776,0.0013659213,0.00028998096,0.0008083803,0.00031307054],"domain_scores_gemma":[0.997219,0.0010947069,0.0007637383,0.00035157625,0.000386591,0.000184349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021738082,0.00027055765,0.0006899732,0.00057096145,0.00017797019,0.00033603728,0.00069352984,0.0001709501,0.0000029688654],"category_scores_gemma":[0.00033422964,0.00022276062,0.00028170994,0.0007124656,0.00009728245,0.0004397055,0.00028148148,0.00062049105,0.0000045313814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018975808,0.00030655955,0.00001056982,0.00024751638,0.00012564851,0.000055893608,0.0010503838,0.00013556011,0.0013277851,0.9947563,0.00028553625,0.0016792687],"study_design_scores_gemma":[0.0016259648,0.000999285,0.000013318009,0.0012939608,0.000053524982,0.00011854597,0.000044293825,0.029896524,0.0021124515,0.9635164,0.00011286113,0.00021288377],"about_ca_topic_score_codex":0.0000041907397,"about_ca_topic_score_gemma":3.0509298e-8,"teacher_disagreement_score":0.035263482,"about_ca_system_score_codex":0.000044891072,"about_ca_system_score_gemma":0.00016094343,"threshold_uncertainty_score":0.9083914},"labels":[],"label_agreement":null},{"id":"W4403165774","doi":"10.61091/jcmcc122-15","title":"On the Various Energy Forms of the Join of Complete Graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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); Computer science; Mathematics; Combinatorics","score_opus":0.014318268167687453,"score_gpt":0.22534553099681767,"score_spread":0.21102726282913023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165774","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9359817,0.0015622616,0.028583705,0.0015013617,0.030424448,0.00032873545,0.000005014076,0.00006871549,0.0015440682],"genre_scores_gemma":[0.9983204,0.000031048898,0.0014859464,0.000061116916,0.000077684264,0.0000010518876,1.7099966e-7,0.000017545282,0.0000050446383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972608,0.00016787178,0.0012042562,0.00019781789,0.00092210755,0.00024716594],"domain_scores_gemma":[0.9961134,0.0017995862,0.0010187891,0.0005213351,0.0004579723,0.00008891016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020654777,0.00023012141,0.0005867748,0.00021980956,0.00024591386,0.0002053554,0.0011891422,0.00010500851,0.0000022083066],"category_scores_gemma":[0.00032284952,0.00012241332,0.0003616559,0.00081279007,0.00019151102,0.00015110418,0.0004429929,0.00044489425,6.599076e-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.000015375286,0.00021586854,0.000013254174,0.00013262508,0.00010838469,0.0000057376296,0.0008146626,0.00008327405,0.0012375517,0.99608904,0.00043002033,0.0008541838],"study_design_scores_gemma":[0.0008704842,0.0006047003,0.000022853204,0.0008703921,0.000052134685,0.00006496719,0.000057331126,0.025651496,0.0029563534,0.9684239,0.0002956308,0.0001297291],"about_ca_topic_score_codex":0.000015475502,"about_ca_topic_score_gemma":2.7392696e-7,"teacher_disagreement_score":0.0623387,"about_ca_system_score_codex":0.000026956786,"about_ca_system_score_gemma":0.00017150758,"threshold_uncertainty_score":0.49918702},"labels":[],"label_agreement":null},{"id":"W4403165802","doi":"10.61091/jcmcc122-02","title":"Fault Tolerant Metric Dimension of Arithmetic Graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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":"Arithmetic; Dimension (graph theory); Metric (unit); Metric dimension; Mathematics; Computer science; Discrete mathematics; Graph; Combinatorics; Engineering; Pathwidth; Operations management; Line graph","score_opus":0.012797765942900465,"score_gpt":0.2482482476489577,"score_spread":0.23545048170605723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165802","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9133939,0.0065842136,0.044034403,0.00037867358,0.03479611,0.00028165162,0.0000016784152,0.00015261713,0.00037672248],"genre_scores_gemma":[0.9755871,0.00008919109,0.024128953,0.000018981402,0.0001456877,8.350337e-7,3.9863957e-7,0.00002405444,0.0000047435506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99677753,0.0001236768,0.0014647052,0.00031147996,0.0009920427,0.0003305706],"domain_scores_gemma":[0.9966732,0.0012570973,0.0007673488,0.00037166267,0.0007186941,0.00021196541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024075313,0.0002901269,0.0008212898,0.0008493774,0.00017403581,0.00038725228,0.0006964947,0.00015721442,0.000002203862],"category_scores_gemma":[0.00044100452,0.00023033576,0.0003091057,0.0015308671,0.00010306948,0.0003816403,0.0003637284,0.00051036326,0.000002993604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001517748,0.00032742793,0.000044392233,0.00033090866,0.00011873656,0.000054479802,0.00088729087,0.00013813363,0.0018567189,0.99188435,0.00017868192,0.0041636797],"study_design_scores_gemma":[0.0015585594,0.0008413512,0.000027376658,0.0009489862,0.00009910822,0.0002206802,0.000086946166,0.10168211,0.0028362512,0.891186,0.00026747352,0.00024512503],"about_ca_topic_score_codex":0.000010484866,"about_ca_topic_score_gemma":6.303525e-8,"teacher_disagreement_score":0.10154398,"about_ca_system_score_codex":0.000041142448,"about_ca_system_score_gemma":0.00017657607,"threshold_uncertainty_score":0.939282},"labels":[],"label_agreement":null},{"id":"W4403165969","doi":"10.61091/um120-01","title":"Metric Dimension of Corona Product and Join Graph of Zero Divisor Graphs of Direct Product of Finite Fields","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","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; Join (topology); Direct product; Divisor (algebraic geometry); Graph; Product (mathematics); Combinatorics; Dimension (graph theory); Discrete mathematics; Geometry","score_opus":0.020264912095511223,"score_gpt":0.2462064005829108,"score_spread":0.22594148848739956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165969","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96191394,0.022301534,0.012566266,0.00035086085,0.00037653474,0.000752002,0.000041231746,0.00013782163,0.0015597896],"genre_scores_gemma":[0.9751891,0.00015268529,0.024552455,0.000007791804,0.0000020299506,0.000009292506,0.0000018954256,0.000011887568,0.00007284685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794793,0.000096672185,0.0008331022,0.00046051168,0.00046564915,0.0001961189],"domain_scores_gemma":[0.9977567,0.0007689164,0.00028512086,0.000885045,0.0002439415,0.0000602668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011054155,0.00018317865,0.00060240075,0.000674899,0.000031316184,0.000014271868,0.000351813,0.000053024312,0.000013915889],"category_scores_gemma":[0.00066109607,0.00013729277,0.00017252455,0.0017321607,0.00027241994,0.00015548123,0.00023898414,0.00010757064,0.0000019910708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007869583,0.002009398,0.0025590733,0.02069744,0.0007133058,0.0000121484245,0.011484812,0.00028245983,0.11644414,0.8009914,0.003620883,0.04110625],"study_design_scores_gemma":[0.00038906408,0.0007428752,0.0015485589,0.001766254,0.00017663813,0.000015385544,0.000079627695,0.018351294,0.33212203,0.644469,0.000060061942,0.00027919494],"about_ca_topic_score_codex":0.00003902069,"about_ca_topic_score_gemma":0.0000011218319,"teacher_disagreement_score":0.21567789,"about_ca_system_score_codex":0.0000038372996,"about_ca_system_score_gemma":0.000052277082,"threshold_uncertainty_score":0.5598637},"labels":[],"label_agreement":null},{"id":"W4403166031","doi":"10.61091/um120-04","title":"Multiplicative Distance-Location Number of Graphs","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","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; Multiplicative function; Statistics; Combinatorics","score_opus":0.016798825184237122,"score_gpt":0.28155603051923794,"score_spread":0.2647572053350008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403166031","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.058398284,0.002480059,0.9119156,0.001359454,0.00045220737,0.00048261485,0.000015509488,0.00091199944,0.023984285],"genre_scores_gemma":[0.9227862,0.000011492454,0.076902695,0.000030183293,0.000002171988,0.000030863772,0.0000019412223,0.000008317543,0.00022615338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989613,0.00003397988,0.0003114266,0.0003027141,0.00023412515,0.00015645257],"domain_scores_gemma":[0.99895483,0.00020756545,0.000057107474,0.0005987368,0.00012471611,0.000057017907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033227567,0.00010858519,0.00015855712,0.00008037991,0.00004694508,0.000058164132,0.00036243704,0.000040690546,0.000049461607],"category_scores_gemma":[0.000092009286,0.000084775864,0.000080579484,0.0007232261,0.0001016288,0.00020603166,0.00008786215,0.000078084755,0.00032064167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010941992,0.000066154316,0.000044039076,0.0002643428,0.000021916603,0.0000015006475,0.0017479454,0.000003424321,0.00037620967,0.9919946,0.0008173795,0.0046613975],"study_design_scores_gemma":[0.00007455765,0.000017033373,0.00010985653,0.00029078874,0.000011883279,0.000010917903,0.00006891502,0.08708286,0.0014619959,0.9098144,0.00095597847,0.00010081867],"about_ca_topic_score_codex":0.000008483427,"about_ca_topic_score_gemma":6.4968964e-7,"teacher_disagreement_score":0.86438787,"about_ca_system_score_codex":0.000017443735,"about_ca_system_score_gemma":0.000037517864,"threshold_uncertainty_score":0.41213068},"labels":[],"label_agreement":null},{"id":"W4403166143","doi":"10.61091/jcmcc122-26","title":"Chromatic Coloring of Distance Graphs V","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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":"Chromatic scale; Combinatorics; Brooks' theorem; Mathematics; Computer science; Chordal graph; Graph; 1-planar graph","score_opus":0.01245569590072961,"score_gpt":0.24372716943562692,"score_spread":0.2312714735348973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403166143","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8216535,0.005199383,0.13619985,0.00031520505,0.035195056,0.00028847018,0.0000018331318,0.000182687,0.0009640627],"genre_scores_gemma":[0.97806025,0.000070581154,0.021693353,0.000010786921,0.00013791856,0.0000010671525,2.4728368e-7,0.000020986869,0.000004827693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973393,0.000082738254,0.001301212,0.00024881412,0.0007364506,0.00029146436],"domain_scores_gemma":[0.99749327,0.0008251684,0.0007371584,0.00032867992,0.00044682482,0.00016887224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018937844,0.00024257733,0.0006958733,0.00036316377,0.00015976219,0.00037397267,0.0007075513,0.000111621404,0.000002233171],"category_scores_gemma":[0.00025744594,0.00020195397,0.00023211862,0.0008141123,0.00011495056,0.0004289703,0.000285823,0.0003934854,0.0000021066385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000105524405,0.00019487743,0.000037727954,0.0005677911,0.000096475575,0.000038842532,0.0012100236,0.000034884695,0.0014829785,0.9937323,0.00016033716,0.0024332653],"study_design_scores_gemma":[0.0011261125,0.00055365084,0.00002098958,0.0014301947,0.00005992353,0.00013555343,0.00008271095,0.044251803,0.001962537,0.94970375,0.00046595515,0.00020679814],"about_ca_topic_score_codex":0.0000049831096,"about_ca_topic_score_gemma":9.932884e-8,"teacher_disagreement_score":0.15640678,"about_ca_system_score_codex":0.000043402255,"about_ca_system_score_gemma":0.00017230495,"threshold_uncertainty_score":0.8235444},"labels":[],"label_agreement":null},{"id":"W4403166165","doi":"10.61091/jcmcc122-21","title":"On Binary DCP Labeling","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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":"Binary number; Computer science; Mathematics; Arithmetic","score_opus":0.014679229704058886,"score_gpt":0.2545205884666052,"score_spread":0.2398413587625463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403166165","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85353017,0.005471391,0.05317023,0.0018286993,0.08273334,0.0003589947,0.0000022363852,0.00049825205,0.0024067035],"genre_scores_gemma":[0.98029345,0.00006944003,0.01910975,0.00009507778,0.00038590407,0.0000010360386,4.1589314e-7,0.000032085303,0.000012842011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733657,0.00010281936,0.0010295379,0.00033825525,0.0008263202,0.00036648018],"domain_scores_gemma":[0.9973643,0.001212914,0.00043842776,0.00036313912,0.0003846946,0.00023652129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021572863,0.00030085054,0.0005731658,0.00046840357,0.00028080508,0.00083634706,0.0007334018,0.00015383662,0.000004201924],"category_scores_gemma":[0.0003579303,0.00024364426,0.00022012915,0.0006925913,0.0000692354,0.0004163802,0.00033177008,0.00068410614,0.000016585696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001640879,0.0002624281,0.0000056877793,0.00016906652,0.000078842735,0.00012828677,0.0007581292,0.0001605988,0.00094989105,0.99337023,0.001357917,0.0027424854],"study_design_scores_gemma":[0.0013198892,0.0010263348,0.0000055768505,0.00094736484,0.00004256482,0.00017602238,0.00003938302,0.06097052,0.00070117606,0.9330358,0.0014706549,0.0002647418],"about_ca_topic_score_codex":0.0000031631648,"about_ca_topic_score_gemma":3.3784175e-8,"teacher_disagreement_score":0.1267633,"about_ca_system_score_codex":0.000061685096,"about_ca_system_score_gemma":0.0001788493,"threshold_uncertainty_score":0.9935525},"labels":[],"label_agreement":null},{"id":"W4403282817","doi":"","title":"Synthèse et caractérisation de défauts magnétiques dans une maille kagomé du graphène","year":2024,"lang":"fr","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Physics","score_opus":0.012129231099694937,"score_gpt":0.22886004463406667,"score_spread":0.21673081353437174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403282817","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.10540396,0.028841615,0.6284368,0.18833278,0.0017026275,0.00043316284,0.00006701219,0.0011607994,0.04562126],"genre_scores_gemma":[0.8890744,0.0042925896,0.079611845,0.0006578056,0.000025865422,0.000050459457,0.000110121044,0.00006809621,0.026108818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99012184,0.006830907,0.0006838942,0.0010623927,0.00059137965,0.00070958433],"domain_scores_gemma":[0.99371815,0.0022117964,0.0002562,0.0018216366,0.0016042511,0.00038795083],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.010157819,0.00041603265,0.00034511703,0.0003833229,0.0005853097,0.0017866871,0.0012638639,0.00029868324,0.00013754085],"category_scores_gemma":[0.0011478965,0.00044990948,0.00036044946,0.0019386974,0.00051421527,0.0010796902,0.000612788,0.0006436041,0.00025487153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.0000047097487,0.0004290881,0.00113683,0.00019515748,0.00008178479,0.000062183084,0.030295745,0.0001426963,0.007444099,0.9046534,0.0095522385,0.046002116],"study_design_scores_gemma":[0.00087368756,0.000005516685,0.0088921245,0.0076878336,0.00022944958,0.00042289955,0.00061501365,0.45299202,0.08978517,0.23972306,0.19744235,0.0013308721],"about_ca_topic_score_codex":0.009824431,"about_ca_topic_score_gemma":0.004242932,"teacher_disagreement_score":0.7836704,"about_ca_system_score_codex":0.00019451004,"about_ca_system_score_gemma":0.000606644,"threshold_uncertainty_score":0.99979526},"labels":[],"label_agreement":null},{"id":"W4403364742","doi":"10.48550/arxiv.2410.07732","title":"Partitioning Trillion Edge Graphs on Edge Devices","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":false,"route_about_ca":true,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft","keywords":"Enhanced Data Rates for GSM Evolution; Computer science; Business; Materials science; Telecommunications","score_opus":0.0716174124370929,"score_gpt":0.19526748765566973,"score_spread":0.12365007521857684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403364742","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9187464,0.0012213188,0.053953644,0.0007752352,0.005198017,0.00051843363,0.000027665392,0.0018414828,0.017717771],"genre_scores_gemma":[0.99730366,0.00017878429,0.0007062818,0.00029375916,0.000030291965,0.0000019688778,0.000018121727,0.000022828512,0.0014442941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764997,0.00013643708,0.00025103387,0.0014189829,0.00014425314,0.00039932484],"domain_scores_gemma":[0.9981989,0.000114771894,0.00018884777,0.0011430477,0.00015074664,0.00020365085],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036796127,0.00036174533,0.00031613387,0.00069335196,0.0002617147,0.00032213234,0.0011976077,0.0003009895,0.00002188386],"category_scores_gemma":[0.000023228757,0.00037643316,0.0003188667,0.0011981493,0.000102951904,0.00021090661,0.0017416613,0.00082539633,0.00067237497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013247284,0.000081171005,0.00043980536,0.00013029318,0.00007990808,0.0002454423,0.00016868432,0.052328963,0.000042267577,0.94341904,0.0022693686,0.00078181917],"study_design_scores_gemma":[0.00031114387,0.00009883631,0.00026368498,0.00060136785,0.00009003848,0.0000049901796,0.000031223914,0.17850243,0.00041412943,0.81758654,0.001572228,0.0005234052],"about_ca_topic_score_codex":0.00009861623,"about_ca_topic_score_gemma":0.000031561292,"teacher_disagreement_score":0.12617347,"about_ca_system_score_codex":0.00009432992,"about_ca_system_score_gemma":0.00015318878,"threshold_uncertainty_score":0.99986875},"labels":[],"label_agreement":null},{"id":"W4403975939","doi":"10.55016/ojs/cdm.v19i2.62694","title":"Mimimal graphs for completely independent spanning trees and completely independent spanning trees in complete t-partite graph","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Combinatorics; Spanning tree; Mathematics; Discrete mathematics; Minimum spanning tree; Kruskal's algorithm; Minimum degree spanning tree; Trémaux tree; Graph; Line graph; Pathwidth","score_opus":0.0337211460636568,"score_gpt":0.29924187987234085,"score_spread":0.2655207338086841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403975939","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.14550951,0.002185099,0.8449744,0.003645668,0.00054671423,0.0015979799,0.00070561183,0.000595715,0.00023932372],"genre_scores_gemma":[0.92323357,0.00003418517,0.07593866,0.00027413742,0.000028430584,0.00027531578,0.00008869965,0.000047310157,0.00007969303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99605894,0.00012941204,0.0011301294,0.0010158756,0.0006507906,0.0010148762],"domain_scores_gemma":[0.9973846,0.00086954347,0.00020543447,0.00079470914,0.00032778495,0.00041794387],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014087555,0.0005264225,0.0007997878,0.0010417957,0.00058344816,0.0010704654,0.0008725353,0.00017689198,0.000012547356],"category_scores_gemma":[0.0003584326,0.00048188327,0.00030146062,0.0014004575,0.00021351993,0.0005335904,0.00060725486,0.00044879186,0.000045931516],"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.000030263085,0.00018473003,0.00087034184,0.00024149708,0.00016485507,0.00006155517,0.003766819,0.0028684977,0.0075424635,0.9808614,0.0013657318,0.0020418002],"study_design_scores_gemma":[0.002020335,0.0004661562,0.0062423637,0.0014471443,0.00014295419,0.0001363492,0.00061219087,0.5604764,0.00077969907,0.42277423,0.0038636543,0.0010384974],"about_ca_topic_score_codex":0.00009150964,"about_ca_topic_score_gemma":0.00028526623,"teacher_disagreement_score":0.7777241,"about_ca_system_score_codex":0.0001241175,"about_ca_system_score_gemma":0.00011766,"threshold_uncertainty_score":0.9999665},"labels":[],"label_agreement":null},{"id":"W4403975975","doi":"10.55016/ojs/cdm.v19i3.62807","title":"The Fractional Local Metric Dimension of Graphs","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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; Metric dimension; Dimension (graph theory); Metric (unit); Discrete mathematics; Graph; Chordal graph; 1-planar graph","score_opus":0.01030655384091915,"score_gpt":0.27721046390645254,"score_spread":0.2669039100655334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403975975","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.0029626177,0.0020989222,0.989272,0.0041382685,0.0005508428,0.00022694498,0.00004518343,0.00020432439,0.00050090946],"genre_scores_gemma":[0.98082745,0.000047223635,0.01878269,0.00007612259,0.000008933565,0.00003209552,0.0000062841536,0.000009066893,0.00021011953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864423,0.000046355708,0.00040555914,0.00023810109,0.00040824173,0.00025752618],"domain_scores_gemma":[0.9980562,0.00086497783,0.00007156094,0.00055520283,0.00033339416,0.00011870358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076927344,0.00012498745,0.00016956098,0.00026323917,0.000342951,0.00020568627,0.0004636279,0.000056375222,0.0000070862384],"category_scores_gemma":[0.00043308493,0.00007837536,0.00014594341,0.0017392983,0.00012445632,0.00016811228,0.00021042424,0.00015151424,0.00013810511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015222602,0.000033701846,0.0000045009097,0.00002389596,0.000038989594,0.0000026833686,0.00015665738,0.0006441807,0.00065790577,0.9919562,0.003412049,0.0030677584],"study_design_scores_gemma":[0.00012792593,0.00007634325,0.000042342035,0.0001475074,0.000036765545,0.000024293999,0.00009842552,0.30762094,0.0033008428,0.68055326,0.007829487,0.00014186732],"about_ca_topic_score_codex":0.000008395046,"about_ca_topic_score_gemma":0.000002160461,"teacher_disagreement_score":0.97786486,"about_ca_system_score_codex":0.000047919268,"about_ca_system_score_gemma":0.000098114884,"threshold_uncertainty_score":0.31960544},"labels":[],"label_agreement":null},{"id":"W4404848450","doi":"10.1109/focs61266.2024.00016","title":"Three-Edge-Coloring Projective Planar Cubic Graphs: A Generalization of the Four Color Theorem","year":2024,"lang":"en","type":"article","venue":"","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Generalization; Edge coloring; Combinatorics; Projective test; Mathematics; Enhanced Data Rates for GSM Evolution; Planar graph; Graph coloring; Discrete mathematics; Computer science; Pure mathematics; Artificial intelligence; Graph; Mathematical analysis; Line graph","score_opus":0.023520192045268104,"score_gpt":0.23577232550554636,"score_spread":0.21225213346027827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404848450","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6013296,0.0009723484,0.38468027,0.0020718959,0.0024680337,0.0008271975,0.000004847089,0.0007426895,0.00690311],"genre_scores_gemma":[0.9883448,0.000010885798,0.011113453,0.00020061954,0.0000108639515,0.000032488362,6.4623043e-7,0.000009575252,0.0002766873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900025,0.00005455147,0.00020374649,0.0003170564,0.00024758882,0.00017678062],"domain_scores_gemma":[0.9993399,0.00008479536,0.000054061886,0.00038445415,0.00010285988,0.000033973905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003713938,0.00010975613,0.00011280316,0.00015035384,0.00012519016,0.00010340342,0.0004962652,0.00005152804,0.000007768591],"category_scores_gemma":[0.000029112862,0.00006322573,0.00010016406,0.001136613,0.00007192035,0.000149795,0.0001319902,0.000100102436,0.000013615768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003060304,0.00001900234,0.0006770858,0.000026761934,0.000030329986,0.0000028102584,0.00066400267,0.00047038813,0.0052373605,0.98980665,0.0013733645,0.0016891741],"study_design_scores_gemma":[0.00016651435,0.00009627788,0.0013314533,0.00012389415,0.000018672816,0.000018429111,0.000041621017,0.32529044,0.01935144,0.6530024,0.00041210253,0.00014676426],"about_ca_topic_score_codex":0.00013373229,"about_ca_topic_score_gemma":0.00009410263,"teacher_disagreement_score":0.38701516,"about_ca_system_score_codex":0.000019501533,"about_ca_system_score_gemma":0.00009595836,"threshold_uncertainty_score":0.25782704},"labels":[],"label_agreement":null},{"id":"W4405646319","doi":"10.7494/opmath.2025.45.1.39","title":"The metric dimension of circulant graphs","year":2024,"lang":"en","type":"article","venue":"Opuscula Mathematica","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Circulant matrix; Metric dimension; Dimension (graph theory); Combinatorics; Metric (unit); Discrete mathematics; Graph; Chordal graph; 1-planar graph","score_opus":0.013274288129839506,"score_gpt":0.24341651032555447,"score_spread":0.23014222219571498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405646319","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.32650518,0.06004483,0.56435466,0.010601463,0.00545596,0.00174972,0.00000940417,0.0025934966,0.02868526],"genre_scores_gemma":[0.9807456,0.00014906655,0.018754093,0.000039623024,0.0000039709657,0.0000163659,6.7029185e-7,0.000012168291,0.0002784233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987097,0.00005653252,0.0003325889,0.00026508045,0.00041999927,0.00021614824],"domain_scores_gemma":[0.9985862,0.00045182699,0.00006142986,0.00076345034,0.00007378369,0.00006333734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008980209,0.0001158343,0.00016894161,0.00020152854,0.00015355222,0.00019265169,0.0005682142,0.00004102842,0.000006869846],"category_scores_gemma":[0.00010890436,0.00006411478,0.00017413252,0.0012293606,0.00008202542,0.00013046857,0.00016879296,0.00009998411,0.000116364994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.528664e-7,0.00003207997,0.0000066165107,0.00011539297,0.00004027965,0.00000868315,0.00029426024,0.000023418599,0.0030129438,0.9878193,0.0011078719,0.0075385952],"study_design_scores_gemma":[0.00008953079,0.000043761815,0.000043443226,0.00024503385,0.000028572891,0.000051211427,0.000039852494,0.113200895,0.0043037254,0.88000524,0.0018207469,0.00012800288],"about_ca_topic_score_codex":0.0000064956266,"about_ca_topic_score_gemma":3.343987e-7,"teacher_disagreement_score":0.6542404,"about_ca_system_score_codex":0.000009413522,"about_ca_system_score_gemma":0.000037774138,"threshold_uncertainty_score":0.26145247},"labels":[],"label_agreement":null},{"id":"W4406171810","doi":"10.61091/um121-07","title":"Total Dominator Total Chromatic Numbers of Some Graphs","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","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.009871341134890105,"score_gpt":0.2397783326500956,"score_spread":0.2299069915152055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406171810","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97328585,0.0038309707,0.011711503,0.00094545656,0.001177251,0.0004709429,0.000017636223,0.0009018045,0.007658553],"genre_scores_gemma":[0.9673197,0.0000074516815,0.032087076,0.000041836334,0.000006818389,0.000023805716,0.0000016241574,0.000017571358,0.000494095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829346,0.00005023518,0.0005155272,0.00039694627,0.00042819174,0.00031565758],"domain_scores_gemma":[0.9987351,0.0002728583,0.00007594641,0.00073251466,0.000054975066,0.0001286341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005230093,0.00019530114,0.00032796073,0.00022660813,0.000067981906,0.00012227896,0.00043382027,0.000073657044,0.00012506597],"category_scores_gemma":[0.00010429002,0.00015547691,0.00022322529,0.0005753223,0.00015063479,0.00042637085,0.00020049566,0.00013088719,0.00036163058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001873164,0.00011427658,0.000004081033,0.00074365403,0.00006371014,0.000020143674,0.0018320462,0.000006835733,0.002434315,0.9903913,0.0020357105,0.0023520512],"study_design_scores_gemma":[0.00020103774,0.00010121341,0.00006592884,0.0005300276,0.000036790505,0.00013846956,0.00011993292,0.08542157,0.002708071,0.9103947,0.000069150265,0.00021305474],"about_ca_topic_score_codex":0.000011426624,"about_ca_topic_score_gemma":2.7754518e-7,"teacher_disagreement_score":0.08541473,"about_ca_system_score_codex":0.00001976485,"about_ca_system_score_gemma":0.00007215405,"threshold_uncertainty_score":0.63401645},"labels":[],"label_agreement":null},{"id":"W4406172387","doi":"10.61091/um121-05","title":"Further Results on Equitable Near Proper Coloring of Derived Graph Families","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","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; Graph coloring; Graph; Combinatorics; List coloring; Line graph; Graph power","score_opus":0.030270239475184084,"score_gpt":0.25860646530897496,"score_spread":0.22833622583379087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406172387","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8604911,0.0036940656,0.03732068,0.0038786675,0.0012760384,0.0011713493,0.00004442108,0.0017917024,0.09033198],"genre_scores_gemma":[0.95251507,0.000020780259,0.046753075,0.00007359835,0.0000050950725,0.000027370843,0.0000014929553,0.000017174114,0.0005863551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983839,0.000053331667,0.00043861507,0.00042142288,0.00036070825,0.00034206704],"domain_scores_gemma":[0.998726,0.00032125757,0.000061986444,0.00073030096,0.00008568887,0.0000747813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008087447,0.00016625281,0.00024325225,0.00016644233,0.00011012864,0.0001650819,0.00046191193,0.000059390855,0.000030470756],"category_scores_gemma":[0.00017022454,0.00011787402,0.000110652494,0.0005671424,0.00014342494,0.00021155378,0.00021600044,0.00012824812,0.00028179193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000446146,0.0002902705,0.000008787501,0.0008491817,0.000117199066,0.0000276265,0.015269339,0.0002991213,0.015216438,0.9552362,0.0044880006,0.008153225],"study_design_scores_gemma":[0.0008592822,0.0008157841,0.00010042316,0.0023546459,0.0000597986,0.000026312367,0.0009550522,0.15991102,0.047054462,0.7819858,0.005311541,0.000565845],"about_ca_topic_score_codex":0.000017783777,"about_ca_topic_score_gemma":0.0000013794192,"teacher_disagreement_score":0.17325036,"about_ca_system_score_codex":0.000014305199,"about_ca_system_score_gemma":0.00006788935,"threshold_uncertainty_score":0.48067632},"labels":[],"label_agreement":null},{"id":"W4406203419","doi":"10.61091/jcmcc123-41","title":"Preservers of Graph and Digraph Cordiality","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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; Digraph; Undirected graph; Mathematics; Edge-graceful labeling; Vertex (graph theory); Graph; Hypercube graph; Discrete mathematics; Neighbourhood (mathematics); Line graph; Graph power","score_opus":0.014820561329031274,"score_gpt":0.25025387410796,"score_spread":0.23543331277892873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406203419","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9492801,0.0044765477,0.025729405,0.00037802517,0.019250367,0.00022537424,0.0000023854004,0.000105331885,0.000552471],"genre_scores_gemma":[0.9893774,0.00015030333,0.010306146,0.000013490009,0.00013259878,6.9230515e-7,2.875183e-7,0.00001581635,0.0000033062765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976836,0.0001129685,0.0010535883,0.00026529928,0.00062925974,0.00025527488],"domain_scores_gemma":[0.9976863,0.00080479006,0.00058004656,0.0002985172,0.00042863213,0.00020167771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021656577,0.0002276879,0.0006341321,0.00036948544,0.0001592853,0.00039732066,0.00052516075,0.00012568451,0.0000015409505],"category_scores_gemma":[0.00026172612,0.00018811162,0.00020250086,0.00064356654,0.00013739573,0.00042726504,0.00038302806,0.00038092778,5.6111463e-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.000017489063,0.00017257278,0.00017814948,0.00041228824,0.000114809285,0.00002266149,0.0010697696,0.0000137000425,0.0007673091,0.99476355,0.00024323352,0.002224479],"study_design_scores_gemma":[0.0013746432,0.00060293335,0.00012107865,0.0006448313,0.00007100603,0.00011092018,0.000087491615,0.013190147,0.0009666648,0.98231614,0.0003170817,0.00019708312],"about_ca_topic_score_codex":0.000019712561,"about_ca_topic_score_gemma":1.8933505e-7,"teacher_disagreement_score":0.040097266,"about_ca_system_score_codex":0.000018238587,"about_ca_system_score_gemma":0.00012814539,"threshold_uncertainty_score":0.7670969},"labels":[],"label_agreement":null},{"id":"W4406203422","doi":"10.61091/jcmcc123-26","title":"Coloring of n-Inordinate Invariant Intersection Graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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":"Combinatorics; Intersection graph; Mathematics; Graph coloring; Discrete mathematics; Invariant (physics); Intersection theory; Line graph; Graph","score_opus":0.014560823444124833,"score_gpt":0.24280052162550597,"score_spread":0.22823969818138115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406203422","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8871583,0.0014654675,0.06970142,0.00025692317,0.04019981,0.00021370298,0.0000010100513,0.00014065155,0.0008627233],"genre_scores_gemma":[0.9875268,0.000043661217,0.012227821,0.000012053492,0.00016400403,0.0000010135163,2.7096587e-7,0.000019909976,0.0000044630733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755245,0.00010165621,0.0012130886,0.0002576844,0.0006029374,0.00027219392],"domain_scores_gemma":[0.99772584,0.0006117173,0.0007020046,0.00027302196,0.0005305192,0.000156863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022629956,0.00023395734,0.0006115878,0.0005321357,0.00015985673,0.00039483776,0.0005892586,0.00013065439,0.0000023138866],"category_scores_gemma":[0.0002445618,0.00019777447,0.00023778736,0.0008029402,0.00008920007,0.00049332407,0.0003488116,0.00047250427,0.0000019857903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020163629,0.00018927579,0.000033185504,0.0003139244,0.00011907681,0.000056229183,0.0014755303,0.00005307269,0.003055762,0.99202454,0.00014533699,0.0025138995],"study_design_scores_gemma":[0.0012912063,0.0008249545,0.000024363515,0.0010591267,0.00006583431,0.00029872457,0.00014396568,0.042997885,0.004914168,0.94796026,0.00021517277,0.0002043551],"about_ca_topic_score_codex":0.000012736767,"about_ca_topic_score_gemma":1.8412993e-7,"teacher_disagreement_score":0.10036851,"about_ca_system_score_codex":0.000053564036,"about_ca_system_score_gemma":0.00016398524,"threshold_uncertainty_score":0.80650085},"labels":[],"label_agreement":null},{"id":"W4406203435","doi":"10.61091/jcmcc123-27","title":"\\(e\\)-Injective Coloring: \\(2\\)-Distance and Injective Coloring Conjectures","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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":"Injective function; Mathematics; Combinatorics","score_opus":0.012344975368720167,"score_gpt":0.2500954849705769,"score_spread":0.2377505096018567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406203435","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8496498,0.007132078,0.10435769,0.0006259244,0.03597357,0.0005422333,0.0000034412524,0.00033238725,0.0013828631],"genre_scores_gemma":[0.98731065,0.00010654179,0.012105278,0.000038703118,0.00039428423,0.0000033329345,3.2812164e-7,0.000032756376,0.0000081335165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972294,0.00013985831,0.0010295341,0.00046901917,0.0007003922,0.0004318006],"domain_scores_gemma":[0.9967993,0.0014469547,0.00058735546,0.00028864876,0.0006037451,0.0002739883],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019590745,0.00037790695,0.00077635306,0.00040267434,0.0004172144,0.001062842,0.00056524493,0.0001854981,0.0000018414642],"category_scores_gemma":[0.00046776028,0.00032286954,0.00016805831,0.00071706343,0.00017817706,0.0006122479,0.00049875444,0.0007631115,0.0000023199777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041560626,0.00015484651,0.000059886093,0.00023981782,0.00016100869,0.00008986186,0.003595397,0.00008388097,0.00074952433,0.9917867,0.00017721544,0.0028602665],"study_design_scores_gemma":[0.0015282413,0.0010977144,0.000055579414,0.00086951215,0.0000833442,0.00039039334,0.0004033797,0.03856343,0.0018217564,0.95392275,0.0008851991,0.00037870154],"about_ca_topic_score_codex":0.000014411744,"about_ca_topic_score_gemma":5.062432e-7,"teacher_disagreement_score":0.13766083,"about_ca_system_score_codex":0.00011821589,"about_ca_system_score_gemma":0.0002461192,"threshold_uncertainty_score":0.99997413},"labels":[],"label_agreement":null},{"id":"W4406203459","doi":"10.61091/jcmcc123-20","title":"A Complete Characterization of Magic Constants Arising from Distance Magic Graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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":"MAGIC (telescope); Characterization (materials science); Mathematics; Combinatorics; Physics; Optics; Astrophysics","score_opus":0.014914679630273235,"score_gpt":0.2378625642036119,"score_spread":0.22294788457333867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406203459","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8064595,0.0013539703,0.16948812,0.00026049317,0.021729182,0.00022827313,0.0000192769,0.00011116393,0.00035000246],"genre_scores_gemma":[0.9858636,0.00008316067,0.013814273,0.00002633449,0.00017690593,4.8452097e-7,0.0000055061323,0.000025866628,0.000003846656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969982,0.0001322033,0.0014534141,0.00033575905,0.000772691,0.0003077345],"domain_scores_gemma":[0.99717724,0.0006925812,0.0010413306,0.00035595574,0.000555967,0.00017691276],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012706788,0.00029358824,0.0007879441,0.00035564016,0.00015923972,0.0005725457,0.0006506782,0.00013155695,0.0000052536584],"category_scores_gemma":[0.000153663,0.000256005,0.00021492038,0.0007568857,0.00014838857,0.0005193539,0.00027395232,0.00044673964,0.0000041916946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022425937,0.0002076257,0.00010843957,0.00021620962,0.000108394495,0.000046206027,0.001153006,0.000011169446,0.026201729,0.9698267,0.000046762307,0.0020513355],"study_design_scores_gemma":[0.0014971396,0.0003055335,0.00009725616,0.0014219133,0.00007709964,0.00007143844,0.000061029372,0.060898043,0.0015213483,0.9333493,0.00044190197,0.00025799093],"about_ca_topic_score_codex":0.000013993594,"about_ca_topic_score_gemma":1.6427646e-7,"teacher_disagreement_score":0.17940411,"about_ca_system_score_codex":0.000046466164,"about_ca_system_score_gemma":0.00015567985,"threshold_uncertainty_score":0.9999892},"labels":[],"label_agreement":null},{"id":"W4406846174","doi":"10.5539/jmr.v16n6p29","title":"Integer Cordial Labelling on Graphs nF_(m_i ) (n-1) P_t With m_i Even or Odd","year":2025,"lang":"en","type":"article","venue":"Journal of Mathematics Research","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; Integer (computer science); Labelling; Discrete mathematics; Chemistry","score_opus":0.0911206089443444,"score_gpt":0.3886503404678015,"score_spread":0.2975297315234571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406846174","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62501574,0.0011375867,0.34082958,0.014203588,0.0013273042,0.00088755117,0.000003584874,0.0001523864,0.016442679],"genre_scores_gemma":[0.81601006,0.00030325755,0.17788985,0.00049813633,0.000050328486,0.00001297596,4.9554984e-7,0.00003394243,0.0052009625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99683833,0.00023110288,0.00064684154,0.00024023165,0.0015787841,0.0004646842],"domain_scores_gemma":[0.9963297,0.001393741,0.00026583552,0.0005898666,0.0012373638,0.00018346898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004700272,0.00016202364,0.00037799962,0.0011404661,0.00026741147,0.00032898466,0.0012903842,0.000093282695,0.000034441036],"category_scores_gemma":[0.00060300657,0.00009503914,0.00011968271,0.0016095594,0.00015029617,0.00024227223,0.0002382959,0.0010187804,0.00004825658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053161994,0.0019916198,0.0004023675,0.0006242924,0.000439118,0.00054016575,0.0037913988,0.0018804541,0.0049657957,0.92907906,0.04381777,0.01193634],"study_design_scores_gemma":[0.0030850854,0.0036239622,0.00011670047,0.004600304,0.000053531156,0.00037458766,0.0012017214,0.05173405,0.011167443,0.9179337,0.0056799673,0.00042893324],"about_ca_topic_score_codex":0.0000114425775,"about_ca_topic_score_gemma":0.000009049513,"teacher_disagreement_score":0.19099429,"about_ca_system_score_codex":0.00006886202,"about_ca_system_score_gemma":0.0005537861,"threshold_uncertainty_score":0.44261503},"labels":[],"label_agreement":null},{"id":"W4406987509","doi":"10.2139/ssrn.5117928","title":"Classification of Perfect Unitary Cayley Graphs","year":2025,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","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":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Unitary state; Cayley graph; Mathematics; Combinatorics; Political science; Graph; Law","score_opus":0.01476291446111154,"score_gpt":0.2513377513057208,"score_spread":0.23657483684460923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406987509","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50582314,0.0463178,0.42734182,0.006269385,0.0051791677,0.00085719395,0.000027836973,0.0005141168,0.0076695397],"genre_scores_gemma":[0.989218,0.0067722206,0.0029391972,0.00009388259,0.000023260514,0.000010950705,0.000013252133,0.000012376235,0.0009168585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966754,0.00028062882,0.0006343472,0.0005159899,0.00046150765,0.0014321292],"domain_scores_gemma":[0.99790525,0.000090600675,0.0005625306,0.0009143652,0.00043441146,0.00009284167],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0027756882,0.00028042332,0.00039180205,0.0006890558,0.00019960172,0.00010225728,0.0017228564,0.00027610039,0.0000041137137],"category_scores_gemma":[0.00007442972,0.00025419844,0.00033841014,0.00060034153,0.00007678029,0.00015952378,0.0005706861,0.00408526,0.0000070601736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001054458,0.0000827771,0.00074443704,0.00005409528,0.00020703205,0.0000018237055,0.0001731462,0.0007204507,0.00059878593,0.98017496,0.00024073088,0.01699124],"study_design_scores_gemma":[0.00030056,0.000158329,0.0006316082,0.00021258442,0.000059959923,0.00008955737,0.0001252499,0.006842508,0.0002507545,0.99093866,0.00015641906,0.00023382364],"about_ca_topic_score_codex":0.00021395861,"about_ca_topic_score_gemma":0.00016496565,"teacher_disagreement_score":0.48339486,"about_ca_system_score_codex":0.00037611,"about_ca_system_score_gemma":0.0063642724,"threshold_uncertainty_score":0.999991},"labels":[],"label_agreement":null},{"id":"W4407103860","doi":"10.28924/2291-8639-23-2025-30","title":"Generation of Anti-Magic Graphs","year":2025,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","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":"MAGIC (telescope); Mathematics; Linguistics; Astronomy; Philosophy; Physics","score_opus":0.017146807067801924,"score_gpt":0.2908015491318239,"score_spread":0.27365474206402196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407103860","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.12799622,0.00052964804,0.86881286,0.0020292767,0.00010814795,0.00003485271,0.0000030727874,0.00000651288,0.00047940473],"genre_scores_gemma":[0.9864781,0.0002793643,0.0129951695,0.00016430505,0.000012843878,0.0000022479355,0.0000036912484,9.815443e-7,0.00006330794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925333,0.000019731979,0.00037519832,0.000101116326,0.00020787695,0.000042745516],"domain_scores_gemma":[0.9988146,0.00003892422,0.00028348019,0.00014075429,0.0006928468,0.000029415833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024651835,0.000045456152,0.00014071418,0.0007622091,0.00003939055,0.00006570102,0.00038617206,0.000021007643,0.0000058730925],"category_scores_gemma":[0.000014139806,0.000037405905,0.00014042466,0.00090962026,0.000036930844,0.00014033171,0.000053504027,0.000050860304,8.246496e-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.0000021261894,0.00012784656,0.012045466,0.000003315689,0.001122577,0.0000011581077,0.000056992503,0.0026067502,0.026872635,0.9327638,0.00048950105,0.0239078],"study_design_scores_gemma":[0.001654667,0.0001240925,0.082567684,0.0000987847,0.001808917,0.000054117725,0.000120785975,0.1985392,0.05654139,0.6406949,0.017419683,0.00037576855],"about_ca_topic_score_codex":0.000017413568,"about_ca_topic_score_gemma":0.000005106975,"teacher_disagreement_score":0.8584819,"about_ca_system_score_codex":0.000007587316,"about_ca_system_score_gemma":0.000037709415,"threshold_uncertainty_score":0.15253685},"labels":[],"label_agreement":null},{"id":"W4407580272","doi":"10.37236/12506","title":"On the Quantum Chromatic Numbers of Small Graphs","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Chromatic scale; Quantum; Quantum graph; Mathematics; Computer science; Combinatorics; Physics; Quantum mechanics","score_opus":0.007870199887265065,"score_gpt":0.2162875026383883,"score_spread":0.20841730275112325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407580272","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9279279,0.0045481957,0.05405613,0.010075812,0.0012364443,0.00017674021,2.0674649e-7,0.000032410764,0.0019461581],"genre_scores_gemma":[0.99911237,0.00027488582,0.00004486183,0.00041720242,0.0000027161484,0.0000016550168,5.55568e-8,0.0000051964257,0.00014108584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985113,0.00022226047,0.00045237024,0.00010084547,0.00036939443,0.00034384197],"domain_scores_gemma":[0.99798685,0.0007558445,0.0004410778,0.0005358331,0.0002447802,0.000035636953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002014161,0.00011787837,0.00022547551,0.00016732176,0.0001707447,0.000047191716,0.0015690814,0.000042193027,0.0000027233352],"category_scores_gemma":[0.00017452217,0.00006049217,0.00016992433,0.0010925788,0.00009263821,0.000071709575,0.00009337528,0.0005801126,0.0000037336245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011182801,0.000103230115,0.000035324607,0.000010589052,0.00008339735,0.0000014971307,0.00018144742,0.00016397207,0.00028996685,0.9976877,0.0012181296,0.00021359356],"study_design_scores_gemma":[0.0004156015,0.0004347898,0.0000814891,0.0001008007,0.000033128552,0.000026609547,0.000045629993,0.0025272027,0.0021542304,0.9938865,0.00023524661,0.00005882236],"about_ca_topic_score_codex":0.000011376747,"about_ca_topic_score_gemma":0.0000023248072,"teacher_disagreement_score":0.07118444,"about_ca_system_score_codex":0.00007546111,"about_ca_system_score_gemma":0.00044310646,"threshold_uncertainty_score":0.29157698},"labels":[],"label_agreement":null},{"id":"W4408040716","doi":"10.1007/978-3-031-81824-0_11","title":"Counting Polynomials with Distinct Roots Using Subset Sum","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Artificial intelligence; Combinatorics; Discrete mathematics; Mathematics","score_opus":0.017306418751654375,"score_gpt":0.24100902957512516,"score_spread":0.2237026108234708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408040716","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.0012682204,0.00060805754,0.9928293,0.00038078823,0.0015977075,0.00034419342,0.0000087377375,0.00023923533,0.0027237409],"genre_scores_gemma":[0.34626547,0.000017173052,0.6507916,0.0018286372,0.00016038165,0.0000071723375,0.000010112471,0.000052908727,0.00086656446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995597,0.000042192998,0.0006234871,0.0018207008,0.001071189,0.0008454485],"domain_scores_gemma":[0.9969854,0.0004897035,0.00041438633,0.0015311104,0.00039774814,0.00018169892],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001189898,0.0006322814,0.00067832525,0.0010523259,0.0005174716,0.0008975658,0.0027253067,0.00029751053,0.000009880933],"category_scores_gemma":[0.00009947365,0.000517783,0.00012010285,0.0011100854,0.0007621588,0.00053357624,0.0013191989,0.0007569108,0.000013635935],"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.000057080786,0.00015964963,0.0037864055,0.0004219297,0.00012854296,0.0006747218,0.0010093222,0.1886749,0.0024989187,0.19104366,0.0002729345,0.6112719],"study_design_scores_gemma":[0.0006237654,0.00020329439,0.00027376506,0.0023501683,0.000038962065,0.00016375136,1.8586327e-7,0.83279157,0.0020186512,0.1589178,0.0012369492,0.0013811283],"about_ca_topic_score_codex":0.00014763576,"about_ca_topic_score_gemma":0.0001896466,"teacher_disagreement_score":0.6441167,"about_ca_system_score_codex":0.00024023913,"about_ca_system_score_gemma":0.0011516933,"threshold_uncertainty_score":0.99972737},"labels":[],"label_agreement":null},{"id":"W4408492740","doi":"10.61091/jcmcc124-20","title":"\\((d,1)\\)-Total labellings of two infinite families of snarks","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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.010253072557796554,"score_gpt":0.2508597928154954,"score_spread":0.24060672025769886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408492740","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94855344,0.00084414415,0.03731959,0.00016218166,0.01160097,0.0001811216,0.0000015188027,0.000035548386,0.0013015053],"genre_scores_gemma":[0.9701191,0.000072120056,0.029689297,0.000022401518,0.000075824246,6.591395e-7,3.500302e-7,0.000012130435,0.000008126657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99694026,0.00011482424,0.0017817783,0.0002218539,0.00066550996,0.0002757886],"domain_scores_gemma":[0.9955502,0.0009849918,0.0017395777,0.00040286419,0.0012062974,0.00011604428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019571013,0.0002551037,0.0009848654,0.0005513566,0.00015058072,0.00011041247,0.0007820939,0.000138646,0.0000016356254],"category_scores_gemma":[0.00039495737,0.00022443602,0.00024077533,0.0009133188,0.0001810638,0.00025167037,0.0004873063,0.0003987032,5.087805e-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.000035945206,0.00046564735,0.00038388732,0.00032160617,0.0001298222,0.0000055486494,0.0011455608,0.00024161175,0.004098993,0.9913322,0.000111747155,0.0017274478],"study_design_scores_gemma":[0.004473342,0.00063773664,0.00007823655,0.001000895,0.00008741611,0.000033356595,0.00017744332,0.019542024,0.011076704,0.9625918,0.00010192304,0.00019908434],"about_ca_topic_score_codex":0.000025335929,"about_ca_topic_score_gemma":1.7282785e-7,"teacher_disagreement_score":0.028740345,"about_ca_system_score_codex":0.000026213711,"about_ca_system_score_gemma":0.0002442995,"threshold_uncertainty_score":0.91522354},"labels":[],"label_agreement":null},{"id":"W4408731435","doi":"10.61091/um122-05","title":"Characterization of the geodesic distance on infinite graphs","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","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; Geodesic; Characterization (materials science); Combinatorics; Geometry","score_opus":0.011455554969760818,"score_gpt":0.22842676021681368,"score_spread":0.21697120524705288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408731435","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8156937,0.00011370871,0.15864928,0.0032398086,0.00064346817,0.0005460363,0.000014210844,0.00022268886,0.020877143],"genre_scores_gemma":[0.99625134,0.0000053222234,0.0027251274,0.00043714137,8.867049e-7,0.000014403939,0.0000012955581,0.0000036039394,0.0005608925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991522,0.00005376861,0.00027401317,0.00019010605,0.00019928454,0.00013065498],"domain_scores_gemma":[0.9988757,0.00011392308,0.000111163514,0.00080858875,0.00006782152,0.000022844904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025928294,0.00009229217,0.00013804843,0.00009480403,0.000098838886,0.00003294804,0.0005520058,0.000034529054,0.000009567597],"category_scores_gemma":[0.00011166625,0.000059362468,0.00007809,0.0006812015,0.00008645332,0.00008535792,0.00012374857,0.00007391495,0.000018750696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024446415,0.00007425051,0.00012728115,0.0000772173,0.000009918945,1.6783977e-7,0.0002890536,0.000004281694,0.006918391,0.9906143,0.0001465797,0.0017360951],"study_design_scores_gemma":[0.00018336672,0.000030170373,0.0051791063,0.00045707863,0.000012651089,8.4711087e-7,0.000014298777,0.013492858,0.0151328305,0.9645124,0.00089072913,0.00009363439],"about_ca_topic_score_codex":0.0000017902258,"about_ca_topic_score_gemma":6.107525e-7,"teacher_disagreement_score":0.18055767,"about_ca_system_score_codex":0.000008106729,"about_ca_system_score_gemma":0.000032473505,"threshold_uncertainty_score":0.24207312},"labels":[],"label_agreement":null},{"id":"W4408731440","doi":"10.61091/um122-03","title":"The covering cover pebbling number for some acyclic graphs","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","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; Cover (algebra); Combinatorics; Discrete mathematics","score_opus":0.01571595655761153,"score_gpt":0.2777455070045702,"score_spread":0.26202955044695864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408731440","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.19693947,0.0041946946,0.71743715,0.013897332,0.0036887128,0.0027442833,0.000022510545,0.0016394076,0.05943643],"genre_scores_gemma":[0.9503269,0.000054856384,0.04500677,0.0009885837,0.000009488193,0.00016417644,0.0000017370907,0.000016605562,0.0034308506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867857,0.000037435133,0.00036261283,0.00032764958,0.00021494995,0.00037878088],"domain_scores_gemma":[0.99806774,0.00087439973,0.00008262963,0.0008288509,0.000085926804,0.00006043893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080214324,0.00015314022,0.00019431897,0.00007338653,0.00054710644,0.00027963656,0.000773301,0.00004716113,0.0000130089475],"category_scores_gemma":[0.0003704731,0.00010416279,0.00016269393,0.0003836447,0.00009327988,0.00025825895,0.0002524018,0.00010512244,0.00014673077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047419294,0.00004118096,0.00004702541,0.00008648371,0.000037771515,5.147771e-7,0.00020753311,0.000017768167,0.00017915916,0.9893189,0.0069940537,0.0030648604],"study_design_scores_gemma":[0.0002969926,0.000014763294,0.00004286653,0.000105591396,0.000017401911,0.0000042390757,0.00004753648,0.04564106,0.0007829727,0.9404524,0.012478832,0.00011535282],"about_ca_topic_score_codex":0.000004083931,"about_ca_topic_score_gemma":7.398415e-7,"teacher_disagreement_score":0.75338745,"about_ca_system_score_codex":0.000019105442,"about_ca_system_score_gemma":0.000055507782,"threshold_uncertainty_score":0.42476353},"labels":[],"label_agreement":null},{"id":"W4408731602","doi":"10.61091/um122-07","title":"Type \\((a,b,c)\\) face-magic labelings of prism graphs","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","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":"MAGIC (telescope); Mathematics; Combinatorics; Prism; Discrete mathematics; Physics; Optics; Astronomy","score_opus":0.01466898852695081,"score_gpt":0.259617444768245,"score_spread":0.2449484562412942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408731602","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5065447,0.009168834,0.33231676,0.00785072,0.0022805159,0.0016453298,0.000010241627,0.0016697665,0.1385131],"genre_scores_gemma":[0.9066651,0.000029508028,0.09128384,0.00031964513,0.0000012967296,0.000007858353,0.0000014909698,0.000008377429,0.0016828858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864113,0.000048458834,0.00046046832,0.000329281,0.00026368024,0.00025695513],"domain_scores_gemma":[0.9985804,0.0001795177,0.00011728865,0.00089989265,0.00015642615,0.0000664875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052575016,0.00015391609,0.0002923453,0.00025220064,0.00007387178,0.000044206503,0.0007313016,0.0000785275,0.000036109177],"category_scores_gemma":[0.00026736225,0.00012725666,0.00010128393,0.0010458379,0.00011614482,0.00013224733,0.0001831249,0.00012275964,0.00013778813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037524212,0.00014480019,0.00007813944,0.00017727194,0.00004033753,0.0000017920898,0.0007658202,0.0000050917565,0.003206292,0.98728627,0.0045813713,0.0037090892],"study_design_scores_gemma":[0.00026617176,0.00006330937,0.000100304664,0.000218161,0.00002456774,0.0000036558763,0.00006884785,0.017843923,0.0064695533,0.9735588,0.0012490837,0.00013363888],"about_ca_topic_score_codex":0.000010929795,"about_ca_topic_score_gemma":4.8306634e-7,"teacher_disagreement_score":0.40012038,"about_ca_system_score_codex":0.000010118118,"about_ca_system_score_gemma":0.00007879011,"threshold_uncertainty_score":0.5189376},"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":"W4408837234","doi":"10.1007/s00013-025-02120-2","title":"A character theoretic formula for the base size","year":2025,"lang":"en","type":"article","venue":"Archiv der Mathematik","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Character (mathematics); Base (topology); Geometry; Mathematical analysis","score_opus":0.011056594283198743,"score_gpt":0.24611092257762388,"score_spread":0.23505432829442513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408837234","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.0111293765,0.00031150848,0.9660174,0.013781886,0.00035725054,0.0006748888,0.0000048139646,0.00022137299,0.007501494],"genre_scores_gemma":[0.8852056,0.000020228537,0.10701478,0.0047974987,0.000012606565,0.00021566205,0.0000016342453,0.000013369531,0.0027186146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909586,0.00003642512,0.00021592338,0.00026026985,0.00013323448,0.00025828308],"domain_scores_gemma":[0.99704987,0.0020382812,0.000060524337,0.000759975,0.000049357473,0.000041990046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049780065,0.00012224959,0.00013559582,0.00006437701,0.0002575363,0.0001336781,0.0007425067,0.000025942925,0.000017729823],"category_scores_gemma":[0.00022060907,0.00007114994,0.0001223611,0.0002097285,0.00007533434,0.0001159103,0.00020979051,0.00009226134,0.000044207627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049886044,0.000043322758,0.000010040085,0.00005785187,0.000029536448,8.2398765e-7,0.001040286,0.000008645574,0.0007543025,0.9874407,0.003097305,0.0075122155],"study_design_scores_gemma":[0.00033369425,0.000020769792,0.00018047684,0.000067891095,0.000021357437,0.0000067125825,0.00002579684,0.05888055,0.001934482,0.9359615,0.002475706,0.000091102906],"about_ca_topic_score_codex":0.000003298486,"about_ca_topic_score_gemma":0.0000012872503,"teacher_disagreement_score":0.87407625,"about_ca_system_score_codex":0.000005657137,"about_ca_system_score_gemma":0.000044931305,"threshold_uncertainty_score":0.29014105},"labels":[],"label_agreement":null},{"id":"W4408892507","doi":"10.61091/jcmcc125-06","title":"A \"Travelling Salesman's Paths\" within &lt;i&gt;n&lt;/i&gt;\\(\\times\\)&lt;i&gt;n&lt;/i&gt; (&lt;i&gt;n&lt;/i&gt;= 3, 4, 5) magic squares","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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; Mount Saint Vincent University","keywords":"MAGIC (telescope); Physics","score_opus":0.011440890402975587,"score_gpt":0.23535434328634658,"score_spread":0.223913452883371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408892507","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78451115,0.020192327,0.074778385,0.0021030768,0.09992529,0.0032937333,0.0000688805,0.0015179594,0.013609226],"genre_scores_gemma":[0.9665723,0.0007242209,0.029439094,0.00033412146,0.0019835685,0.00003441366,0.000028341896,0.0002907079,0.00059327466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9829606,0.0012851084,0.0063643134,0.0023000317,0.004325133,0.0027648436],"domain_scores_gemma":[0.98391306,0.0033864698,0.005232853,0.0026003923,0.0033220882,0.0015451105],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.009560133,0.0023500333,0.004116145,0.002149122,0.0024704712,0.0027428523,0.004790012,0.0013922196,0.000049843587],"category_scores_gemma":[0.0017676564,0.0022444907,0.0015648963,0.0036788755,0.00082541327,0.0015424752,0.0024643615,0.002463313,0.000099930985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028446032,0.0022094501,0.000045304972,0.0009207453,0.0007490417,0.0003688286,0.003268584,0.001523446,0.052786116,0.9279789,0.00786898,0.0019961896],"study_design_scores_gemma":[0.01386704,0.002273419,0.0001349829,0.00460096,0.00082515425,0.0005200552,0.00013053948,0.098129496,0.003987672,0.84560025,0.027295908,0.0026345344],"about_ca_topic_score_codex":0.000010609362,"about_ca_topic_score_gemma":0.000014291977,"teacher_disagreement_score":0.18206114,"about_ca_system_score_codex":0.00064404076,"about_ca_system_score_gemma":0.0017981037,"threshold_uncertainty_score":0.99990416},"labels":[],"label_agreement":null},{"id":"W4408926623","doi":"10.61091/jcmcc125-18","title":"On \\(H\\)-irregularity strength of comb and edge comb product of graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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":"Enhanced Data Rates for GSM Evolution; Product (mathematics); Combinatorics; Mathematics; Materials science; Computer science; Geometry; Telecommunications","score_opus":0.010622557712800287,"score_gpt":0.2443413991601279,"score_spread":0.2337188414473276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408926623","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98279226,0.0010875354,0.00525519,0.00028522612,0.009555267,0.00028652605,0.0000024069282,0.000035059533,0.0007005029],"genre_scores_gemma":[0.9898423,0.0000588649,0.01000696,0.000025827752,0.00004677202,8.523522e-7,4.9207176e-7,0.0000124847475,0.0000054591337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997068,0.00017384507,0.0014873182,0.00031008074,0.0006837502,0.0002770399],"domain_scores_gemma":[0.9958505,0.0010832888,0.0014835582,0.0005143573,0.00092104916,0.00014725182],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021505426,0.0002912594,0.0010518776,0.00051302003,0.0001981166,0.0001224419,0.0007170211,0.00013737447,0.0000010816697],"category_scores_gemma":[0.0006238607,0.00024956535,0.0001903431,0.00075548724,0.00024724682,0.00019815734,0.0004576096,0.0004585626,2.2629618e-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.000065802815,0.0009898143,0.00038301077,0.0004502648,0.00013324078,0.0000047775234,0.0005328348,0.000026627047,0.0012464694,0.99316645,0.00026217516,0.002738542],"study_design_scores_gemma":[0.003979316,0.0010561157,0.00034991017,0.0010411921,0.000084752035,0.000024258865,0.000073460986,0.0053440984,0.009194156,0.9785827,0.000068888796,0.00020118029],"about_ca_topic_score_codex":0.000014537511,"about_ca_topic_score_gemma":2.409877e-7,"teacher_disagreement_score":0.01458377,"about_ca_system_score_codex":0.000024614415,"about_ca_system_score_gemma":0.0001919368,"threshold_uncertainty_score":0.99999565},"labels":[],"label_agreement":null},{"id":"W4408926687","doi":"10.61091/jcmcc125-19","title":"Toughness of directed graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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; Computer science","score_opus":0.010413672147950281,"score_gpt":0.245827605892271,"score_spread":0.23541393374432074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408926687","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9159411,0.0014299611,0.04934176,0.0004339667,0.029807383,0.00028858602,0.0000010835587,0.00014701019,0.0026091337],"genre_scores_gemma":[0.97452664,0.00003957156,0.025320873,0.000032235333,0.00005902217,8.2341603e-7,2.5902443e-7,0.00001073312,0.000009847145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975295,0.00011760304,0.0013046477,0.0002201772,0.0005606201,0.00026742832],"domain_scores_gemma":[0.99663824,0.00072054676,0.0011041448,0.00039003135,0.0010216257,0.00012538394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016111097,0.00022755282,0.0007807093,0.00047028137,0.00019238389,0.00016849273,0.00085303094,0.00014026432,0.0000014697086],"category_scores_gemma":[0.000484653,0.00019519287,0.0002081916,0.0010534788,0.000112146045,0.00024439578,0.0004049684,0.00033841128,5.698289e-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.000025319603,0.0004112977,0.00021502106,0.00017626591,0.00010270341,0.00000820836,0.00048259593,0.000026004089,0.0012737395,0.99496263,0.0003495112,0.001966707],"study_design_scores_gemma":[0.002773769,0.00034385547,0.00013501935,0.0005940128,0.00006045937,0.00002957428,0.00007332375,0.009270769,0.003653468,0.9826407,0.0002503049,0.00017476798],"about_ca_topic_score_codex":0.000009913491,"about_ca_topic_score_gemma":1.2605608e-7,"teacher_disagreement_score":0.05858552,"about_ca_system_score_codex":0.000028749153,"about_ca_system_score_gemma":0.0002011924,"threshold_uncertainty_score":0.7959734},"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":"W4409341382","doi":"10.1142/s179383092550079x","title":"Strong edge coloring algorithm for K4-minor free graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Mathematics; Combinatorics; Minor (academic); Edge coloring; Greedy coloring; Graph coloring; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Algorithm; Graph; Computer science; Line graph; Artificial intelligence","score_opus":0.016258947904050584,"score_gpt":0.2693119762721733,"score_spread":0.2530530283681227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409341382","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.00032985964,0.00050972326,0.99508446,0.00073258515,0.00011033951,0.00089303934,0.00006735729,0.00018772364,0.0020849118],"genre_scores_gemma":[0.0051294127,0.00006873118,0.9921595,0.00015609775,0.00002258536,0.0014730815,0.000023725277,0.000017226488,0.0009496641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873435,0.00001075353,0.000363129,0.00044391284,0.00015525834,0.00029259932],"domain_scores_gemma":[0.99858075,0.00020458768,0.00015582953,0.0008066898,0.00014775412,0.00010437819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029002829,0.00018593266,0.0002349801,0.00017162964,0.00046732192,0.0002455421,0.0006655311,0.000073687406,0.0000021243227],"category_scores_gemma":[0.000031104948,0.00016665059,0.000097331314,0.00052172993,0.000093967305,0.00015081312,0.00031789116,0.000099707904,0.0000049068285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.9846026e-7,0.00006709029,0.000008369218,0.000064451415,0.000030936284,1.9638324e-7,0.00012903669,0.000012897262,0.000110885376,0.8926497,0.0005784447,0.1063477],"study_design_scores_gemma":[0.00043219927,0.000027318858,0.000029846606,0.000046151476,0.000034940007,0.0000027587023,0.0001393784,0.3709751,0.0005379954,0.62184817,0.005753817,0.00017231077],"about_ca_topic_score_codex":0.000011954881,"about_ca_topic_score_gemma":0.0000025086786,"teacher_disagreement_score":0.3709622,"about_ca_system_score_codex":0.000014641099,"about_ca_system_score_gemma":0.000045028868,"threshold_uncertainty_score":0.67958134},"labels":[],"label_agreement":null},{"id":"W4409409466","doi":"10.28924/2291-8639-23-2025-87","title":"Some New Versions of Various Inequalities over Trapezoidal Fuzzy Codomain","year":2025,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","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; Fuzzy logic; Inequality; Computer science; Artificial intelligence; Mathematical analysis","score_opus":0.009200427390800361,"score_gpt":0.27404479083586997,"score_spread":0.2648443634450696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409409466","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.09304062,0.001570758,0.898885,0.0055162036,0.00020560632,0.00006751353,0.00001707669,0.000017015103,0.0006802034],"genre_scores_gemma":[0.9876107,0.00033693132,0.011260116,0.0003775036,0.000037555576,0.00000264946,0.000004151915,0.0000018618249,0.0003685496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990229,0.000028957094,0.00045879596,0.0001224713,0.00029786324,0.000069000285],"domain_scores_gemma":[0.99895644,0.00014360296,0.0003066608,0.00017055227,0.00035501912,0.00006772748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026667851,0.000066061555,0.00019766235,0.00074096804,0.000060503127,0.000077164776,0.00052399654,0.000032589793,0.000011912491],"category_scores_gemma":[0.000019697789,0.000055956523,0.00019530358,0.00071783597,0.00005047824,0.00021452142,0.00009523578,0.00008497502,0.0000011638286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008206919,0.000111598754,0.0032101318,0.0000036908905,0.0012046915,0.000001801883,0.00019584985,0.00092312,0.0021298088,0.9814218,0.0011552665,0.009633988],"study_design_scores_gemma":[0.0014782986,0.00008891196,0.020349467,0.00007468523,0.00090657116,0.000020813184,0.00022805465,0.008155235,0.002789143,0.94984394,0.015864281,0.00020057384],"about_ca_topic_score_codex":0.0001256773,"about_ca_topic_score_gemma":0.00001330384,"teacher_disagreement_score":0.89457005,"about_ca_system_score_codex":0.000018211755,"about_ca_system_score_gemma":0.00012408417,"threshold_uncertainty_score":0.22818407},"labels":[],"label_agreement":null},{"id":"W4410077621","doi":"10.1007/978-981-96-4445-2_19","title":"Acyclically Edge Color Triangle-free Toroidal Graphs in $$\\varDelta + 2$$ Colors","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Toroid; Computer science; Enhanced Data Rates for GSM Evolution; Computer graphics (images); Combinatorics; Computer vision; Physics; Mathematics; Nuclear physics","score_opus":0.012943836781971658,"score_gpt":0.23486119765572597,"score_spread":0.2219173608737543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410077621","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.0010649472,0.0014445969,0.9779721,0.0035794678,0.004485693,0.0010533927,0.000024838775,0.00041345545,0.00996152],"genre_scores_gemma":[0.14148848,0.00029848333,0.8404006,0.012806241,0.00025511588,0.00012516964,0.000033005377,0.000121783465,0.0044711363],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939548,0.00010462032,0.0011261718,0.0024254634,0.0012772143,0.0011117255],"domain_scores_gemma":[0.995109,0.0011118003,0.0003722839,0.0027384097,0.00036998544,0.00029848708],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019552172,0.0007776961,0.0010598905,0.0023347577,0.00030767554,0.0006309188,0.007070133,0.00067107356,0.000024580178],"category_scores_gemma":[0.00055403117,0.0007181316,0.0002987467,0.0021269394,0.0009782272,0.00053983013,0.0033467254,0.0013503123,0.000049830334],"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.00007838981,0.0002557573,0.0002642058,0.00014466619,0.000047498765,0.00046614316,0.001134215,0.022530098,0.00069275947,0.4833955,0.002316392,0.4886744],"study_design_scores_gemma":[0.001713573,0.00039846316,0.0002218136,0.0008436505,0.000016120961,0.000042084353,2.8602187e-7,0.19775832,0.0005506857,0.7924981,0.004890385,0.0010665252],"about_ca_topic_score_codex":0.0001471263,"about_ca_topic_score_gemma":0.0007495786,"teacher_disagreement_score":0.48760787,"about_ca_system_score_codex":0.0003449107,"about_ca_system_score_gemma":0.0013278797,"threshold_uncertainty_score":0.999527},"labels":[],"label_agreement":null},{"id":"W4410278577","doi":"10.61091/jcmcc125-30","title":"Linear preservers of tree partition numbers of graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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":"Partition (number theory); Mathematics; Combinatorics; Tree (set theory)","score_opus":0.012863395535833416,"score_gpt":0.2541352396418222,"score_spread":0.24127184410598881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410278577","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.956231,0.0005279131,0.02866786,0.00024816013,0.012251026,0.00023131094,0.0000014717848,0.000039689152,0.0018015944],"genre_scores_gemma":[0.9802131,0.000040125407,0.019670162,0.000014279905,0.000045667115,7.209576e-7,4.1124113e-7,0.000009052354,0.000006478264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974662,0.00011910783,0.0014101749,0.00018609077,0.0005967014,0.00022170602],"domain_scores_gemma":[0.9965844,0.00058603403,0.0014418514,0.00036119993,0.00091902586,0.00010747152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016852602,0.00019161975,0.0007310033,0.0003803863,0.00011960574,0.000063600324,0.00069662876,0.0001326269,0.0000016077566],"category_scores_gemma":[0.00043092496,0.00016993523,0.00024378666,0.00078415504,0.00011337788,0.00025713394,0.00030689413,0.00027583927,3.5270492e-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.000044165005,0.000478797,0.00041300396,0.00031139902,0.00011993453,0.0000038036665,0.00057712453,0.000119455115,0.0019424737,0.9948177,0.00028214641,0.00089000846],"study_design_scores_gemma":[0.003161712,0.0005679392,0.00012428587,0.00074154127,0.000078424055,0.000012338217,0.000117411946,0.013841362,0.011581105,0.9695356,0.00009820748,0.00014009216],"about_ca_topic_score_codex":0.000020628859,"about_ca_topic_score_gemma":4.0148282e-7,"teacher_disagreement_score":0.025282107,"about_ca_system_score_codex":0.000023942759,"about_ca_system_score_gemma":0.0001788531,"threshold_uncertainty_score":0.69297576},"labels":[],"label_agreement":null},{"id":"W4410610645","doi":"10.61091/jcmcc126-15","title":"On multiset dimension of cylindrical graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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":"Ateneo de Manila University","keywords":"Multiset; Dimension (graph theory); Mathematics; Combinatorics; Fourth Dimension; Discrete mathematics; Physics; Quantum mechanics","score_opus":0.011362870538432074,"score_gpt":0.25452279906932157,"score_spread":0.2431599285308895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410610645","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94117224,0.00048027042,0.035848565,0.00040706366,0.020455822,0.00025711616,0.0000011184993,0.00006317182,0.001314615],"genre_scores_gemma":[0.9812489,0.000026262003,0.018592188,0.00006707417,0.00004734291,7.363873e-7,3.544335e-7,0.0000114388495,0.0000057016437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973625,0.00013004582,0.0012805337,0.00025851754,0.0006929631,0.0002754711],"domain_scores_gemma":[0.99650663,0.001206478,0.0010163832,0.000416422,0.00070409616,0.00015000482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015589092,0.00025001806,0.0007658303,0.00051289005,0.0002094708,0.00013439213,0.0007143133,0.00016516817,0.0000014127756],"category_scores_gemma":[0.00063296343,0.00020557654,0.00022866194,0.0007458902,0.000107578824,0.00017383667,0.00037908065,0.00044929198,0.0000013751209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055254095,0.0006989302,0.00008167081,0.00010773688,0.00007529323,0.00001244062,0.0003543297,0.000110761925,0.001220597,0.99480224,0.0004318322,0.0020489092],"study_design_scores_gemma":[0.0037017602,0.00089404586,0.000091260255,0.0007261664,0.000048820595,0.000025438798,0.000043487697,0.0194336,0.0035585435,0.97120625,0.000094884665,0.00017576052],"about_ca_topic_score_codex":0.0000058000605,"about_ca_topic_score_gemma":6.882132e-8,"teacher_disagreement_score":0.040076643,"about_ca_system_score_codex":0.00003626758,"about_ca_system_score_gemma":0.00014468188,"threshold_uncertainty_score":0.8383168},"labels":[],"label_agreement":null},{"id":"W4411069802","doi":"10.5267/j.ijdns.2025.4.002","title":"Maximizing edge connectivity in graph partitioning using hotspots","year":2025,"lang":"en","type":"article","venue":"International Journal of Data and Network Science","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":true,"ca_institutions":"","funders":"","keywords":"Computer science; Graph; Enhanced Data Rates for GSM Evolution; Theoretical computer science; Artificial intelligence","score_opus":0.04503719011370133,"score_gpt":0.33127705083696146,"score_spread":0.28623986072326013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411069802","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7284594,0.00091097935,0.26690516,0.0013685114,0.002037001,0.000037656428,0.0000030720453,0.000012080015,0.00026611585],"genre_scores_gemma":[0.9563531,0.00012152206,0.043080233,0.00040859068,0.0000306592,2.4283705e-7,6.2535725e-7,0.0000012624271,0.0000037441034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988397,0.000041398845,0.00030490683,0.00024817738,0.0003867107,0.00017913799],"domain_scores_gemma":[0.99909073,0.00013215511,0.00018551957,0.0002535883,0.0002861909,0.00005183096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002287509,0.00006200197,0.00011443666,0.00042998372,0.00015707487,0.0003324702,0.0018065508,0.000020164896,0.0000014600123],"category_scores_gemma":[0.00017295672,0.000054346096,0.000020049923,0.0010097611,0.00018572468,0.0021089327,0.0008089427,0.00014302654,3.7461993e-7],"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.000112777576,0.0003188326,0.25952318,0.000021193528,0.00013130881,0.00027972533,0.00081556645,0.080568194,0.01661622,0.44313228,0.0036081825,0.19487253],"study_design_scores_gemma":[0.0010199391,0.00005138632,0.04870932,0.00089534675,0.000013081684,0.00026789488,0.00006303592,0.75256914,0.0007539782,0.19460669,0.0008531084,0.00019707785],"about_ca_topic_score_codex":0.000030122877,"about_ca_topic_score_gemma":0.00001668232,"teacher_disagreement_score":0.67200094,"about_ca_system_score_codex":0.000034146542,"about_ca_system_score_gemma":0.00023611764,"threshold_uncertainty_score":0.3357051},"labels":[],"label_agreement":null},{"id":"W4411491172","doi":"10.1016/j.jctb.2025.06.002","title":"Hyperbolicity theorems for correspondence colouring","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.0074636932120930605,"score_gpt":0.24771919893624686,"score_spread":0.2402555057241538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411491172","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5080636,0.0020786095,0.42235604,0.0041741095,0.054513644,0.00061171886,0.0000064890264,0.00021517345,0.00798062],"genre_scores_gemma":[0.9905691,0.000037837814,0.008051412,0.00036504786,0.00008727989,0.0000063602147,2.1315024e-7,0.000007805284,0.0008749532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986523,0.00021156922,0.0004904191,0.000160291,0.0002563792,0.00022905703],"domain_scores_gemma":[0.9978809,0.00078628346,0.0003410873,0.00032396291,0.0005815261,0.000086255815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025418608,0.00013464765,0.00031638605,0.00022634068,0.0002272933,0.00016015854,0.0009804404,0.00008520952,0.00000678899],"category_scores_gemma":[0.0008113522,0.000108334374,0.00017851678,0.00042629274,0.00014024816,0.0005831208,0.00016204573,0.00021030944,0.000001796446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065611367,0.000076279444,0.000058245958,0.000016269594,0.00004432637,0.000006854106,0.00022134882,0.0000745685,0.0039793164,0.99136376,0.0015262567,0.0019766463],"study_design_scores_gemma":[0.001214463,0.00041705725,0.000051397903,0.00009597113,0.000021105947,0.000037907004,0.0000769877,0.00020867254,0.019922154,0.9648246,0.013024028,0.00010564326],"about_ca_topic_score_codex":0.0000013532562,"about_ca_topic_score_gemma":1.9980139e-7,"teacher_disagreement_score":0.48250547,"about_ca_system_score_codex":0.000039052833,"about_ca_system_score_gemma":0.00024829977,"threshold_uncertainty_score":0.44177476},"labels":[],"label_agreement":null},{"id":"W4411599111","doi":"10.61091/jcmcc126-20","title":"On dominator coloring of corona products of some generalized graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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":"Corona (planetary geology); Mathematics; Greedy coloring; Fractional coloring; Combinatorics; Physics; Graph; Astrobiology","score_opus":0.012828326919634125,"score_gpt":0.24745436179422822,"score_spread":0.2346260348745941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411599111","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97859293,0.00083966856,0.0035625598,0.00024075326,0.016056346,0.00029460975,0.0000013824736,0.000034973436,0.00037678954],"genre_scores_gemma":[0.9835088,0.00005638416,0.016292043,0.000037347545,0.00007903241,0.0000016631665,3.662399e-7,0.000015409489,0.000008952189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967815,0.000155682,0.0016896639,0.0002966,0.00077029923,0.0003062212],"domain_scores_gemma":[0.9954002,0.0009454645,0.0018287293,0.00050172576,0.001199711,0.00012417708],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002154029,0.00028719974,0.0010914047,0.0006011729,0.00017281897,0.00009851601,0.0008894752,0.00015197296,0.0000012492097],"category_scores_gemma":[0.0008537712,0.00024703483,0.00023010655,0.0008960422,0.00015973045,0.00026837178,0.00038918547,0.0003692616,4.8796005e-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.00012239043,0.000733997,0.00007131362,0.00043328575,0.00014309045,0.00000752005,0.0004699193,0.000112440226,0.0080316765,0.98868686,0.0002502573,0.0009372581],"study_design_scores_gemma":[0.005027507,0.0010298889,0.00006772593,0.0009651767,0.000076478376,0.00001649758,0.00005247772,0.004393602,0.039090876,0.94901174,0.00007271938,0.00019527927],"about_ca_topic_score_codex":0.000009961133,"about_ca_topic_score_gemma":6.6245676e-8,"teacher_disagreement_score":0.03967508,"about_ca_system_score_codex":0.00004596371,"about_ca_system_score_gemma":0.0002928101,"threshold_uncertainty_score":0.9999982},"labels":[],"label_agreement":null},{"id":"W4411687188","doi":"10.61091/um123-04","title":"Facial entire coloring of 4-minor-free graphs","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","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; Minor (academic); Humanities; Art","score_opus":0.014731676806994018,"score_gpt":0.2484096821178653,"score_spread":0.23367800531087127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411687188","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7232675,0.0018833979,0.11258657,0.0027319633,0.001725226,0.0009772547,0.000025171717,0.00095416396,0.15584877],"genre_scores_gemma":[0.9491394,0.0000066436883,0.04996872,0.00009376553,0.0000017793412,0.000018767623,7.73961e-7,0.0000050062304,0.0007651106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880445,0.000037963073,0.00039689755,0.00027729548,0.00025221484,0.00023116177],"domain_scores_gemma":[0.9985867,0.00014801371,0.000092162336,0.001018571,0.00009939492,0.000055151424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039980866,0.00012585954,0.00025065275,0.00022082968,0.00010056006,0.000042264313,0.000967707,0.00005886125,0.000035250516],"category_scores_gemma":[0.00025549778,0.000109504894,0.00012100215,0.000603158,0.0001100274,0.00012856106,0.00044587336,0.0000857677,0.000031393374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003165951,0.00010706279,0.00020919526,0.00018001937,0.000030668187,0.0000019538463,0.0005752293,0.0000031316706,0.00095613935,0.98968136,0.0026825834,0.0055694906],"study_design_scores_gemma":[0.0003649787,0.000044878987,0.00035686896,0.00018593797,0.00002013482,0.0000024657209,0.00008577045,0.0060087545,0.00494428,0.98702395,0.00085168856,0.000110286375],"about_ca_topic_score_codex":0.000011641952,"about_ca_topic_score_gemma":0.0000021540475,"teacher_disagreement_score":0.22587195,"about_ca_system_score_codex":0.000010127082,"about_ca_system_score_gemma":0.00005318679,"threshold_uncertainty_score":0.446548},"labels":[],"label_agreement":null},{"id":"W4411687200","doi":"10.61091/um123-02","title":"On some metric properties of supertoken graphs","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","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":"Agència de Gestió d'Ajuts Universitaris i de Recerca; Universitat Politècnica de Catalunya; Ministerio de Ciencia e Innovación","keywords":"Mathematics; Metric (unit); Marketing; Business","score_opus":0.02037943116567932,"score_gpt":0.23720330431239264,"score_spread":0.2168238731467133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411687200","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9336552,0.0072445287,0.016295644,0.0048470437,0.0007850324,0.00091622694,0.0000063274188,0.00074571534,0.035504296],"genre_scores_gemma":[0.98976433,0.000016337006,0.009216379,0.0003488479,7.579048e-7,0.000020771007,3.3614177e-7,0.00000533175,0.00062689267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988269,0.00005373379,0.00035923015,0.00026896413,0.00028264723,0.00020850232],"domain_scores_gemma":[0.99886286,0.00016168857,0.00006014573,0.0007694477,0.000097241245,0.000048630318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041282104,0.00013077504,0.00025619927,0.0005238956,0.00007897918,0.00004003867,0.0006170913,0.00005012888,0.000016677048],"category_scores_gemma":[0.00033818447,0.000091185524,0.00010853708,0.0009980196,0.00009895274,0.00016620256,0.00017259573,0.000096789816,0.000065205466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004492998,0.00018702181,0.000012556013,0.00020188939,0.000031380107,8.7839584e-7,0.00035126336,0.000008195349,0.0020233486,0.9936112,0.0018933248,0.0016744614],"study_design_scores_gemma":[0.00021566504,0.000078951474,0.000045655615,0.00032845495,0.000014414647,0.0000014932367,0.000041718882,0.009746094,0.023836747,0.9654783,0.00011530817,0.000097172226],"about_ca_topic_score_codex":0.000010198857,"about_ca_topic_score_gemma":3.1212002e-7,"teacher_disagreement_score":0.05610916,"about_ca_system_score_codex":0.000010918584,"about_ca_system_score_gemma":0.000054010525,"threshold_uncertainty_score":0.37184379},"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":"W4412230275","doi":"10.4230/lipics.mfcs.2023.8","title":"Recognizing H-Graphs - Beyond Circular-Arc Graphs","year":2023,"lang":"en","type":"article","venue":"Jagiellonian University Repository (Jagiellonian University)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Grantová Agentura České Republiky","keywords":"Combinatorics; Arc (geometry); Mathematics; Computer science; Geometry","score_opus":0.011845527318952158,"score_gpt":0.1797536618557546,"score_spread":0.16790813453680242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412230275","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7532704,0.0003217665,0.009281383,0.0037895865,0.0040810057,0.0011019784,0.00004712862,0.007053987,0.2210528],"genre_scores_gemma":[0.9276493,0.0004461858,0.007320843,0.0004070915,0.00003960526,7.48077e-7,0.000038679747,0.00007929421,0.06401825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99517393,0.00052133045,0.00043384996,0.001762562,0.0008071609,0.001301143],"domain_scores_gemma":[0.9962187,0.00024995676,0.0003777529,0.0018694672,0.0004420022,0.0008421322],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005646496,0.0006283545,0.0006044246,0.0031966656,0.002068537,0.00035603202,0.0029964221,0.00049676746,0.000033940152],"category_scores_gemma":[0.000040509665,0.00080311287,0.0006694229,0.007967487,0.00053614314,0.0017930894,0.0012543557,0.0008185763,0.00054083875],"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.00030095642,0.0008146614,0.042028464,0.00033177773,0.0012671275,0.031894732,0.007493949,0.0020767883,0.05246535,0.81299335,0.035773292,0.012559549],"study_design_scores_gemma":[0.012812758,0.0014596136,0.026274662,0.00085694867,0.0011423267,0.0011959098,0.0133472085,0.032717317,0.021322599,0.07288194,0.8075451,0.008443591],"about_ca_topic_score_codex":0.00053211715,"about_ca_topic_score_gemma":0.00006537306,"teacher_disagreement_score":0.77177185,"about_ca_system_score_codex":0.000339573,"about_ca_system_score_gemma":0.00044751598,"threshold_uncertainty_score":0.999442},"labels":[],"label_agreement":null},{"id":"W4412402095","doi":"10.55016/ojs/cdm.v10i2.62216","title":"On the chromatic index of Latin squares","year":2016,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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":"Latin square; Mathematics; Index (typography); Combinatorics; Chromatic scale; Statistics; Computer science; Biology","score_opus":0.01604076548206836,"score_gpt":0.2581452710296603,"score_spread":0.24210450554759191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412402095","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.09460311,0.000034681387,0.8902326,0.0134154,0.00009695463,0.00037227877,0.00006411437,0.0001167976,0.0010640345],"genre_scores_gemma":[0.99188304,0.0000024166172,0.007542624,0.00023897241,0.000004575437,0.000040916217,0.0000010534006,0.0000067393667,0.00027966037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988901,0.000058556594,0.00035609995,0.00017444417,0.00029520938,0.00022559329],"domain_scores_gemma":[0.9976641,0.0010348464,0.00014550716,0.0008558021,0.00021323274,0.00008651718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004961856,0.000118786025,0.00019013796,0.00013480392,0.00015365242,0.000051800318,0.0006220947,0.000043053198,0.000035142464],"category_scores_gemma":[0.0014323262,0.00005597074,0.00008274751,0.0005334991,0.00008912039,0.000083563755,0.00017239056,0.00005733849,0.0002452043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014383169,0.00004952133,0.000026145191,0.0000126024215,0.000014861441,5.4218185e-7,0.00031386595,0.00004298766,0.0034836833,0.99345464,0.0021368954,0.00046281787],"study_design_scores_gemma":[0.00037230217,0.00013750787,0.00028273303,0.00045103885,0.000012960187,0.0000030742992,0.00004534174,0.014875536,0.009797,0.9735576,0.00031451107,0.00015037468],"about_ca_topic_score_codex":0.0000030818005,"about_ca_topic_score_gemma":0.0000017698115,"teacher_disagreement_score":0.8972799,"about_ca_system_score_codex":0.000030036443,"about_ca_system_score_gemma":0.000044421842,"threshold_uncertainty_score":0.31516874},"labels":[],"label_agreement":null},{"id":"W4412402096","doi":"10.55016/ojs/cdm.v10i2.62253","title":"A Lower Bound for Radio k-chromatic Number of an Arbitrary Graph","year":2016,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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; Chromatic scale; Graph; Windmill graph; Upper and lower bounds; Friendship graph; Discrete mathematics; Graph power; Line graph","score_opus":0.012929653346634677,"score_gpt":0.28469703053284234,"score_spread":0.2717673771862077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412402096","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.14487013,0.000052329764,0.85198474,0.0015363148,0.00020297342,0.0005653757,0.00021359176,0.00016151245,0.0004130613],"genre_scores_gemma":[0.64438254,0.000005474613,0.35492304,0.00016521946,0.000016389728,0.00013799671,0.000009948774,0.000020087213,0.00033928856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849826,0.00004311017,0.0005241072,0.0003122744,0.00025311712,0.00036913142],"domain_scores_gemma":[0.9978895,0.00038546164,0.0001782712,0.0009405365,0.00037664917,0.00022959184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005538105,0.00017787942,0.00033921245,0.00012659443,0.00017817706,0.00008912705,0.0006109513,0.000078886645,0.000027636288],"category_scores_gemma":[0.0004746008,0.000118933276,0.00017643797,0.00041533372,0.00011616472,0.0003648551,0.00011735042,0.000049806575,0.00007524347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008012792,0.00021533706,0.000016670649,0.00006416007,0.00004581084,0.000002213357,0.00037037808,0.000006430713,0.007286986,0.99005765,0.0009717627,0.00095461606],"study_design_scores_gemma":[0.000996248,0.00021009149,0.000043501557,0.0002923324,0.000045973677,0.00003345388,0.000026590287,0.007928127,0.008347183,0.9810984,0.0007152406,0.00026282316],"about_ca_topic_score_codex":0.000005504571,"about_ca_topic_score_gemma":0.0000030375911,"teacher_disagreement_score":0.49951243,"about_ca_system_score_codex":0.000036933816,"about_ca_system_score_gemma":0.0000901908,"threshold_uncertainty_score":0.48499584},"labels":[],"label_agreement":null},{"id":"W4412402130","doi":"10.55016/ojs/cdm.v10i2.62320","title":"Triangle-free Uniquely 3-Edge Colorable Cubic Graphs","year":2016,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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 Science Foundation","keywords":"Combinatorics; Mathematics; Enhanced Data Rates for GSM Evolution; Cubic graph; Discrete mathematics; Graph; Computer science; Line graph; Artificial intelligence","score_opus":0.015254640304786907,"score_gpt":0.2641215160142489,"score_spread":0.24886687570946198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412402130","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.018007062,0.0002703677,0.9589034,0.017327327,0.0004036734,0.0007462312,0.00025808037,0.0007056248,0.0033782334],"genre_scores_gemma":[0.82953507,0.000055834513,0.16509248,0.00085744803,0.000018781817,0.00026263873,0.000012477397,0.000041742533,0.004123503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793434,0.00009995339,0.0005588063,0.00044829305,0.00036252217,0.0005960633],"domain_scores_gemma":[0.99673873,0.00047799628,0.00017236941,0.0017380205,0.0005077226,0.0003651812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091896305,0.00024653433,0.00039900895,0.00028799035,0.0003524761,0.00019649813,0.0014511349,0.00011811765,0.00004636598],"category_scores_gemma":[0.0017358828,0.00016290814,0.00018998198,0.0010457044,0.00011786166,0.00037744542,0.0005572873,0.000110033296,0.0005584735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004840933,0.00009050166,0.000021329406,0.000014853909,0.00002875797,0.000005905372,0.00019054658,0.000009031965,0.0057315496,0.9785949,0.014376734,0.00093105325],"study_design_scores_gemma":[0.0014237523,0.00016108375,0.000042121323,0.00021161172,0.00003192321,0.000019427029,0.00002568865,0.0021508867,0.01004563,0.9786099,0.006938613,0.00033933664],"about_ca_topic_score_codex":0.000009551539,"about_ca_topic_score_gemma":0.000009446358,"teacher_disagreement_score":0.811528,"about_ca_system_score_codex":0.00010060078,"about_ca_system_score_gemma":0.0001393315,"threshold_uncertainty_score":0.7178234},"labels":[],"label_agreement":null},{"id":"W4412475603","doi":"10.28924/2291-8639-23-2025-173","title":"Regular Fuzzy Graphs with Chromatic Numbers","year":2025,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","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":"University of Phayao","keywords":"Mathematics; Chromatic scale; Fuzzy logic; Combinatorics; Linguistics","score_opus":0.0035009671539736114,"score_gpt":0.24120997636421426,"score_spread":0.23770900921024066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412475603","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.06335714,0.0004887777,0.92846936,0.0051079392,0.00007361498,0.00006629892,0.0000021404844,0.000021735385,0.0024129697],"genre_scores_gemma":[0.97080445,0.00012052818,0.028545678,0.00033288656,0.000009063319,0.000008299962,0.0000024319713,0.0000018551251,0.00017479672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992091,0.000019546243,0.00029841455,0.00013166435,0.00027608057,0.00006521763],"domain_scores_gemma":[0.9989907,0.000052464213,0.00023194535,0.0001921852,0.00048025663,0.000052408708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022297165,0.000063925916,0.00015075073,0.00064548024,0.00007462114,0.00014431725,0.0005003786,0.000021161703,0.000005170969],"category_scores_gemma":[0.000008685816,0.000046535115,0.0001179813,0.0011644508,0.000054401386,0.0001705403,0.000054419295,0.00007188674,0.0000018167768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007467915,0.00011489417,0.008881871,0.0000051777424,0.0023376285,0.0000067359224,0.00009044018,0.0013664868,0.00078755774,0.9683386,0.0005469119,0.017516218],"study_design_scores_gemma":[0.0013913189,0.000112763526,0.031140992,0.00015622494,0.001550555,0.00014305202,0.00020207245,0.015555562,0.0019483306,0.93322486,0.014269834,0.00030443477],"about_ca_topic_score_codex":0.0000221353,"about_ca_topic_score_gemma":0.000013477135,"teacher_disagreement_score":0.90744734,"about_ca_system_score_codex":0.000014831009,"about_ca_system_score_gemma":0.000049930266,"threshold_uncertainty_score":0.1897647},"labels":[],"label_agreement":null},{"id":"W4412582193","doi":"10.55016/ojs/cdm.v12i2.62287","title":"The Forcing Strong Metric Dimension of a Graph","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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; Dimension (graph theory); Graph; Metric (unit); Forcing (mathematics); Discrete mathematics; Mathematical analysis","score_opus":0.017901472927710552,"score_gpt":0.29517904130806233,"score_spread":0.2772775683803518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582193","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.029564485,0.00040799886,0.96427447,0.0035485374,0.00034305235,0.00042593517,0.000032676828,0.00009935935,0.001303513],"genre_scores_gemma":[0.9658943,0.000021053944,0.033869997,0.000030733885,0.0000072548337,0.000025781652,0.0000018096189,0.0000074946533,0.00014160397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986784,0.000037403242,0.00040658136,0.00021787794,0.00032678488,0.00033298266],"domain_scores_gemma":[0.99701273,0.00035154968,0.00036092987,0.0017264861,0.00041868573,0.00012959911],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00095771113,0.00013170748,0.00022920893,0.00014776453,0.0016545408,0.0003939218,0.0013056531,0.000048730057,0.0000014486099],"category_scores_gemma":[0.0017924168,0.00008520922,0.00013354018,0.00037253948,0.00014025309,0.0002443892,0.00058879843,0.00010569299,0.0000250243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019601187,0.00003245772,0.00008438269,0.000013662417,0.000027902275,0.0000010825344,0.00022776988,0.00021099106,0.0013658853,0.9958902,0.00047369173,0.0016699947],"study_design_scores_gemma":[0.0009247419,0.00020213584,0.0010861338,0.00032466865,0.00008739141,0.000014875375,0.0002759822,0.16833822,0.016677853,0.8105129,0.0011578815,0.00039719412],"about_ca_topic_score_codex":0.00002350202,"about_ca_topic_score_gemma":0.000009055815,"teacher_disagreement_score":0.9363298,"about_ca_system_score_codex":0.000027515685,"about_ca_system_score_gemma":0.000049360842,"threshold_uncertainty_score":0.9996452},"labels":[],"label_agreement":null},{"id":"W4412582248","doi":"10.55016/ojs/cdm.v12i2.62380","title":"On Chromatic Number of General Kneser Graphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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; Chromatic scale; Discrete mathematics","score_opus":0.014544447626875321,"score_gpt":0.30835567676570436,"score_spread":0.293811229138829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582248","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5610556,0.00004155038,0.41865808,0.0036113996,0.0005094995,0.0005862516,0.00012119762,0.00017826913,0.015238187],"genre_scores_gemma":[0.92541516,0.000003466068,0.07370066,0.00014744006,0.000007753544,0.000034314864,0.000004297915,0.000010461558,0.0006764498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987013,0.000032584398,0.00039526328,0.00025509694,0.00031961995,0.00029615773],"domain_scores_gemma":[0.99735934,0.00012894283,0.0002796612,0.0017771166,0.00029125906,0.00016367371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039749613,0.00016287254,0.00030451492,0.000098117765,0.0005065675,0.00022980759,0.00110348,0.000066768705,0.000044878903],"category_scores_gemma":[0.00081740983,0.00012984422,0.0001390633,0.00018707642,0.00011794713,0.00021308233,0.0003284804,0.00009574093,0.00042243968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017339878,0.00009760195,0.00010807009,0.000029718694,0.00002592661,0.0000027545043,0.00024720628,0.00007528782,0.0011504869,0.99608207,0.0019824218,0.00019672209],"study_design_scores_gemma":[0.0005055673,0.0000771139,0.0008327802,0.00020671175,0.000025814836,0.000013978409,0.000011892243,0.026779333,0.005219526,0.96592927,0.00017791231,0.00022009501],"about_ca_topic_score_codex":0.000019008972,"about_ca_topic_score_gemma":0.0000026265193,"teacher_disagreement_score":0.3643596,"about_ca_system_score_codex":0.000025483652,"about_ca_system_score_gemma":0.00004603034,"threshold_uncertainty_score":0.5429748},"labels":[],"label_agreement":null},{"id":"W4412582259","doi":"10.55016/ojs/cdm.v12i2.62479","title":"On the metric dimension of circulant graphs with 4 generators","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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":"National Research Foundation","keywords":"Circulant matrix; Mathematics; Metric dimension; Dimension (graph theory); Combinatorics; Metric (unit); Discrete mathematics; Graph; Chordal graph; 1-planar graph","score_opus":0.016319587907723282,"score_gpt":0.2642509834178813,"score_spread":0.247931395510158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582259","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.47062013,0.00012246848,0.52122205,0.005778768,0.00021707607,0.0006458452,0.000066799534,0.000112850656,0.0012140038],"genre_scores_gemma":[0.98243874,0.0000060137636,0.017290676,0.00018290135,0.0000040286964,0.000031134114,0.0000025695201,0.000008631223,0.000035274916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987935,0.00004617044,0.00027941514,0.00024533522,0.00038749713,0.00024810742],"domain_scores_gemma":[0.9971776,0.00027555833,0.0002821385,0.0017936372,0.00035195175,0.000119114506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006076475,0.0001513301,0.00023726112,0.00017774195,0.00080904464,0.00022014484,0.0009980045,0.00004523252,0.000005247276],"category_scores_gemma":[0.0008772316,0.00008157634,0.0000890159,0.0004558856,0.0001369673,0.00012238992,0.00024454558,0.00010846309,0.00003886034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029282496,0.00006506961,0.00007692515,0.0000096326685,0.000033802295,0.0000030124952,0.00018960527,0.00032579587,0.0016079372,0.9968376,0.0006643387,0.00018335451],"study_design_scores_gemma":[0.00095277315,0.00052901584,0.0010343101,0.00043689483,0.000101881415,0.00002688834,0.000116162446,0.06541271,0.047282796,0.8834035,0.00023396025,0.00046913937],"about_ca_topic_score_codex":0.000014810255,"about_ca_topic_score_gemma":0.0000033839162,"teacher_disagreement_score":0.51181865,"about_ca_system_score_codex":0.00002313198,"about_ca_system_score_gemma":0.00005249239,"threshold_uncertainty_score":0.6222599},"labels":[],"label_agreement":null},{"id":"W4412617746","doi":"10.55016/ojs/cdm.v12i1.62581","title":"Conjectures on uniquely 3-edge-colorable graphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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; Enhanced Data Rates for GSM Evolution; Edge coloring; Discrete mathematics; Graph; Computer science; Line graph; Artificial intelligence","score_opus":0.018878948315707942,"score_gpt":0.30164947933759173,"score_spread":0.28277053102188376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617746","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.103090696,0.00027371853,0.8270787,0.02689476,0.0014390487,0.0017531071,0.00027247026,0.0011685181,0.03802895],"genre_scores_gemma":[0.9584468,0.000010886721,0.03974871,0.00081923837,0.00000915152,0.00007626424,0.000007054164,0.000015715701,0.0008661884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984778,0.000047275375,0.00033258824,0.00039201495,0.000306402,0.00044390283],"domain_scores_gemma":[0.99693024,0.00018430734,0.00022621409,0.0020336285,0.00036373577,0.00026184766],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005669508,0.00022027805,0.00030191685,0.00017182779,0.0013631058,0.000792619,0.0015266759,0.00010381835,0.000017573828],"category_scores_gemma":[0.001282796,0.00017682422,0.00013422318,0.00021906332,0.00014237367,0.00027765584,0.00040005206,0.00018834465,0.00035748782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036923443,0.00007950138,0.000032266096,0.0000135317005,0.000023560888,0.000007169607,0.00027397144,0.000150028,0.00081435527,0.9926761,0.005516636,0.0004092343],"study_design_scores_gemma":[0.0005579086,0.0002102257,0.00050880836,0.00016402964,0.000024842368,0.0000121382145,0.000027185626,0.011274373,0.008199714,0.9743006,0.004377297,0.00034288177],"about_ca_topic_score_codex":0.000024200946,"about_ca_topic_score_gemma":0.000010550792,"teacher_disagreement_score":0.8553561,"about_ca_system_score_codex":0.000048237966,"about_ca_system_score_gemma":0.00008267759,"threshold_uncertainty_score":0.999937},"labels":[],"label_agreement":null},{"id":"W4412617764","doi":"10.55016/ojs/cdm.v12i1.62318","title":"STAR SUPER EDGE MAGIC DEFICIENCY OF GRAPHS","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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; Star (game theory); MAGIC (telescope); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Astrophysics; Artificial intelligence; Physics","score_opus":0.018467501203954205,"score_gpt":0.28791336142901,"score_spread":0.2694458602250558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617764","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.2564186,0.0004640037,0.72934204,0.0045475652,0.00055772736,0.0006703865,0.00023987514,0.00023571082,0.007524092],"genre_scores_gemma":[0.9307654,0.000013450896,0.06885754,0.0000821674,0.0000051771426,0.000016240203,0.0000049675887,0.000009109206,0.00024593362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855816,0.000030070009,0.00043246715,0.00029557163,0.00031828726,0.00036545505],"domain_scores_gemma":[0.9971569,0.00009597415,0.00023346195,0.0018528911,0.00047962245,0.00018111347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005727095,0.00016203188,0.0002933598,0.0001603811,0.00057640916,0.0002616907,0.0014598883,0.00006610419,0.000020044237],"category_scores_gemma":[0.0008378799,0.00013342738,0.00014084713,0.00026053152,0.00018740147,0.00032480012,0.0005008026,0.000105082014,0.00015337273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012988606,0.000102011145,0.00020622382,0.000035349614,0.000011952886,0.0000025915306,0.00049193506,0.000022891956,0.0026727626,0.9951346,0.0010148137,0.0003035525],"study_design_scores_gemma":[0.00067106826,0.00015894468,0.0019124447,0.00018356247,0.00004866748,0.000015505664,0.000099000805,0.0169528,0.008227757,0.97029126,0.0010591944,0.00037982245],"about_ca_topic_score_codex":0.00002644102,"about_ca_topic_score_gemma":0.0000061677024,"teacher_disagreement_score":0.6743468,"about_ca_system_score_codex":0.000024642619,"about_ca_system_score_gemma":0.00007939586,"threshold_uncertainty_score":0.54410106},"labels":[],"label_agreement":null},{"id":"W4412646978","doi":"10.55016/ojs/cdm.v3i1.61998","title":"On geometric constructions of (k, g)-graphs","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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":"Hungarian Scientific Research Fund","keywords":"Mathematics; Combinatorics","score_opus":0.015445024210330022,"score_gpt":0.25903407828659775,"score_spread":0.2435890540762677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412646978","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.15294403,0.000117778785,0.8418565,0.0009308335,0.000262059,0.0003406692,0.00012355782,0.00021771181,0.0032068572],"genre_scores_gemma":[0.91943544,0.000017426317,0.080222115,0.00012619453,0.0000036114845,0.000025933241,0.0000057224793,0.0000073841243,0.00015618598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868584,0.000033018016,0.00042938616,0.00024628427,0.00033169813,0.00027377738],"domain_scores_gemma":[0.9981691,0.0003299865,0.000145624,0.00075392344,0.00042417162,0.00017718493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025082254,0.00014166938,0.00027281532,0.00063723297,0.00031666982,0.00003048785,0.00047447928,0.00006213363,0.00002123025],"category_scores_gemma":[0.00083859963,0.00012118585,0.00013579357,0.0022183037,0.00015937482,0.00011445234,0.00013350783,0.00011557283,0.00014196036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015841907,0.00012134569,0.0000627812,0.0000109892235,0.00002270186,0.000003458948,0.00025996316,0.00032740543,0.0005612907,0.9959357,0.0024406204,0.00025218047],"study_design_scores_gemma":[0.0010154223,0.00041182342,0.00071651395,0.00015899591,0.000041590683,0.00019655956,0.00008973997,0.012313886,0.014555377,0.96917284,0.0008825544,0.0004446943],"about_ca_topic_score_codex":0.0000072873895,"about_ca_topic_score_gemma":7.403129e-7,"teacher_disagreement_score":0.7664914,"about_ca_system_score_codex":0.000031548247,"about_ca_system_score_gemma":0.00008088383,"threshold_uncertainty_score":0.49418154},"labels":[],"label_agreement":null},{"id":"W4412647485","doi":"10.55016/ojs/cdm.v2i2.61971","title":"On the oriented chromatic number of dense graphs","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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":"Departament d'Universitats, Recerca i Societat de la Informació; Ministerio de Economía y Competitividad; European Commission","keywords":"Mathematics; Combinatorics; Chromatic scale; Discrete mathematics","score_opus":0.01102268038947433,"score_gpt":0.28220492781912215,"score_spread":0.2711822474296478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647485","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.3001796,0.000046824363,0.69450563,0.0023994583,0.00014306046,0.00038093815,0.000024606792,0.00012324977,0.0021966023],"genre_scores_gemma":[0.96796745,0.0000023467708,0.03146262,0.00039124343,0.0000038305766,0.000019748924,0.0000025382942,0.000008704965,0.00014153437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985839,0.000045506702,0.00049296784,0.00019743654,0.0003597416,0.00032045113],"domain_scores_gemma":[0.9975769,0.0008855456,0.00017234671,0.0008812919,0.00034749688,0.00013645519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011992947,0.00014321877,0.00022198708,0.00011691021,0.00023933948,0.000049637365,0.0005360929,0.000052549156,0.00003806815],"category_scores_gemma":[0.0012053776,0.00009068738,0.000121264886,0.0009320749,0.000101675345,0.00007139951,0.00014998869,0.00011653622,0.00024091412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032070202,0.00009960662,0.000049217335,0.000015420754,0.000024621664,0.0000027413219,0.00071417866,0.000028074428,0.0008789362,0.9964512,0.0015960108,0.00013676051],"study_design_scores_gemma":[0.0004784601,0.00011987826,0.00032965676,0.0003148119,0.00004023222,0.0000340802,0.00019670223,0.011454603,0.013232771,0.9730234,0.00052592636,0.0002494686],"about_ca_topic_score_codex":0.000029479896,"about_ca_topic_score_gemma":0.000017800268,"teacher_disagreement_score":0.66778785,"about_ca_system_score_codex":0.00004118251,"about_ca_system_score_gemma":0.000058111313,"threshold_uncertainty_score":0.3698124},"labels":[],"label_agreement":null},{"id":"W4412647858","doi":"10.55016/ojs/cdm.v2i1.61890","title":"Coloring edges and vertices of graphs without short or long cycles","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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":"Combinatorics; Mathematics","score_opus":0.024361929138435805,"score_gpt":0.3102164975382111,"score_spread":0.2858545683997753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647858","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.4674224,0.00025672666,0.53129625,0.00027642082,0.000093833136,0.00023382522,0.00001459432,0.00010140582,0.00030454647],"genre_scores_gemma":[0.93660384,0.000023338016,0.06323554,0.00004992028,0.0000054724196,0.0000116721385,0.0000021429069,0.000007606965,0.000060439004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987679,0.00002062149,0.00042712182,0.0002355045,0.00023500933,0.00031380705],"domain_scores_gemma":[0.9987455,0.00030583076,0.0000894564,0.00041980195,0.00025540142,0.0001839915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008173804,0.00013874867,0.00027039845,0.00018835337,0.000188744,0.00009251818,0.00033715912,0.000059140937,0.0000034000757],"category_scores_gemma":[0.0004222173,0.00010387034,0.00005369174,0.0005146954,0.00011512159,0.00019850607,0.00022706532,0.000080140126,0.000006460305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003044991,0.00017102722,0.008798075,0.00017679804,0.00009071036,0.000016003034,0.0022560898,0.00009296793,0.008629997,0.97320414,0.00017779063,0.0063559595],"study_design_scores_gemma":[0.00293507,0.0013420586,0.048695512,0.0022890517,0.00047861296,0.00026302328,0.0022722979,0.069559164,0.30533314,0.5636193,0.0011750732,0.002037663],"about_ca_topic_score_codex":0.000009289957,"about_ca_topic_score_gemma":0.000040074152,"teacher_disagreement_score":0.46918148,"about_ca_system_score_codex":0.000019652569,"about_ca_system_score_gemma":0.000038223563,"threshold_uncertainty_score":0.42357096},"labels":[],"label_agreement":null},{"id":"W4412648266","doi":"10.55016/ojs/cdm.v13i1.62452","title":"Bounds for the boxicity of Mycielski graphs","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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; Discrete mathematics","score_opus":0.016998247141056855,"score_gpt":0.298509867634204,"score_spread":0.28151162049314715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648266","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.009475137,0.0001422357,0.98516715,0.0035765136,0.00028780045,0.0005392751,0.00012108017,0.00009609142,0.0005947358],"genre_scores_gemma":[0.90460265,0.0000059050863,0.094723426,0.0003472338,0.000019801757,0.00008340899,0.000004092695,0.000007944461,0.00020554506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890876,0.000024078081,0.00035759335,0.0002045937,0.00021681956,0.00028817978],"domain_scores_gemma":[0.99770635,0.00049276353,0.00013821495,0.00083101535,0.0007340154,0.00009761678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007549407,0.00011797216,0.00019927791,0.00009085496,0.0004700937,0.00010728145,0.0007754624,0.00005199198,0.000008831469],"category_scores_gemma":[0.00074491027,0.000076351,0.00014391082,0.00061333406,0.00022425121,0.00010642301,0.00020208277,0.00006269127,0.000034892277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031254986,0.000051249237,0.000013054575,0.000017277385,0.000030171084,1.1754621e-7,0.00065029407,0.000020692467,0.001858481,0.99207187,0.004814699,0.00046897147],"study_design_scores_gemma":[0.00043629273,0.0002783669,0.0001203416,0.0000699568,0.000053465053,0.000006418749,0.00009263545,0.074390225,0.01899585,0.8983533,0.0070246872,0.00017848733],"about_ca_topic_score_codex":0.000009547379,"about_ca_topic_score_gemma":0.000008459249,"teacher_disagreement_score":0.8951275,"about_ca_system_score_codex":0.000018956975,"about_ca_system_score_gemma":0.00006485043,"threshold_uncertainty_score":0.36156282},"labels":[],"label_agreement":null},{"id":"W4412826052","doi":"10.28924/2291-8639-23-2025-181","title":"The Rainbow Mean Index of Corona Product of Graphs","year":2025,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","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; Rainbow; Index (typography); Corona (planetary geology); Statistics; Product (mathematics); Physics; Computer science; Geometry; Optics; World Wide Web","score_opus":0.005791213882190807,"score_gpt":0.2645452429718411,"score_spread":0.25875402908965034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412826052","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.1783769,0.0035914455,0.8061884,0.010042984,0.00027816414,0.00018008958,0.00001229274,0.000013367627,0.0013163335],"genre_scores_gemma":[0.9966946,0.0003708832,0.0027602126,0.00006114258,0.000007504326,0.0000040809628,0.0000010938949,0.0000010993629,0.00009933524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990555,0.00002906432,0.00047020015,0.000100179415,0.00029398533,0.000051085863],"domain_scores_gemma":[0.99817085,0.00013874032,0.0004779919,0.00021906578,0.0009665387,0.000026803866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051169976,0.000047899757,0.00015074105,0.00043592643,0.00006867553,0.000044743243,0.0006679752,0.000014938394,0.0000023817438],"category_scores_gemma":[0.00003270248,0.00003137218,0.00016342531,0.00093511795,0.00010680826,0.00008321037,0.00008475952,0.000066582834,1.9579615e-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.000014600541,0.00014417099,0.02626644,0.000006074691,0.0019441155,5.1870006e-7,0.00016041732,0.0013450274,0.0038418954,0.88585925,0.00037830256,0.0800392],"study_design_scores_gemma":[0.0010597565,0.0001000758,0.12363858,0.000104916086,0.0008952618,0.00002444103,0.00028441037,0.024182219,0.0191059,0.8148333,0.015579966,0.00019118049],"about_ca_topic_score_codex":0.000036549656,"about_ca_topic_score_gemma":0.000019829593,"teacher_disagreement_score":0.8183178,"about_ca_system_score_codex":0.0000072885773,"about_ca_system_score_gemma":0.000060716273,"threshold_uncertainty_score":0.12793204},"labels":[],"label_agreement":null},{"id":"W4413186321","doi":"10.55016/ojs/cdm.v7i2.62161","title":"Distinguishing homomorphisms of infinite graphs","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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","keywords":"Homomorphism; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.01777632943254971,"score_gpt":0.27833875989420526,"score_spread":0.26056243046165556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186321","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.07552438,0.000435928,0.9186965,0.00082953623,0.00045452855,0.0003377071,0.00011365256,0.00025326945,0.0033544982],"genre_scores_gemma":[0.8585204,0.0000044626854,0.14125085,0.00011172431,0.000010072222,0.000022719803,0.000009626661,0.000009160889,0.000060965216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985573,0.00004420478,0.00047760154,0.00017693116,0.00029503796,0.00044890062],"domain_scores_gemma":[0.99821115,0.00025305836,0.00019680915,0.00071228837,0.00035287833,0.00027383296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008090817,0.00015336317,0.00028131896,0.00019125818,0.00019473571,0.00008456132,0.00055574294,0.000062646934,0.000011765759],"category_scores_gemma":[0.0012177258,0.00013144125,0.00011865261,0.00081514654,0.00007789849,0.00030560835,0.00030355755,0.00011586874,0.00008380625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.5354367e-7,0.000106469925,0.0004589129,0.000028085207,0.000019034203,7.2652887e-7,0.0011877638,0.000050265346,0.0013367584,0.99594736,0.0005666909,0.00029707252],"study_design_scores_gemma":[0.0007669344,0.00014925591,0.001720899,0.00040567305,0.000094259536,0.000046409285,0.00023660921,0.018048827,0.013507997,0.96079886,0.003557001,0.0006672665],"about_ca_topic_score_codex":0.000009999111,"about_ca_topic_score_gemma":8.758995e-7,"teacher_disagreement_score":0.78299606,"about_ca_system_score_codex":0.000027282147,"about_ca_system_score_gemma":0.000035521614,"threshold_uncertainty_score":0.53600186},"labels":[],"label_agreement":null},{"id":"W4413186459","doi":"10.55016/ojs/cdm.v7i1.62138","title":"Characterizing graph classes by intersections of neighborhoods","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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; Graph","score_opus":0.01357958070157754,"score_gpt":0.2749103765177576,"score_spread":0.2613307958161801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186459","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.05316261,0.00032874485,0.94248176,0.0016281619,0.00045441327,0.00025540584,0.00016949564,0.00019467142,0.0013247406],"genre_scores_gemma":[0.969307,0.000013808587,0.03028913,0.0002038462,0.000015036933,0.00003962277,0.00001929412,0.000010474472,0.0001017523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872863,0.000045248566,0.0004324431,0.00017986383,0.00020867676,0.00040515838],"domain_scores_gemma":[0.99863255,0.00014811358,0.0001709693,0.0005694686,0.00023705458,0.00024184315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004237881,0.0001519989,0.00025382897,0.00018612105,0.00018563858,0.00007597126,0.00042617213,0.00006663724,0.00001801673],"category_scores_gemma":[0.00030960396,0.00013234837,0.00012133611,0.0007136043,0.000062697756,0.0004284897,0.00021000383,0.00011322595,0.00006150763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002026781,0.0003164454,0.0004288225,0.000042875596,0.00005964315,3.210714e-7,0.0021765293,0.000010496032,0.07834932,0.91271675,0.005399316,0.00049743475],"study_design_scores_gemma":[0.0029909809,0.0009769073,0.0040572374,0.0013877217,0.00045931124,0.00018086747,0.0028926362,0.033311512,0.4441789,0.4662849,0.04039325,0.0028857733],"about_ca_topic_score_codex":0.000011407053,"about_ca_topic_score_gemma":0.000001290471,"teacher_disagreement_score":0.91614443,"about_ca_system_score_codex":0.000036004887,"about_ca_system_score_gemma":0.000029531171,"threshold_uncertainty_score":0.53970104},"labels":[],"label_agreement":null},{"id":"W4413324029","doi":"10.1007/s00013-025-02165-3","title":"Another character theoretic formula for base size","year":2025,"lang":"en","type":"article","venue":"Archiv der Mathematik","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":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Character (mathematics); Base (topology); Combinatorics; Pure mathematics; Geometry; Mathematical analysis","score_opus":0.011252390656911599,"score_gpt":0.24436257124779803,"score_spread":0.23311018059088642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413324029","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.02248354,0.00013827265,0.95266765,0.005195484,0.00030410264,0.0005566003,0.000006635123,0.00030763686,0.0183401],"genre_scores_gemma":[0.72560865,0.000008995369,0.26331517,0.0056232247,0.000012102682,0.00013947132,0.0000031137647,0.000021799138,0.0052674813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989848,0.000035613786,0.00024169251,0.00032341023,0.0001275804,0.0002869176],"domain_scores_gemma":[0.9984823,0.0007028983,0.00006586951,0.0006519466,0.00005084778,0.000046154673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003534729,0.00014174636,0.00017491696,0.00010709642,0.00013867633,0.00010636495,0.00053154555,0.00003627034,0.000036139485],"category_scores_gemma":[0.00013627535,0.00010772452,0.000118050586,0.00019569647,0.00005660857,0.00015276189,0.00015466518,0.0000751216,0.00006850938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006348512,0.00007345454,0.0000217693,0.00009588999,0.000024685467,0.0000013096712,0.0008524366,0.000004216298,0.0030953686,0.98699605,0.003746436,0.005082039],"study_design_scores_gemma":[0.00048480046,0.00002942395,0.00014025682,0.00009964479,0.000013884505,0.000005392696,0.000011858441,0.019849474,0.00693175,0.9695229,0.0027764654,0.00013415492],"about_ca_topic_score_codex":0.0000023619627,"about_ca_topic_score_gemma":8.955119e-7,"teacher_disagreement_score":0.7031251,"about_ca_system_score_codex":0.0000072295406,"about_ca_system_score_gemma":0.000042836084,"threshold_uncertainty_score":0.43928784},"labels":[],"label_agreement":null},{"id":"W4413472865","doi":"10.61091/jcmcc126-25","title":"Incident vertex pi coloring of middle, total, line and splitting graph for star and double star graph families","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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; Star (game theory); Vertex (graph theory); Graph; Physics; Line graph; Mathematics; Astrophysics","score_opus":0.019209149638133423,"score_gpt":0.25284568475506686,"score_spread":0.23363653511693344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413472865","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97502536,0.0018829838,0.015359521,0.00018274391,0.0070201126,0.00040686977,0.0000022660581,0.000040375147,0.00007977427],"genre_scores_gemma":[0.9675778,0.00021078743,0.032071084,0.000027961702,0.000084651205,0.000003915783,6.6449326e-7,0.000017479944,0.000005667302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733055,0.00007275778,0.0013933253,0.00034581637,0.0004936724,0.0003638808],"domain_scores_gemma":[0.99647254,0.0011407433,0.0010841936,0.00029452017,0.0008253508,0.00018263819],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022973511,0.00031009488,0.000919405,0.0005172013,0.00041803165,0.00032411804,0.00042603925,0.00015496774,3.644974e-7],"category_scores_gemma":[0.00036586178,0.0002790459,0.0001631602,0.000587562,0.00017134541,0.00033676342,0.00056886976,0.00033643103,8.8599e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015366591,0.0003039462,0.00030922415,0.0008230591,0.00016222135,0.000005716346,0.0015581942,0.00006472551,0.001765211,0.99326634,0.000049722028,0.001537964],"study_design_scores_gemma":[0.007989345,0.0012175798,0.00020984074,0.0012719673,0.00013708968,0.00004361716,0.00066888327,0.020591242,0.003650258,0.9638454,0.00008361385,0.00029120198],"about_ca_topic_score_codex":0.000030179415,"about_ca_topic_score_gemma":8.4085707e-7,"teacher_disagreement_score":0.029420989,"about_ca_system_score_codex":0.000033244192,"about_ca_system_score_gemma":0.00014695337,"threshold_uncertainty_score":0.99996614},"labels":[],"label_agreement":null},{"id":"W4413808816","doi":"10.1016/j.dam.2025.08.041","title":"Monitoring edge-geodetic sets in graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Centre National de la Recherche Scientifique; Fonds De La Recherche Scientifique - FNRS; Agence Nationale de la Recherche","keywords":"Geodetic datum; Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Discrete mathematics; Geodesy; Artificial intelligence; Computer science; Geography","score_opus":0.013787492273016542,"score_gpt":0.2593338930233943,"score_spread":0.24554640075037779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413808816","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4966249,0.0010932939,0.39960372,0.0011302091,0.0013126403,0.0010953584,0.0000034979248,0.0009873394,0.09814904],"genre_scores_gemma":[0.8303135,0.0000310257,0.1693618,0.00010209304,0.0000027207566,0.000060474853,0.0000010913454,0.000010271236,0.00011702558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872684,0.000012320883,0.00037883478,0.00033861445,0.00022248251,0.00032090154],"domain_scores_gemma":[0.9990151,0.00012176162,0.00007955283,0.0006894463,0.000033528042,0.000060622744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032751207,0.00017271706,0.00024122393,0.00028355478,0.00009247983,0.00011890157,0.00062810414,0.000077950295,0.0000026518583],"category_scores_gemma":[0.00002784628,0.00015457938,0.000058487065,0.000895661,0.00004703214,0.00009692817,0.0002670421,0.00017011448,0.00004609737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015481016,0.00007352036,0.00026917103,0.00012003207,0.000012833141,0.000004245466,0.000929246,0.0001604263,0.0038952685,0.9878781,0.00014074356,0.006514907],"study_design_scores_gemma":[0.0004029561,0.000009703999,0.00039429747,0.00023945373,0.000010621493,0.0000017861006,0.0002161627,0.01648516,0.009723975,0.9722388,0.00007916974,0.0001979131],"about_ca_topic_score_codex":0.000007542622,"about_ca_topic_score_gemma":0.0000019758263,"teacher_disagreement_score":0.33368862,"about_ca_system_score_codex":0.000023151106,"about_ca_system_score_gemma":0.00003868069,"threshold_uncertainty_score":0.63035643},"labels":[],"label_agreement":null},{"id":"W4414273302","doi":"10.1016/j.jctb.2025.08.005","title":"Dense minors of graphs with independence number two","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Independence number; Chromatic scale; Graph; Simple (philosophy); Independent set; Simple graph","score_opus":0.0051207234804243025,"score_gpt":0.2359603110307333,"score_spread":0.230839587550309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414273302","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9698915,0.00041825624,0.012784028,0.00051884336,0.0074092206,0.0001270738,0.0000011420589,0.000047810372,0.008802112],"genre_scores_gemma":[0.9936297,0.000026932556,0.005799314,0.000102509744,0.000019049765,0.00000127065,1.1866622e-7,0.0000060889483,0.00041500785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840605,0.00022838959,0.00052463,0.000154079,0.0005010218,0.00018579978],"domain_scores_gemma":[0.99804413,0.00024599483,0.000489589,0.00037720817,0.00075653853,0.000086513246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013800547,0.00014372742,0.00034574207,0.00021726369,0.00009688413,0.00007263756,0.00078786816,0.00007237837,0.000025220306],"category_scores_gemma":[0.00014413842,0.00010416124,0.00012346367,0.0007409177,0.00023199177,0.0006151538,0.00013447521,0.00028989126,0.0000026144517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050084357,0.000111537636,0.0020070556,0.000018409148,0.00009406538,0.000037454083,0.00034139404,0.000055895987,0.0011057882,0.9942675,0.00035851143,0.0011015437],"study_design_scores_gemma":[0.0016895772,0.00041021113,0.0002418808,0.00017129893,0.000035342673,0.000154062,0.00011555208,0.000015081057,0.020516187,0.97575676,0.0007837981,0.00011024563],"about_ca_topic_score_codex":0.000010621235,"about_ca_topic_score_gemma":0.0000017330227,"teacher_disagreement_score":0.023738194,"about_ca_system_score_codex":0.00001966369,"about_ca_system_score_gemma":0.00028269025,"threshold_uncertainty_score":0.4247572},"labels":[],"label_agreement":null},{"id":"W4414377146","doi":"10.1016/j.laa.2025.09.011","title":"On the factorability of infinite graphs","year":2025,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Carleton University","funders":"Japan Society for the Promotion of Science","keywords":"Bipartite graph; Factorization; Complete bipartite graph; Adjacency matrix; Graph; Edge-transitive graph","score_opus":0.014413684806404656,"score_gpt":0.25033092707201055,"score_spread":0.2359172422656059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414377146","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8357975,0.0010233179,0.14056502,0.012812062,0.00012659587,0.0009474467,0.000021680085,0.00021502892,0.00849137],"genre_scores_gemma":[0.9978253,0.00003727655,0.0012128061,0.0007267704,0.0000016563375,0.00005906939,0.0000016596476,0.0000017665413,0.00013368226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948585,0.000025907759,0.00015067092,0.000181901,0.00007881563,0.00007687825],"domain_scores_gemma":[0.9991039,0.00030618612,0.000043626475,0.00043440989,0.0000837022,0.00002818423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016077312,0.000058885023,0.00007422362,0.000065171385,0.00014562503,0.00002332135,0.00027939994,0.0000309723,0.000006396343],"category_scores_gemma":[0.000048477286,0.000038131195,0.00003236435,0.00053735083,0.000057199974,0.00004472532,0.000085255255,0.00007933928,0.000013704218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.920241e-7,0.000039314997,0.00016700465,0.000008643579,0.0000064808028,1.5265858e-8,0.00005662715,0.0000115472985,0.0008227086,0.9961904,0.0002318408,0.0024646071],"study_design_scores_gemma":[0.00010982297,0.000027702787,0.0022569452,0.000015936148,0.0000068178942,2.7877815e-7,0.000011849199,0.0081429845,0.006751606,0.97693354,0.0056802058,0.000062298444],"about_ca_topic_score_codex":0.000007223522,"about_ca_topic_score_gemma":0.0000011673842,"teacher_disagreement_score":0.16202784,"about_ca_system_score_codex":0.0000023805364,"about_ca_system_score_gemma":0.000023895924,"threshold_uncertainty_score":0.15549451},"labels":[],"label_agreement":null},{"id":"W4414581250","doi":"10.61091/jcmcc127-12","title":"Toughness and (a,b)-parity factors in graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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":"Toughness; Parity (physics); Graph; Interval (graph theory)","score_opus":0.013042545847747224,"score_gpt":0.25234185979297236,"score_spread":0.23929931394522513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414581250","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97955257,0.0007063181,0.008401355,0.00028929685,0.010326226,0.0001604148,3.7059976e-7,0.000040438084,0.00052300905],"genre_scores_gemma":[0.99252695,0.00005775037,0.007322271,0.000039680945,0.00003871866,8.166918e-7,2.2183765e-7,0.00000899283,0.0000046013956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789953,0.00011712406,0.0010053914,0.00026680777,0.00040717365,0.00030395138],"domain_scores_gemma":[0.997971,0.000734562,0.00054219237,0.00027505754,0.00033158535,0.00014560213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016683454,0.00024401316,0.0006777906,0.00051307894,0.00021751442,0.00034034782,0.00055616966,0.00015451523,6.960919e-7],"category_scores_gemma":[0.00040343622,0.00020783945,0.000105615814,0.00078860257,0.00010037248,0.00033515578,0.0004512442,0.00047542038,2.7947172e-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.000015004524,0.00028612008,0.0041591953,0.000114507246,0.00003617615,0.000013500691,0.00087563304,0.000015411058,0.00025051527,0.9930453,0.00007598961,0.0011126745],"study_design_scores_gemma":[0.0028415467,0.00021897306,0.0015942007,0.0004318581,0.000026322823,0.000025585432,0.00017617256,0.006469591,0.0007386859,0.9871482,0.00013131056,0.00019752324],"about_ca_topic_score_codex":0.00002751068,"about_ca_topic_score_gemma":9.964625e-7,"teacher_disagreement_score":0.012974375,"about_ca_system_score_codex":0.000041067626,"about_ca_system_score_gemma":0.00013419914,"threshold_uncertainty_score":0.84754467},"labels":[],"label_agreement":null},{"id":"W4414581259","doi":"10.61091/jcmcc127-08","title":"Group distance magic set of group vertex magic graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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":"MAGIC (telescope); Abelian group; Vertex (graph theory); Graph; Group (periodic table)","score_opus":0.010493538450464808,"score_gpt":0.24252165996461722,"score_spread":0.23202812151415242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414581259","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75514156,0.0032625496,0.19252248,0.000686323,0.045030564,0.00056344725,0.000005063843,0.00015226533,0.0026357304],"genre_scores_gemma":[0.9808824,0.00008200558,0.018851008,0.000060225866,0.00009060547,0.0000010088611,0.0000011803623,0.000018984687,0.0000125876195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965738,0.00017217244,0.0016651308,0.00035832927,0.00081299857,0.0004175745],"domain_scores_gemma":[0.99634093,0.00081136933,0.001407661,0.00055957725,0.0006868852,0.0001935575],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022161836,0.00035169994,0.0009958815,0.0004933004,0.00023695771,0.00028173902,0.0012019977,0.00017791001,0.0000030189851],"category_scores_gemma":[0.0003364271,0.00030844155,0.00030403485,0.0011278915,0.00018155988,0.00038591548,0.0005362065,0.0005297567,0.0000021133378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004830185,0.0004383251,0.0002813738,0.0003077846,0.00011109115,0.000018766355,0.00047338585,0.000016590582,0.0011551233,0.99452454,0.00054714753,0.0020775946],"study_design_scores_gemma":[0.0039340104,0.0006346473,0.0001451446,0.0008487359,0.00008334499,0.000047309706,0.00011817211,0.010817,0.00058504334,0.98186,0.0006533545,0.00027324999],"about_ca_topic_score_codex":0.000015419957,"about_ca_topic_score_gemma":5.439678e-7,"teacher_disagreement_score":0.22574082,"about_ca_system_score_codex":0.0000576532,"about_ca_system_score_gemma":0.0001328068,"threshold_uncertainty_score":0.99993676},"labels":[],"label_agreement":null},{"id":"W4414581268","doi":"10.61091/jcmcc127-07","title":"Total colorings of k-regular graphs of girths 2k and k","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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":"Antipodal point; Hamming graph; Vertex (graph theory); Graph; Total coloring; Edge coloring; Orthogonality; Greedy coloring; Monochromatic color","score_opus":0.007878103378077712,"score_gpt":0.23104627774100372,"score_spread":0.22316817436292602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414581268","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98390055,0.0010626068,0.008119951,0.00016865703,0.005868748,0.00017274026,9.654227e-7,0.000025047131,0.0006807199],"genre_scores_gemma":[0.98354363,0.000053443448,0.01633957,0.000013714972,0.000031514443,7.040135e-7,1.7399233e-7,0.000009954412,0.0000072600915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975593,0.00009026147,0.0013458048,0.0002200447,0.0005458738,0.0002386866],"domain_scores_gemma":[0.9968426,0.00064953126,0.0012886539,0.00031862644,0.00077258993,0.00012795371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016422266,0.00022269526,0.00087374117,0.00042759525,0.00014837194,0.000105885025,0.0005212054,0.00014135554,8.74871e-7],"category_scores_gemma":[0.00032590877,0.000196487,0.00017702585,0.0006665679,0.0001974964,0.00022582621,0.0004809895,0.00029049642,1.5160137e-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.00003776995,0.00033264502,0.00036682579,0.00034486494,0.00011637848,0.0000053181598,0.00054281426,0.000031185566,0.0044209473,0.99236053,0.000072117335,0.0013685973],"study_design_scores_gemma":[0.003333928,0.00076297804,0.00030778244,0.0007677057,0.00008186642,0.000048361893,0.00013649632,0.0050030346,0.0101644145,0.97914284,0.00008191651,0.0001686985],"about_ca_topic_score_codex":0.000014048592,"about_ca_topic_score_gemma":1.0465597e-7,"teacher_disagreement_score":0.013217718,"about_ca_system_score_codex":0.000019567662,"about_ca_system_score_gemma":0.00014135546,"threshold_uncertainty_score":0.80125076},"labels":[],"label_agreement":null},{"id":"W4414581294","doi":"10.61091/jcmcc127-18","title":"A study of Fibonacci cordial labeling in structured graph families","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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":"Injective function; Fibonacci number; Edge-graceful labeling; Graph; Graph labeling; Directed graph; Line graph; Voltage graph","score_opus":0.012057004389398347,"score_gpt":0.25724149637990584,"score_spread":0.24518449199050749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414581294","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9839938,0.00039579754,0.0038222254,0.000075136886,0.01109473,0.00032077203,5.0477433e-7,0.00003192841,0.000265054],"genre_scores_gemma":[0.99092937,0.000027534075,0.008941042,0.000019825131,0.00006657358,0.0000016668873,2.1627604e-7,0.000011680762,0.0000021109727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969389,0.00018655945,0.0016507147,0.0002795472,0.00064237096,0.0003019105],"domain_scores_gemma":[0.9971385,0.0007173623,0.0010374258,0.00038474507,0.0006223251,0.00009965431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018426953,0.00026556532,0.00094356167,0.0008385879,0.0001742662,0.00017797903,0.00083120924,0.00013731109,7.5482774e-7],"category_scores_gemma":[0.0004470658,0.00023395389,0.00014103788,0.0013071849,0.000069837515,0.00024273824,0.00048040613,0.00048608097,2.2196068e-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.00007580151,0.0014680511,0.002910141,0.00015429223,0.00012654332,0.000032785723,0.004634481,0.00042988698,0.0009694839,0.9868074,0.000062991494,0.0023281635],"study_design_scores_gemma":[0.008934269,0.0012108922,0.00087398797,0.00057940127,0.00006497413,0.000024492281,0.0018195444,0.0058713034,0.0008158106,0.9795489,0.000024727575,0.00023173202],"about_ca_topic_score_codex":0.000055703647,"about_ca_topic_score_gemma":0.000004664481,"teacher_disagreement_score":0.011028157,"about_ca_system_score_codex":0.0000425334,"about_ca_system_score_gemma":0.00019414251,"threshold_uncertainty_score":0.9540363},"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":"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":"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":"W4414748794","doi":"10.5539/jmr.v17n3p36","title":"Local Complement Metric Dimension of Sierpinski Gasket Graph and Hanoi Graph","year":2025,"lang":"en","type":"article","venue":"Journal of Mathematics Research","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":"Complement (music); Sierpinski triangle; Vertex (graph theory); Graph; Complement graph; Metric dimension; Metric (unit); Metric space","score_opus":0.06418362167897898,"score_gpt":0.36570402645434363,"score_spread":0.3015204047753647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414748794","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.31612477,0.0051035043,0.675014,0.0020451783,0.00031807474,0.00032342738,0.0000026470007,0.00002384205,0.0010445665],"genre_scores_gemma":[0.9063676,0.00046599604,0.09301455,0.000046475918,0.000004395071,0.000002417992,2.7413842e-7,0.0000067400647,0.00009153589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970366,0.00023842174,0.0008497344,0.00018775792,0.0013514584,0.0003360795],"domain_scores_gemma":[0.9969683,0.0009469067,0.0003197586,0.00044460443,0.0011615859,0.00015884466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005719788,0.000119645745,0.0004025867,0.0022909017,0.0001721381,0.00010469425,0.00074409303,0.000064479165,0.000008581302],"category_scores_gemma":[0.00037367953,0.0000879228,0.00012945283,0.0023757045,0.00026821237,0.00017278307,0.0005010914,0.00043223138,0.0000033789613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000597144,0.0020838906,0.0012683521,0.0013792187,0.000393107,0.0000890449,0.002230915,0.00094292295,0.025663994,0.92162263,0.021675887,0.022590334],"study_design_scores_gemma":[0.0014627087,0.0008467033,0.00064235314,0.0010544654,0.000037955462,0.000106704174,0.0010795657,0.041541655,0.023994379,0.9285477,0.00052767317,0.00015814656],"about_ca_topic_score_codex":0.000021110523,"about_ca_topic_score_gemma":0.0000031010259,"teacher_disagreement_score":0.59024286,"about_ca_system_score_codex":0.000036547317,"about_ca_system_score_gemma":0.00017198257,"threshold_uncertainty_score":0.35853878},"labels":[],"label_agreement":null},{"id":"W4415246479","doi":"10.28924/2291-8639-23-2025-254","title":"Effective Conversion of Non-Prime Graphs to Prime Graphs","year":2025,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","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":"Block graph; Line graph; Graph; Pathwidth; Symmetric graph; Graph product; Graph homomorphism; Prime (order theory); Indifference graph","score_opus":0.0035173310509329656,"score_gpt":0.26625088629950033,"score_spread":0.26273355524856734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415246479","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.18190125,0.00022203848,0.81562585,0.0015423825,0.00012762006,0.00014538396,0.0000061510013,0.000010160094,0.0004191474],"genre_scores_gemma":[0.98752946,0.000092141505,0.012016817,0.00027221887,0.000007389329,0.0000128309675,0.0000028968238,0.0000020134116,0.00006421211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898434,0.00003257193,0.0004153541,0.00017949249,0.0003103655,0.00007789937],"domain_scores_gemma":[0.9983546,0.0001279189,0.00031534757,0.00021484357,0.00090558844,0.00008166238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036973052,0.00008070647,0.00022996467,0.0013161483,0.00007523269,0.000063992535,0.0006088275,0.00003414566,0.0000062354793],"category_scores_gemma":[0.000024702274,0.000067409965,0.00024086739,0.0016096063,0.0000488005,0.00014131259,0.00014118759,0.00008859643,0.0000032250127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099641926,0.0008684829,0.05771705,0.000031747644,0.00766675,0.0000090899675,0.00082991057,0.003336194,0.12028177,0.6691841,0.0016955433,0.13827975],"study_design_scores_gemma":[0.003241612,0.0006120589,0.27929154,0.00038113704,0.0024986921,0.000045988923,0.0002792521,0.04077651,0.28841868,0.3722504,0.011542576,0.00066153996],"about_ca_topic_score_codex":0.000059674803,"about_ca_topic_score_gemma":0.000004060357,"teacher_disagreement_score":0.80562824,"about_ca_system_score_codex":0.000020160003,"about_ca_system_score_gemma":0.000046913967,"threshold_uncertainty_score":0.27488986},"labels":[],"label_agreement":null},{"id":"W4415525816","doi":"10.61091/jcmcc128-03","title":"Preservers of strong vertex labeling numbers of graphs","year":2025,"lang":"","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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); Chromatic scale; Graph; Undirected graph; Operator (biology); Set (abstract data type)","score_opus":0.014176808644296579,"score_gpt":0.25928421115615846,"score_spread":0.2451074025118619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415525816","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9155801,0.00570764,0.017714586,0.0003124477,0.057272565,0.000663609,0.000008669548,0.000045094832,0.0026953076],"genre_scores_gemma":[0.9853432,0.00029344184,0.014192156,0.000019794792,0.00009813861,0.0000010001326,7.426356e-7,0.000034510656,0.00001697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925722,0.00039242173,0.0042629596,0.0005141485,0.0015834144,0.00067489344],"domain_scores_gemma":[0.98921174,0.001854956,0.0049120043,0.00083487463,0.0028626306,0.0003238085],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004700156,0.000614094,0.0022868267,0.0009958886,0.00038557543,0.00028871238,0.0018122805,0.0004378058,0.000007993657],"category_scores_gemma":[0.0013516186,0.0005955722,0.0007167567,0.0019499237,0.00042851034,0.0005347678,0.0011469772,0.0010072223,7.9557816e-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.00018629748,0.0014942304,0.00071346224,0.001919516,0.00074323936,0.000014660835,0.002279894,0.00053276407,0.0020369557,0.987205,0.00037177384,0.0025021865],"study_design_scores_gemma":[0.0086158635,0.0015872964,0.00007400878,0.0058727795,0.0005473416,0.00003236319,0.0007105943,0.049511906,0.0063627344,0.9261453,0.00009299947,0.00044678446],"about_ca_topic_score_codex":0.00009192974,"about_ca_topic_score_gemma":7.701462e-7,"teacher_disagreement_score":0.06976316,"about_ca_system_score_codex":0.000092398914,"about_ca_system_score_gemma":0.0008974405,"threshold_uncertainty_score":0.9996496},"labels":[],"label_agreement":null},{"id":"W4415961928","doi":"10.48550/arxiv.2510.17135","title":"On the second largest eigenvalue of certain graphs in the perfect matching association scheme","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","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":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada","keywords":"Perfect power; Partition (number theory); Conjecture; Association scheme; Perfect graph; Eigenvalues and eigenvectors; Trivially perfect graph; Matching (statistics)","score_opus":0.03351063815896373,"score_gpt":0.260956124695694,"score_spread":0.22744548653673027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415961928","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98691636,0.00070761464,0.00054421317,0.0061174594,0.0016120862,0.0010084286,0.000042668722,0.00006325661,0.0029878903],"genre_scores_gemma":[0.9941119,0.00019458622,0.0004971678,0.0030881085,0.000024700406,0.00011464021,0.0000148718555,0.000021131933,0.0019329225],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934195,0.0021426468,0.0012649783,0.0012705976,0.001105454,0.00079677894],"domain_scores_gemma":[0.99242985,0.0036750932,0.0011714636,0.0022792192,0.00036237884,0.00008198001],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.009252403,0.00061668234,0.0007268754,0.00048046187,0.00069042406,0.00030345438,0.0029997278,0.00057281624,0.00016641499],"category_scores_gemma":[0.000907629,0.0004067321,0.00057006645,0.0016996237,0.00014206133,0.00020070857,0.0012051963,0.0025177216,0.000105490064],"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.000043328768,0.0007774638,0.5649185,0.00048426067,0.00035415744,0.000017517656,0.015122464,0.0044268286,0.003685388,0.40771145,0.0016527505,0.00080589665],"study_design_scores_gemma":[0.0018747896,0.0004392883,0.39936745,0.0032578355,0.00019046308,0.000009373439,0.0014533829,0.027269406,0.009127264,0.5538896,0.0016361822,0.0014849784],"about_ca_topic_score_codex":0.0008609176,"about_ca_topic_score_gemma":0.00033800502,"teacher_disagreement_score":0.16555107,"about_ca_system_score_codex":0.00019400357,"about_ca_system_score_gemma":0.00043900713,"threshold_uncertainty_score":0.9998385},"labels":[],"label_agreement":null},{"id":"W4416041048","doi":"10.61091/jcmcc128-13","title":"k4-e supermagic labeling of triangular ladders","year":2025,"lang":"","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","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; Vertex (graph theory); Graph; Set (abstract data type); Integer (computer science); Edge-graceful labeling","score_opus":0.013861091110503198,"score_gpt":0.2556344784091119,"score_spread":0.2417733872986087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416041048","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82886523,0.016758028,0.04655448,0.0015193081,0.10253345,0.0010049624,0.000008403169,0.00010170339,0.0026544547],"genre_scores_gemma":[0.9758947,0.0004224531,0.023129486,0.0000922489,0.0003796907,0.0000013176964,9.612547e-7,0.000044107557,0.00003506136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9924114,0.00047680532,0.004209481,0.00060454424,0.0014985163,0.00079927244],"domain_scores_gemma":[0.9898222,0.0017784067,0.004467835,0.00086699065,0.002666746,0.00039782305],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005999256,0.0007157931,0.0023550836,0.0011122825,0.00058986625,0.00064100575,0.0017470443,0.0005123939,0.000012799301],"category_scores_gemma":[0.0020957948,0.0006777545,0.00070178846,0.0019943523,0.00044401523,0.00054614095,0.001082137,0.001248248,0.0000031917332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015626487,0.0014516742,0.0002024143,0.0011984365,0.0006021486,0.00004921824,0.0026793266,0.00024529384,0.0043743993,0.9825564,0.00060201326,0.0058824318],"study_design_scores_gemma":[0.012236824,0.0014632266,0.000033889082,0.0042849397,0.00062101986,0.00010384254,0.0007297191,0.04703278,0.0066478183,0.92567897,0.00056133553,0.0006056171],"about_ca_topic_score_codex":0.000034077242,"about_ca_topic_score_gemma":3.2067908e-7,"teacher_disagreement_score":0.14702946,"about_ca_system_score_codex":0.00011715841,"about_ca_system_score_gemma":0.0010580354,"threshold_uncertainty_score":0.9995674},"labels":[],"label_agreement":null},{"id":"W4417433014","doi":"10.5539/jmr.v17n5p1","title":"On the Cordial of Weak Labeling of an l-fold Cycle Graph, T_l(C_n)","year":2025,"lang":"","type":"article","venue":"Journal of Mathematics Research","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-graceful labeling; Graph labeling; Graph; Vertex (graph theory); Wheel graph; Multigraph","score_opus":0.08072170819663196,"score_gpt":0.38023428518914126,"score_spread":0.2995125769925093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417433014","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97468,0.001866896,0.013628726,0.0035912765,0.0009086576,0.00049795106,0.000009752867,0.000011725808,0.0048049963],"genre_scores_gemma":[0.9706958,0.00057318644,0.02816555,0.000081319304,0.000033075175,0.0000037703053,2.3954527e-7,0.000022132526,0.00042493298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9924409,0.0011228676,0.0022540283,0.0003235538,0.0032053418,0.0006533147],"domain_scores_gemma":[0.9888785,0.0046102526,0.00135415,0.0013767406,0.0035333124,0.00024704263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019550141,0.0002575279,0.0008607785,0.0016585034,0.00042776947,0.00024958796,0.0029179563,0.00019803956,0.00008438497],"category_scores_gemma":[0.002785451,0.00016926687,0.00043731646,0.0028055112,0.00076679914,0.0003234145,0.0006643874,0.0016048659,0.000014278285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018484637,0.0030796644,0.00006699797,0.0010138289,0.00038097214,0.000028409766,0.0036289932,0.0036261347,0.04381275,0.93328154,0.003359288,0.007536571],"study_design_scores_gemma":[0.0011911966,0.002153997,0.00005338322,0.004002634,0.00007547285,0.000039780876,0.0018425545,0.10357808,0.0441133,0.8426961,0.00009081111,0.00016272468],"about_ca_topic_score_codex":0.00005560572,"about_ca_topic_score_gemma":0.000008792439,"teacher_disagreement_score":0.099951945,"about_ca_system_score_codex":0.000059479727,"about_ca_system_score_gemma":0.00095144147,"threshold_uncertainty_score":0.6972433},"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":"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":"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":"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":"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":"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":"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":"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":"W560737565","doi":"10.24546/e0034438","title":"The proportion of cyclic quartic field discriminants divisible by a given prime","year":2006,"lang":"en","type":"article","venue":"Institutional Repositories DataBase (IRDB)","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":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Quartic function; Prime (order theory); Field (mathematics); Combinatorics; Pure mathematics","score_opus":0.006571389383204715,"score_gpt":0.224250298796201,"score_spread":0.21767890941299628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W560737565","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6804635,0.003362166,0.3019294,0.004614606,0.004555259,0.0007320365,0.00016245994,0.00039390015,0.0037866707],"genre_scores_gemma":[0.9956839,0.000027419082,0.003664622,0.00005266077,0.00005520469,0.00003505257,0.000090163434,0.000005657441,0.00038531268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99807996,0.00005969272,0.0005108653,0.0003690876,0.00070331525,0.00027708476],"domain_scores_gemma":[0.998555,0.00016970489,0.00023587212,0.000734466,0.00023414996,0.000070789196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003653798,0.0001495671,0.0001499254,0.000059143014,0.0007479593,0.00017880955,0.00054164213,0.00005483648,0.0000023144212],"category_scores_gemma":[0.00021104689,0.00010384986,0.00007265269,0.0003755272,0.00027574744,0.0007540325,0.00023998227,0.00013035227,0.000014132491],"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.000047414673,0.00036611874,0.009672491,0.000053012736,0.00003452213,0.000039827737,0.000104631894,0.00014497338,0.0888118,0.87496334,0.0228081,0.0029537869],"study_design_scores_gemma":[0.0010067394,0.0004374579,0.009579677,0.0004300862,0.000065083186,0.00017941034,0.00005221599,0.0044611734,0.85878736,0.055400386,0.06896044,0.0006399927],"about_ca_topic_score_codex":0.0016253465,"about_ca_topic_score_gemma":0.00007103157,"teacher_disagreement_score":0.8195629,"about_ca_system_score_codex":0.000042803764,"about_ca_system_score_gemma":0.00021730106,"threshold_uncertainty_score":0.5752774},"labels":[],"label_agreement":null},{"id":"W571104468","doi":"10.1007/978-93-86279-39-2","title":"A First Course in Graph Theory and Combinatorics","year":2009,"lang":"en","type":"book","venue":"Hindustan Book Agency","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Queen's University","funders":"","keywords":"Course (navigation); Combinatorics; Graph theory; Mathematics; Graph; Computer science; Physics","score_opus":0.011622576655529765,"score_gpt":0.22041417791457227,"score_spread":0.2087916012590425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W571104468","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.0006775895,0.110777244,0.004061581,0.0018396073,0.001597124,0.0015573824,0.000021392909,0.00093409704,0.87853396],"genre_scores_gemma":[0.004111311,0.0033383404,0.0010149184,0.001804284,0.0000335238,0.00002748944,0.00001950828,0.00006757696,0.9895831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748975,0.00014996076,0.00053054077,0.00084570574,0.00047782226,0.0005062338],"domain_scores_gemma":[0.9981785,0.00021677293,0.00025630582,0.0009998061,0.00010598226,0.00024266618],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010827802,0.00046666164,0.0005024391,0.00046730752,0.00021143275,0.00015332847,0.00088786316,0.00061076425,0.00005042202],"category_scores_gemma":[0.000044342672,0.00045559442,0.00012233935,0.00035377615,0.0001587747,0.00032224317,0.00025437344,0.0009579575,0.000051225223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053744907,0.000095622985,0.000033576373,0.00004179538,0.00001780062,0.00024006648,0.00062045036,0.00001084072,0.0000021070114,0.8771804,0.11899412,0.0027578676],"study_design_scores_gemma":[0.00050130626,0.00014108547,0.00036567944,0.0004135686,0.000028612652,0.000028726698,0.000006981495,0.0001597674,0.0000034320706,0.8935389,0.10431055,0.0005013959],"about_ca_topic_score_codex":0.00001142535,"about_ca_topic_score_gemma":0.00001852292,"teacher_disagreement_score":0.11104906,"about_ca_system_score_codex":0.00013071402,"about_ca_system_score_gemma":0.0004893608,"threshold_uncertainty_score":0.9997896},"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":"W589723224","doi":"10.1007/978-3-319-94667-2","title":"Combinatorial Algorithms","year":2018,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Algorithm","score_opus":0.012342987073364953,"score_gpt":0.23949912091486134,"score_spread":0.22715613384149638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W589723224","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.0000546482,0.00040477785,0.9807103,0.00048090552,0.013459701,0.0002982428,0.0000031238817,0.0003547387,0.004233544],"genre_scores_gemma":[0.024039384,0.000039677536,0.96935976,0.0034288687,0.0013193105,0.00002398318,0.000015898255,0.00007563466,0.00169748],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99507624,0.00008442315,0.0005731646,0.0019286436,0.0014113548,0.0009261789],"domain_scores_gemma":[0.9965628,0.00042002485,0.0002849975,0.0019727147,0.00048985553,0.00026962467],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016494989,0.0005454472,0.00056862197,0.0009881452,0.00038159208,0.0007889052,0.004856074,0.00044795507,0.000016182288],"category_scores_gemma":[0.00015649368,0.0004854627,0.00015001722,0.0017610461,0.0012552543,0.00055619975,0.0019425245,0.00084971957,0.0002101389],"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.000010570977,0.00020642123,0.000051255935,0.000087773195,0.000032550954,0.00022443809,0.0015027223,0.0063541173,0.00021539321,0.20161232,0.0066011506,0.78310126],"study_design_scores_gemma":[0.0003789826,0.0002471396,0.000012072376,0.00022488725,0.000004891163,0.000043957414,2.8940594e-8,0.24336006,0.0009733088,0.7500439,0.004171775,0.0005389712],"about_ca_topic_score_codex":0.000022466726,"about_ca_topic_score_gemma":0.000011241218,"teacher_disagreement_score":0.7825623,"about_ca_system_score_codex":0.000322599,"about_ca_system_score_gemma":0.0017023073,"threshold_uncertainty_score":0.9997597},"labels":[],"label_agreement":null},{"id":"W591679562","doi":"","title":"Strong Edge Graceful Labeling of Windmill Graphs","year":2013,"lang":"en","type":"article","venue":"Journal of Mathematics Research","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; Vertex (graph theory); Edge-graceful labeling; Graph; Enhanced Data Rates for GSM Evolution; Graph labeling; Windmill; Discrete mathematics; Computer science; Line graph; Graph power; Artificial intelligence","score_opus":0.09407581670998798,"score_gpt":0.3541703663346858,"score_spread":0.2600945496246978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W591679562","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95834184,0.0014055985,0.035861198,0.0015372178,0.0003409298,0.00029290825,0.000001072423,0.000028240098,0.0021909939],"genre_scores_gemma":[0.7733674,0.00011042926,0.22624373,0.000021053807,0.000015129241,0.0000035361643,1.2901532e-7,0.0000126914665,0.00022589193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99700713,0.00017206086,0.0008185174,0.00014133602,0.0014679304,0.00039300692],"domain_scores_gemma":[0.99611455,0.00064005755,0.000426623,0.0005043299,0.0021081667,0.00020629905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044883983,0.00010598773,0.0003240482,0.00073620654,0.00012305815,0.0001651276,0.0012146443,0.00007215369,0.00006454663],"category_scores_gemma":[0.00055818463,0.000076288045,0.00014745,0.0008218149,0.00013882125,0.0004772688,0.00028998553,0.00057966035,0.00008077405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011220748,0.0015315575,0.0011892089,0.0007118648,0.00023621488,0.000056432542,0.006247424,0.0007139733,0.14009246,0.8090712,0.025426988,0.014711495],"study_design_scores_gemma":[0.0008000017,0.0006141053,0.00027032787,0.0006400493,0.000013508441,0.000151276,0.0010989896,0.029693162,0.021805616,0.94444394,0.00028818258,0.00018083012],"about_ca_topic_score_codex":0.000026832377,"about_ca_topic_score_gemma":0.0000012770024,"teacher_disagreement_score":0.19038254,"about_ca_system_score_codex":0.000025774527,"about_ca_system_score_gemma":0.00016062218,"threshold_uncertainty_score":0.31109363},"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":"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":"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":"W621909926","doi":"10.1007/b98891","title":"Recent Advances in Algorithms and Combinatorics","year":2003,"lang":"en","type":"book","venue":"","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Algebraic combinatorics; Algorithm; Combinatorics; Mathematics","score_opus":0.012864877147087592,"score_gpt":0.232213525745062,"score_spread":0.2193486485979744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W621909926","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.000004132314,0.10696367,0.0067385044,0.00038101905,0.0012004763,0.00018596105,0.0000012874996,0.00013907482,0.8843859],"genre_scores_gemma":[0.000014906238,0.10471699,0.023901308,0.00085679145,0.0000061787855,0.000011958783,0.000007358985,0.000020973755,0.87046355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987912,0.000033106426,0.00025129283,0.00047044994,0.00024020576,0.0002137165],"domain_scores_gemma":[0.9993069,0.000059434136,0.000086856766,0.00037435905,0.00008234789,0.00009007262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000272014,0.00019158747,0.0002498562,0.00019662353,0.000044533197,0.00007445315,0.00031678833,0.00016934302,0.000015928446],"category_scores_gemma":[0.000017241235,0.00016543116,0.000027042295,0.00021517296,0.000046115838,0.0002113236,0.00014241126,0.00025314197,0.000024555791],"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":[4.059142e-7,0.000026375132,0.000015029966,0.000020312576,0.000003071648,0.000015040756,0.000030191983,0.000007772386,4.1603673e-7,0.85618657,0.021633746,0.12206108],"study_design_scores_gemma":[0.00016820988,0.00003116707,0.000001986813,0.000041198262,0.0000015281004,0.0000069228395,0.000001108898,0.000661393,0.0000069996436,0.4961777,0.5027621,0.00013967755],"about_ca_topic_score_codex":0.0000017008116,"about_ca_topic_score_gemma":0.0000055491673,"teacher_disagreement_score":0.48112836,"about_ca_system_score_codex":0.00005172885,"about_ca_system_score_gemma":0.00017035475,"threshold_uncertainty_score":0.6746087},"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":"W641613623","doi":"10.1090/fim/027","title":"Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization","year":2010,"lang":"en","type":"book","venue":"American Mathematical Society eBooks","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Semidefinite programming; Linear programming; Semidefinite embedding; Maximum cut; Combinatorial optimization; Mathematical optimization; Optimization problem; Mathematics; Parallels; Matrix (chemical analysis); Computer science; Quadratically constrained quadratic program; Theoretical computer science; Graph; Quadratic programming","score_opus":0.013696921031955722,"score_gpt":0.2853098953425187,"score_spread":0.27161297431056297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W641613623","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.00016368319,0.00017810042,0.87489516,0.00038525334,0.00053093827,0.0008381632,0.0000040063896,0.0005346135,0.12247006],"genre_scores_gemma":[0.00016397556,0.000017990644,0.9826965,0.0004480832,0.000034117744,0.000060088067,0.000008260858,0.00005111335,0.016519893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976735,0.00013941893,0.0006185218,0.00068292033,0.00040239084,0.00048322947],"domain_scores_gemma":[0.99797267,0.0006773911,0.000414847,0.00062129356,0.00009169849,0.0002221214],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011223395,0.00039779567,0.0007655073,0.00009952738,0.00014630092,0.00025280836,0.00054494146,0.00038402725,0.000009432229],"category_scores_gemma":[0.00012285702,0.00036077815,0.00026189067,0.00017633483,0.0008622172,0.00008839753,0.00047160758,0.001034196,0.000009662783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036610122,0.00007985538,0.0000067784686,0.00017775624,0.00006493985,0.000006538207,0.0022416692,0.000039264625,0.00014105675,0.9130119,0.0008134244,0.08341315],"study_design_scores_gemma":[0.00054806593,0.00017535649,0.0000021898588,0.00026314415,0.00005124413,0.00002713108,0.000072654926,0.084051594,0.000062637395,0.90778977,0.0063253217,0.0006309111],"about_ca_topic_score_codex":0.000027733016,"about_ca_topic_score_gemma":0.0000012451266,"teacher_disagreement_score":0.107801296,"about_ca_system_score_codex":0.00007271396,"about_ca_system_score_gemma":0.00024309443,"threshold_uncertainty_score":0.9998844},"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":"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":"W6939033156","doi":"10.60692/4bspf-8fy80","title":"On the Boolean dimension of a graph and other related parameters","year":2022,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Dimension (graph theory); Boolean expression; Standard Boolean model; Two-element Boolean algebra; Parity function; Product term; Boolean function; Effective dimension; And-inverter graph","score_opus":0.02408377512319566,"score_gpt":0.1857728067624118,"score_spread":0.16168903163921616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6939033156","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9924811,0.000006292336,0.00547329,0.000228184,0.00026370192,0.0002452597,0.000014441054,0.00014147702,0.0011462368],"genre_scores_gemma":[0.9988434,3.9203577e-8,0.0004096912,0.00067837717,5.577811e-7,0.000031282256,0.0000010649255,0.000003819743,0.000031802432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989061,0.00014053522,0.00038114164,0.00012167019,0.0003261643,0.00012443074],"domain_scores_gemma":[0.999189,0.000027567794,0.00027010884,0.00042917964,0.00004588796,0.000038220223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068443205,0.000093877905,0.00011774077,0.00022249765,0.00027138702,0.00007075227,0.00025580788,0.000027393595,0.0000076149777],"category_scores_gemma":[0.000011498796,0.00006008826,0.000048648453,0.00038513198,0.000036288286,0.00019973303,0.00016844769,0.00010506624,0.000036991765],"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.0000784482,0.000011622987,0.016428202,0.00014795014,0.000109632485,0.0000037809662,0.20459062,0.0112499185,0.000038133585,0.7652614,0.0011396344,0.0009406231],"study_design_scores_gemma":[0.012381288,0.0035203397,0.026248626,0.0014535298,0.00019021705,0.0009723623,0.098015726,0.8176641,0.010187491,0.023881437,0.0027416542,0.0027432523],"about_ca_topic_score_codex":0.00001072292,"about_ca_topic_score_gemma":2.022388e-8,"teacher_disagreement_score":0.8064141,"about_ca_system_score_codex":0.00001809821,"about_ca_system_score_gemma":0.000011187897,"threshold_uncertainty_score":0.2450328},"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":"W7037079961","doi":"","title":"Cross-section measurements for the production of a W-boson in association with high-transverse-momentum jets in pp collisions at s = 13 TeV with the ATLAS detector","year":2024,"lang":"en","type":"article","venue":"White Rose Research Online (University of Leeds, The University of Sheffield, University of York)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"H2020 Marie Skłodowska-Curie Actions; Institut National de Physique Nucléaire et de Physique des Particules; Agencia Estatal de Investigación; Agencia Nacional de Promoción Científica y Tecnológica; Fundação para a Ciência e a Tecnologia; Japan Society for the Promotion of Science; Narodowa Agencja Wymiany Akademickiej; Forskningsrådet om Hälsa, Arbetsliv och Välfärd; Ministerstvo Školství, Mládeže a Tělovýchovy; National Science and Technology Council; European Social Fund; Royal Society; Centre National pour la Recherche Scientifique et Technique; European Regional Development Fund; British Columbia Knowledge Development Fund; Max-Planck-Gesellschaft; Centre National de la Recherche Scientifique; U.S. Department of Energy; Carl Tryggers Stiftelse för Vetenskaplig Forskning; Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Knut och Alice Wallenbergs Stiftelse; Ministerstwo Edukacji i Nauki; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Bundesministerium für Wissenschaft, Forschung und Wirtschaft; Generalitat de Catalunya; Generalitat Valenciana; Agencia Nacional de Investigación y Desarrollo; UK Research and Innovation; Istituto Nazionale di Fisica Nucleare; Ministero dell'Università e della Ricerca; Grantová Agentura České Republiky; Austrian Science Fund; Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Culture, Sports, Science and Technology; Bundesministerium für Bildung und Forschung; Horizon 2020 Framework Programme; Vetenskapsrådet; National Natural Science Foundation of China; European Commission; Leverhulme Trust; Fundação de Amparo à Pesquisa do Estado de São Paulo; Javna Agencija za Raziskovalno Dejavnost RS; Science and Technology Facilities Council; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Deutsche Forschungsgemeinschaft; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Ministry of Science and Technology of the People's Republic of China; Agence Nationale de la Recherche; National Science Foundation; Baden-Württemberg Stiftung; H2020 European Research Council; Norges Forskningsråd; Alexander von Humboldt-Stiftung; TRIUMF; Danmarks Grundforskningsfond; Türkiye Enerji, Nükleer ve Maden Araştırma Kurumu; Canarie; CERN; Centres de Recerca de Catalunya; Ministerio de Ciencia e Innovación","keywords":"Atlas (anatomy); Monte Carlo method; Phase space; Muon; Jet (fluid); Detector; Lepton; Kinematics","score_opus":0.04047699234829436,"score_gpt":0.25778768872285107,"score_spread":0.21731069637455672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7037079961","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9820524,0.00021224668,0.0055372003,0.010988917,0.000114258444,0.00087432296,0.000061780775,0.000035518697,0.00012339407],"genre_scores_gemma":[0.99574506,0.00047824648,0.0017483408,0.0000034476477,0.000010114869,1.0547526e-7,0.000011646863,0.000007807737,0.0019952175],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9976129,0.00038068095,0.00015805874,0.00044919766,0.0010412702,0.000357874],"domain_scores_gemma":[0.9974902,0.0007629851,0.00026519643,0.00054386735,0.0008665668,0.000071138886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021628197,0.0001558246,0.00031054075,0.0006478112,0.00083315617,0.000025858888,0.0012704817,0.00017643128,0.000031295727],"category_scores_gemma":[0.000081083315,0.0001238859,0.00015089891,0.0025455297,0.00084823795,0.0004980079,0.00040050008,0.0005587116,0.0000020793132],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.020743309,0.004767556,0.33096915,0.0028298933,0.0035287065,0.0002450197,0.19436537,0.2535592,0.1458932,0.0126615,0.01555068,0.0148864],"study_design_scores_gemma":[0.030079134,0.009185706,0.42512387,0.0072614937,0.001510083,0.000050341867,0.29110706,0.16540486,0.032522514,0.0017530583,0.03382691,0.0021749898],"about_ca_topic_score_codex":0.013069271,"about_ca_topic_score_gemma":0.03088924,"teacher_disagreement_score":0.11337068,"about_ca_system_score_codex":0.00053365686,"about_ca_system_score_gemma":0.0004278594,"threshold_uncertainty_score":0.9935028},"labels":[],"label_agreement":null},{"id":"W7037759851","doi":"","title":"Episode 747: Jets vs. Blues tonight, Bettman visits","year":2024,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","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":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Blues; Performance art; Channel (broadcasting); George (robot)","score_opus":0.005750792470540854,"score_gpt":0.18909522163279716,"score_spread":0.1833444291622563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7037759851","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.000021971451,0.001956468,0.000010506853,0.000784245,0.0010194727,0.00032517433,0.000053099837,0.0008885629,0.9949405],"genre_scores_gemma":[0.00066750264,0.00023106245,0.0073037045,0.000720603,0.000067414134,0.00001588424,0.000054465097,0.0001396504,0.9907997],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975999,0.00007885929,0.0007677169,0.00046213323,0.00065211824,0.00043928024],"domain_scores_gemma":[0.99823415,0.00007543642,0.0004723357,0.00085991435,0.00016635048,0.00019182282],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003448882,0.00046276997,0.0005235339,0.00022343083,0.00007831106,0.00025375222,0.0009849299,0.00045508408,0.073145315],"category_scores_gemma":[0.00005614733,0.0004225179,0.00024379323,0.000028515604,0.00010353669,5.958618e-7,0.00036143023,0.00038857947,0.050961733],"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.000009925998,0.000034980007,0.0000010166742,0.0005085406,0.00007597294,0.00004187247,0.00021103778,0.000058948146,7.5284896e-7,0.0023269062,0.9951558,0.0015742632],"study_design_scores_gemma":[0.00027795936,0.00014572269,0.0000015428219,0.00063364074,0.0000461202,0.000079593774,0.0000128522615,0.0002598527,0.00006411884,0.00082325435,0.9971935,0.0004618485],"about_ca_topic_score_codex":0.002088256,"about_ca_topic_score_gemma":0.00063178496,"teacher_disagreement_score":0.02218358,"about_ca_system_score_codex":0.000033299966,"about_ca_system_score_gemma":0.000037429534,"threshold_uncertainty_score":0.9998227},"labels":[],"label_agreement":null},{"id":"W7039678583","doi":"","title":"Narratives of Revival: Examining Exhibitions on Knitting and Crochet in Canada and the United States","year":2022,"lang":"en","type":"dissertation","venue":"Spectrum Research Repository (Concordia University)","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":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Exhibition; Craft; Narrative; Order (exchange); The arts; Alliance; Witness","score_opus":0.026076555819730732,"score_gpt":0.2566773572716876,"score_spread":0.23060080145195688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7039678583","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99121565,0.00041310716,0.000008611412,0.00054881297,0.00017338322,0.00029214186,0.000008017371,0.000022070531,0.007318208],"genre_scores_gemma":[0.99667704,0.00035562806,0.00004954506,0.000019555611,0.0000069233192,0.0000049887926,0.000047350648,0.000012165623,0.002826774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99716777,0.0011514206,0.00026416578,0.00050234154,0.0005793544,0.00033494475],"domain_scores_gemma":[0.9981089,0.000992762,0.00020773934,0.00039651676,0.0001807459,0.0001132847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009403765,0.00016689318,0.0003025102,0.0011634241,0.0007787394,0.00009889466,0.0005372327,0.00006213672,0.0000083492505],"category_scores_gemma":[0.00012369962,0.00015030275,0.0000357558,0.0017382938,0.00027946083,0.00014693209,0.00029291585,0.00089734665,2.313757e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003707362,0.00048233505,0.10511983,0.0021788005,0.00088876556,0.0045665256,0.11817643,0.004192564,0.012983574,0.739478,0.0036437805,0.0045820065],"study_design_scores_gemma":[0.015012853,0.0036146147,0.23396751,0.0051136985,0.00018370207,0.00017387028,0.574867,0.02877786,0.02161746,0.092957996,0.020574383,0.003139072],"about_ca_topic_score_codex":0.87412083,"about_ca_topic_score_gemma":0.80605906,"teacher_disagreement_score":0.64652,"about_ca_system_score_codex":0.00035970137,"about_ca_system_score_gemma":0.0014785468,"threshold_uncertainty_score":0.6129168},"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":"W7098177537","doi":"","title":"canada","year":2014,"lang":"en","type":"article","venue":"","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"","score_opus":0.004520287363061311,"score_gpt":0.16329214824576305,"score_spread":0.15877186088270173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7098177537","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.019622358,0.000039887826,0.76530296,0.0123756835,0.000854766,0.000039830007,1.9344313e-7,0.0003122642,0.20145209],"genre_scores_gemma":[0.96946406,2.5007253e-7,0.024781784,0.004309118,0.0000019209242,5.556975e-7,9.9516335e-8,9.1503205e-7,0.0014412641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997004,0.0000093049675,0.000041976808,0.00008517149,0.000086483065,0.00007664667],"domain_scores_gemma":[0.99971455,0.00001967027,0.000007738634,0.00019737953,0.000018567396,0.00004208063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000076728,0.000023933997,0.00002688314,0.000010765978,0.00003127599,0.00002056926,0.00019435251,0.000006430793,0.000011583928],"category_scores_gemma":[0.000011565273,0.00001790696,0.000006400549,0.00007646608,0.000003997581,0.00003831461,0.000039132563,0.000017662347,0.000022696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.5971663e-8,0.0000017328678,0.000088889545,4.3285226e-7,5.5053016e-7,3.5425433e-7,0.000003707572,0.000031345422,0.000106490035,0.94534415,0.047602244,0.0068200435],"study_design_scores_gemma":[0.0002423653,0.000035356054,0.0014336727,0.000004951724,0.0000010815573,0.000008564834,0.0000030558256,0.20037743,0.0060206424,0.24550356,0.5461627,0.00020656954],"about_ca_topic_score_codex":0.5121576,"about_ca_topic_score_gemma":0.32644266,"teacher_disagreement_score":0.94984174,"about_ca_system_score_codex":0.000004524775,"about_ca_system_score_gemma":0.00008237878,"threshold_uncertainty_score":0.685848},"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":"W7106834220","doi":"10.20382/jocg.v16i1a20","title":"Metric and geometric spanners that are resilient to degree-bounded edge faults","year":2024,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Graph Labeling and Dimension Problems","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":"Carleton University; University of Ottawa; University of Windsor","funders":"","keywords":"Vertex (graph theory); Bounded function; Metric dimension; Graph; Metric space; Degree (music); Matching (statistics); Metric (unit)","score_opus":0.02504757245345905,"score_gpt":0.23151972834366497,"score_spread":0.20647215589020593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106834220","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5397989,0.0024687462,0.4526886,0.002593311,0.0011657333,0.00013151547,0.000009546185,0.00010478713,0.0010388781],"genre_scores_gemma":[0.9639878,0.00008887183,0.03465311,0.00028285608,0.000033838365,1.3809337e-7,0.000002004655,0.000011212789,0.0009401502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9980239,0.00009889969,0.0003340063,0.00038360796,0.00087902177,0.0002805099],"domain_scores_gemma":[0.998001,0.00058167934,0.0002578247,0.00018800204,0.00057644374,0.000395065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006152552,0.00019236628,0.0003113569,0.008605742,0.00018503547,0.00028417452,0.00065434346,0.00008662382,0.0000127283],"category_scores_gemma":[0.00015157048,0.00018068639,0.00018021508,0.009897382,0.000066608016,0.00080153946,0.0002922006,0.0003168007,0.000028861235],"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.0003229159,0.0005990613,0.018974118,0.00041554842,0.00124703,0.0048579075,0.0015051115,0.40416485,0.00044290788,0.3864394,0.032848123,0.148183],"study_design_scores_gemma":[0.009508378,0.0044974154,0.34950733,0.002600801,0.00079266814,0.004219896,0.0032126706,0.16415486,0.0024647892,0.13852757,0.31694964,0.0035639605],"about_ca_topic_score_codex":0.000016732327,"about_ca_topic_score_gemma":0.0000024496799,"teacher_disagreement_score":0.42418894,"about_ca_system_score_codex":0.00019773601,"about_ca_system_score_gemma":0.00022939939,"threshold_uncertainty_score":0.7678814},"labels":[],"label_agreement":null},{"id":"W7110237132","doi":"10.4230/lipics.icalp.2025.72","title":"k-Leaf Powers Cannot Be Characterized by a Finite Set of Forbidden Induced Subgraphs for k ≥ 5","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; McGill University","funders":"","keywords":"Chordal graph; Split graph; Interval graph; Finite set; Maximal independent set; Distance-hereditary graph; Induced subgraph; Indifference graph; Block graph","score_opus":0.019879752102609588,"score_gpt":0.270310551007324,"score_spread":0.2504307989047144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110237132","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53844976,0.00025572669,0.4397012,0.0037536535,0.0033800714,0.0061781965,0.0045915395,0.0006795314,0.0030103307],"genre_scores_gemma":[0.9610837,0.00005592789,0.03058431,0.005181914,0.000028556979,0.00073120545,0.0013181092,0.00005516128,0.0009611179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99674886,0.000043315824,0.0014942819,0.00041316613,0.00045708957,0.00084326573],"domain_scores_gemma":[0.9970835,0.00037217376,0.0006878386,0.001047617,0.00060354144,0.00020533762],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008786705,0.00045058972,0.0007085855,0.0006425653,0.0003308229,0.00029849578,0.0014639172,0.00030199817,0.000009430556],"category_scores_gemma":[0.00017439351,0.0004133616,0.00044163692,0.00087393454,0.0001273591,0.0011104272,0.00040818367,0.00030764408,0.000011066467],"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.002903886,0.002778863,0.010412465,0.012178797,0.00391279,0.00001300142,0.056030713,0.00026636155,0.059433002,0.49845633,0.24949153,0.10412225],"study_design_scores_gemma":[0.034843247,0.0028478305,0.0006179127,0.0016262837,0.00039662104,0.000037707086,0.0031283798,0.16502851,0.09250153,0.04361114,0.65210074,0.0032600726],"about_ca_topic_score_codex":0.000057394944,"about_ca_topic_score_gemma":0.000013850407,"teacher_disagreement_score":0.4548452,"about_ca_system_score_codex":0.00006275431,"about_ca_system_score_gemma":0.00021047036,"threshold_uncertainty_score":0.9998318},"labels":[],"label_agreement":null},{"id":"W7110357080","doi":"10.5539/jmr.v7n1p72","title":"Some More Results on Root Square Mean Graphs","year":2015,"lang":"","type":"article","venue":"Journal of Mathematics Research","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":"Quadrilateral; Graph; Square root; Square (algebra); Edge-graceful labeling; Enhanced Data Rates for GSM Evolution","score_opus":0.19743626537673578,"score_gpt":0.40018411087682043,"score_spread":0.20274784550008465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110357080","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9278796,0.012718638,0.004806509,0.03955967,0.0056243977,0.0013696939,0.000050619714,0.00011555859,0.0078753615],"genre_scores_gemma":[0.9657192,0.0006126193,0.031193905,0.00017736196,0.00029503825,0.0000058734313,0.0000015745977,0.00007164154,0.001922788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9868795,0.001063101,0.0025018328,0.000584801,0.0077268123,0.0012439226],"domain_scores_gemma":[0.9875699,0.0016679522,0.0013324035,0.0017373589,0.00614729,0.0015450481],"candidate_categories":["metaresearch","metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.029405436,0.00041923462,0.000906476,0.0024016062,0.0004716755,0.00096082524,0.0030598226,0.00031606664,0.000016614757],"category_scores_gemma":[0.0047101746,0.0003143875,0.0004693023,0.002243079,0.0005759784,0.0008727568,0.00082267454,0.0027260636,0.0003925129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001012284,0.0076266276,0.000112876805,0.0010868266,0.00053742435,0.0028431977,0.074472815,0.0070724837,0.0012669496,0.6724024,0.22054054,0.01102561],"study_design_scores_gemma":[0.0045265844,0.005826742,0.000054026987,0.0032215423,0.000047287496,0.0007991946,0.0045563313,0.061246935,0.0024736298,0.91480404,0.001986009,0.0004576898],"about_ca_topic_score_codex":0.000030428298,"about_ca_topic_score_gemma":0.000008484456,"teacher_disagreement_score":0.24240166,"about_ca_system_score_codex":0.0002680612,"about_ca_system_score_gemma":0.0014663638,"threshold_uncertainty_score":0.9999308},"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":"W7117409323","doi":"10.61091/um125-04","title":"Minimum strong diameter of the strong product of complete multipartite graph and path","year":2025,"lang":"","type":"article","venue":"Utilitas Mathematica","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":"Graph; Multipartite; Vertex (graph theory); Digraph; Product (mathematics); Path graph; Complete graph; Path (computing)","score_opus":0.0280274464935247,"score_gpt":0.25673987124641534,"score_spread":0.22871242475289064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117409323","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85941666,0.013305615,0.113056,0.0032040433,0.0018506902,0.0034030566,0.0002639074,0.00010728872,0.005392741],"genre_scores_gemma":[0.96942055,0.000041845473,0.030082976,0.0000608947,0.0000049051923,0.000022621512,0.0000011941329,0.000015158884,0.00034985016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964356,0.00033081218,0.0013755681,0.00075758,0.0005756325,0.00052484043],"domain_scores_gemma":[0.99620503,0.0006693549,0.00061537564,0.0020545702,0.00033986234,0.00011580831],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012581393,0.00038132948,0.0008188749,0.00026025707,0.00023004583,0.00007741017,0.0010404581,0.00009764821,0.000041908126],"category_scores_gemma":[0.0005381674,0.0002672562,0.0003213114,0.00105227,0.0012041937,0.00019849812,0.0010153269,0.0002637457,0.000005807106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006900686,0.0015934301,0.006306413,0.006456758,0.00066948606,0.0000026488333,0.01004951,0.00017171772,0.042161964,0.92089707,0.0019813483,0.009640631],"study_design_scores_gemma":[0.003283506,0.00068532926,0.02126049,0.009194748,0.0009334196,0.000018867267,0.0016312702,0.32256353,0.05223664,0.58675545,0.0004194191,0.0010173378],"about_ca_topic_score_codex":0.00004074672,"about_ca_topic_score_gemma":0.0000057092357,"teacher_disagreement_score":0.33414164,"about_ca_system_score_codex":0.000014621055,"about_ca_system_score_gemma":0.00015112033,"threshold_uncertainty_score":0.99997795},"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":"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":"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":"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":"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":"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":"W798479687","doi":"10.46298/dmtcs.2085","title":"On the number of regular edge labelings","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Lemma (botany); Triangulation; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Geometry","score_opus":0.010468270792305142,"score_gpt":0.24401975632452738,"score_spread":0.23355148553222224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W798479687","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.08011873,0.000008230088,0.906268,0.002198657,0.00030526952,0.00016450451,0.0000010736443,0.00012949611,0.010806071],"genre_scores_gemma":[0.73999244,0.0000013061656,0.25921223,0.0007496177,0.0000125488605,0.0000060350844,2.9133005e-7,0.000009565514,0.000015978314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720764,0.00014365153,0.00048013512,0.000585734,0.0010850092,0.0004978223],"domain_scores_gemma":[0.99643666,0.0011732678,0.00019411703,0.0017102528,0.00029520132,0.00019049362],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0036879068,0.00022812825,0.00030205311,0.000111803005,0.00041990523,0.00032062246,0.0030517834,0.000058245434,0.0000549159],"category_scores_gemma":[0.00053285237,0.0001319791,0.00012608168,0.0010727785,0.0028690363,0.00022184278,0.0009182905,0.0002212303,0.00016494471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017498947,0.00007197262,0.000008325558,0.000020157868,0.0000054346997,7.993632e-7,0.0006573858,0.00007272563,0.0007605415,0.9968264,0.00015883386,0.001415656],"study_design_scores_gemma":[0.00008802791,0.000067293506,0.000010581738,0.00008041612,0.0000047619974,0.000010380294,0.000008330091,0.40808645,0.0036234842,0.58788097,0.00002668008,0.000112638285],"about_ca_topic_score_codex":0.0000015559801,"about_ca_topic_score_gemma":6.646516e-8,"teacher_disagreement_score":0.6598737,"about_ca_system_score_codex":0.000013195382,"about_ca_system_score_gemma":0.00004473068,"threshold_uncertainty_score":0.9998446},"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":"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":"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":"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":"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":"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":"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":"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":"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":"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}]}