{"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08120368,0.0042055235,0.19632232,0.012266874,0.0017760725,0.0002507057,0.009040593,0.0027659372,0.6921683],"genre_scores_gemma":[0.66439116,0.002806559,0.1235225,0.0042196764,0.0011709107,0.0003976645,0.01002599,0.0012670576,0.19219856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919194,0.00018207543,0.000030138595,0.00023304734,0.00018817537,0.00017459932],"domain_scores_gemma":[0.9975069,0.0010327325,0.00027341972,0.00053345656,0.00022299631,0.00043059283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006941867,0.0008459533,0.0007716571,0.0016676752,0.0026348825,0.003455406,0.0017017518,0.0016638736,0.052998785],"category_scores_gemma":[0.004673382,0.0007380106,0.0007736241,0.0019681267,0.001661757,0.0062456434,0.003365525,0.0032942926,0.0075590583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013322677,0.0000615272,0.00045189814,0.0002846362,0.0000221428,0.00008605689,0.0001786744,0.0013420506,0.0016203906,0.878874,0.07709737,0.039848074],"study_design_scores_gemma":[0.000022407741,0.000012931234,0.00047906616,0.00006000066,0.000017902154,0.0002002782,0.00014244157,0.0036053068,0.0011900548,0.9346325,0.059623983,0.000013144319],"about_ca_topic_score_codex":0.0012355332,"about_ca_topic_score_gemma":0.0033362363,"teacher_disagreement_score":0.052998785,"about_ca_system_score_codex":0.0015489727,"about_ca_system_score_gemma":0.0007224497,"threshold_uncertainty_score":0.1772986},"labels":[],"label_agreement":null},{"id":"W100606770","doi":"","title":"Some new bounds and exact results on the independence number of Cartesian product graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Independence number; Independence (probability theory); Product (mathematics); Cartesian coordinate system; Discrete mathematics; Combinatorics; Statistics; Graph; Geometry","score_opus":0.013893191866972836,"score_gpt":0.23955949034871785,"score_spread":0.22566629848174502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W100606770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10167431,0.023408696,0.51707876,0.012464609,0.0022294798,0.00019722701,0.004788512,0.0023563106,0.33580214],"genre_scores_gemma":[0.7359433,0.015590765,0.18652149,0.0045008077,0.005419182,0.00079134933,0.0061502,0.0019156837,0.04316725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962339,0.00069979846,0.00021039763,0.0009272552,0.0012809192,0.0006477132],"domain_scores_gemma":[0.9768984,0.01714158,0.0011356381,0.0023972741,0.0011086224,0.001318473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035252725,0.0025815708,0.002136211,0.005633913,0.0023003027,0.0067098034,0.0051991525,0.0025185691,0.026524337],"category_scores_gemma":[0.02312053,0.001997457,0.0019111063,0.0075903507,0.0052150595,0.02118933,0.0059220823,0.012128428,0.004824991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033404207,0.00028518226,0.0018014145,0.00071795605,0.000088211156,0.00020256385,0.00054809777,0.01153218,0.003498905,0.8906647,0.037168596,0.053158112],"study_design_scores_gemma":[0.000027688619,0.000025652762,0.0010873127,0.00009720366,0.00005970883,0.00023741915,0.00011370666,0.017482657,0.0016767,0.967172,0.01197642,0.00004362571],"about_ca_topic_score_codex":0.0016950277,"about_ca_topic_score_gemma":0.0031958246,"teacher_disagreement_score":0.026524337,"about_ca_system_score_codex":0.003978782,"about_ca_system_score_gemma":0.0010018923,"threshold_uncertainty_score":0.08873272},"labels":[],"label_agreement":null},{"id":"W101313907","doi":"","title":"On Incidence Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Incidence (geometry); Combinatorics; Geometry","score_opus":0.014924425206149176,"score_gpt":0.22301637166141647,"score_spread":0.2080919464552673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W101313907","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04896,0.010310248,0.31075954,0.01086674,0.002341019,0.00015211392,0.0032783246,0.0013264881,0.61200553],"genre_scores_gemma":[0.5688936,0.013619521,0.1338307,0.0053108344,0.0042506307,0.00050608255,0.0075596785,0.0012938821,0.26473507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988331,0.0003006573,0.00006610564,0.00027780706,0.00033583833,0.00018649091],"domain_scores_gemma":[0.9973774,0.0012106432,0.00023943638,0.0005982654,0.00031468694,0.00025958175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093909976,0.0010716721,0.0012436681,0.003696423,0.0025272523,0.0042913607,0.0015054984,0.0014024669,0.029498404],"category_scores_gemma":[0.0042088474,0.00076318614,0.0011545852,0.004468367,0.0024028223,0.008964676,0.003468679,0.0046886443,0.0073742084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016605041,0.000028241173,0.00034477314,0.000064745254,0.0000117361615,0.000042517706,0.00013705368,0.0006475533,0.00024952347,0.9560521,0.020172317,0.02223276],"study_design_scores_gemma":[0.000005197598,0.0000043379,0.00020494778,0.000026948317,0.00000864405,0.000103801984,0.0000760613,0.0023044029,0.00017017768,0.97430223,0.022787593,0.000005668355],"about_ca_topic_score_codex":0.0015267491,"about_ca_topic_score_gemma":0.0026135473,"teacher_disagreement_score":0.029498404,"about_ca_system_score_codex":0.002254568,"about_ca_system_score_gemma":0.0007475915,"threshold_uncertainty_score":0.09868199},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8797716,0.0002566403,0.08083616,0.0019499856,0.00005854988,0.000076552,0.0006772291,0.0004219447,0.03595138],"genre_scores_gemma":[0.9431425,0.00012996522,0.0462789,0.0002206524,0.000024335211,0.000030511903,0.00077406765,0.0001691194,0.009230063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995474,0.000107196494,0.000016459775,0.00015769928,0.0000791863,0.000091932205],"domain_scores_gemma":[0.99845576,0.0008772088,0.0001941741,0.00016405704,0.00011920547,0.00018952128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038212066,0.00036654779,0.00069785287,0.0009658911,0.0022400431,0.0023046723,0.0015062081,0.0014980114,0.010702711],"category_scores_gemma":[0.0028017822,0.0006453641,0.00075476017,0.0010978355,0.0015617544,0.0031584185,0.0013656184,0.0013006155,0.0006041589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005123056,0.00022273518,0.0040839305,0.00033520063,0.000045594217,0.00046264924,0.0007545364,0.030924544,0.012841996,0.91958934,0.007680719,0.022546455],"study_design_scores_gemma":[0.00010154248,0.00009201224,0.0021851135,0.000055347125,0.000060404593,0.00031150755,0.0013972116,0.11064811,0.0078538945,0.8695128,0.007747499,0.00003453244],"about_ca_topic_score_codex":0.0064034355,"about_ca_topic_score_gemma":0.0084843645,"teacher_disagreement_score":0.010702711,"about_ca_system_score_codex":0.0016718983,"about_ca_system_score_gemma":0.0010553388,"threshold_uncertainty_score":0.035804093},"labels":[],"label_agreement":null},{"id":"W10372522","doi":"10.1016/s0730-725x(98)00221-5","title":"The Niche Category of Sparse Graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Niche; Ecology; Biology","score_opus":0.01386635973582632,"score_gpt":0.22059377484711803,"score_spread":0.20672741511129172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W10372522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0779937,0.008613197,0.82887715,0.009507002,0.0011938642,0.00032822794,0.0047219614,0.0012681974,0.06749676],"genre_scores_gemma":[0.49919948,0.010441409,0.40557158,0.003565454,0.0035476303,0.0010116769,0.01077342,0.00079855527,0.06509079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984865,0.00048233088,0.00009127669,0.00048046146,0.00032153522,0.00013785157],"domain_scores_gemma":[0.9950046,0.0024706377,0.00065513724,0.0011500143,0.00044113383,0.00027854912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011003331,0.0010401,0.0011330373,0.0024882487,0.0016985122,0.00299098,0.0016356612,0.0014648066,0.011236754],"category_scores_gemma":[0.005851675,0.00047673506,0.0012171181,0.0030286224,0.0020008686,0.004637206,0.00264752,0.001725386,0.0021584253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000766917,0.000047379694,0.0009104156,0.00045771067,0.00007680105,0.00017765752,0.00022538818,0.010395202,0.0009018967,0.8933327,0.020124426,0.07327369],"study_design_scores_gemma":[0.000020082294,0.00003118661,0.00037376443,0.000053273438,0.000018874982,0.00030248426,0.00008322761,0.022787523,0.00029032893,0.9281508,0.047874626,0.000013870037],"about_ca_topic_score_codex":0.0011344256,"about_ca_topic_score_gemma":0.001394012,"teacher_disagreement_score":0.011236754,"about_ca_system_score_codex":0.0014031068,"about_ca_system_score_gemma":0.00086249155,"threshold_uncertainty_score":0.037590683},"labels":[],"label_agreement":null},{"id":"W104746231","doi":"","title":"A Note On The (g, f)-Chromatic Index Of Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Chromatic scale; Edge coloring; Combinatorics; Graph; Computer science; Line graph","score_opus":0.01608614467246147,"score_gpt":0.22223223616757776,"score_spread":0.20614609149511628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W104746231","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102684386,0.036188833,0.24743663,0.02737351,0.012189393,0.00014066098,0.0030770379,0.0014993997,0.56941015],"genre_scores_gemma":[0.77670276,0.018001271,0.14843448,0.005380021,0.007965686,0.00022049184,0.0013006062,0.00095599354,0.041038655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880946,0.00029603083,0.000060996736,0.00038794984,0.00028345443,0.00016214408],"domain_scores_gemma":[0.9939865,0.004124753,0.00031006004,0.00078967644,0.00036729634,0.0004215875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015176941,0.00078069547,0.0011450688,0.0036941445,0.0025841023,0.004126509,0.0022328014,0.0021406442,0.009888815],"category_scores_gemma":[0.009152677,0.0006318806,0.00083660876,0.004921551,0.0045878906,0.0077998303,0.0029776942,0.0064978143,0.0016233973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017446621,0.000044804452,0.0015589606,0.00020142489,0.000031279353,0.00014274365,0.00022258842,0.0029421628,0.0021669595,0.9072086,0.048019025,0.037287034],"study_design_scores_gemma":[0.000021579644,0.000038252852,0.001696393,0.00007649816,0.00003432733,0.00026373286,0.0001349281,0.0071402085,0.0012381545,0.94911975,0.040190898,0.000045375084],"about_ca_topic_score_codex":0.003829823,"about_ca_topic_score_gemma":0.005085839,"teacher_disagreement_score":0.009888815,"about_ca_system_score_codex":0.0029019422,"about_ca_system_score_gemma":0.00093017286,"threshold_uncertainty_score":0.033081412},"labels":[],"label_agreement":null},{"id":"W105452184","doi":"","title":"New graceful familes of bipartite graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Graph","score_opus":0.011201572934480446,"score_gpt":0.2220134832688985,"score_spread":0.21081191033441804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W105452184","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38765693,0.0018138606,0.3215254,0.0038148616,0.00054397323,0.00017536659,0.0018785277,0.002285319,0.2803058],"genre_scores_gemma":[0.88951135,0.00093927677,0.054517988,0.0008660222,0.00045561107,0.0002183154,0.0013671116,0.00061723916,0.051507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919385,0.00022434139,0.000038134378,0.00020500968,0.00018112481,0.00015755031],"domain_scores_gemma":[0.99744546,0.0009957311,0.00031020748,0.0005431893,0.00021369205,0.0004916858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084642577,0.0005500396,0.0005392352,0.0021451274,0.0024794375,0.0026817648,0.0009786917,0.0010016542,0.01278285],"category_scores_gemma":[0.0033977572,0.0006046128,0.00088167086,0.0010748294,0.002205454,0.0042381505,0.0025936486,0.0020907004,0.0018221489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022971164,0.000014288266,0.00028179976,0.000021896652,0.000005063319,0.00006301087,0.00019487001,0.0009672357,0.0009472539,0.9882138,0.0039466014,0.0053212144],"study_design_scores_gemma":[0.000011698382,0.000013484365,0.00031838054,0.000017180297,0.000009882869,0.00022320666,0.00015525984,0.007585039,0.0008232116,0.97619814,0.014629535,0.000015000806],"about_ca_topic_score_codex":0.00085621147,"about_ca_topic_score_gemma":0.0014432672,"teacher_disagreement_score":0.01278285,"about_ca_system_score_codex":0.0011649416,"about_ca_system_score_gemma":0.00035961662,"threshold_uncertainty_score":0.042762876},"labels":[],"label_agreement":null},{"id":"W105849606","doi":"","title":"On the Toughness of the Total Graph of a Graph.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Toughness; Combinatorics; Composite material; Materials science","score_opus":0.011762932816759815,"score_gpt":0.21359655811035977,"score_spread":0.20183362529359997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W105849606","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47869724,0.0058803037,0.33343887,0.017873304,0.0009894016,0.00017230706,0.003100118,0.00058884156,0.15925963],"genre_scores_gemma":[0.92691076,0.0024453434,0.046719905,0.001239202,0.0011591915,0.00024558918,0.001425827,0.00033760717,0.019516636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980446,0.0007450891,0.00009934804,0.0004067924,0.00035146292,0.00035265536],"domain_scores_gemma":[0.974876,0.019122735,0.0014962464,0.0015323207,0.0009297404,0.0020429646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025838038,0.0009610833,0.0012580077,0.0035774016,0.0029057097,0.003865131,0.0024153844,0.0022198183,0.0126507],"category_scores_gemma":[0.01851595,0.001064629,0.0011716416,0.0026880878,0.0066082836,0.013021562,0.003813778,0.004515058,0.0011035947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010271401,0.000040786308,0.0013062233,0.00016581177,0.00003497712,0.00007815061,0.0003603234,0.007208713,0.0007831908,0.9704785,0.010039193,0.009401364],"study_design_scores_gemma":[0.000016213167,0.000022156924,0.0009780808,0.000047046975,0.000020007323,0.0001283292,0.00022710598,0.016344873,0.00030687638,0.97833705,0.0035523302,0.000020003221],"about_ca_topic_score_codex":0.0029998815,"about_ca_topic_score_gemma":0.0030389645,"teacher_disagreement_score":0.0126507,"about_ca_system_score_codex":0.0023689633,"about_ca_system_score_gemma":0.0007382797,"threshold_uncertainty_score":0.042320788},"labels":[],"label_agreement":null},{"id":"W107196105","doi":"","title":"On the Hall Number of a Graph.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.010567169687734653,"score_gpt":0.22593127934978857,"score_spread":0.2153641096620539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W107196105","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42425042,0.009202345,0.16373785,0.023050014,0.0027855595,0.0001553735,0.0039386344,0.0009523868,0.37192738],"genre_scores_gemma":[0.9299316,0.003136683,0.030926717,0.0013923341,0.0015701725,0.00018744399,0.0013317305,0.00027867404,0.031244667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986993,0.00042388382,0.000055703622,0.00028402903,0.00018747301,0.00034953462],"domain_scores_gemma":[0.99243176,0.0052350243,0.000612462,0.00059470924,0.00030459856,0.00082140113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013409646,0.00071830215,0.0011338515,0.002957419,0.0027862221,0.0036134922,0.0016487703,0.00201186,0.01660736],"category_scores_gemma":[0.008595719,0.00054943963,0.00057723635,0.0027151417,0.004941571,0.011617779,0.003235505,0.0035889307,0.0021581233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016292234,0.000048730697,0.0009211739,0.00015591338,0.000016342256,0.00006667141,0.0002274293,0.0040381546,0.000694838,0.9595092,0.018224364,0.015934227],"study_design_scores_gemma":[0.00002408951,0.000019825737,0.00050794746,0.000039683342,0.000014349346,0.000102949416,0.000198433,0.006266859,0.00051216845,0.9852232,0.0070711304,0.000019334493],"about_ca_topic_score_codex":0.0013153196,"about_ca_topic_score_gemma":0.0018526369,"teacher_disagreement_score":0.01660736,"about_ca_system_score_codex":0.00226855,"about_ca_system_score_gemma":0.0008066926,"threshold_uncertainty_score":0.05555719},"labels":[],"label_agreement":null},{"id":"W107410047","doi":"","title":"Pseudograceful Labelings of Cycles.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.010473612151783517,"score_gpt":0.23155276643571143,"score_spread":0.2210791542839279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W107410047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2788484,0.0027995599,0.4458373,0.0052920347,0.0006266498,0.00015991698,0.002558984,0.0013978916,0.2624793],"genre_scores_gemma":[0.8648225,0.0012639854,0.08631292,0.0011745325,0.0003949762,0.00018763954,0.0019497577,0.00046780397,0.043425858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882287,0.00039613174,0.00006636609,0.0002789032,0.00023542941,0.00020041055],"domain_scores_gemma":[0.9957943,0.0022438457,0.0003564406,0.0008655938,0.00037991517,0.0003599655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008204913,0.0004913032,0.00047918918,0.0014906909,0.0018909439,0.0033343819,0.0012562757,0.0011955479,0.014360114],"category_scores_gemma":[0.005049401,0.00054503116,0.0007253243,0.0018393978,0.0020969743,0.006499538,0.0023005446,0.0020521786,0.0016821448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035375066,0.000014895311,0.00020220786,0.000044880624,0.000004332873,0.0000296027,0.00011808557,0.0007411365,0.00054597633,0.98354095,0.0033911308,0.011331448],"study_design_scores_gemma":[0.000010377105,0.0000073651177,0.00013545886,0.000019844196,0.000005605646,0.0000823662,0.00009106054,0.0038235846,0.00073572417,0.98574096,0.009340085,0.00000761299],"about_ca_topic_score_codex":0.0011401073,"about_ca_topic_score_gemma":0.0019363093,"teacher_disagreement_score":0.014360114,"about_ca_system_score_codex":0.0014384792,"about_ca_system_score_gemma":0.0006116101,"threshold_uncertainty_score":0.048039317},"labels":[],"label_agreement":null},{"id":"W107778359","doi":"","title":"Note on Coloring the Square of an Outerplanar Graph.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Square (algebra); Combinatorics; Edge coloring; Graph coloring; Outerplanar graph; List coloring; Graph; Discrete mathematics; Pathwidth; Geometry; Graph power; Line graph","score_opus":0.018318325334799893,"score_gpt":0.2392375142984838,"score_spread":0.2209191889636839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W107778359","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017570995,0.028006718,0.19078687,0.06608372,0.091939785,0.00022465747,0.0016154672,0.0023283013,0.60144347],"genre_scores_gemma":[0.3453555,0.05441196,0.21283397,0.041407276,0.055391252,0.0003881971,0.0018200272,0.0014421334,0.28694966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995254,0.000095307536,0.000015821422,0.0001313097,0.00016605086,0.000065986],"domain_scores_gemma":[0.99829966,0.0011372106,0.00005566742,0.00018343265,0.00014284728,0.00018127813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006804415,0.0012357861,0.0008481168,0.0012173326,0.0020411324,0.0015292539,0.001893152,0.0014155748,0.015997935],"category_scores_gemma":[0.0024212408,0.00047266402,0.00078480167,0.0013607551,0.003007853,0.003275524,0.0024646607,0.0039528157,0.0037860095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031701237,0.00011979367,0.000740667,0.00074595737,0.000080163474,0.0014858155,0.000463517,0.0045663905,0.0067888815,0.4895177,0.41881078,0.07636325],"study_design_scores_gemma":[0.000028141692,0.000103797734,0.0013451173,0.000104557075,0.000053099346,0.0007713847,0.00026300538,0.0035408968,0.0030988283,0.5412352,0.44939265,0.00006323746],"about_ca_topic_score_codex":0.0075203907,"about_ca_topic_score_gemma":0.01607601,"teacher_disagreement_score":0.015997935,"about_ca_system_score_codex":0.0013629593,"about_ca_system_score_gemma":0.0008286013,"threshold_uncertainty_score":0.053518474},"labels":[],"label_agreement":null},{"id":"W107924583","doi":"","title":"New Classes of Graceful Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.011244903636052746,"score_gpt":0.2271952440663401,"score_spread":0.21595034043028735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W107924583","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31915635,0.0038044555,0.28359085,0.009199823,0.0011390342,0.00024043956,0.0029656382,0.0034718078,0.37643164],"genre_scores_gemma":[0.8842908,0.002158034,0.04861961,0.0017814838,0.0011915152,0.0002798705,0.0022301169,0.00078725215,0.05866142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897766,0.0001858072,0.00005028566,0.00029551284,0.00028260786,0.00020821313],"domain_scores_gemma":[0.996197,0.0014383983,0.0004921898,0.00090037554,0.00024676337,0.0007252212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084154506,0.000797273,0.00062693015,0.0026979719,0.002130114,0.004851311,0.0015568867,0.0013588708,0.015976984],"category_scores_gemma":[0.0041089985,0.00060155237,0.0011097853,0.0017846691,0.0033182479,0.007619237,0.0033776928,0.0032284646,0.001589387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002600839,0.000018128303,0.00030835974,0.00003587977,0.000005197235,0.000049412567,0.00014096481,0.00073900085,0.00047461383,0.9848809,0.005958833,0.007362662],"study_design_scores_gemma":[0.000015371872,0.000010203883,0.00027863588,0.000019132645,0.000010242266,0.00018128382,0.0000948805,0.0039096577,0.00046388808,0.977238,0.017765833,0.000012816945],"about_ca_topic_score_codex":0.0011156459,"about_ca_topic_score_gemma":0.0020021715,"teacher_disagreement_score":0.015976984,"about_ca_system_score_codex":0.0020499767,"about_ca_system_score_gemma":0.0006868872,"threshold_uncertainty_score":0.05344838},"labels":[],"label_agreement":null},{"id":"W108373764","doi":"","title":"On the Gracefulness of the Graph Cm U Pn.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.016821119483387822,"score_gpt":0.20224020637766946,"score_spread":0.18541908689428163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W108373764","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49468443,0.0033933916,0.2185302,0.011843413,0.00065566413,0.00010423425,0.0018384907,0.0011043354,0.26784593],"genre_scores_gemma":[0.9452081,0.001381003,0.024780957,0.0011773465,0.0005059432,0.000105376195,0.0008830684,0.00041427463,0.025544021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918133,0.00024125974,0.000038608883,0.00021730788,0.00013356592,0.00018796531],"domain_scores_gemma":[0.99490476,0.0031331195,0.00041743802,0.0008221453,0.00022735572,0.0004951378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010867459,0.00051626394,0.0006926737,0.001444945,0.0027557611,0.002974075,0.001187324,0.0013613156,0.010393521],"category_scores_gemma":[0.005745761,0.0005921436,0.00073890906,0.0014469334,0.004965625,0.00750021,0.0031709294,0.0030388837,0.0014057665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009186195,0.000021705828,0.0005137654,0.000049479913,0.0000075451635,0.0000577333,0.00030232724,0.002044907,0.0007280988,0.98216474,0.0054556504,0.008562328],"study_design_scores_gemma":[0.000011282477,0.000011030057,0.0004043514,0.0000147028095,0.000008006145,0.00006672632,0.00012146083,0.003476415,0.00038938882,0.9914197,0.0040664384,0.000010559418],"about_ca_topic_score_codex":0.0033923874,"about_ca_topic_score_gemma":0.003555444,"teacher_disagreement_score":0.010393521,"about_ca_system_score_codex":0.0015305037,"about_ca_system_score_gemma":0.00071807526,"threshold_uncertainty_score":0.034769833},"labels":[],"label_agreement":null},{"id":"W109448701","doi":"","title":"Bounds on the metric and partition dimensions of a graph","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Metric dimension; Partition (number theory); Vertex (graph theory); Dimension (graph theory); Graph; Discrete mathematics; Connectivity; Line graph; Pathwidth","score_opus":0.02084863889451242,"score_gpt":0.22194818326989638,"score_spread":0.20109954437538397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W109448701","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53816307,0.0065276306,0.39160657,0.0075480132,0.0003219208,0.00012364976,0.0034159392,0.0010629203,0.05123026],"genre_scores_gemma":[0.9260726,0.0015742938,0.068030834,0.00042717103,0.0003368946,0.0002031007,0.0010041934,0.0002232555,0.0021277028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950316,0.0015709623,0.00025593216,0.0012879715,0.00116909,0.0006843941],"domain_scores_gemma":[0.9602651,0.026542759,0.0030843832,0.005591721,0.0020612907,0.0024547628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033002982,0.0018152973,0.0017705864,0.0036342784,0.0020665545,0.004211962,0.002278591,0.0022948692,0.002886475],"category_scores_gemma":[0.029281951,0.0012087552,0.0010940701,0.003434665,0.004661749,0.01214126,0.0050504818,0.0040995185,0.000519122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005300927,0.00010689658,0.012736083,0.00037027936,0.000192246,0.0002481834,0.0008951053,0.0975213,0.008041568,0.8323274,0.010272985,0.03675785],"study_design_scores_gemma":[0.000041361498,0.00019425727,0.0071140714,0.000119602235,0.000084663196,0.0006591122,0.00033167598,0.22703123,0.0044077258,0.74713814,0.012721669,0.00015646897],"about_ca_topic_score_codex":0.0009902224,"about_ca_topic_score_gemma":0.0014473563,"teacher_disagreement_score":0.004211962,"about_ca_system_score_codex":0.0038727687,"about_ca_system_score_gemma":0.00086443895,"threshold_uncertainty_score":0.028099},"labels":[],"label_agreement":null},{"id":"W111329175","doi":"","title":"A Note On Excellent Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.008920038021905137,"score_gpt":0.2185138398954584,"score_spread":0.20959380187355325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W111329175","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008445124,0.045314256,0.07128653,0.1012412,0.0524024,0.00007656163,0.0010721233,0.001029072,0.7191327],"genre_scores_gemma":[0.24878776,0.07396835,0.15010598,0.054967996,0.0565592,0.00026693588,0.0015997047,0.0016541595,0.41209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993254,0.0002053347,0.000029215622,0.00013144352,0.00022307796,0.00008557209],"domain_scores_gemma":[0.99719703,0.0017789819,0.00008559055,0.00034611567,0.00031518147,0.00027709082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013040917,0.0007285033,0.0007708002,0.0018442728,0.002261366,0.0021516022,0.0014804305,0.0013129752,0.020919127],"category_scores_gemma":[0.003397899,0.00041997264,0.0007104084,0.0017734641,0.0027410656,0.0061056153,0.0026355693,0.0053286687,0.0049449066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003386895,0.000022545408,0.00018320262,0.00020481319,0.000013893162,0.0001767937,0.00013338905,0.000437544,0.0004651111,0.68267137,0.29057804,0.02507944],"study_design_scores_gemma":[0.0000065949453,0.00001580391,0.00036956844,0.00007426818,0.000010857518,0.00028045176,0.00012012145,0.00046793142,0.0002881057,0.52310944,0.47524232,0.00001467955],"about_ca_topic_score_codex":0.0020623666,"about_ca_topic_score_gemma":0.0058692964,"teacher_disagreement_score":0.020919127,"about_ca_system_score_codex":0.001370886,"about_ca_system_score_gemma":0.00062617986,"threshold_uncertainty_score":0.069981396},"labels":[],"label_agreement":null},{"id":"W112249820","doi":"","title":"Uniform Step Magic Squares Revisited.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Magic square; Mathematics; MAGIC (telescope); Combinatorics; Astronomy; Physics","score_opus":0.010376747642955368,"score_gpt":0.22670393089011842,"score_spread":0.21632718324716305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W112249820","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13943371,0.004324158,0.35296693,0.0055051316,0.0012751791,0.00013652554,0.0010550118,0.0012759332,0.49402735],"genre_scores_gemma":[0.76251674,0.0017372492,0.1568581,0.001711115,0.00029128065,0.00016890539,0.0008207714,0.0004440466,0.07545183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992818,0.00022245236,0.000027993105,0.0001575164,0.00019069633,0.000119498705],"domain_scores_gemma":[0.99837,0.00080156303,0.00009808595,0.00041321258,0.00018504116,0.00013210846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006690357,0.00035948466,0.00052592286,0.00091992127,0.001345385,0.0015970052,0.0012775704,0.0010938669,0.019997694],"category_scores_gemma":[0.0038591267,0.00041855322,0.00046423273,0.0015305447,0.0020117222,0.003668427,0.002262949,0.0025230797,0.002675383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032231965,0.000009545112,0.00011889483,0.000045867862,0.0000054325083,0.00004153137,0.00005251635,0.0009788024,0.0004127667,0.97822535,0.0050096232,0.015067373],"study_design_scores_gemma":[0.00002132357,0.000011587036,0.00018425235,0.000025448158,0.000008554163,0.00014764456,0.00008833041,0.0060276333,0.0009346395,0.97894067,0.013602122,0.000007857292],"about_ca_topic_score_codex":0.001165315,"about_ca_topic_score_gemma":0.0028047026,"teacher_disagreement_score":0.019997694,"about_ca_system_score_codex":0.0008111788,"about_ca_system_score_gemma":0.00067237526,"threshold_uncertainty_score":0.06689894},"labels":[],"label_agreement":null},{"id":"W112874490","doi":"","title":"A New Distance Measure between Graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Measure (data warehouse); Combinatorics; Computer science; Data mining","score_opus":0.016661389630604748,"score_gpt":0.2288441518363244,"score_spread":0.21218276220571963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W112874490","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057517327,0.005085009,0.8780891,0.003534174,0.001321018,0.00012505702,0.0016932492,0.0006849868,0.051950134],"genre_scores_gemma":[0.46288782,0.0032223428,0.50261587,0.0015081054,0.0014508123,0.00043510736,0.0027591367,0.00066574436,0.02445503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99671555,0.0009165335,0.00027324026,0.0008459945,0.0009817397,0.00026690078],"domain_scores_gemma":[0.99380493,0.0026680608,0.00074259855,0.0011618881,0.00080962013,0.0008129028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002134428,0.00075259333,0.0011066403,0.0053824177,0.002062296,0.005471114,0.0024097976,0.0024862315,0.0058636926],"category_scores_gemma":[0.011243119,0.00056159275,0.0009878235,0.0054315547,0.0033481237,0.012854008,0.0046584983,0.0043817353,0.0017842258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061636194,0.000047313708,0.00087194116,0.00013942113,0.00002744328,0.000046455207,0.00018954636,0.0023573202,0.0015223146,0.94183713,0.008152078,0.04474738],"study_design_scores_gemma":[0.00002225868,0.00006340328,0.00092926144,0.000104289065,0.00004081554,0.00043984244,0.00024146146,0.03183376,0.0018000592,0.92191786,0.042552114,0.00005481834],"about_ca_topic_score_codex":0.0008766339,"about_ca_topic_score_gemma":0.001207632,"teacher_disagreement_score":0.0058636926,"about_ca_system_score_codex":0.0027572396,"about_ca_system_score_gemma":0.00090088655,"threshold_uncertainty_score":0.020005226},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045727327,0.028053895,0.39857423,0.011371517,0.0011937236,0.00019434489,0.0016587134,0.0017216444,0.5115046],"genre_scores_gemma":[0.74911696,0.018353228,0.1217004,0.00258858,0.0016791828,0.0006204045,0.0019619956,0.0009571276,0.10302224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984931,0.0003082108,0.00010282646,0.00036011555,0.0005773306,0.00015847894],"domain_scores_gemma":[0.98992527,0.00863367,0.00023183167,0.0006364749,0.00034891616,0.00022378367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017037132,0.00065627875,0.0011979938,0.0024319699,0.00083818706,0.004034311,0.0018705308,0.0018762551,0.016519474],"category_scores_gemma":[0.010645975,0.00080154225,0.0011319229,0.0030075111,0.0035508655,0.008249823,0.0015917434,0.0046810755,0.0017514537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049628085,0.000022943143,0.00027827563,0.00026678515,0.000012940014,0.00003732858,0.000170664,0.0034537867,0.000668855,0.9421243,0.0135712465,0.039343297],"study_design_scores_gemma":[0.000006263661,0.000009235355,0.00022647994,0.000050998024,0.000006062842,0.00006152615,0.000031181185,0.0058093625,0.00034753693,0.98878014,0.004662184,0.000009023019],"about_ca_topic_score_codex":0.0013352431,"about_ca_topic_score_gemma":0.0012980032,"teacher_disagreement_score":0.016519474,"about_ca_system_score_codex":0.004433898,"about_ca_system_score_gemma":0.0008884282,"threshold_uncertainty_score":0.05526316},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08909248,0.005919317,0.6121877,0.05850383,0.0059247836,0.0005426126,0.008952199,0.0038614017,0.2150158],"genre_scores_gemma":[0.7064488,0.005057768,0.21964523,0.016626263,0.007666505,0.0016410517,0.0087995455,0.0020105063,0.032104366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940958,0.0011532911,0.00025821812,0.0018363615,0.0015435925,0.0011127702],"domain_scores_gemma":[0.95141816,0.035316832,0.0014700583,0.005805412,0.0033966715,0.0025929755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00498712,0.0040646926,0.003717791,0.0056019155,0.0036836856,0.009083054,0.00758142,0.0040116096,0.041924685],"category_scores_gemma":[0.03704614,0.0025087078,0.0043231216,0.006800974,0.008641183,0.012801422,0.0114964275,0.019058792,0.0073849238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008433893,0.0006923497,0.002844529,0.0016329009,0.00026868028,0.0003769882,0.0009202722,0.029500268,0.008342488,0.81905377,0.09058618,0.044938225],"study_design_scores_gemma":[0.00013663506,0.00009409877,0.0013144234,0.00022355435,0.000111081295,0.0002540153,0.0001814275,0.048165806,0.0023731098,0.9282705,0.01875958,0.00011587036],"about_ca_topic_score_codex":0.0056591895,"about_ca_topic_score_gemma":0.006025252,"teacher_disagreement_score":0.041924685,"about_ca_system_score_codex":0.0072173444,"about_ca_system_score_gemma":0.003935723,"threshold_uncertainty_score":0.14025205},"labels":[],"label_agreement":null},{"id":"W116172775","doi":"","title":"On Uniquely 4-List Colorable Complete Multipartite Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multipartite; Mathematics; Combinatorics; Discrete mathematics; Physics","score_opus":0.026826195966154015,"score_gpt":0.22970003075531611,"score_spread":0.2028738347891621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W116172775","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48754254,0.0023383978,0.25912502,0.005028348,0.0004604958,0.00021513617,0.0045455764,0.0014633243,0.23928124],"genre_scores_gemma":[0.85852534,0.0017059236,0.08495778,0.0013490103,0.00029805838,0.00024638113,0.003678791,0.0005577829,0.048681017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881846,0.00037150295,0.000052743864,0.00022532298,0.00021968858,0.00031231786],"domain_scores_gemma":[0.9954536,0.0026576237,0.0004944542,0.0006284575,0.0003021809,0.0004637076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083599036,0.00081475626,0.00086160685,0.0015292147,0.0023336334,0.003721491,0.0016778383,0.0015794112,0.016855847],"category_scores_gemma":[0.0042890958,0.0007669806,0.00076942454,0.00243927,0.0019415386,0.006679879,0.0030157622,0.0024533677,0.0023318632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016255325,0.000084917745,0.00080968556,0.00023721157,0.000027707396,0.00014906898,0.0003633101,0.01217669,0.0028101942,0.9381306,0.018743154,0.026304973],"study_design_scores_gemma":[0.000035753823,0.000023318744,0.00063313125,0.000060451006,0.000023245804,0.00023147045,0.00030759073,0.01825003,0.0018306333,0.965684,0.012892784,0.000027604156],"about_ca_topic_score_codex":0.0018695545,"about_ca_topic_score_gemma":0.0035147036,"teacher_disagreement_score":0.016855847,"about_ca_system_score_codex":0.0018729351,"about_ca_system_score_gemma":0.0008627853,"threshold_uncertainty_score":0.05638838},"labels":[],"label_agreement":null},{"id":"W116493043","doi":"","title":"Some Families of Elegant and Harmonious Graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.010731187205573462,"score_gpt":0.21494676707697435,"score_spread":0.2042155798714009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W116493043","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3018752,0.0042982823,0.2815704,0.0070646172,0.0004507801,0.00015638048,0.0017426629,0.0013178914,0.40152377],"genre_scores_gemma":[0.8462035,0.0020963508,0.083662085,0.0015121741,0.00036893817,0.00028753342,0.001292083,0.0003808965,0.06419652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909115,0.00028627124,0.000035352325,0.0002156771,0.00022127847,0.00015029388],"domain_scores_gemma":[0.99743843,0.0012900837,0.00027786504,0.0004990443,0.00024870347,0.00024577059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009935233,0.0004386789,0.00045448245,0.0016415806,0.0025301352,0.0025636677,0.0011381458,0.0012168486,0.012741085],"category_scores_gemma":[0.0046741255,0.00058263977,0.0007337147,0.001494389,0.0021045425,0.0049685542,0.0024213952,0.0018190242,0.0014170011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019289213,0.000011911196,0.0001892929,0.00003393964,0.000007853189,0.00007024615,0.00016991374,0.0006183548,0.0003251732,0.98603004,0.005121687,0.0074022943],"study_design_scores_gemma":[0.000016301885,0.000009751751,0.0002603699,0.000020422825,0.000012476296,0.0002809884,0.00015190197,0.002964634,0.00035021835,0.97577864,0.020144984,0.0000092322],"about_ca_topic_score_codex":0.00060236675,"about_ca_topic_score_gemma":0.0010238761,"teacher_disagreement_score":0.012741085,"about_ca_system_score_codex":0.0012538013,"about_ca_system_score_gemma":0.00038444964,"threshold_uncertainty_score":0.042623162},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6163658,0.0032486324,0.32290614,0.008693837,0.00039972886,0.00008584011,0.0015205152,0.00031277732,0.046466805],"genre_scores_gemma":[0.9528638,0.0014684625,0.037454825,0.00047846214,0.0006753658,0.00016820975,0.00060207985,0.0001552535,0.006133381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99617493,0.0014807833,0.0001947239,0.0008840812,0.00082303956,0.00044229403],"domain_scores_gemma":[0.97447395,0.016276762,0.0024411615,0.0024068952,0.0015007065,0.002900515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035998928,0.0012121496,0.0023022802,0.0041478625,0.0033438953,0.0069648805,0.003989242,0.0028000788,0.0067627905],"category_scores_gemma":[0.020696454,0.0018259387,0.0018067067,0.004465706,0.0063738814,0.020283855,0.006602851,0.005486768,0.00043008843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005354166,0.000022705064,0.0006805591,0.000065132204,0.000021363838,0.000031571297,0.0002140523,0.0031030905,0.0003813508,0.989725,0.0013770984,0.0043246145],"study_design_scores_gemma":[0.000014671211,0.000013958574,0.0004950984,0.000017331779,0.000016829517,0.0000839709,0.00013215492,0.017528366,0.0002707333,0.9799329,0.0014754417,0.00001853533],"about_ca_topic_score_codex":0.0016132302,"about_ca_topic_score_gemma":0.0012667266,"teacher_disagreement_score":0.0069648805,"about_ca_system_score_codex":0.0031620297,"about_ca_system_score_gemma":0.0010807948,"threshold_uncertainty_score":0.022942185},"labels":[],"label_agreement":null},{"id":"W122619311","doi":"","title":"Edge Labelings with a Condition at Distance Two.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Artificial intelligence; Computer science","score_opus":0.007497982961011388,"score_gpt":0.22061201837693925,"score_spread":0.21311403541592785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W122619311","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37648886,0.0012626717,0.2895401,0.009190193,0.0017138966,0.00033692524,0.0066578016,0.0033674168,0.31144217],"genre_scores_gemma":[0.8155928,0.0006019636,0.13211705,0.0023101328,0.00045247294,0.00022338514,0.0053926464,0.00069779,0.042611748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979328,0.0004938073,0.00018293766,0.0005362232,0.00038227165,0.00047198715],"domain_scores_gemma":[0.9905033,0.004858275,0.0007884168,0.0021642942,0.0007271525,0.00095857895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014190652,0.0006519949,0.00090981805,0.0014339001,0.0035757702,0.0036095094,0.0020145953,0.0030634953,0.025481254],"category_scores_gemma":[0.0119054485,0.00061572477,0.0009228575,0.0019630557,0.0023672555,0.00722119,0.003442721,0.0038271584,0.004196583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007931845,0.00029699324,0.0027003377,0.00031424937,0.00004317718,0.00037768233,0.00044754538,0.0039425874,0.008103656,0.8862545,0.04393321,0.052792896],"study_design_scores_gemma":[0.00011226447,0.00009583698,0.0013307277,0.00009358192,0.000054917524,0.0007387759,0.0007411321,0.013208927,0.008980276,0.9331441,0.04144348,0.000055985936],"about_ca_topic_score_codex":0.001499847,"about_ca_topic_score_gemma":0.0021042067,"teacher_disagreement_score":0.025481254,"about_ca_system_score_codex":0.0016390622,"about_ca_system_score_gemma":0.0013210324,"threshold_uncertainty_score":0.085243285},"labels":[],"label_agreement":null},{"id":"W124154265","doi":"","title":"Finding The Chromatic Polynomial Of Cayley Graphs Using The Tutte Polynomial.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chromatic polynomial; Mathematics; Tutte polynomial; Combinatorics; Cayley graph; Chromatic scale; Polynomial; Discrete mathematics; Graph; Line graph; Mathematical analysis","score_opus":0.02017909732845418,"score_gpt":0.25637136288100865,"score_spread":0.23619226555255446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W124154265","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5281136,0.0025071388,0.40228236,0.0037217417,0.00034208948,0.0001517745,0.0026042347,0.0015351248,0.05874192],"genre_scores_gemma":[0.92600757,0.0010268694,0.06070971,0.00024514357,0.0001850748,0.00009455599,0.0020957896,0.00035375255,0.0092815235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929714,0.00020357835,0.000025301195,0.00018332056,0.000113667855,0.00017708122],"domain_scores_gemma":[0.9938599,0.0045216493,0.00032329396,0.00068244955,0.0003259163,0.00028668766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008282358,0.0006563215,0.0007920887,0.0014098308,0.0013496445,0.003056378,0.0013711335,0.0011627127,0.0077361274],"category_scores_gemma":[0.010098596,0.0005999031,0.0007197333,0.0023114425,0.0015901475,0.0055041923,0.0013804559,0.002266866,0.0010941937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006785322,0.00034982013,0.009721726,0.0005069347,0.00014865072,0.00018626654,0.0005805939,0.10203873,0.010188044,0.7132144,0.039969236,0.12241712],"study_design_scores_gemma":[0.00008153778,0.00007012411,0.0019961635,0.00006405928,0.00006579213,0.00016560231,0.00035713482,0.24876693,0.0045983517,0.7352941,0.008491154,0.00004907381],"about_ca_topic_score_codex":0.0070812954,"about_ca_topic_score_gemma":0.012185537,"teacher_disagreement_score":0.0077361274,"about_ca_system_score_codex":0.0019488716,"about_ca_system_score_gemma":0.0015438087,"threshold_uncertainty_score":0.02587986},"labels":[],"label_agreement":null},{"id":"W125103475","doi":"","title":"On the detour number and geodetic number of a graph","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Geodetic datum; Mathematics; Graph; Combinatorics; Geodesy; Geography","score_opus":0.009437448856650828,"score_gpt":0.22815410607388853,"score_spread":0.2187166572172377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W125103475","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7835736,0.00206806,0.10671188,0.008296804,0.00039678946,0.000060474842,0.0012836419,0.00032662912,0.097282134],"genre_scores_gemma":[0.96064615,0.0014108198,0.019429412,0.00046643268,0.0004743279,0.000089526424,0.00072254916,0.00014806881,0.016612735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989396,0.00039349325,0.00004784597,0.00022159945,0.00019105343,0.00020646674],"domain_scores_gemma":[0.98732835,0.008950451,0.0012345898,0.00080119923,0.0004757957,0.0012097043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015116977,0.0010248311,0.0013312623,0.003780239,0.0030266147,0.0041369,0.0024188682,0.002350729,0.008577238],"category_scores_gemma":[0.008895075,0.0007617224,0.00071449263,0.0037008969,0.0051956126,0.008667857,0.002664969,0.0032009843,0.00087355037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022052113,0.00005852118,0.0022396876,0.000115563154,0.000022632026,0.00009177333,0.00038783174,0.0124934865,0.0014424904,0.9660234,0.004581419,0.012322746],"study_design_scores_gemma":[0.000036009948,0.000028190072,0.0011120178,0.000033518354,0.000022143571,0.00015091397,0.0002694307,0.023671895,0.0008086059,0.96934134,0.0044955853,0.000030449473],"about_ca_topic_score_codex":0.0024733548,"about_ca_topic_score_gemma":0.0028984756,"teacher_disagreement_score":0.008577238,"about_ca_system_score_codex":0.0024826212,"about_ca_system_score_gemma":0.0008151694,"threshold_uncertainty_score":0.028693676},"labels":[],"label_agreement":null},{"id":"W129355805","doi":"","title":"On Closed and Upper Closed Geodetic Numbers of Graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Geodetic datum; Mathematics; Combinatorics; Geodesy; Geology","score_opus":0.007574026678593303,"score_gpt":0.22569167916045052,"score_spread":0.21811765248185722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W129355805","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47961685,0.005993729,0.20527303,0.008569852,0.0008502083,0.00009327748,0.0019910594,0.0005156998,0.2970963],"genre_scores_gemma":[0.9262455,0.002083327,0.035184495,0.0008646228,0.0006749061,0.00015236567,0.0011235377,0.00017420897,0.033497166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985114,0.00043165087,0.00008738955,0.00032384173,0.00029969896,0.00034598226],"domain_scores_gemma":[0.9926334,0.0049653654,0.0006665289,0.00055788056,0.00040342464,0.0007734001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014541411,0.00068032154,0.00090676395,0.0034753822,0.0028936644,0.0053174966,0.0015607799,0.0016784333,0.009452938],"category_scores_gemma":[0.008093764,0.00064214395,0.00066148274,0.0035604532,0.005021064,0.01069,0.0033966673,0.003689984,0.0013327815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044552584,0.000017186267,0.00040321556,0.00003786917,0.000004282874,0.00002624512,0.00017009782,0.0010763926,0.00024379403,0.98786664,0.0027110945,0.007398609],"study_design_scores_gemma":[0.000010674476,0.0000076855085,0.00035423995,0.000023826302,0.00000493768,0.00007294562,0.00016740756,0.0028851929,0.0002504059,0.9915215,0.00469168,0.000009538455],"about_ca_topic_score_codex":0.0018532587,"about_ca_topic_score_gemma":0.0020969212,"teacher_disagreement_score":0.009452938,"about_ca_system_score_codex":0.0027022902,"about_ca_system_score_gemma":0.0007447954,"threshold_uncertainty_score":0.031623244},"labels":[],"label_agreement":null},{"id":"W130533876","doi":"","title":"Magic Squares, Finite Planes and Simple Quasilattices.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Magic square; Simple (philosophy); MAGIC (telescope); Geometry; Physics; Astrophysics","score_opus":0.012245092699127198,"score_gpt":0.22974198485979122,"score_spread":0.21749689216066403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W130533876","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3298452,0.015498806,0.3109066,0.0124034975,0.0011261607,0.00010159315,0.002070115,0.00071465404,0.32733348],"genre_scores_gemma":[0.86537594,0.0034655707,0.08329078,0.0011710795,0.00043734428,0.000100011144,0.0010593936,0.00014244087,0.044957478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994223,0.00018515672,0.000038476002,0.00012274345,0.0001393302,0.00009206133],"domain_scores_gemma":[0.99847883,0.00088716246,0.00017367091,0.0001754704,0.00011559007,0.00016925464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006044138,0.00042567414,0.00047825326,0.0010392849,0.0017122511,0.003281855,0.0007813359,0.0009698268,0.00981381],"category_scores_gemma":[0.0027296268,0.00049412565,0.0004902301,0.0016616114,0.0029444124,0.0065554427,0.0017997246,0.002003812,0.0011333611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026602987,0.000011506408,0.00017208258,0.000044320408,0.0000056524905,0.00002924253,0.00008408514,0.00064903015,0.00036701915,0.9858642,0.0037385863,0.009007699],"study_design_scores_gemma":[0.000009687106,0.0000056654285,0.000121920166,0.000013039927,0.0000039489482,0.00008567397,0.00010109186,0.0014344221,0.000249498,0.9909689,0.007000146,0.0000060900934],"about_ca_topic_score_codex":0.0018632732,"about_ca_topic_score_gemma":0.003650164,"teacher_disagreement_score":0.00981381,"about_ca_system_score_codex":0.0013817943,"about_ca_system_score_gemma":0.0006525444,"threshold_uncertainty_score":0.032830477},"labels":[],"label_agreement":null},{"id":"W130779696","doi":"","title":"Some results on mod (integral) sum graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mod; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.014993923481740027,"score_gpt":0.23965203163308585,"score_spread":0.22465810815134582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W130779696","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12517434,0.014788183,0.16887546,0.014201359,0.002113799,0.00012816164,0.0021523996,0.0013952046,0.6711711],"genre_scores_gemma":[0.7847683,0.018117284,0.08378691,0.006278851,0.0044168895,0.00029628043,0.003500952,0.0011040408,0.09773057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999099,0.00020214984,0.00004682436,0.00020249192,0.0002709799,0.0001785995],"domain_scores_gemma":[0.99612314,0.0024141537,0.0002733421,0.00050000654,0.00028162354,0.00040767528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013252452,0.0012264461,0.001126171,0.0034319567,0.0028388288,0.004417963,0.0020161548,0.0015136928,0.021801852],"category_scores_gemma":[0.0050366176,0.00083356985,0.00113965,0.0052579734,0.003273723,0.009274277,0.0034795299,0.004937439,0.0038610133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046086472,0.00007272975,0.00043206773,0.00026320395,0.000019648733,0.000087956025,0.00017624444,0.0014542124,0.000600234,0.95821095,0.01711899,0.021517646],"study_design_scores_gemma":[0.0000109523235,0.000011629592,0.00029878918,0.00003849644,0.000022004233,0.00017362325,0.000091926915,0.0021632784,0.00049345323,0.9802337,0.016451227,0.000010798607],"about_ca_topic_score_codex":0.0010636749,"about_ca_topic_score_gemma":0.0017307501,"teacher_disagreement_score":0.021801852,"about_ca_system_score_codex":0.0022890868,"about_ca_system_score_gemma":0.000841438,"threshold_uncertainty_score":0.07293451},"labels":[],"label_agreement":null},{"id":"W132247431","doi":"","title":"Graceful labelings of cyclic snakes.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.0123412337332058,"score_gpt":0.22917732223805584,"score_spread":0.21683608850485003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W132247431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3210734,0.001970391,0.4782087,0.002698436,0.00052491477,0.00012804495,0.0014500051,0.0019006104,0.1920455],"genre_scores_gemma":[0.83681756,0.001342986,0.10690931,0.000646676,0.00034133243,0.00014703574,0.001539509,0.0007267969,0.0515288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946266,0.00012638801,0.00003341133,0.00014157673,0.00013073694,0.00010531891],"domain_scores_gemma":[0.9982627,0.0006034848,0.00025437368,0.00045702938,0.0001407228,0.0002815773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004967966,0.00047066665,0.00046330434,0.0014117938,0.0017533537,0.002338434,0.0009871037,0.0009596431,0.01097231],"category_scores_gemma":[0.0025716128,0.0004811631,0.00074158644,0.0012995896,0.0020979403,0.003364004,0.002348146,0.0017289954,0.0018201545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003485572,0.0000146098655,0.0002178524,0.000039609527,0.0000060007787,0.00005127814,0.00019085694,0.0023991114,0.0015244723,0.97546786,0.0045493627,0.015504193],"study_design_scores_gemma":[0.000010419125,0.000016073653,0.00019570535,0.000021436595,0.000008724504,0.00013752058,0.000121468816,0.008888363,0.0014330014,0.971383,0.01777069,0.000013610592],"about_ca_topic_score_codex":0.0012814014,"about_ca_topic_score_gemma":0.0017976031,"teacher_disagreement_score":0.01097231,"about_ca_system_score_codex":0.0011535644,"about_ca_system_score_gemma":0.00039809657,"threshold_uncertainty_score":0.03670609},"labels":[],"label_agreement":null},{"id":"W135314135","doi":"","title":"Two Classes of Graceful Graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.01052636086573362,"score_gpt":0.23531244286965577,"score_spread":0.22478608200392217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W135314135","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42008337,0.002383849,0.19306636,0.008763963,0.00071100745,0.00032278197,0.00432726,0.0021369925,0.36820444],"genre_scores_gemma":[0.9207299,0.0011117146,0.025946654,0.001470535,0.00041380394,0.00025028002,0.0026189482,0.0002892408,0.04716896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989103,0.00016101441,0.00005009049,0.00034131348,0.00024517463,0.00029199934],"domain_scores_gemma":[0.9967368,0.0011058324,0.00049187307,0.0008076682,0.00020949928,0.00064831093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006308702,0.00064661296,0.0005017211,0.0019872028,0.0017970453,0.0044212085,0.0012974067,0.0014859013,0.015236533],"category_scores_gemma":[0.0039396356,0.00048051908,0.00084825896,0.0015937027,0.0028885328,0.0047454587,0.0025151824,0.0022427102,0.001287159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049524853,0.000025872181,0.00048561746,0.0000355845,0.0000052585538,0.00005994428,0.00018073453,0.00062859757,0.0005148039,0.98401445,0.005837436,0.008162079],"study_design_scores_gemma":[0.000027133925,0.000016282615,0.0007515479,0.000028502194,0.000013277677,0.00021770799,0.00017588763,0.0041842368,0.0007946153,0.97257125,0.021201205,0.00001830405],"about_ca_topic_score_codex":0.0017160256,"about_ca_topic_score_gemma":0.0021478585,"teacher_disagreement_score":0.015236533,"about_ca_system_score_codex":0.001993516,"about_ca_system_score_gemma":0.0008604853,"threshold_uncertainty_score":0.05097127},"labels":[],"label_agreement":null},{"id":"W136393546","doi":"","title":"The Basis Number of The Composition of Theta Graphs with Some Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Basis (linear algebra); Composition (language); Indifference graph; Graph; Geometry; Linguistics","score_opus":0.005473289516366835,"score_gpt":0.20217956937168396,"score_spread":0.19670627985531713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W136393546","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6809602,0.0006144761,0.12708256,0.0025135716,0.0005755409,0.000080397556,0.0014524341,0.0006637,0.18605718],"genre_scores_gemma":[0.9412787,0.00035339157,0.031351134,0.0002696655,0.00017676226,0.00010274712,0.00085900567,0.00029535365,0.025313344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993536,0.00018457651,0.000028450946,0.0001382082,0.00011374193,0.0001813593],"domain_scores_gemma":[0.99798656,0.000920962,0.00023209299,0.00029253782,0.00022328064,0.00034456854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075206603,0.0004315566,0.00060891977,0.0017333993,0.002331717,0.0032147479,0.0009781562,0.0011425149,0.013315985],"category_scores_gemma":[0.0033903297,0.00041529478,0.00060674036,0.0011013414,0.0023230973,0.0039612916,0.0015559915,0.0020808557,0.0025008342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001570962,0.000032128424,0.0008907289,0.000053736272,0.000009535424,0.00005460207,0.00015933851,0.0011241339,0.0032841498,0.9805279,0.004029302,0.0096773645],"study_design_scores_gemma":[0.000024158999,0.000031525684,0.0010083568,0.000033773646,0.000020394034,0.00022667342,0.00028846794,0.009550291,0.0054166312,0.9737787,0.009598191,0.00002277346],"about_ca_topic_score_codex":0.0009107058,"about_ca_topic_score_gemma":0.0011005632,"teacher_disagreement_score":0.013315985,"about_ca_system_score_codex":0.0010467173,"about_ca_system_score_gemma":0.00068576285,"threshold_uncertainty_score":0.044546366},"labels":[],"label_agreement":null},{"id":"W13645353","doi":"","title":"On defining numbers of k-chromatic k-regular graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics; Discrete mathematics","score_opus":0.007702880638844047,"score_gpt":0.21827958512117943,"score_spread":0.21057670448233537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W13645353","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39595193,0.0034866899,0.25200525,0.004842348,0.0010332948,0.000196522,0.0015153978,0.0005955105,0.340373],"genre_scores_gemma":[0.8742165,0.0016137299,0.09007449,0.001021414,0.0005145942,0.0003786859,0.0010043622,0.00032439147,0.030851806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859697,0.00042986093,0.00008845862,0.00034255884,0.0002614125,0.00028074236],"domain_scores_gemma":[0.99540544,0.0026786616,0.00049503375,0.0003758132,0.0004392809,0.00060580194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014935959,0.0007958403,0.0007125251,0.0030059603,0.0023920962,0.0048732986,0.0019606694,0.0015524116,0.0093358075],"category_scores_gemma":[0.006458497,0.0006669333,0.0007146292,0.0027352495,0.0048125014,0.008941926,0.0032767323,0.003315103,0.0017492382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021253514,0.000013040287,0.00025559188,0.000030388064,0.0000024615988,0.000013830981,0.00017358256,0.0005298275,0.0003301456,0.9920402,0.0016956007,0.0048940578],"study_design_scores_gemma":[0.000010069554,0.000010715489,0.00030148024,0.000027628113,0.0000049609835,0.000076235665,0.00019022555,0.0027450859,0.00038474414,0.98955005,0.0066850698,0.000013703987],"about_ca_topic_score_codex":0.0011990075,"about_ca_topic_score_gemma":0.0020392654,"teacher_disagreement_score":0.0093358075,"about_ca_system_score_codex":0.0025392552,"about_ca_system_score_gemma":0.0006660253,"threshold_uncertainty_score":0.031231403},"labels":[],"label_agreement":null},{"id":"W137471786","doi":"","title":"New Families of Graceful Graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.010258783317897638,"score_gpt":0.21646209522684115,"score_spread":0.2062033119089435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W137471786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2935198,0.0040774764,0.4104072,0.006314431,0.00079640414,0.00021524815,0.002325961,0.0030703458,0.27927318],"genre_scores_gemma":[0.8515653,0.0024343878,0.07259661,0.0014678162,0.000658907,0.00036960858,0.0019231878,0.0008728268,0.06811139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989454,0.00025229255,0.000046979203,0.00028068075,0.00028165703,0.0001929611],"domain_scores_gemma":[0.99585295,0.0017133116,0.0004772461,0.0008970115,0.0003498632,0.0007096743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011288357,0.00070053554,0.0005817982,0.0026421354,0.002741084,0.0034512249,0.0015073875,0.0011830826,0.015165201],"category_scores_gemma":[0.005461033,0.0007053945,0.0010593382,0.0016954223,0.0027560322,0.0069231736,0.003527665,0.0023773862,0.0016871192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029146924,0.000013887719,0.00030380746,0.00003578281,0.0000062398976,0.000083124796,0.00021264468,0.00094222074,0.00066221977,0.98533046,0.0050813295,0.007299053],"study_design_scores_gemma":[0.00001623713,0.000014406402,0.00026377983,0.000025363117,0.000014183064,0.0003006301,0.00014961378,0.0054273903,0.0007314853,0.9677922,0.025249008,0.00001566575],"about_ca_topic_score_codex":0.0009774826,"about_ca_topic_score_gemma":0.001667753,"teacher_disagreement_score":0.015165201,"about_ca_system_score_codex":0.0017236039,"about_ca_system_score_gemma":0.00066217093,"threshold_uncertainty_score":0.050732672},"labels":[],"label_agreement":null},{"id":"W142923102","doi":"","title":"Minimizing b + D and well covered graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.011272300107994696,"score_gpt":0.2164174358797207,"score_spread":0.205145135771726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W142923102","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6001131,0.0036246106,0.27355203,0.005917031,0.00022842351,0.000111198286,0.0034552088,0.00086212414,0.112136275],"genre_scores_gemma":[0.85369736,0.0015180248,0.10770196,0.00076047704,0.0001766016,0.00013963143,0.0028818587,0.00035704725,0.03276701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931645,0.00023814214,0.000030021774,0.0001484284,0.000118937314,0.00014810728],"domain_scores_gemma":[0.99712664,0.0016867898,0.0003281603,0.00032706928,0.00018087718,0.00035044298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061465794,0.00058153464,0.00065221643,0.0012433846,0.0009994855,0.0019048423,0.0010388785,0.0011325377,0.0075081503],"category_scores_gemma":[0.003699234,0.0005486926,0.00044990322,0.0013933616,0.000897841,0.0030407596,0.0015181653,0.0013231862,0.00096047187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023825462,0.0001284927,0.0030008059,0.000296038,0.000058253267,0.00017708587,0.0002928224,0.02018981,0.0051031136,0.888803,0.03532266,0.04638973],"study_design_scores_gemma":[0.000040007148,0.000037608046,0.0016548513,0.00005207089,0.000029690096,0.00032826499,0.00023902749,0.053077374,0.002665615,0.92610663,0.015750568,0.000018304698],"about_ca_topic_score_codex":0.0022188344,"about_ca_topic_score_gemma":0.0038907698,"teacher_disagreement_score":0.0075081503,"about_ca_system_score_codex":0.0015602881,"about_ca_system_score_gemma":0.0005083212,"threshold_uncertainty_score":0.025117278},"labels":[],"label_agreement":null},{"id":"W1483725570","doi":"","title":"The edge-coloring of graphs with small genus","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Genus; Edge coloring; Combinatorics; Enhanced Data Rates for GSM Evolution; Graph coloring; Zoology; Biology; Computer science; Graph; Artificial intelligence; Line graph","score_opus":0.013783901787935912,"score_gpt":0.20396592795589297,"score_spread":0.19018202616795704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483725570","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8088235,0.0027552391,0.13010858,0.005538008,0.00038040613,0.00005627021,0.00061864185,0.000634016,0.051085368],"genre_scores_gemma":[0.95063204,0.0014436676,0.034834165,0.00063870964,0.0003947308,0.00007774637,0.0005200726,0.00024884296,0.011210147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992873,0.00029464188,0.000032811564,0.00014704953,0.00009436028,0.000143934],"domain_scores_gemma":[0.99331725,0.004270731,0.00066421536,0.00076492695,0.00026380882,0.00071909756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011163582,0.00095055613,0.0013015344,0.0020000546,0.0024216175,0.004613177,0.002167169,0.0019200561,0.004372206],"category_scores_gemma":[0.0074646696,0.0011649743,0.001003359,0.0023062243,0.0037691453,0.0060337107,0.0024281912,0.0028739816,0.0005118296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002025384,0.000049854338,0.0017607232,0.00015934487,0.000023092007,0.00008386201,0.00038368785,0.015098885,0.0024206783,0.9595757,0.005993797,0.014247856],"study_design_scores_gemma":[0.0000341995,0.00001533928,0.0005767565,0.000027134802,0.000019949723,0.00008752332,0.00012994246,0.025927527,0.00071009266,0.97008854,0.0023664632,0.000016499609],"about_ca_topic_score_codex":0.0023140272,"about_ca_topic_score_gemma":0.0028222075,"teacher_disagreement_score":0.004613177,"about_ca_system_score_codex":0.0018960417,"about_ca_system_score_gemma":0.0008610611,"threshold_uncertainty_score":0.014626503},"labels":[],"label_agreement":null},{"id":"W1491930737","doi":"","title":"Vertex-Magic Total Labelings of Complete Bipartite Graphs","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Vertex (graph theory); MAGIC (telescope); Complete bipartite graph; Lambda; Discrete mathematics; Graph; Physics","score_opus":0.014770083210947256,"score_gpt":0.22008917696039187,"score_spread":0.20531909374944463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491930737","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8472782,0.00041392486,0.1173004,0.0003613131,0.000028988816,0.000043151424,0.0012020981,0.0004568166,0.032915182],"genre_scores_gemma":[0.95444155,0.00024841182,0.03867894,0.00010959873,0.00002616938,0.00006156709,0.0013012565,0.000094304836,0.0050381143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935085,0.00017031915,0.00004358077,0.00016180705,0.0001345172,0.00013886695],"domain_scores_gemma":[0.99721515,0.0014405578,0.00038759,0.00044513337,0.00023308722,0.00027844842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065379654,0.00039385242,0.00036558323,0.0013202741,0.001148645,0.0018752125,0.00068332,0.0005684323,0.0035121506],"category_scores_gemma":[0.002943725,0.00053867215,0.00051855575,0.0014234952,0.0014045648,0.0024176708,0.0010093801,0.00064913376,0.00033869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000324298,0.00005597681,0.0044426625,0.0001697343,0.000029073255,0.00011785351,0.00056086225,0.019147387,0.007848929,0.926286,0.004535603,0.036481753],"study_design_scores_gemma":[0.00004456242,0.000054972905,0.0022186062,0.000041847074,0.000036651647,0.00029148915,0.0003127571,0.048953604,0.006860937,0.93306124,0.00808977,0.00003357335],"about_ca_topic_score_codex":0.0014307547,"about_ca_topic_score_gemma":0.0023199376,"teacher_disagreement_score":0.0035121506,"about_ca_system_score_codex":0.0011070627,"about_ca_system_score_gemma":0.0004995403,"threshold_uncertainty_score":0.011749268},"labels":[],"label_agreement":null},{"id":"W149423157","doi":"","title":"A Note on the Decomposition Dimension of Complete Graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dimension (graph theory); Decomposition; Combinatorics; Discrete mathematics","score_opus":0.01587284314016184,"score_gpt":0.24239626202262987,"score_spread":0.22652341888246802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W149423157","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048645597,0.07099646,0.3153717,0.08704747,0.017916467,0.00012970259,0.0024170254,0.0012040911,0.45627138],"genre_scores_gemma":[0.5627613,0.052320346,0.2718559,0.02145095,0.025105659,0.00040630036,0.0020408672,0.0012835488,0.062775165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822694,0.00059941725,0.000081287784,0.00042104642,0.00046640693,0.00020496077],"domain_scores_gemma":[0.9878236,0.0093212705,0.0003691795,0.0011597151,0.00051197386,0.00081416825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002193358,0.001243378,0.0014513473,0.002865864,0.0027834426,0.0049140113,0.0024188522,0.002284748,0.012460721],"category_scores_gemma":[0.011629732,0.00084043154,0.0013558497,0.003948117,0.006369308,0.012632761,0.00501649,0.0102992365,0.001952189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007189861,0.00003591855,0.00056362094,0.00022786771,0.000028338356,0.000119782635,0.00021236262,0.001452883,0.0007828147,0.9081335,0.06647116,0.02189991],"study_design_scores_gemma":[0.000009686046,0.000013428726,0.00044223227,0.00006816808,0.000014114447,0.00013835293,0.00011264685,0.0022901285,0.00032550792,0.9606919,0.03587627,0.000017640266],"about_ca_topic_score_codex":0.002120187,"about_ca_topic_score_gemma":0.0036414566,"teacher_disagreement_score":0.012460721,"about_ca_system_score_codex":0.0026571911,"about_ca_system_score_gemma":0.0008963878,"threshold_uncertainty_score":0.041685224},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19125539,0.00071494724,0.71964514,0.0027071624,0.00020440882,0.00017891091,0.00089170976,0.001739949,0.082662374],"genre_scores_gemma":[0.8408603,0.00061501394,0.13706595,0.0008534667,0.00014124931,0.000157823,0.001260561,0.00044904934,0.018596591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987984,0.00026775763,0.000061506944,0.0003274989,0.00028918,0.0002555877],"domain_scores_gemma":[0.99456835,0.0024768165,0.0005287714,0.0014608201,0.0006408907,0.00032428215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010708944,0.00043044687,0.00048099732,0.0007558445,0.0016098936,0.0025852742,0.0019132893,0.0012468938,0.014123351],"category_scores_gemma":[0.005011019,0.00037789758,0.00057114335,0.0012638782,0.002917507,0.005523389,0.0034688243,0.0015263684,0.002082502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034358256,0.00009977552,0.0015381702,0.0002709933,0.000020608859,0.00012661592,0.00039470452,0.03890656,0.015296498,0.87482774,0.011270356,0.056904376],"study_design_scores_gemma":[0.00007879068,0.00018088782,0.0009117926,0.00005470589,0.000030778374,0.00042020314,0.00027941342,0.15894246,0.021481043,0.7889228,0.02864069,0.000056522054],"about_ca_topic_score_codex":0.0014808676,"about_ca_topic_score_gemma":0.0018830416,"teacher_disagreement_score":0.014123351,"about_ca_system_score_codex":0.0024608593,"about_ca_system_score_gemma":0.0012125382,"threshold_uncertainty_score":0.04724729},"labels":[],"label_agreement":null},{"id":"W150937722","doi":"","title":"Graceful Labelings of Graphs Associated with Vertex-saturated Graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Edge-graceful labeling; Discrete mathematics; Graph; Line graph","score_opus":0.013250123035972,"score_gpt":0.1997373051002761,"score_spread":0.1864871820643041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W150937722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51770204,0.001652824,0.3160456,0.0033973877,0.00037246218,0.00014175344,0.002633844,0.0021784543,0.1558756],"genre_scores_gemma":[0.9338214,0.00085849833,0.0404167,0.0004397465,0.000297196,0.00012329285,0.0015924217,0.00037511202,0.022075724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989141,0.00027492372,0.000067215144,0.00025984732,0.00022113232,0.0002627737],"domain_scores_gemma":[0.99564654,0.0018836027,0.00070115866,0.0009205137,0.00026209882,0.00058619207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008353828,0.00069466716,0.00059660967,0.002246359,0.0025159828,0.003474732,0.0012194866,0.0011417102,0.00917197],"category_scores_gemma":[0.0046114586,0.0006564088,0.00089595316,0.0022031614,0.002491898,0.005038544,0.0029124583,0.0020181735,0.001281643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063337546,0.000021894946,0.0005844064,0.000045639248,0.000009743102,0.000074221956,0.00028352017,0.0024219693,0.001481311,0.9839324,0.0032883196,0.0077931215],"study_design_scores_gemma":[0.00001033033,0.000010824173,0.0003602074,0.0000169246,0.000013368364,0.00012082557,0.0001456865,0.0066046747,0.0012812077,0.9850699,0.006352553,0.000013504008],"about_ca_topic_score_codex":0.0018262464,"about_ca_topic_score_gemma":0.0022720497,"teacher_disagreement_score":0.00917197,"about_ca_system_score_codex":0.0018354406,"about_ca_system_score_gemma":0.00071739743,"threshold_uncertainty_score":0.030683279},"labels":[],"label_agreement":null},{"id":"W1547542988","doi":"","title":"Sparse Semi-Magic Squares and Vertex-magic Labelings","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Magic square; Combinatorics; MAGIC (telescope); Mathematics; Row; Vertex (graph theory); Remainder; Discrete mathematics; Arithmetic; Graph; Computer science; Physics; Quantum mechanics","score_opus":0.007694649119300171,"score_gpt":0.20465222152414303,"score_spread":0.19695757240484285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547542988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14789508,0.0006907433,0.7496738,0.0010100966,0.00026381493,0.000094615636,0.0005147842,0.0010656621,0.09879149],"genre_scores_gemma":[0.69134575,0.0006540752,0.27717867,0.00063465437,0.00018244416,0.0002128053,0.0006821365,0.00031599402,0.028793486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947554,0.00013254934,0.000024041594,0.00011924259,0.00015929207,0.00008927239],"domain_scores_gemma":[0.99906987,0.00040056193,0.00009268124,0.00022896887,0.00011870198,0.00008926346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003481093,0.0003898658,0.00035812994,0.0005535442,0.0008645798,0.00096435694,0.0006587034,0.0005994616,0.0067454367],"category_scores_gemma":[0.0015542242,0.0003430162,0.00040495893,0.0009142273,0.0015660042,0.0019070604,0.0017281899,0.0013157693,0.0011981312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038011625,0.000011687603,0.00015281273,0.000048972568,0.000003470197,0.000077009994,0.00014684076,0.004344441,0.004178363,0.9693141,0.0025076813,0.01917672],"study_design_scores_gemma":[0.000018068293,0.000031759148,0.00013493486,0.000015619682,0.0000048617403,0.00020577289,0.00008624276,0.019566601,0.0048589,0.95565164,0.019407995,0.000017615004],"about_ca_topic_score_codex":0.00051769643,"about_ca_topic_score_gemma":0.0009831056,"teacher_disagreement_score":0.0067454367,"about_ca_system_score_codex":0.00056050613,"about_ca_system_score_gemma":0.0003813375,"threshold_uncertainty_score":0.022565722},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73026574,0.0005486324,0.19394676,0.0022612866,0.00022561179,0.00020952083,0.0018908521,0.00073749956,0.06991401],"genre_scores_gemma":[0.9387049,0.00043857205,0.039515954,0.00056824036,0.000101043384,0.00019174574,0.0014792361,0.00011809846,0.018882202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991621,0.00014029993,0.00007241471,0.0002643394,0.00018868585,0.00017214811],"domain_scores_gemma":[0.9976047,0.0012277594,0.00035076152,0.00034559757,0.00021269609,0.00025846343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051494775,0.0005865071,0.00072454085,0.0008543313,0.00091299426,0.0027053156,0.00072246284,0.0010807923,0.008743346],"category_scores_gemma":[0.003100749,0.00085984153,0.0008283573,0.0010177608,0.0016287976,0.0028532327,0.0015991003,0.0013369273,0.0009162164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002960082,0.0001104051,0.0025542811,0.0002494037,0.00007092275,0.00043613042,0.00046646994,0.016748644,0.010927115,0.935043,0.0045021614,0.028595485],"study_design_scores_gemma":[0.00017186393,0.000064081854,0.0015127377,0.000027489808,0.00004558207,0.0005439716,0.00017462965,0.031651028,0.0048995367,0.9483719,0.012487018,0.000050150702],"about_ca_topic_score_codex":0.00086051604,"about_ca_topic_score_gemma":0.0014627869,"teacher_disagreement_score":0.008743346,"about_ca_system_score_codex":0.0012712169,"about_ca_system_score_gemma":0.0005410608,"threshold_uncertainty_score":0.02924943},"labels":[],"label_agreement":null},{"id":"W156100500","doi":"","title":"Some Results on Fractional Edge Coloring of Graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Edge coloring; Enhanced Data Rates for GSM Evolution; Graph coloring; Combinatorics; Graph; Computer science; Artificial intelligence; Line graph","score_opus":0.01790362477311514,"score_gpt":0.24964450090771292,"score_spread":0.2317408761345978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W156100500","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0955442,0.02705873,0.31508657,0.014288324,0.003191187,0.00015709334,0.0029505298,0.0013145239,0.5404088],"genre_scores_gemma":[0.70940703,0.029188925,0.1531216,0.007399885,0.0056797867,0.00040676375,0.0051071965,0.0010319786,0.088656865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895656,0.0002504163,0.000058778955,0.00021817048,0.00027595964,0.00024012354],"domain_scores_gemma":[0.9947748,0.0035298546,0.00028872187,0.0006595573,0.00034520103,0.0004017222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016346409,0.0013739545,0.0012068133,0.0036478823,0.0028971944,0.004491541,0.001984704,0.0018080453,0.017250473],"category_scores_gemma":[0.0070643937,0.00084431045,0.0014061681,0.0063386876,0.0028941252,0.007493475,0.0023401247,0.0046615615,0.0025531398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105893116,0.00012218994,0.0007145976,0.00044404558,0.000035277026,0.00015535131,0.00029134372,0.0051471964,0.0012112419,0.92486095,0.02973368,0.03717826],"study_design_scores_gemma":[0.000020018793,0.000018273024,0.0004660712,0.000070593414,0.00003290497,0.00022000828,0.00012399057,0.006761394,0.0006851724,0.96516466,0.0264196,0.000017316497],"about_ca_topic_score_codex":0.0036031336,"about_ca_topic_score_gemma":0.0042689275,"teacher_disagreement_score":0.017250473,"about_ca_system_score_codex":0.0031872387,"about_ca_system_score_gemma":0.0010638771,"threshold_uncertainty_score":0.05770862},"labels":[],"label_agreement":null},{"id":"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02129356,0.44172218,0.3958626,0.0044972566,0.0015249356,0.00024835678,0.0010457077,0.0013937206,0.13241175],"genre_scores_gemma":[0.13263549,0.6062301,0.22463483,0.0022227934,0.0035991867,0.00025443145,0.0026813578,0.0009811802,0.026760649],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99851686,0.0003187264,0.00011175979,0.0004197306,0.0004654607,0.00016744157],"domain_scores_gemma":[0.9973648,0.0017990698,0.00013567405,0.00034165653,0.00024136192,0.00011743413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011957063,0.001683025,0.0018386994,0.004682507,0.0018265924,0.0035769884,0.0025540944,0.0020876871,0.0072353566],"category_scores_gemma":[0.0032601724,0.0015629445,0.0017224122,0.009536172,0.0025360424,0.010024221,0.00238023,0.0026189338,0.0033943194],"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.00012170099,0.0002841277,0.0023924522,0.004861125,0.000101066435,0.00023619492,0.00072340947,0.021464912,0.0022008985,0.29144883,0.035454884,0.6407104],"study_design_scores_gemma":[0.00003479565,0.0003438517,0.0027104178,0.0015605136,0.00013196973,0.002635525,0.00070519274,0.027803311,0.0029907601,0.3973708,0.5635727,0.00014010014],"about_ca_topic_score_codex":0.0034467212,"about_ca_topic_score_gemma":0.0024996805,"teacher_disagreement_score":0.0072353566,"about_ca_system_score_codex":0.0018588408,"about_ca_system_score_gemma":0.0012145112,"threshold_uncertainty_score":0.024204671},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077632833,0.0017856397,0.9527441,0.0007174279,0.00038695097,0.00015563304,0.00035276217,0.0010069129,0.03508726],"genre_scores_gemma":[0.21462344,0.0029781046,0.7519735,0.0017654009,0.0011522332,0.0013185423,0.0017447261,0.0017058599,0.022738185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955662,0.00076711556,0.00019166643,0.0011716585,0.0016370312,0.00066622096],"domain_scores_gemma":[0.9891627,0.005862861,0.0006602176,0.0024241973,0.0014611131,0.00042898025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031846156,0.0029729782,0.0012692562,0.0062392247,0.0025691765,0.003523271,0.0038887372,0.0018270818,0.012274778],"category_scores_gemma":[0.014960643,0.0009590737,0.002226625,0.0047599073,0.0034098155,0.0068180594,0.0046412954,0.00802166,0.0041884487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024592996,0.0002314665,0.0025908398,0.0006142848,0.00014145214,0.00019872909,0.00041601117,0.06443014,0.023478018,0.7119265,0.02623058,0.16949606],"study_design_scores_gemma":[0.000047962698,0.00024817867,0.0020498529,0.00023356223,0.00013833948,0.00039196387,0.00014236379,0.41156697,0.022593975,0.4750634,0.087349944,0.00017340493],"about_ca_topic_score_codex":0.005316266,"about_ca_topic_score_gemma":0.0070056356,"teacher_disagreement_score":0.012274778,"about_ca_system_score_codex":0.0043402673,"about_ca_system_score_gemma":0.0022618521,"threshold_uncertainty_score":0.04106319},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6195393,0.0011660019,0.2575498,0.00044231248,0.0002449318,0.000121294215,0.0021158215,0.0012714695,0.117549054],"genre_scores_gemma":[0.9251812,0.0006464369,0.052230626,0.00027196266,0.00028130732,0.00014135486,0.0020337433,0.0003355438,0.018877668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989359,0.000107569496,0.00007699061,0.00036621338,0.00031160394,0.00020168551],"domain_scores_gemma":[0.9975787,0.00063609367,0.0005157275,0.00037653424,0.0004156395,0.00047738542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006059986,0.0005829461,0.0006758348,0.0022038585,0.0010048313,0.0018117635,0.00091948395,0.0005495968,0.0059867627],"category_scores_gemma":[0.0031542222,0.00038108206,0.0007162955,0.0017663857,0.0016598499,0.0034319714,0.0012085019,0.0011579528,0.0013591141],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024839427,0.00008475032,0.0027234298,0.00013165451,0.000031863066,0.00030380342,0.00096049014,0.0038026804,0.0075204303,0.93994725,0.0042174384,0.040027875],"study_design_scores_gemma":[0.000031313844,0.00014348376,0.0027144249,0.00003204604,0.000046243393,0.0008668971,0.00019412203,0.027273394,0.004603748,0.9438693,0.020174587,0.000050353607],"about_ca_topic_score_codex":0.0011583345,"about_ca_topic_score_gemma":0.0011272465,"teacher_disagreement_score":0.0059867627,"about_ca_system_score_codex":0.0010879989,"about_ca_system_score_gemma":0.00036464914,"threshold_uncertainty_score":0.020027697},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11578711,0.004032377,0.4402804,0.0031870194,0.0015011432,0.00015847893,0.001269377,0.0010088758,0.4327752],"genre_scores_gemma":[0.6417189,0.00454665,0.20068917,0.0011643005,0.0008192908,0.00035799813,0.0014728864,0.00088724407,0.1483435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964356,0.00006836207,0.000019155335,0.00008616741,0.00010896904,0.00007374465],"domain_scores_gemma":[0.9993357,0.00026069337,0.000052986157,0.00011948167,0.00012320872,0.00010795742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032270528,0.00059562415,0.00076805725,0.0020353168,0.0016728744,0.0022214074,0.001104466,0.0010699526,0.015737457],"category_scores_gemma":[0.0014976249,0.0007784119,0.0007696625,0.002514766,0.0020145655,0.0042874874,0.0017890783,0.0027172961,0.0021565282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012810982,0.0000047598273,0.000035697925,0.000028441606,0.0000017325085,0.000011730585,0.000076560165,0.00038991,0.00029966197,0.9847534,0.0031131597,0.011272064],"study_design_scores_gemma":[0.0000056313856,0.0000037700725,0.000053123083,0.000016856315,0.0000035906621,0.000029529518,0.00003972805,0.0014078653,0.0002223961,0.9855057,0.01270579,0.000006132085],"about_ca_topic_score_codex":0.0023294662,"about_ca_topic_score_gemma":0.003186902,"teacher_disagreement_score":0.015737457,"about_ca_system_score_codex":0.0011371439,"about_ca_system_score_gemma":0.00060074305,"threshold_uncertainty_score":0.052646995},"labels":[],"label_agreement":null},{"id":"W1583095047","doi":"","title":"Factors of r-partite graphs and bounds for the strong chromatic number","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Chromatic scale; Upper and lower bounds; Graph; Discrete mathematics","score_opus":0.017636136053523592,"score_gpt":0.251702014760716,"score_spread":0.23406587870719242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583095047","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5980101,0.0026460923,0.26500773,0.004011076,0.00026636544,0.00015101796,0.001619251,0.0011338624,0.12715451],"genre_scores_gemma":[0.9386572,0.00091551204,0.04460493,0.0003861655,0.0002275684,0.00014677669,0.00062944967,0.00034235153,0.014090024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999255,0.00017099154,0.00003822691,0.00020971354,0.00015037358,0.00017568085],"domain_scores_gemma":[0.9942115,0.0037546074,0.00045469738,0.00071914465,0.00032580408,0.0005343067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011221007,0.00096413144,0.00048188004,0.0015494308,0.001288804,0.0022148022,0.0011775767,0.0009356907,0.014172952],"category_scores_gemma":[0.0056561767,0.0006537511,0.0009189389,0.0013143546,0.0022896847,0.0047034766,0.0019113972,0.00198208,0.0015225238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005988803,0.00016558061,0.009158994,0.00042877704,0.00007140767,0.00023520605,0.0005172883,0.07398571,0.021853568,0.8435847,0.014674486,0.034725405],"study_design_scores_gemma":[0.000077089586,0.00016676029,0.00426086,0.00011986805,0.00008831657,0.00031556582,0.00024553083,0.23713866,0.014116799,0.7269313,0.016455352,0.000084014195],"about_ca_topic_score_codex":0.0022784784,"about_ca_topic_score_gemma":0.0053934595,"teacher_disagreement_score":0.014172952,"about_ca_system_score_codex":0.0018458798,"about_ca_system_score_gemma":0.00065151154,"threshold_uncertainty_score":0.04741323},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41197705,0.018421331,0.5102054,0.007709044,0.00042931503,0.00018520799,0.003659169,0.0005172126,0.046896204],"genre_scores_gemma":[0.93884087,0.005479979,0.048354868,0.00069615024,0.0007507964,0.00030803133,0.0014048559,0.0001516132,0.004012864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974446,0.0011771427,0.00011564975,0.00049999775,0.00048681264,0.0002757796],"domain_scores_gemma":[0.9838594,0.010952636,0.0015542334,0.0014930319,0.0009094105,0.0012312388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002234725,0.0010737579,0.0015017821,0.0033579923,0.0015605579,0.0036341907,0.0012876224,0.0014722715,0.0027532903],"category_scores_gemma":[0.015118959,0.00053537136,0.0008535144,0.0027209762,0.003530754,0.005892543,0.0024590117,0.0023553562,0.0004149776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078834964,0.00002833626,0.0017374501,0.00016100072,0.000062236024,0.00006013484,0.00020775318,0.014393745,0.0010145538,0.97028995,0.0037782004,0.008187843],"study_design_scores_gemma":[0.000015574033,0.000039487786,0.0013346456,0.00003656453,0.000021465925,0.00016155443,0.00008775867,0.05252695,0.00045070268,0.9394442,0.005848685,0.000032315387],"about_ca_topic_score_codex":0.0011011924,"about_ca_topic_score_gemma":0.00070674194,"teacher_disagreement_score":0.0036341907,"about_ca_system_score_codex":0.0026383996,"about_ca_system_score_gemma":0.0005565136,"threshold_uncertainty_score":0.019143045},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9084492,0.0005858101,0.050270043,0.0024220906,0.00009466341,0.0000542633,0.0010851077,0.00063810934,0.036400706],"genre_scores_gemma":[0.97444826,0.00030034184,0.01953432,0.00028603853,0.00007038567,0.00005643121,0.0006558711,0.00010715843,0.0045411526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992773,0.00011595798,0.000022511358,0.0002717125,0.00012818753,0.00018436731],"domain_scores_gemma":[0.9937344,0.0037496432,0.0006312281,0.0009267357,0.00034234088,0.0006156038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005806396,0.00044752398,0.000578603,0.0011274435,0.0015285092,0.0022160206,0.0008477883,0.0008692805,0.0044550574],"category_scores_gemma":[0.0037538956,0.00057269476,0.00048801358,0.00121051,0.0021154548,0.0026478588,0.0016093433,0.0017395854,0.00045666774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050015294,0.00013425703,0.011210319,0.0002761554,0.000048339076,0.00039632674,0.0005983456,0.036305275,0.025706023,0.8830146,0.012231321,0.029578967],"study_design_scores_gemma":[0.00011931996,0.00007046736,0.0071167843,0.000037308826,0.00006581905,0.0007744194,0.00040766032,0.08671141,0.009119358,0.8807749,0.014751117,0.000051391602],"about_ca_topic_score_codex":0.0020517919,"about_ca_topic_score_gemma":0.004646874,"teacher_disagreement_score":0.0044550574,"about_ca_system_score_codex":0.0027372167,"about_ca_system_score_gemma":0.0010649987,"threshold_uncertainty_score":0.01985991},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8735965,0.00039160383,0.04550542,0.0013587426,0.00011711099,0.00007104143,0.0006135238,0.00044087964,0.077905096],"genre_scores_gemma":[0.9715604,0.000112455375,0.013944,0.00009981092,0.000045853267,0.00002589845,0.00027268202,0.00005623592,0.013882658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957806,0.000082320235,0.000013536849,0.00012387751,0.00006251065,0.00013957759],"domain_scores_gemma":[0.9991666,0.00033451561,0.00014521144,0.00011712785,0.00007509283,0.00016151115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000373301,0.00029606352,0.00036504827,0.00067620684,0.0012220994,0.0015885592,0.00070691167,0.0005302542,0.010201617],"category_scores_gemma":[0.001215069,0.00028925572,0.0004282364,0.00051369716,0.0016449601,0.0012810242,0.001191141,0.00095981185,0.0010267294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055811735,0.000094145835,0.0018572462,0.00013402992,0.000033927456,0.000327885,0.00057152164,0.014640682,0.018465007,0.9420765,0.004685706,0.016555289],"study_design_scores_gemma":[0.0004407779,0.00030680507,0.004656979,0.000052658073,0.00009628865,0.00073098426,0.0008027985,0.09067528,0.019218981,0.8373607,0.04547851,0.00017922749],"about_ca_topic_score_codex":0.0032904057,"about_ca_topic_score_gemma":0.0043073627,"teacher_disagreement_score":0.010201617,"about_ca_system_score_codex":0.001695532,"about_ca_system_score_gemma":0.0007001157,"threshold_uncertainty_score":0.03412777},"labels":[],"label_agreement":null},{"id":"W162524908","doi":"","title":"Disproof of a Conjecture on List Coloring.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Conjecture; Mathematics; Combinatorics; List coloring","score_opus":0.016127839007170474,"score_gpt":0.22193553136565952,"score_spread":0.20580769235848906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W162524908","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29481983,0.0039176624,0.17696255,0.14415781,0.006813078,0.0003517879,0.009930376,0.0045135194,0.3585333],"genre_scores_gemma":[0.88073575,0.0016444165,0.052623965,0.016662823,0.0022701705,0.00023870044,0.008075991,0.0008089568,0.036939263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99519676,0.0014553432,0.00023721965,0.0011545104,0.0010923411,0.0008638131],"domain_scores_gemma":[0.9480908,0.038432863,0.0013056484,0.0071386294,0.0032093334,0.0018227086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032253268,0.00094552856,0.0016426085,0.0014538538,0.0055385935,0.005467016,0.003206911,0.004961607,0.015525978],"category_scores_gemma":[0.03443691,0.0013062404,0.0018645595,0.002303163,0.006159238,0.011418921,0.005729437,0.009158395,0.0039605373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000844145,0.00026881704,0.004662598,0.00047404948,0.000105735504,0.0005827092,0.0009874449,0.0071090916,0.0029237613,0.7621831,0.1892542,0.030604286],"study_design_scores_gemma":[0.00019656816,0.00006787257,0.0013842682,0.0001239715,0.000082042905,0.0007019627,0.0006871465,0.014247671,0.0034688537,0.93031555,0.048664723,0.000059320504],"about_ca_topic_score_codex":0.005679694,"about_ca_topic_score_gemma":0.0056856647,"teacher_disagreement_score":0.015525978,"about_ca_system_score_codex":0.0033084736,"about_ca_system_score_gemma":0.0024038178,"threshold_uncertainty_score":0.051939547},"labels":[],"label_agreement":null},{"id":"W1627871800","doi":"","title":"No-hole 2-distant colorings for unit interval graphs","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Interval (graph theory); Unit (ring theory); Combinatorics; Unit interval; Discrete mathematics; Mathematics education","score_opus":0.02113733466330601,"score_gpt":0.24881090134930903,"score_spread":0.22767356668600303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1627871800","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5790886,0.0012374795,0.3078882,0.003413024,0.0005010043,0.00016984684,0.001459133,0.0011838109,0.10505896],"genre_scores_gemma":[0.89190155,0.0006955127,0.08385861,0.00090902654,0.00023720339,0.00018087108,0.0014008193,0.00043871964,0.020377666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878484,0.00034539777,0.00006995853,0.00032883772,0.00018560293,0.0002852965],"domain_scores_gemma":[0.9929645,0.0040020566,0.00076519547,0.0011215967,0.0002594076,0.0008873164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001165596,0.0010177919,0.0015304434,0.0014335008,0.0032435362,0.0044654645,0.0030164546,0.0019764258,0.013830493],"category_scores_gemma":[0.006721658,0.001279681,0.0012728556,0.002037375,0.0025037762,0.006964809,0.0030846596,0.0042564035,0.0012349454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005151509,0.00019840646,0.0013450586,0.0002551487,0.00003478177,0.00015994352,0.0006009588,0.013692272,0.0030336392,0.94533426,0.010550179,0.024280122],"study_design_scores_gemma":[0.000086878514,0.000046324556,0.00054997974,0.000034214703,0.00003388314,0.00015411698,0.0002627658,0.025000814,0.0013185234,0.9684304,0.004053135,0.000029008082],"about_ca_topic_score_codex":0.0011997272,"about_ca_topic_score_gemma":0.0021463477,"teacher_disagreement_score":0.013830493,"about_ca_system_score_codex":0.0017124809,"about_ca_system_score_gemma":0.00068007654,"threshold_uncertainty_score":0.04626757},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38809583,0.0018393806,0.5875184,0.0017726193,0.00017520295,0.0001353409,0.00056024396,0.00031581768,0.019587215],"genre_scores_gemma":[0.78670573,0.0016108741,0.1960831,0.00040450835,0.00030469318,0.00017415234,0.0010255688,0.00033424227,0.013357119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985014,0.0006816467,0.000055192664,0.00030652873,0.00024107005,0.00021415627],"domain_scores_gemma":[0.990725,0.0059744706,0.0007072623,0.0010099226,0.0007797333,0.0008036685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002440781,0.0011673616,0.0016639354,0.0024607622,0.001525248,0.0024658944,0.0026999011,0.0014837555,0.0039811223],"category_scores_gemma":[0.014834206,0.00076429895,0.000705496,0.004914454,0.0017998421,0.005957219,0.0023200756,0.001753519,0.00033246953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026173293,0.00021747498,0.0039482974,0.00027199727,0.00008162028,0.00008920331,0.00044936172,0.09867097,0.0026276822,0.7931079,0.008900868,0.09137301],"study_design_scores_gemma":[0.000027951788,0.00003330468,0.00083415257,0.000032457592,0.000050676987,0.000054949473,0.00014536637,0.28848568,0.0006839385,0.7067722,0.0028585368,0.000020856169],"about_ca_topic_score_codex":0.0053969137,"about_ca_topic_score_gemma":0.004674034,"teacher_disagreement_score":0.0053969137,"about_ca_system_score_codex":0.0025052035,"about_ca_system_score_gemma":0.0011900307,"threshold_uncertainty_score":0.018176556},"labels":[],"label_agreement":null},{"id":"W164845282","doi":"","title":"Circulant Distant Two Labeling and Circular Chromatic Number","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Circulant matrix; Chromatic scale; Graph; Function (biology); Discrete mathematics","score_opus":0.0105874983956545,"score_gpt":0.23182612799275454,"score_spread":0.22123862959710003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W164845282","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8137233,0.00083352387,0.11700976,0.0016949414,0.00014716142,0.00007999509,0.00084153266,0.0004501542,0.065219514],"genre_scores_gemma":[0.9494273,0.00039487134,0.03967136,0.00025528992,0.000067227964,0.00008219162,0.00063746143,0.00007119417,0.009393034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953496,0.00009662826,0.000021762238,0.00013992516,0.000081597,0.00012501908],"domain_scores_gemma":[0.9971589,0.0013501577,0.0004835264,0.00034697543,0.00025878145,0.0004016454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046691706,0.00036245026,0.00029317572,0.0011206927,0.0013872525,0.0014007738,0.00064907805,0.00069394923,0.0056271986],"category_scores_gemma":[0.0026552773,0.0002209242,0.00022901292,0.0014461261,0.0017040329,0.002047021,0.0009868621,0.00077912473,0.000562723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051611505,0.00009894271,0.004324371,0.00019434272,0.00002052626,0.00016057996,0.00047894305,0.017426902,0.014074315,0.90735227,0.008432621,0.046919953],"study_design_scores_gemma":[0.000110326604,0.00017458445,0.0035161863,0.00006027036,0.000037437065,0.00082344195,0.00043895651,0.08987423,0.012352196,0.86137754,0.0311662,0.000068593625],"about_ca_topic_score_codex":0.001468226,"about_ca_topic_score_gemma":0.0020361315,"teacher_disagreement_score":0.0056271986,"about_ca_system_score_codex":0.0018146088,"about_ca_system_score_gemma":0.0007392464,"threshold_uncertainty_score":0.018824816},"labels":[],"label_agreement":null},{"id":"W165581539","doi":"","title":"On the edge-residual number and the line completion number of a graph.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Residual; Combinatorics; Enhanced Data Rates for GSM Evolution; Graph; Edge contraction; Line graph; Algorithm; Voltage graph; Computer science; Artificial intelligence","score_opus":0.01814577112471864,"score_gpt":0.23225060729119126,"score_spread":0.21410483616647263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W165581539","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5171743,0.006774743,0.21947919,0.013132149,0.0009674912,0.0001293512,0.0029066077,0.00088050845,0.23855561],"genre_scores_gemma":[0.92295337,0.002967257,0.042132616,0.0007294733,0.0011284978,0.00016037091,0.0015511082,0.00033490406,0.028042294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986926,0.0004503357,0.00005935221,0.00029927716,0.00021806436,0.00028032053],"domain_scores_gemma":[0.98987156,0.0067752637,0.0009680999,0.0008508188,0.0005271905,0.0010070372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020250722,0.0007891264,0.0011076971,0.0030224705,0.0018634693,0.0033744453,0.002097584,0.0018945914,0.01442827],"category_scores_gemma":[0.011365352,0.00057646364,0.00059041183,0.0025102512,0.0046306523,0.011618633,0.0021895575,0.003394413,0.0024092922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018109799,0.000070668306,0.0012320578,0.00013474292,0.000019681702,0.000059770082,0.00020069133,0.0064520002,0.0009768791,0.9632161,0.012104316,0.01535189],"study_design_scores_gemma":[0.000034431334,0.0000390733,0.0012232985,0.000051090537,0.00002147486,0.00018942489,0.00023166608,0.018602844,0.0008422928,0.9711884,0.0075446353,0.000031420244],"about_ca_topic_score_codex":0.0016515306,"about_ca_topic_score_gemma":0.0016778295,"teacher_disagreement_score":0.01442827,"about_ca_system_score_codex":0.0017672781,"about_ca_system_score_gemma":0.00067266944,"threshold_uncertainty_score":0.048267305},"labels":[],"label_agreement":null},{"id":"W168336619","doi":"","title":"On a Prime Labeling Conjecture.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Prime (order theory); Conjecture; Mathematics; Arithmetic; Combinatorics","score_opus":0.00712472240400353,"score_gpt":0.2099430421946723,"score_spread":0.20281831979066878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W168336619","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11525387,0.0061898204,0.19121602,0.102217235,0.0046643233,0.00012972872,0.0024914285,0.0020077082,0.57582986],"genre_scores_gemma":[0.7965333,0.0059709484,0.06418451,0.023407562,0.005944988,0.0003530503,0.004316739,0.0010014721,0.09828743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982267,0.0005626724,0.000057128655,0.0005016027,0.00036846765,0.0002834739],"domain_scores_gemma":[0.98641926,0.009667406,0.00044623512,0.0019971817,0.00071427616,0.00075564935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025549254,0.0008452555,0.0011763228,0.0012824244,0.003910109,0.0050799334,0.0018875289,0.003500209,0.028538004],"category_scores_gemma":[0.01263595,0.0007481485,0.0011045518,0.0024554352,0.0055685197,0.019478837,0.0052032727,0.006911931,0.005334644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071471244,0.000043775577,0.00041980555,0.00007346435,0.0000075944135,0.00006235076,0.00019162026,0.0006195307,0.00021175604,0.9534469,0.03501773,0.009833964],"study_design_scores_gemma":[0.00002197779,0.000008325782,0.00017554396,0.00002475008,0.0000074773166,0.00008208816,0.00007769417,0.0012846285,0.00017325938,0.9853851,0.012752425,0.0000066670123],"about_ca_topic_score_codex":0.0017836415,"about_ca_topic_score_gemma":0.001772794,"teacher_disagreement_score":0.028538004,"about_ca_system_score_codex":0.002120852,"about_ca_system_score_gemma":0.0011382092,"threshold_uncertainty_score":0.09546918},"labels":[],"label_agreement":null},{"id":"W169464880","doi":"","title":"On the Constructions of New Families of Harmonious Graphs","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.01088924025084195,"score_gpt":0.2068556504035095,"score_spread":0.19596641015266755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W169464880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33241203,0.0018263657,0.4990279,0.0032884208,0.0003348524,0.00016948032,0.0005043531,0.0011293921,0.16130728],"genre_scores_gemma":[0.8209191,0.0012806539,0.14482877,0.00084801426,0.00021707994,0.00033838002,0.00054984505,0.0004868213,0.030531367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861133,0.00061979255,0.00006174583,0.0002504558,0.0002476666,0.00020899264],"domain_scores_gemma":[0.9961688,0.0022071865,0.00025842662,0.0007790187,0.00024320919,0.00034338477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020721378,0.00053915265,0.00077318924,0.0023149455,0.0030460244,0.0028460557,0.0021081064,0.0014365318,0.0100090485],"category_scores_gemma":[0.004937093,0.0009533128,0.0012040747,0.0018271263,0.003489267,0.0074325716,0.0049275444,0.0027301332,0.001017856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017478873,0.000014938585,0.00015491089,0.000027075936,0.000005339292,0.00004103066,0.00024472867,0.0010804806,0.00041925977,0.99073505,0.001361197,0.0058986642],"study_design_scores_gemma":[0.000017472135,0.000014695317,0.00021345713,0.00002525977,0.0000120451605,0.0001585415,0.00024350987,0.008452322,0.00068892515,0.9792317,0.010924087,0.000017956892],"about_ca_topic_score_codex":0.00051781954,"about_ca_topic_score_gemma":0.00090396724,"teacher_disagreement_score":0.0100090485,"about_ca_system_score_codex":0.0014939678,"about_ca_system_score_gemma":0.00044317983,"threshold_uncertainty_score":0.033483624},"labels":[],"label_agreement":null},{"id":"W170351987","doi":"","title":"On (a, d)-antimagic special trees, unicyclic graphs, complete bipartite graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Complete bipartite graph; Discrete mathematics; Graph","score_opus":0.016626671985419415,"score_gpt":0.23001586720472073,"score_spread":0.2133891952193013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W170351987","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4724579,0.008453138,0.2872024,0.010713329,0.00065091974,0.0002198708,0.0039062446,0.0010574597,0.21533878],"genre_scores_gemma":[0.89442337,0.00542543,0.06792439,0.0015747787,0.00061372726,0.0002523035,0.0024643329,0.00021646704,0.027105195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991653,0.00029769994,0.000044863318,0.00018715864,0.00013535704,0.00016969242],"domain_scores_gemma":[0.99468625,0.0035523188,0.00055840344,0.0004929419,0.00021683423,0.0004932708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008186919,0.0006040864,0.0009383386,0.0021944009,0.0020779357,0.0032019385,0.0012704652,0.0019210093,0.0071132607],"category_scores_gemma":[0.004648967,0.0006321146,0.00062473014,0.00406549,0.002342866,0.0051824013,0.002668321,0.0019688208,0.0011961994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016122666,0.00008253191,0.0011276251,0.00027204186,0.000031619114,0.00015596281,0.0003486096,0.0062512103,0.0018273408,0.94448775,0.018656185,0.026597872],"study_design_scores_gemma":[0.00003107631,0.000018519066,0.00050026807,0.000052313622,0.000021534122,0.0002767831,0.0002105121,0.011403149,0.0005574473,0.9785019,0.008411426,0.000015025142],"about_ca_topic_score_codex":0.0020875481,"about_ca_topic_score_gemma":0.0035169518,"teacher_disagreement_score":0.0071132607,"about_ca_system_score_codex":0.0022893047,"about_ca_system_score_gemma":0.0007517045,"threshold_uncertainty_score":0.0237962},"labels":[],"label_agreement":null},{"id":"W170650356","doi":"","title":"On Super Edge-Magic Graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; MAGIC (telescope); Enhanced Data Rates for GSM Evolution; Combinatorics; Astronomy; Computer science; Physics; Artificial intelligence","score_opus":0.015606070929740546,"score_gpt":0.21197879182458984,"score_spread":0.1963727208948493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W170650356","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2775422,0.005861848,0.36524537,0.008853268,0.0007813364,0.00014736613,0.0024473027,0.0009765214,0.33814478],"genre_scores_gemma":[0.8140297,0.0035464137,0.12307743,0.0020988532,0.0006203968,0.00023111519,0.0025445777,0.0003862273,0.05346533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989706,0.0003472818,0.00004480998,0.0002025924,0.00022759424,0.00020712003],"domain_scores_gemma":[0.99612755,0.0022431768,0.00036426575,0.00059391523,0.0002707747,0.0004003329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010272944,0.0005788096,0.0007692746,0.0020162428,0.0020280888,0.002621658,0.0015799587,0.0014994893,0.014829956],"category_scores_gemma":[0.004453626,0.0005382138,0.0006361536,0.0026058645,0.0024596364,0.008294622,0.002898678,0.0027579947,0.0018354616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047825135,0.000024925332,0.0003619155,0.00009514139,0.000008932862,0.000039200488,0.000109280685,0.0019075109,0.0005551639,0.97267115,0.008775023,0.015403877],"study_design_scores_gemma":[0.000011054833,0.000006715815,0.0002103088,0.000026879608,0.0000068882077,0.00008286888,0.000094541894,0.006228698,0.00039031333,0.9854252,0.007509677,0.000007000212],"about_ca_topic_score_codex":0.0015210666,"about_ca_topic_score_gemma":0.0031766316,"teacher_disagreement_score":0.014829956,"about_ca_system_score_codex":0.0016362095,"about_ca_system_score_gemma":0.0007049382,"threshold_uncertainty_score":0.04961115},"labels":[],"label_agreement":null},{"id":"W170974329","doi":"","title":"Integral Sum Graphs from a Class of Trees.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Class (philosophy); Combinatorics; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.011341590645950864,"score_gpt":0.21981387207467037,"score_spread":0.2084722814287195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W170974329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34145567,0.0027645943,0.3572256,0.0039854487,0.00057443464,0.00012655278,0.0016982636,0.0013036825,0.29086578],"genre_scores_gemma":[0.87096953,0.0014989224,0.07573577,0.00089288276,0.0005840621,0.00011942891,0.0019140888,0.000510078,0.047775302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993381,0.00012879075,0.00003271468,0.0001681758,0.00020647624,0.00012572527],"domain_scores_gemma":[0.9976841,0.0011649205,0.00021854104,0.00040109883,0.00021319433,0.0003180378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005700893,0.00044167816,0.00077278004,0.0018707489,0.002310738,0.004144191,0.001340337,0.0011358935,0.0126691535],"category_scores_gemma":[0.0038138668,0.0004857738,0.0006808216,0.001990023,0.001798114,0.0060534896,0.0031203434,0.0032283051,0.0015607293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026914759,0.000019823001,0.00022021335,0.000041421474,0.000005461936,0.000041055686,0.00010916707,0.00081317755,0.0006711476,0.9844956,0.0031770824,0.010378956],"study_design_scores_gemma":[0.0000064198116,0.0000055693954,0.00020155284,0.000016112923,0.000009608389,0.00017801588,0.000075194876,0.004845709,0.00072354043,0.9848455,0.009086753,0.000006038797],"about_ca_topic_score_codex":0.0006515687,"about_ca_topic_score_gemma":0.0009895726,"teacher_disagreement_score":0.0126691535,"about_ca_system_score_codex":0.0011949064,"about_ca_system_score_gemma":0.00053856306,"threshold_uncertainty_score":0.04238254},"labels":[],"label_agreement":null},{"id":"W172597931","doi":"","title":"On Variations of Graceful Labelings.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic","score_opus":0.01532837856312311,"score_gpt":0.22334579723664702,"score_spread":0.2080174186735239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W172597931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16436256,0.0047791377,0.505286,0.005286304,0.0014313088,0.00017261192,0.0018197042,0.0030227425,0.31383973],"genre_scores_gemma":[0.78505176,0.0029550446,0.13032725,0.0021390151,0.0013350873,0.0002941481,0.0018856087,0.001822707,0.07418935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984982,0.00043787388,0.00007255178,0.00038365382,0.00036902403,0.0002386926],"domain_scores_gemma":[0.9964715,0.0014781373,0.00033618242,0.0010643197,0.00022790278,0.00042190737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013168894,0.0009238291,0.0008423377,0.0020386474,0.002156566,0.0026806174,0.0019473308,0.0013101702,0.013868266],"category_scores_gemma":[0.0062273038,0.0005313293,0.0010418018,0.0027635496,0.003654448,0.0060459143,0.0041080248,0.0040525515,0.0024381774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003995561,0.00001920927,0.00016359365,0.00003722419,0.0000076171727,0.000031225427,0.000104873914,0.0027729087,0.00047640415,0.9773526,0.005686992,0.013307378],"study_design_scores_gemma":[0.000009848278,0.0000122166575,0.00013241563,0.000017710781,0.000008450408,0.000054074593,0.00003375663,0.006694652,0.00033570733,0.9806224,0.012066807,0.000011788813],"about_ca_topic_score_codex":0.0026023681,"about_ca_topic_score_gemma":0.0036240884,"teacher_disagreement_score":0.013868266,"about_ca_system_score_codex":0.0023793958,"about_ca_system_score_gemma":0.0007702289,"threshold_uncertainty_score":0.04639399},"labels":[],"label_agreement":null},{"id":"W173213579","doi":"","title":"T-Colorings and Chromatic Number of Distance Graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chromatic scale; Mathematics; Combinatorics","score_opus":0.0067433125142632,"score_gpt":0.2186780912331773,"score_spread":0.2119347787189141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W173213579","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6751075,0.0044398895,0.15678295,0.007348699,0.00064002053,0.00010944987,0.0026998655,0.00064640405,0.15222523],"genre_scores_gemma":[0.9547364,0.0015449965,0.025413126,0.00041791977,0.00034524166,0.000101086254,0.0010523289,0.00016468178,0.016224273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992092,0.0002237261,0.0000378313,0.00020438523,0.00012878176,0.00019602539],"domain_scores_gemma":[0.99119955,0.0056948187,0.001185638,0.0005945824,0.00046701852,0.00085842126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009334552,0.0006186798,0.00058763626,0.002412625,0.0020236906,0.0036549931,0.0015957078,0.0013897701,0.01195048],"category_scores_gemma":[0.008223157,0.0006359266,0.00057301525,0.002650724,0.0029180106,0.0055202264,0.0015183743,0.0024161153,0.0009906646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028020775,0.00009674814,0.0037010168,0.00015076685,0.000034890498,0.00008472624,0.00029007797,0.015395159,0.0023797872,0.93958527,0.017053755,0.020947607],"study_design_scores_gemma":[0.00004415672,0.000025064734,0.001714696,0.000040589523,0.000022774911,0.00020795643,0.00022876014,0.03783108,0.0012369595,0.95313066,0.005494523,0.000022764272],"about_ca_topic_score_codex":0.003738319,"about_ca_topic_score_gemma":0.0043154275,"teacher_disagreement_score":0.01195048,"about_ca_system_score_codex":0.0028646379,"about_ca_system_score_gemma":0.00085921783,"threshold_uncertainty_score":0.039978385},"labels":[],"label_agreement":null},{"id":"W173602826","doi":"","title":"A Note on the Construction of Magic Squares of Higher Order.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Magic square; Mathematics; MAGIC (telescope); Order (exchange); Combinatorics; Astrophysics; Physics; Business","score_opus":0.015705430546401167,"score_gpt":0.22328099845551158,"score_spread":0.20757556790911041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W173602826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03092747,0.0051514506,0.6494929,0.0072286446,0.003972529,0.0001381788,0.00052126107,0.0021858895,0.30038154],"genre_scores_gemma":[0.26093692,0.004592498,0.66320693,0.0034405927,0.0011417804,0.0002530811,0.0005932176,0.0011571916,0.064677835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991423,0.0002619047,0.000039456037,0.00015498439,0.00029508048,0.000106401436],"domain_scores_gemma":[0.99846715,0.0007578722,0.00006317789,0.00041755583,0.00013912191,0.00015499654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009339966,0.00072034367,0.0007656424,0.0013363819,0.0022680515,0.0020375485,0.0018028558,0.0011249166,0.015730293],"category_scores_gemma":[0.0027704611,0.00070636417,0.0008313939,0.0016676418,0.0034831644,0.004675405,0.0041986736,0.0046400046,0.004021223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039520088,0.00002893249,0.00018858063,0.00013915291,0.000010079606,0.00015595923,0.0002505713,0.0009418704,0.002890377,0.9478227,0.017482057,0.030050196],"study_design_scores_gemma":[0.000014415957,0.000033188066,0.00019294996,0.000038475264,0.000009371342,0.00027598374,0.00011100003,0.002590565,0.0026635097,0.9027082,0.09133267,0.000029698396],"about_ca_topic_score_codex":0.0012315437,"about_ca_topic_score_gemma":0.0038511225,"teacher_disagreement_score":0.015730293,"about_ca_system_score_codex":0.00093342486,"about_ca_system_score_gemma":0.00071419304,"threshold_uncertainty_score":0.052623093},"labels":[],"label_agreement":null},{"id":"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35676438,0.0016433368,0.20869839,0.0023751017,0.0009823852,0.00017601065,0.0020355233,0.001548543,0.4257763],"genre_scores_gemma":[0.8785114,0.0005369438,0.05746043,0.0005818609,0.00018453001,0.0002214398,0.0019105505,0.0005041329,0.060088776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920696,0.00010818054,0.000044173492,0.00022435033,0.00021144535,0.00020487653],"domain_scores_gemma":[0.9983132,0.0006035318,0.00011905179,0.0003323834,0.00030588984,0.0003260198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056178577,0.00041820086,0.0005009799,0.001282367,0.0011605446,0.0022384897,0.0008048099,0.00072223076,0.034611158],"category_scores_gemma":[0.0047223996,0.00041219158,0.0005244124,0.00088121515,0.0014784054,0.0030971635,0.0020374244,0.0014607441,0.004366298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015242399,0.000022877895,0.0010063794,0.000083935236,0.000009413896,0.00010252722,0.00033917997,0.003076578,0.0028061492,0.9508308,0.008701053,0.03286859],"study_design_scores_gemma":[0.000052790594,0.000057974208,0.0013143157,0.000071216724,0.000016475977,0.00032390477,0.00049156393,0.021867063,0.0038138696,0.9281675,0.043802027,0.000021319709],"about_ca_topic_score_codex":0.00081149774,"about_ca_topic_score_gemma":0.0011462327,"teacher_disagreement_score":0.034611158,"about_ca_system_score_codex":0.0012928629,"about_ca_system_score_gemma":0.00047871002,"threshold_uncertainty_score":0.1157859},"labels":[],"label_agreement":null},{"id":"W175207658","doi":"","title":"A Note on the Toughness of Certain Graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Toughness; Composite material; Materials science","score_opus":0.01603784125792736,"score_gpt":0.23731903345967578,"score_spread":0.2212811922017484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W175207658","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14278473,0.011285755,0.23289901,0.047013376,0.0046310197,0.00016260619,0.0021891291,0.0008835814,0.5581508],"genre_scores_gemma":[0.8403975,0.00907023,0.08468757,0.008772885,0.0049971356,0.00026900537,0.0013309964,0.0005635054,0.049911156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982285,0.0005062648,0.000071705894,0.00041895764,0.0004818564,0.00029271562],"domain_scores_gemma":[0.98419535,0.012288328,0.00059622905,0.0011637101,0.0005510916,0.0012053375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017911214,0.0009136883,0.001097747,0.0027570536,0.004139661,0.0041637644,0.0022691037,0.0023743166,0.017723262],"category_scores_gemma":[0.012523178,0.0008910907,0.0013332259,0.0028447732,0.007179896,0.0090103755,0.004465721,0.0072114095,0.0015364044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004540284,0.000022909111,0.00050476094,0.00013213001,0.000014939293,0.00016612801,0.00025848145,0.0013351594,0.00084376265,0.9684713,0.020781735,0.007423313],"study_design_scores_gemma":[0.000010275785,0.000014932896,0.00060424535,0.000040259034,0.000012175212,0.00022033419,0.00016466754,0.003140773,0.00033789987,0.97898966,0.01644554,0.000019284193],"about_ca_topic_score_codex":0.002752424,"about_ca_topic_score_gemma":0.0031310678,"teacher_disagreement_score":0.017723262,"about_ca_system_score_codex":0.0019604892,"about_ca_system_score_gemma":0.0006902615,"threshold_uncertainty_score":0.05929023},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4626566,0.0044036782,0.3599245,0.0020280008,0.00040010136,0.0001367132,0.0018227263,0.0005406504,0.16808715],"genre_scores_gemma":[0.9394772,0.0024228692,0.049589895,0.00026906113,0.00033745152,0.00013367618,0.00093268935,0.00014599095,0.0066912463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988588,0.00014240062,0.00008356958,0.00032389976,0.00029095303,0.00030043547],"domain_scores_gemma":[0.99111336,0.0065119346,0.0005864375,0.0006535461,0.00068537693,0.0004492352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012062013,0.00096752326,0.0007192485,0.0039258767,0.0013000823,0.0020556073,0.0012330613,0.0005960177,0.0053028604],"category_scores_gemma":[0.006111588,0.00044494923,0.0012589942,0.0033259792,0.00289116,0.0039316257,0.001462504,0.0031527607,0.00048266017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031280282,0.00017623295,0.010272659,0.0005882612,0.000076853736,0.0002529947,0.00089268887,0.03162131,0.022306444,0.86978316,0.0051395535,0.058577027],"study_design_scores_gemma":[0.00004484409,0.00014724495,0.011722057,0.00011984066,0.0001545199,0.0005015621,0.00039917146,0.062600695,0.028141035,0.87474036,0.021305215,0.00012344356],"about_ca_topic_score_codex":0.002688874,"about_ca_topic_score_gemma":0.0031816668,"teacher_disagreement_score":0.0053028604,"about_ca_system_score_codex":0.0027123115,"about_ca_system_score_gemma":0.0008958269,"threshold_uncertainty_score":0.019679248},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024950562,0.0005138747,0.9439313,0.0007225568,0.000117382966,0.0006530275,0.0015711375,0.015275819,0.012264244],"genre_scores_gemma":[0.06928812,0.00015657078,0.9172244,0.00023931525,0.000059935664,0.0003222603,0.0038605079,0.00087282964,0.007976064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979873,0.00046931795,0.00011539595,0.0004675732,0.00055944826,0.0004010092],"domain_scores_gemma":[0.99655247,0.0015308809,0.000238513,0.0009976957,0.0004421942,0.00023820385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011672581,0.0022473608,0.0020259155,0.0024336318,0.0016961236,0.002556029,0.0037906363,0.0020690311,0.02257452],"category_scores_gemma":[0.004347801,0.00088349986,0.0014959346,0.0037730574,0.0007665977,0.0046184175,0.0031226522,0.0022183657,0.008358086],"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.0005298455,0.000813649,0.0014387359,0.00036778726,0.000079987076,0.00014428092,0.0002657744,0.04915596,0.008474614,0.01894365,0.062532924,0.85725284],"study_design_scores_gemma":[0.00046508378,0.00031549975,0.0010620806,0.00004648902,0.00007911021,0.0004261443,0.0004257186,0.8466528,0.00869191,0.118288025,0.023475766,0.00007138245],"about_ca_topic_score_codex":0.0054314337,"about_ca_topic_score_gemma":0.013630417,"teacher_disagreement_score":0.02257452,"about_ca_system_score_codex":0.0020952746,"about_ca_system_score_gemma":0.0027360742,"threshold_uncertainty_score":0.075519264},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016032377,0.16141118,0.15470093,0.012536023,0.0059126187,0.00011197602,0.00065526506,0.0004991859,0.64814055],"genre_scores_gemma":[0.44563484,0.18669218,0.13846785,0.006372496,0.010656497,0.00035706462,0.0011026378,0.0012875472,0.20942892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895394,0.00035260958,0.00006405338,0.00024056528,0.0002816597,0.00010720286],"domain_scores_gemma":[0.9974241,0.0016620475,0.00007766359,0.00044834515,0.00030430692,0.00008354192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013007636,0.00063535536,0.0007786946,0.0030067891,0.002591284,0.003738172,0.0015401754,0.0024991836,0.01593099],"category_scores_gemma":[0.0059233545,0.0010563552,0.0006913544,0.0049516098,0.00790997,0.00898463,0.0031800217,0.0043640453,0.0028447732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001607376,0.00000858298,0.0000704249,0.00014838384,0.0000039120227,0.000028160117,0.0002662108,0.00090260006,0.00013513054,0.9379683,0.010499616,0.04995255],"study_design_scores_gemma":[0.000008426265,0.000011489649,0.000118184355,0.00027114086,0.000005826787,0.00016637746,0.00013308202,0.0015676903,0.0004222288,0.7544154,0.24285822,0.000021867307],"about_ca_topic_score_codex":0.002126106,"about_ca_topic_score_gemma":0.0026806744,"teacher_disagreement_score":0.01593099,"about_ca_system_score_codex":0.0029914377,"about_ca_system_score_gemma":0.0010098544,"threshold_uncertainty_score":0.05329442},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6707298,0.0011385535,0.2529429,0.0056960615,0.00017731877,0.0001544167,0.00060828915,0.00029594504,0.0682567],"genre_scores_gemma":[0.9544798,0.00049730507,0.039254546,0.0004222336,0.00014632025,0.00015928008,0.00021177954,0.00013936873,0.0046893866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841,0.00059646403,0.000043643424,0.00037873903,0.0002452908,0.00032576828],"domain_scores_gemma":[0.9890387,0.0075213886,0.00097562897,0.0011783757,0.00045859025,0.00082725927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020288927,0.0006336467,0.00080617314,0.0019186293,0.0030013453,0.0025999818,0.0015618883,0.0015295532,0.0061665513],"category_scores_gemma":[0.00857051,0.00048428235,0.00066718826,0.0015253266,0.008539109,0.008599585,0.0025294202,0.0026519203,0.0004422514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007602891,0.000026725387,0.0004897991,0.000039288756,0.00000927584,0.00003239893,0.00017348854,0.011676588,0.0020074872,0.9823124,0.0007868719,0.0023696346],"study_design_scores_gemma":[0.000032109834,0.000032626904,0.0004925271,0.000023771556,0.000013414417,0.00007071992,0.00013458324,0.057062063,0.0012015229,0.9385074,0.0023991922,0.000030058058],"about_ca_topic_score_codex":0.0027123608,"about_ca_topic_score_gemma":0.0021259412,"teacher_disagreement_score":0.0061665513,"about_ca_system_score_codex":0.0038109336,"about_ca_system_score_gemma":0.0014267648,"threshold_uncertainty_score":0.027650356},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85365075,0.0028941708,0.119633846,0.0010864517,0.00006314193,0.00002739567,0.00094484055,0.00024238293,0.02145703],"genre_scores_gemma":[0.9748917,0.0006656967,0.021855526,0.00014281095,0.000053478467,0.00004459243,0.0005772344,0.00007364287,0.0016953617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991441,0.00020906507,0.000041980707,0.00027660906,0.00015436101,0.00017394978],"domain_scores_gemma":[0.9952266,0.0029609222,0.00050407083,0.00061460864,0.00027212765,0.0004215963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006839937,0.00042876825,0.0005242477,0.0010490692,0.00091323216,0.0018003818,0.0008395116,0.0005091218,0.0030312021],"category_scores_gemma":[0.0033454783,0.0005363735,0.00060255994,0.0012897478,0.0019414482,0.0042978083,0.0019035772,0.0013292846,0.0002739629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071390247,0.00012649017,0.022545522,0.00037733,0.00010808089,0.000369265,0.0012162544,0.034421075,0.02173784,0.85968506,0.009393163,0.049306106],"study_design_scores_gemma":[0.000044952103,0.00011755822,0.009985396,0.000066566245,0.000076914,0.001528523,0.0005069009,0.12070924,0.010404107,0.8408274,0.015676538,0.00005595207],"about_ca_topic_score_codex":0.00086421287,"about_ca_topic_score_gemma":0.0009155837,"teacher_disagreement_score":0.0030312021,"about_ca_system_score_codex":0.00097273756,"about_ca_system_score_gemma":0.00032609177,"threshold_uncertainty_score":0.010140359},"labels":[],"label_agreement":null},{"id":"W181220164","doi":"","title":"On the partition dimension and connected partition dimension of wheels","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Partition (number theory); Dimension (graph theory); Combinatorics","score_opus":0.01299084395861121,"score_gpt":0.22616707608031614,"score_spread":0.21317623212170492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W181220164","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7620004,0.004854739,0.15157671,0.0072991983,0.00041818948,0.000084887935,0.0012251004,0.00033952325,0.07220123],"genre_scores_gemma":[0.9649568,0.001536446,0.021176498,0.00058163924,0.0005219796,0.00012471376,0.0006545246,0.00017298006,0.010274418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828964,0.0006125531,0.0000703021,0.0003319761,0.00029963555,0.000395777],"domain_scores_gemma":[0.98613423,0.009582623,0.0010924757,0.0010538771,0.00059609185,0.0015407332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022610088,0.001114708,0.0021282588,0.004038164,0.0041732616,0.007207201,0.0035910937,0.0033637485,0.0110180015],"category_scores_gemma":[0.012174322,0.0017595381,0.0013818641,0.004502766,0.007724821,0.015929427,0.005024975,0.004900218,0.00069783855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008674494,0.00003122821,0.0008033383,0.00007402472,0.000016534166,0.000026611435,0.00030179005,0.0063126646,0.0003292261,0.9850531,0.0023500589,0.004614623],"study_design_scores_gemma":[0.000023147186,0.000010114475,0.0005723449,0.000033083943,0.000018311,0.000039969047,0.00018173036,0.016331939,0.00021579245,0.9807968,0.0017547768,0.000021910342],"about_ca_topic_score_codex":0.00358696,"about_ca_topic_score_gemma":0.0033896917,"teacher_disagreement_score":0.0110180015,"about_ca_system_score_codex":0.0033299003,"about_ca_system_score_gemma":0.0010667904,"threshold_uncertainty_score":0.036858916},"labels":[],"label_agreement":null},{"id":"W181630308","doi":"","title":"Packing of any set of graphs into a graceful/harmonious/elegant graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chordal graph; Maximal independent set; Indifference graph; Combinatorics; Set (abstract data type); Pathwidth; Split graph; 1-planar graph; Graph; Computer science; Programming language; Line graph","score_opus":0.01321629750535833,"score_gpt":0.2405574321996528,"score_spread":0.22734113469429448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W181630308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3794502,0.0005411803,0.48985225,0.0016290756,0.00033334285,0.00020123087,0.0013510755,0.0022243804,0.12441722],"genre_scores_gemma":[0.76456755,0.00039789107,0.20723046,0.000461519,0.00015875674,0.00016571405,0.0013364318,0.0006133891,0.025068311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931824,0.00015790961,0.000047775175,0.00018552788,0.00015023761,0.00014036657],"domain_scores_gemma":[0.9985038,0.00030323231,0.00022745275,0.00072804245,0.00007510487,0.00016239432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047632243,0.00055350544,0.0005636885,0.000828308,0.0015237805,0.002437565,0.0011343565,0.0008991705,0.010568634],"category_scores_gemma":[0.0018188806,0.00061130594,0.0010015158,0.001039165,0.0015119605,0.0036334638,0.002713549,0.0015181205,0.0018886477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025507982,0.00011080421,0.0010356044,0.00020588866,0.000057568515,0.00025795694,0.0005114674,0.014149462,0.014695029,0.9111344,0.012872841,0.04471393],"study_design_scores_gemma":[0.000041788175,0.00010761635,0.0011049595,0.000049804665,0.000059754937,0.0005437411,0.00037083548,0.043912277,0.0115407,0.9129747,0.029251244,0.000042577358],"about_ca_topic_score_codex":0.0005226775,"about_ca_topic_score_gemma":0.0007687426,"teacher_disagreement_score":0.010568634,"about_ca_system_score_codex":0.0005818118,"about_ca_system_score_gemma":0.00034425207,"threshold_uncertainty_score":0.035355628},"labels":[],"label_agreement":null},{"id":"W182153220","doi":"","title":"List Edge Colorings of Outerplanar Graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; 1-planar graph; Outerplanar graph; Pathwidth; Chordal graph; Graph; Computer science; Telecommunications; Line graph","score_opus":0.013430518336646532,"score_gpt":0.22812099755370047,"score_spread":0.21469047921705392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W182153220","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48892006,0.00321699,0.26842007,0.004723446,0.0005812517,0.00015242955,0.0044285133,0.002265138,0.22729214],"genre_scores_gemma":[0.8620733,0.001691149,0.07445105,0.0008811488,0.00031063132,0.000107805594,0.0041426956,0.0004985066,0.055843674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994068,0.00017374034,0.000032411095,0.00010667959,0.0000979271,0.00018244001],"domain_scores_gemma":[0.9959948,0.0023995733,0.00045195327,0.00050248986,0.0003116179,0.00033948518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048427496,0.00047932233,0.00047340489,0.0013611562,0.0017437994,0.002958014,0.0011325506,0.0010222276,0.013605725],"category_scores_gemma":[0.0040751663,0.0005098658,0.00043773212,0.0019605882,0.001088347,0.0039337347,0.0018356127,0.001528157,0.001997126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033233457,0.000106812025,0.0026047654,0.0002595291,0.000026346741,0.00020426017,0.0005487565,0.010821554,0.004724621,0.87799543,0.037742324,0.06463318],"study_design_scores_gemma":[0.000051418836,0.000044506,0.0014762995,0.00006221306,0.00003366914,0.0003402278,0.00044452152,0.023516063,0.003476274,0.93776655,0.032760426,0.00002781889],"about_ca_topic_score_codex":0.002559463,"about_ca_topic_score_gemma":0.004327138,"teacher_disagreement_score":0.013605725,"about_ca_system_score_codex":0.0015477003,"about_ca_system_score_gemma":0.00054757274,"threshold_uncertainty_score":0.045515656},"labels":[],"label_agreement":null},{"id":"W18227173","doi":"10.1128/iai.01197-07","title":"On the point-distinguishing chromatic index of complete bipartite graphs","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Allergy and Infectious Diseases","keywords":"Mathematics; Bipartite graph; Index (typography); Combinatorics; Edge coloring; Foster graph; Chromatic scale; Point (geometry); Graph; Geometry; Line graph; Computer science; Voltage graph","score_opus":0.013632681695109656,"score_gpt":0.21309405559338734,"score_spread":0.1994613738982777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W18227173","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78808695,0.0005826195,0.15700142,0.0019061955,0.00011245068,0.0002472183,0.0022286598,0.00043724157,0.049397293],"genre_scores_gemma":[0.9691019,0.0005467121,0.020264583,0.00028785673,0.0001403359,0.00018316456,0.0012667949,0.00011163827,0.008096967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999005,0.000302439,0.000030375897,0.00023706132,0.0002088636,0.00021626525],"domain_scores_gemma":[0.99370193,0.0036515184,0.0007948943,0.00044366182,0.0006669601,0.00074108475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010298869,0.0007535819,0.00072879146,0.0026224358,0.0015060432,0.0021258823,0.0014500694,0.0011721735,0.009674089],"category_scores_gemma":[0.007594968,0.00046732652,0.0004913487,0.001962061,0.002222269,0.003090463,0.0016724038,0.001368935,0.00077241636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008656283,0.0001361155,0.0055984836,0.00031852673,0.00012566999,0.00027738238,0.0007543083,0.09982923,0.013398881,0.8295459,0.0104372585,0.038712684],"study_design_scores_gemma":[0.00014518255,0.00017575837,0.0038538289,0.00007174874,0.000050958322,0.00027385878,0.00029118577,0.28289706,0.002605297,0.7027551,0.00681447,0.000065533335],"about_ca_topic_score_codex":0.0035152277,"about_ca_topic_score_gemma":0.003399768,"teacher_disagreement_score":0.009674089,"about_ca_system_score_codex":0.0027084346,"about_ca_system_score_gemma":0.0010901075,"threshold_uncertainty_score":0.032363117},"labels":[],"label_agreement":null},{"id":"W182458970","doi":"","title":"On List (2, 1)-Labeling of Some Planar Graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Planar; Combinatorics; Planar graph; Graph; Computer science; Computer graphics (images)","score_opus":0.011708956099348359,"score_gpt":0.2337384183170683,"score_spread":0.22202946221771994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W182458970","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48845142,0.0024209318,0.25154695,0.010301311,0.0006344012,0.00029384182,0.0059165186,0.0024857705,0.23794888],"genre_scores_gemma":[0.79614645,0.0018844458,0.14162168,0.0023662318,0.00044059614,0.00034278043,0.0062246434,0.00075867993,0.05021454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998961,0.0003078489,0.000054186527,0.00022437662,0.00016269846,0.00028997083],"domain_scores_gemma":[0.99605596,0.0022670159,0.00043721794,0.0005932971,0.00028551265,0.00036092644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082173734,0.00069101085,0.00084686704,0.0016209579,0.0029837082,0.0033846162,0.0014403475,0.0018742363,0.014077526],"category_scores_gemma":[0.004556944,0.0005668622,0.00082389073,0.002632112,0.0018782708,0.0071470644,0.0024934108,0.0024478864,0.0026277557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033939793,0.00013968864,0.0016485933,0.00035676153,0.000034957247,0.00020384988,0.0006418922,0.006700769,0.0038721538,0.90409386,0.035714142,0.046253942],"study_design_scores_gemma":[0.000059988066,0.000042746615,0.0010133574,0.000062508494,0.00004255495,0.00029812605,0.00057326374,0.015264505,0.0028060826,0.9619403,0.01786215,0.000034331628],"about_ca_topic_score_codex":0.0024503854,"about_ca_topic_score_gemma":0.0037763247,"teacher_disagreement_score":0.014077526,"about_ca_system_score_codex":0.0024021273,"about_ca_system_score_gemma":0.0011245362,"threshold_uncertainty_score":0.047093987},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7187424,0.00039192082,0.24166612,0.0007137344,0.00007936079,0.00007044037,0.0003060457,0.00030751145,0.037722494],"genre_scores_gemma":[0.9435165,0.00021852301,0.049923748,0.0001734219,0.0000477094,0.00008909126,0.00030893896,0.000048581674,0.005673459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970216,0.000059236143,0.000017543702,0.00008139604,0.00007310413,0.00006655451],"domain_scores_gemma":[0.99893826,0.0005001354,0.00016326518,0.00017103601,0.0001248487,0.00010248639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032374068,0.00029310668,0.00022688365,0.0009192422,0.0011868661,0.0008666315,0.00041942473,0.000574275,0.003486902],"category_scores_gemma":[0.001220057,0.00023669167,0.0005107448,0.00064836274,0.0011380098,0.001301421,0.0005083537,0.0007415967,0.00025148274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012438548,0.00003003946,0.0017966366,0.000088453366,0.000016587135,0.00034175345,0.00042401312,0.011512234,0.016466407,0.9527532,0.001486577,0.014959778],"study_design_scores_gemma":[0.000022840199,0.00005426697,0.0016122143,0.000020358266,0.000026863994,0.0005848114,0.00022411774,0.04609647,0.011726719,0.929885,0.009719438,0.000026797901],"about_ca_topic_score_codex":0.00090422493,"about_ca_topic_score_gemma":0.0010657285,"teacher_disagreement_score":0.003486902,"about_ca_system_score_codex":0.00074391335,"about_ca_system_score_gemma":0.00043233176,"threshold_uncertainty_score":0.011664867},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8418405,0.00038527744,0.11053363,0.00066281826,0.00014295953,0.00007294308,0.0005422011,0.0004776296,0.045342036],"genre_scores_gemma":[0.96975124,0.0002176578,0.02302141,0.00020565372,0.00007466875,0.00006720627,0.00041944315,0.00012305773,0.006119563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994605,0.0000786148,0.000028703751,0.0001513396,0.000117276664,0.00016361107],"domain_scores_gemma":[0.99858475,0.00052960456,0.00032748978,0.00015165584,0.00010391997,0.00030265853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046748688,0.0006445214,0.0007702509,0.001560144,0.002177358,0.002601798,0.0011911098,0.0008364577,0.0071704932],"category_scores_gemma":[0.0018738508,0.0007341016,0.00078732974,0.0011026216,0.0019385326,0.0029317203,0.002400992,0.0011853481,0.00059669354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026810094,0.000051370225,0.0009956812,0.00006334115,0.000016394362,0.00028386642,0.0006101678,0.0057572904,0.007010842,0.97445107,0.0019185687,0.008573373],"study_design_scores_gemma":[0.000105991385,0.00006165336,0.0010338139,0.000035635065,0.000026714104,0.00030087982,0.00047100658,0.038858127,0.0039703907,0.95083416,0.0042611733,0.00004046192],"about_ca_topic_score_codex":0.0013893064,"about_ca_topic_score_gemma":0.0013987982,"teacher_disagreement_score":0.0071704932,"about_ca_system_score_codex":0.0010928947,"about_ca_system_score_gemma":0.000516804,"threshold_uncertainty_score":0.02398771},"labels":[],"label_agreement":null},{"id":"W18476074","doi":"10.1155/s1064744996000208","title":"Circular Chromatic Number of Hypergraphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chromatic scale; Mathematics; Combinatorics","score_opus":0.008835500954366925,"score_gpt":0.22611436491597733,"score_spread":0.21727886396161042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W18476074","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5040183,0.0049821655,0.15479827,0.010380418,0.0011912835,0.00031054634,0.009997645,0.00083927606,0.31348205],"genre_scores_gemma":[0.8928905,0.0028908523,0.041091714,0.0010264788,0.00058866054,0.00023297312,0.0048656985,0.00022769136,0.05618545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936026,0.00015284719,0.000033560384,0.00016129416,0.00013754443,0.00015435953],"domain_scores_gemma":[0.9962638,0.0019919982,0.00059947657,0.00033919528,0.00035533155,0.00045016664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060887623,0.0005668641,0.0005075127,0.0030079586,0.0020483453,0.002787757,0.00086421124,0.00097236095,0.018245414],"category_scores_gemma":[0.0036911392,0.0003436358,0.0005717106,0.0032866003,0.0021660929,0.0029468942,0.0012670284,0.001466499,0.0019482698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027892413,0.000049052313,0.0024108745,0.00032223287,0.000043736465,0.0002513732,0.00066294306,0.0073381243,0.0027881134,0.932979,0.019083746,0.033791948],"study_design_scores_gemma":[0.000056011562,0.000038683174,0.0024398125,0.000069024034,0.000033312077,0.0005304477,0.0003118954,0.015693344,0.0011156431,0.9437799,0.035900414,0.000031568492],"about_ca_topic_score_codex":0.0030933085,"about_ca_topic_score_gemma":0.0039652428,"teacher_disagreement_score":0.018245414,"about_ca_system_score_codex":0.0023139985,"about_ca_system_score_gemma":0.0007979737,"threshold_uncertainty_score":0.061037064},"labels":[],"label_agreement":null},{"id":"W186889428","doi":"","title":"On the order of close to regular graphs without a matching of given size.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Matching (statistics); Order (exchange); Combinatorics; Statistics; Business","score_opus":0.00906251706821449,"score_gpt":0.2365889048584384,"score_spread":0.2275263877902239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W186889428","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67180234,0.0016666097,0.18783192,0.00624421,0.0004703011,0.00020381458,0.0035216627,0.0014150835,0.12684393],"genre_scores_gemma":[0.8917661,0.0008443388,0.07184214,0.0011266685,0.00036944306,0.00015679574,0.0027366518,0.0006190923,0.030538864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858534,0.00040352702,0.000086112,0.00036472824,0.00024419173,0.00031615436],"domain_scores_gemma":[0.98403335,0.009715987,0.0016492669,0.0021881056,0.0008742758,0.0015388941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012560525,0.0004976336,0.0011130569,0.0018160415,0.0022973905,0.0044836677,0.0014502696,0.0018080951,0.012666749],"category_scores_gemma":[0.01288241,0.0007478608,0.000842768,0.0016223065,0.0024153073,0.009593101,0.0022306927,0.002492345,0.0015232081],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005160345,0.00014306534,0.002659886,0.00021021522,0.000035037705,0.00014235204,0.00049333676,0.007766923,0.0024459984,0.95145786,0.011588872,0.022540497],"study_design_scores_gemma":[0.00006916055,0.000061987674,0.0010412277,0.000051331685,0.000032685653,0.00021915822,0.00039506535,0.019144606,0.0015293459,0.96931535,0.008116244,0.000023787277],"about_ca_topic_score_codex":0.002213853,"about_ca_topic_score_gemma":0.003738607,"teacher_disagreement_score":0.012666749,"about_ca_system_score_codex":0.0022981383,"about_ca_system_score_gemma":0.0010592686,"threshold_uncertainty_score":0.04237455},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51451516,0.0028895417,0.34458464,0.003182899,0.00061807997,0.00033591848,0.0012866522,0.0005209895,0.13206618],"genre_scores_gemma":[0.9204737,0.0015197586,0.048534516,0.0005702914,0.00088083633,0.00033748941,0.0008911208,0.00022003904,0.026572265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889296,0.00033103983,0.000039117724,0.00026844215,0.00025183245,0.00021656131],"domain_scores_gemma":[0.99676657,0.0016299316,0.00053571863,0.00023652629,0.00032920702,0.00050194346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010230961,0.000625482,0.0005644869,0.002024521,0.0016302919,0.0023012825,0.0009209754,0.001077066,0.0059931134],"category_scores_gemma":[0.004045431,0.0005464715,0.0010786934,0.0014147271,0.0032150778,0.0036469072,0.0018659036,0.0017637517,0.0005201738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006109844,0.00003368148,0.00045101784,0.00005413001,0.000011274977,0.00018623943,0.00037349598,0.0048242453,0.0017813732,0.98621494,0.0017235432,0.0042851027],"study_design_scores_gemma":[0.000037818318,0.000040275747,0.001037461,0.000036348476,0.0000127368285,0.00017889623,0.00015682107,0.04754866,0.0005966786,0.94057083,0.009756568,0.000026891088],"about_ca_topic_score_codex":0.004793529,"about_ca_topic_score_gemma":0.0044135903,"teacher_disagreement_score":0.0059931134,"about_ca_system_score_codex":0.0021090533,"about_ca_system_score_gemma":0.00070881774,"threshold_uncertainty_score":0.020049036},"labels":[],"label_agreement":null},{"id":"W187402296","doi":"","title":"Generalized Books And Cm-Snakes Are Prime Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Prime (order theory); Combinatorics","score_opus":0.009880115627131297,"score_gpt":0.2095767959243572,"score_spread":0.19969668029722593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W187402296","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28885862,0.002771571,0.27897894,0.008692999,0.00085127226,0.00016526268,0.0022983016,0.0012773372,0.41610563],"genre_scores_gemma":[0.7869936,0.0016819075,0.08815154,0.0015981427,0.0004961875,0.000179002,0.001766442,0.00040345837,0.11872962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918824,0.00022457387,0.00003472145,0.00028093887,0.00013432548,0.000137131],"domain_scores_gemma":[0.9976689,0.000970925,0.00031348804,0.0005170149,0.000238215,0.00029141738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000592294,0.0005267948,0.00057499716,0.0013432641,0.0024393175,0.0036825358,0.0011537096,0.0013369642,0.021356516],"category_scores_gemma":[0.0032141735,0.0005821624,0.00068456336,0.0024702402,0.0026649588,0.007275075,0.0022866933,0.002412236,0.0027329947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003172007,0.000011184832,0.00022650196,0.000041686173,0.0000047889544,0.00004848643,0.00015182987,0.00034979114,0.00036046404,0.9837489,0.005240854,0.009783807],"study_design_scores_gemma":[0.000010934323,0.000010722097,0.00035728703,0.000023769619,0.000010622456,0.00025696223,0.0002345738,0.0017032983,0.0007731994,0.96212655,0.034481425,0.000010768908],"about_ca_topic_score_codex":0.0009860022,"about_ca_topic_score_gemma":0.0015133626,"teacher_disagreement_score":0.021356516,"about_ca_system_score_codex":0.0013399879,"about_ca_system_score_gemma":0.00054751005,"threshold_uncertainty_score":0.07144469},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45767596,0.0067160665,0.2791085,0.07078787,0.0022548756,0.0003521436,0.0081658475,0.0037126923,0.1712261],"genre_scores_gemma":[0.8380877,0.0026692303,0.09341116,0.010771144,0.004159261,0.000976654,0.0076159774,0.0011587241,0.04115023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9920032,0.0019477075,0.00036361272,0.0028504776,0.0015434799,0.001291579],"domain_scores_gemma":[0.96435857,0.029041935,0.0017988301,0.0023426581,0.0010956584,0.0013623901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038444698,0.0037426066,0.0035630544,0.0021266988,0.0030973062,0.00950766,0.0056086057,0.004695314,0.015631802],"category_scores_gemma":[0.021782946,0.0019307019,0.0045145582,0.0028515905,0.007709635,0.015099751,0.004858079,0.011930324,0.004656197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028290034,0.00068806607,0.004720398,0.0018420743,0.0005331377,0.0005288713,0.0010883288,0.07206119,0.00786613,0.74944884,0.0927461,0.06564784],"study_design_scores_gemma":[0.00037796234,0.00020490415,0.0009877529,0.00014340607,0.00021705379,0.0006362844,0.00015946891,0.094212666,0.0030632282,0.89064276,0.009233703,0.00012079399],"about_ca_topic_score_codex":0.0019336694,"about_ca_topic_score_gemma":0.0015682053,"teacher_disagreement_score":0.015631802,"about_ca_system_score_codex":0.005494288,"about_ca_system_score_gemma":0.002781364,"threshold_uncertainty_score":0.05229354},"labels":[],"label_agreement":null},{"id":"W189412359","doi":"","title":"Pattern avoiding colorings of Euclidean spaces.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Euclidean geometry; Pure mathematics; Combinatorics; Geometry","score_opus":0.02023108454050174,"score_gpt":0.21445814588080261,"score_spread":0.19422706134030088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W189412359","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47059473,0.0019351192,0.3315666,0.003326854,0.0005787108,0.0001004482,0.0018809995,0.0009340777,0.18908247],"genre_scores_gemma":[0.85943365,0.0009307415,0.08942057,0.0006338002,0.00022977467,0.000115444454,0.0016140271,0.0002898735,0.047332156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991335,0.00027451638,0.000052813462,0.00018710879,0.00017577143,0.00017632885],"domain_scores_gemma":[0.997591,0.0011025261,0.0003370406,0.00048537366,0.00021067861,0.00027332254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005397782,0.00048519165,0.00054986245,0.0011317013,0.0015764214,0.0026598854,0.001134391,0.0010072173,0.009960831],"category_scores_gemma":[0.003241688,0.0005067579,0.00058101275,0.0015785431,0.0014368478,0.003341814,0.0020042115,0.0018426864,0.0015583928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007135173,0.000029776977,0.00069292594,0.00006952652,0.0000115740595,0.000070283786,0.0001560979,0.0036219524,0.0012996403,0.9697296,0.0074155084,0.016831698],"study_design_scores_gemma":[0.000020812762,0.000018696515,0.0004084563,0.000021575246,0.00000961748,0.00022449184,0.0001339085,0.011811667,0.0010184215,0.9764227,0.009897788,0.000011722843],"about_ca_topic_score_codex":0.0014727939,"about_ca_topic_score_gemma":0.002411386,"teacher_disagreement_score":0.009960831,"about_ca_system_score_codex":0.0012627767,"about_ca_system_score_gemma":0.0004963734,"threshold_uncertainty_score":0.033322275},"labels":[],"label_agreement":null},{"id":"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23447037,0.00740953,0.19842875,0.0672446,0.008191639,0.00008718903,0.0025766676,0.0014276162,0.48016372],"genre_scores_gemma":[0.8857151,0.0028150636,0.028011858,0.007883954,0.004582447,0.00014897635,0.0013086598,0.00037204986,0.0691619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977718,0.0006142413,0.00011280772,0.0005492174,0.00054575776,0.00040630053],"domain_scores_gemma":[0.996326,0.0017547664,0.00018774519,0.0006860658,0.0007549949,0.0002903321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020268317,0.0007866136,0.0010007165,0.0013902256,0.0026304927,0.0032268907,0.0009856697,0.0014887863,0.013168641],"category_scores_gemma":[0.00871054,0.00049218914,0.0013103781,0.0020726812,0.0054595,0.006734896,0.0044537317,0.004399584,0.00328509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008507476,0.000017845194,0.00041046157,0.000051810563,0.000009491385,0.000047298927,0.0002345994,0.0010681563,0.00028068904,0.9723371,0.01412661,0.011330798],"study_design_scores_gemma":[0.000017117216,0.000023694678,0.00026720297,0.000034919485,0.00000887689,0.000065545515,0.00009431561,0.0014631144,0.0003204464,0.9730647,0.024622954,0.000017081778],"about_ca_topic_score_codex":0.0022409896,"about_ca_topic_score_gemma":0.0010284749,"teacher_disagreement_score":0.013168641,"about_ca_system_score_codex":0.0019597476,"about_ca_system_score_gemma":0.0010975704,"threshold_uncertainty_score":0.044053495},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59085786,0.0010720291,0.33364505,0.002176265,0.00016832772,0.00019791322,0.0024193602,0.000992177,0.06847098],"genre_scores_gemma":[0.9540023,0.00031109375,0.040836386,0.00031379063,0.0000898708,0.00006410856,0.0009599832,0.00007954189,0.0033430234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999134,0.00014809224,0.00006111696,0.0003012416,0.00018530608,0.00017027897],"domain_scores_gemma":[0.9968143,0.0011176557,0.00069606066,0.00050407054,0.00042279618,0.00044508596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005066014,0.00046021925,0.00045414252,0.0014507336,0.0012857958,0.0023400367,0.0007876783,0.00075775204,0.006290838],"category_scores_gemma":[0.0031159043,0.000616774,0.00035744722,0.0015975883,0.0018059467,0.0034701251,0.0016110559,0.0009353814,0.0006478056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038445264,0.00008739035,0.00607332,0.00024538836,0.00003628298,0.00037286867,0.0005228653,0.016104879,0.013956451,0.91430724,0.009247292,0.038661547],"study_design_scores_gemma":[0.000056137644,0.00014047367,0.0040483763,0.000081283644,0.000040216528,0.0010629576,0.0006662583,0.07142125,0.008733663,0.88588893,0.027812654,0.000047823807],"about_ca_topic_score_codex":0.0017742553,"about_ca_topic_score_gemma":0.0011191831,"teacher_disagreement_score":0.006290838,"about_ca_system_score_codex":0.0010652539,"about_ca_system_score_gemma":0.0006926925,"threshold_uncertainty_score":0.02104491},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8939081,0.0006376575,0.058025252,0.0013030785,0.000091892456,0.000056318415,0.0007367869,0.00034660078,0.04489444],"genre_scores_gemma":[0.9864245,0.00018486675,0.010060756,0.000106242784,0.0000541284,0.000044093835,0.0002766717,0.000047291527,0.0028015107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941003,0.00011017964,0.00002210273,0.00020027111,0.000120245495,0.00013714863],"domain_scores_gemma":[0.9956234,0.002608083,0.00063959236,0.0004905913,0.00024550103,0.00039287095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005888826,0.00047756877,0.00033545165,0.0022041218,0.0013200678,0.0019731103,0.0010249052,0.0007214115,0.0035747376],"category_scores_gemma":[0.004974886,0.0004464328,0.00041474326,0.0014968906,0.0025552635,0.0026329185,0.0016942016,0.0015070273,0.00035690583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042805148,0.00011424741,0.011004553,0.00014412013,0.000033574554,0.00023708379,0.0006189524,0.040275905,0.015628368,0.89454496,0.007875017,0.029095192],"study_design_scores_gemma":[0.000062766434,0.0000569985,0.00486991,0.00003407732,0.000030308041,0.0003646556,0.0002587794,0.098188534,0.0055035916,0.8835497,0.0070168786,0.00006376428],"about_ca_topic_score_codex":0.001963951,"about_ca_topic_score_gemma":0.0032943333,"teacher_disagreement_score":0.0035747376,"about_ca_system_score_codex":0.0024691934,"about_ca_system_score_gemma":0.00063221314,"threshold_uncertainty_score":0.017915368},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55111176,0.00043433078,0.35803747,0.00074113335,0.00012627817,0.000101539095,0.0003282106,0.0010698908,0.08804939],"genre_scores_gemma":[0.9595338,0.00017323848,0.026507292,0.0001787283,0.00006790823,0.00006169885,0.00029250685,0.00009181711,0.013092988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962056,0.00004572957,0.00001564821,0.00013290237,0.00009748237,0.000087723136],"domain_scores_gemma":[0.99894863,0.00024654868,0.00018801638,0.0003663136,0.000077181496,0.0001733863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003561788,0.00024557966,0.000338506,0.0006496577,0.0015218201,0.0012204476,0.00076117925,0.000733741,0.0052779783],"category_scores_gemma":[0.0014140146,0.00021614882,0.0005632038,0.00071846746,0.0016416243,0.0024355045,0.0012937364,0.0010679755,0.00061816996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008819973,0.000033486038,0.0010773127,0.000046494482,0.000008484847,0.00030059187,0.00039112088,0.0053248773,0.008006585,0.9624764,0.0014649867,0.020781498],"study_design_scores_gemma":[0.000041482373,0.00010239578,0.0016663495,0.000021755668,0.000019211691,0.0010563122,0.00028164306,0.03604011,0.0066966983,0.9222502,0.031786766,0.000037064645],"about_ca_topic_score_codex":0.0007092272,"about_ca_topic_score_gemma":0.00068956654,"teacher_disagreement_score":0.0052779783,"about_ca_system_score_codex":0.0009287025,"about_ca_system_score_gemma":0.0004101811,"threshold_uncertainty_score":0.017656624},"labels":[],"label_agreement":null},{"id":"W191844323","doi":"","title":"On Super Edge-Magic Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; MAGIC (telescope); Enhanced Data Rates for GSM Evolution; Combinatorics; Astronomy; Computer science; Physics; Artificial intelligence","score_opus":0.007695456690224536,"score_gpt":0.20735049712269898,"score_spread":0.19965504043247445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W191844323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28056163,0.005219379,0.37025878,0.008253675,0.0007351374,0.0001437501,0.0024585277,0.00094631367,0.3314228],"genre_scores_gemma":[0.82025534,0.0029777735,0.12101881,0.0019783683,0.000568298,0.00021731688,0.0024061382,0.0003660236,0.050211936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989723,0.00034774936,0.000045019384,0.00020291006,0.00022879089,0.00020326332],"domain_scores_gemma":[0.9960049,0.0023193487,0.00037078623,0.0006162571,0.0002826852,0.00040599512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010208251,0.00056052697,0.0007497329,0.00199593,0.0019541811,0.0025383679,0.001575644,0.0014566247,0.0149335135],"category_scores_gemma":[0.0045080506,0.00051863334,0.0006386811,0.0025030856,0.0024241358,0.007953872,0.0028076249,0.0026861771,0.0017683172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046092064,0.000024208637,0.00035294122,0.0000905596,0.000008705166,0.00003873583,0.000101832586,0.0018662509,0.0005486448,0.97458535,0.008021193,0.01431558],"study_design_scores_gemma":[0.000010870432,0.0000066133452,0.00021415442,0.000025525876,0.000006644911,0.00008185413,0.00009020748,0.0065458454,0.0003820509,0.98556954,0.007059761,0.000006949437],"about_ca_topic_score_codex":0.0014946786,"about_ca_topic_score_gemma":0.003140175,"teacher_disagreement_score":0.0149335135,"about_ca_system_score_codex":0.0015833774,"about_ca_system_score_gemma":0.0007013431,"threshold_uncertainty_score":0.049957633},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27614433,0.007361852,0.3613296,0.0048672636,0.0012096504,0.00015434489,0.0016510924,0.0011074607,0.34617448],"genre_scores_gemma":[0.8459671,0.0030877988,0.11249046,0.0010705973,0.0006155347,0.00027959072,0.00087017735,0.00029192443,0.0353268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955684,0.00009867175,0.000019188557,0.00009516239,0.00013362554,0.00009659887],"domain_scores_gemma":[0.9985393,0.00080485054,0.00013986311,0.00016372393,0.0001822681,0.00017003421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043171505,0.00058964925,0.00046289913,0.0027624366,0.0010202087,0.0021394682,0.00060688757,0.00092415354,0.00825364],"category_scores_gemma":[0.003578826,0.00024705732,0.0004057886,0.0021426792,0.002212303,0.002364948,0.001364705,0.001972349,0.0014031583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017189182,0.0000068945005,0.00018172986,0.000031083437,0.0000026621208,0.00003612284,0.00009954044,0.0016780879,0.000687806,0.9845718,0.0029152925,0.009771789],"study_design_scores_gemma":[0.0000073567694,0.000008195549,0.00021235924,0.000022872939,0.0000033068955,0.000067465204,0.000044224467,0.006198334,0.0004923758,0.98072135,0.01221192,0.000010245277],"about_ca_topic_score_codex":0.0016734137,"about_ca_topic_score_gemma":0.0015481124,"teacher_disagreement_score":0.00825364,"about_ca_system_score_codex":0.0019518564,"about_ca_system_score_gemma":0.00055322115,"threshold_uncertainty_score":0.027611136},"labels":[],"label_agreement":null},{"id":"W193222370","doi":"","title":"Sizes of Graphs with Fixed Orders and Spans for Circular-Distance-Two Labelings.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.010045241937121783,"score_gpt":0.22113801411941605,"score_spread":0.21109277218229427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W193222370","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8192203,0.00194687,0.085872255,0.005952751,0.00019978303,0.00019164216,0.01306208,0.0019534752,0.07160076],"genre_scores_gemma":[0.95923734,0.00058180233,0.027900662,0.00040302516,0.00016683985,0.00020188719,0.004353957,0.000609328,0.0065452047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979049,0.0006280045,0.00012108319,0.00049684313,0.00035853413,0.0004906376],"domain_scores_gemma":[0.96374035,0.027092557,0.0028279242,0.0029854751,0.0011382692,0.00221533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025314568,0.0007956534,0.0010875921,0.002355567,0.002003259,0.005452103,0.0033818365,0.0022497056,0.0141364755],"category_scores_gemma":[0.021441745,0.0009574728,0.0009131173,0.0023956378,0.002951156,0.0077291685,0.0020496782,0.0020268934,0.0014435257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021818154,0.0002339868,0.006699715,0.00061530893,0.00010720422,0.00032992297,0.0012272642,0.060480114,0.0072444123,0.8501608,0.040245097,0.030474432],"study_design_scores_gemma":[0.00025911495,0.00009909667,0.0028686866,0.00011298711,0.000106367945,0.000546003,0.00061717205,0.075835265,0.0059916116,0.9032844,0.010205681,0.00007366003],"about_ca_topic_score_codex":0.002441197,"about_ca_topic_score_gemma":0.003206457,"teacher_disagreement_score":0.0141364755,"about_ca_system_score_codex":0.003412414,"about_ca_system_score_gemma":0.0015982206,"threshold_uncertainty_score":0.04729116},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9614606,0.00012181313,0.024700249,0.0004823299,0.000012731227,0.000018112676,0.00044333385,0.00021103803,0.012549834],"genre_scores_gemma":[0.9915615,0.00005133762,0.0068218033,0.000038681737,0.000014362411,0.00001585858,0.00027702615,0.000019659903,0.0011997496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991881,0.00015773403,0.000051697865,0.000269011,0.00017227035,0.00016119855],"domain_scores_gemma":[0.9940706,0.0037264684,0.0006293851,0.0009015582,0.00020521991,0.00046678534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009983225,0.00028488928,0.000422906,0.0013193821,0.001152566,0.0018158875,0.0008601631,0.000600417,0.0033931325],"category_scores_gemma":[0.0041082376,0.0003127935,0.00050809595,0.00077793736,0.0024634735,0.0031208433,0.0016975768,0.0009157499,0.0002539091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042716358,0.00008133666,0.01416825,0.000114816015,0.000036757472,0.00026238573,0.0007359,0.01636761,0.011278356,0.9337434,0.0019952166,0.020788811],"study_design_scores_gemma":[0.000056399564,0.00007064031,0.0045719496,0.000015976795,0.000053321695,0.00034822445,0.00019421057,0.05007834,0.014316047,0.9260275,0.0042265034,0.000040841973],"about_ca_topic_score_codex":0.00072623487,"about_ca_topic_score_gemma":0.00087542355,"teacher_disagreement_score":0.0033931325,"about_ca_system_score_codex":0.0017181326,"about_ca_system_score_gemma":0.0005367156,"threshold_uncertainty_score":0.012466013},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67566097,0.0004834474,0.29949912,0.00064533093,0.00006272521,0.00008301439,0.0007429683,0.00034315733,0.022479214],"genre_scores_gemma":[0.84662145,0.0005490631,0.1424273,0.00019116241,0.00010858969,0.00014229998,0.0014887567,0.0001390979,0.0083322385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989366,0.0002426086,0.00010341343,0.0002409119,0.00029062628,0.00018581109],"domain_scores_gemma":[0.9921239,0.0052674063,0.0007455677,0.00096232956,0.00044130353,0.0004595115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009096568,0.00041136175,0.0006762149,0.0019304621,0.0012512327,0.0019869371,0.0012495262,0.0009202785,0.0066161077],"category_scores_gemma":[0.005030399,0.0005970698,0.0008700171,0.0018365469,0.0014582903,0.0046274774,0.0016091818,0.0019357216,0.00051344675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035385962,0.00012211695,0.007700624,0.00037068786,0.000060462535,0.00029742377,0.00063214154,0.018909106,0.015607473,0.899581,0.0034421817,0.05292296],"study_design_scores_gemma":[0.000033058233,0.00008259071,0.0020104293,0.000041737152,0.000060385188,0.0005905203,0.00024048531,0.06653503,0.007372327,0.91823196,0.0047597983,0.00004162823],"about_ca_topic_score_codex":0.00055028003,"about_ca_topic_score_gemma":0.0012497111,"teacher_disagreement_score":0.0066161077,"about_ca_system_score_codex":0.00096126465,"about_ca_system_score_gemma":0.00055356347,"threshold_uncertainty_score":0.022133112},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9267549,0.0006011929,0.060214326,0.00045769595,0.00003123411,0.000050438994,0.00089898147,0.0001735431,0.010817644],"genre_scores_gemma":[0.9779213,0.00043808078,0.01872002,0.00012886751,0.00006567856,0.000069960755,0.0011709001,0.000050759045,0.0014344314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996352,0.000057923997,0.000020125364,0.00009121122,0.00010672636,0.00008874529],"domain_scores_gemma":[0.9972256,0.0012771436,0.0006258474,0.00035659707,0.00023565468,0.00027908594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031020952,0.00049341563,0.00053143874,0.0015965392,0.0007072503,0.0011870645,0.000622536,0.0006090991,0.0024284036],"category_scores_gemma":[0.0022013288,0.00035860259,0.00045386248,0.0011540024,0.0009049562,0.0021853351,0.0011446074,0.00082686805,0.00032863847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087325653,0.00019070703,0.035118,0.00071736146,0.00018610657,0.0013831797,0.0021620914,0.06283174,0.13437368,0.646509,0.010504233,0.10515069],"study_design_scores_gemma":[0.00006746352,0.00025284698,0.023961747,0.00013708536,0.00012721574,0.0036805568,0.0009989454,0.14589357,0.03497503,0.7694811,0.020327192,0.00009729359],"about_ca_topic_score_codex":0.0002837976,"about_ca_topic_score_gemma":0.00035107695,"teacher_disagreement_score":0.0024284036,"about_ca_system_score_codex":0.00049046986,"about_ca_system_score_gemma":0.00023284506,"threshold_uncertainty_score":0.008123875},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35206214,0.0013032935,0.56549716,0.0069637736,0.00041582156,0.00021416074,0.0039889133,0.0015581544,0.067996584],"genre_scores_gemma":[0.63121456,0.0009616957,0.3171532,0.0024577547,0.0005359845,0.0004898585,0.0064591714,0.0011462461,0.0395816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974111,0.0011254642,0.00013010675,0.00069116015,0.00027702528,0.00036523424],"domain_scores_gemma":[0.98612636,0.008855218,0.0013597468,0.0018220558,0.00079047796,0.001046194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017273288,0.00091004954,0.0016460025,0.0019745014,0.0028343443,0.005341665,0.0024697785,0.0035110146,0.010299644],"category_scores_gemma":[0.008545183,0.0012492929,0.0015270676,0.002935651,0.0029998173,0.0059869443,0.0029722264,0.004147998,0.0018439806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040572573,0.00015935201,0.001779187,0.0005718328,0.000036438265,0.0001567783,0.0008537483,0.019711463,0.0052708425,0.9049143,0.017671322,0.048469085],"study_design_scores_gemma":[0.000043049058,0.000024743546,0.0006757253,0.000047981663,0.000015505791,0.0001115903,0.00016126173,0.028340844,0.0014284933,0.9637685,0.005360118,0.000022216254],"about_ca_topic_score_codex":0.0027162586,"about_ca_topic_score_gemma":0.003387598,"teacher_disagreement_score":0.010299644,"about_ca_system_score_codex":0.0036532779,"about_ca_system_score_gemma":0.0013209179,"threshold_uncertainty_score":0.034455776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8708398,0.0037622103,0.08865102,0.0030895756,0.00016297486,0.000065529995,0.0013842126,0.0002589795,0.031785622],"genre_scores_gemma":[0.9727077,0.002191843,0.019539095,0.00028362378,0.0003051557,0.00011366507,0.00077621406,0.00013038404,0.0039522466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882597,0.00037064086,0.000092344744,0.000317623,0.000179533,0.00021379198],"domain_scores_gemma":[0.97425634,0.019403009,0.0029149423,0.0010213637,0.0006385892,0.0017659116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017636031,0.00082969,0.0016719063,0.0032315305,0.0024627482,0.005211926,0.002092676,0.0018725708,0.0044142],"category_scores_gemma":[0.014416761,0.0016819432,0.0009144847,0.0034852785,0.0036887184,0.009162391,0.0025638663,0.0023083033,0.00042819008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005104792,0.00011447301,0.0083230715,0.00026523034,0.000052498457,0.0002002209,0.0016562968,0.02175423,0.0033583634,0.9416834,0.005166508,0.016915152],"study_design_scores_gemma":[0.00006429932,0.00003902511,0.002463434,0.000063062274,0.00006202475,0.00034918071,0.00057375425,0.03618379,0.0014123705,0.95380723,0.004948456,0.00003340026],"about_ca_topic_score_codex":0.0012578586,"about_ca_topic_score_gemma":0.0016015886,"teacher_disagreement_score":0.005211926,"about_ca_system_score_codex":0.0024855803,"about_ca_system_score_gemma":0.0006685013,"threshold_uncertainty_score":0.01803416},"labels":[],"label_agreement":null},{"id":"W196764120","doi":"","title":"Numbers of Vertices and Edges of Magic Graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; MAGIC (telescope); Combinatorics; Physics; Astronomy","score_opus":0.00883440746568456,"score_gpt":0.21347094964171362,"score_spread":0.20463654217602906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W196764120","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36711356,0.0029051788,0.26617008,0.005251727,0.001386797,0.0001591918,0.0066301553,0.0010205123,0.34936273],"genre_scores_gemma":[0.84623337,0.0010572887,0.11352176,0.0005315292,0.00035625778,0.0001854095,0.0021149032,0.00019329503,0.035806168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989312,0.0002807134,0.00009496842,0.0002599487,0.00023962812,0.00019348797],"domain_scores_gemma":[0.99718505,0.0013830928,0.0004237682,0.00038815459,0.00030872982,0.00031114768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000742533,0.0005681371,0.00051562116,0.0025758813,0.0017056307,0.0028473916,0.0013345636,0.0011589692,0.01145825],"category_scores_gemma":[0.0049850456,0.00047167993,0.00045448635,0.0020345943,0.002303986,0.0043824487,0.001569283,0.0015760837,0.0019256842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011664204,0.000021805872,0.0008400646,0.000088815235,0.000011373707,0.000043158583,0.00013219129,0.0015813834,0.0018580874,0.9651918,0.007060328,0.023054319],"study_design_scores_gemma":[0.000021321704,0.000017092749,0.0006715682,0.000047631696,0.000017645189,0.00018799109,0.0001392109,0.0052817897,0.0020262604,0.97210294,0.019466193,0.000020505782],"about_ca_topic_score_codex":0.0009359818,"about_ca_topic_score_gemma":0.0016519001,"teacher_disagreement_score":0.01145825,"about_ca_system_score_codex":0.0011007037,"about_ca_system_score_gemma":0.00060528517,"threshold_uncertainty_score":0.038331687},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58980584,0.0032586148,0.36884242,0.0042071296,0.00010622225,0.00013772922,0.0012083927,0.0009881622,0.031445455],"genre_scores_gemma":[0.9429568,0.0015361976,0.050942853,0.00038569077,0.00020507241,0.00028135808,0.00071244146,0.00026079605,0.0027188505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980702,0.00083539926,0.000065500855,0.00041809236,0.00033426553,0.00027661523],"domain_scores_gemma":[0.96658593,0.02783015,0.001518141,0.0017293349,0.0010202294,0.0013162771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026473438,0.00085192063,0.0015772637,0.0022506402,0.0016868961,0.002728572,0.0027390316,0.0018011567,0.0051646503],"category_scores_gemma":[0.030449951,0.0014949676,0.00078070216,0.0019609754,0.003592568,0.0068763425,0.0032834902,0.0019158408,0.0006854322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004984345,0.0001514148,0.0077813775,0.00053530344,0.00008195877,0.0003119103,0.0009237816,0.07077427,0.008349987,0.8720159,0.008093293,0.030482236],"study_design_scores_gemma":[0.000078554825,0.000095774194,0.0030739715,0.00009965685,0.000052157604,0.0005951827,0.0002823892,0.2787012,0.0033418264,0.709933,0.0037003714,0.00004586085],"about_ca_topic_score_codex":0.0015695393,"about_ca_topic_score_gemma":0.0017033159,"teacher_disagreement_score":0.0051646503,"about_ca_system_score_codex":0.002310507,"about_ca_system_score_gemma":0.00067226024,"threshold_uncertainty_score":0.01727748},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39221787,0.0006168437,0.5663566,0.0025090906,0.00033792207,0.00044189655,0.00111707,0.002218658,0.03418398],"genre_scores_gemma":[0.53845227,0.00029832346,0.43189955,0.00033381535,0.00005138985,0.00017479958,0.0012497838,0.0006970139,0.02684298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869835,0.00024134328,0.00006365717,0.00041181943,0.00022409353,0.00036071293],"domain_scores_gemma":[0.9967604,0.001875498,0.00024589954,0.00050815917,0.0002695131,0.00034060568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097569154,0.0011337132,0.0022660915,0.0017289658,0.0034597572,0.0023233085,0.0025841075,0.0056412616,0.015580363],"category_scores_gemma":[0.006370382,0.0011796127,0.001318005,0.0016150582,0.0021944644,0.005928832,0.004604982,0.0021851894,0.0032667674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029694897,0.0009766504,0.009519205,0.0015117095,0.0002982993,0.0068872967,0.0032355422,0.3308837,0.037352197,0.38775945,0.032232963,0.1863735],"study_design_scores_gemma":[0.00015154187,0.00042380474,0.0012945009,0.00028292855,0.00011668422,0.0011591897,0.0018760464,0.66746354,0.015706953,0.295301,0.016134787,0.00008900424],"about_ca_topic_score_codex":0.00423638,"about_ca_topic_score_gemma":0.006798855,"teacher_disagreement_score":0.015580363,"about_ca_system_score_codex":0.0012444525,"about_ca_system_score_gemma":0.0015020367,"threshold_uncertainty_score":0.05212146},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6974522,0.00050860114,0.2509772,0.0008456,0.00018386508,0.00007926687,0.00024812322,0.00038943623,0.049315847],"genre_scores_gemma":[0.9346502,0.0004130316,0.056341,0.00017955781,0.00007397851,0.000046903035,0.00027241465,0.0000938283,0.007929039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979764,0.000041877283,0.000010556919,0.000058975787,0.000047357655,0.000043646603],"domain_scores_gemma":[0.999516,0.00010933214,0.00009441446,0.0001176643,0.00007178729,0.00009089705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021799417,0.00030735662,0.0002014007,0.0006173713,0.00094396813,0.0007155133,0.00036969394,0.00033076803,0.002564442],"category_scores_gemma":[0.0006078563,0.0001777504,0.0004093893,0.00034536034,0.0010911417,0.0016731533,0.0006906672,0.0008391164,0.00022360048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010290424,0.000041531177,0.0015742697,0.00010429473,0.000014625369,0.0004788327,0.0006808294,0.008165809,0.020295719,0.9468004,0.0015909852,0.020149779],"study_design_scores_gemma":[0.000019456902,0.00007426255,0.0012168197,0.000026676935,0.000033369615,0.0006408885,0.0004120238,0.034463696,0.013800327,0.920218,0.02906557,0.000028925382],"about_ca_topic_score_codex":0.00063441956,"about_ca_topic_score_gemma":0.00097376225,"teacher_disagreement_score":0.002564442,"about_ca_system_score_codex":0.0006499794,"about_ca_system_score_gemma":0.0003072649,"threshold_uncertainty_score":0.0085788965},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6435393,0.00041981475,0.30815557,0.0013036282,0.000112546164,0.00011205737,0.00034397934,0.00026500627,0.04574806],"genre_scores_gemma":[0.9054675,0.0004341446,0.082824044,0.0003811064,0.000129835,0.00012164042,0.0005454302,0.000064153566,0.010032059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999432,0.00014122516,0.000026681257,0.0001832013,0.00014322333,0.00007364346],"domain_scores_gemma":[0.99899966,0.0004256613,0.00015725523,0.00014592065,0.00016938378,0.00010221498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034210243,0.00030034993,0.00023410367,0.0006994251,0.0011048554,0.0009200831,0.0004843758,0.00054800237,0.0033177387],"category_scores_gemma":[0.0014224647,0.00021918568,0.0004531337,0.0006355149,0.000854835,0.0019285924,0.0008813029,0.0009021118,0.00039366767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059367154,0.00004514972,0.0013136482,0.00011320607,0.00001618124,0.00017733159,0.00045914314,0.0048214756,0.01668311,0.9504668,0.001356736,0.024487909],"study_design_scores_gemma":[0.000023708186,0.00010132471,0.0014572206,0.000028531551,0.00004391393,0.0006385824,0.0003256169,0.03609333,0.014493624,0.92569995,0.021066124,0.000028036007],"about_ca_topic_score_codex":0.00044401412,"about_ca_topic_score_gemma":0.00049782003,"teacher_disagreement_score":0.0033177387,"about_ca_system_score_codex":0.00065683655,"about_ca_system_score_gemma":0.00032774924,"threshold_uncertainty_score":0.011098981},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41078436,0.0043011317,0.43558335,0.011436732,0.0019223556,0.00041665783,0.0040765563,0.0041309986,0.12734777],"genre_scores_gemma":[0.8024285,0.0023737648,0.15785226,0.0031021826,0.0010537722,0.0004588114,0.003941285,0.0026600158,0.026129471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99591535,0.0010280381,0.00016165608,0.00084122753,0.0010194076,0.0010342875],"domain_scores_gemma":[0.9712422,0.019452231,0.0010085145,0.005295681,0.0013456573,0.0016557369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033905616,0.003120026,0.003095939,0.0023628417,0.0028136696,0.0074146558,0.007357132,0.0037438087,0.024143305],"category_scores_gemma":[0.02468419,0.0018178298,0.0026817315,0.003875831,0.004784806,0.015167765,0.008712854,0.008885932,0.003601419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0049746875,0.0008414583,0.0075771348,0.0015837917,0.00028176117,0.0006887555,0.001331931,0.11957659,0.03142502,0.6264186,0.059708677,0.1455917],"study_design_scores_gemma":[0.00033256083,0.00023811858,0.0020945675,0.00018226498,0.00026914754,0.00031761272,0.00025933355,0.21670161,0.00886063,0.7600415,0.010610754,0.000091913884],"about_ca_topic_score_codex":0.003326762,"about_ca_topic_score_gemma":0.0047556646,"teacher_disagreement_score":0.024143305,"about_ca_system_score_codex":0.004402869,"about_ca_system_score_gemma":0.00218311,"threshold_uncertainty_score":0.08076739},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43878382,0.00076198945,0.5354197,0.0009419607,0.0001834769,0.00013725091,0.0008792348,0.00069329597,0.022199221],"genre_scores_gemma":[0.76213336,0.0004270602,0.21855865,0.0003339548,0.00013579303,0.00014133201,0.0011971854,0.00044662828,0.016625991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986284,0.00052838714,0.00006711009,0.00027546517,0.00025814332,0.00024257816],"domain_scores_gemma":[0.9950447,0.002205593,0.00049530383,0.0011369126,0.0005525179,0.0005649307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016663015,0.0009819996,0.001326285,0.0017814356,0.0012162651,0.0024390311,0.0025129346,0.0013175318,0.0052559087],"category_scores_gemma":[0.007974883,0.0007784527,0.000777439,0.0026856484,0.0011127408,0.0034935358,0.0019372985,0.0015939502,0.0006821316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007235257,0.00040471242,0.0072307154,0.0004920554,0.00015444205,0.00021379507,0.00053733727,0.13465688,0.015420238,0.65642196,0.015438735,0.16830562],"study_design_scores_gemma":[0.000052007395,0.00006147701,0.0015234429,0.000040348186,0.00006210571,0.00016497365,0.00014048534,0.28355324,0.0043673646,0.7041999,0.0058071585,0.000027479146],"about_ca_topic_score_codex":0.0024738149,"about_ca_topic_score_gemma":0.0035499344,"teacher_disagreement_score":0.0052559087,"about_ca_system_score_codex":0.0015862965,"about_ca_system_score_gemma":0.0007838244,"threshold_uncertainty_score":0.017582774},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37400842,0.0004902266,0.5859928,0.0029100708,0.0001484373,0.00021966398,0.0010584927,0.00083665614,0.03433532],"genre_scores_gemma":[0.65396863,0.00046759917,0.3228131,0.00021056396,0.0000724355,0.00015454866,0.0010221616,0.00030157494,0.020989439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899966,0.00025136388,0.000042341224,0.00037602737,0.00014361205,0.00018693498],"domain_scores_gemma":[0.996709,0.0020909056,0.00035118294,0.00039302802,0.00016052435,0.0002952973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059454195,0.0011099846,0.0018053399,0.0019772903,0.0025756117,0.0026934543,0.0027092847,0.0044964645,0.009943124],"category_scores_gemma":[0.005404162,0.0010326575,0.00091278594,0.002027561,0.0024400463,0.0066357357,0.003394776,0.001717782,0.0016565371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094163197,0.0003985714,0.004851937,0.0008575063,0.00014160876,0.0012541516,0.0012527793,0.32800978,0.015875341,0.54140025,0.013666109,0.09135037],"study_design_scores_gemma":[0.000088587025,0.0001469533,0.0013230231,0.00010735994,0.00006240489,0.00056694215,0.0012411572,0.48417327,0.0075683245,0.4952214,0.009438681,0.000061882536],"about_ca_topic_score_codex":0.004023254,"about_ca_topic_score_gemma":0.004397035,"teacher_disagreement_score":0.009943124,"about_ca_system_score_codex":0.0013137682,"about_ca_system_score_gemma":0.000974403,"threshold_uncertainty_score":0.033263087},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90776694,0.000817809,0.047872964,0.0014093093,0.00011667176,0.000047132373,0.0006753987,0.000622894,0.04067093],"genre_scores_gemma":[0.97552925,0.00016060856,0.019536719,0.00018348405,0.000049183607,0.00007609015,0.00053231284,0.00007901988,0.0038533444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986833,0.00012795662,0.00009391498,0.0004781039,0.00024372335,0.00037300252],"domain_scores_gemma":[0.9957812,0.0015061189,0.0005419022,0.000991114,0.00044030717,0.0007394567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006084736,0.0007557451,0.0012101717,0.0014889268,0.0035517025,0.0020986772,0.0014082246,0.0016228087,0.007908949],"category_scores_gemma":[0.003974,0.0012350943,0.0007883087,0.0017673429,0.0030517802,0.0053489385,0.0030549366,0.001779201,0.0010276673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012485876,0.00018099321,0.021971926,0.0003546187,0.00020833504,0.0018679192,0.0011504405,0.008385727,0.020495128,0.82147944,0.008584053,0.11407291],"study_design_scores_gemma":[0.00018994212,0.00016490062,0.0077550695,0.000110373374,0.00013765643,0.002836137,0.0011087947,0.011178812,0.0123374835,0.946154,0.017876707,0.00015011337],"about_ca_topic_score_codex":0.00048442313,"about_ca_topic_score_gemma":0.001097515,"teacher_disagreement_score":0.007908949,"about_ca_system_score_codex":0.000823859,"about_ca_system_score_gemma":0.0004683745,"threshold_uncertainty_score":0.026458025},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31384215,0.013450478,0.39479473,0.007877923,0.0009978627,0.00014241968,0.001647478,0.0007294496,0.26651746],"genre_scores_gemma":[0.88398814,0.010252607,0.081516765,0.0018003086,0.0017175166,0.00018599088,0.0012674521,0.00024946264,0.019021913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990294,0.00021023261,0.000058240414,0.00030861844,0.00019745478,0.00019601292],"domain_scores_gemma":[0.995368,0.0031140982,0.00045885183,0.00044508363,0.00030649666,0.0003074803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014143041,0.00074804726,0.0008315302,0.0020580892,0.002056989,0.0025129511,0.0010087217,0.001262009,0.0080176275],"category_scores_gemma":[0.005105994,0.00059191964,0.0010408845,0.0036302453,0.0032083536,0.006297369,0.0019008305,0.002393994,0.0010841608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008186575,0.00004281589,0.001238065,0.00024043975,0.000015638081,0.00019128967,0.00044151448,0.0038112598,0.0014477565,0.9672094,0.004669319,0.020610748],"study_design_scores_gemma":[0.000014176518,0.000041394844,0.0007479033,0.00004190117,0.000025223879,0.00043232227,0.00017554488,0.006130511,0.0010170975,0.97452897,0.0168239,0.000021132257],"about_ca_topic_score_codex":0.00087505864,"about_ca_topic_score_gemma":0.0005244931,"teacher_disagreement_score":0.0080176275,"about_ca_system_score_codex":0.0016341949,"about_ca_system_score_gemma":0.00065428397,"threshold_uncertainty_score":0.026821613},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08532731,0.0007399173,0.7458419,0.0023036674,0.0006075751,0.0000914188,0.0025798623,0.0024779588,0.16003034],"genre_scores_gemma":[0.62768275,0.0009894309,0.2580511,0.0011135542,0.00029942437,0.00013841908,0.0034613484,0.0018607532,0.106403165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993918,0.00012473027,0.00002702028,0.00017395208,0.00014378192,0.00013862718],"domain_scores_gemma":[0.9978225,0.00075730524,0.0001144393,0.0008090177,0.00033724649,0.00015956745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006759282,0.00057047856,0.00064401515,0.001082176,0.0017336814,0.0028196014,0.0009769906,0.0009843657,0.01828056],"category_scores_gemma":[0.003064926,0.00035194136,0.00088335853,0.0015646182,0.0016878487,0.0031418216,0.0016677426,0.0015736695,0.0027469741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013097489,0.000027136153,0.0003595018,0.0001475213,0.000017134416,0.00007651174,0.00023438728,0.007939163,0.0061637484,0.915752,0.022925261,0.046226624],"study_design_scores_gemma":[0.000019866018,0.000023794226,0.00035612527,0.00002699455,0.000022611088,0.00013660676,0.00008136782,0.023593962,0.005332186,0.9280198,0.04236127,0.000025360507],"about_ca_topic_score_codex":0.004796587,"about_ca_topic_score_gemma":0.0075599994,"teacher_disagreement_score":0.01828056,"about_ca_system_score_codex":0.002164463,"about_ca_system_score_gemma":0.0011423749,"threshold_uncertainty_score":0.061154604},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29433566,0.0008293904,0.6335426,0.0048879674,0.00024427974,0.00019108095,0.0006028789,0.0011968213,0.064169295],"genre_scores_gemma":[0.59618586,0.0008296716,0.38629368,0.0008513623,0.0001731473,0.0002163978,0.0007912053,0.00062270847,0.014035924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938834,0.0002282956,0.000023090883,0.00014048329,0.000118236414,0.00010161665],"domain_scores_gemma":[0.9944963,0.003288208,0.00031098595,0.0011174964,0.00026282767,0.0005242138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097064994,0.000809032,0.00081939594,0.0016543217,0.0022493459,0.002366672,0.0017424522,0.0017346911,0.006071295],"category_scores_gemma":[0.0049426993,0.0012002245,0.0011924283,0.001901424,0.0035340758,0.0041560777,0.0053621056,0.0032453372,0.0009169382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009131764,0.000071023096,0.00073422375,0.000111835645,0.000014405966,0.00010642751,0.00035059472,0.0104556065,0.0061329613,0.96354145,0.0046285014,0.013761716],"study_design_scores_gemma":[0.00006677233,0.00004870324,0.0005800556,0.00004459953,0.000032290933,0.00018209117,0.00016724385,0.04013461,0.0030194395,0.948195,0.0074893525,0.000039898474],"about_ca_topic_score_codex":0.0010801515,"about_ca_topic_score_gemma":0.0023469352,"teacher_disagreement_score":0.006071295,"about_ca_system_score_codex":0.0016337032,"about_ca_system_score_gemma":0.00088003755,"threshold_uncertainty_score":0.020310521},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00097630755,0.005831826,0.020948239,0.08524965,0.6578345,0.00015593623,0.009233962,0.0051140226,0.2146556],"genre_scores_gemma":[0.016755821,0.008627106,0.016739657,0.023140542,0.05909481,0.00025020825,0.012393404,0.0050528254,0.85794556],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99863356,0.00026905665,0.00011788612,0.00021531533,0.0006586293,0.00010548334],"domain_scores_gemma":[0.99430335,0.0016649641,0.00021988273,0.00054619875,0.002957834,0.0003078497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013948977,0.0020006162,0.0016439541,0.003672938,0.002314201,0.003332991,0.002691265,0.0024339661,0.2773517],"category_scores_gemma":[0.014105952,0.0009868508,0.0012883093,0.0031429825,0.0015948866,0.003335315,0.001323306,0.004752847,0.13004906],"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.000014565778,0.000007764577,0.000022487593,0.0000734969,0.000005185229,0.000029812965,0.000016646416,0.00006638726,0.000052956213,0.003292516,0.9910731,0.0053452346],"study_design_scores_gemma":[0.000026892896,0.000033882523,0.00079689577,0.0001727062,0.000029583145,0.00023805608,0.00007917283,0.00097600796,0.00049895386,0.017356712,0.9797468,0.000044209308],"about_ca_topic_score_codex":0.013014976,"about_ca_topic_score_gemma":0.018909167,"teacher_disagreement_score":0.2773517,"about_ca_system_score_codex":0.004234739,"about_ca_system_score_gemma":0.0016577021,"threshold_uncertainty_score":0.9278339},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002422397,0.00036114696,0.26855785,0.0066555184,0.0013032941,0.0002673129,0.09349537,0.09818438,0.5287527],"genre_scores_gemma":[0.045947596,0.0016301868,0.22067617,0.002945776,0.0007043448,0.00066229474,0.15784658,0.08924015,0.48034695],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950457,0.000104886305,0.00004785851,0.00009387639,0.00019166312,0.000056998615],"domain_scores_gemma":[0.9982729,0.0005075005,0.00011070978,0.00046530282,0.00050658,0.00013704629],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00068963814,0.0010287826,0.0007968886,0.001903937,0.0009434879,0.004605981,0.0022908517,0.0014514213,0.44504252],"category_scores_gemma":[0.0039696614,0.0008891743,0.00073824206,0.0032595838,0.00068858673,0.0053520165,0.0020210855,0.0027767415,0.3194176],"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.000059946688,0.000026449505,0.00015019903,0.00020036576,0.000007148067,0.00003954077,0.00011847878,0.00042722933,0.0013061104,0.07012647,0.87822735,0.04931059],"study_design_scores_gemma":[0.000027570139,0.000009249894,0.00036105537,0.000057020738,0.0000055467217,0.00010912618,0.00006400976,0.0026584761,0.003801919,0.047108926,0.9457686,0.00002858127],"about_ca_topic_score_codex":0.00600731,"about_ca_topic_score_gemma":0.008347805,"teacher_disagreement_score":0.44504252,"about_ca_system_score_codex":0.002346203,"about_ca_system_score_gemma":0.0012088543,"threshold_uncertainty_score":0.7915795},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1019376,0.0006229888,0.8577277,0.001307791,0.00022318395,0.00010132238,0.0006096043,0.0007764801,0.036693275],"genre_scores_gemma":[0.52690995,0.0008543518,0.44078508,0.00063283806,0.00023761933,0.00025301948,0.0010065394,0.0008739372,0.028446648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846244,0.0005511274,0.00008258902,0.00037208735,0.00032060305,0.00021108035],"domain_scores_gemma":[0.991411,0.004398331,0.00040033876,0.002441591,0.0007334859,0.0006153072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021502646,0.0008391612,0.0012421967,0.002026446,0.0015615998,0.002953416,0.0026226956,0.001499009,0.011554304],"category_scores_gemma":[0.0121189635,0.0006623416,0.000857993,0.004140111,0.0019114829,0.0064092423,0.0025512862,0.002882798,0.0014222844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011651585,0.00010814024,0.0007794355,0.00014571079,0.000023590792,0.000035719204,0.00015920133,0.0158349,0.002854022,0.8675222,0.008971318,0.10344923],"study_design_scores_gemma":[0.000021193,0.000014744615,0.00021505823,0.000025161502,0.000025596766,0.00006779057,0.00004969834,0.056721393,0.0018013775,0.93344873,0.007592285,0.000016885499],"about_ca_topic_score_codex":0.001395376,"about_ca_topic_score_gemma":0.0022607385,"teacher_disagreement_score":0.011554304,"about_ca_system_score_codex":0.0016603849,"about_ca_system_score_gemma":0.00084214873,"threshold_uncertainty_score":0.038653016},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6865738,0.0011881718,0.18166716,0.00223752,0.00023674236,0.00020313037,0.0010309523,0.0009772843,0.12588513],"genre_scores_gemma":[0.95559627,0.00064569485,0.024690388,0.00043426617,0.00012959298,0.00010593061,0.00083461247,0.00015733749,0.017405896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955004,0.00007597563,0.000021934384,0.00013917175,0.00009874593,0.000114085575],"domain_scores_gemma":[0.9989969,0.00025832604,0.00016702514,0.00020977056,0.00014705434,0.00022084756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036541178,0.000686367,0.00035041806,0.0013812924,0.0025278293,0.0014072687,0.0008564587,0.0008200673,0.0066459402],"category_scores_gemma":[0.0016070809,0.00036580669,0.0010013469,0.0011859512,0.0017743289,0.0027786437,0.0013490494,0.0013507117,0.0005438863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048370868,0.000024147717,0.001050032,0.00007508471,0.000013939646,0.00024233642,0.0005059125,0.0048643826,0.0035542725,0.97871333,0.0019670103,0.0089411475],"study_design_scores_gemma":[0.000015956455,0.000034684454,0.00076371187,0.000021941447,0.000026100754,0.0003363181,0.00031966795,0.013986786,0.0030080415,0.9633554,0.018108092,0.000023245042],"about_ca_topic_score_codex":0.003124412,"about_ca_topic_score_gemma":0.0033328086,"teacher_disagreement_score":0.0066459402,"about_ca_system_score_codex":0.0015882311,"about_ca_system_score_gemma":0.00071825396,"threshold_uncertainty_score":0.02223289},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26006913,0.015353071,0.57441163,0.013374626,0.0011392819,0.00021647799,0.0012384456,0.0007383778,0.133459],"genre_scores_gemma":[0.77790105,0.003931334,0.18914549,0.0016423995,0.00068866526,0.0002467004,0.0008719237,0.00045044237,0.025122028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994585,0.00021031749,0.000018787327,0.000113298185,0.00010729169,0.00009177625],"domain_scores_gemma":[0.99735427,0.001947739,0.00016678375,0.00020747428,0.00016793162,0.00015581904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013942702,0.00050518155,0.001240933,0.0015876286,0.0018824942,0.0017226967,0.0016176971,0.001511735,0.008627245],"category_scores_gemma":[0.009195258,0.0005152475,0.0005826409,0.0018431173,0.00211001,0.0041165077,0.0018276533,0.0018625914,0.0007828574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003871834,0.00009829672,0.0018772393,0.0002897485,0.00007874018,0.000080610065,0.00019291372,0.089973256,0.0013486592,0.8119971,0.024747128,0.068929195],"study_design_scores_gemma":[0.00012133594,0.00007600268,0.00079300464,0.000081597864,0.000048911235,0.00007821265,0.00009797974,0.16230221,0.00095957355,0.8262645,0.009141112,0.000035479177],"about_ca_topic_score_codex":0.00312209,"about_ca_topic_score_gemma":0.008244512,"teacher_disagreement_score":0.008627245,"about_ca_system_score_codex":0.0021150603,"about_ca_system_score_gemma":0.0009204329,"threshold_uncertainty_score":0.028860986},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24720812,0.0011353713,0.5251272,0.003423999,0.00073999155,0.00014640756,0.0009301866,0.0014450791,0.21984372],"genre_scores_gemma":[0.76069766,0.0012714053,0.18689892,0.0014434848,0.00048473544,0.0001642823,0.00092406734,0.00044946925,0.04766596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970466,0.00006911654,0.000014271507,0.000094981784,0.000051954477,0.00006499763],"domain_scores_gemma":[0.9994029,0.00019255871,0.000078485995,0.00014444886,0.00009825703,0.00008335031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003974485,0.0003791015,0.00033929938,0.0007150229,0.0011868665,0.0011503027,0.0004305415,0.00063320086,0.009368843],"category_scores_gemma":[0.0012643032,0.00015761396,0.00043986787,0.0009719848,0.001104917,0.002609656,0.0009236165,0.0016780491,0.0011823964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047895,0.000024240035,0.00012895073,0.0000623546,0.0000029757732,0.000063860825,0.00015364449,0.0009987132,0.0029426098,0.97274417,0.0028923857,0.019938098],"study_design_scores_gemma":[0.000013058692,0.000038760467,0.0002468708,0.000012912857,0.000011550685,0.00017093637,0.00006985679,0.007270632,0.004633768,0.9614623,0.026055206,0.000014161389],"about_ca_topic_score_codex":0.0005390995,"about_ca_topic_score_gemma":0.00058188615,"teacher_disagreement_score":0.009368843,"about_ca_system_score_codex":0.0009729415,"about_ca_system_score_gemma":0.0003918499,"threshold_uncertainty_score":0.03134191},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3786761,0.0017703787,0.5132573,0.046958394,0.0016495363,0.0001790692,0.0016607386,0.001416003,0.05443255],"genre_scores_gemma":[0.88483405,0.0007769403,0.09941579,0.004560076,0.00083295885,0.00013707268,0.0014029047,0.0009895556,0.0070506274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99747556,0.00078217546,0.000115475465,0.0008160987,0.00048237908,0.0003282476],"domain_scores_gemma":[0.97274697,0.017970113,0.0022681288,0.003523022,0.0021341234,0.0013575603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032218273,0.00039362456,0.0012918611,0.0015481521,0.0025725537,0.0041255024,0.0016146884,0.0069203577,0.007463296],"category_scores_gemma":[0.04705336,0.00097129383,0.00089044514,0.0016424537,0.0044197165,0.011485816,0.0024512876,0.004033648,0.0017849682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000216874,0.000058979094,0.0073185074,0.0002586425,0.000058140788,0.00056596095,0.0010081222,0.0034370294,0.0021828595,0.9383561,0.01565653,0.030882243],"study_design_scores_gemma":[0.000025955376,0.000008987509,0.00076980656,0.000053371325,0.00001625861,0.0003951245,0.00055183243,0.009142421,0.0008184812,0.983678,0.004513256,0.000026370777],"about_ca_topic_score_codex":0.0017114442,"about_ca_topic_score_gemma":0.0018481242,"teacher_disagreement_score":0.007463296,"about_ca_system_score_codex":0.0014010238,"about_ca_system_score_gemma":0.0008103653,"threshold_uncertainty_score":0.024967253},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003511867,0.00035755528,0.4349283,0.0052624354,0.0012101096,0.00036078703,0.04209357,0.058000293,0.45427507],"genre_scores_gemma":[0.04992337,0.002212713,0.3167091,0.0021908763,0.0005569684,0.00080709485,0.09058044,0.055532407,0.48148707],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992951,0.0001574772,0.000059364345,0.00015930158,0.0002445805,0.00008414457],"domain_scores_gemma":[0.99835014,0.00051823165,0.000095852105,0.00052192196,0.00037106432,0.00014280873],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010494431,0.001170272,0.00079109304,0.0019962424,0.0013487322,0.0038986,0.001981109,0.0016337602,0.31013885],"category_scores_gemma":[0.0044278293,0.0011232262,0.001174703,0.0036642984,0.0009590481,0.006418176,0.002218334,0.0027871442,0.21773693],"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.0001210482,0.00005988481,0.00024636928,0.00030407318,0.000012528309,0.000084763706,0.00028961455,0.0012501521,0.0033300053,0.22681426,0.6799651,0.087522216],"study_design_scores_gemma":[0.0000356316,0.000011737488,0.00031199076,0.000063869105,0.00001004472,0.00011612438,0.00008631655,0.0034253965,0.0034415163,0.09034897,0.9021191,0.000029245228],"about_ca_topic_score_codex":0.007399143,"about_ca_topic_score_gemma":0.01053754,"teacher_disagreement_score":0.31013885,"about_ca_system_score_codex":0.0028017876,"about_ca_system_score_gemma":0.0017310781,"threshold_uncertainty_score":0.9840032},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37539023,0.007972801,0.47145233,0.015576468,0.0013102873,0.00015380973,0.001820056,0.0005686027,0.1257555],"genre_scores_gemma":[0.82194597,0.007386068,0.12878707,0.0031755664,0.0016849276,0.00025251115,0.0019011279,0.00054177776,0.034325063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990013,0.0004504756,0.000033617733,0.00018767318,0.00014841485,0.00017853708],"domain_scores_gemma":[0.99047905,0.0066299913,0.0006016109,0.00064669864,0.0005763739,0.0010663702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016329358,0.0013046316,0.0015250616,0.0021203877,0.0023820298,0.0038313405,0.002021525,0.0019275591,0.0066308724],"category_scores_gemma":[0.008776868,0.001197084,0.00092664704,0.003623343,0.0039261063,0.0063986536,0.0028070882,0.004026385,0.0009756409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002027321,0.00006932208,0.0009819677,0.00017731631,0.00002496035,0.000063968364,0.00036087146,0.015306057,0.001502447,0.947818,0.014872601,0.01861979],"study_design_scores_gemma":[0.00003352705,0.000018029501,0.0004228416,0.000035081437,0.000012279995,0.000063055006,0.00011889831,0.02702832,0.00023115009,0.9677969,0.004226977,0.000012815643],"about_ca_topic_score_codex":0.004913881,"about_ca_topic_score_gemma":0.0040626316,"teacher_disagreement_score":0.0066308724,"about_ca_system_score_codex":0.0026471636,"about_ca_system_score_gemma":0.00126064,"threshold_uncertainty_score":0.022182465},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19136141,0.0012863206,0.76075935,0.0020969738,0.0002985981,0.00027408352,0.00094190025,0.00064131763,0.042340085],"genre_scores_gemma":[0.5682411,0.0013040247,0.40010342,0.0008154894,0.00032282327,0.00032877686,0.0018500959,0.00058034697,0.026453922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983353,0.0006098125,0.000059095044,0.00042920766,0.0002918193,0.00027475628],"domain_scores_gemma":[0.99503195,0.0027133322,0.0003196454,0.0009723143,0.0005414405,0.00042120146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021391322,0.0012752825,0.0020449113,0.0017852086,0.0020143746,0.0024365424,0.003643469,0.0016618716,0.010039972],"category_scores_gemma":[0.010335241,0.00077251723,0.0010163927,0.0044217,0.0019148571,0.0060273856,0.0033065954,0.0025708096,0.0009839442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003863114,0.0003144247,0.002019796,0.00032305336,0.00009565818,0.00009463718,0.0003945304,0.095929675,0.0023102085,0.7495349,0.020473389,0.12812342],"study_design_scores_gemma":[0.00005281204,0.000039664086,0.00049322116,0.000035679383,0.00005381085,0.00006047947,0.0001311053,0.2414468,0.0006277566,0.75185716,0.005176227,0.000025238249],"about_ca_topic_score_codex":0.008103118,"about_ca_topic_score_gemma":0.007884443,"teacher_disagreement_score":0.010039972,"about_ca_system_score_codex":0.002966887,"about_ca_system_score_gemma":0.002380085,"threshold_uncertainty_score":0.033587098},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67631257,0.0019405191,0.14379482,0.018720891,0.0007054005,0.0000761872,0.0009160072,0.0005793682,0.15695423],"genre_scores_gemma":[0.9366347,0.00093042303,0.03083914,0.0014838534,0.0004591392,0.00009102455,0.0007489665,0.00016869232,0.028644029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981092,0.00055653806,0.00009941134,0.00057841314,0.00031290014,0.00034345896],"domain_scores_gemma":[0.9902159,0.006029144,0.0005466515,0.0018437342,0.00050215394,0.000862384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021642765,0.0008054763,0.0015894672,0.0014656152,0.0035630711,0.004372922,0.0027037875,0.002732605,0.011947704],"category_scores_gemma":[0.009440373,0.0012340571,0.0013973216,0.0019280325,0.0065471414,0.014914746,0.0052234223,0.0066169286,0.0012494124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009207327,0.00003149128,0.0005783296,0.00004704751,0.000007719132,0.000077808654,0.00046378595,0.0015212976,0.00034587082,0.98975986,0.0030214698,0.0040532257],"study_design_scores_gemma":[0.000021342279,0.000009788453,0.0001826628,0.000011202969,0.0000064570377,0.00006773016,0.00016672512,0.003666736,0.00032249079,0.9913879,0.004147656,0.000009230545],"about_ca_topic_score_codex":0.0021711467,"about_ca_topic_score_gemma":0.0019323794,"teacher_disagreement_score":0.011947704,"about_ca_system_score_codex":0.0017504118,"about_ca_system_score_gemma":0.0007824908,"threshold_uncertainty_score":0.039969027},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5597564,0.00064586895,0.36272237,0.0021599531,0.0001837994,0.00013011733,0.00050002494,0.00040483155,0.0734967],"genre_scores_gemma":[0.88598704,0.0007286539,0.09730723,0.0005865016,0.00017552814,0.00011305973,0.00055225723,0.0001352722,0.014414435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960893,0.000105306906,0.000014929358,0.00013051262,0.000067601184,0.00007285157],"domain_scores_gemma":[0.9986008,0.00073432474,0.00018671498,0.0001675975,0.00016061596,0.00015005888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004974913,0.0003357473,0.00034516567,0.00075603,0.0014612817,0.001026169,0.00053630373,0.0007994777,0.006163452],"category_scores_gemma":[0.0019175785,0.00022015291,0.0005271753,0.00093753124,0.0011288304,0.002913192,0.0007624799,0.001442745,0.00043929068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005944153,0.00003922806,0.00046259546,0.00007717273,0.0000066665666,0.00016783827,0.0002857226,0.004270478,0.004138326,0.9756964,0.0021520394,0.012644136],"study_design_scores_gemma":[0.000019058667,0.000043117718,0.00035617643,0.000011763628,0.000017184542,0.00031192962,0.00015615078,0.02247555,0.0029454557,0.96439457,0.009255705,0.000013340403],"about_ca_topic_score_codex":0.00070954225,"about_ca_topic_score_gemma":0.00056399003,"teacher_disagreement_score":0.006163452,"about_ca_system_score_codex":0.0009599312,"about_ca_system_score_gemma":0.00048765464,"threshold_uncertainty_score":0.020618796},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8433448,0.003513435,0.082611345,0.004829555,0.00029060047,0.000050087554,0.0011325096,0.00022382208,0.06400383],"genre_scores_gemma":[0.9730056,0.0016073211,0.013262532,0.0005055596,0.00038518797,0.000094010495,0.0006548857,0.0001017226,0.01038315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992181,0.00026270884,0.000032256794,0.00018814909,0.00014541004,0.00015332135],"domain_scores_gemma":[0.9937727,0.004236553,0.00059662695,0.00045858108,0.00025452586,0.00068111473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012200588,0.00080474786,0.0011288384,0.003297402,0.0029692363,0.006003143,0.001950011,0.0018138083,0.006137641],"category_scores_gemma":[0.006001667,0.0011249043,0.00078195974,0.003443313,0.0041034976,0.007987118,0.0024015582,0.00313108,0.00041414867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057505087,0.000018304845,0.0006709783,0.00004979423,0.000012939231,0.000022645907,0.0002677048,0.003194089,0.00044269304,0.9898122,0.0018575798,0.0035935165],"study_design_scores_gemma":[0.000019857522,0.000008529568,0.0005165084,0.000019894693,0.000014218991,0.00004954536,0.00010890799,0.010332612,0.0002977522,0.9869976,0.0016212387,0.000013450759],"about_ca_topic_score_codex":0.0023964664,"about_ca_topic_score_gemma":0.0026534495,"teacher_disagreement_score":0.006137641,"about_ca_system_score_codex":0.0029313315,"about_ca_system_score_gemma":0.00077827845,"threshold_uncertainty_score":0.021268368},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2211092,0.0016448692,0.50181836,0.0022449617,0.0012910578,0.00020508391,0.0032302977,0.0009950459,0.26746115],"genre_scores_gemma":[0.700229,0.0021405434,0.17051119,0.000678034,0.00042398405,0.00028669983,0.0029257424,0.0005677663,0.122237094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995147,0.00010469789,0.000020269588,0.0001123255,0.00017995894,0.000068116315],"domain_scores_gemma":[0.9994721,0.000113604736,0.000056853874,0.00011733339,0.00015217847,0.00008799228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019810637,0.0003983528,0.00042496764,0.0011113733,0.0013060109,0.0026356757,0.0007551645,0.0006004033,0.017294746],"category_scores_gemma":[0.001169703,0.0002829522,0.0004111412,0.0012551593,0.0013665551,0.002228165,0.0011798341,0.0014572637,0.002589633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028331357,0.000010777425,0.00019004825,0.00004783295,0.0000066784028,0.00010432603,0.00011731458,0.0018962282,0.001801939,0.9774595,0.0034723943,0.014864715],"study_design_scores_gemma":[0.00001176532,0.00001650493,0.00040390907,0.000026692114,0.000010429771,0.00022617262,0.00018097521,0.016181946,0.002496321,0.92201567,0.05841158,0.000018066386],"about_ca_topic_score_codex":0.0025027012,"about_ca_topic_score_gemma":0.0021047415,"teacher_disagreement_score":0.017294746,"about_ca_system_score_codex":0.00094002445,"about_ca_system_score_gemma":0.0006045938,"threshold_uncertainty_score":0.05785668},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5278034,0.00045686917,0.39589813,0.0010511393,0.00025373607,0.00017192171,0.0014954882,0.0012050911,0.0716642],"genre_scores_gemma":[0.88847107,0.00055361184,0.086766325,0.00047268035,0.0002099877,0.0002136125,0.0023967058,0.0008541437,0.020061776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921966,0.0001654111,0.00005503299,0.00022150668,0.00017719097,0.00016110744],"domain_scores_gemma":[0.996653,0.001493114,0.00048162797,0.00079129357,0.00022384734,0.00035714457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058769615,0.0008154421,0.0008143682,0.0013207751,0.0014053294,0.003925196,0.0015972476,0.0015715087,0.010946234],"category_scores_gemma":[0.004095304,0.0009383328,0.0012397328,0.0013763746,0.0024400172,0.0053102328,0.0031524953,0.003099548,0.0013575695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012403037,0.000052115378,0.00042993098,0.00008058512,0.000010465556,0.00013091289,0.00069508614,0.0053607672,0.0024247023,0.9747362,0.0025874875,0.013367709],"study_design_scores_gemma":[0.000017653949,0.000014510585,0.00020724341,0.000015991047,0.000010256235,0.0000680783,0.0001422084,0.010603185,0.00066714454,0.98553026,0.0027108528,0.000012586928],"about_ca_topic_score_codex":0.0013852728,"about_ca_topic_score_gemma":0.002199549,"teacher_disagreement_score":0.010946234,"about_ca_system_score_codex":0.0011597803,"about_ca_system_score_gemma":0.00048137686,"threshold_uncertainty_score":0.03661883},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69467247,0.004345561,0.25396147,0.010210253,0.0002638974,0.000071848925,0.0014482731,0.00028363056,0.03474263],"genre_scores_gemma":[0.95744497,0.0020222978,0.034134302,0.00041332177,0.0005155718,0.00011796117,0.00075837655,0.00010577742,0.004487441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971782,0.0012334125,0.00015478981,0.0006230387,0.0005054814,0.0003050995],"domain_scores_gemma":[0.96219283,0.028908806,0.0032482662,0.0025227643,0.0011137131,0.0020136058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028303878,0.00086661044,0.0017479464,0.004018077,0.002947607,0.0067092734,0.003109323,0.0030764048,0.0047544623],"category_scores_gemma":[0.017517466,0.0011522076,0.0015049215,0.0050583426,0.008471002,0.012268657,0.0040588905,0.0056067337,0.00042163176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006625895,0.000020812153,0.0008340963,0.0000680913,0.000020721804,0.000033474105,0.00031705268,0.0047571245,0.0004521341,0.98826176,0.00083641545,0.004331983],"study_design_scores_gemma":[0.000011701706,0.000010110433,0.00028599193,0.000013686696,0.000008798399,0.000059596827,0.00008989614,0.008150163,0.00022012032,0.990026,0.0011106977,0.000013160886],"about_ca_topic_score_codex":0.0014410033,"about_ca_topic_score_gemma":0.0011234317,"teacher_disagreement_score":0.0067092734,"about_ca_system_score_codex":0.002474595,"about_ca_system_score_gemma":0.00083511136,"threshold_uncertainty_score":0.017954528},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19932197,0.0028299412,0.30492496,0.007034778,0.0011754511,0.000075159485,0.0008243189,0.000954583,0.48285878],"genre_scores_gemma":[0.8622013,0.0012020841,0.0559209,0.0015323694,0.0010451031,0.00011165727,0.0006566957,0.000328645,0.077001296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956375,0.00009242106,0.000014834561,0.00014895471,0.000116323106,0.00006381169],"domain_scores_gemma":[0.999193,0.0003053069,0.00008395867,0.00013825479,0.00013837747,0.00014104416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039027818,0.00049543654,0.0006825654,0.0016674005,0.0018937105,0.002458144,0.00089404255,0.0011394204,0.01961946],"category_scores_gemma":[0.0018917873,0.00038337015,0.00050445227,0.0014418914,0.002139285,0.004636271,0.0017795508,0.0027034085,0.002169124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013086854,0.000007983683,0.000048855454,0.0000148538775,0.000002162588,0.00001224734,0.0000479645,0.00019912477,0.0003666984,0.99135244,0.0026655612,0.005268953],"study_design_scores_gemma":[0.000004685704,0.0000029651337,0.0000548571,0.000003828341,0.0000018596025,0.00003284235,0.000027082808,0.0014020508,0.00026704776,0.99460137,0.003597207,0.0000042062184],"about_ca_topic_score_codex":0.0005672105,"about_ca_topic_score_gemma":0.0006754601,"teacher_disagreement_score":0.01961946,"about_ca_system_score_codex":0.000827635,"about_ca_system_score_gemma":0.00049374497,"threshold_uncertainty_score":0.065633655},"labels":[],"label_agreement":null},{"id":"W204249971","doi":"","title":"Some Properties of Prime Graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Prime (order theory); Combinatorics","score_opus":0.01590317179693103,"score_gpt":0.21904800488490672,"score_spread":0.2031448330879757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W204249971","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2177723,0.008357844,0.18564102,0.013478419,0.0009809745,0.00016860645,0.0035406605,0.0009793625,0.5690808],"genre_scores_gemma":[0.90659904,0.0047860504,0.043336295,0.0019925016,0.0015202705,0.0002384223,0.00232781,0.00042413964,0.03877544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991468,0.00027963988,0.000050128972,0.00020708426,0.00018871445,0.00012760695],"domain_scores_gemma":[0.9953419,0.0031059464,0.00036627767,0.00058534864,0.0002878815,0.00031271778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012907973,0.00064105797,0.0006577552,0.0020987361,0.0019725892,0.0040509542,0.0009555148,0.0010730696,0.015111965],"category_scores_gemma":[0.0054923575,0.0006347392,0.0008208096,0.0029953483,0.0028344684,0.0067573767,0.0016484288,0.002906789,0.0024428207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030708496,0.00002493516,0.00044300474,0.00008393935,0.00000809618,0.00007345841,0.00018512759,0.0005956941,0.0005076225,0.97856003,0.008236867,0.011250365],"study_design_scores_gemma":[0.000011070493,0.000012174733,0.0003818399,0.000019679283,0.00001031842,0.00023988314,0.000095703814,0.0015318621,0.00045480512,0.98431534,0.0129197575,0.0000074969093],"about_ca_topic_score_codex":0.00070637057,"about_ca_topic_score_gemma":0.0006951351,"teacher_disagreement_score":0.015111965,"about_ca_system_score_codex":0.0014935732,"about_ca_system_score_gemma":0.0005263002,"threshold_uncertainty_score":0.050554514},"labels":[],"label_agreement":null},{"id":"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026087896,0.0005289779,0.21954755,0.0071610375,0.0018806381,0.00030997331,0.1072609,0.07386653,0.5868356],"genre_scores_gemma":[0.031857226,0.00220799,0.19770268,0.0027746945,0.0009827769,0.0007764698,0.16335852,0.08133525,0.5190043],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999508,0.00009715494,0.00004972644,0.000095605734,0.00019877605,0.000050752973],"domain_scores_gemma":[0.99830985,0.0004913749,0.00010591317,0.0004483643,0.00046869862,0.00017588935],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00073049153,0.001164818,0.000925862,0.0023251295,0.0009985104,0.004647589,0.002424476,0.0013712014,0.51899445],"category_scores_gemma":[0.0036420324,0.00094711676,0.0009924609,0.0038885544,0.0006740517,0.0054309964,0.002192128,0.0029035388,0.39231494],"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.00006016166,0.000031692987,0.00015192787,0.00020978044,0.00000767056,0.000040487503,0.00011323587,0.0003163785,0.0015775278,0.052862097,0.891312,0.053317007],"study_design_scores_gemma":[0.000035442255,0.00001367757,0.00047553613,0.00006173439,0.0000063034026,0.00011908948,0.00006490214,0.0023373594,0.0031440821,0.037363272,0.9563436,0.00003505661],"about_ca_topic_score_codex":0.007079864,"about_ca_topic_score_gemma":0.0076907407,"teacher_disagreement_score":0.51899445,"about_ca_system_score_codex":0.001962486,"about_ca_system_score_gemma":0.0013774578,"threshold_uncertainty_score":0.686096},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6756682,0.002143177,0.23440163,0.006575127,0.00031800146,0.00022551755,0.0014303846,0.00077942584,0.07845857],"genre_scores_gemma":[0.9147541,0.0005412922,0.073929675,0.0006584231,0.00019861004,0.00014226382,0.00085954857,0.00013126458,0.008784804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979563,0.0005596289,0.00015746476,0.00051010074,0.00045134014,0.0003651463],"domain_scores_gemma":[0.99183124,0.0057599647,0.00052321557,0.00083186483,0.00057273504,0.0004809898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017723377,0.0006116696,0.0009391597,0.0015516431,0.0028246266,0.0025136014,0.0015688043,0.0018843577,0.007828078],"category_scores_gemma":[0.010807463,0.0007314633,0.00096784503,0.0017518305,0.003155791,0.0055230125,0.002496342,0.001953286,0.0007427007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005535071,0.00008039963,0.0025061613,0.000266223,0.00004638101,0.00017918117,0.0006171821,0.0116640115,0.0040113004,0.93106323,0.007778652,0.04123383],"study_design_scores_gemma":[0.00011492135,0.000092518465,0.00069847924,0.00007691153,0.000050699753,0.0004922241,0.00032074063,0.029867576,0.004577221,0.94851243,0.015159048,0.000037173755],"about_ca_topic_score_codex":0.0013968287,"about_ca_topic_score_gemma":0.0013074328,"teacher_disagreement_score":0.007828078,"about_ca_system_score_codex":0.0017810906,"about_ca_system_score_gemma":0.0010013707,"threshold_uncertainty_score":0.02618754},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014292184,0.00038645728,0.1572776,0.003914265,0.0031392549,0.0009783787,0.12885593,0.115358554,0.58866036],"genre_scores_gemma":[0.007271635,0.001083302,0.07813937,0.0023484882,0.0005321062,0.0010637015,0.20532827,0.0898324,0.6144007],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838746,0.00028527572,0.00019552544,0.00026358012,0.00066511275,0.00020309706],"domain_scores_gemma":[0.9964923,0.0005217112,0.00015596436,0.0010883089,0.0013638701,0.00037784665],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018250453,0.003225621,0.0014836122,0.0030025195,0.0021450345,0.008159772,0.0040102075,0.003531192,0.5804596],"category_scores_gemma":[0.006771165,0.0019136791,0.0019828111,0.0046140575,0.0010817054,0.0084503,0.0036834073,0.0049084164,0.69715846],"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.00008084758,0.000054793185,0.00012886971,0.00021558965,0.000008156024,0.000067975394,0.0001718139,0.00033408427,0.002324029,0.011608815,0.9547795,0.030225458],"study_design_scores_gemma":[0.000020204967,0.000010074192,0.00020743425,0.000060478942,0.0000050414624,0.000060831917,0.00007669938,0.0007034027,0.0022577294,0.0025459249,0.9940247,0.000027467302],"about_ca_topic_score_codex":0.02470773,"about_ca_topic_score_gemma":0.02539597,"teacher_disagreement_score":0.5804596,"about_ca_system_score_codex":0.0041787187,"about_ca_system_score_gemma":0.0031270166,"threshold_uncertainty_score":0.5984235},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047509926,0.00046316106,0.10668458,0.008437116,0.0012520313,0.00016874316,0.043989036,0.029806815,0.8044475],"genre_scores_gemma":[0.085355304,0.0023075566,0.1088164,0.0024470636,0.0011684807,0.00045369525,0.0771561,0.035756484,0.68653893],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996927,0.000045691497,0.000019498942,0.0000683833,0.00013288294,0.00004085511],"domain_scores_gemma":[0.9984078,0.00060722535,0.00010096477,0.00040143784,0.00033056017,0.00015211504],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00052082544,0.0008955137,0.0008133352,0.0015711227,0.0008678226,0.004126047,0.0020389927,0.0010857577,0.51149],"category_scores_gemma":[0.0032790583,0.0006711957,0.00053924,0.0028748289,0.00066586287,0.00501944,0.0014898401,0.0023704523,0.3049635],"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.0000790296,0.000047603917,0.0002523014,0.00015644162,0.0000071290174,0.000045557725,0.000084942265,0.00057806453,0.0017107611,0.070621684,0.8688717,0.05754473],"study_design_scores_gemma":[0.00006834718,0.000031915362,0.0016372908,0.00008575591,0.000011474518,0.00025256223,0.00014482999,0.0075181182,0.0073378566,0.14871448,0.83414257,0.000054855893],"about_ca_topic_score_codex":0.004846771,"about_ca_topic_score_gemma":0.006669705,"teacher_disagreement_score":0.51149,"about_ca_system_score_codex":0.0016512194,"about_ca_system_score_gemma":0.00071231293,"threshold_uncertainty_score":0.69680023},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43043396,0.0041861543,0.359444,0.0070936508,0.0008669476,0.00017026514,0.0016936996,0.00067466777,0.19543655],"genre_scores_gemma":[0.8580073,0.002514012,0.11039887,0.0012989958,0.00086112705,0.00029806266,0.0015403744,0.0003804137,0.024700822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982712,0.00049615745,0.000108503795,0.00040060584,0.0003506382,0.00037285857],"domain_scores_gemma":[0.9877127,0.0064633377,0.001576909,0.0015699315,0.0011051506,0.001571999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017650528,0.0010674791,0.0016213183,0.002901862,0.0032704305,0.0067235217,0.003001268,0.002017626,0.007761917],"category_scores_gemma":[0.009045082,0.0011790993,0.0011304703,0.0051081795,0.00510151,0.009488716,0.002516865,0.0063197883,0.0009421989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048428024,0.000029525529,0.00046404597,0.00004501466,0.000005755884,0.000019269291,0.0001770498,0.002244548,0.00038925654,0.987542,0.0026730716,0.0063620154],"study_design_scores_gemma":[0.000012831833,0.0000072263438,0.00018940463,0.000017124708,0.00000649589,0.000043000182,0.00008644056,0.0059395027,0.0003003433,0.99059254,0.0027965629,0.000008618583],"about_ca_topic_score_codex":0.0024980844,"about_ca_topic_score_gemma":0.00248663,"teacher_disagreement_score":0.007761917,"about_ca_system_score_codex":0.0036714082,"about_ca_system_score_gemma":0.0015865217,"threshold_uncertainty_score":0.026638031},"labels":[],"label_agreement":null},{"id":"W205938674","doi":"","title":"On Splitting Graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.010916106129861767,"score_gpt":0.23568396285944945,"score_spread":0.22476785672958768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W205938674","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1021752,0.009505224,0.3186468,0.009879385,0.0015150468,0.00015262299,0.0022005374,0.0011998094,0.5547253],"genre_scores_gemma":[0.67584527,0.0075554475,0.14113429,0.0037191291,0.0018493467,0.00034470944,0.0055995076,0.001072667,0.16287966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916637,0.00024022207,0.000039633862,0.00019655423,0.00021137869,0.00014583663],"domain_scores_gemma":[0.9979215,0.0009823333,0.00015354589,0.0004973065,0.00020174758,0.00024346221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008660713,0.0008457364,0.0009378975,0.002297491,0.0020852229,0.0026787757,0.0013420001,0.0012819781,0.021220675],"category_scores_gemma":[0.0032133197,0.00059319765,0.0008418277,0.002585745,0.0022376997,0.007612462,0.0033688229,0.003719485,0.004232078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031063137,0.00003382532,0.00037973732,0.00008265534,0.000013999849,0.000050558156,0.00018198011,0.0012619835,0.00054633303,0.9476854,0.019579453,0.030153004],"study_design_scores_gemma":[0.000005984746,0.0000050846256,0.00019453731,0.000025241168,0.000006917907,0.000085828025,0.00008637045,0.0031078942,0.00025673586,0.98102313,0.015197729,0.000004542212],"about_ca_topic_score_codex":0.0011605275,"about_ca_topic_score_gemma":0.002297939,"teacher_disagreement_score":0.021220675,"about_ca_system_score_codex":0.0018362235,"about_ca_system_score_gemma":0.00056576537,"threshold_uncertainty_score":0.070990264},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08790352,0.016992887,0.709979,0.005725918,0.0012820825,0.00007717184,0.0013682924,0.00091189746,0.17575923],"genre_scores_gemma":[0.65574545,0.017903375,0.2435609,0.00434577,0.003612267,0.00020517336,0.003292636,0.0010269269,0.07030748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995839,0.00010082809,0.000019062947,0.00014014181,0.00010004363,0.00005595266],"domain_scores_gemma":[0.99867404,0.0006699892,0.00013747228,0.00021990667,0.00020578604,0.000092745126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006097078,0.0007966966,0.00066316593,0.0016545587,0.0010025272,0.0011189363,0.00079168315,0.00104524,0.0139052635],"category_scores_gemma":[0.0022252135,0.00032144666,0.0010781587,0.0025062738,0.0009804543,0.0033838267,0.0011345305,0.0022075253,0.0019797639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057583977,0.00008996982,0.0009031657,0.00054436544,0.000044621276,0.00029686233,0.00048923976,0.010090609,0.004905201,0.89540994,0.018849643,0.06831882],"study_design_scores_gemma":[0.000012467347,0.000060899794,0.0010543661,0.000061152496,0.00003774426,0.00034538558,0.00021635457,0.020259367,0.0013019957,0.92187685,0.054743733,0.000029738103],"about_ca_topic_score_codex":0.0012728822,"about_ca_topic_score_gemma":0.0015831429,"teacher_disagreement_score":0.0139052635,"about_ca_system_score_codex":0.0009585114,"about_ca_system_score_gemma":0.00030298496,"threshold_uncertainty_score":0.04651773},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6059786,0.00073177926,0.24836572,0.0027187287,0.00046061235,0.00022469721,0.0021618742,0.0011262087,0.13823181],"genre_scores_gemma":[0.85200816,0.00043710906,0.116650425,0.0006581475,0.00017756202,0.00015254415,0.002059799,0.00053665385,0.027319672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987155,0.00038930424,0.000057228026,0.00036667823,0.00020055647,0.00027059627],"domain_scores_gemma":[0.9930878,0.00361928,0.00038217133,0.0017060135,0.0005776782,0.00062704465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000982966,0.00070059363,0.0010713842,0.0014418433,0.002591831,0.004795802,0.0020107287,0.001995699,0.015770314],"category_scores_gemma":[0.0065750796,0.0009323281,0.0009201904,0.0019789387,0.001960022,0.0051012845,0.0024563838,0.002663603,0.0014604415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005479681,0.00024212406,0.0025259268,0.00017958895,0.00003430138,0.00012976142,0.00048136304,0.018597212,0.007597958,0.8971931,0.016752118,0.055718657],"study_design_scores_gemma":[0.000068958856,0.000050797247,0.00124373,0.000057085217,0.000051824234,0.00020540832,0.0003124936,0.05289263,0.0039253444,0.93170637,0.009456125,0.000029297225],"about_ca_topic_score_codex":0.0017375197,"about_ca_topic_score_gemma":0.0028799674,"teacher_disagreement_score":0.015770314,"about_ca_system_score_codex":0.0016284931,"about_ca_system_score_gemma":0.00095372845,"threshold_uncertainty_score":0.052756965},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89869225,0.0012568327,0.04123744,0.0057674176,0.0002489976,0.000058767262,0.0020267612,0.00036257293,0.05034905],"genre_scores_gemma":[0.9810626,0.0005238751,0.009576154,0.00026960118,0.0003872942,0.000057624755,0.000645317,0.00008917652,0.00738831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883014,0.00033588952,0.000055897348,0.0002592765,0.00024572678,0.0002731242],"domain_scores_gemma":[0.98858005,0.006609566,0.0021120447,0.0007539775,0.0005937959,0.0013504999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014037531,0.0007877268,0.0010601974,0.004149482,0.0022694904,0.0057389387,0.0020446125,0.0019689614,0.012149681],"category_scores_gemma":[0.007590409,0.00078413455,0.000585242,0.002877612,0.0044063255,0.0072861244,0.0017994582,0.002446271,0.00097117026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005743185,0.00016370109,0.0061566434,0.0002023813,0.00005229567,0.00016957213,0.0007905863,0.016184445,0.0057099513,0.9423093,0.009587476,0.018099325],"study_design_scores_gemma":[0.00010403197,0.00008275726,0.0033396455,0.00004663548,0.000047520596,0.00036976323,0.00035013922,0.041035417,0.0018248841,0.9481837,0.0045295353,0.00008605173],"about_ca_topic_score_codex":0.002321799,"about_ca_topic_score_gemma":0.0031051151,"teacher_disagreement_score":0.012149681,"about_ca_system_score_codex":0.0019874424,"about_ca_system_score_gemma":0.0009969396,"threshold_uncertainty_score":0.040644765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6891646,0.0061213076,0.240156,0.009878978,0.00039426395,0.00007258384,0.0013420279,0.0002359542,0.052634284],"genre_scores_gemma":[0.95704514,0.0018897805,0.033075087,0.0006578015,0.00056284934,0.00010629944,0.00062149606,0.00012031482,0.0059213038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99700063,0.0013195872,0.00017522484,0.000611836,0.0005284944,0.00036424547],"domain_scores_gemma":[0.974637,0.017296474,0.0023281344,0.0018785156,0.0012695069,0.00259033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040193712,0.0011469623,0.0020403932,0.0038405953,0.0033374464,0.006688658,0.0028460734,0.0022467193,0.005300107],"category_scores_gemma":[0.016700545,0.0013859873,0.0012704005,0.0048793615,0.008770631,0.019733172,0.006937521,0.005422974,0.0004192854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067340676,0.000021188675,0.0007487844,0.0000494942,0.00001312513,0.0000227193,0.00029854543,0.0015285095,0.00019979765,0.9929367,0.0010182728,0.00309544],"study_design_scores_gemma":[0.000013790769,0.00001844378,0.00050403905,0.000019717605,0.000013938568,0.000060820403,0.00013407,0.007222409,0.00015115456,0.9903274,0.0015163202,0.000017953596],"about_ca_topic_score_codex":0.0017775581,"about_ca_topic_score_gemma":0.0014914747,"teacher_disagreement_score":0.006688658,"about_ca_system_score_codex":0.0027946052,"about_ca_system_score_gemma":0.0010253731,"threshold_uncertainty_score":0.021256685},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78528106,0.0042264713,0.14586121,0.0070824875,0.00035915922,0.00005119861,0.0017858292,0.0002480538,0.055104554],"genre_scores_gemma":[0.97007835,0.0018165858,0.019692754,0.00048446862,0.00041744811,0.00007912851,0.0008190165,0.00007676014,0.0065354756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907637,0.0003412065,0.000047736015,0.00020264536,0.00020893468,0.00012309513],"domain_scores_gemma":[0.99303776,0.0039864094,0.00090364425,0.0006019124,0.00049258623,0.000977813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011095518,0.0006935869,0.001020425,0.002586215,0.0019783652,0.004630624,0.0017884909,0.0015018507,0.003986643],"category_scores_gemma":[0.0069750855,0.0007507732,0.000557816,0.003275759,0.003242123,0.007876006,0.0021052884,0.0027988383,0.00034786476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044038665,0.000016215914,0.0008370375,0.00004834483,0.000013199623,0.000023156119,0.00017802743,0.0033962296,0.0004141979,0.9875288,0.002067884,0.0054327627],"study_design_scores_gemma":[0.000010201716,0.00000829623,0.00046591903,0.00001264901,0.000007898369,0.000041554402,0.00007680003,0.01126964,0.00020853468,0.98580015,0.002085335,0.000012901971],"about_ca_topic_score_codex":0.0020456265,"about_ca_topic_score_gemma":0.0019144525,"teacher_disagreement_score":0.004630624,"about_ca_system_score_codex":0.002278218,"about_ca_system_score_gemma":0.0007927246,"threshold_uncertainty_score":0.016529739},"labels":[],"label_agreement":null},{"id":"W20746358","doi":"10.1136/bmj.2.560.342","title":"On the Three Color Ramsey Numbers R(Cm, C4, C4).","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.014315527967654854,"score_gpt":0.2322408990762624,"score_spread":0.21792537110860755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W20746358","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48802534,0.0044376487,0.12251793,0.013678733,0.0010122248,0.000101117126,0.001710946,0.00065931963,0.36785674],"genre_scores_gemma":[0.9277168,0.001699734,0.033651683,0.001630979,0.00048880844,0.00014692803,0.0009143346,0.00020897486,0.033541806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993024,0.00024802648,0.000025603282,0.00013637469,0.00011677289,0.00017086696],"domain_scores_gemma":[0.996431,0.0023562901,0.00035186464,0.00029462262,0.00019601706,0.00037029345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011633338,0.00063321926,0.0006377201,0.0013199477,0.002040605,0.0030755876,0.001327703,0.0015958514,0.014414207],"category_scores_gemma":[0.0050868713,0.00045796437,0.00054512464,0.0012610345,0.0028642986,0.006284599,0.0025204325,0.002585627,0.0018915551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014043621,0.000025244539,0.00035765124,0.00007399367,0.0000089002615,0.000048922087,0.00014047936,0.0034531069,0.000496112,0.97238207,0.013247234,0.00962576],"study_design_scores_gemma":[0.00003187195,0.000014494291,0.00041970113,0.000034797264,0.000009846145,0.00009436919,0.00015062519,0.009309097,0.0003881958,0.98298454,0.0065429816,0.000019600155],"about_ca_topic_score_codex":0.00209372,"about_ca_topic_score_gemma":0.0027389263,"teacher_disagreement_score":0.014414207,"about_ca_system_score_codex":0.0018260942,"about_ca_system_score_gemma":0.00086761016,"threshold_uncertainty_score":0.048220396},"labels":[],"label_agreement":null},{"id":"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011321582,0.18407243,0.0108259665,0.10798944,0.5849995,0.00029975045,0.005923131,0.0005457104,0.104211904],"genre_scores_gemma":[0.012752154,0.14161895,0.012638305,0.026119042,0.24859756,0.00032103944,0.010893238,0.0019712364,0.5450886],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99855846,0.00015036868,0.00007287531,0.00024687088,0.00081343524,0.00015801137],"domain_scores_gemma":[0.99363756,0.001187026,0.00018613528,0.0002116574,0.00378742,0.0009901832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020243959,0.0025122843,0.002766726,0.0052358033,0.002573781,0.005687436,0.0023506058,0.0028279219,0.10797585],"category_scores_gemma":[0.005911666,0.00055094156,0.0015542745,0.008531309,0.00073140964,0.0039060423,0.0015560004,0.0035179532,0.049601696],"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.0000240644,0.00001313913,0.00003372309,0.00015528235,0.0000059131216,0.000011848058,0.0000055825008,0.00015009286,0.00007882343,0.00085264386,0.97985166,0.018817285],"study_design_scores_gemma":[0.000024833093,0.000018393943,0.00069346593,0.0003308169,0.00002539151,0.000057018286,0.000039245053,0.0005220696,0.00024838935,0.0034760605,0.99454004,0.000024226114],"about_ca_topic_score_codex":0.024214476,"about_ca_topic_score_gemma":0.051591862,"teacher_disagreement_score":0.10797585,"about_ca_system_score_codex":0.007985886,"about_ca_system_score_gemma":0.0040055574,"threshold_uncertainty_score":0.36121517},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07106001,0.2860402,0.28907305,0.016096938,0.002994107,0.00014132878,0.0016258322,0.0006157225,0.3323528],"genre_scores_gemma":[0.4652889,0.24261862,0.22650896,0.0061777225,0.0075811325,0.00030654142,0.0027306643,0.0007149897,0.04807244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884486,0.00034080909,0.00009822896,0.00029982132,0.00031271536,0.00010355661],"domain_scores_gemma":[0.998055,0.001165597,0.00014197832,0.0002889003,0.00022674486,0.00012183641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021791852,0.00065675675,0.0014439946,0.0040059797,0.0028138892,0.004175686,0.0017258594,0.0015805268,0.008878842],"category_scores_gemma":[0.0042612096,0.00078446674,0.0008419352,0.0103121195,0.0031277358,0.010259413,0.0024575666,0.003278296,0.0019048986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023569773,0.0000320127,0.00039111826,0.00030566333,0.000009012959,0.000029425799,0.00015133395,0.0007640895,0.00019527372,0.9391362,0.00669354,0.052268673],"study_design_scores_gemma":[0.000010492456,0.000021564732,0.00042372622,0.0001818762,0.000014854434,0.00023802616,0.000108248256,0.002063916,0.00024603156,0.91912323,0.0775422,0.000025915959],"about_ca_topic_score_codex":0.0011720753,"about_ca_topic_score_gemma":0.0013745944,"teacher_disagreement_score":0.008878842,"about_ca_system_score_codex":0.0022575927,"about_ca_system_score_gemma":0.0013643432,"threshold_uncertainty_score":0.029702723},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25697446,0.0074842763,0.55817264,0.007551318,0.00090074644,0.0003511396,0.004528152,0.0038673773,0.1601699],"genre_scores_gemma":[0.65943193,0.0035582706,0.30302703,0.00229762,0.0010450496,0.00065749296,0.005056449,0.00176419,0.023161927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99665004,0.0009670808,0.00015245173,0.0006530258,0.0009163702,0.00066102436],"domain_scores_gemma":[0.977193,0.015348915,0.0009332948,0.0033923092,0.0016780718,0.0014543824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003987649,0.0024854299,0.0024767984,0.0029549513,0.0030310927,0.0063103116,0.00505162,0.0027494559,0.017124865],"category_scores_gemma":[0.018116059,0.001671635,0.0017498129,0.0038253574,0.003528292,0.01205562,0.0067148623,0.0069064316,0.0042723683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012051036,0.0004420336,0.0032160177,0.00075023907,0.000082756545,0.00022622148,0.0011313384,0.058442667,0.014052636,0.81137645,0.03598348,0.073091],"study_design_scores_gemma":[0.00011546709,0.00015503367,0.0017995982,0.00018108117,0.00016085905,0.000412049,0.00038392306,0.19694309,0.01126271,0.77022284,0.018239105,0.00012424025],"about_ca_topic_score_codex":0.0022100967,"about_ca_topic_score_gemma":0.004228414,"teacher_disagreement_score":0.017124865,"about_ca_system_score_codex":0.0047518164,"about_ca_system_score_gemma":0.0026697945,"threshold_uncertainty_score":0.05728835},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5898884,0.008626578,0.32745957,0.018395998,0.0007406167,0.00007554643,0.0020082183,0.0002513888,0.052553702],"genre_scores_gemma":[0.9619127,0.0027372064,0.028188802,0.0007716777,0.0010205439,0.0001189801,0.0004984978,0.00007533502,0.004676186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776614,0.0009426908,0.00012016591,0.0004630861,0.00047417273,0.00023375842],"domain_scores_gemma":[0.98355377,0.0102299,0.0017379139,0.001530671,0.0009656781,0.0019821886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002688369,0.001043551,0.001781874,0.003822867,0.0027293323,0.006597327,0.0022690594,0.0018688287,0.00383732],"category_scores_gemma":[0.012504223,0.0011231374,0.0010102652,0.004286325,0.007526846,0.015475289,0.0048034065,0.0045544445,0.00028830834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003323353,0.000011603464,0.00055878394,0.000043454416,0.000013851523,0.00001730361,0.00013178166,0.0015166554,0.00018535892,0.9932892,0.0011439312,0.0030549373],"study_design_scores_gemma":[0.0000078431085,0.000008650916,0.00031856223,0.000010926756,0.000008701788,0.000041338928,0.0000601194,0.006273679,0.00009623375,0.991767,0.0013966666,0.000010291438],"about_ca_topic_score_codex":0.0011058289,"about_ca_topic_score_gemma":0.000948118,"teacher_disagreement_score":0.006597327,"about_ca_system_score_codex":0.0025291569,"about_ca_system_score_gemma":0.00084913964,"threshold_uncertainty_score":0.018350422},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83231103,0.00081072113,0.07173549,0.0030505657,0.00028815525,0.00011313955,0.002036646,0.0005623668,0.08909191],"genre_scores_gemma":[0.96215326,0.0003345161,0.027408406,0.00042460242,0.00007015537,0.00004522061,0.0008484625,0.00006829717,0.008647049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918205,0.00023775181,0.000046962017,0.00019816602,0.00009583806,0.00023924364],"domain_scores_gemma":[0.99774903,0.0009413173,0.00028505307,0.000404792,0.00022834605,0.00039140228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050885737,0.00038917494,0.00055090693,0.0005803057,0.0016321229,0.0017568417,0.0008758912,0.0007678933,0.015319498],"category_scores_gemma":[0.0020347685,0.0004339147,0.00045765802,0.001215388,0.0013102675,0.002231046,0.001511784,0.0010183307,0.0014460476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002949223,0.00038289643,0.013583767,0.0009485792,0.0001721311,0.0008428671,0.00087422674,0.0359301,0.047531072,0.7775669,0.029913837,0.089304425],"study_design_scores_gemma":[0.00040102575,0.00028489195,0.0073365974,0.00017820297,0.00012243753,0.0008706618,0.0016221497,0.051627457,0.03731981,0.8457522,0.054387473,0.00009702052],"about_ca_topic_score_codex":0.0029921376,"about_ca_topic_score_gemma":0.0031670388,"teacher_disagreement_score":0.015319498,"about_ca_system_score_codex":0.0015018893,"about_ca_system_score_gemma":0.000523348,"threshold_uncertainty_score":0.05124885},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49968377,0.0027460244,0.39440152,0.010965964,0.00031278338,0.00013904784,0.0016461303,0.00049824687,0.089606516],"genre_scores_gemma":[0.92005605,0.0010602839,0.06420592,0.0008385513,0.000291196,0.00017798043,0.0011918388,0.00017520659,0.012002927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990362,0.00038450336,0.000029539671,0.0002477179,0.00014216862,0.00015993457],"domain_scores_gemma":[0.9875284,0.00989166,0.0006746079,0.0008683468,0.00035879645,0.0006782235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017083733,0.00039220345,0.0012740005,0.0012028477,0.0019718627,0.002505946,0.0022667958,0.001709429,0.009506389],"category_scores_gemma":[0.016231561,0.0006872532,0.00087368605,0.0017285075,0.0029485365,0.0064421725,0.0019484579,0.0028883175,0.00070812803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030182424,0.00012067989,0.0027932858,0.00023472247,0.000049646478,0.00007897371,0.00026087996,0.042111464,0.001281722,0.9192532,0.013459164,0.020054555],"study_design_scores_gemma":[0.00006724787,0.00003170711,0.0010072824,0.00003286197,0.000026060101,0.000078902325,0.000089322995,0.10348118,0.0007873392,0.8919864,0.0023912191,0.000020470596],"about_ca_topic_score_codex":0.0016068285,"about_ca_topic_score_gemma":0.0030822325,"teacher_disagreement_score":0.009506389,"about_ca_system_score_codex":0.0017569857,"about_ca_system_score_gemma":0.0008848023,"threshold_uncertainty_score":0.031802},"labels":[],"label_agreement":null},{"id":"W2099183157","doi":"","title":"Equitable chromatic threshold of direct products of complete graphs","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics","score_opus":0.01800581702827371,"score_gpt":0.2235108729910736,"score_spread":0.2055050559627999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099183157","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91207063,0.00042335744,0.048490286,0.00095531216,0.00003915022,0.000042565793,0.0006990166,0.00026872894,0.03701094],"genre_scores_gemma":[0.98082274,0.00022554476,0.010430228,0.0001486189,0.000055390374,0.00006293532,0.00064634695,0.0001461753,0.0074619753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980806,0.00044668026,0.000100923506,0.00054151524,0.0004090272,0.0004212568],"domain_scores_gemma":[0.98653793,0.008579846,0.0012624154,0.001262602,0.00070375256,0.0016535639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016440277,0.0007385278,0.0015460683,0.0024790897,0.0023821013,0.007099107,0.0028803058,0.0016520276,0.0125676105],"category_scores_gemma":[0.009688806,0.0012437855,0.0007243773,0.0022828782,0.0031227295,0.0074881357,0.0030947323,0.0028839302,0.0008349196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044530787,0.00015300672,0.003835786,0.00017371813,0.000042107604,0.00017020613,0.0008556143,0.013386523,0.006113086,0.9599358,0.003836785,0.011052126],"study_design_scores_gemma":[0.00006819289,0.00005046147,0.002056931,0.00003997591,0.000044214958,0.0002579399,0.00042725596,0.051017214,0.003899275,0.93957615,0.0025300996,0.00003216023],"about_ca_topic_score_codex":0.0021594185,"about_ca_topic_score_gemma":0.0031153697,"teacher_disagreement_score":0.0125676105,"about_ca_system_score_codex":0.002970572,"about_ca_system_score_gemma":0.00096133875,"threshold_uncertainty_score":0.04204285},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64480555,0.00053770543,0.2653503,0.0014522097,0.00016741734,0.00008999008,0.0004359318,0.00031775897,0.086843126],"genre_scores_gemma":[0.9752119,0.00024103739,0.014058284,0.00011635958,0.00012602378,0.000036215046,0.00026070778,0.000056193916,0.009893205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936694,0.00014125867,0.000025099636,0.00010761089,0.00021685465,0.00014225853],"domain_scores_gemma":[0.99690837,0.0014913518,0.00043515762,0.0002697007,0.0005124887,0.00038293924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005252991,0.00033476655,0.00037695057,0.001545128,0.00078078813,0.0016921125,0.000653302,0.00043953842,0.006167694],"category_scores_gemma":[0.0038686488,0.00025411157,0.0003611238,0.001179283,0.0013868832,0.001453011,0.0010722531,0.001065938,0.00045525254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038216145,0.000034187677,0.0009648366,0.000028649718,0.000007814162,0.00008087643,0.00017530592,0.007467047,0.0017907064,0.97964716,0.0028770014,0.0068881433],"study_design_scores_gemma":[0.00001973244,0.000024086525,0.0010943379,0.000015241507,0.000008056457,0.00013714217,0.00015696055,0.0960706,0.001284913,0.8971689,0.00400042,0.000019689056],"about_ca_topic_score_codex":0.0016225491,"about_ca_topic_score_gemma":0.0017365796,"teacher_disagreement_score":0.006167694,"about_ca_system_score_codex":0.0013689408,"about_ca_system_score_gemma":0.00057480234,"threshold_uncertainty_score":0.020632923},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7199883,0.0019516185,0.20378216,0.005352996,0.00041392684,0.000093823415,0.00072160736,0.0005955603,0.06710004],"genre_scores_gemma":[0.94066375,0.0011162494,0.037553716,0.00058092957,0.00043648633,0.0001229947,0.0005220569,0.00022139109,0.01878258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987746,0.00042962184,0.0000659265,0.00029105728,0.00020913508,0.00022950952],"domain_scores_gemma":[0.99169147,0.005618772,0.0006483485,0.0006979639,0.00037346067,0.00096998014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016385698,0.00083935313,0.0013265521,0.0028666123,0.0036353094,0.0057351333,0.0023356425,0.0018850438,0.007929152],"category_scores_gemma":[0.0075581027,0.0010501452,0.0010074654,0.0027180172,0.004884008,0.011495637,0.0032613687,0.0036704717,0.0006845252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057757632,0.000040586987,0.00036864847,0.000060782837,0.000007760787,0.000028040202,0.00018889314,0.0025854423,0.00040772252,0.9879853,0.0015596144,0.006709344],"study_design_scores_gemma":[0.000010111368,0.0000035372523,0.00007597642,0.000010840077,0.000006542614,0.000029718625,0.000073084426,0.0052720318,0.0002787514,0.99341667,0.0008163299,0.0000064885044],"about_ca_topic_score_codex":0.001270216,"about_ca_topic_score_gemma":0.001577957,"teacher_disagreement_score":0.007929152,"about_ca_system_score_codex":0.0020960316,"about_ca_system_score_gemma":0.0009318171,"threshold_uncertainty_score":0.026525617},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87930846,0.00062252145,0.023007052,0.0013634829,0.00006949615,0.000067964334,0.0018669795,0.0004653839,0.09322865],"genre_scores_gemma":[0.98240983,0.00023970137,0.010847049,0.00015866489,0.000028353143,0.000034896988,0.00090089184,0.00003575952,0.0053449175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972683,0.000030004014,0.000011722722,0.000059442176,0.000071857714,0.0001002134],"domain_scores_gemma":[0.9990885,0.0002903859,0.00016026497,0.00013449846,0.00013738041,0.00018896673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015529494,0.00028207683,0.0003101072,0.0009574618,0.0021364081,0.0011066687,0.00067249895,0.00058312336,0.007272438],"category_scores_gemma":[0.0010654427,0.00035232858,0.00033661377,0.0013144717,0.0009271955,0.0010821677,0.0009350712,0.0010111622,0.0003280431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000531844,0.000099683,0.010005645,0.00046300105,0.00003989189,0.0017347852,0.0013182253,0.015351181,0.016732933,0.8761404,0.019561049,0.058021367],"study_design_scores_gemma":[0.00017509877,0.00008805838,0.012629555,0.00008852815,0.00005815266,0.002527887,0.0012267953,0.06930884,0.011824974,0.8466006,0.055376973,0.000094417184],"about_ca_topic_score_codex":0.007896679,"about_ca_topic_score_gemma":0.012166668,"teacher_disagreement_score":0.007896679,"about_ca_system_score_codex":0.0014360893,"about_ca_system_score_gemma":0.0008524404,"threshold_uncertainty_score":0.024328768},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3625937,0.0008476348,0.5390951,0.011059417,0.00067224994,0.00022323822,0.0026987612,0.0018293659,0.08098053],"genre_scores_gemma":[0.74516225,0.0006964701,0.22571783,0.002613288,0.000582294,0.00034066508,0.0034411498,0.00081056193,0.020635542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99723035,0.00073142175,0.00021853209,0.00077338854,0.0005355255,0.0005107885],"domain_scores_gemma":[0.9746902,0.01775134,0.0011363089,0.0032625508,0.001426573,0.0017329218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022132094,0.00068726565,0.0018014644,0.0016515817,0.0033813252,0.005211563,0.0024014327,0.0045915204,0.013657728],"category_scores_gemma":[0.019297006,0.0010303588,0.001188481,0.0025909706,0.003806076,0.013042679,0.0046406696,0.0066171666,0.002119362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057440053,0.00016287925,0.0011807636,0.00021163707,0.000022019274,0.00012292778,0.00048325944,0.004086524,0.0069619566,0.9458808,0.01260734,0.02770547],"study_design_scores_gemma":[0.00008570677,0.00005500015,0.00045148598,0.000039780032,0.000025040166,0.00017304791,0.00024046755,0.017250566,0.004109651,0.97014093,0.007397163,0.0000311139],"about_ca_topic_score_codex":0.0016008423,"about_ca_topic_score_gemma":0.0018176481,"teacher_disagreement_score":0.013657728,"about_ca_system_score_codex":0.002521273,"about_ca_system_score_gemma":0.0018054415,"threshold_uncertainty_score":0.045689642},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4795369,0.0015792978,0.40328673,0.008150618,0.00030677876,0.00014904351,0.0021662666,0.00070802274,0.104116194],"genre_scores_gemma":[0.875189,0.0011273526,0.09810476,0.0014076905,0.00033541993,0.00020618952,0.001906826,0.00032330595,0.021399429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985911,0.0005690404,0.000070300935,0.00027712013,0.00027113702,0.00022115634],"domain_scores_gemma":[0.9855299,0.009072763,0.0015604293,0.0017113547,0.0008277426,0.0012977098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013009253,0.0008345632,0.0015201168,0.0020425012,0.003019202,0.00366421,0.0022731556,0.0026106578,0.008267636],"category_scores_gemma":[0.010608127,0.0011033088,0.0008346448,0.0027801543,0.0035473038,0.008526076,0.003248431,0.0034454293,0.00074559223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000665102,0.000027889655,0.000538828,0.00006271607,0.000008412687,0.000046238987,0.00016602763,0.004302644,0.00048258188,0.98618454,0.0031319915,0.0049816817],"study_design_scores_gemma":[0.0000124448625,0.000007157519,0.0002814719,0.000021387714,0.0000057989787,0.000052549356,0.00007906374,0.014156363,0.00019188624,0.9837271,0.0014567437,0.00000804826],"about_ca_topic_score_codex":0.0047319494,"about_ca_topic_score_gemma":0.0052245446,"teacher_disagreement_score":0.008267636,"about_ca_system_score_codex":0.0023665822,"about_ca_system_score_gemma":0.001110249,"threshold_uncertainty_score":0.027657986},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4737597,0.0010826897,0.49016637,0.0012493549,0.00012276304,0.00015224438,0.0015567695,0.0012063351,0.030703852],"genre_scores_gemma":[0.8351345,0.0006032467,0.15150808,0.00040065197,0.00013282329,0.00018205158,0.0016292089,0.00035309093,0.010056337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736613,0.0007183994,0.00018764746,0.00067906594,0.00057031633,0.0004784378],"domain_scores_gemma":[0.9916855,0.0033901148,0.0009723848,0.0025332908,0.0006540313,0.0007648209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017648201,0.00067737495,0.0007784483,0.0011947904,0.0016373923,0.0024353294,0.0017845018,0.0011669802,0.0038824915],"category_scores_gemma":[0.010475737,0.00067014736,0.0011570184,0.0015925574,0.002397487,0.0054559177,0.0029197827,0.002440353,0.0006388909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000531366,0.00007888151,0.002174872,0.00019904212,0.000043488664,0.00022811108,0.0015097461,0.06871396,0.011036183,0.85721666,0.0046061273,0.053661637],"study_design_scores_gemma":[0.000030828465,0.000091876405,0.0008468504,0.00004387069,0.000032916494,0.00019214413,0.00028061352,0.08108331,0.0043727127,0.9035863,0.009391618,0.000046989597],"about_ca_topic_score_codex":0.0023746702,"about_ca_topic_score_gemma":0.0029444923,"teacher_disagreement_score":0.0038824915,"about_ca_system_score_codex":0.0016349762,"about_ca_system_score_gemma":0.00067663396,"threshold_uncertainty_score":0.012988269},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12589943,0.0006996705,0.83337885,0.0009190407,0.00050334184,0.0002562731,0.0008490287,0.0015402084,0.035954185],"genre_scores_gemma":[0.45661375,0.0004990042,0.5209112,0.00035973336,0.000119563636,0.00019178276,0.00243969,0.0010862075,0.01777908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991732,0.00016366843,0.0000456543,0.00031013053,0.00020966858,0.000097661934],"domain_scores_gemma":[0.9966744,0.001759858,0.00015950916,0.000915313,0.00034358562,0.0001472857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006926496,0.0006057061,0.0005480852,0.0012017104,0.00076697953,0.0017493316,0.0015330936,0.0011102643,0.0060612927],"category_scores_gemma":[0.003578034,0.000796459,0.0013667268,0.0010906387,0.0014977896,0.002430403,0.0024626262,0.0022752783,0.0013439301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016732252,0.00009840211,0.0013452072,0.00043820715,0.000032982087,0.00030413733,0.0009128933,0.014079774,0.025195988,0.72905797,0.012434165,0.21593297],"study_design_scores_gemma":[0.00003598306,0.00003775771,0.00047830355,0.000055182154,0.00003093777,0.000310861,0.00015011441,0.039247867,0.016270969,0.92536557,0.017986778,0.000029729501],"about_ca_topic_score_codex":0.00039358233,"about_ca_topic_score_gemma":0.0007269966,"teacher_disagreement_score":0.0060612927,"about_ca_system_score_codex":0.00086450815,"about_ca_system_score_gemma":0.0005001969,"threshold_uncertainty_score":0.020277023},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6070524,0.013219998,0.24805945,0.007725345,0.0008472596,0.00009729574,0.0012630884,0.00048814507,0.121247046],"genre_scores_gemma":[0.9542269,0.0033825694,0.03158363,0.00035619887,0.0011391615,0.00013452262,0.0004900676,0.00014472513,0.0085422695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880826,0.00026946506,0.00008748074,0.00032145024,0.0003413178,0.00017198855],"domain_scores_gemma":[0.99365777,0.003445378,0.0010105511,0.00086968613,0.0003286551,0.00068792555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013485394,0.0007445985,0.0008588249,0.0036594933,0.0015511004,0.0040236055,0.0015168604,0.0012847161,0.0039791013],"category_scores_gemma":[0.0071041165,0.00032974567,0.0005226727,0.0043673385,0.007133938,0.0123929735,0.0025651765,0.0028393096,0.000477402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002170999,0.000019604273,0.0010090711,0.000041282918,0.000006714911,0.000029986137,0.0002804592,0.0013139719,0.00055701914,0.9846698,0.0010382549,0.011012244],"study_design_scores_gemma":[0.0000042236497,0.00001790195,0.0008170108,0.000013531104,0.000006451817,0.000092439564,0.00019220474,0.0027410786,0.00063964067,0.98981583,0.0056426055,0.000017110531],"about_ca_topic_score_codex":0.000680626,"about_ca_topic_score_gemma":0.0005563786,"teacher_disagreement_score":0.0040236055,"about_ca_system_score_codex":0.0017156008,"about_ca_system_score_gemma":0.00043306206,"threshold_uncertainty_score":0.013311386},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23340939,0.0013968224,0.58170176,0.0049690898,0.0003190584,0.00032534506,0.005565271,0.0007620775,0.17155115],"genre_scores_gemma":[0.76337874,0.0012888152,0.15277591,0.001356638,0.0003545121,0.0004145214,0.0077944226,0.0005223412,0.07211406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935156,0.00017952797,0.000024331528,0.00023504173,0.00012617128,0.00008339643],"domain_scores_gemma":[0.99736625,0.0012025427,0.00024775445,0.00063385593,0.00030784152,0.00024182558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043693543,0.0005817406,0.00076520693,0.0010744869,0.0013441811,0.0020187476,0.001330754,0.0011386203,0.01847664],"category_scores_gemma":[0.003734205,0.0005433648,0.0006426735,0.0016470811,0.0009429052,0.0033276505,0.0016682295,0.002091995,0.001780509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008947089,0.00006560842,0.0010487578,0.00015850317,0.000028438386,0.0001003614,0.00015641771,0.0080955895,0.0033617439,0.93553025,0.015057141,0.036307752],"study_design_scores_gemma":[0.000019113311,0.000012176349,0.000737582,0.0000281642,0.00002143118,0.00018055567,0.00010600632,0.026254121,0.0019595467,0.9514608,0.019211192,0.000009433736],"about_ca_topic_score_codex":0.0010928379,"about_ca_topic_score_gemma":0.001879528,"teacher_disagreement_score":0.01847664,"about_ca_system_score_codex":0.0009268753,"about_ca_system_score_gemma":0.00064848515,"threshold_uncertainty_score":0.061810493},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8657907,0.00035616415,0.09084508,0.0011955654,0.000112351816,0.000044384182,0.00095125183,0.0004771481,0.040227287],"genre_scores_gemma":[0.98907346,0.000076494915,0.008519708,0.00008268242,0.000061798666,0.000034668654,0.0003526466,0.000027522708,0.0017710704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985361,0.0003075214,0.00008786302,0.0004903332,0.00036070973,0.0002175224],"domain_scores_gemma":[0.97785985,0.015843088,0.002107765,0.0020478042,0.000726164,0.001415297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010958894,0.00037219338,0.0004365903,0.0017286909,0.00118709,0.0019636482,0.0010053009,0.0010711229,0.006325618],"category_scores_gemma":[0.009345784,0.0003321787,0.00046135357,0.0013386441,0.0030296505,0.0048332,0.0020709776,0.0015938872,0.0005512063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003035341,0.00007549007,0.006378202,0.00011721338,0.000019900226,0.00017727206,0.0003002978,0.010985606,0.008143553,0.9512058,0.0025808706,0.019712292],"study_design_scores_gemma":[0.000036817317,0.000057427074,0.0021935022,0.000017538589,0.000026284912,0.0004806614,0.000096900294,0.034625463,0.007676982,0.95072687,0.0040340754,0.000027470272],"about_ca_topic_score_codex":0.00029851776,"about_ca_topic_score_gemma":0.0003081791,"teacher_disagreement_score":0.006325618,"about_ca_system_score_codex":0.0011491304,"about_ca_system_score_gemma":0.00047416813,"threshold_uncertainty_score":0.021161377},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023929237,0.00045038262,0.19613452,0.0065683047,0.001285132,0.00027530995,0.11157249,0.10106266,0.58025825],"genre_scores_gemma":[0.041911695,0.002166267,0.18224671,0.002646795,0.000872996,0.0007990072,0.17499395,0.106653824,0.4877087],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996026,0.00007743172,0.000033242715,0.00007575547,0.00016433855,0.00004663191],"domain_scores_gemma":[0.9984958,0.00044857268,0.00010509248,0.00036663358,0.00042894395,0.00015484364],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007175328,0.0012200164,0.00085860724,0.0021701388,0.00088156166,0.0042848317,0.00244845,0.0013673231,0.55838346],"category_scores_gemma":[0.003255442,0.00087747374,0.000873674,0.0037982373,0.00067567604,0.0048720553,0.0019721563,0.0026795326,0.4042349],"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.000053745334,0.000028749346,0.00013100427,0.00019978739,0.000008095294,0.00003727616,0.00010418049,0.00035044306,0.0013008879,0.05933649,0.893924,0.04452528],"study_design_scores_gemma":[0.000042731386,0.000013524851,0.00049273885,0.00006427803,0.000006976805,0.00012196838,0.00006925281,0.0024744845,0.003463108,0.043329217,0.9498855,0.000036216232],"about_ca_topic_score_codex":0.0070719775,"about_ca_topic_score_gemma":0.0077963853,"teacher_disagreement_score":0.55838346,"about_ca_system_score_codex":0.0021193086,"about_ca_system_score_gemma":0.0012978882,"threshold_uncertainty_score":0.6299124},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6098542,0.026672158,0.14819142,0.026825497,0.0031460633,0.00012176469,0.0021838788,0.000562386,0.18244265],"genre_scores_gemma":[0.956033,0.0054112556,0.023975061,0.0013144681,0.0021933839,0.00011870638,0.00064364605,0.00018064381,0.0101297945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891067,0.00028825813,0.000057485653,0.0002449826,0.00030574822,0.0001928374],"domain_scores_gemma":[0.9966815,0.0017234327,0.00032025197,0.00030905634,0.00033935625,0.00062645087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010188115,0.00073822873,0.0009048807,0.003180888,0.0020299116,0.0030866398,0.0007961998,0.00078337383,0.0039084805],"category_scores_gemma":[0.0049581784,0.00055673247,0.00049818365,0.0027261646,0.0038563781,0.005021331,0.0030202917,0.002672964,0.0006143721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049542352,0.000020251715,0.0008652341,0.00007161283,0.000020505566,0.000054768247,0.00028570788,0.003448491,0.0010631438,0.96599513,0.014368075,0.013757514],"study_design_scores_gemma":[0.000009940148,0.000020760122,0.0010134884,0.000029593839,0.000010888564,0.00013424997,0.00010342779,0.009382323,0.0005261164,0.9712577,0.017480928,0.00003063504],"about_ca_topic_score_codex":0.001332536,"about_ca_topic_score_gemma":0.0011659602,"teacher_disagreement_score":0.0039084805,"about_ca_system_score_codex":0.002161608,"about_ca_system_score_gemma":0.00053204264,"threshold_uncertainty_score":0.015683651},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16153659,0.01114087,0.49841118,0.014972535,0.0014754538,0.0001231555,0.0015460877,0.00029266634,0.31050146],"genre_scores_gemma":[0.80743015,0.006567882,0.14125368,0.0025236495,0.0014694629,0.0003458315,0.00073225243,0.00017921443,0.039497912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990189,0.0002918646,0.000048239686,0.00022975709,0.00022280207,0.00018840565],"domain_scores_gemma":[0.99351877,0.004752241,0.0004034163,0.00042003143,0.00045223458,0.00045337202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027603135,0.00092711026,0.0011483495,0.003961322,0.0027890098,0.004099999,0.0022694536,0.002342516,0.009767287],"category_scores_gemma":[0.010810914,0.0006108688,0.0011520573,0.003458179,0.00511272,0.009008174,0.0029335413,0.00633609,0.0009326209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019255602,0.0000064479364,0.000084429834,0.000026313992,0.0000031790428,0.000011020703,0.000058405923,0.0010773189,0.00019913816,0.994436,0.001220922,0.002857572],"study_design_scores_gemma":[0.000008852617,0.0000046256177,0.00016900932,0.00002116144,0.000005289397,0.000023551345,0.0000362941,0.007775107,0.00019958596,0.98855394,0.0031909887,0.000011596464],"about_ca_topic_score_codex":0.0034125242,"about_ca_topic_score_gemma":0.0036622693,"teacher_disagreement_score":0.009767287,"about_ca_system_score_codex":0.0048537906,"about_ca_system_score_gemma":0.0013785115,"threshold_uncertainty_score":0.035216868},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9520979,0.00025300612,0.03787316,0.00028008161,0.00003194275,0.000029831244,0.0002752373,0.00010690888,0.009052021],"genre_scores_gemma":[0.9905144,0.0001279644,0.008025277,0.000044996865,0.00003725614,0.000022497241,0.000270857,0.000021519985,0.00093514175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992143,0.00014565972,0.00005551491,0.00026722357,0.0001674534,0.00014980508],"domain_scores_gemma":[0.9953524,0.0016791717,0.0009278176,0.00043025118,0.00062839745,0.0009820424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005943918,0.00035948996,0.0005970215,0.0016449507,0.0011712963,0.0012189855,0.0006479177,0.0007089049,0.0025958566],"category_scores_gemma":[0.0038092537,0.0003621819,0.0005364681,0.0008238189,0.0013947989,0.0021727176,0.0011187003,0.0006944722,0.00019656836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014709382,0.000268201,0.07407064,0.00079423323,0.00026053097,0.002357728,0.0026937132,0.060745545,0.10111825,0.6909609,0.0067679007,0.058491442],"study_design_scores_gemma":[0.00010192372,0.00073893985,0.053174786,0.00011333712,0.00021702272,0.0054251524,0.0016020997,0.28672332,0.032673497,0.6039312,0.015127424,0.00017129756],"about_ca_topic_score_codex":0.00071835215,"about_ca_topic_score_gemma":0.000688489,"teacher_disagreement_score":0.0025958566,"about_ca_system_score_codex":0.00069010863,"about_ca_system_score_gemma":0.00029090844,"threshold_uncertainty_score":0.0086839795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81946194,0.0008030921,0.1065526,0.0016301916,0.00028622357,0.000068337016,0.00044444043,0.0004027094,0.07035055],"genre_scores_gemma":[0.935085,0.0006450055,0.04604249,0.00028940558,0.00009174736,0.00007338095,0.00041927863,0.00020081805,0.0171529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994147,0.00018482083,0.000034685992,0.0000973446,0.00012545081,0.00014298403],"domain_scores_gemma":[0.99823207,0.0008208127,0.00021223637,0.00029357692,0.00020006577,0.000241278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053641596,0.0005018773,0.0007845998,0.001243381,0.0016020135,0.002724112,0.0012122517,0.0010547985,0.0059786295],"category_scores_gemma":[0.0030170484,0.00075634883,0.0007075904,0.0013277688,0.0018183144,0.0030814575,0.002168769,0.0015183527,0.00072000147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014366065,0.00003859471,0.0009956585,0.00007416162,0.00001739124,0.00012687697,0.0003952837,0.0109555125,0.004135291,0.9676302,0.00292992,0.012557366],"study_design_scores_gemma":[0.00004240469,0.000017996761,0.00054149725,0.00002802546,0.000019216684,0.0001104836,0.00040339737,0.026750803,0.0019992245,0.9653791,0.0046839607,0.000023889814],"about_ca_topic_score_codex":0.0024119136,"about_ca_topic_score_gemma":0.004712405,"teacher_disagreement_score":0.0059786295,"about_ca_system_score_codex":0.0017244009,"about_ca_system_score_gemma":0.0006280129,"threshold_uncertainty_score":0.020000577},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9554836,0.0002135819,0.03204749,0.0006004299,0.000029748688,0.000015196492,0.000101073456,0.00011156871,0.011397478],"genre_scores_gemma":[0.99295145,0.00010895249,0.005115247,0.00005353935,0.00003630958,0.000014202895,0.00011221007,0.00003523507,0.001572882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995332,0.00014217653,0.000026223277,0.000098127864,0.00010269295,0.00009762317],"domain_scores_gemma":[0.995659,0.0018985437,0.0009326124,0.000520812,0.00027864563,0.0007104021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079654466,0.00040517305,0.00048085355,0.001696252,0.0010516384,0.0014824513,0.00060020795,0.00067288295,0.0020787506],"category_scores_gemma":[0.0041091447,0.00029615214,0.00044557612,0.00081551983,0.0026831604,0.0019275344,0.0017796287,0.0011205897,0.0002215938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002924359,0.000054017208,0.0064156847,0.00009877788,0.000025360368,0.00031262182,0.0008393901,0.022936508,0.011081308,0.9421516,0.0013384587,0.014453902],"study_design_scores_gemma":[0.000036440135,0.00007050697,0.0023947807,0.000027545675,0.000026731099,0.00031242688,0.00037365546,0.080306314,0.005338784,0.9080003,0.0030830768,0.000029488257],"about_ca_topic_score_codex":0.00043931205,"about_ca_topic_score_gemma":0.00053241727,"teacher_disagreement_score":0.0020787506,"about_ca_system_score_codex":0.0010775406,"about_ca_system_score_gemma":0.00024840506,"threshold_uncertainty_score":0.007818162},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73303956,0.0015694567,0.16276953,0.0038829076,0.0003426835,0.00007837545,0.00070765347,0.00043143376,0.09717829],"genre_scores_gemma":[0.9462394,0.0007657878,0.038872097,0.00042643773,0.00036578442,0.00010140576,0.00064624724,0.00023740223,0.012345447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817896,0.0005743805,0.00010700003,0.00041393822,0.00038632238,0.00033934286],"domain_scores_gemma":[0.99199027,0.0047661634,0.0009665736,0.0009277301,0.0004193952,0.00092974113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015696214,0.0011049033,0.00155142,0.0036430277,0.003855195,0.005075583,0.0028781535,0.002875168,0.008917378],"category_scores_gemma":[0.007900355,0.0015673117,0.001538207,0.003133507,0.005890789,0.009861424,0.003610247,0.006013612,0.0012468998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097745746,0.00003911267,0.0005852974,0.000047782523,0.000007944531,0.00004058182,0.00033547828,0.0031907721,0.0011724579,0.9877523,0.00142847,0.00530201],"study_design_scores_gemma":[0.000017479402,0.000012646874,0.0005162632,0.000018965644,0.000010793065,0.0000629628,0.00018997912,0.008797424,0.00080489,0.988076,0.0014740613,0.000018558561],"about_ca_topic_score_codex":0.0014181209,"about_ca_topic_score_gemma":0.0019915048,"teacher_disagreement_score":0.008917378,"about_ca_system_score_codex":0.0020792226,"about_ca_system_score_gemma":0.0008976861,"threshold_uncertainty_score":0.029831648},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6269367,0.00030655993,0.32777914,0.00070388016,0.0000706311,0.00006886306,0.00024626168,0.00033224997,0.04355568],"genre_scores_gemma":[0.9116325,0.00035863332,0.07650493,0.00017305516,0.000050639377,0.0000655688,0.00031022454,0.00008130278,0.010823207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950075,0.00009688896,0.000030525753,0.00019440959,0.00008812834,0.00008931985],"domain_scores_gemma":[0.99841034,0.00057486293,0.0002790487,0.00032442287,0.00022246364,0.00018880334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005861924,0.0003600957,0.00024684423,0.0005888978,0.0010365498,0.0009214336,0.0005020036,0.00048654032,0.0051767114],"category_scores_gemma":[0.00175657,0.00023525085,0.00051412015,0.00074980647,0.0015275162,0.0027141285,0.0012599665,0.001097801,0.0004444206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093224015,0.000050194565,0.0016782973,0.00008523609,0.000012218701,0.00027173254,0.00072103273,0.004892403,0.007700288,0.96427596,0.001154953,0.019064391],"study_design_scores_gemma":[0.000022723294,0.00013082713,0.0014852543,0.000022836042,0.000031209536,0.0007128387,0.0003340527,0.02981203,0.010815461,0.94179165,0.014817196,0.000024010287],"about_ca_topic_score_codex":0.00071260356,"about_ca_topic_score_gemma":0.00060485257,"teacher_disagreement_score":0.0051767114,"about_ca_system_score_codex":0.000645357,"about_ca_system_score_gemma":0.00031381325,"threshold_uncertainty_score":0.017317891},"labels":[],"label_agreement":null},{"id":"W2169660879","doi":"","title":"Resolving Edge Colorings in Graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Edge coloring; Combinatorics; Computer science; Graph; Artificial intelligence; Line graph","score_opus":0.012131910959786591,"score_gpt":0.2263921460265984,"score_spread":0.21426023506681183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169660879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17068681,0.0058626863,0.65166533,0.012511256,0.001860096,0.00032476403,0.0033269015,0.0027569358,0.1510052],"genre_scores_gemma":[0.61867166,0.0028558057,0.32518142,0.0027083699,0.0008864473,0.00021484417,0.004882133,0.00097444234,0.043624885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750024,0.0009139431,0.0001498702,0.00058753835,0.00040234652,0.00044603285],"domain_scores_gemma":[0.99005264,0.006368122,0.0006194793,0.001848607,0.0005862819,0.00052475464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020281186,0.0008760085,0.0010719544,0.001798209,0.0031088444,0.0044821654,0.002456414,0.002654825,0.014120994],"category_scores_gemma":[0.013829842,0.000978097,0.0011531871,0.0031217055,0.0023751152,0.008631079,0.003959894,0.0044455864,0.0025198932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021381084,0.00021010412,0.00182952,0.0003844538,0.00007179081,0.00022087664,0.0006290253,0.012826737,0.0026199939,0.8392077,0.050980914,0.09080501],"study_design_scores_gemma":[0.000032855187,0.00001980181,0.00028927223,0.000056012665,0.0000277756,0.00025863957,0.00042980083,0.017118573,0.00197882,0.9583448,0.021423727,0.000019849364],"about_ca_topic_score_codex":0.0028453993,"about_ca_topic_score_gemma":0.0044666855,"teacher_disagreement_score":0.014120994,"about_ca_system_score_codex":0.0018891429,"about_ca_system_score_gemma":0.0013755314,"threshold_uncertainty_score":0.047239423},"labels":[],"label_agreement":null},{"id":"W2172792075","doi":"","title":"On The Super Edge-Magic Deficiency Of Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; MAGIC (telescope); Bijection; Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Physics; Quantum mechanics; Computer science","score_opus":0.009240455857461218,"score_gpt":0.2032537891227456,"score_spread":0.1940133332652844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172792075","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9349164,0.0006191491,0.049184345,0.0007445891,0.00004119978,0.000026753272,0.00029886406,0.00009380295,0.014074839],"genre_scores_gemma":[0.9872329,0.00014080197,0.011408035,0.00007013345,0.00002049807,0.00001498963,0.00014338641,0.00001729391,0.0009519474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999154,0.0002447146,0.00005899985,0.00020869699,0.00019038194,0.00014337162],"domain_scores_gemma":[0.99541074,0.0024664646,0.00071652135,0.00053164,0.00036524294,0.0005094793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001288469,0.0003218812,0.00060193776,0.0015524065,0.0009758831,0.0013801471,0.00065905316,0.0006170757,0.0018881732],"category_scores_gemma":[0.0044281133,0.0004174433,0.0003313718,0.0008107453,0.0022081567,0.0027062483,0.0012564617,0.0007473112,0.00016857445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010393312,0.00008886017,0.015343899,0.00029427416,0.000038429793,0.00044231932,0.0010458347,0.021979522,0.019047128,0.8938298,0.0028623396,0.04398835],"study_design_scores_gemma":[0.000058732552,0.00021724323,0.0052542714,0.00007149984,0.000045535653,0.0013554143,0.0007058238,0.069345675,0.009072124,0.90341026,0.010429137,0.000034248333],"about_ca_topic_score_codex":0.00059708237,"about_ca_topic_score_gemma":0.00080807746,"teacher_disagreement_score":0.0018881732,"about_ca_system_score_codex":0.0009941539,"about_ca_system_score_gemma":0.00040211919,"threshold_uncertainty_score":0.0072131753},"labels":[],"label_agreement":null},{"id":"W2174012357","doi":"","title":"On 3-coloring of plane triangulations","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Plane (geometry); Face (sociological concept); Triangulation; Set (abstract data type); Geometry; Computer science","score_opus":0.014407893911314869,"score_gpt":0.23510747871947507,"score_spread":0.2206995848081602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174012357","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53130484,0.0026626757,0.35529467,0.0018624449,0.0002880762,0.00011274247,0.0015647018,0.00071701757,0.10619276],"genre_scores_gemma":[0.86243707,0.0018716097,0.11722219,0.00059225486,0.0002262322,0.00015074252,0.0014113741,0.00028777384,0.015800824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989066,0.00031660433,0.000053224474,0.00019321675,0.00019610643,0.00033417577],"domain_scores_gemma":[0.9974617,0.0012957297,0.00044121026,0.0003451883,0.00021413599,0.00024194723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067932444,0.00071286876,0.00072976167,0.0015285166,0.0015484344,0.0022019532,0.0008595863,0.0008097964,0.0073179514],"category_scores_gemma":[0.0031607857,0.0005379877,0.0008180353,0.0021164455,0.001906473,0.0025122939,0.0023416826,0.001240991,0.0011120135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028493616,0.00004983805,0.0030422306,0.000182186,0.00003160111,0.00026340326,0.0007010275,0.032852147,0.0047408096,0.8956242,0.010102789,0.052124877],"study_design_scores_gemma":[0.000039382052,0.000040733084,0.001846034,0.00005302159,0.000018586148,0.00037105675,0.0003519134,0.06952321,0.0017053545,0.90765995,0.01835944,0.000031377516],"about_ca_topic_score_codex":0.0031877037,"about_ca_topic_score_gemma":0.0035929198,"teacher_disagreement_score":0.0073179514,"about_ca_system_score_codex":0.0021546355,"about_ca_system_score_gemma":0.00048244072,"threshold_uncertainty_score":0.024480999},"labels":[],"label_agreement":null},{"id":"W2180784125","doi":"","title":"The total chromatic number of some bipartite graphs","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Chromatic scale; Combinatorics; Foster graph; Graph; Line graph; Voltage graph","score_opus":0.011877532212437014,"score_gpt":0.22813568561092532,"score_spread":0.2162581533984883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2180784125","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8727254,0.00090199156,0.056208346,0.0036081658,0.00011789732,0.000068877256,0.0027019712,0.00035395668,0.06331338],"genre_scores_gemma":[0.9658561,0.00058552774,0.019540677,0.00039403478,0.00019466257,0.00014854467,0.00154585,0.00021409555,0.011520416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989894,0.00032245828,0.00004321494,0.0002696371,0.00018536109,0.00018995398],"domain_scores_gemma":[0.9900771,0.0067432444,0.0009947234,0.0008198188,0.00049678405,0.0008684111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015136768,0.0009896547,0.0009789006,0.0036403134,0.0030670173,0.0057350546,0.0024551828,0.001729021,0.010683381],"category_scores_gemma":[0.006242898,0.001022005,0.0008710477,0.0040675313,0.003648061,0.0051239477,0.0016264019,0.0023643125,0.00059794256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005784361,0.00012321102,0.005822747,0.0003104436,0.00011130561,0.00012941264,0.0006205128,0.043131966,0.007750217,0.9125991,0.013101868,0.015720667],"study_design_scores_gemma":[0.00012607547,0.00004914604,0.0034296184,0.000057255536,0.000103379105,0.00022589098,0.00033342556,0.11691399,0.0033338692,0.86970806,0.0056671235,0.00005221545],"about_ca_topic_score_codex":0.0036143574,"about_ca_topic_score_gemma":0.0064510847,"teacher_disagreement_score":0.010683381,"about_ca_system_score_codex":0.0042813295,"about_ca_system_score_gemma":0.0014194248,"threshold_uncertainty_score":0.03573948},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85931903,0.00028448037,0.13020168,0.0005018985,0.00002761856,0.00010421853,0.0009518358,0.00044491046,0.008164229],"genre_scores_gemma":[0.9492033,0.00014451992,0.046150897,0.00018280532,0.000024470815,0.00005362328,0.0011932575,0.000119987766,0.0029271413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997316,0.000036984668,0.000011883198,0.0001005873,0.000051453913,0.0000674407],"domain_scores_gemma":[0.99804085,0.00088303944,0.00036755926,0.0002710574,0.0001964319,0.00024112505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028956475,0.00028204158,0.00036735728,0.0012514181,0.00083711435,0.001279218,0.0006687208,0.000559564,0.003846558],"category_scores_gemma":[0.0018707382,0.0004831771,0.00032705974,0.0011010513,0.0010461111,0.0023369542,0.00094620034,0.00094112946,0.00029659973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011424633,0.0003276821,0.019809673,0.00068466127,0.00011423406,0.0011044625,0.0031417187,0.08591263,0.106794596,0.67495817,0.011698599,0.094311036],"study_design_scores_gemma":[0.00017666239,0.0002819226,0.015578743,0.00009752921,0.0001298732,0.0012273295,0.0013417592,0.18805064,0.029795516,0.7415537,0.021695485,0.00007083813],"about_ca_topic_score_codex":0.0022007036,"about_ca_topic_score_gemma":0.0037136076,"teacher_disagreement_score":0.003846558,"about_ca_system_score_codex":0.0007985393,"about_ca_system_score_gemma":0.00043364722,"threshold_uncertainty_score":0.012867987},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.898969,0.000444583,0.07247417,0.00053525576,0.00003576847,0.000050819017,0.00060919026,0.00029168813,0.02658956],"genre_scores_gemma":[0.95968956,0.00040374097,0.035500165,0.00015080419,0.00006272698,0.00005547374,0.00073683163,0.00007523778,0.0033255501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994265,0.00012394106,0.000041430183,0.00015610691,0.000096885,0.00015515051],"domain_scores_gemma":[0.9973755,0.0012781107,0.00063946896,0.0002717308,0.00016706398,0.00026822585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045651972,0.00043001547,0.00040519063,0.0012472834,0.0012745576,0.0013970895,0.0005876152,0.0006226181,0.003360786],"category_scores_gemma":[0.0027002553,0.00044038895,0.0004587393,0.0014280643,0.0019272235,0.0023419766,0.0012668847,0.0007602275,0.0003742342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047665605,0.00007674995,0.007629174,0.00022921042,0.000029567991,0.0005055654,0.0014496444,0.026599826,0.015844677,0.8975907,0.003958386,0.045609925],"study_design_scores_gemma":[0.00006140125,0.00010602752,0.0047683776,0.00007083509,0.000033815635,0.00085054047,0.0007103083,0.04399918,0.006794795,0.93043,0.012130187,0.000044622502],"about_ca_topic_score_codex":0.0014628571,"about_ca_topic_score_gemma":0.0017040102,"teacher_disagreement_score":0.003360786,"about_ca_system_score_codex":0.0010041924,"about_ca_system_score_gemma":0.00046191752,"threshold_uncertainty_score":0.011242926},"labels":[],"label_agreement":null},{"id":"W2219595186","doi":"","title":"On the metric dimension of Mobius ladders","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Metric dimension; Mathematics; Vertex (graph theory); Dimension (graph theory); Cardinality (data modeling); Metric space; Constant (computer programming); Packing dimension; Discrete mathematics; Graph; Minkowski–Bouligand dimension; Chordal graph; Mathematical analysis","score_opus":0.015373727413802237,"score_gpt":0.22799794753461056,"score_spread":0.2126242201208083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2219595186","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8931292,0.0022672212,0.052910287,0.0012078488,0.00016035303,0.000038173253,0.0005232582,0.00013043349,0.049633235],"genre_scores_gemma":[0.98262286,0.0010547956,0.012272556,0.00015466772,0.00019598148,0.00004378914,0.0002468236,0.000041680174,0.0033668873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934644,0.0001661507,0.000032635584,0.00015830308,0.00014414664,0.0001523397],"domain_scores_gemma":[0.9979284,0.0008797049,0.0003690576,0.00020191452,0.0002078118,0.0004131129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006833249,0.00057041005,0.0005870507,0.002512577,0.0011395833,0.0016910312,0.0007075962,0.00062300847,0.0031034031],"category_scores_gemma":[0.0029715498,0.0003177132,0.00049375254,0.0014966711,0.0026252177,0.0026236984,0.001823446,0.0011333709,0.00037468827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000867367,0.000031587344,0.00186101,0.000074878175,0.000018049237,0.000121403034,0.00050418155,0.0030814505,0.0025442946,0.98136467,0.0015024208,0.008809333],"study_design_scores_gemma":[0.000024153773,0.00007552623,0.0027028613,0.000043824424,0.000018693947,0.00033000237,0.00029390655,0.018619481,0.0010536778,0.9689146,0.0078853145,0.000037865695],"about_ca_topic_score_codex":0.0010230411,"about_ca_topic_score_gemma":0.00063192094,"teacher_disagreement_score":0.0031034031,"about_ca_system_score_codex":0.0012447087,"about_ca_system_score_gemma":0.00030808244,"threshold_uncertainty_score":0.010381937},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43593803,0.008530366,0.31973115,0.028677147,0.0019482234,0.00040890317,0.011668784,0.0026385798,0.19045879],"genre_scores_gemma":[0.8504336,0.0036699013,0.093081795,0.0036448895,0.0021948828,0.00069832936,0.009609885,0.0012913883,0.035375386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99263644,0.002023205,0.00032069194,0.0021310973,0.001417472,0.0014710582],"domain_scores_gemma":[0.93716353,0.046931498,0.0027190153,0.006412242,0.0022332196,0.0045404867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004870363,0.0035697983,0.003358648,0.0033903795,0.0040159575,0.007942385,0.007315063,0.0036852905,0.02502659],"category_scores_gemma":[0.032586858,0.002167762,0.0033244449,0.002990809,0.006065379,0.012523083,0.0055711637,0.008808777,0.0044264803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035658362,0.00064544106,0.012159389,0.0025554677,0.00060416025,0.00064120686,0.0012509774,0.075770095,0.016975807,0.7379406,0.079623885,0.06826715],"study_design_scores_gemma":[0.00030658994,0.0002762157,0.004145378,0.00020799886,0.00031850467,0.0011085103,0.0003214192,0.12093232,0.005209308,0.8531391,0.013916975,0.00011759942],"about_ca_topic_score_codex":0.002115803,"about_ca_topic_score_gemma":0.0033958748,"teacher_disagreement_score":0.02502659,"about_ca_system_score_codex":0.0047984654,"about_ca_system_score_gemma":0.0023956536,"threshold_uncertainty_score":0.08372229},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7959768,0.0004592407,0.12606588,0.003952834,0.0002580177,0.00019021495,0.0019257126,0.0015600071,0.069611184],"genre_scores_gemma":[0.91713536,0.00034584108,0.06949566,0.0008953508,0.00007949552,0.00015692736,0.0018988292,0.0002156667,0.009776853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988513,0.00020930919,0.0000768037,0.00035241788,0.00021706111,0.00029313887],"domain_scores_gemma":[0.9959953,0.0018457947,0.0005740429,0.00080077676,0.00042621343,0.00035784545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000668009,0.0005918739,0.000673418,0.00081643654,0.0020640062,0.0020041885,0.0011469225,0.0016962134,0.011619296],"category_scores_gemma":[0.005574303,0.00055496977,0.00061407353,0.0012474618,0.001783184,0.003995833,0.002892036,0.0016132947,0.0019304401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028182778,0.0005832088,0.015711373,0.0008783603,0.00008400958,0.00091110833,0.0019265459,0.043852143,0.08198529,0.6538177,0.03134408,0.16608787],"study_design_scores_gemma":[0.0005468076,0.0010113613,0.0067581064,0.00015676428,0.00016735074,0.0017225702,0.0026917895,0.11275414,0.08028415,0.72666305,0.067002006,0.00024196862],"about_ca_topic_score_codex":0.0017858113,"about_ca_topic_score_gemma":0.0022669705,"teacher_disagreement_score":0.011619296,"about_ca_system_score_codex":0.0015961804,"about_ca_system_score_gemma":0.0010928743,"threshold_uncertainty_score":0.038870454},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18267395,0.015047367,0.5234037,0.017988745,0.0023476637,0.00019488779,0.001804558,0.0019002996,0.2546388],"genre_scores_gemma":[0.7559475,0.008430789,0.18671376,0.004584572,0.0020045363,0.00039223215,0.0018732882,0.0010208769,0.039032497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99446094,0.0015486841,0.00019551051,0.0019408944,0.0012256405,0.0006283927],"domain_scores_gemma":[0.9841642,0.010561102,0.00069613656,0.0024061555,0.0015585523,0.0006138619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00411445,0.001755596,0.0024484757,0.002157381,0.0045906287,0.0065309345,0.002424432,0.0029324188,0.011340882],"category_scores_gemma":[0.02081146,0.0011602709,0.0031613098,0.0034872883,0.007411116,0.0093281325,0.0047811177,0.009165928,0.002415025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017345895,0.0000740977,0.0012711955,0.0003917881,0.000048281632,0.00013605991,0.0005780755,0.008888664,0.0018550521,0.9489977,0.0062833787,0.03130215],"study_design_scores_gemma":[0.00006984175,0.00008585195,0.0010603117,0.00018338957,0.000053413347,0.0006680481,0.0004412716,0.03286832,0.0024442105,0.8924315,0.069628,0.00006581368],"about_ca_topic_score_codex":0.010117939,"about_ca_topic_score_gemma":0.006179607,"teacher_disagreement_score":0.011340882,"about_ca_system_score_codex":0.007890998,"about_ca_system_score_gemma":0.0018993979,"threshold_uncertainty_score":0.05725348},"labels":[],"label_agreement":null},{"id":"W2255515338","doi":"","title":"Self-complementary magic squares.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Magic square; Mathematics; MAGIC (telescope); Arithmetic; Combinatorics; Astronomy; Physics","score_opus":0.009429417000067771,"score_gpt":0.22074071702791528,"score_spread":0.2113113000278475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2255515338","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18228199,0.0021550627,0.3085846,0.004179942,0.0013009384,0.00012497485,0.0019126256,0.0010035266,0.4984563],"genre_scores_gemma":[0.77800167,0.00097033643,0.12811464,0.0014120169,0.00040636008,0.0001598514,0.0014803386,0.0003809017,0.08907387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993748,0.00017258147,0.000026961006,0.00016234249,0.00016457068,0.00009883798],"domain_scores_gemma":[0.99837387,0.0007639584,0.00016271546,0.0003165037,0.00020052842,0.00018243091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046655157,0.00040920373,0.0005696706,0.0010968163,0.0015123298,0.0017787615,0.0010601328,0.0010878718,0.023001136],"category_scores_gemma":[0.002689324,0.0004087059,0.0005544315,0.001172951,0.0016180952,0.00287462,0.0020727413,0.0018576655,0.003705082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041887462,0.000019831008,0.0001891055,0.00007316165,0.000009340235,0.00005618788,0.0000683265,0.00089214655,0.0011346114,0.972415,0.008968101,0.0161323],"study_design_scores_gemma":[0.000018392964,0.0000099753925,0.0001620126,0.000020590815,0.000007997572,0.00015889217,0.00006929401,0.0051919613,0.0011308313,0.9767049,0.016515555,0.000009503991],"about_ca_topic_score_codex":0.0006933728,"about_ca_topic_score_gemma":0.0017570332,"teacher_disagreement_score":0.023001136,"about_ca_system_score_codex":0.0007466264,"about_ca_system_score_gemma":0.00061071746,"threshold_uncertainty_score":0.07694644},"labels":[],"label_agreement":null},{"id":"W22670994","doi":"","title":"On Friendly Index Sets of Bipartite Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Index (typography); Combinatorics; Discrete mathematics; Graph; Computer science; World Wide Web","score_opus":0.013574699607247429,"score_gpt":0.22790031124383284,"score_spread":0.21432561163658542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W22670994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31106114,0.0015845232,0.46074393,0.0026949754,0.00040528236,0.0002779786,0.0027320855,0.0012320619,0.21926805],"genre_scores_gemma":[0.80040425,0.0014637945,0.14425084,0.0012351685,0.000541518,0.00047025445,0.0033742457,0.000680495,0.04757951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972996,0.0009469678,0.00015367572,0.0004018448,0.0006993079,0.0004985769],"domain_scores_gemma":[0.99069536,0.0056871637,0.0009000631,0.0014172652,0.00051578385,0.00078445475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016748353,0.0007189059,0.0011508727,0.0031166065,0.003478348,0.005761877,0.0020748442,0.0017401378,0.013019982],"category_scores_gemma":[0.010274395,0.00091758225,0.0011161626,0.003377911,0.002390233,0.008822043,0.0037379677,0.0024282846,0.0026642024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008338395,0.00005455109,0.0006085123,0.000074041745,0.000011961543,0.000068956404,0.00029585647,0.0029915199,0.0009807821,0.9727233,0.0068710637,0.015236171],"study_design_scores_gemma":[0.00001756399,0.000018577723,0.0003572414,0.000034324374,0.0000140423645,0.00016430697,0.00014430938,0.013326577,0.0010624346,0.9758664,0.008979245,0.0000149968955],"about_ca_topic_score_codex":0.001177396,"about_ca_topic_score_gemma":0.0018443703,"teacher_disagreement_score":0.013019982,"about_ca_system_score_codex":0.0023657884,"about_ca_system_score_gemma":0.0007760367,"threshold_uncertainty_score":0.043556154},"labels":[],"label_agreement":null},{"id":"W2281982864","doi":"","title":"Strong Distances in Strong Oriented Complete k-Partite Graphs","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.031077314002769665,"score_gpt":0.23482072264806414,"score_spread":0.20374340864529447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2281982864","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8447943,0.0006502988,0.100513674,0.0019790612,0.00016606506,0.0001076468,0.001337847,0.00030740636,0.050143667],"genre_scores_gemma":[0.9676427,0.00038782295,0.018995851,0.00035251453,0.00012507067,0.00013853532,0.0009657835,0.00010690009,0.011284807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998459,0.00036802198,0.00009502207,0.00039858426,0.0003528361,0.00032670275],"domain_scores_gemma":[0.99236506,0.003724745,0.0012642943,0.0006468129,0.00058811094,0.0014110161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076569384,0.0007241453,0.0012097504,0.0019070357,0.003649205,0.00435375,0.0016808448,0.0014980164,0.008529712],"category_scores_gemma":[0.0055440194,0.0012870898,0.00073693186,0.0028674328,0.0022054403,0.005720133,0.0032023555,0.0025277212,0.0009960106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003728648,0.00012910932,0.004060609,0.00030211094,0.000053340453,0.00028231204,0.0008999923,0.016600383,0.0038173783,0.9503345,0.0063034003,0.01684397],"study_design_scores_gemma":[0.00009065205,0.0000618701,0.0020257817,0.000041336323,0.00005323648,0.00030700112,0.00064774416,0.027652787,0.001822183,0.96154225,0.005720094,0.000035087036],"about_ca_topic_score_codex":0.0010645802,"about_ca_topic_score_gemma":0.0019260269,"teacher_disagreement_score":0.008529712,"about_ca_system_score_codex":0.0015123138,"about_ca_system_score_gemma":0.00088050344,"threshold_uncertainty_score":0.02853477},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83568245,0.0003742019,0.12878875,0.00038203006,0.00008442728,0.000054152886,0.00045893103,0.00035051885,0.03382454],"genre_scores_gemma":[0.9437688,0.00027423474,0.04820915,0.00012434126,0.000072419796,0.00008601638,0.0008820252,0.00013063815,0.0064523644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999297,0.00013742522,0.000041778312,0.00021922275,0.0001558582,0.00014870166],"domain_scores_gemma":[0.9970221,0.0013892441,0.00054417306,0.00042587495,0.0002838434,0.00033488366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046575235,0.0004198402,0.00074625295,0.0013022107,0.0022966878,0.002773064,0.0012254915,0.00087679253,0.004495024],"category_scores_gemma":[0.0029596908,0.00078177796,0.0007060092,0.0017611587,0.0018555456,0.0027827213,0.0013600463,0.0014719316,0.00032346023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028263725,0.000079434256,0.0020636548,0.00012886063,0.000025017682,0.00022333428,0.00074123027,0.007730304,0.006242839,0.95808434,0.0024541914,0.021944234],"study_design_scores_gemma":[0.00003714985,0.0000431153,0.0017445809,0.000035185825,0.000050439543,0.00031381636,0.00048504487,0.046587758,0.005397203,0.94002277,0.005253451,0.00002953729],"about_ca_topic_score_codex":0.0014298285,"about_ca_topic_score_gemma":0.0027688516,"teacher_disagreement_score":0.004495024,"about_ca_system_score_codex":0.0009060726,"about_ca_system_score_gemma":0.0007625802,"threshold_uncertainty_score":0.015037358},"labels":[],"label_agreement":null},{"id":"W2294185024","doi":"","title":"Product Cordial Sets of Long Grids","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Graph; Vertex (graph theory); Mathematics; Product (mathematics); Geometry","score_opus":0.015008691299261839,"score_gpt":0.24192746120376785,"score_spread":0.22691876990450602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294185024","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8561707,0.0004300637,0.10899427,0.00026897562,0.000058255057,0.000064889115,0.0012463452,0.0003386895,0.03242778],"genre_scores_gemma":[0.937635,0.00025210806,0.04740934,0.0001239731,0.00008089433,0.00012030138,0.0014074955,0.000080047255,0.012890741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945563,0.00007369677,0.00004657266,0.0001506583,0.00015825382,0.00011523294],"domain_scores_gemma":[0.99808514,0.0006340944,0.00040529075,0.00032915402,0.00026835245,0.00027805872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039104818,0.0003109705,0.00052289997,0.0011315752,0.0012155778,0.0016873315,0.0008492757,0.00039146908,0.0057529705],"category_scores_gemma":[0.0023086525,0.00037199084,0.00045456956,0.0013545932,0.0010855374,0.0022767219,0.0013106058,0.0007975898,0.00045124802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023300335,0.000052421026,0.005109353,0.00011679196,0.00002167122,0.0002318934,0.00056564034,0.008069143,0.00541092,0.9420637,0.002734807,0.035390727],"study_design_scores_gemma":[0.00004242001,0.00011840529,0.0061030905,0.000048561742,0.000028556826,0.0010579225,0.00028809978,0.05179048,0.005761092,0.9131034,0.021617368,0.00004055768],"about_ca_topic_score_codex":0.0011229032,"about_ca_topic_score_gemma":0.0011988265,"teacher_disagreement_score":0.0057529705,"about_ca_system_score_codex":0.0011781658,"about_ca_system_score_gemma":0.0003810606,"threshold_uncertainty_score":0.019245625},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72145087,0.0008540572,0.2473714,0.0005978442,0.000055111454,0.00022790318,0.00096622517,0.00064656796,0.027829962],"genre_scores_gemma":[0.8885587,0.0004142497,0.1022671,0.0002593614,0.00004349913,0.00011199915,0.0020866387,0.00014533657,0.00611315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946195,0.0000994936,0.00002370292,0.00020246873,0.0000912961,0.000121154786],"domain_scores_gemma":[0.9985185,0.0004110477,0.00018132357,0.0005828603,0.00012313016,0.00018315468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040651904,0.0007298201,0.0004307979,0.0006925001,0.000808617,0.00093804987,0.0010208801,0.00057539984,0.0037861986],"category_scores_gemma":[0.0018201491,0.0004163365,0.000596602,0.0009504882,0.0011114696,0.0020753536,0.0016570828,0.0011667385,0.0008122176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011117046,0.0004390466,0.018956568,0.0009295405,0.00019026271,0.00090819044,0.00179496,0.10162033,0.10391027,0.5410421,0.0158834,0.21321371],"study_design_scores_gemma":[0.00011671255,0.00038790467,0.01680257,0.00017515336,0.0002566927,0.0023716546,0.0016365228,0.2998616,0.03895118,0.5931918,0.046177514,0.00007057155],"about_ca_topic_score_codex":0.0010516404,"about_ca_topic_score_gemma":0.002123155,"teacher_disagreement_score":0.0037861986,"about_ca_system_score_codex":0.00071785325,"about_ca_system_score_gemma":0.0003463657,"threshold_uncertainty_score":0.012666106},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14971207,0.00039749604,0.21449082,0.0071601914,0.0012567941,0.0011347347,0.0033132017,0.0053602327,0.6171745],"genre_scores_gemma":[0.7615032,0.00025853512,0.069879495,0.00093740784,0.00014455047,0.000720197,0.0017781276,0.00052957126,0.16424894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994758,0.00013087736,0.000019669713,0.00011072601,0.000128213,0.00013475875],"domain_scores_gemma":[0.99920577,0.000306331,0.000026198866,0.00010962024,0.000098225464,0.00025384204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033401354,0.00077794254,0.0004777195,0.00040384787,0.0012079156,0.00150614,0.0011367493,0.0010441367,0.077175744],"category_scores_gemma":[0.0026189736,0.00022246153,0.00042791525,0.00035686736,0.00092123746,0.0022135105,0.0016925224,0.0012834277,0.006102092],"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.0015733558,0.0008689439,0.0019272296,0.00031174262,0.000073672396,0.00082852604,0.000702153,0.028165486,0.011483769,0.61963177,0.1543025,0.1801309],"study_design_scores_gemma":[0.00051426166,0.000483466,0.0016999495,0.000079389865,0.0000471196,0.0005118676,0.0005113433,0.25962958,0.0062462343,0.50862324,0.22155856,0.00009496587],"about_ca_topic_score_codex":0.0037766907,"about_ca_topic_score_gemma":0.0047462517,"teacher_disagreement_score":0.077175744,"about_ca_system_score_codex":0.0011937176,"about_ca_system_score_gemma":0.001142672,"threshold_uncertainty_score":0.25817853},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050474007,0.38241333,0.17108946,0.010792419,0.0033574216,0.0001448495,0.0016639361,0.00058273337,0.3794819],"genre_scores_gemma":[0.38965803,0.35232174,0.1745393,0.0061291284,0.010987581,0.00037863594,0.0032097741,0.00057718623,0.062198587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875104,0.00024643057,0.00009816766,0.00034439802,0.00041766657,0.00014226948],"domain_scores_gemma":[0.9978922,0.0013275638,0.0001587845,0.0002272746,0.00027410683,0.00012014511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020439266,0.0008373556,0.0011471802,0.0048165773,0.0026030827,0.0030548295,0.0014162369,0.0014540692,0.008862308],"category_scores_gemma":[0.004003465,0.000766658,0.0009298442,0.01010802,0.0024382214,0.0080857985,0.0021331587,0.0033903923,0.0022546742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038197548,0.000044464694,0.00071661844,0.0005435678,0.000012484752,0.000059505324,0.00019417767,0.0009874811,0.00047764744,0.9121337,0.010457279,0.074334875],"study_design_scores_gemma":[0.000017019003,0.000074787546,0.001268218,0.0004107698,0.000033129,0.0007089608,0.00018907369,0.003186278,0.0009308477,0.7848373,0.20828635,0.00005731815],"about_ca_topic_score_codex":0.0016590497,"about_ca_topic_score_gemma":0.0016219328,"teacher_disagreement_score":0.008862308,"about_ca_system_score_codex":0.002915808,"about_ca_system_score_gemma":0.0014842524,"threshold_uncertainty_score":0.02964741},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67377865,0.003464206,0.2722169,0.0025470732,0.00032867576,0.000047056346,0.00085208245,0.0008547731,0.04591056],"genre_scores_gemma":[0.97393745,0.0007696103,0.020678628,0.0001954127,0.00026547504,0.00006606331,0.00040597716,0.0002450992,0.0034361968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990773,0.00016714822,0.000040538114,0.0002757964,0.00022657638,0.0002127088],"domain_scores_gemma":[0.9948696,0.0030153983,0.00040993793,0.0008308344,0.00023466942,0.00063943677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016254073,0.0011759889,0.001067949,0.0038090097,0.0012925657,0.0023420067,0.0025225985,0.0014371976,0.00699599],"category_scores_gemma":[0.007515979,0.00057192263,0.00094866555,0.0014563474,0.0030726942,0.007328198,0.003845153,0.003922108,0.00074078084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021659753,0.00008752933,0.0038732677,0.00029183182,0.0000612745,0.00027357318,0.00052363216,0.016003102,0.012529398,0.9403613,0.0019023446,0.023876118],"study_design_scores_gemma":[0.000011405654,0.000057581874,0.0021099416,0.00006158675,0.0000286946,0.00017081769,0.00008789637,0.051384427,0.005041302,0.93883246,0.0021699788,0.000043846605],"about_ca_topic_score_codex":0.0003939335,"about_ca_topic_score_gemma":0.0006125479,"teacher_disagreement_score":0.00699599,"about_ca_system_score_codex":0.00089084107,"about_ca_system_score_gemma":0.0003813688,"threshold_uncertainty_score":0.023403883},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9625921,0.00026770227,0.026525479,0.0003113223,0.000029683177,0.000010784441,0.0001838037,0.00005755732,0.0100214165],"genre_scores_gemma":[0.9916848,0.0001846514,0.0063409493,0.000039761406,0.000039100858,0.000012065566,0.00014719181,0.000022882581,0.0015285091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997105,0.000088484914,0.000012024878,0.0000658197,0.00006425338,0.000058878937],"domain_scores_gemma":[0.9984988,0.0006357041,0.0002460957,0.00012551814,0.00016297065,0.00033083285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004959698,0.00028865322,0.0004373605,0.0019183807,0.0008468949,0.0014035753,0.00061921665,0.00039135356,0.0024276287],"category_scores_gemma":[0.0015772359,0.0002018392,0.00029141366,0.0009658824,0.0017385979,0.0022496798,0.0007516705,0.00045518373,0.00013679848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001238832,0.000028126931,0.0035795567,0.00009576229,0.00003823898,0.00012683708,0.00033931455,0.01669301,0.005964321,0.9642507,0.0013447274,0.007415522],"study_design_scores_gemma":[0.000029840481,0.000093053444,0.0057789744,0.000029652514,0.0000443883,0.00039268518,0.00035666375,0.09032644,0.0047455225,0.8936652,0.004488595,0.000049049147],"about_ca_topic_score_codex":0.0011131151,"about_ca_topic_score_gemma":0.0011038512,"teacher_disagreement_score":0.0024276287,"about_ca_system_score_codex":0.0008472597,"about_ca_system_score_gemma":0.00034116604,"threshold_uncertainty_score":0.008121252},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5834597,0.0037325106,0.30803886,0.0024320628,0.0003307665,0.000033460303,0.0002635589,0.00019040567,0.101518735],"genre_scores_gemma":[0.95967704,0.0014127048,0.029913176,0.00026568223,0.00021347131,0.00003616472,0.00014624507,0.00004739748,0.008288094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999419,0.00017937117,0.000034383407,0.000098543416,0.00017377477,0.00009488494],"domain_scores_gemma":[0.9977919,0.0012263639,0.00027573016,0.00028177298,0.00021251233,0.00021172824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009337167,0.00029955237,0.00042914733,0.0014044304,0.001233066,0.001815173,0.0006246072,0.0007693545,0.004059162],"category_scores_gemma":[0.002706766,0.0003182106,0.0004955539,0.0012637374,0.002343332,0.004814055,0.0014566787,0.0012740945,0.00036170814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010381976,0.0000040964337,0.00014085697,0.000015758998,0.0000023407406,0.000027148106,0.000057063637,0.00070774736,0.00028248833,0.99619055,0.0002609037,0.0023007058],"study_design_scores_gemma":[0.0000047755125,0.000013259457,0.00019288377,0.000010958698,0.000004582245,0.000114962604,0.00005988404,0.0050426815,0.00026190022,0.9916487,0.0026374147,0.000008148365],"about_ca_topic_score_codex":0.00066941336,"about_ca_topic_score_gemma":0.00073250895,"teacher_disagreement_score":0.004059162,"about_ca_system_score_codex":0.0006968712,"about_ca_system_score_gemma":0.00040123196,"threshold_uncertainty_score":0.013579249},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117989816,0.009540262,0.60763115,0.014995561,0.0017224053,0.00024108899,0.003017971,0.0029485028,0.24191329],"genre_scores_gemma":[0.71132517,0.007980645,0.21274784,0.004951643,0.003759611,0.0008438011,0.0036873666,0.0033467212,0.051357184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948774,0.0010613143,0.00023283104,0.0014477076,0.001361478,0.0010192294],"domain_scores_gemma":[0.9562739,0.032022882,0.0015897925,0.005238049,0.0020722132,0.0028031266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040438673,0.0034826845,0.0033781133,0.0053654104,0.003888996,0.010671075,0.0101576075,0.00466656,0.028367545],"category_scores_gemma":[0.030502403,0.0021075015,0.0027382062,0.006470861,0.0076702107,0.025433233,0.010274254,0.014585786,0.0059172506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023529811,0.00017322168,0.0013625629,0.00039300777,0.000044836477,0.00010177226,0.0005381717,0.011713257,0.0022715135,0.9283419,0.018740263,0.03608425],"study_design_scores_gemma":[0.00002217866,0.000018156796,0.00034053167,0.000070577335,0.000051189014,0.00007593761,0.00009113192,0.02406222,0.000787159,0.9673986,0.0070530777,0.000029473555],"about_ca_topic_score_codex":0.003052031,"about_ca_topic_score_gemma":0.005095149,"teacher_disagreement_score":0.028367545,"about_ca_system_score_codex":0.0072149336,"about_ca_system_score_gemma":0.0019547225,"threshold_uncertainty_score":0.09489888},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7446888,0.0012925282,0.14468268,0.0058692903,0.00017444938,0.00009046371,0.0009499825,0.0002751975,0.10197658],"genre_scores_gemma":[0.9809348,0.00040807624,0.013699295,0.00024161281,0.00011898312,0.000057953905,0.000329282,0.000020791264,0.004189214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856645,0.00034563395,0.00008352592,0.00034025463,0.00036240407,0.00030180585],"domain_scores_gemma":[0.9832292,0.010937606,0.0017616233,0.0022573713,0.0006689057,0.0011451985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019994199,0.0004958107,0.000543021,0.0016400901,0.0027051985,0.002173342,0.00096694764,0.0011402115,0.0047704657],"category_scores_gemma":[0.007999789,0.0005701953,0.00078134,0.0015816122,0.00597619,0.0060570515,0.0034334606,0.0032166815,0.00042288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019521889,0.00007010629,0.002484625,0.000043426367,0.00001772071,0.00007958256,0.00030653717,0.0048070927,0.0014752755,0.9816496,0.0017214023,0.007149529],"study_design_scores_gemma":[0.00005833933,0.000027729538,0.001681468,0.00002386932,0.000017078493,0.00021881267,0.0001364983,0.011656623,0.0020890895,0.9789569,0.00510631,0.000027291564],"about_ca_topic_score_codex":0.0015850827,"about_ca_topic_score_gemma":0.0020160654,"teacher_disagreement_score":0.0047704657,"about_ca_system_score_codex":0.0015855756,"about_ca_system_score_gemma":0.00071396166,"threshold_uncertainty_score":0.015958786},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05029315,0.00041480197,0.9211689,0.00048667076,0.0001907554,0.00016213923,0.00023494147,0.0009880714,0.026060631],"genre_scores_gemma":[0.37529117,0.00042755256,0.6110148,0.00017801825,0.000057382545,0.00023914641,0.00039363673,0.00020818735,0.012190094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953294,0.00009015673,0.000034353892,0.00010768163,0.00016868603,0.00006619108],"domain_scores_gemma":[0.9996679,0.00007284058,0.000028639046,0.00009704601,0.00010808831,0.000025578447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037773242,0.00039632275,0.00045789825,0.0007264356,0.0012033174,0.0006238501,0.0005754999,0.00037830992,0.0070306486],"category_scores_gemma":[0.00090316153,0.0003152932,0.00066511857,0.0005730529,0.0010311194,0.0016715872,0.001608135,0.0008820695,0.0014822256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022171582,0.000056485114,0.000939175,0.00048260976,0.00004731135,0.0003582411,0.0006306549,0.015969561,0.049347956,0.7494677,0.007877032,0.17460155],"study_design_scores_gemma":[0.00027965617,0.0004535168,0.000771829,0.00010271251,0.00011194043,0.0015732875,0.0005462348,0.14742674,0.105501674,0.6198723,0.12311752,0.00024261107],"about_ca_topic_score_codex":0.00089327374,"about_ca_topic_score_gemma":0.001369964,"teacher_disagreement_score":0.0070306486,"about_ca_system_score_codex":0.0005161948,"about_ca_system_score_gemma":0.0010273791,"threshold_uncertainty_score":0.023519814},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40857965,0.0012384666,0.54679424,0.001812468,0.00032528953,0.00010123268,0.0005458873,0.0003324884,0.040270112],"genre_scores_gemma":[0.86658263,0.0012644549,0.12431558,0.0005240805,0.0002593726,0.00009170488,0.00048248636,0.000078997575,0.00640069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921215,0.000281876,0.00003590825,0.00017852095,0.000110353394,0.00018126],"domain_scores_gemma":[0.99851555,0.0008125467,0.00011948932,0.00021540429,0.00020271206,0.00013426988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007329042,0.0005012899,0.00039280698,0.0007865772,0.0012648737,0.0010208095,0.00039335876,0.0004748878,0.0025028917],"category_scores_gemma":[0.0019627775,0.0002534271,0.00048411943,0.0010736857,0.0010144371,0.0025838802,0.0010077831,0.00096769375,0.00027935763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026391118,0.000082868406,0.0032951825,0.0002500706,0.000034271223,0.0002854744,0.00058628496,0.045087527,0.014332606,0.88612306,0.006789176,0.042869646],"study_design_scores_gemma":[0.00004629377,0.000093541676,0.0017982934,0.000049213057,0.000032853444,0.0004565564,0.00028969845,0.1571475,0.008263047,0.81260824,0.019169305,0.000045450524],"about_ca_topic_score_codex":0.001446438,"about_ca_topic_score_gemma":0.0015198729,"teacher_disagreement_score":0.0025028917,"about_ca_system_score_codex":0.000982738,"about_ca_system_score_gemma":0.0005576262,"threshold_uncertainty_score":0.008373022},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8372943,0.00027510585,0.1411808,0.00036199074,0.000043021606,0.000121893674,0.0008236707,0.0009768043,0.018922506],"genre_scores_gemma":[0.9600288,0.00021947961,0.028775617,0.00013985383,0.000035064164,0.00009388777,0.00088572863,0.000092505725,0.009729087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993175,0.00007543876,0.000048903246,0.00022259084,0.0001158994,0.00021963491],"domain_scores_gemma":[0.9971386,0.00085775886,0.0006371989,0.00065365783,0.00026644248,0.00044635424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005777403,0.00040037534,0.0005459829,0.00079680927,0.0011873048,0.0018290953,0.00082136394,0.00074566546,0.003070447],"category_scores_gemma":[0.0028063303,0.00086333754,0.00071424246,0.00080683175,0.0017120489,0.002883774,0.0022593925,0.00082319503,0.00061872136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012752492,0.00019543417,0.025967916,0.0004385865,0.00017867639,0.0014340241,0.0034236624,0.052254412,0.061174523,0.7623418,0.006692931,0.084622756],"study_design_scores_gemma":[0.00008474496,0.00027697114,0.007805587,0.00006569512,0.00013908083,0.0014897883,0.0010534097,0.077055626,0.025782159,0.8595614,0.02659706,0.00008853103],"about_ca_topic_score_codex":0.0015476503,"about_ca_topic_score_gemma":0.0026236572,"teacher_disagreement_score":0.003070447,"about_ca_system_score_codex":0.0006330829,"about_ca_system_score_gemma":0.0005456653,"threshold_uncertainty_score":0.010271668},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7806416,0.00033748872,0.17489839,0.0012228552,0.000063193016,0.000075480675,0.0003965124,0.00014242844,0.042221952],"genre_scores_gemma":[0.90355915,0.0003178775,0.080674775,0.00034696827,0.00007672457,0.000122023215,0.0005334253,0.000059211307,0.01430987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972504,0.00009116916,0.00001496308,0.00007242269,0.000036440215,0.000059855403],"domain_scores_gemma":[0.99849176,0.00083116663,0.00022639801,0.00017375912,0.00013091296,0.0001460175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049663277,0.00025817103,0.00029616203,0.00068214815,0.001056718,0.0009250063,0.0005548034,0.00071219995,0.0030836086],"category_scores_gemma":[0.0023057228,0.00021056681,0.0003314309,0.0005684895,0.0017297206,0.0018817863,0.0011450344,0.0009868104,0.0003611782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061250226,0.000016193271,0.0010688624,0.000043898268,0.0000045434012,0.00007354374,0.00023651063,0.004953917,0.0019557455,0.9768346,0.0018546467,0.012896281],"study_design_scores_gemma":[0.000028638884,0.000038028273,0.0007964143,0.000024199435,0.000008008496,0.00015360351,0.00024863402,0.042510893,0.002307713,0.94798326,0.0058817784,0.000018749284],"about_ca_topic_score_codex":0.0012699419,"about_ca_topic_score_gemma":0.0015845923,"teacher_disagreement_score":0.0030836086,"about_ca_system_score_codex":0.00077818386,"about_ca_system_score_gemma":0.00042729688,"threshold_uncertainty_score":0.010315716},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030207975,0.0018635726,0.86735845,0.0022113258,0.00080121576,0.00040347234,0.002165548,0.003195157,0.09179323],"genre_scores_gemma":[0.4047387,0.0043676263,0.5121216,0.0023151217,0.0010760059,0.0010455293,0.0075899675,0.0026257995,0.06411964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99699867,0.0012539963,0.00024909695,0.0005459757,0.00070868194,0.00024357736],"domain_scores_gemma":[0.9935521,0.0030042066,0.00053990696,0.0017419485,0.0008173281,0.0003445302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022385302,0.0012018301,0.0013031146,0.0033799985,0.0015663592,0.0051055336,0.001646295,0.0011335625,0.030378433],"category_scores_gemma":[0.012658017,0.0007108424,0.0020073336,0.0043133483,0.0029865068,0.007848846,0.0034047298,0.002325885,0.005401395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012042078,0.00004039916,0.00047837108,0.00019150843,0.000040896197,0.0001612941,0.0003195811,0.006433136,0.00056913117,0.91531855,0.014461585,0.061865184],"study_design_scores_gemma":[0.000023571682,0.0000364025,0.00023335034,0.0000732201,0.000028370634,0.00015340955,0.00007992165,0.01492578,0.00033756637,0.94852144,0.035567667,0.000019316432],"about_ca_topic_score_codex":0.002369493,"about_ca_topic_score_gemma":0.0023210559,"teacher_disagreement_score":0.030378433,"about_ca_system_score_codex":0.001424186,"about_ca_system_score_gemma":0.00095799554,"threshold_uncertainty_score":0.10162598},"labels":[],"label_agreement":null},{"id":"W2394717430","doi":"","title":"Total edge irregularity strength of a categorical product of two paths.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Categorical variable; Enhanced Data Rates for GSM Evolution; Product (mathematics); Statistics; Geometry; Artificial intelligence; Computer science","score_opus":0.010530644588636907,"score_gpt":0.22939063971975704,"score_spread":0.21885999513112014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394717430","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8054592,0.0004145588,0.111820646,0.0014887493,0.00022550397,0.000056972734,0.0006709208,0.00041094064,0.07945236],"genre_scores_gemma":[0.9767833,0.0001310935,0.014846911,0.00018173024,0.000097199285,0.000040501418,0.00033184502,0.000116586314,0.0074707805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835014,0.00044539524,0.00010338338,0.00041763234,0.00038866446,0.00029473973],"domain_scores_gemma":[0.9910233,0.004467828,0.0011149654,0.0011778156,0.0009504282,0.001265665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001645564,0.00041468223,0.0008667045,0.0023878384,0.0024535835,0.0039070235,0.0014303876,0.0013066952,0.010726395],"category_scores_gemma":[0.0073146825,0.00065022195,0.00080775644,0.0016800002,0.003030914,0.0064232345,0.0029588577,0.0023684956,0.00092397653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013006682,0.000039305276,0.0015742424,0.0000618656,0.000018749413,0.00013644581,0.00025758118,0.0014556191,0.0017141654,0.9868859,0.001415218,0.0063108183],"study_design_scores_gemma":[0.000023951063,0.00003606896,0.0009429102,0.000027861091,0.000037097547,0.00032129834,0.00029550228,0.009513026,0.001726308,0.98304784,0.0040006805,0.000027354798],"about_ca_topic_score_codex":0.00091036304,"about_ca_topic_score_gemma":0.00095182535,"teacher_disagreement_score":0.010726395,"about_ca_system_score_codex":0.0012671382,"about_ca_system_score_gemma":0.0005245441,"threshold_uncertainty_score":0.035883367},"labels":[],"label_agreement":null},{"id":"W2394771716","doi":"","title":"Distance two labelings of Cartesian products of complete graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cartesian product; Combinatorics; Discrete mathematics","score_opus":0.017017796823218065,"score_gpt":0.23480431987230163,"score_spread":0.21778652304908358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394771716","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53196365,0.0018498361,0.33181995,0.0030895148,0.0004086446,0.00012362012,0.0026200674,0.00067781634,0.12744685],"genre_scores_gemma":[0.8545773,0.0006198281,0.11382645,0.0004647968,0.00017010992,0.00011963113,0.002121103,0.00025583862,0.0278449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824715,0.0006120278,0.00013054756,0.00045938435,0.00032413172,0.00022674658],"domain_scores_gemma":[0.9919565,0.0046772836,0.0008246362,0.0010416742,0.0006499967,0.0008498934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013397544,0.00045697755,0.0006355182,0.0017966776,0.0018289037,0.004107393,0.0011281676,0.0013027088,0.010448339],"category_scores_gemma":[0.007765803,0.00075396977,0.00082979194,0.001986992,0.0025940249,0.0062003164,0.0028320167,0.002346749,0.0012517298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015761412,0.0000410858,0.0010117735,0.00008460197,0.000015462641,0.00006801571,0.00048543428,0.0013934858,0.0010481033,0.9758518,0.004384455,0.015458211],"study_design_scores_gemma":[0.000035367404,0.000035648023,0.00088865915,0.000053443433,0.000027570102,0.00027389967,0.00044588684,0.0073450753,0.0017183765,0.9733968,0.015755007,0.000024337118],"about_ca_topic_score_codex":0.0012555819,"about_ca_topic_score_gemma":0.0018404311,"teacher_disagreement_score":0.010448339,"about_ca_system_score_codex":0.0016339646,"about_ca_system_score_gemma":0.0006945921,"threshold_uncertainty_score":0.034953177},"labels":[],"label_agreement":null},{"id":"W2394851076","doi":"","title":"E 3 -cordiality os some helm-related graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.020933417012222857,"score_gpt":0.23734712840693847,"score_spread":0.2164137113947156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394851076","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64402777,0.00086414354,0.074009806,0.0040830798,0.00040488713,0.000118468815,0.0019335299,0.00069928274,0.273859],"genre_scores_gemma":[0.92188513,0.0004092539,0.023854014,0.00091430004,0.00015581092,0.000074894124,0.0011447485,0.00016836674,0.0513935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995863,0.00009198647,0.000018881987,0.00011113669,0.00006370174,0.0001280353],"domain_scores_gemma":[0.99845636,0.00063538924,0.00024152009,0.00024474767,0.00017014757,0.00025183955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038440895,0.00047253293,0.00040857558,0.0014134935,0.0024708665,0.0018115685,0.0008948232,0.0010896132,0.020130293],"category_scores_gemma":[0.002195419,0.0003043233,0.0005177921,0.001226438,0.0014747566,0.0027556536,0.0018342145,0.0016936677,0.0019488259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014585082,0.00007023941,0.0017130732,0.00012598753,0.000019864983,0.0002807661,0.00041205765,0.0015886443,0.0031327505,0.9615398,0.010519301,0.020451725],"study_design_scores_gemma":[0.00002957953,0.000023793491,0.0015395476,0.00003799637,0.000026498792,0.00042951756,0.00046198958,0.0062669753,0.003008574,0.9662861,0.021870015,0.000019275725],"about_ca_topic_score_codex":0.0019412164,"about_ca_topic_score_gemma":0.0030450022,"teacher_disagreement_score":0.020130293,"about_ca_system_score_codex":0.0013695922,"about_ca_system_score_gemma":0.0004869623,"threshold_uncertainty_score":0.06734258},"labels":[],"label_agreement":null},{"id":"W2394857480","doi":"","title":"Edge-magic and Vertex-magic Total Labelings of Certain Cycles.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"MAGIC (telescope); Mathematics; Vertex (graph theory); Combinatorics; Enhanced Data Rates for GSM Evolution; Astronomy; Artificial intelligence; Physics; Computer science; Graph","score_opus":0.008514106933542641,"score_gpt":0.22291343160608967,"score_spread":0.21439932467254702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394857480","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6266563,0.0017001053,0.15421672,0.00260344,0.00022127184,0.00012069314,0.0039501702,0.0005299644,0.2100014],"genre_scores_gemma":[0.9245804,0.0007517712,0.044708267,0.0004153796,0.00015687912,0.0001309281,0.0024784664,0.00015936724,0.026618581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993656,0.000176546,0.00004296504,0.00014294336,0.00013517906,0.0001366394],"domain_scores_gemma":[0.99667466,0.0016795977,0.00046339104,0.0004588197,0.00035705662,0.00036648914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065291394,0.00041249758,0.0004507102,0.0015425899,0.0015701954,0.0026172788,0.0010117298,0.00082999526,0.01084565],"category_scores_gemma":[0.004388137,0.00046749756,0.0006472921,0.0018756426,0.0016381338,0.0037245331,0.0014727203,0.0012099307,0.00078673166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009745425,0.00002152853,0.00069563946,0.00007929778,0.000013544881,0.000050073093,0.00017937558,0.0023089543,0.00094065,0.9794679,0.0048284507,0.011317145],"study_design_scores_gemma":[0.00003276394,0.000017081233,0.00070561975,0.000031268344,0.000024553641,0.00018580492,0.00020019613,0.009941458,0.0011409611,0.97835976,0.009345077,0.000015602513],"about_ca_topic_score_codex":0.0020192743,"about_ca_topic_score_gemma":0.0030801878,"teacher_disagreement_score":0.01084565,"about_ca_system_score_codex":0.0013230515,"about_ca_system_score_gemma":0.0007699244,"threshold_uncertainty_score":0.03628236},"labels":[],"label_agreement":null},{"id":"W2394956211","doi":"","title":"Super edge-magic total labeling of subdivision of stars.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Stars; Subdivision; MAGIC (telescope); Mathematics; Enhanced Data Rates for GSM Evolution; Astronomy; Astrophysics; Combinatorics; Physics; Geography; Computer science; Artificial intelligence; Archaeology","score_opus":0.008959936414384752,"score_gpt":0.21667178830519146,"score_spread":0.2077118518908067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394956211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4097848,0.0010869888,0.42263645,0.0011283676,0.0002428088,0.00010936895,0.0014512078,0.00084617164,0.16271389],"genre_scores_gemma":[0.7999354,0.00054454297,0.16657984,0.0005207897,0.00011164993,0.00009812711,0.0019602696,0.0003248543,0.029924506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999443,0.00015701102,0.000031600113,0.00011846513,0.00014538312,0.00010461682],"domain_scores_gemma":[0.99864453,0.00052558974,0.00010918599,0.0003737333,0.00018632416,0.0001606662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005347329,0.00033064318,0.00058110745,0.0008530384,0.0011219521,0.0015496513,0.0010065823,0.0007368701,0.009566825],"category_scores_gemma":[0.0021028926,0.00038012455,0.0006086053,0.0012947916,0.0013428669,0.0029208616,0.00211261,0.0013023764,0.0012210261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015716394,0.000035629637,0.00075076753,0.00014692119,0.000015629039,0.00005710403,0.00026442006,0.005836404,0.0040196134,0.94084376,0.0077290777,0.040143482],"study_design_scores_gemma":[0.000031216357,0.000036498543,0.00056799466,0.000033101413,0.000023831053,0.00014872252,0.00017354955,0.025023354,0.0028997327,0.95667845,0.014371039,0.000012585802],"about_ca_topic_score_codex":0.0016148215,"about_ca_topic_score_gemma":0.0027114633,"teacher_disagreement_score":0.009566825,"about_ca_system_score_codex":0.00093239476,"about_ca_system_score_gemma":0.00054712145,"threshold_uncertainty_score":0.032004178},"labels":[],"label_agreement":null},{"id":"W2395108022","doi":"","title":"Toughness and [a, b]-factors in graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Toughness; Combinatorics; Composite material; Materials science","score_opus":0.014504232643347797,"score_gpt":0.22933289122170963,"score_spread":0.21482865857836184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395108022","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5317949,0.004279052,0.24865052,0.009943079,0.00067239045,0.00013854404,0.0023459815,0.0010547617,0.20112085],"genre_scores_gemma":[0.9322949,0.0010861155,0.038396206,0.0008599795,0.00044271623,0.00014787883,0.0010251586,0.0002600317,0.025487004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980921,0.0005625327,0.00010828483,0.0004992402,0.00031557478,0.0004222644],"domain_scores_gemma":[0.990851,0.0055270838,0.0009089996,0.0009505498,0.00051889,0.0012434094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014230338,0.0007918737,0.0009828021,0.002672818,0.0040304177,0.004902976,0.0016982824,0.001911935,0.017264348],"category_scores_gemma":[0.008688561,0.00088379753,0.0011370134,0.0030969367,0.005151545,0.0107627455,0.0030766784,0.0033620864,0.0017025435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007528927,0.000032999338,0.0006852332,0.00005688869,0.000012921,0.000057896865,0.0003344993,0.0011378004,0.0005540856,0.98588145,0.0043007554,0.0068700714],"study_design_scores_gemma":[0.000013781398,0.00000878368,0.00041044445,0.000025552035,0.000010426214,0.00010684459,0.00022166135,0.0030146404,0.00028613853,0.9910239,0.004862275,0.000015579331],"about_ca_topic_score_codex":0.004740545,"about_ca_topic_score_gemma":0.0041743573,"teacher_disagreement_score":0.017264348,"about_ca_system_score_codex":0.002048713,"about_ca_system_score_gemma":0.000915732,"threshold_uncertainty_score":0.057754934},"labels":[],"label_agreement":null},{"id":"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015555114,0.006451164,0.0288133,0.00653309,0.011954727,0.00017246709,0.008351715,0.0031093913,0.9330587],"genre_scores_gemma":[0.009082667,0.0020411175,0.0058227126,0.00055245217,0.0015269269,0.00012825626,0.0053922674,0.00096435566,0.97448933],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888545,0.00014844279,0.000066780536,0.0003891817,0.00038193006,0.00012827713],"domain_scores_gemma":[0.9977906,0.00038998108,0.00012117593,0.00038713336,0.0009008927,0.0004102141],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012220959,0.0022076922,0.0013414288,0.0016592977,0.001802643,0.005428475,0.001493394,0.0019456419,0.6224866],"category_scores_gemma":[0.004156305,0.0005567808,0.0007825434,0.003319429,0.00085535645,0.0037297353,0.0025673308,0.0021540206,0.5712322],"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.00013315355,0.00003477558,0.00022894412,0.0003028326,0.000016825132,0.00007897932,0.00005232106,0.0004315356,0.0011261869,0.042119734,0.79572517,0.1597495],"study_design_scores_gemma":[0.000016613634,0.00002441478,0.00024771257,0.00006734492,0.000007645898,0.00007755605,0.000032006516,0.0007769571,0.0003934165,0.00871204,0.9896327,0.000011617359],"about_ca_topic_score_codex":0.0032298414,"about_ca_topic_score_gemma":0.004341059,"teacher_disagreement_score":0.6224866,"about_ca_system_score_codex":0.0021525258,"about_ca_system_score_gemma":0.0016719478,"threshold_uncertainty_score":0.53847706},"labels":[],"label_agreement":null},{"id":"W2395211755","doi":"","title":"On product cordial graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Product (mathematics); Combinatorics; Pure mathematics; Geometry","score_opus":0.021410593883876842,"score_gpt":0.2174355615480047,"score_spread":0.19602496766412786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395211755","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24327423,0.004625001,0.34009016,0.0070179505,0.00087116356,0.00015321691,0.002402871,0.0014341932,0.40013117],"genre_scores_gemma":[0.7868281,0.0029092764,0.11405444,0.0015842259,0.00061187736,0.00021483118,0.0026490313,0.0004971331,0.090651184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991616,0.0002480819,0.00004870643,0.00021045943,0.00017684643,0.0001543063],"domain_scores_gemma":[0.9970709,0.0015083329,0.000311819,0.0005593983,0.00024028865,0.000309216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008276401,0.00065536646,0.0006892863,0.0016095939,0.0018029157,0.0027977629,0.0012431152,0.0011937056,0.018902624],"category_scores_gemma":[0.0042923656,0.00041704276,0.0006587728,0.0023215925,0.0021848662,0.008189246,0.002419675,0.0024254865,0.0027333484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033403685,0.000022363638,0.00029072084,0.00007347237,0.0000061106316,0.000036900536,0.00010960996,0.0010310577,0.00042248875,0.9740336,0.0065468512,0.017393375],"study_design_scores_gemma":[0.000009617927,0.000008996686,0.0002086629,0.000028988034,0.000007352615,0.000110212306,0.0000902227,0.0049354886,0.0005355317,0.9805611,0.013496054,0.000007803884],"about_ca_topic_score_codex":0.0013254554,"about_ca_topic_score_gemma":0.0024055107,"teacher_disagreement_score":0.018902624,"about_ca_system_score_codex":0.0018247031,"about_ca_system_score_gemma":0.00054947735,"threshold_uncertainty_score":0.06323558},"labels":[],"label_agreement":null},{"id":"W2395394216","doi":"","title":"On odd graceful graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.009157674903082835,"score_gpt":0.2104046251129762,"score_spread":0.20124695020989336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395394216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4740932,0.0032074691,0.19793819,0.007118637,0.00065890676,0.00012952428,0.0024208478,0.0013985101,0.31303474],"genre_scores_gemma":[0.91852224,0.0014839415,0.03638182,0.0008607368,0.00039657814,0.00011464666,0.0013224555,0.00034740995,0.04057018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992235,0.0001935226,0.00003446781,0.0001799132,0.00015806427,0.00021062147],"domain_scores_gemma":[0.9974124,0.0012217963,0.00034118813,0.0005162834,0.00015075837,0.00035753805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000740736,0.00066484953,0.00063006324,0.0016484014,0.0020255444,0.002882643,0.0011161376,0.00092496397,0.011033044],"category_scores_gemma":[0.0030365703,0.00037717776,0.0006657746,0.0016394624,0.0026536211,0.0053766035,0.0024501265,0.001923409,0.0015237043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056516936,0.000022561297,0.00047636195,0.0000743751,0.0000074492764,0.000055489112,0.00015693235,0.0021467507,0.0008622054,0.97790456,0.006324287,0.011912422],"study_design_scores_gemma":[0.000010676947,0.000006724407,0.0002413723,0.000019604267,0.000007390177,0.000077405384,0.000096841846,0.0049555087,0.0005857027,0.9864347,0.007555456,0.000008633156],"about_ca_topic_score_codex":0.0019456022,"about_ca_topic_score_gemma":0.0030838065,"teacher_disagreement_score":0.011033044,"about_ca_system_score_codex":0.0017780631,"about_ca_system_score_gemma":0.0007303127,"threshold_uncertainty_score":0.036909282},"labels":[],"label_agreement":null},{"id":"W2395661573","doi":"","title":"A Note on General Neighbor-Distinguishing Total Coloring of Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Complete coloring; Combinatorics; Edge coloring; Brooks' theorem; 1-planar graph; Graph; Chordal graph; Line graph","score_opus":0.016497075075628122,"score_gpt":0.24646415658847246,"score_spread":0.22996708151284434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395661573","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04921685,0.009851089,0.55529934,0.012326761,0.0054717916,0.00015632709,0.0014150823,0.0013558561,0.3649069],"genre_scores_gemma":[0.614294,0.0124943685,0.29777578,0.0076527107,0.004496036,0.00030726235,0.001942977,0.0010113212,0.060025714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984956,0.0003994168,0.000065631844,0.00042311708,0.00044333813,0.0001728872],"domain_scores_gemma":[0.99484766,0.0032576036,0.00014451772,0.0010883348,0.00035517468,0.00030662576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021522902,0.0009807723,0.0010319774,0.0016499378,0.0021300348,0.0027309046,0.0026363817,0.0014720093,0.009362495],"category_scores_gemma":[0.0067977156,0.0006557679,0.001183667,0.002839342,0.0036291957,0.0066051604,0.0034728453,0.0057289293,0.001311122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074051655,0.0000459507,0.00055914663,0.00022423166,0.00002131173,0.00013484785,0.00015200471,0.0039465656,0.0013058598,0.94531786,0.024905104,0.023312964],"study_design_scores_gemma":[0.000012473722,0.000021856913,0.00039313582,0.000034800934,0.000023142944,0.00022990817,0.00006629379,0.009399023,0.0006487091,0.9596027,0.02954985,0.00001800301],"about_ca_topic_score_codex":0.0033248258,"about_ca_topic_score_gemma":0.0061282967,"teacher_disagreement_score":0.009362495,"about_ca_system_score_codex":0.0021071336,"about_ca_system_score_gemma":0.0011577735,"threshold_uncertainty_score":0.03132063},"labels":[],"label_agreement":null},{"id":"W2395759456","doi":"","title":"Genralization of Some Results on Cordial Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.026204220053683995,"score_gpt":0.2261788376885054,"score_spread":0.1999746176348214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395759456","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072167136,0.018163057,0.24841881,0.023367627,0.0035541547,0.0001939667,0.0028614374,0.001650904,0.62962294],"genre_scores_gemma":[0.6745762,0.018789422,0.1269215,0.011265668,0.005778058,0.00049635756,0.005903947,0.0012315096,0.1550374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904424,0.00025598047,0.00004577692,0.00023416414,0.00026005227,0.00015976116],"domain_scores_gemma":[0.99468505,0.0029777137,0.00031470155,0.00092782266,0.00059347413,0.00050119107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001234488,0.0012270901,0.0009193627,0.003729317,0.0026096422,0.0032086265,0.0021581836,0.0015481898,0.031087046],"category_scores_gemma":[0.007653577,0.00045731745,0.0012418678,0.0039623133,0.0025060996,0.0078327395,0.0032981166,0.005448523,0.0042823465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068470465,0.00008001162,0.00057119614,0.00036862987,0.000023923725,0.00015839475,0.00019380594,0.0017646527,0.0009136058,0.9380375,0.03208929,0.02573044],"study_design_scores_gemma":[0.000016969252,0.000028650324,0.00054057856,0.0000934859,0.000027575881,0.00025740502,0.00015773797,0.0066106454,0.0009542517,0.94255084,0.048745193,0.000016692617],"about_ca_topic_score_codex":0.0024487122,"about_ca_topic_score_gemma":0.0028138075,"teacher_disagreement_score":0.031087046,"about_ca_system_score_codex":0.0027742551,"about_ca_system_score_gemma":0.0010587429,"threshold_uncertainty_score":0.103996515},"labels":[],"label_agreement":null},{"id":"W2395769526","doi":"","title":"On Cordial Labelings of Wheels with Other Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.017006999747110653,"score_gpt":0.2074423818902472,"score_spread":0.19043538214313654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395769526","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23358573,0.002984793,0.4470918,0.0051560104,0.0009565698,0.0001990605,0.0015700758,0.0018975249,0.30655837],"genre_scores_gemma":[0.7296928,0.001980978,0.17311879,0.0015535506,0.0005741996,0.00028455615,0.0020125099,0.0008137946,0.08996878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99878305,0.000423204,0.00007620211,0.0002625281,0.00021319704,0.00024174868],"domain_scores_gemma":[0.996267,0.0018513913,0.00038422827,0.0007552959,0.00027266814,0.00046948358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011066345,0.0007024301,0.0007470335,0.0017626993,0.0030588664,0.003019628,0.0017515153,0.00162747,0.01965992],"category_scores_gemma":[0.0061030556,0.00062253245,0.0010419278,0.0025396768,0.002855969,0.008433193,0.0036790995,0.0028144966,0.0029351737],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004207616,0.000034202327,0.0003346799,0.00005853664,0.0000057865786,0.00004366791,0.0001775723,0.0020469807,0.0003742868,0.9746721,0.0061552622,0.01605481],"study_design_scores_gemma":[0.000013185824,0.000011643231,0.00025149656,0.000040094383,0.000008233706,0.00009911009,0.00015361248,0.009828059,0.0005627012,0.97323,0.01578997,0.0000119972565],"about_ca_topic_score_codex":0.0042954297,"about_ca_topic_score_gemma":0.0063775303,"teacher_disagreement_score":0.01965992,"about_ca_system_score_codex":0.0023822745,"about_ca_system_score_gemma":0.00076346,"threshold_uncertainty_score":0.06576896},"labels":[],"label_agreement":null},{"id":"W2395782104","doi":"","title":"L(2, 1)-labeling of Block Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Block (permutation group theory); Combinatorics","score_opus":0.023279207680456576,"score_gpt":0.23850903038741647,"score_spread":0.2152298227069599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395782104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3130166,0.0016180816,0.44618955,0.0069307527,0.00053027866,0.00023501289,0.0068807104,0.0020181905,0.22258082],"genre_scores_gemma":[0.7501744,0.000815919,0.18249974,0.0015746958,0.00028825074,0.0003046658,0.005023322,0.0006213878,0.05869757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989712,0.00034897288,0.000052387306,0.00023448712,0.0001602301,0.00023278018],"domain_scores_gemma":[0.99657696,0.0016355404,0.00042567204,0.00067793945,0.00031196073,0.0003719043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080108066,0.00050078746,0.00067385775,0.0011333681,0.0018273166,0.0028525668,0.001368959,0.0014791574,0.015951343],"category_scores_gemma":[0.0041376976,0.0004845492,0.0006534898,0.001411705,0.0014042137,0.0044000964,0.0018173524,0.00205753,0.002856204],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020157846,0.000093066235,0.0011869079,0.00020597967,0.000021268836,0.00007957553,0.00021728419,0.0056342813,0.0036504325,0.9309963,0.022770405,0.034942918],"study_design_scores_gemma":[0.00003497361,0.000026996247,0.00066839263,0.00004046534,0.000017406466,0.00015704473,0.00017585274,0.022171216,0.002266143,0.95751476,0.0169087,0.00001801211],"about_ca_topic_score_codex":0.002363017,"about_ca_topic_score_gemma":0.0040920204,"teacher_disagreement_score":0.015951343,"about_ca_system_score_codex":0.0019622133,"about_ca_system_score_gemma":0.0010721337,"threshold_uncertainty_score":0.05336255},"labels":[],"label_agreement":null},{"id":"W2395847857","doi":"","title":"On Antimagic Labeling For Power of Cycles.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Power (physics); Physics","score_opus":0.023664572988591624,"score_gpt":0.24013102645914747,"score_spread":0.21646645347055585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395847857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20179567,0.004899231,0.4239327,0.0099750385,0.0010121939,0.00024638273,0.0018869466,0.0013638786,0.35488793],"genre_scores_gemma":[0.79642445,0.0034339428,0.12650773,0.0028503253,0.0010341256,0.0003606757,0.002212793,0.00075896725,0.06641707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985813,0.00047278372,0.000085995845,0.0003131846,0.00027764327,0.00026919477],"domain_scores_gemma":[0.99464464,0.0033118203,0.00030122895,0.00088531885,0.0004023622,0.00045479918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013954,0.0007024663,0.0010380469,0.002261991,0.0030889607,0.0039663767,0.0017730802,0.002299552,0.017451191],"category_scores_gemma":[0.0077505885,0.0006259323,0.0011010965,0.003164703,0.0032016202,0.012337622,0.0039101127,0.0032711334,0.0029189666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003381427,0.00002578366,0.000209857,0.00007550372,0.0000065114064,0.00003861792,0.00016539266,0.001042934,0.0003859872,0.97899365,0.006418896,0.012603092],"study_design_scores_gemma":[0.000008299699,0.0000070977553,0.00009815778,0.000022385779,0.000007162188,0.000057417325,0.00008565402,0.0035418603,0.00028392195,0.9887362,0.0071442234,0.000007675975],"about_ca_topic_score_codex":0.0020703813,"about_ca_topic_score_gemma":0.003031985,"teacher_disagreement_score":0.017451191,"about_ca_system_score_codex":0.002669694,"about_ca_system_score_gemma":0.00097381516,"threshold_uncertainty_score":0.058380067},"labels":[],"label_agreement":null},{"id":"W2395908865","doi":"","title":"On γ-labelings of complete bipartite graphs","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Complete bipartite graph; Discrete mathematics; Graph","score_opus":0.014358928298667419,"score_gpt":0.21788850341307503,"score_spread":0.2035295751144076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395908865","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49670428,0.0016133578,0.40048394,0.0053051882,0.00024966674,0.00017978407,0.0024398407,0.00083945465,0.092184395],"genre_scores_gemma":[0.8364234,0.0020002439,0.12573792,0.0013608196,0.0005304603,0.0004290448,0.0034040355,0.00057389104,0.029540228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997336,0.0010851949,0.00016943683,0.00057882577,0.0004165958,0.00041402018],"domain_scores_gemma":[0.9809378,0.013279289,0.0019351891,0.0017308247,0.00076444284,0.0013525164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025856355,0.0013724242,0.0015876037,0.00326538,0.003173823,0.006549288,0.0029756594,0.002594422,0.010565892],"category_scores_gemma":[0.012800686,0.0015755517,0.0016536037,0.0045351926,0.004963797,0.011641422,0.0045706825,0.0048198104,0.0014476749],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010613202,0.00005649254,0.0007583406,0.00010356211,0.000015142146,0.000058958576,0.0004150017,0.005798305,0.000706338,0.9771274,0.0036013531,0.011252974],"study_design_scores_gemma":[0.00001980953,0.000008792681,0.00020874951,0.000030180903,0.000009044458,0.00004680108,0.00013787976,0.011273883,0.00025005976,0.9862831,0.0017204263,0.000011319241],"about_ca_topic_score_codex":0.002292737,"about_ca_topic_score_gemma":0.0029383292,"teacher_disagreement_score":0.010565892,"about_ca_system_score_codex":0.0033271967,"about_ca_system_score_gemma":0.001061497,"threshold_uncertainty_score":0.035346508},"labels":[],"label_agreement":null},{"id":"W2395961356","doi":"","title":"Super Mean Labeling Of Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01093251859470826,"score_gpt":0.2115813766574638,"score_spread":0.20064885806275554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395961356","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17628843,0.003167057,0.6024905,0.007928626,0.00081803964,0.000094095325,0.0020653172,0.0014616117,0.20568632],"genre_scores_gemma":[0.7267428,0.001605586,0.21531418,0.0021614302,0.0009780133,0.00023806375,0.0024967324,0.0007003004,0.04976296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863356,0.00044489777,0.000053538803,0.0003200809,0.00033137327,0.00021648896],"domain_scores_gemma":[0.9954125,0.0022236446,0.00034971297,0.0011279171,0.00045732845,0.00042888304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013027547,0.0005234852,0.0009232435,0.0018089603,0.0024189984,0.0028420202,0.0017645461,0.0016341584,0.011668733],"category_scores_gemma":[0.0057555623,0.00057603634,0.0009764206,0.0021897117,0.002154526,0.006383622,0.0026203305,0.0035827581,0.0018744932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045820714,0.000026385771,0.00027232812,0.000074704556,0.000009687861,0.000020254476,0.00009944477,0.0016269886,0.00078354875,0.97293663,0.008527185,0.015576971],"study_design_scores_gemma":[0.0000072306448,0.0000094709085,0.00025151475,0.000017405831,0.000008931457,0.000059922124,0.00006212788,0.011562846,0.00062471075,0.980357,0.0070307655,0.000007976855],"about_ca_topic_score_codex":0.001604313,"about_ca_topic_score_gemma":0.0033460031,"teacher_disagreement_score":0.011668733,"about_ca_system_score_codex":0.0023560366,"about_ca_system_score_gemma":0.0010804717,"threshold_uncertainty_score":0.039035857},"labels":[],"label_agreement":null},{"id":"W2396546079","doi":"","title":"Some classes of antimagic graphs with regular subgraphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.007502609494251957,"score_gpt":0.20052203171615424,"score_spread":0.19301942222190227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396546079","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4922121,0.002776763,0.17119406,0.006862874,0.000451249,0.00029151444,0.0049656807,0.0013674395,0.31987846],"genre_scores_gemma":[0.9100577,0.0013736828,0.048250668,0.0012897782,0.00043978036,0.00028585328,0.0041620876,0.00026346653,0.03387699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990212,0.00023493603,0.00006705153,0.00028415906,0.0002016385,0.00019107177],"domain_scores_gemma":[0.99602544,0.0020762524,0.0005221119,0.0005666304,0.0002848835,0.0005246845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007089785,0.000603353,0.00062649266,0.002318029,0.002428837,0.004364315,0.0015120698,0.0017552034,0.012346771],"category_scores_gemma":[0.0045762206,0.0006443682,0.0009961439,0.002336435,0.0018041545,0.0051710242,0.0021870732,0.002128835,0.001580155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006659138,0.000050147068,0.0008936396,0.00010270677,0.000016651607,0.00012318666,0.0002172986,0.0012542304,0.00086733047,0.9733074,0.010701337,0.012399523],"study_design_scores_gemma":[0.000032289732,0.000016905955,0.0007738859,0.000037941736,0.000026773465,0.0003996037,0.00023448629,0.0074588056,0.00082843297,0.97198415,0.01819183,0.000014799058],"about_ca_topic_score_codex":0.0013208626,"about_ca_topic_score_gemma":0.001715895,"teacher_disagreement_score":0.012346771,"about_ca_system_score_codex":0.001956976,"about_ca_system_score_gemma":0.0007289053,"threshold_uncertainty_score":0.041304052},"labels":[],"label_agreement":null},{"id":"W2396761519","doi":"","title":"3-Connected Simple Graphs With The Same Genus Distributions.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Genus; Simple (philosophy); Combinatorics; Botany; Biology","score_opus":0.007729190735094693,"score_gpt":0.20596408972855457,"score_spread":0.19823489899345986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396761519","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7690839,0.0007570354,0.10042812,0.0025847065,0.00024320801,0.00008471273,0.0019291572,0.0008840833,0.12400508],"genre_scores_gemma":[0.9632397,0.00033171303,0.021561326,0.00044533712,0.000085098785,0.00007506039,0.00093474146,0.00015795643,0.013169114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994634,0.00014868329,0.000029345993,0.0001230719,0.00012758908,0.000107995205],"domain_scores_gemma":[0.99746007,0.0010598496,0.0004304798,0.000490145,0.00021799911,0.0003415253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053740415,0.00055567373,0.0005292527,0.0017082293,0.0017245798,0.0027177797,0.0010498606,0.0015942384,0.00902039],"category_scores_gemma":[0.0030385545,0.000387434,0.0006026955,0.001444586,0.0017995336,0.003908455,0.0017402007,0.0012380743,0.0012850062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016465041,0.00006502261,0.0015291204,0.00009237532,0.000022359965,0.0001851744,0.00028260052,0.0033343476,0.004331198,0.97048765,0.004913794,0.014591713],"study_design_scores_gemma":[0.000037471425,0.000017322685,0.0016882432,0.000033096494,0.00002300756,0.0003276347,0.00025481588,0.010457927,0.0026788064,0.97707343,0.0073874546,0.000020707072],"about_ca_topic_score_codex":0.0008217167,"about_ca_topic_score_gemma":0.0013420294,"teacher_disagreement_score":0.00902039,"about_ca_system_score_codex":0.0009517092,"about_ca_system_score_gemma":0.00039032806,"threshold_uncertainty_score":0.030176222},"labels":[],"label_agreement":null},{"id":"W2396838939","doi":"","title":"Injectively (Δ+1)-choosable graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.009431040274922177,"score_gpt":0.20867477830843104,"score_spread":0.19924373803350887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396838939","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55190414,0.0014758081,0.23081832,0.0046620346,0.00032511837,0.00015241507,0.0077175493,0.0015282532,0.20141636],"genre_scores_gemma":[0.9122402,0.00062271894,0.052963242,0.00067350024,0.00010787684,0.00011073912,0.0033303325,0.00023840329,0.029713014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993604,0.00014178829,0.000039918883,0.00018027743,0.00011317519,0.00016449706],"domain_scores_gemma":[0.9960936,0.002273227,0.0003868743,0.000725444,0.00018454813,0.00033640378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056145067,0.00046122298,0.00049007544,0.00066120166,0.000908817,0.0024798797,0.0014614975,0.00090315373,0.013578586],"category_scores_gemma":[0.0031563384,0.00046542022,0.0004990724,0.00096538005,0.0012640035,0.0035553765,0.0014344457,0.001959591,0.0015928904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040901374,0.00018121008,0.005132413,0.00037759935,0.00005295583,0.00024875716,0.0003681782,0.010527006,0.013310771,0.88979584,0.018523384,0.061072994],"study_design_scores_gemma":[0.00008690366,0.00006270131,0.0033239974,0.000067975474,0.000063910906,0.00069371663,0.00039286938,0.022596886,0.009594343,0.94430447,0.018774478,0.00003765907],"about_ca_topic_score_codex":0.0010182947,"about_ca_topic_score_gemma":0.002158883,"teacher_disagreement_score":0.013578586,"about_ca_system_score_codex":0.0011424506,"about_ca_system_score_gemma":0.0006281168,"threshold_uncertainty_score":0.04542494},"labels":[],"label_agreement":null},{"id":"W2396884769","doi":"","title":"Magic graphs with pendant edges.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"MAGIC (telescope); Mathematics; Combinatorics; Physics; Astronomy","score_opus":0.022055702923060992,"score_gpt":0.2063858009166787,"score_spread":0.18433009799361771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396884769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24871123,0.0038742817,0.4401391,0.0064227805,0.0008585868,0.00018715589,0.0043025226,0.0012324825,0.29427192],"genre_scores_gemma":[0.7844569,0.0017358706,0.16026302,0.0012470158,0.00034393172,0.00021265542,0.0031022273,0.0002895094,0.04834893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926895,0.00020096025,0.000048800845,0.00018653813,0.00015775341,0.00013701333],"domain_scores_gemma":[0.9969489,0.0016362186,0.0003340024,0.00057546387,0.00021826715,0.00028717666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006654774,0.0005366067,0.0006635199,0.0013189424,0.0020001554,0.0026280545,0.0015005692,0.0014717053,0.0144382],"category_scores_gemma":[0.004209223,0.00064540905,0.00063458254,0.0017247547,0.0017429407,0.0054147854,0.0023899113,0.0021147172,0.0020673797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087008404,0.000031427422,0.00040624387,0.000102057595,0.000014676564,0.00007797182,0.00010256378,0.0019617465,0.0014621989,0.9649286,0.010958114,0.019867394],"study_design_scores_gemma":[0.000025840915,0.000014174473,0.0002886786,0.000039399758,0.000017822927,0.0001956399,0.000114756156,0.008432624,0.0014082347,0.97266996,0.016779019,0.000014013758],"about_ca_topic_score_codex":0.0011382912,"about_ca_topic_score_gemma":0.0023409151,"teacher_disagreement_score":0.0144382,"about_ca_system_score_codex":0.0010664155,"about_ca_system_score_gemma":0.0007401969,"threshold_uncertainty_score":0.048300624},"labels":[],"label_agreement":null},{"id":"W2396899056","doi":"","title":"On the Erdos-Sos Conjecture for Graphs on n = k+3 Vertices.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Discrete mathematics","score_opus":0.011043264951391055,"score_gpt":0.22801828055504764,"score_spread":0.2169750156036566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396899056","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50190353,0.0060049733,0.13053666,0.03768906,0.001831918,0.00016915501,0.005099478,0.0013392013,0.31542605],"genre_scores_gemma":[0.9370045,0.0036185319,0.027936332,0.0030421645,0.00089431193,0.0001554975,0.0030558468,0.00030716683,0.023985755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985373,0.00040036062,0.00007153161,0.00032901563,0.00026397343,0.00039778405],"domain_scores_gemma":[0.99081486,0.0058486983,0.0007963511,0.0012914122,0.0005233198,0.000725354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022853795,0.0008066469,0.0013449789,0.001464101,0.0027517998,0.004321283,0.0016932349,0.002495575,0.013871121],"category_scores_gemma":[0.010197069,0.0007170311,0.0010609784,0.0022012575,0.0039652805,0.0106387595,0.0037448457,0.003578996,0.0024127283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054951856,0.00012835352,0.0031818664,0.00033084425,0.000042557615,0.00015335878,0.00038991717,0.011041818,0.0011087175,0.9255157,0.034189306,0.023368089],"study_design_scores_gemma":[0.000057810532,0.000016592718,0.00077888375,0.000050439452,0.000018055664,0.00009812357,0.0002772982,0.010892533,0.00035858204,0.98022574,0.007206212,0.000019763696],"about_ca_topic_score_codex":0.0036264376,"about_ca_topic_score_gemma":0.004289045,"teacher_disagreement_score":0.013871121,"about_ca_system_score_codex":0.0021295808,"about_ca_system_score_gemma":0.0013011316,"threshold_uncertainty_score":0.046403587},"labels":[],"label_agreement":null},{"id":"W2396930582","doi":"","title":"Toughness of graphs and 2-factors with given properties.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Toughness; Composite material; Materials science","score_opus":0.01074919408569923,"score_gpt":0.1981150459963607,"score_spread":0.18736585191066146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396930582","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.648038,0.002049631,0.20847996,0.0055679344,0.00037344286,0.0001217038,0.0027314918,0.00072812516,0.13190976],"genre_scores_gemma":[0.9595137,0.00054173445,0.023071717,0.00038165977,0.00027581846,0.00010414914,0.0010637962,0.00012580962,0.014921721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864477,0.0003647487,0.00009062341,0.00035644328,0.00027433972,0.0002691192],"domain_scores_gemma":[0.9934487,0.004103654,0.00076573796,0.0005901205,0.00035060415,0.0007413023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011856649,0.0005755024,0.0007942432,0.0020501015,0.0020764216,0.0038721669,0.001200345,0.0012666091,0.014325964],"category_scores_gemma":[0.00641009,0.0006743701,0.0010534478,0.001989774,0.003362377,0.007358814,0.0023416537,0.0022782702,0.0010280713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013175014,0.000050971474,0.0014135975,0.0001140096,0.000023283908,0.00010206965,0.00039534978,0.0032278856,0.0011199735,0.9797763,0.0046632932,0.0089815045],"study_design_scores_gemma":[0.000020151967,0.000018666837,0.0008877142,0.000030358848,0.000014997924,0.000172075,0.00023194164,0.007759188,0.00063930266,0.9858358,0.004370433,0.000019300463],"about_ca_topic_score_codex":0.0018352276,"about_ca_topic_score_gemma":0.0017185818,"teacher_disagreement_score":0.014325964,"about_ca_system_score_codex":0.001482428,"about_ca_system_score_gemma":0.0005680272,"threshold_uncertainty_score":0.047925174},"labels":[],"label_agreement":null},{"id":"W2397069554","doi":"","title":"The Geo-Number Of A Graph.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.01146641964436046,"score_gpt":0.2411054631725974,"score_spread":0.22963904352823694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397069554","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4699649,0.0041754018,0.21774945,0.018183134,0.0016292868,0.000115274044,0.0096243555,0.0009200951,0.27763808],"genre_scores_gemma":[0.9129148,0.0018141862,0.047501914,0.00091910956,0.0006274431,0.00015670354,0.0024740875,0.0002706007,0.033321235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991868,0.00023207116,0.000041640462,0.00021392982,0.00015773322,0.0001678317],"domain_scores_gemma":[0.9964232,0.0018734182,0.00044120787,0.00049592095,0.00028278964,0.00048347944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007121687,0.0005282276,0.0006685889,0.00238724,0.0020364851,0.0035109275,0.0012828477,0.0014042752,0.013481759],"category_scores_gemma":[0.0049058106,0.00035343657,0.0005720251,0.0023555614,0.0029226104,0.007010504,0.0021171968,0.0022421277,0.0022132662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095574214,0.000020261185,0.001436366,0.00010826756,0.000015884012,0.00006291877,0.00021754552,0.0023918224,0.0011268705,0.9673976,0.0117780715,0.015348708],"study_design_scores_gemma":[0.000016572982,0.000020164824,0.0012502214,0.000050487914,0.000022856933,0.00035332417,0.0003342706,0.0073565696,0.0015770021,0.96106845,0.027930832,0.000019210203],"about_ca_topic_score_codex":0.0010244454,"about_ca_topic_score_gemma":0.0011710192,"teacher_disagreement_score":0.013481759,"about_ca_system_score_codex":0.0013726739,"about_ca_system_score_gemma":0.0006571518,"threshold_uncertainty_score":0.045100987},"labels":[],"label_agreement":null},{"id":"W2397079889","doi":"","title":"The Smarandachely Adjacent Vertex Total Coloring of a kind of 3-regular Grapsh.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Fractional coloring; Combinatorics; Total coloring; Complete coloring; Graph","score_opus":0.01918617832098076,"score_gpt":0.20443989668335377,"score_spread":0.185253718362373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397079889","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6499531,0.0005690004,0.11748404,0.0016340805,0.0005317878,0.00008837582,0.0017027634,0.00097204506,0.2270648],"genre_scores_gemma":[0.9188535,0.00020229364,0.039053127,0.0004407773,0.000091329355,0.00004763258,0.0012898574,0.00020757038,0.03981391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998031,0.00004696845,0.0000069573825,0.00004738913,0.00003455833,0.00006106126],"domain_scores_gemma":[0.9996245,0.000097616634,0.000042790787,0.0000903797,0.00005682628,0.00008788719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016669855,0.00028619627,0.0002737389,0.00065852393,0.001400117,0.0011569466,0.0005182775,0.0007268626,0.013113433],"category_scores_gemma":[0.00071741693,0.0002663971,0.00041192136,0.0007172381,0.0010795909,0.0010650428,0.00089896104,0.0009595933,0.0012983178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022560528,0.00004283039,0.001255136,0.00012240635,0.00002276606,0.00042929986,0.00041158267,0.0039911564,0.009260223,0.9541277,0.01470794,0.015403333],"study_design_scores_gemma":[0.00006733197,0.00006402706,0.0024444254,0.000046128047,0.0000348136,0.00090498885,0.0004764267,0.02000622,0.004484985,0.927454,0.04398207,0.00003458309],"about_ca_topic_score_codex":0.0018117013,"about_ca_topic_score_gemma":0.0034638797,"teacher_disagreement_score":0.013113433,"about_ca_system_score_codex":0.00052697863,"about_ca_system_score_gemma":0.0003901292,"threshold_uncertainty_score":0.04386884},"labels":[],"label_agreement":null},{"id":"W2397109063","doi":"","title":"On the adjacent vertex distinguishing total chromatic number of outer plane graph.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Chromatic scale; Graph; Windmill graph; Friendship graph; Graph power; Line graph","score_opus":0.013693243711513285,"score_gpt":0.232055090437218,"score_spread":0.21836184672570472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397109063","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74707,0.0023509348,0.13120198,0.0045506437,0.0004032383,0.00010004959,0.0017964848,0.000466859,0.112059794],"genre_scores_gemma":[0.96144384,0.000794965,0.026814839,0.00039126302,0.0002619231,0.00008822905,0.0010385719,0.00014037394,0.009026098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990339,0.00027237655,0.000030298139,0.00027932524,0.00016066417,0.00022345167],"domain_scores_gemma":[0.99478006,0.0035979627,0.0004708551,0.00045944843,0.00028929472,0.00040226505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011251051,0.00059408427,0.00081073184,0.0021471095,0.002191002,0.002618138,0.0021319126,0.0013934837,0.009890229],"category_scores_gemma":[0.0062415428,0.00044588392,0.00056410534,0.002078453,0.0025061604,0.0060097883,0.0018378105,0.0025701395,0.00083761616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054284645,0.00014965166,0.0049871835,0.0003302083,0.000043974393,0.0001335039,0.0004971188,0.027567385,0.0044722133,0.9125248,0.017174086,0.031577058],"study_design_scores_gemma":[0.00007656875,0.0000701644,0.0034148733,0.0000676701,0.00006955573,0.00028876637,0.0004765056,0.09777718,0.0026764157,0.8864007,0.008634626,0.000046882917],"about_ca_topic_score_codex":0.0034170258,"about_ca_topic_score_gemma":0.0033898589,"teacher_disagreement_score":0.009890229,"about_ca_system_score_codex":0.0026658424,"about_ca_system_score_gemma":0.0009969572,"threshold_uncertainty_score":0.03308612},"labels":[],"label_agreement":null},{"id":"W2397294813","doi":"","title":"A new bound on maximum genus of simple graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Genus; Simple (philosophy); Combinatorics; Zoology; Biology","score_opus":0.023759588533645397,"score_gpt":0.2271392968319619,"score_spread":0.2033797082983165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397294813","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10647758,0.016761025,0.47322297,0.017452333,0.004096383,0.0001675571,0.0030241858,0.0028373275,0.37596074],"genre_scores_gemma":[0.7151709,0.009951654,0.20638816,0.005555488,0.0059357774,0.0005928126,0.0034727645,0.0024267123,0.050505653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974706,0.00045200935,0.00013120132,0.0006806544,0.0008330625,0.0004324869],"domain_scores_gemma":[0.9831638,0.011145544,0.000829718,0.0023875341,0.0009997276,0.001473769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023963205,0.0019121142,0.0020059997,0.0050337007,0.0027407228,0.006623279,0.0040223943,0.0032390251,0.01715777],"category_scores_gemma":[0.017386511,0.0011953464,0.0017177411,0.0041751303,0.0044565657,0.019029604,0.007290896,0.008293025,0.004244375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020179065,0.00012200578,0.0016349697,0.000384443,0.000047959755,0.00015714439,0.00027975676,0.0055960645,0.0038681803,0.9080166,0.033991624,0.04569935],"study_design_scores_gemma":[0.000027269227,0.000036971553,0.00084060314,0.00013020987,0.000050122308,0.00032925227,0.00012465921,0.019645352,0.0017941985,0.9520257,0.02495492,0.00004074701],"about_ca_topic_score_codex":0.00081161456,"about_ca_topic_score_gemma":0.0014423996,"teacher_disagreement_score":0.01715777,"about_ca_system_score_codex":0.0030173613,"about_ca_system_score_gemma":0.0009118519,"threshold_uncertainty_score":0.05739844},"labels":[],"label_agreement":null},{"id":"W2397344195","doi":"","title":"Independence number and [a, b]-factors of graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Independence number; Independence (probability theory); Combinatorics; Statistics; Discrete mathematics; Graph","score_opus":0.013651687669112214,"score_gpt":0.23558931326629623,"score_spread":0.22193762559718402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397344195","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.428957,0.004251796,0.18096933,0.006363887,0.00048497817,0.0001089425,0.0030720716,0.0008009783,0.37499112],"genre_scores_gemma":[0.93433344,0.0013882838,0.028121449,0.0005440303,0.0004986928,0.00012484413,0.0016095,0.00020888742,0.033170853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987072,0.000363642,0.00005599012,0.00035380435,0.0002500505,0.00026936713],"domain_scores_gemma":[0.99409145,0.0036309552,0.0006109161,0.0005294024,0.0003583038,0.00077894627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009398311,0.0006461457,0.0007293299,0.0021861817,0.002448746,0.003700104,0.0011598555,0.0011804646,0.013113814],"category_scores_gemma":[0.0056026466,0.000638431,0.00070755975,0.002755027,0.0032283724,0.0058086505,0.001412604,0.0025539207,0.0019179473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091302725,0.000038997838,0.0007973666,0.000049054244,0.000012215062,0.00003679744,0.00014180015,0.0012073456,0.00087148976,0.98150486,0.0060052844,0.009243556],"study_design_scores_gemma":[0.00001769819,0.000009297234,0.0007491153,0.000018194145,0.000011045606,0.00010102766,0.00009144897,0.0038887002,0.0005874775,0.9867025,0.0078086224,0.000014933105],"about_ca_topic_score_codex":0.002683991,"about_ca_topic_score_gemma":0.002750528,"teacher_disagreement_score":0.013113814,"about_ca_system_score_codex":0.0017892017,"about_ca_system_score_gemma":0.00086457276,"threshold_uncertainty_score":0.04387009},"labels":[],"label_agreement":null},{"id":"W2397357283","doi":"","title":"Binding Number and Fractional k-Factors of Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.024040772452082925,"score_gpt":0.23203429680371693,"score_spread":0.207993524351634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397357283","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47576886,0.0051518776,0.23612635,0.009007366,0.00075802294,0.00009016269,0.001366671,0.0010534158,0.27067736],"genre_scores_gemma":[0.92806697,0.0013806458,0.03580275,0.0007042267,0.00029228424,0.000085736676,0.0005457616,0.00022823007,0.03289336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985631,0.00033554522,0.000060362523,0.0003448459,0.00029595188,0.00040024574],"domain_scores_gemma":[0.9955754,0.0026727505,0.00037165068,0.0005502781,0.0002591073,0.0005709068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012367058,0.0006828113,0.0009684283,0.0021510914,0.0034650168,0.0044402354,0.0017973207,0.0020073652,0.01692651],"category_scores_gemma":[0.006866408,0.0006601033,0.0008064228,0.0025143092,0.0041899863,0.008026207,0.00218554,0.0027274678,0.0024819225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007201317,0.000029799041,0.0004063279,0.000053903696,0.0000073797764,0.00002766122,0.00014757342,0.002052765,0.0007641373,0.9842876,0.003295853,0.008854887],"study_design_scores_gemma":[0.00001317743,0.000008209157,0.00023685681,0.00002274616,0.00000864281,0.00007589006,0.00012489193,0.00543426,0.00061534025,0.9874285,0.0060165226,0.000014939733],"about_ca_topic_score_codex":0.003605694,"about_ca_topic_score_gemma":0.004272338,"teacher_disagreement_score":0.01692651,"about_ca_system_score_codex":0.0026628762,"about_ca_system_score_gemma":0.0011027477,"threshold_uncertainty_score":0.05662477},"labels":[],"label_agreement":null},{"id":"W2397378656","doi":"","title":"Cyclic 9-coloring of plane graphs with maximum face degree six.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Plane (geometry); Face (sociological concept); Geometry; Physics; Sociology","score_opus":0.032932431566620075,"score_gpt":0.23195513514400512,"score_spread":0.19902270357738505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397378656","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7543138,0.0012205289,0.10278695,0.003323679,0.00030185483,0.00013628032,0.0034281034,0.0006279569,0.13386084],"genre_scores_gemma":[0.92685163,0.00064280647,0.05073332,0.00051542744,0.00013414318,0.00009883658,0.0027222603,0.00019777205,0.018103808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995084,0.00012830598,0.000024031931,0.0001048387,0.000077054654,0.00015736697],"domain_scores_gemma":[0.99802774,0.0009958295,0.00030175352,0.00029801225,0.00014973541,0.00022684401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003735397,0.000435723,0.00041448398,0.0007884691,0.0014682771,0.00200635,0.0011402869,0.0009100995,0.010119282],"category_scores_gemma":[0.0019304024,0.00044622517,0.0005331115,0.0012142684,0.0010573963,0.001989044,0.0010993388,0.001178964,0.0011801398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004934265,0.00017977167,0.004283476,0.00029164882,0.000048164595,0.00041359928,0.00047050012,0.01931582,0.010112003,0.88396865,0.029411241,0.051011596],"study_design_scores_gemma":[0.00009658147,0.00006728021,0.0034617067,0.00007633231,0.00004867647,0.0005930296,0.00061885576,0.044021346,0.00728508,0.91428435,0.029405018,0.000041757386],"about_ca_topic_score_codex":0.0038052534,"about_ca_topic_score_gemma":0.0054498254,"teacher_disagreement_score":0.010119282,"about_ca_system_score_codex":0.0014276733,"about_ca_system_score_gemma":0.0008729854,"threshold_uncertainty_score":0.0338524},"labels":[],"label_agreement":null},{"id":"W2397477242","doi":"","title":"On Super Vertex-Magic Total Labeling of the Disjoint Union of k Copies of K n .","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; MAGIC (telescope); Disjoint sets; Vertex (graph theory); Disjoint union (topology); Physics; Graph; Astrophysics","score_opus":0.006855100886390618,"score_gpt":0.19932393653946764,"score_spread":0.19246883565307701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397477242","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5047869,0.0015730407,0.31932276,0.0033624193,0.00040692434,0.00013405381,0.0020345035,0.0010282593,0.16735125],"genre_scores_gemma":[0.8491237,0.0008319003,0.116389565,0.0009071106,0.00023507114,0.00015506522,0.0021741989,0.0004625509,0.029720953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989556,0.00034087873,0.00005333364,0.00023779928,0.0002038903,0.00020852408],"domain_scores_gemma":[0.9969451,0.0015973405,0.00030609648,0.0006353975,0.00022606587,0.00028998684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010753609,0.00054567546,0.00069062214,0.0013087515,0.0021635878,0.0023878147,0.0014497987,0.0011829591,0.0097466335],"category_scores_gemma":[0.003969784,0.0006137108,0.0008081275,0.0018735727,0.0021298788,0.0053491388,0.0027767797,0.00177294,0.0011798544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017599582,0.000038667014,0.00067454454,0.00014268693,0.000017617089,0.00007572793,0.00032057657,0.006696118,0.0018053348,0.963148,0.008216541,0.018688085],"study_design_scores_gemma":[0.000027144968,0.000021641465,0.0004461801,0.000031167514,0.000020312755,0.00010488363,0.00018666635,0.022746328,0.0011643324,0.96957964,0.0056568584,0.000014956846],"about_ca_topic_score_codex":0.0026712676,"about_ca_topic_score_gemma":0.0047890744,"teacher_disagreement_score":0.0097466335,"about_ca_system_score_codex":0.0017530825,"about_ca_system_score_gemma":0.00087273173,"threshold_uncertainty_score":0.032605767},"labels":[],"label_agreement":null},{"id":"W2397532180","doi":"","title":"On E 4 -Cordial Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.020595489135659874,"score_gpt":0.23669442436000132,"score_spread":0.21609893522434145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397532180","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3583101,0.00271576,0.22239943,0.00811335,0.0007656198,0.0002372569,0.0042088055,0.001490558,0.40175915],"genre_scores_gemma":[0.7804872,0.0019714185,0.106987774,0.002235795,0.0004111268,0.00022436165,0.0035988565,0.0004342646,0.103649266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911565,0.00024372192,0.0000504972,0.00021419139,0.00015075105,0.00022515243],"domain_scores_gemma":[0.99737144,0.0012647002,0.0003733323,0.00042457035,0.00020619374,0.00035983024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006648641,0.0008010578,0.0006235389,0.0016168131,0.0019579448,0.0027778826,0.001454925,0.00135157,0.023311362],"category_scores_gemma":[0.003537851,0.00037376996,0.0006408594,0.0021797286,0.0019344895,0.00565931,0.0028222546,0.0024843602,0.0033305509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010908342,0.00006306651,0.0006326943,0.00015770437,0.000014140892,0.00010232117,0.00024154059,0.0030386664,0.0014859238,0.95052034,0.013491359,0.030143075],"study_design_scores_gemma":[0.000025793008,0.000015104633,0.00047554073,0.00005275591,0.000010733427,0.00014996689,0.00020668448,0.008643424,0.0011666702,0.96899545,0.020244455,0.000013419715],"about_ca_topic_score_codex":0.002222493,"about_ca_topic_score_gemma":0.0039787916,"teacher_disagreement_score":0.023311362,"about_ca_system_score_codex":0.0019171668,"about_ca_system_score_gemma":0.00060345774,"threshold_uncertainty_score":0.077984214},"labels":[],"label_agreement":null},{"id":"W2397538458","doi":"","title":"On E k -cordial labeling.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.01360159055842084,"score_gpt":0.23451773613202306,"score_spread":0.22091614557360223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397538458","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11034712,0.0044957283,0.39755264,0.013876584,0.0013000771,0.00022332263,0.003685483,0.002328545,0.46619052],"genre_scores_gemma":[0.6369606,0.0037404431,0.20401263,0.00524713,0.0010066705,0.00038998752,0.0044491678,0.0008857256,0.14330763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987293,0.0003697452,0.000076431774,0.0003174027,0.00023529043,0.00027190533],"domain_scores_gemma":[0.9964504,0.0017079671,0.00029632982,0.0009050621,0.0002874747,0.00035275114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011797177,0.0008718229,0.0008567913,0.0016018548,0.0022681518,0.0033140131,0.001685538,0.0017593723,0.027679043],"category_scores_gemma":[0.005823666,0.00044980185,0.00075997645,0.0030749387,0.0027569316,0.009437587,0.004238628,0.0038433068,0.0051254183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000775168,0.000054622276,0.0003313421,0.0001313289,0.000010566344,0.000055613193,0.00020369717,0.0017632069,0.0005440408,0.94108766,0.018371943,0.037368447],"study_design_scores_gemma":[0.000015378348,0.000009756175,0.00020824501,0.000032325723,0.000007518267,0.000093238334,0.00010981572,0.0047794874,0.00037982783,0.9765985,0.017756766,0.000009143376],"about_ca_topic_score_codex":0.0022785866,"about_ca_topic_score_gemma":0.0040960526,"teacher_disagreement_score":0.027679043,"about_ca_system_score_codex":0.0026439554,"about_ca_system_score_gemma":0.0010080683,"threshold_uncertainty_score":0.09259564},"labels":[],"label_agreement":null},{"id":"W2397594383","doi":"","title":"On the super edge-magic deficiency of a star forest.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Star (game theory); Mathematics; MAGIC (telescope); Enhanced Data Rates for GSM Evolution; Astrophysics; Computer science; Physics; Artificial intelligence; Mathematical analysis","score_opus":0.010804418947892894,"score_gpt":0.20937661467207125,"score_spread":0.19857219572417836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397594383","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6430112,0.0032935794,0.1807159,0.008279726,0.00049850036,0.00008858831,0.0016682956,0.00045910125,0.16198517],"genre_scores_gemma":[0.9359761,0.0011299568,0.048340842,0.0008629232,0.00022969965,0.00005715283,0.0007896924,0.00012297306,0.012490688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939513,0.00021405298,0.000029770692,0.000108877764,0.00013250201,0.00011965994],"domain_scores_gemma":[0.99631727,0.0024229654,0.00023941694,0.00038693167,0.00028163005,0.00035174112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010707496,0.00031931288,0.00072838424,0.0012956928,0.0014436336,0.001980828,0.0009614327,0.001293453,0.008068812],"category_scores_gemma":[0.006150243,0.0004123594,0.0004070466,0.0011972494,0.0021461598,0.0052889246,0.0018351524,0.0019325276,0.0009683476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016607171,0.000041062376,0.0013472916,0.00011926147,0.000012515639,0.00010263397,0.00020321178,0.00431704,0.0014518155,0.9654029,0.009507402,0.017328735],"study_design_scores_gemma":[0.00002853875,0.000020759573,0.00049382995,0.000032058473,0.000012449217,0.00026007378,0.00016503618,0.013900232,0.00063566375,0.9787066,0.0057332413,0.000011565411],"about_ca_topic_score_codex":0.0016986949,"about_ca_topic_score_gemma":0.0020638688,"teacher_disagreement_score":0.008068812,"about_ca_system_score_codex":0.00096716103,"about_ca_system_score_gemma":0.0006441729,"threshold_uncertainty_score":0.026992798},"labels":[],"label_agreement":null},{"id":"W2397618970","doi":"","title":"On a Conjecture Concerning the Friendly Index Sets of Trees.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Conjecture; Mathematics; Combinatorics; Vertex (graph theory); Graph; Index (typography); Discrete mathematics; Computer science","score_opus":0.011230473208990541,"score_gpt":0.23369184242194688,"score_spread":0.22246136921295634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397618970","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7517521,0.002486415,0.14778286,0.0075903153,0.00063866866,0.0001453301,0.0020371361,0.0007380795,0.08682916],"genre_scores_gemma":[0.95655525,0.0009266764,0.032724526,0.001316367,0.0006178461,0.00015378291,0.0015854426,0.00007430897,0.0060458127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99708706,0.00048777278,0.00021162107,0.0007807327,0.0007651747,0.00066760473],"domain_scores_gemma":[0.97779787,0.015722713,0.0019277,0.002690996,0.00091892,0.0009418229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030717885,0.00070390204,0.0011523997,0.0024548129,0.0032970856,0.0035270012,0.001831382,0.0022643458,0.004663925],"category_scores_gemma":[0.018671652,0.00076747086,0.0011064396,0.0023880396,0.0057126745,0.0083414605,0.0031276096,0.003102502,0.0008407523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088683935,0.0001841104,0.010837516,0.0002810335,0.000039868533,0.00048088704,0.0021484622,0.011517792,0.0062782275,0.91246337,0.01497197,0.039909914],"study_design_scores_gemma":[0.000113777016,0.00022728802,0.005685947,0.00010031809,0.00004975359,0.0011401707,0.00063958514,0.01885742,0.0050934046,0.94798654,0.020018842,0.00008699394],"about_ca_topic_score_codex":0.0012300835,"about_ca_topic_score_gemma":0.0008534514,"teacher_disagreement_score":0.004663925,"about_ca_system_score_codex":0.0019078801,"about_ca_system_score_gemma":0.0006171039,"threshold_uncertainty_score":0.016245365},"labels":[],"label_agreement":null},{"id":"W2397631537","doi":"","title":"Color degree and heterochromatic paths in edge-colored graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Colored; Mathematics; Degree (music); Enhanced Data Rates for GSM Evolution; Edge coloring; Combinatorics; Graph; Computer science; Artificial intelligence; Sociology; Line graph; Physics","score_opus":0.01347766623012939,"score_gpt":0.21611053707672057,"score_spread":0.20263287084659118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397631537","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70126027,0.0020584967,0.20902899,0.0060557653,0.00035248193,0.00009670368,0.0017613495,0.00046785775,0.07891808],"genre_scores_gemma":[0.9503897,0.0008443903,0.03385288,0.0004928196,0.00019313519,0.000086233995,0.0006405706,0.00012238018,0.013377925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989479,0.00034600846,0.000044893783,0.00028375123,0.00015312122,0.00022432554],"domain_scores_gemma":[0.99278146,0.004604822,0.00084964186,0.00078090525,0.0003758771,0.0006073206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010475273,0.00044790294,0.0006409895,0.0013378361,0.0019833029,0.002937367,0.0015016526,0.0013368216,0.008082074],"category_scores_gemma":[0.0058110883,0.00057200005,0.00060016563,0.0019434246,0.002709379,0.005009878,0.001802854,0.0019558857,0.0007125299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015786634,0.000069023285,0.0023216137,0.000112811336,0.000026871581,0.00011921139,0.0002910085,0.007309345,0.0022345518,0.9658197,0.0060973777,0.015440628],"study_design_scores_gemma":[0.000033394732,0.000017668364,0.0010704277,0.000025960984,0.000024869314,0.00026752744,0.0002671162,0.016353406,0.0013341026,0.97587454,0.004711295,0.000019569019],"about_ca_topic_score_codex":0.0019975414,"about_ca_topic_score_gemma":0.00267211,"teacher_disagreement_score":0.008082074,"about_ca_system_score_codex":0.0016655133,"about_ca_system_score_gemma":0.00079126726,"threshold_uncertainty_score":0.027037203},"labels":[],"label_agreement":null},{"id":"W2397663352","doi":"","title":"On vertex irregular total labelings.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.007121993914556585,"score_gpt":0.2018209375120461,"score_spread":0.19469894359748952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397663352","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26221788,0.0039430647,0.41491768,0.0073123663,0.00075720093,0.00017415138,0.0040641148,0.0014741747,0.30513945],"genre_scores_gemma":[0.7925254,0.0034398045,0.124119185,0.001735576,0.0008412723,0.0003185109,0.005251287,0.00088814803,0.07088072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987429,0.00037948744,0.000071526425,0.00027736396,0.00028983815,0.00023897093],"domain_scores_gemma":[0.99433845,0.0032333678,0.00047694563,0.0010866217,0.00043319224,0.00043139968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001305294,0.0007264657,0.0009066439,0.0023029395,0.0022666298,0.004053212,0.0015612965,0.0013574802,0.013989399],"category_scores_gemma":[0.007391845,0.0005860486,0.00089187303,0.0036569976,0.0027517749,0.008103655,0.0031668262,0.0028334025,0.0022600547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049865725,0.00002856113,0.000498839,0.00009604577,0.000012269413,0.000040004626,0.00016110983,0.0035554804,0.00034940825,0.9649437,0.010740856,0.01952381],"study_design_scores_gemma":[0.000011173951,0.000008134162,0.0002224172,0.00002763597,0.000008771882,0.000089406996,0.00011841928,0.0083547365,0.00024748605,0.981709,0.009195094,0.0000076081587],"about_ca_topic_score_codex":0.0018924004,"about_ca_topic_score_gemma":0.0029764262,"teacher_disagreement_score":0.013989399,"about_ca_system_score_codex":0.002388568,"about_ca_system_score_gemma":0.0008221411,"threshold_uncertainty_score":0.046799183},"labels":[],"label_agreement":null},{"id":"W2397813300","doi":"","title":"On the E k -cordiality of some graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.028574388991780508,"score_gpt":0.23970382367072093,"score_spread":0.21112943467894044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397813300","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5653567,0.0030775217,0.1212425,0.019308044,0.00058230996,0.00010647853,0.0021642272,0.0005095799,0.28765267],"genre_scores_gemma":[0.94497275,0.0013876057,0.026855748,0.0015175567,0.0004296743,0.00009040739,0.0009462183,0.0001447235,0.023655316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891937,0.00033159365,0.00006472706,0.00028125406,0.00015227907,0.0002507793],"domain_scores_gemma":[0.99198407,0.00521062,0.0007111199,0.0008602501,0.00046242113,0.0007715679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011994169,0.000490497,0.0006381676,0.00186739,0.0029861704,0.0038083526,0.0012690864,0.0016408468,0.013698816],"category_scores_gemma":[0.00939618,0.0005296905,0.00066649547,0.0021144785,0.0044699735,0.00787427,0.003218974,0.0036621664,0.0012635918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007659679,0.000030168094,0.00090766273,0.000071247785,0.00001022379,0.00007374219,0.00025605832,0.0012040604,0.0006828473,0.98340994,0.0048978347,0.008379644],"study_design_scores_gemma":[0.00001847006,0.0000125209945,0.00060481526,0.000027034079,0.000010741729,0.00015869003,0.00021217078,0.0038863714,0.0005709508,0.9886564,0.0058310144,0.000010865478],"about_ca_topic_score_codex":0.0018676834,"about_ca_topic_score_gemma":0.0020404477,"teacher_disagreement_score":0.013698816,"about_ca_system_score_codex":0.0020109247,"about_ca_system_score_gemma":0.00068957865,"threshold_uncertainty_score":0.04582709},"labels":[],"label_agreement":null},{"id":"W2397830249","doi":"","title":"Prime labeling on Knödel graphs W 3, n .","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Prime (order theory)","score_opus":0.01167080183978739,"score_gpt":0.21767451822590558,"score_spread":0.2060037163861182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397830249","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4073136,0.0014252538,0.3200058,0.0071650916,0.00046729375,0.00015313148,0.0032652058,0.001402142,0.2588025],"genre_scores_gemma":[0.83723253,0.00089005067,0.07983199,0.0011583479,0.00026993785,0.00015610548,0.002576737,0.00045404924,0.07743016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944276,0.00014503313,0.000025374575,0.00014581157,0.00009269789,0.00014833156],"domain_scores_gemma":[0.99820924,0.0009247279,0.00022428988,0.0002949087,0.00013040772,0.00021638666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065280095,0.00049135217,0.00053276605,0.0011531903,0.001988111,0.0026065512,0.0009573632,0.0010770578,0.014332564],"category_scores_gemma":[0.0028764026,0.0003952371,0.0005362059,0.0013443219,0.0017127459,0.0049669235,0.0018363624,0.0017952407,0.0019001485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001095574,0.000041321477,0.0005350169,0.00008322868,0.0000075349444,0.00007250824,0.00018692411,0.0021942344,0.0013305817,0.96701604,0.01141341,0.017009703],"study_design_scores_gemma":[0.000015962018,0.000011940505,0.00035235734,0.00001813288,0.000007941131,0.000098930104,0.00013306232,0.006663406,0.0010261114,0.98191893,0.009742938,0.00001026127],"about_ca_topic_score_codex":0.0018370601,"about_ca_topic_score_gemma":0.0029342277,"teacher_disagreement_score":0.014332564,"about_ca_system_score_codex":0.0014599325,"about_ca_system_score_gemma":0.0007358561,"threshold_uncertainty_score":0.047947228},"labels":[],"label_agreement":null},{"id":"W2398219171","doi":"","title":"On γ-labeling the almost-bipartite graph P m +e.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Graph; Complete bipartite graph","score_opus":0.016405046276971185,"score_gpt":0.23665677844491684,"score_spread":0.22025173216794566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398219171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28709152,0.0021098286,0.51741815,0.010512235,0.000509174,0.00022044849,0.003357528,0.0010749465,0.17770615],"genre_scores_gemma":[0.741929,0.0020065042,0.19266017,0.0025081316,0.000498447,0.00038227206,0.00378453,0.0005255805,0.05570542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989919,0.00038466713,0.000044627934,0.0002144919,0.00016027103,0.00020393272],"domain_scores_gemma":[0.99651825,0.0020778442,0.00032796385,0.00057990977,0.00020310246,0.00029290802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010351869,0.0006547718,0.00071794156,0.0011727739,0.0016684947,0.002431534,0.0014295774,0.0018817883,0.012188396],"category_scores_gemma":[0.0049996176,0.00046911105,0.000671544,0.0017994941,0.0020225903,0.0059391293,0.0032059907,0.0024672423,0.0019267519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014503472,0.0000759415,0.0007876029,0.00018288143,0.00002129252,0.00008306749,0.00024084057,0.0077998503,0.001371637,0.94423264,0.016236411,0.028822768],"study_design_scores_gemma":[0.000021569898,0.000017412718,0.00039633503,0.000038678914,0.000011541957,0.00011238674,0.00017149797,0.01753966,0.0006654672,0.97491735,0.0060958164,0.00001229989],"about_ca_topic_score_codex":0.0019173349,"about_ca_topic_score_gemma":0.0029056242,"teacher_disagreement_score":0.012188396,"about_ca_system_score_codex":0.0017435066,"about_ca_system_score_gemma":0.00084257685,"threshold_uncertainty_score":0.040774286},"labels":[],"label_agreement":null},{"id":"W2398228207","doi":"","title":"Isoperimetric Edge Connectivity of Line Graphs and Path Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Isoperimetric inequality; Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Path (computing); Line (geometry); 1-planar graph; Isoperimetric dimension; Line graph; Graph; Computer science; Geometry; Computer network; Artificial intelligence","score_opus":0.02394016829283598,"score_gpt":0.22457008816374205,"score_spread":0.20062991987090606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398228207","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4924249,0.004761713,0.36050174,0.006903825,0.0003243478,0.00015363208,0.0036865443,0.0006316655,0.13061163],"genre_scores_gemma":[0.92029494,0.0023346103,0.060194597,0.00054470904,0.0005097955,0.00017427656,0.0026727873,0.00017502859,0.013099326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867874,0.000492828,0.00007345376,0.00031193724,0.00029691376,0.0001461124],"domain_scores_gemma":[0.9895181,0.007080498,0.0013303545,0.00081119535,0.00061470893,0.00064512645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011317311,0.000595198,0.0007274502,0.0030141326,0.001538495,0.0033560744,0.001787331,0.002015513,0.009253742],"category_scores_gemma":[0.011614833,0.00072153425,0.00058840576,0.0033711498,0.0020991117,0.009800197,0.002184829,0.0027390916,0.0010456084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010808954,0.00006875689,0.0024659145,0.00019679435,0.000031061107,0.00014893302,0.0002838055,0.008150542,0.0012022486,0.9501338,0.007878113,0.029331937],"study_design_scores_gemma":[0.000021414065,0.000025645857,0.0016449767,0.00004739252,0.000024605868,0.00041775103,0.00025612483,0.02826661,0.0011132634,0.9609429,0.00722081,0.000018471912],"about_ca_topic_score_codex":0.0011326089,"about_ca_topic_score_gemma":0.0011246937,"teacher_disagreement_score":0.009253742,"about_ca_system_score_codex":0.001172809,"about_ca_system_score_gemma":0.0004297843,"threshold_uncertainty_score":0.030956864},"labels":[],"label_agreement":null},{"id":"W2398403419","doi":"","title":"On Cordial Labelings of Fans with Other Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.0105353042278856,"score_gpt":0.21895100019155925,"score_spread":0.20841569596367365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398403419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22587845,0.003370051,0.44827425,0.007285217,0.0007955164,0.00021787891,0.0018486128,0.0018439431,0.31048605],"genre_scores_gemma":[0.7323049,0.0021490396,0.18533306,0.0018757756,0.00073300314,0.00031015792,0.0024023007,0.0007964709,0.07409527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855465,0.0005786042,0.00008486818,0.00031893855,0.00023410073,0.00022880214],"domain_scores_gemma":[0.993905,0.0036750464,0.00049576635,0.0009927425,0.00037296285,0.00055849465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016088424,0.00077206315,0.0008211722,0.002110254,0.0029376126,0.0031806629,0.0016710343,0.0016461406,0.017972974],"category_scores_gemma":[0.008591035,0.0006409575,0.0010947551,0.0026783783,0.0031220794,0.009464018,0.0033841613,0.002962488,0.0021626553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004723499,0.000038391012,0.0004409431,0.00006601754,0.0000067607434,0.000049107723,0.00018927162,0.0020463094,0.000354519,0.9725214,0.0069358284,0.017304162],"study_design_scores_gemma":[0.000014644853,0.000011066635,0.00024473682,0.0000401045,0.000008285737,0.00011696207,0.00013502174,0.009153978,0.00044471657,0.97839534,0.0114251785,0.000009965659],"about_ca_topic_score_codex":0.0028903603,"about_ca_topic_score_gemma":0.004337583,"teacher_disagreement_score":0.017972974,"about_ca_system_score_codex":0.0025636982,"about_ca_system_score_gemma":0.000733684,"threshold_uncertainty_score":0.06012559},"labels":[],"label_agreement":null},{"id":"W2398610165","doi":"","title":"A Note on Chromatic Uniqueness of Certain Complete Tripartite Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Uniqueness; Chromatic scale; Combinatorics; Mathematical economics; Mathematical analysis","score_opus":0.02318779927119251,"score_gpt":0.2537149411521882,"score_spread":0.23052714188099566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398610165","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3636579,0.0044488776,0.29144996,0.009691942,0.0019481982,0.00020351291,0.0021418808,0.0006829436,0.3257748],"genre_scores_gemma":[0.8993609,0.0025291785,0.07342656,0.0017316762,0.0008068994,0.00016869495,0.0011191856,0.00029277505,0.0205642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902153,0.0002688854,0.000045178334,0.00033344727,0.00018973794,0.00014133958],"domain_scores_gemma":[0.99522215,0.0031970819,0.00028620614,0.00058774627,0.0003040385,0.00040284393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012023664,0.00051496667,0.0007860658,0.0017594872,0.0031592355,0.0032888988,0.0019400968,0.0017800576,0.014253124],"category_scores_gemma":[0.0073978333,0.00077339076,0.0009212821,0.0025011885,0.0032612712,0.0053761085,0.0030176411,0.0035626565,0.0010420955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008632563,0.000026225012,0.0011507219,0.00014436254,0.000024057943,0.00024216232,0.00028540392,0.0021510355,0.002261418,0.9720833,0.011119572,0.010425509],"study_design_scores_gemma":[0.000023658182,0.000031498505,0.0012163308,0.00005443154,0.00003767272,0.0006315774,0.00037178874,0.008045758,0.0019701018,0.96692574,0.02064754,0.000044002558],"about_ca_topic_score_codex":0.0015640343,"about_ca_topic_score_gemma":0.002188245,"teacher_disagreement_score":0.014253124,"about_ca_system_score_codex":0.0015750831,"about_ca_system_score_gemma":0.00078271265,"threshold_uncertainty_score":0.04768139},"labels":[],"label_agreement":null},{"id":"W2398640167","doi":"","title":"Primality of Some graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Primality test; Mathematics; Combinatorics; Prime (order theory)","score_opus":0.010768192859442914,"score_gpt":0.21698439172416728,"score_spread":0.20621619886472436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398640167","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32817203,0.0028449334,0.30594134,0.012087727,0.00075849553,0.0001613326,0.003924353,0.0006480706,0.34546173],"genre_scores_gemma":[0.87775207,0.0013839239,0.07756472,0.001146856,0.00063659134,0.00016032904,0.0017590534,0.00029012244,0.03930638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989598,0.00039401138,0.000043052078,0.00024581375,0.0001749344,0.00018239493],"domain_scores_gemma":[0.9956031,0.0026689926,0.0004080893,0.00054062274,0.0003527925,0.00042644318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001226139,0.0005135079,0.00075096526,0.001476421,0.0019091871,0.004205981,0.00096808886,0.0012210854,0.016877307],"category_scores_gemma":[0.005765924,0.00055643724,0.0008562763,0.0015090118,0.0023477774,0.005167795,0.002381692,0.0035869363,0.0016704402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065640175,0.000025263837,0.00035079295,0.000084330844,0.000013090267,0.000040905892,0.00011674362,0.001582531,0.00075429096,0.9838219,0.0054973373,0.00764712],"study_design_scores_gemma":[0.000022293163,0.00001370102,0.00036772218,0.00003237174,0.000017688537,0.00014811814,0.000116162504,0.0074370173,0.0010421036,0.98024106,0.0105521595,0.000009622265],"about_ca_topic_score_codex":0.00069790706,"about_ca_topic_score_gemma":0.0007898314,"teacher_disagreement_score":0.016877307,"about_ca_system_score_codex":0.0016509757,"about_ca_system_score_gemma":0.0006271647,"threshold_uncertainty_score":0.056460142},"labels":[],"label_agreement":null},{"id":"W2398795605","doi":"","title":"Δ-Optimum Forbidden Subgraphs and Exclusive Sum Labellings of Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.009043422562513672,"score_gpt":0.21091776096709217,"score_spread":0.2018743384045785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398795605","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5185881,0.0021261305,0.32790807,0.004973133,0.0002673136,0.00017954042,0.0038803536,0.0010162954,0.14106102],"genre_scores_gemma":[0.85401547,0.000995649,0.11963441,0.00066013925,0.00014118977,0.0001867776,0.0024126384,0.00032271753,0.021630947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989729,0.00036240966,0.00006111246,0.00020502222,0.00019059646,0.0002080067],"domain_scores_gemma":[0.9943614,0.0035921673,0.00055610953,0.00084050465,0.00027117145,0.00037865966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008288247,0.00051689835,0.0006410433,0.0011617303,0.0014294636,0.0028836837,0.0015428131,0.0012955009,0.0084468005],"category_scores_gemma":[0.005782963,0.00075325515,0.0007230462,0.0015891432,0.0017372759,0.0047825994,0.0020437506,0.0021935396,0.0010420663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004401693,0.00014412684,0.0020398595,0.00030213583,0.000037242156,0.00015740813,0.00037906933,0.018935679,0.00555454,0.90740836,0.013190642,0.051410787],"study_design_scores_gemma":[0.000036677866,0.00002219666,0.000624038,0.000038523503,0.00002369863,0.00021809885,0.00022021163,0.021430777,0.002580455,0.9686547,0.0061348495,0.00001581502],"about_ca_topic_score_codex":0.0013450608,"about_ca_topic_score_gemma":0.0025477102,"teacher_disagreement_score":0.0084468005,"about_ca_system_score_codex":0.0015737774,"about_ca_system_score_gemma":0.0008004039,"threshold_uncertainty_score":0.02825743},"labels":[],"label_agreement":null},{"id":"W2398799857","doi":"","title":"On chromatic number of graphs without certain induced subgraphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics","score_opus":0.02482158526942479,"score_gpt":0.24701553675228122,"score_spread":0.22219395148285642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398799857","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6615275,0.0039776014,0.11093036,0.00853076,0.0005564534,0.00012772207,0.003138806,0.0006080277,0.21060279],"genre_scores_gemma":[0.9537076,0.0014343234,0.023987552,0.00058556924,0.00048614191,0.00015458792,0.0016454097,0.00023720431,0.017761614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913293,0.00027026227,0.000032205175,0.0002269324,0.00015034547,0.00018746928],"domain_scores_gemma":[0.9915656,0.0059620873,0.0008252913,0.00057755806,0.00038856282,0.00068098324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012198474,0.0006812078,0.0007484618,0.0030492598,0.0019881772,0.003074512,0.0018893894,0.0016264382,0.012984129],"category_scores_gemma":[0.008276414,0.0005736013,0.00053920667,0.002643323,0.003049784,0.006964696,0.0016670474,0.0024123748,0.0011293951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029985444,0.00010098227,0.003126597,0.00024002473,0.000036238212,0.0000904395,0.00033169723,0.014052114,0.0022929888,0.9422231,0.018397126,0.018809004],"study_design_scores_gemma":[0.00006924114,0.00003647687,0.0024232399,0.00006808969,0.00003555297,0.00019704735,0.0002945131,0.049670033,0.0015384794,0.93766856,0.007965542,0.000033236618],"about_ca_topic_score_codex":0.0030656224,"about_ca_topic_score_gemma":0.003920644,"teacher_disagreement_score":0.012984129,"about_ca_system_score_codex":0.0030843946,"about_ca_system_score_gemma":0.00094139,"threshold_uncertainty_score":0.04343623},"labels":[],"label_agreement":null},{"id":"W2398823088","doi":"","title":"Super (a, 1)-cycle-antimagic labeling of the grid.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Grid; Geometry","score_opus":0.007665879921163126,"score_gpt":0.20145772559808095,"score_spread":0.19379184567691782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398823088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3372792,0.0011935616,0.38061982,0.00409325,0.00055303425,0.0002538352,0.004927223,0.0018100233,0.2692701],"genre_scores_gemma":[0.78932476,0.0005737677,0.16235267,0.0009735399,0.00013978542,0.0002118265,0.0028188908,0.00039063167,0.04321409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994599,0.00015386181,0.00003482346,0.0001375331,0.00009531783,0.000118638985],"domain_scores_gemma":[0.99839896,0.0005950913,0.00014906091,0.0004587495,0.00017515961,0.00022300554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043767286,0.00039531713,0.0005727223,0.0007441371,0.0017202605,0.0024395091,0.0012176991,0.0012401042,0.014925547],"category_scores_gemma":[0.0025607832,0.00038445037,0.0006630035,0.0012874282,0.0012437038,0.003459476,0.0020825318,0.001592637,0.0023354804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017328035,0.000046132245,0.00057348184,0.00013667191,0.000015770936,0.00011644147,0.00018805008,0.003916935,0.0027761974,0.96230984,0.011823322,0.01792382],"study_design_scores_gemma":[0.000028264052,0.00001676587,0.00032471673,0.000022093604,0.000014773073,0.00013447349,0.00013554964,0.0112068085,0.0013591655,0.9761712,0.010576101,0.000010117436],"about_ca_topic_score_codex":0.002271439,"about_ca_topic_score_gemma":0.0038463164,"teacher_disagreement_score":0.014925547,"about_ca_system_score_codex":0.001173218,"about_ca_system_score_gemma":0.00089045113,"threshold_uncertainty_score":0.04993093},"labels":[],"label_agreement":null},{"id":"W2398868374","doi":"","title":"On Weak Magic Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; MAGIC (telescope); Combinatorics; Astrophysics; Physics","score_opus":0.0095626772631334,"score_gpt":0.22364026434789303,"score_spread":0.21407758708475963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398868374","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1803014,0.006484605,0.29265177,0.012788142,0.0012446209,0.00016162415,0.0023408595,0.00090074865,0.50312614],"genre_scores_gemma":[0.8043054,0.004167165,0.08733118,0.0026155235,0.0010988147,0.000319837,0.002525181,0.00043613932,0.09720087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897325,0.00030457907,0.000051970757,0.00020324296,0.00026510537,0.00020199237],"domain_scores_gemma":[0.9964592,0.0019660008,0.00030528335,0.0005664626,0.00032072875,0.0003823714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010158385,0.00074975117,0.0008050607,0.0026533222,0.0025906812,0.0033551604,0.0014585215,0.0015138411,0.019037506],"category_scores_gemma":[0.0050663226,0.0006376356,0.0008209,0.0026698832,0.0030230957,0.009606317,0.0042090416,0.0034885015,0.0025651336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030093592,0.000016693746,0.00024308525,0.00006209254,0.0000071859936,0.00002205826,0.00009106582,0.00060625415,0.00030883565,0.9804913,0.006487836,0.011633431],"study_design_scores_gemma":[0.000007977297,0.000004797705,0.00014846405,0.000021664906,0.000006870311,0.000053666176,0.00006148657,0.002113972,0.000261771,0.99010706,0.0072070155,0.0000051819193],"about_ca_topic_score_codex":0.0012759373,"about_ca_topic_score_gemma":0.0023276217,"teacher_disagreement_score":0.019037506,"about_ca_system_score_codex":0.0018019576,"about_ca_system_score_gemma":0.0007410079,"threshold_uncertainty_score":0.06368685},"labels":[],"label_agreement":null},{"id":"W2398930155","doi":"","title":"On Large Harmonious Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.009509474416260674,"score_gpt":0.2276179691844375,"score_spread":0.2181084947681768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398930155","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34564438,0.003979209,0.40865058,0.008636602,0.00047537728,0.0002268045,0.002167282,0.0015112897,0.22870862],"genre_scores_gemma":[0.8520726,0.0015133348,0.095642544,0.0012874336,0.00034336324,0.00028604604,0.0019546307,0.00046251662,0.046437535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988469,0.00042566014,0.000049392627,0.0002600738,0.00020133471,0.0002165922],"domain_scores_gemma":[0.9952945,0.0025763721,0.00040181764,0.0010426055,0.00027623295,0.0004084101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011193356,0.0004523758,0.00096409227,0.0015166764,0.002207667,0.002768774,0.0015847152,0.0013718964,0.014784582],"category_scores_gemma":[0.006397644,0.0005303958,0.00062331045,0.0019416756,0.0020754396,0.007902386,0.0033207056,0.0020240028,0.0020946425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005607885,0.000040934483,0.00058385625,0.00012019248,0.000020674966,0.000060938943,0.00018504566,0.0056209313,0.00078260025,0.95793664,0.012441466,0.022150615],"study_design_scores_gemma":[0.000017554663,0.000012129738,0.00033661007,0.000025781052,0.000012050239,0.00011221603,0.00018922078,0.01522421,0.00066044857,0.97319895,0.010202596,0.0000082689785],"about_ca_topic_score_codex":0.0010209219,"about_ca_topic_score_gemma":0.0022998727,"teacher_disagreement_score":0.014784582,"about_ca_system_score_codex":0.0014536572,"about_ca_system_score_gemma":0.0006389928,"threshold_uncertainty_score":0.04945934},"labels":[],"label_agreement":null},{"id":"W2399172791","doi":"","title":"Bounds for the b-chromatic number of the Mycielskian of some families of graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics; Discrete mathematics","score_opus":0.019614785908221532,"score_gpt":0.2500169102352779,"score_spread":0.23040212432705637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399172791","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38376662,0.008364576,0.16349201,0.012951658,0.00066746015,0.00016603373,0.0045590596,0.0010114658,0.42502108],"genre_scores_gemma":[0.94446236,0.0019357626,0.034342006,0.00074854994,0.00034632988,0.00026260968,0.0012495331,0.00024226146,0.016410634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999231,0.00019704197,0.000033242843,0.00019218678,0.00017809188,0.00016848189],"domain_scores_gemma":[0.9929092,0.0046513774,0.0005168733,0.00047864715,0.00053101906,0.00091295765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015534697,0.0008431576,0.0006626043,0.00443313,0.0025247843,0.003338698,0.0022721642,0.0014189923,0.016434774],"category_scores_gemma":[0.007650749,0.0005570674,0.0007147306,0.002398242,0.0026846395,0.0050516417,0.0021343303,0.0034627703,0.0016835019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002650922,0.00007624404,0.002786614,0.00022700676,0.00005580943,0.00007955687,0.00033158725,0.0061302646,0.0037282726,0.95347345,0.017682299,0.015163721],"study_design_scores_gemma":[0.000055666314,0.000034921635,0.0035505742,0.00011050042,0.000066239925,0.00024388455,0.00025785688,0.03416696,0.0025438482,0.9425626,0.016356247,0.0000506734],"about_ca_topic_score_codex":0.0030822763,"about_ca_topic_score_gemma":0.0047221733,"teacher_disagreement_score":0.016434774,"about_ca_system_score_codex":0.003451653,"about_ca_system_score_gemma":0.0009281589,"threshold_uncertainty_score":0.05497974},"labels":[],"label_agreement":null},{"id":"W2399215448","doi":"","title":"On (P, 1)-total labelling of special 1-planar graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Labelling; Combinatorics; Planar; Planar graph; Graph; Computer science; Chemistry; Computer graphics (images)","score_opus":0.019423689320487755,"score_gpt":0.22871429671827873,"score_spread":0.20929060739779098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399215448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37195534,0.002048445,0.3947036,0.004549383,0.00054560613,0.00021425333,0.0030209508,0.0016939996,0.22126843],"genre_scores_gemma":[0.81933737,0.0017378335,0.13414013,0.0014496959,0.00042419814,0.0003186938,0.003853277,0.0007338481,0.038004998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987715,0.00040801568,0.000061695275,0.00028541757,0.0002087194,0.00026469992],"domain_scores_gemma":[0.995243,0.0029202367,0.00046318304,0.00077396765,0.00025646252,0.00034312616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00110955,0.0006971628,0.00090992084,0.0014898458,0.0021350638,0.0034077263,0.0018661976,0.0017668752,0.010349581],"category_scores_gemma":[0.0056111375,0.0007133638,0.0010797513,0.0022640033,0.0027701922,0.0063039013,0.0031829616,0.0025810318,0.0018546035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017127016,0.00007363281,0.000852582,0.00025024853,0.000023104169,0.00011487836,0.0003557984,0.0076135285,0.0020152978,0.9434871,0.013830671,0.031211795],"study_design_scores_gemma":[0.000031724783,0.000020595393,0.0004610049,0.00003928461,0.000020162941,0.00017087515,0.00017651398,0.013316092,0.00095827226,0.9775325,0.007255531,0.000017487688],"about_ca_topic_score_codex":0.0019798325,"about_ca_topic_score_gemma":0.0029509023,"teacher_disagreement_score":0.010349581,"about_ca_system_score_codex":0.0021275308,"about_ca_system_score_gemma":0.0008668148,"threshold_uncertainty_score":0.03462279},"labels":[],"label_agreement":null},{"id":"W2399322965","doi":"","title":"Distance Two Labeling of Halin Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.009311464805685954,"score_gpt":0.2283805198083958,"score_spread":0.21906905500270984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399322965","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3550601,0.0018686095,0.41027206,0.008198471,0.0006389077,0.00019020902,0.003038565,0.0011407622,0.21959235],"genre_scores_gemma":[0.8478317,0.00070595316,0.10159887,0.0010939883,0.00022453102,0.00017379476,0.0022068445,0.0003335916,0.04583073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987072,0.00048206266,0.00007020833,0.0002817986,0.000252097,0.00020669133],"domain_scores_gemma":[0.9942514,0.003502731,0.00045377167,0.0007588082,0.00044138756,0.00059187383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009262401,0.00047376644,0.0005982036,0.0014451466,0.0023809208,0.0032597184,0.0014047694,0.0013865525,0.013324271],"category_scores_gemma":[0.0057296846,0.0004195637,0.0005600279,0.0016065631,0.0022694159,0.005836587,0.0028644335,0.0028080547,0.0017078049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018085461,0.000059146292,0.00073253666,0.00009575301,0.000012274666,0.00005752502,0.0002989593,0.0023039368,0.0013599976,0.9680489,0.007850121,0.019000039],"study_design_scores_gemma":[0.000027742773,0.000019512594,0.00050807605,0.000029781027,0.000012792071,0.00011811167,0.0003375085,0.011845799,0.0021281554,0.97235286,0.012603651,0.000016003209],"about_ca_topic_score_codex":0.0015438513,"about_ca_topic_score_gemma":0.0022921828,"teacher_disagreement_score":0.013324271,"about_ca_system_score_codex":0.002357909,"about_ca_system_score_gemma":0.00089805527,"threshold_uncertainty_score":0.044574082},"labels":[],"label_agreement":null},{"id":"W2399410257","doi":"","title":"A solution to a conjecture on two rainbow connection numbers of a graph.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Rainbow; Conjecture; Connection (principal bundle); Combinatorics; Graph; Discrete mathematics; Geometry","score_opus":0.013944516253528884,"score_gpt":0.24946359823004555,"score_spread":0.23551908197651666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399410257","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36252186,0.0027952802,0.2648188,0.04582848,0.0043125087,0.00020789096,0.0032449903,0.001805979,0.3144642],"genre_scores_gemma":[0.84038055,0.0010862099,0.10883035,0.0047501945,0.0013138641,0.00026178482,0.0025416662,0.0005805907,0.040254753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983217,0.00044974603,0.00009050161,0.0005745048,0.0002602317,0.0003032539],"domain_scores_gemma":[0.9905067,0.0058206357,0.0006517802,0.0016365295,0.00063881255,0.0007456253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017837586,0.0007871677,0.0011336602,0.0014363902,0.0038268715,0.004111647,0.0027093648,0.004702847,0.027513223],"category_scores_gemma":[0.015757307,0.0009773821,0.0012755279,0.0019912366,0.004325025,0.011695055,0.0038971861,0.0062142564,0.0033467617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020036109,0.00007349884,0.0006375674,0.00017535087,0.000019820505,0.000115166484,0.0002953902,0.0022277795,0.0008898765,0.9593366,0.02466147,0.011367007],"study_design_scores_gemma":[0.00005048367,0.000017780108,0.00024294869,0.00003723249,0.000013030829,0.00013131321,0.00020340341,0.004567205,0.0004358637,0.9866915,0.00758931,0.000019971107],"about_ca_topic_score_codex":0.0013247309,"about_ca_topic_score_gemma":0.001546912,"teacher_disagreement_score":0.027513223,"about_ca_system_score_codex":0.0019911807,"about_ca_system_score_gemma":0.0012431554,"threshold_uncertainty_score":0.092040956},"labels":[],"label_agreement":null},{"id":"W2399614137","doi":"","title":"Bound on the exponents of a class of two-colored digraphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Colored; Mathematics; Class (philosophy); Combinatorics; Computer science; Artificial intelligence","score_opus":0.015398239815627057,"score_gpt":0.23806632548910234,"score_spread":0.2226680856734753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399614137","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6516621,0.003669362,0.1327399,0.0078763785,0.00071796146,0.0001264467,0.002767962,0.0008366237,0.19960332],"genre_scores_gemma":[0.96545506,0.0009912668,0.016694821,0.00046925378,0.00038927892,0.000081537044,0.00078564207,0.00016476451,0.014968375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920624,0.0001603233,0.000041189902,0.00019260641,0.00016204738,0.00023764967],"domain_scores_gemma":[0.9907719,0.006573793,0.0006024101,0.00061887543,0.00044886442,0.0009842308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010221355,0.0009024187,0.001054022,0.0018258803,0.002019329,0.003954222,0.0012974932,0.0011110387,0.013285035],"category_scores_gemma":[0.007925904,0.0005048869,0.00067825936,0.0012404054,0.0023461026,0.0047668223,0.0026924184,0.0036468494,0.0015269608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021313687,0.000064450054,0.002043187,0.00015434143,0.00002776481,0.00022530704,0.00029425346,0.0041728406,0.0024121222,0.96640533,0.010625193,0.013362095],"study_design_scores_gemma":[0.00008364674,0.000044150755,0.0012665393,0.00008755792,0.000040877934,0.00044727037,0.00019994404,0.021315994,0.0015784787,0.96239185,0.012511869,0.000031755866],"about_ca_topic_score_codex":0.00083493034,"about_ca_topic_score_gemma":0.001147671,"teacher_disagreement_score":0.013285035,"about_ca_system_score_codex":0.0018439358,"about_ca_system_score_gemma":0.0007269585,"threshold_uncertainty_score":0.044442892},"labels":[],"label_agreement":null},{"id":"W2399778347","doi":"","title":"Fibonacci Graceful Graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Fibonacci number; Combinatorics; Discrete mathematics","score_opus":0.007963110732290644,"score_gpt":0.22061843209142779,"score_spread":0.21265532135913714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399778347","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2102229,0.0030462553,0.26461348,0.005170072,0.0007632339,0.00017003469,0.0025271762,0.0019758842,0.511511],"genre_scores_gemma":[0.8619683,0.001470482,0.06497297,0.0012836327,0.00045666003,0.00021452471,0.0018892739,0.00041921425,0.06732505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993206,0.00014020797,0.000034153687,0.00016995413,0.000176568,0.00015847964],"domain_scores_gemma":[0.9981305,0.00088652654,0.00018695678,0.00042346024,0.00016666732,0.00020585202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006370892,0.0006348668,0.000540643,0.0018761159,0.0029155393,0.0030698704,0.0009541379,0.001146071,0.015600817],"category_scores_gemma":[0.0027581982,0.00046177,0.000726815,0.0017438385,0.0022818563,0.003480886,0.0017181549,0.0016592093,0.002679919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019230063,0.00000659084,0.00011336821,0.00002418991,0.0000034298873,0.000031754156,0.000067962406,0.0006841547,0.00058423553,0.988457,0.004085415,0.005922743],"study_design_scores_gemma":[0.0000056936747,0.0000044265994,0.00013231332,0.000010598251,0.0000055925343,0.00007986568,0.000049933922,0.0024704807,0.00063399744,0.9854848,0.011114009,0.000008267799],"about_ca_topic_score_codex":0.0020328774,"about_ca_topic_score_gemma":0.003598323,"teacher_disagreement_score":0.015600817,"about_ca_system_score_codex":0.0018505176,"about_ca_system_score_gemma":0.0008196739,"threshold_uncertainty_score":0.052190006},"labels":[],"label_agreement":null},{"id":"W2399871227","doi":"","title":"Upper Bounds on the D(β)-Vertex-Distinguishing Total-Chromatic Number of Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Vertex (graph theory); Combinatorics; Brooks' theorem; Graph; Discrete mathematics; 1-planar graph; Chordal graph","score_opus":0.022532212331334366,"score_gpt":0.2498873187722664,"score_spread":0.22735510644093201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399871227","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39273664,0.008338536,0.26510113,0.0128528355,0.0010266864,0.00029793716,0.009049716,0.0027597444,0.30783674],"genre_scores_gemma":[0.92407554,0.002361698,0.056419466,0.0011079037,0.00048461882,0.0002692545,0.0027379617,0.00051130715,0.012032353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979234,0.00038343683,0.00008912814,0.00057877606,0.0005309757,0.0004943554],"domain_scores_gemma":[0.9747624,0.018643292,0.001097447,0.0025864,0.0010978989,0.0018126615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030359062,0.00174218,0.0011177693,0.0032678314,0.0023653002,0.004142229,0.004796125,0.0018655448,0.015516237],"category_scores_gemma":[0.019618358,0.0009324179,0.001097698,0.0033699612,0.0037123794,0.0072512045,0.0043086302,0.0051728967,0.0021628137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012964255,0.00041850362,0.012036736,0.0010052425,0.00016930464,0.00022034471,0.00061582343,0.049776375,0.01707001,0.8041047,0.04881651,0.06447005],"study_design_scores_gemma":[0.00013743251,0.00010796051,0.006192534,0.00018864704,0.0001794726,0.0006797621,0.00025255492,0.119779274,0.008170544,0.84268403,0.021531122,0.000096555785],"about_ca_topic_score_codex":0.0022537562,"about_ca_topic_score_gemma":0.004973573,"teacher_disagreement_score":0.015516237,"about_ca_system_score_codex":0.004922826,"about_ca_system_score_gemma":0.0017778762,"threshold_uncertainty_score":0.051907003},"labels":[],"label_agreement":null},{"id":"W2399940019","doi":"","title":"Chromaticity of Complete Tripartite Graphs With Certain Star or Matching Deleted.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chromaticity; Mathematics; Star (game theory); Matching (statistics); Combinatorics; Artificial intelligence; Computer science; Statistics; Mathematical analysis","score_opus":0.0156297330219401,"score_gpt":0.23147047304268395,"score_spread":0.21584074002074385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399940019","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8747194,0.00036794212,0.04246814,0.0013429883,0.00009113822,0.000064584405,0.0024200098,0.0002977351,0.078228034],"genre_scores_gemma":[0.97544867,0.0002110949,0.0121485945,0.00018717047,0.000056897512,0.000051135365,0.0016344424,0.000111848414,0.010150113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995111,0.00012725407,0.00002253151,0.00013269394,0.000085493186,0.00012090369],"domain_scores_gemma":[0.9973642,0.0011285002,0.00047791726,0.0004012954,0.00024597155,0.00038208172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004927384,0.0003412843,0.00039137038,0.001309875,0.0015655527,0.0028455008,0.0013583396,0.0009136796,0.012256135],"category_scores_gemma":[0.0027023212,0.00047952804,0.00042393507,0.0013466149,0.0014557525,0.0024687285,0.0010419218,0.0011798661,0.0009166792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005973035,0.00010633793,0.0047310884,0.00020280022,0.0000563862,0.00024621226,0.00065124227,0.017532326,0.011706084,0.93149036,0.01713599,0.015543905],"study_design_scores_gemma":[0.00013384275,0.0000790226,0.006297303,0.000064981265,0.000077017554,0.00060035236,0.00089024776,0.08274476,0.009213867,0.8823937,0.017438715,0.000066297674],"about_ca_topic_score_codex":0.0031947736,"about_ca_topic_score_gemma":0.0044058776,"teacher_disagreement_score":0.012256135,"about_ca_system_score_codex":0.0015920762,"about_ca_system_score_gemma":0.00066613546,"threshold_uncertainty_score":0.041000903},"labels":[],"label_agreement":null},{"id":"W2400029043","doi":"","title":"The strong chromatic index of graphs with restricted Ore-degrees.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Chromatic scale; Edge coloring; Combinatorics; Graph; Computer science; Line graph; World Wide Web","score_opus":0.017795606998654418,"score_gpt":0.2259521465028881,"score_spread":0.20815653950423368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400029043","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78619075,0.0013706916,0.091248475,0.0033019527,0.00021263535,0.00006363864,0.0019989144,0.000374979,0.11523793],"genre_scores_gemma":[0.97869134,0.0004633707,0.01200991,0.00017500347,0.00014251257,0.00005146344,0.00056511647,0.00010682476,0.0077944244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924916,0.00019818461,0.000039273218,0.00017617526,0.00015044674,0.00018669781],"domain_scores_gemma":[0.99436355,0.0031797239,0.0007116313,0.00068177975,0.00037656477,0.00068674533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011377009,0.0005059123,0.00057980896,0.0021972144,0.0017709966,0.0039042265,0.0013884201,0.0010746768,0.00891852],"category_scores_gemma":[0.0064463248,0.00052163657,0.0004784033,0.0019178211,0.002530306,0.0065269223,0.0019703319,0.0018828847,0.0008631171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028629886,0.000061855215,0.0031982213,0.00011337101,0.000027599379,0.00006857374,0.00027426457,0.0072450545,0.0040848437,0.9651358,0.0062886933,0.013215394],"study_design_scores_gemma":[0.000044958146,0.000032992364,0.0026659367,0.00005249998,0.000037837188,0.00020254421,0.00029653878,0.033883806,0.0030792735,0.95336306,0.0063099647,0.000030607087],"about_ca_topic_score_codex":0.0016533211,"about_ca_topic_score_gemma":0.0026672941,"teacher_disagreement_score":0.00891852,"about_ca_system_score_codex":0.0019338403,"about_ca_system_score_gemma":0.0009154973,"threshold_uncertainty_score":0.029835463},"labels":[],"label_agreement":null},{"id":"W2400073997","doi":"","title":"The partition theorem of connected digraphs and its enumerative applications.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Partition (number theory); Combinatorics; Discrete mathematics","score_opus":0.016419957538955553,"score_gpt":0.23619141259896087,"score_spread":0.2197714550600053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400073997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09319339,0.0134260245,0.7184152,0.007857832,0.00076997804,0.00012265802,0.002227471,0.0010692533,0.16291828],"genre_scores_gemma":[0.753702,0.0092307,0.19013837,0.002195973,0.0015173178,0.00044190008,0.002444395,0.0005150249,0.039814327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989905,0.0003587036,0.000048542337,0.00020646189,0.00025870305,0.0001370951],"domain_scores_gemma":[0.9944193,0.004188895,0.00030165337,0.00059012504,0.00027005473,0.00022989277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014296958,0.0008665105,0.0012007459,0.0037073107,0.0021037273,0.0040637236,0.0023555502,0.0017735081,0.009848745],"category_scores_gemma":[0.010175833,0.0008087465,0.0012001016,0.0062067923,0.0038454637,0.009059578,0.0030760425,0.004465782,0.0015095688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016151032,0.00001689746,0.00026279007,0.000079352205,0.000012736786,0.000024324989,0.00010477188,0.0017510653,0.0001754937,0.9817633,0.0047966833,0.010996442],"study_design_scores_gemma":[0.0000072859843,0.0000036234035,0.00013464215,0.000023285264,0.000009784048,0.00004892038,0.00003938086,0.0061139,0.00016408897,0.9894271,0.0040208283,0.0000071164923],"about_ca_topic_score_codex":0.0028390666,"about_ca_topic_score_gemma":0.004076436,"teacher_disagreement_score":0.009848745,"about_ca_system_score_codex":0.0032624914,"about_ca_system_score_gemma":0.0010234212,"threshold_uncertainty_score":0.032947302},"labels":[],"label_agreement":null},{"id":"W2400082119","doi":"","title":"On 3-Degeneracy of Some C7-free Plane Graphs with Application to Choosability.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Degeneracy (biology); Mathematics; Plane (geometry); Combinatorics; Geometry; Biology","score_opus":0.005770905194615844,"score_gpt":0.2152584925234447,"score_spread":0.20948758732882886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400082119","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7106153,0.0017779124,0.115107924,0.003488333,0.00023707421,0.00011271784,0.001067157,0.00032362633,0.16727003],"genre_scores_gemma":[0.95433265,0.000849851,0.029676642,0.0005072135,0.00012708467,0.00008434783,0.0008331655,0.00012584725,0.013463201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996357,0.00008423854,0.000021934378,0.00008907203,0.00008581239,0.00008329644],"domain_scores_gemma":[0.9986694,0.00082450383,0.00016844357,0.000109174434,0.00007174386,0.00015675233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041691063,0.00043487627,0.0006269126,0.0016473485,0.0017788063,0.0018631109,0.00079020363,0.001441982,0.009199646],"category_scores_gemma":[0.0022903886,0.00048428972,0.0007367974,0.0014718721,0.0017576847,0.0027322685,0.0018658132,0.0025056384,0.00062832783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008693023,0.000045704757,0.0010855548,0.00011967279,0.000014340485,0.00026631844,0.00040554703,0.004357545,0.002648882,0.97247386,0.003793789,0.014701872],"study_design_scores_gemma":[0.00003257635,0.000015839758,0.00075704197,0.00003336205,0.00001412479,0.0003109102,0.00021685562,0.01448842,0.0012865877,0.97820413,0.00462181,0.00001838464],"about_ca_topic_score_codex":0.0016984368,"about_ca_topic_score_gemma":0.0016478765,"teacher_disagreement_score":0.009199646,"about_ca_system_score_codex":0.001161655,"about_ca_system_score_gemma":0.00041590212,"threshold_uncertainty_score":0.030775905},"labels":[],"label_agreement":null},{"id":"W2400133686","doi":"","title":"On connection between α-labelings and edge-antimagic labelings of diconnected graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Connection (principal bundle); Combinatorics; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Geometry; Computer science; Artificial intelligence","score_opus":0.014238371730405985,"score_gpt":0.23355733859490915,"score_spread":0.21931896686450317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400133686","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45464265,0.0065179253,0.25707328,0.01074492,0.0006963757,0.00018508923,0.0019705305,0.0006274914,0.26754165],"genre_scores_gemma":[0.90088403,0.0038712793,0.06601113,0.0024685666,0.00071203243,0.00020033278,0.0014364205,0.00026297887,0.024153208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982673,0.0005655207,0.00013440147,0.00043146985,0.00030912206,0.00029220682],"domain_scores_gemma":[0.984615,0.010261498,0.0015039479,0.0014684967,0.0008312399,0.0013197296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021232965,0.0006345644,0.00095985975,0.0035532822,0.0037317968,0.004972252,0.0019400269,0.0029453686,0.010386706],"category_scores_gemma":[0.012079273,0.0009616864,0.0009534286,0.0044325846,0.005358003,0.012948977,0.004365863,0.0042007477,0.001225052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054570664,0.00002784062,0.00067105464,0.0000701958,0.000008730906,0.000052345735,0.00021307328,0.00085199566,0.00037962745,0.9875481,0.0029195927,0.007202868],"study_design_scores_gemma":[0.00001307611,0.000012299153,0.00034434636,0.00003340229,0.000010871265,0.00013411534,0.00014709291,0.0028279857,0.00024276953,0.99249685,0.0037246908,0.000012503349],"about_ca_topic_score_codex":0.0016884514,"about_ca_topic_score_gemma":0.001901035,"teacher_disagreement_score":0.010386706,"about_ca_system_score_codex":0.002801789,"about_ca_system_score_gemma":0.00071681314,"threshold_uncertainty_score":0.034747005},"labels":[],"label_agreement":null},{"id":"W2400313175","doi":"","title":"Chromatic Uniqueness of K 4 -Homeomorphic Graphs.","year":2012,"lang":"es","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Uniqueness; Combinatorics; Mathematical analysis","score_opus":0.016928779485902056,"score_gpt":0.24171071039381234,"score_spread":0.2247819309079103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400313175","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7744303,0.0012220268,0.09111982,0.0026201096,0.00022303428,0.00007681924,0.0011271514,0.00035158542,0.12882921],"genre_scores_gemma":[0.9623063,0.0004367712,0.01797032,0.00029079115,0.00007728499,0.00005088291,0.000601388,0.0001110477,0.018155115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961084,0.00010179564,0.000018862005,0.000118829594,0.00006082816,0.000089011475],"domain_scores_gemma":[0.99847215,0.00077085296,0.00021129167,0.00021192897,0.00014513002,0.00018865088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048354425,0.0003695778,0.0004926717,0.0012223509,0.0020700956,0.0025209207,0.0010467013,0.0012017397,0.010790714],"category_scores_gemma":[0.0026654266,0.0005020569,0.00055022835,0.0010471141,0.0018286991,0.003155684,0.0018414792,0.0015035312,0.001044904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013115857,0.000033635544,0.0021363085,0.00011212992,0.000019781728,0.00015711777,0.00037967463,0.0034224514,0.002990114,0.97067034,0.0058677183,0.014079476],"study_design_scores_gemma":[0.00003968684,0.00003000841,0.0023344113,0.000045422017,0.000030545925,0.0004693152,0.00076507364,0.012636785,0.0031559921,0.9679051,0.012553138,0.000034488912],"about_ca_topic_score_codex":0.0020364968,"about_ca_topic_score_gemma":0.002474881,"teacher_disagreement_score":0.010790714,"about_ca_system_score_codex":0.001343705,"about_ca_system_score_gemma":0.0005844961,"threshold_uncertainty_score":0.03609848},"labels":[],"label_agreement":null},{"id":"W2400382429","doi":"","title":"A Note on Strongly Graceful Trees.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.011176706066020963,"score_gpt":0.23833828088776837,"score_spread":0.2271615748217474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400382429","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030182622,0.014255399,0.38759136,0.040694386,0.008231443,0.00013446223,0.0015577162,0.002046888,0.5153057],"genre_scores_gemma":[0.5169793,0.02596892,0.2616983,0.01704849,0.010894044,0.00042433222,0.0018384769,0.0020068171,0.16314135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998722,0.000365625,0.00005741908,0.00029399875,0.00038069853,0.00018018857],"domain_scores_gemma":[0.99547064,0.0028397813,0.00016156693,0.0008604006,0.00026575514,0.00040194739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017849291,0.0009482666,0.00095178495,0.0014741718,0.0025559987,0.0031506978,0.00182321,0.0016008553,0.017258719],"category_scores_gemma":[0.0058251545,0.00063161534,0.0010927358,0.0027711394,0.0043353187,0.0094128875,0.00474729,0.0072696917,0.0038157953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027995655,0.000020007934,0.00014817386,0.000092806484,0.0000070545134,0.00007543415,0.00013905157,0.0010426685,0.0004962249,0.956397,0.025031349,0.016522234],"study_design_scores_gemma":[0.0000050176063,0.000010162403,0.00013011075,0.000030566876,0.000006647572,0.000082476115,0.000051338116,0.0016505752,0.00029902408,0.947388,0.050335467,0.000010653062],"about_ca_topic_score_codex":0.0027243064,"about_ca_topic_score_gemma":0.004350436,"teacher_disagreement_score":0.017258719,"about_ca_system_score_codex":0.0020555358,"about_ca_system_score_gemma":0.0011637388,"threshold_uncertainty_score":0.057736218},"labels":[],"label_agreement":null},{"id":"W2400437385","doi":"","title":"On the Vertex Geodomination Number of a Graph.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.020170330089331952,"score_gpt":0.2256931012069957,"score_spread":0.20552277111766376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400437385","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58909565,0.003912082,0.21476401,0.012275731,0.0009272043,0.0001245082,0.0026160486,0.00059364224,0.17569111],"genre_scores_gemma":[0.92873186,0.0016220903,0.046712816,0.0007102778,0.0006721871,0.00016283558,0.001109978,0.00022549668,0.02005249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988949,0.0003837226,0.000049504924,0.0002514818,0.00019870774,0.00022163414],"domain_scores_gemma":[0.9917966,0.0054443255,0.0007772841,0.0007471441,0.00041585902,0.0008187902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012932103,0.00066513446,0.00088168844,0.0028214802,0.002219979,0.0038265605,0.0015919048,0.0017695382,0.010402663],"category_scores_gemma":[0.00905849,0.0004844767,0.0005187933,0.0024482743,0.0030887667,0.008196716,0.002176145,0.002635266,0.001646056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020148215,0.000051192797,0.0020540971,0.00014354172,0.000017935092,0.00008241964,0.0002730565,0.0072015496,0.0012352476,0.956362,0.010770466,0.021606917],"study_design_scores_gemma":[0.00003197522,0.000028681847,0.001185098,0.000052058003,0.000017707383,0.00022075765,0.00026019596,0.022608643,0.0010160344,0.9658907,0.008663812,0.000024376257],"about_ca_topic_score_codex":0.0011105674,"about_ca_topic_score_gemma":0.0013838164,"teacher_disagreement_score":0.010402663,"about_ca_system_score_codex":0.0017845214,"about_ca_system_score_gemma":0.00069685566,"threshold_uncertainty_score":0.03480035},"labels":[],"label_agreement":null},{"id":"W2400441241","doi":"","title":"Landmarks in Binary Tree Derived Architectures.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Cardinality (data modeling); Set (abstract data type); Binary tree; Graph; Binary number; Tree (set theory); Discrete mathematics; Computer science; Arithmetic; Data mining","score_opus":0.018056713986490447,"score_gpt":0.21468584306130564,"score_spread":0.1966291290748152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400441241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46654335,0.0010076618,0.48374602,0.000803637,0.0000898383,0.0001079711,0.0008182082,0.0005139038,0.046369422],"genre_scores_gemma":[0.81551015,0.00051972625,0.16839425,0.00014468934,0.000032744716,0.0001285997,0.00087558234,0.000056594683,0.014337655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996772,0.000079980025,0.00002228867,0.00007615702,0.00007629761,0.00006811694],"domain_scores_gemma":[0.9989322,0.00042115006,0.00026949696,0.00016509138,0.00011603517,0.00009605499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027072115,0.0002172855,0.0003066799,0.00069924654,0.0008982539,0.0012646731,0.0006407849,0.0007215075,0.004979694],"category_scores_gemma":[0.0022628533,0.00026629984,0.00026980333,0.00093497284,0.0007407255,0.0023727878,0.0012401054,0.0006189788,0.0008692171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031184728,0.00006592191,0.003169638,0.00027132418,0.000026136935,0.000320803,0.00046595105,0.07489915,0.010156984,0.8312722,0.0049094516,0.07413068],"study_design_scores_gemma":[0.00006523852,0.00023207055,0.0032679508,0.00011751525,0.000043753935,0.0009375985,0.00073987735,0.26472268,0.009262524,0.68156254,0.039008807,0.00003942245],"about_ca_topic_score_codex":0.0011897893,"about_ca_topic_score_gemma":0.002460087,"teacher_disagreement_score":0.004979694,"about_ca_system_score_codex":0.0009374334,"about_ca_system_score_gemma":0.00040735365,"threshold_uncertainty_score":0.016658783},"labels":[],"label_agreement":null},{"id":"W2400695370","doi":"","title":"Some α-graphs and odd graceful graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.018973409512979718,"score_gpt":0.21362635603377095,"score_spread":0.19465294652079124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400695370","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6203416,0.002053903,0.13201548,0.0058747963,0.00036636833,0.00009899462,0.0023259479,0.0008982058,0.2360248],"genre_scores_gemma":[0.9397412,0.00092368404,0.02818252,0.00076026196,0.00019027406,0.00006930206,0.0010269696,0.00015368078,0.02895217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995029,0.00011769407,0.000025472407,0.0001317092,0.000087083776,0.00013507842],"domain_scores_gemma":[0.9978161,0.0010102178,0.00036459242,0.00033408834,0.00013114179,0.00034382765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005253041,0.00052915,0.00041358356,0.0010255118,0.0017118974,0.0025123057,0.0008408481,0.0007220233,0.008678447],"category_scores_gemma":[0.002405661,0.00040428663,0.00059732224,0.001180856,0.0020284862,0.0035220543,0.0015763855,0.0016691929,0.0009953987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000658148,0.000021307458,0.00066270324,0.0000565346,0.000010291779,0.00011106835,0.00018062042,0.0014753568,0.0012158897,0.98374766,0.0048795985,0.0075730924],"study_design_scores_gemma":[0.000013337861,0.000007811711,0.0003791978,0.000014843276,0.000009339956,0.00012309142,0.00014089089,0.0029761193,0.00073357194,0.9861826,0.009410892,0.000008388307],"about_ca_topic_score_codex":0.0017047346,"about_ca_topic_score_gemma":0.0023845942,"teacher_disagreement_score":0.008678447,"about_ca_system_score_codex":0.001348282,"about_ca_system_score_gemma":0.0005135723,"threshold_uncertainty_score":0.02903229},"labels":[],"label_agreement":null},{"id":"W2400697410","doi":"","title":"On graph labeling problems and regular decompositions of complete graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.0144864742018439,"score_gpt":0.22476370374626803,"score_spread":0.21027722954442413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400697410","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15847172,0.015910622,0.59010285,0.020503044,0.0011880618,0.00031883878,0.00298356,0.00092770613,0.2095935],"genre_scores_gemma":[0.6668088,0.014884056,0.24705146,0.003627112,0.0029864875,0.00069782947,0.006568813,0.00077449,0.056600943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795014,0.00084729487,0.00009669437,0.00041470642,0.00035986362,0.00033129338],"domain_scores_gemma":[0.9884643,0.00861097,0.00069495913,0.0009721761,0.00047852367,0.0007791179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025996692,0.001261467,0.0015742322,0.0025054954,0.0024518066,0.0049083466,0.002333184,0.00251413,0.011560939],"category_scores_gemma":[0.01376065,0.0010730855,0.0013837643,0.004394614,0.0046905205,0.012907744,0.003537081,0.0052527087,0.0017310953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006781887,0.000092870134,0.0005519641,0.00020770711,0.000032204116,0.00007284428,0.00025545023,0.0060342457,0.00040326215,0.9511948,0.0201303,0.020956555],"study_design_scores_gemma":[0.000015532178,0.000008934353,0.00018601348,0.000042113305,0.000010197234,0.00007520005,0.00015607703,0.0076432046,0.00014883235,0.98587275,0.0058325185,0.000008589569],"about_ca_topic_score_codex":0.0023866154,"about_ca_topic_score_gemma":0.0029321958,"teacher_disagreement_score":0.011560939,"about_ca_system_score_codex":0.0026023982,"about_ca_system_score_gemma":0.0011370195,"threshold_uncertainty_score":0.03867525},"labels":[],"label_agreement":null},{"id":"W2400963025","doi":"","title":"A note on the vertex-distinguishing proper edge coloring of graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Edge coloring; Enhanced Data Rates for GSM Evolution; Combinatorics; Brooks' theorem; Graph coloring; Complete coloring; Graph; 1-planar graph; Chordal graph; Computer science; Artificial intelligence; Line graph","score_opus":0.016567694538734013,"score_gpt":0.22472086055119253,"score_spread":0.2081531660124585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400963025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036210228,0.018518714,0.5523226,0.034739304,0.016963784,0.00016752358,0.0013300548,0.0015386345,0.33820912],"genre_scores_gemma":[0.5039489,0.019002242,0.39194056,0.014022427,0.009991895,0.000278829,0.0014156441,0.0010078438,0.05839159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980824,0.0006415494,0.00009709217,0.0004810265,0.00046662855,0.00023133674],"domain_scores_gemma":[0.9919161,0.0057440554,0.00022525997,0.001228023,0.00041617494,0.00047028394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023950338,0.0010299319,0.0012168632,0.0017393394,0.0029312186,0.0035956483,0.0029963497,0.002083173,0.009525913],"category_scores_gemma":[0.009115739,0.0007846446,0.0013248564,0.003095699,0.006106203,0.008738983,0.0041102455,0.008845724,0.0018342974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009129021,0.00006254068,0.00057780783,0.00023511646,0.000022951965,0.00020422986,0.00017950046,0.0029394461,0.0014548685,0.92693543,0.041040003,0.026256854],"study_design_scores_gemma":[0.000013830182,0.000025551091,0.00040395017,0.000050878905,0.000020326936,0.00023641503,0.000103817714,0.00553369,0.0008047518,0.94860715,0.044173986,0.000025537887],"about_ca_topic_score_codex":0.003999995,"about_ca_topic_score_gemma":0.006196272,"teacher_disagreement_score":0.009525913,"about_ca_system_score_codex":0.0021709877,"about_ca_system_score_gemma":0.0014989803,"threshold_uncertainty_score":0.031867385},"labels":[],"label_agreement":null},{"id":"W2401136340","doi":"","title":"Total and adjacent vertex-distinguishing total chromatic numbers of augmented cubes.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Vertex (graph theory); Combinatorics; Graph","score_opus":0.0067147182642866175,"score_gpt":0.20706496852393347,"score_spread":0.20035025025964684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401136340","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71431905,0.00097500946,0.13184102,0.0020143988,0.00027032077,0.00010654106,0.0025240907,0.0004723017,0.1474772],"genre_scores_gemma":[0.94690394,0.00034410672,0.03758645,0.00024344336,0.00010421943,0.00009981344,0.0011894124,0.0001518207,0.01337679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987859,0.0003107094,0.00006102241,0.00028951193,0.00027530978,0.0002774823],"domain_scores_gemma":[0.9934018,0.004161404,0.00062170974,0.0008020914,0.00046382943,0.00054902537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013805927,0.0006661812,0.0006309253,0.0018129937,0.0019786628,0.004203924,0.0024195334,0.0011588461,0.013062103],"category_scores_gemma":[0.007620294,0.0005952791,0.0007123187,0.0022415954,0.0028400011,0.0057499004,0.0024656386,0.002405036,0.00093194755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034095233,0.000060229144,0.0018794956,0.00013362088,0.000024554678,0.00006638241,0.0002449631,0.014268685,0.0022289662,0.95775014,0.0060272245,0.01697476],"study_design_scores_gemma":[0.00005687133,0.000046413665,0.0016904993,0.00004934267,0.000041799976,0.00021561759,0.0002990934,0.040839285,0.0028745956,0.9469852,0.006866728,0.000034610228],"about_ca_topic_score_codex":0.002542199,"about_ca_topic_score_gemma":0.003727036,"teacher_disagreement_score":0.013062103,"about_ca_system_score_codex":0.0025791323,"about_ca_system_score_gemma":0.0011360764,"threshold_uncertainty_score":0.04369706},"labels":[],"label_agreement":null},{"id":"W2401155135","doi":"","title":"Weak Edge Detour Number of a Graph.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Graph; Computer science; Artificial intelligence","score_opus":0.020548330312800837,"score_gpt":0.233535687055139,"score_spread":0.21298735674233815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401155135","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6683722,0.0010851859,0.19084369,0.005260657,0.00058242213,0.00011080461,0.002902282,0.0005687722,0.13027391],"genre_scores_gemma":[0.92773575,0.00050054403,0.041415356,0.00040945987,0.0002625471,0.00012407514,0.0013699201,0.00017973084,0.02800271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999116,0.00025636924,0.00005224765,0.00021553895,0.00017843826,0.00018137084],"domain_scores_gemma":[0.9943433,0.003153951,0.00055342895,0.00072774687,0.0004768029,0.0007447829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010446233,0.0006281419,0.00066831784,0.002254982,0.0024718365,0.0030955886,0.0017012754,0.0013615652,0.011993878],"category_scores_gemma":[0.0065128906,0.00038982043,0.00052879885,0.0018285329,0.0022932803,0.006654533,0.0019600117,0.0023965186,0.0016513129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002748473,0.00006724467,0.0019972697,0.00016822948,0.000024629717,0.00010765002,0.00026132315,0.004221264,0.0041392185,0.9593449,0.0076826783,0.021710698],"study_design_scores_gemma":[0.000028501292,0.000043167238,0.0012579222,0.00003986344,0.000031027743,0.0002341848,0.00024088444,0.018779457,0.0038454535,0.963328,0.012146596,0.000025009194],"about_ca_topic_score_codex":0.0007546257,"about_ca_topic_score_gemma":0.0010046446,"teacher_disagreement_score":0.011993878,"about_ca_system_score_codex":0.0011333185,"about_ca_system_score_gemma":0.00058267085,"threshold_uncertainty_score":0.040123522},"labels":[],"label_agreement":null},{"id":"W2401215171","doi":"","title":"A note on bounds for the maximum traceable number of a graph.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics; Discrete mathematics","score_opus":0.012216656119128701,"score_gpt":0.24965914596581054,"score_spread":0.23744248984668184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401215171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016153103,0.03531978,0.59332216,0.040341225,0.0139169125,0.00024879427,0.0029303778,0.0036360826,0.29413158],"genre_scores_gemma":[0.38494673,0.039273545,0.4444014,0.018237961,0.023894964,0.0017824237,0.003606437,0.0051606256,0.07869592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922236,0.0022059064,0.0004335383,0.0019324672,0.0022161626,0.0009882995],"domain_scores_gemma":[0.9179047,0.06823103,0.0013214857,0.0073557887,0.0027044816,0.0024825113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009268551,0.0049526673,0.0037332224,0.008585055,0.0044604708,0.009579846,0.011132722,0.005572181,0.028892513],"category_scores_gemma":[0.05792065,0.0020491895,0.0047793686,0.00873463,0.0097238105,0.031987555,0.010871467,0.028149398,0.008218756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000493729,0.00020226439,0.0009500898,0.00083192013,0.00013702908,0.00040762805,0.00037968997,0.0105206035,0.0031938115,0.85721123,0.076273404,0.04939865],"study_design_scores_gemma":[0.000024642946,0.000056263907,0.00047405262,0.00021131597,0.00007315348,0.00019613888,0.00009472606,0.015138583,0.0013426265,0.9503464,0.031981736,0.000060391605],"about_ca_topic_score_codex":0.0046544736,"about_ca_topic_score_gemma":0.0068690884,"teacher_disagreement_score":0.028892513,"about_ca_system_score_codex":0.006964495,"about_ca_system_score_gemma":0.00230056,"threshold_uncertainty_score":0.09665507},"labels":[],"label_agreement":null},{"id":"W2401313454","doi":"","title":"On Some Metric Properties of the Sierpinski Graphs S(n, k).","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Sierpinski triangle; Metric (unit); Combinatorics; Discrete mathematics; Mathematical analysis; Fractal; Business; Marketing","score_opus":0.01289290419295852,"score_gpt":0.20763990689310174,"score_spread":0.19474700270014322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401313454","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65600914,0.005472433,0.14854015,0.0055732583,0.0004191606,0.00013143341,0.0023997964,0.00044761936,0.18100709],"genre_scores_gemma":[0.96048665,0.0018523311,0.02568839,0.00055251154,0.00036195735,0.00014342455,0.0010823873,0.00012767408,0.00970471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911886,0.00032144226,0.00005508383,0.00014763596,0.00020148711,0.00015544554],"domain_scores_gemma":[0.9949882,0.002740377,0.0008541013,0.00035928175,0.00037564282,0.00068237487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010148305,0.00065198116,0.00074217044,0.0028179649,0.001763154,0.0031119299,0.0012270194,0.001267333,0.00650556],"category_scores_gemma":[0.0069726217,0.00044596044,0.0006067002,0.0027729361,0.0025580868,0.005416499,0.0019112988,0.0019450301,0.0008396739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006023248,0.00003338328,0.001050851,0.00009095128,0.00001508438,0.00007918618,0.00018872702,0.0032277645,0.0010074944,0.97942996,0.004615394,0.01020092],"study_design_scores_gemma":[0.000017594823,0.000038973554,0.0019033334,0.00003829829,0.000017378,0.00027570562,0.00024041234,0.013826967,0.00062855304,0.97668296,0.006297347,0.000032484095],"about_ca_topic_score_codex":0.0014322761,"about_ca_topic_score_gemma":0.0019364762,"teacher_disagreement_score":0.00650556,"about_ca_system_score_codex":0.0015646011,"about_ca_system_score_gemma":0.0005923637,"threshold_uncertainty_score":0.021763206},"labels":[],"label_agreement":null},{"id":"W2401317033","doi":"","title":"The adjacent vertex-distinguishing total chromatic number of 1-tree.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Chromatic scale; Combinatorics; Tree (set theory); Graph","score_opus":0.00869605042671837,"score_gpt":0.23651285122105303,"score_spread":0.22781680079433467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401317033","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7905044,0.0011926502,0.06706503,0.0035873153,0.00033764998,0.00008303943,0.0028531593,0.00042465248,0.13395216],"genre_scores_gemma":[0.9690598,0.00048350188,0.018074043,0.00030284113,0.00015663914,0.00007243393,0.0012349256,0.00012927531,0.010486551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992036,0.00018118636,0.00003086933,0.00023091095,0.00014894662,0.0002045904],"domain_scores_gemma":[0.99585307,0.0025147214,0.00043440604,0.00044028013,0.00029195502,0.00046570174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096285634,0.00048173167,0.0006032282,0.0018749438,0.0022149172,0.003225072,0.0019314694,0.0012532156,0.012062203],"category_scores_gemma":[0.005380085,0.00040921566,0.0005032091,0.0019100723,0.002433471,0.0051427623,0.0017191219,0.0020332413,0.0010214015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046420068,0.000081116195,0.0039648414,0.00022853148,0.00003270537,0.00009454492,0.00040096114,0.011140732,0.0056872754,0.9390192,0.01454126,0.024344575],"study_design_scores_gemma":[0.00006432596,0.000053207656,0.0030882284,0.000052219595,0.000061685416,0.00036209682,0.00034233843,0.0401846,0.003828008,0.9420843,0.009839542,0.00003938465],"about_ca_topic_score_codex":0.002325447,"about_ca_topic_score_gemma":0.0030072525,"teacher_disagreement_score":0.012062203,"about_ca_system_score_codex":0.0025059376,"about_ca_system_score_gemma":0.0010217077,"threshold_uncertainty_score":0.040352046},"labels":[],"label_agreement":null},{"id":"W2401333936","doi":"","title":"A Note On Edge-Cover Coloring Of Nearly Bipartite Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Edge coloring; Enhanced Data Rates for GSM Evolution; Cover (algebra); Combinatorics; Complete bipartite graph; Graph; Computer science; Artificial intelligence; Line graph; Graph power","score_opus":0.01273633057090452,"score_gpt":0.23664707564287363,"score_spread":0.22391074507196912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401333936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03645045,0.026184319,0.5071947,0.040815134,0.021502849,0.0002610854,0.002384887,0.0019332642,0.36327326],"genre_scores_gemma":[0.42823163,0.03844063,0.40147355,0.018308522,0.017684562,0.0004520974,0.0025719157,0.0015166822,0.09132044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988532,0.00034591855,0.000047283465,0.00025529237,0.00035837977,0.00013987346],"domain_scores_gemma":[0.99560934,0.0031104034,0.00012394431,0.0006134633,0.0002538583,0.00028900456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014812441,0.0010563924,0.0012732642,0.0017133858,0.0022423686,0.0026049998,0.0025914626,0.001694125,0.0122291725],"category_scores_gemma":[0.0063219443,0.000717472,0.0011439697,0.0033992636,0.0026845313,0.005654538,0.0029160536,0.0060753045,0.0024921978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019075414,0.00013764123,0.0010186462,0.0006312607,0.00006751651,0.0005034503,0.00028490482,0.009506266,0.0036578458,0.7529161,0.16290337,0.068182275],"study_design_scores_gemma":[0.000022055574,0.0000431395,0.0008546188,0.000104136714,0.000034583914,0.00039050137,0.00014647335,0.016094884,0.0012204639,0.8781093,0.10293765,0.000042202508],"about_ca_topic_score_codex":0.0045074085,"about_ca_topic_score_gemma":0.007529443,"teacher_disagreement_score":0.0122291725,"about_ca_system_score_codex":0.0020788398,"about_ca_system_score_gemma":0.0009883064,"threshold_uncertainty_score":0.04091066},"labels":[],"label_agreement":null},{"id":"W2401654925","doi":"","title":"New results on sum graph theory.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics; Discrete mathematics","score_opus":0.015254293845447478,"score_gpt":0.23610100108679433,"score_spread":0.22084670724134686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401654925","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042919613,0.013494971,0.4099633,0.0142353345,0.004837758,0.00009261807,0.0025957788,0.001569155,0.5102915],"genre_scores_gemma":[0.5681326,0.015938468,0.23701948,0.010668296,0.008445079,0.00051638036,0.005121706,0.0020632357,0.15209472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981982,0.00046197072,0.00009144234,0.00041809794,0.00064821285,0.0001822093],"domain_scores_gemma":[0.9952382,0.0025402843,0.00026875784,0.00074943854,0.0006591563,0.0005442084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012702637,0.001174867,0.0012725677,0.0042458447,0.0029940829,0.0059096175,0.002523243,0.0016787596,0.023033068],"category_scores_gemma":[0.006762544,0.00076686655,0.0015155257,0.005086975,0.0034819231,0.014457062,0.0046609906,0.0063039665,0.0051803445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018537236,0.000026571475,0.00017135795,0.00010575216,0.00001173605,0.000031939915,0.0000936411,0.0005410742,0.00025470878,0.9733998,0.012789344,0.012555548],"study_design_scores_gemma":[0.0000050636686,0.000004541719,0.00010494362,0.000026020416,0.000010870938,0.00008192933,0.000057953603,0.0019439204,0.00017268566,0.9797657,0.017819593,0.000006818207],"about_ca_topic_score_codex":0.0010785871,"about_ca_topic_score_gemma":0.0019284419,"teacher_disagreement_score":0.023033068,"about_ca_system_score_codex":0.0021487335,"about_ca_system_score_gemma":0.00090609293,"threshold_uncertainty_score":0.07705325},"labels":[],"label_agreement":null},{"id":"W2401656958","doi":"","title":"Some Discussions on Super Edge-Magic Labelings of ST(a 1 , ..., a n ).","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"MAGIC (telescope); Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Astronomy; Artificial intelligence; Computer science; Physics","score_opus":0.011343213052408749,"score_gpt":0.22400711379050925,"score_spread":0.2126639007381005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401656958","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030524893,0.011951981,0.29896966,0.036783084,0.0031683908,0.00014139555,0.0009816097,0.00057744066,0.61690146],"genre_scores_gemma":[0.6201799,0.015072324,0.18593924,0.030782042,0.0053120526,0.00060138095,0.0015061095,0.00075793255,0.13984908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842083,0.0006238216,0.00007619802,0.00025771483,0.00035449618,0.00026696554],"domain_scores_gemma":[0.99807227,0.0011294312,0.00017226418,0.0002740507,0.00020114846,0.00015080575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025211088,0.0008897061,0.00060165155,0.002003499,0.0031874853,0.003261296,0.002598423,0.002882628,0.02605792],"category_scores_gemma":[0.00390901,0.000645977,0.0012210849,0.003389321,0.0033558607,0.008439308,0.002302405,0.004468376,0.002713243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000081960015,0.000008397793,0.000050019014,0.000035683865,0.0000021727433,0.000029146104,0.00008445432,0.00030081125,0.00017370596,0.99116665,0.005568499,0.0025722748],"study_design_scores_gemma":[0.0000055341525,0.000009545483,0.00011593158,0.000035998382,0.000004116007,0.000086119275,0.00008706705,0.0016990745,0.00027557666,0.9608822,0.036789156,0.00000971916],"about_ca_topic_score_codex":0.0019675377,"about_ca_topic_score_gemma":0.0030957682,"teacher_disagreement_score":0.02605792,"about_ca_system_score_codex":0.0026544377,"about_ca_system_score_gemma":0.00075385155,"threshold_uncertainty_score":0.08717245},"labels":[],"label_agreement":null},{"id":"W2401689232","doi":"","title":"Isolated Toughness and Fractional (g, f)-Factors of Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Toughness; Combinatorics; Discrete mathematics; Composite material; Materials science","score_opus":0.009752522734296394,"score_gpt":0.21349111225013026,"score_spread":0.20373858951583387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401689232","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7260108,0.0019316049,0.14903837,0.0038172738,0.0003386786,0.00008529072,0.001034572,0.000659186,0.11708424],"genre_scores_gemma":[0.9667057,0.00041203757,0.017490333,0.00035997812,0.00019051388,0.00006140793,0.0004333163,0.0001339695,0.0142127415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877125,0.00025952712,0.000053310883,0.00035559238,0.00022067328,0.0003395907],"domain_scores_gemma":[0.99423015,0.0031437862,0.0007020742,0.0005949024,0.00030696546,0.001022117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000980748,0.00072174025,0.0008998373,0.0021472913,0.0036657471,0.0040486488,0.0013174746,0.0014868864,0.013790714],"category_scores_gemma":[0.007217885,0.000663765,0.0009528719,0.0017743913,0.0043781195,0.006233125,0.0024173867,0.002357376,0.0010507001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001344921,0.00004299938,0.0011429888,0.00006951323,0.000014904754,0.0001151955,0.00046465333,0.002545613,0.0013200996,0.98195374,0.003939064,0.008256762],"study_design_scores_gemma":[0.000022234493,0.000014900424,0.0005566122,0.000027283038,0.000014137418,0.00015555469,0.00026569478,0.0065745106,0.00066126947,0.9870193,0.0046698535,0.000018558083],"about_ca_topic_score_codex":0.004221645,"about_ca_topic_score_gemma":0.0041275756,"teacher_disagreement_score":0.013790714,"about_ca_system_score_codex":0.0020970372,"about_ca_system_score_gemma":0.0007780063,"threshold_uncertainty_score":0.04613459},"labels":[],"label_agreement":null},{"id":"W2401781654","doi":"","title":"On the Constructions of New Families of Graceful Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.01665923163136904,"score_gpt":0.22674295588319834,"score_spread":0.2100837242518293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401781654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20242597,0.0033734406,0.5658466,0.005592742,0.0007448009,0.00022204011,0.0011208833,0.0022660848,0.21840748],"genre_scores_gemma":[0.79852235,0.0024640153,0.15111879,0.0016072585,0.0005090887,0.00047880015,0.0010169237,0.0009604526,0.04332237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984034,0.00057887635,0.000074546384,0.00032341754,0.0003401611,0.0002797398],"domain_scores_gemma":[0.9952122,0.002447955,0.00036067175,0.0011268845,0.00028417975,0.00056808174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021628323,0.00083010434,0.00072419574,0.0027930706,0.0039007305,0.0031630292,0.001898478,0.0015173828,0.012205279],"category_scores_gemma":[0.0066223787,0.00090273307,0.0014727035,0.0020451797,0.004922742,0.009050961,0.005651049,0.0033225478,0.0016724414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001685505,0.000011935709,0.00015716713,0.000030224039,0.000004114891,0.000046623492,0.00021406633,0.0008201788,0.00038542083,0.9911378,0.0022198376,0.0049558016],"study_design_scores_gemma":[0.000010492323,0.000010280202,0.00014091934,0.000027131207,0.000009066434,0.00014869476,0.0001295333,0.0037123386,0.0005626804,0.9816482,0.013583496,0.000017185834],"about_ca_topic_score_codex":0.0011243054,"about_ca_topic_score_gemma":0.0017613835,"teacher_disagreement_score":0.012205279,"about_ca_system_score_codex":0.0020224757,"about_ca_system_score_gemma":0.0007848615,"threshold_uncertainty_score":0.04083073},"labels":[],"label_agreement":null},{"id":"W2401901234","doi":"","title":"Embedding Of Signed Graphs In Graceful Signed Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Embedding; Chordal graph; Combinatorics; Discrete mathematics; Graph; Computer science; Artificial intelligence","score_opus":0.009570597695925626,"score_gpt":0.22835705935922185,"score_spread":0.2187864616632962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401901234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3977148,0.0012908425,0.49241254,0.0026015115,0.0004088841,0.00014310607,0.0016678851,0.0013432645,0.10241727],"genre_scores_gemma":[0.89862436,0.0007955165,0.06715592,0.00039813243,0.0002249917,0.00011778646,0.0012571908,0.00034139707,0.03108474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992483,0.00020304743,0.000055909284,0.00017170812,0.00019667254,0.00012439283],"domain_scores_gemma":[0.99759406,0.00081229437,0.00048091452,0.0005905604,0.00020154007,0.00032061304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048906327,0.00057671726,0.000492888,0.0013681751,0.0012095171,0.0028701362,0.0011262113,0.0009830775,0.008709376],"category_scores_gemma":[0.0035745609,0.00042192245,0.0006287208,0.0014489065,0.0018034274,0.00537091,0.0026044634,0.0016821993,0.001551194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006229808,0.00003885064,0.00038221278,0.00007032004,0.000009256164,0.00007923459,0.00019014553,0.004438275,0.0018236501,0.9693318,0.0033243077,0.020249644],"study_design_scores_gemma":[0.000013110061,0.000017432641,0.00027334856,0.000024678702,0.000010422946,0.0001102376,0.0001424362,0.015689852,0.0017927372,0.97316563,0.008743996,0.000016146056],"about_ca_topic_score_codex":0.0010599555,"about_ca_topic_score_gemma":0.0014748353,"teacher_disagreement_score":0.008709376,"about_ca_system_score_codex":0.0011458927,"about_ca_system_score_gemma":0.00054584374,"threshold_uncertainty_score":0.029135764},"labels":[],"label_agreement":null},{"id":"W2401951335","doi":"","title":"Total vertex irregularity strength of certain equitable complete m-partite graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.030737289247498113,"score_gpt":0.24514740247710828,"score_spread":0.21441011322961018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401951335","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9306455,0.0002767356,0.02571412,0.0007589917,0.00004299189,0.000031365056,0.0007885546,0.00014022793,0.04160147],"genre_scores_gemma":[0.9920918,0.00012358795,0.0040559545,0.00009082766,0.0000394383,0.000029709887,0.0004520849,0.000045102963,0.0030714886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993351,0.00021371337,0.00003076312,0.00014365549,0.00014897845,0.00012774156],"domain_scores_gemma":[0.9934017,0.00377892,0.0010192697,0.000670159,0.00044634973,0.0006835501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009054491,0.0004122902,0.00061933376,0.0018882126,0.0016723626,0.0023532496,0.0010895401,0.00086147635,0.0072190603],"category_scores_gemma":[0.0066317264,0.0004931883,0.00047224184,0.001417923,0.0014339568,0.0022130231,0.0011510842,0.0011489349,0.0004563194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049321604,0.00010450613,0.008465247,0.0002466373,0.00008012732,0.0004496798,0.00060472294,0.030965103,0.008675935,0.9235521,0.0077579087,0.018604955],"study_design_scores_gemma":[0.000077223056,0.00009013527,0.006856136,0.000058775993,0.00008580237,0.0008498463,0.00066573295,0.11067009,0.0056623872,0.8682357,0.006704216,0.000043946275],"about_ca_topic_score_codex":0.00075218146,"about_ca_topic_score_gemma":0.0011110208,"teacher_disagreement_score":0.0072190603,"about_ca_system_score_codex":0.00097030745,"about_ca_system_score_gemma":0.00034507635,"threshold_uncertainty_score":0.024150133},"labels":[],"label_agreement":null},{"id":"W2402103922","doi":"","title":"On the Magic Space of Locally Finite Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; MAGIC (telescope); Space (punctuation); Pure mathematics; Computer science; Astronomy; Physics","score_opus":0.013908463387737258,"score_gpt":0.2173933797736019,"score_spread":0.20348491638586463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402103922","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51722014,0.0047729816,0.24098039,0.007953836,0.00035724379,0.00008769777,0.0024580362,0.0007599855,0.2254097],"genre_scores_gemma":[0.9394813,0.0013777413,0.032641638,0.00063655735,0.00027832852,0.000114689276,0.0012783482,0.00017453535,0.024016835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912316,0.000290089,0.00004324472,0.00016776564,0.00018110803,0.0001946225],"domain_scores_gemma":[0.99684286,0.0019622277,0.00030003337,0.00037805457,0.00017929671,0.00033752868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000757246,0.0005061764,0.0007575528,0.0019138394,0.0020116935,0.0031334383,0.0014040706,0.0013091579,0.0122782765],"category_scores_gemma":[0.004105232,0.0004475295,0.0007059268,0.0020884473,0.0036310412,0.008102325,0.0033000186,0.0029612628,0.0012989028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037181893,0.000013778047,0.0002331994,0.000040599603,0.0000060016205,0.000023885039,0.000118317395,0.0013216119,0.00027462334,0.98925626,0.0022058967,0.0064686094],"study_design_scores_gemma":[0.000008617731,0.0000049010932,0.00014090845,0.000014426642,0.000004279133,0.000037459497,0.000077081306,0.0033270493,0.0001792148,0.99408674,0.002112825,0.000006494714],"about_ca_topic_score_codex":0.0020496685,"about_ca_topic_score_gemma":0.0025963464,"teacher_disagreement_score":0.0122782765,"about_ca_system_score_codex":0.0015901068,"about_ca_system_score_gemma":0.0007785395,"threshold_uncertainty_score":0.04107499},"labels":[],"label_agreement":null},{"id":"W2402131418","doi":"","title":"(2, 1)-Total Labeling Of Planar Graphs With Large Girth And Low Maximum Degree.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Girth (graph theory); Degree (music); Planar graph; Combinatorics; Planar; Discrete mathematics; Graph; Computer science; Physics","score_opus":0.01701971071493668,"score_gpt":0.20008094468821083,"score_spread":0.18306123397327415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402131418","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66961646,0.0014804682,0.23370598,0.0035354665,0.0002306083,0.00014385521,0.004215222,0.0013995148,0.08567239],"genre_scores_gemma":[0.8731711,0.0007217001,0.10538576,0.0006134427,0.00011670041,0.00017326715,0.0030355065,0.00037828338,0.016404169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943334,0.0001969558,0.000028852766,0.00013617265,0.000090497815,0.0001141211],"domain_scores_gemma":[0.99694556,0.0016461707,0.0003999369,0.0005825769,0.00017810326,0.00024758338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005971239,0.00049754395,0.0005692328,0.0010291429,0.001248114,0.002336557,0.0010293713,0.0011766758,0.00622903],"category_scores_gemma":[0.0037240859,0.0005726707,0.0005878351,0.0014297855,0.0011018856,0.0031053498,0.0015304498,0.0011506632,0.0009962094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066198857,0.00020983099,0.0047471784,0.00064874545,0.00007201813,0.00029954946,0.00064262684,0.03910336,0.017441338,0.81385434,0.03328586,0.08903312],"study_design_scores_gemma":[0.00008317527,0.000063895364,0.0016190166,0.00005096024,0.00005142055,0.0004276214,0.00030332585,0.048237618,0.0055806395,0.9322985,0.011257499,0.000026279882],"about_ca_topic_score_codex":0.0011336737,"about_ca_topic_score_gemma":0.0025666824,"teacher_disagreement_score":0.00622903,"about_ca_system_score_codex":0.0012588575,"about_ca_system_score_gemma":0.0007088712,"threshold_uncertainty_score":0.020838201},"labels":[],"label_agreement":null},{"id":"W2402145295","doi":"","title":"On super antimagic total labeling of Harary graph.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph; Vertex (graph theory); Discrete mathematics","score_opus":0.012280994312569297,"score_gpt":0.2268588607680209,"score_spread":0.2145778664554516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402145295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4076711,0.0011613999,0.45921996,0.0011652923,0.00026451962,0.00011559273,0.0008897758,0.00056249206,0.12894978],"genre_scores_gemma":[0.8427947,0.0009470522,0.13608928,0.0005294723,0.00013079164,0.00012644874,0.0011708562,0.00016972085,0.01804173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999385,0.00016968264,0.000026982707,0.00017658746,0.00013580074,0.00010592697],"domain_scores_gemma":[0.99882764,0.00042589556,0.00012680616,0.00029593913,0.0001748372,0.00014892068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004392507,0.00035582512,0.0003569276,0.0011361873,0.0019804358,0.0011380217,0.0006729413,0.0007207542,0.0053041535],"category_scores_gemma":[0.0012123476,0.00029452494,0.0006127254,0.0012846268,0.0012605218,0.0026550437,0.0016547202,0.0012382859,0.0006854041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009769418,0.000029517905,0.0011039511,0.00016720145,0.000018671293,0.000117133226,0.0004591487,0.0039768876,0.009031867,0.95065325,0.0044709747,0.02987374],"study_design_scores_gemma":[0.000023268687,0.00008102361,0.0014633862,0.00005042557,0.00005540384,0.0006754737,0.000468578,0.026299525,0.008565258,0.9337768,0.028507458,0.00003344632],"about_ca_topic_score_codex":0.0012558462,"about_ca_topic_score_gemma":0.0018000236,"teacher_disagreement_score":0.0053041535,"about_ca_system_score_codex":0.0010080439,"about_ca_system_score_gemma":0.00050919293,"threshold_uncertainty_score":0.017744184},"labels":[],"label_agreement":null},{"id":"W2402147337","doi":"","title":"On path partition dimension of trees.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Partition (number theory); Dimension (graph theory); Path (computing); Combinatorics; Computer science","score_opus":0.02052068491195951,"score_gpt":0.2346047891414768,"score_spread":0.2140841042295173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402147337","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44653556,0.013860981,0.32720327,0.019789474,0.0011315274,0.00018608785,0.0045248535,0.0009002184,0.185868],"genre_scores_gemma":[0.8937951,0.004621046,0.06972892,0.0018387282,0.0018932621,0.00031213084,0.002685943,0.0004914002,0.024633477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983463,0.0005353272,0.00007299412,0.00038601662,0.00031131224,0.00034807844],"domain_scores_gemma":[0.9861245,0.010089899,0.00082636345,0.001310981,0.0006427153,0.0010054886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022069844,0.0008188955,0.0015118143,0.0033380666,0.0025415837,0.0047591394,0.0021580944,0.0022336077,0.012351086],"category_scores_gemma":[0.01414257,0.0007740655,0.0009342743,0.003943644,0.0042908066,0.014100814,0.0035673417,0.0049718986,0.001587562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001120219,0.00007005066,0.001744434,0.00015088303,0.00002834673,0.00004756601,0.0003026181,0.005421253,0.00058443786,0.95903456,0.014060218,0.018443557],"study_design_scores_gemma":[0.000019014336,0.000014991241,0.0008068618,0.000045957924,0.000018438168,0.00009524865,0.00018584494,0.015694223,0.00037764088,0.97669274,0.0060320515,0.0000170285],"about_ca_topic_score_codex":0.0024223642,"about_ca_topic_score_gemma":0.0025926288,"teacher_disagreement_score":0.012351086,"about_ca_system_score_codex":0.003201949,"about_ca_system_score_gemma":0.001013739,"threshold_uncertainty_score":0.041318536},"labels":[],"label_agreement":null},{"id":"W2402262755","doi":"","title":"A note on the vertex-distinguishing proper total coloring of graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Complete coloring; Vertex (graph theory); Fractional coloring; Total coloring; Combinatorics; Brooks' theorem; Graph; Chordal graph; 1-planar graph; Line graph","score_opus":0.012864357432790243,"score_gpt":0.2248980611754479,"score_spread":0.21203370374265765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402262755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04683427,0.016093967,0.53558385,0.021575522,0.010333506,0.00013303112,0.0012904922,0.0013139774,0.36684135],"genre_scores_gemma":[0.5982067,0.016886005,0.3063573,0.009192594,0.0066805324,0.00022855884,0.0014516707,0.0009297384,0.06006695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987348,0.00038099688,0.000062712184,0.00033585264,0.00033181324,0.00015376601],"domain_scores_gemma":[0.99463034,0.003739289,0.00016208463,0.0008363314,0.00030461702,0.0003273213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018406275,0.0008712519,0.0009334801,0.0015108767,0.0022828595,0.0030238605,0.0021880006,0.0013743012,0.008490477],"category_scores_gemma":[0.006306163,0.00069189817,0.0011255383,0.002793553,0.004765836,0.007001803,0.0032262066,0.006126029,0.0012827506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006291794,0.00003739715,0.00048774402,0.00019696081,0.000018664465,0.00013233554,0.0001488378,0.002524681,0.00119332,0.94210666,0.029689195,0.023401357],"study_design_scores_gemma":[0.000011635865,0.000022829136,0.00040337708,0.000042190586,0.000021424054,0.00021287162,0.000087450695,0.005152771,0.00073768554,0.9549326,0.038356874,0.000018364048],"about_ca_topic_score_codex":0.0033488953,"about_ca_topic_score_gemma":0.006001544,"teacher_disagreement_score":0.008490477,"about_ca_system_score_codex":0.0019515705,"about_ca_system_score_gemma":0.0012811047,"threshold_uncertainty_score":0.028403461},"labels":[],"label_agreement":null},{"id":"W2402300817","doi":"","title":"Prime Cordial labeling of Flower Snark and related graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Prime (order theory); Combinatorics","score_opus":0.009004460781711654,"score_gpt":0.21751653374232935,"score_spread":0.2085120729606177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402300817","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4724268,0.00218525,0.19523732,0.0063800635,0.00058131793,0.00017323931,0.0020361652,0.0010706021,0.3199092],"genre_scores_gemma":[0.8970034,0.0009070676,0.054508284,0.0009559315,0.00030577133,0.00009534363,0.0013377749,0.00019443239,0.04469194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996306,0.00011142689,0.000016270344,0.00010095037,0.000061528495,0.000079211924],"domain_scores_gemma":[0.9984174,0.000776015,0.00019533485,0.0002850314,0.000118432974,0.00020778857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005006603,0.00037870122,0.0005401516,0.00082074315,0.0019882983,0.0018787035,0.0010299634,0.0012728203,0.014654721],"category_scores_gemma":[0.0027437236,0.00029076956,0.00049756933,0.0011983333,0.0015303013,0.0039588693,0.0015220135,0.0015331367,0.0011763934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008713224,0.00004240161,0.00045740098,0.00008601493,0.000005838142,0.00008001723,0.00015068302,0.0027936136,0.0008262408,0.9726658,0.00778697,0.015017903],"study_design_scores_gemma":[0.000021460479,0.000015507841,0.00036674293,0.000018457547,0.000011255919,0.0001551674,0.0001111622,0.010727068,0.0009319981,0.9767295,0.010901873,0.000009842552],"about_ca_topic_score_codex":0.0018735798,"about_ca_topic_score_gemma":0.0029787505,"teacher_disagreement_score":0.014654721,"about_ca_system_score_codex":0.00180397,"about_ca_system_score_gemma":0.00065284764,"threshold_uncertainty_score":0.04902494},"labels":[],"label_agreement":null},{"id":"W2402676548","doi":"","title":"On α-labelling of disconneted graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Labelling; Combinatorics; Chemistry","score_opus":0.02423523742204841,"score_gpt":0.23884651345714775,"score_spread":0.21461127603509933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402676548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26722467,0.002092249,0.5181155,0.00622416,0.000793224,0.00022690039,0.002888215,0.0015791272,0.20085597],"genre_scores_gemma":[0.7427903,0.0020203458,0.18933429,0.0020245707,0.0005589072,0.00034320072,0.00407851,0.000815907,0.058033973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804246,0.00070143,0.00011717405,0.00045282132,0.0003458511,0.00034022628],"domain_scores_gemma":[0.98957914,0.006205713,0.0009208434,0.0017434288,0.0006559285,0.0008950193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018190407,0.0007404386,0.0009248203,0.001974333,0.0029491181,0.004087798,0.0023347982,0.002254157,0.012035372],"category_scores_gemma":[0.009477321,0.0007922261,0.0010047565,0.002605432,0.0034771052,0.009031889,0.003989278,0.0035887668,0.0025119903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094809846,0.00006779056,0.00080468744,0.0001502335,0.000015167969,0.00009359184,0.0003337386,0.004565309,0.000970843,0.9614524,0.010058968,0.021392357],"study_design_scores_gemma":[0.000018500774,0.0000150264295,0.000308271,0.000051529587,0.000011285164,0.00016549333,0.00024769016,0.011683059,0.0008233812,0.97777975,0.0088802455,0.00001572823],"about_ca_topic_score_codex":0.001850721,"about_ca_topic_score_gemma":0.0023924217,"teacher_disagreement_score":0.012035372,"about_ca_system_score_codex":0.0022992415,"about_ca_system_score_gemma":0.00094616384,"threshold_uncertainty_score":0.04026234},"labels":[],"label_agreement":null},{"id":"W2402718296","doi":"","title":"Clique-chromatic Numbers of Line Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Clique number; Chromatic scale; Clique; Combinatorics; Line (geometry); Geometry","score_opus":0.023174400193032622,"score_gpt":0.25065197426240815,"score_spread":0.22747757406937552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402718296","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48553002,0.0033072082,0.17465669,0.009647864,0.0006426107,0.00021623656,0.006782855,0.0010632046,0.3181533],"genre_scores_gemma":[0.9334866,0.0010466438,0.034698453,0.0005577157,0.00036076823,0.0001918364,0.0022305606,0.00025007038,0.027177393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999099,0.00028037047,0.000032392527,0.00023112471,0.00018161282,0.00017548347],"domain_scores_gemma":[0.99294573,0.0047571724,0.00070021866,0.0005512706,0.0004648322,0.00058068323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010200216,0.00055123074,0.0005287588,0.0025467859,0.001995206,0.004139282,0.0015498401,0.0014607761,0.023903789],"category_scores_gemma":[0.008105526,0.0006144295,0.0005297354,0.0024661056,0.0023517946,0.0066462453,0.0013480085,0.0024432915,0.0019103696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001891841,0.00006776006,0.0019150105,0.0001658434,0.00002532221,0.00005216802,0.00025917232,0.0061280252,0.001869525,0.9502213,0.020573191,0.018533504],"study_design_scores_gemma":[0.00005589093,0.00002414046,0.0017827778,0.000054647528,0.00002650618,0.00016695404,0.00026727465,0.029422954,0.001759687,0.9527074,0.0137062995,0.000025296957],"about_ca_topic_score_codex":0.0027657934,"about_ca_topic_score_gemma":0.004228753,"teacher_disagreement_score":0.023903789,"about_ca_system_score_codex":0.002414656,"about_ca_system_score_gemma":0.00093811465,"threshold_uncertainty_score":0.07996613},"labels":[],"label_agreement":null},{"id":"W2402760489","doi":"","title":"Decomposition Of Complete Graphs And Complete Bipartite Graphs Into α-Labelled Trees.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Decomposition; Robertson–Seymour theorem; Cograph; Modular decomposition; 1-planar graph; Indifference graph; Pathwidth; Chordal graph; Discrete mathematics; Graph; Line graph; Chemistry","score_opus":0.014551926494112716,"score_gpt":0.24584319492605639,"score_spread":0.23129126843194367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402760489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15258418,0.0030156265,0.7170677,0.002355354,0.00024127404,0.00019985579,0.0035737911,0.00061937625,0.120342895],"genre_scores_gemma":[0.653976,0.0021679956,0.29629454,0.0008428945,0.00031850956,0.00030906,0.005533294,0.00042419587,0.04013349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999228,0.00025945643,0.00004729074,0.00017179601,0.00014668086,0.00014680892],"domain_scores_gemma":[0.99701655,0.001431604,0.00036883503,0.0005016611,0.00031048336,0.00037100856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009293052,0.00049958075,0.0006227476,0.0013606299,0.0011170385,0.003034084,0.0011259409,0.0009553172,0.008297121],"category_scores_gemma":[0.003737305,0.00055371755,0.00083234516,0.0016431271,0.0014845225,0.0047521587,0.0015396659,0.0020271074,0.0015857772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009091249,0.000048740345,0.00065379066,0.00013859101,0.000019297975,0.000046055513,0.00021605154,0.0044230246,0.0014052945,0.96170473,0.008222566,0.02303099],"study_design_scores_gemma":[0.000014050353,0.0000106619045,0.00042519715,0.000048516384,0.000015104279,0.00010122701,0.00015082867,0.013790546,0.00065386994,0.9748175,0.009963835,0.000008616334],"about_ca_topic_score_codex":0.0015629355,"about_ca_topic_score_gemma":0.0024935578,"teacher_disagreement_score":0.008297121,"about_ca_system_score_codex":0.0014821473,"about_ca_system_score_gemma":0.00080239016,"threshold_uncertainty_score":0.027756631},"labels":[],"label_agreement":null},{"id":"W2402800665","doi":"","title":"Edge-Coloring of Split Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Edge coloring; Enhanced Data Rates for GSM Evolution; Combinatorics; Graph coloring; Graph; Computer science; Artificial intelligence; Line graph","score_opus":0.027047543567736636,"score_gpt":0.24017174978544226,"score_spread":0.21312420621770561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402800665","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4107479,0.0033342966,0.40934637,0.0049415994,0.00064859533,0.00018317305,0.003112257,0.0010905958,0.16659531],"genre_scores_gemma":[0.86498386,0.0013276212,0.09671799,0.00076856755,0.00028310055,0.00015114975,0.0026115838,0.00035310132,0.032802936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929833,0.0002358438,0.00003236323,0.00014874568,0.00012286723,0.00016185535],"domain_scores_gemma":[0.99688065,0.001660958,0.00026784922,0.00056840206,0.00025131242,0.00037082762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080343604,0.00053310866,0.0006412013,0.0011194684,0.0013589659,0.0025131747,0.0013167765,0.0010445825,0.011341785],"category_scores_gemma":[0.004209285,0.0005012192,0.0005615403,0.0014975793,0.0015281666,0.004729161,0.0018220684,0.0019406409,0.0015470454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017984492,0.0000991018,0.001570689,0.0001832833,0.000032993365,0.0000966764,0.0002583479,0.011390465,0.0022842302,0.92832106,0.019557457,0.03602575],"study_design_scores_gemma":[0.000028910292,0.000018960287,0.0005833708,0.00003584474,0.000018205172,0.00014275801,0.00020812236,0.030161815,0.0012678866,0.9580092,0.009514571,0.000010471593],"about_ca_topic_score_codex":0.001593249,"about_ca_topic_score_gemma":0.002689553,"teacher_disagreement_score":0.011341785,"about_ca_system_score_codex":0.0014698915,"about_ca_system_score_gemma":0.0007602322,"threshold_uncertainty_score":0.037942052},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87244576,0.0003828951,0.06387164,0.0016509021,0.000075630276,0.00020270773,0.0026778851,0.00063206203,0.058060545],"genre_scores_gemma":[0.96993345,0.00017518173,0.01525074,0.00035358805,0.00007092517,0.00015081101,0.0029901888,0.00017462145,0.010900569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933416,0.00013172391,0.00003807606,0.00019941224,0.00015172552,0.0001447855],"domain_scores_gemma":[0.995552,0.0021755875,0.00079613354,0.00028774297,0.00048054336,0.0007080424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000618233,0.0010007623,0.00087471306,0.003863712,0.0022510847,0.003883713,0.0021603217,0.0013645575,0.010529136],"category_scores_gemma":[0.0036867422,0.0007191124,0.00069988956,0.0021620956,0.0022303911,0.0026014748,0.001571927,0.0019246836,0.0010634692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018275727,0.000333631,0.01275939,0.00057339796,0.000093263145,0.00086363335,0.0019914343,0.03532174,0.032788698,0.86851114,0.016603466,0.028332625],"study_design_scores_gemma":[0.0001852518,0.0002459795,0.011066101,0.00010825684,0.00009652623,0.0012199435,0.0016878753,0.14725672,0.01665114,0.8034562,0.017902419,0.0001236201],"about_ca_topic_score_codex":0.0026638287,"about_ca_topic_score_gemma":0.003116436,"teacher_disagreement_score":0.010529136,"about_ca_system_score_codex":0.0026109696,"about_ca_system_score_gemma":0.0012169362,"threshold_uncertainty_score":0.035223424},"labels":[],"label_agreement":null},{"id":"W2402921037","doi":"","title":"On the number of genus embeddings of complete tripartite graph K n, n, l .","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Genus; Combinatorics; Graph; Zoology; Biology","score_opus":0.021815839223283128,"score_gpt":0.2515426423579493,"score_spread":0.2297268031346662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402921037","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85437095,0.0032311615,0.053616136,0.009492425,0.0006106277,0.00010961846,0.0040368475,0.0006769902,0.07385526],"genre_scores_gemma":[0.9639585,0.0010801738,0.020663908,0.0006047204,0.0004678926,0.00021068964,0.002439395,0.00027067206,0.010304004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978466,0.0006926605,0.00012400813,0.0005539094,0.00039546104,0.00038729986],"domain_scores_gemma":[0.9790426,0.014574389,0.0020886147,0.0015349564,0.0008476078,0.0019118441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018398084,0.0010020866,0.0013815443,0.002864518,0.0026977935,0.006719899,0.0030194174,0.0025582267,0.012798757],"category_scores_gemma":[0.01971276,0.0008978769,0.00086335116,0.0022382725,0.003733726,0.008983492,0.0031240124,0.0024703331,0.001312942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019202547,0.00033271915,0.020643566,0.0011203813,0.00025551682,0.00041942357,0.0016081148,0.04093507,0.008163846,0.7988879,0.053271808,0.07244144],"study_design_scores_gemma":[0.00018804314,0.00019033812,0.008062272,0.00020395446,0.0001909104,0.0009475569,0.0011319232,0.107581645,0.0037675041,0.86370397,0.013931519,0.00010034362],"about_ca_topic_score_codex":0.0012327642,"about_ca_topic_score_gemma":0.0018469178,"teacher_disagreement_score":0.012798757,"about_ca_system_score_codex":0.0027055435,"about_ca_system_score_gemma":0.0010959613,"threshold_uncertainty_score":0.042816103},"labels":[],"label_agreement":null},{"id":"W2403022016","doi":"","title":"On Vertex-Distinguishing Proper Edge Colorings of Graphs Satisfying the Ore Condition","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vertex (graph theory); Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Graph; Computer science; Artificial intelligence","score_opus":0.011678092786222928,"score_gpt":0.23147951133755115,"score_spread":0.21980141855132823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403022016","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76445156,0.00083492784,0.1716171,0.0031599433,0.00023161592,0.00010910451,0.0013969527,0.00064240705,0.05755638],"genre_scores_gemma":[0.9478782,0.0005986801,0.039419737,0.00076649105,0.00026217016,0.00012050509,0.0016961445,0.000288112,0.008970008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780315,0.00078529026,0.0001363229,0.0004602258,0.000290361,0.0005247029],"domain_scores_gemma":[0.9795116,0.015128912,0.0016963473,0.001774963,0.0006202451,0.0012678207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027092244,0.0012573836,0.0017890239,0.0019337116,0.0025789384,0.004707157,0.0023406234,0.0024860268,0.008031478],"category_scores_gemma":[0.012186806,0.0013770597,0.0015062619,0.0026609378,0.0038936406,0.009068105,0.0041012536,0.0040864064,0.0006745668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008265958,0.00023297094,0.0038845844,0.00026596375,0.000057949088,0.00020738081,0.00063817203,0.019249914,0.004039409,0.94542897,0.0072273137,0.017940855],"study_design_scores_gemma":[0.000095754316,0.000045454137,0.0009640447,0.000034204797,0.00003515024,0.00013996041,0.00023558695,0.034495886,0.0010193865,0.9612957,0.0016109622,0.000027863465],"about_ca_topic_score_codex":0.0016228603,"about_ca_topic_score_gemma":0.0027544128,"teacher_disagreement_score":0.008031478,"about_ca_system_score_codex":0.002260228,"about_ca_system_score_gemma":0.0013085939,"threshold_uncertainty_score":0.026867986},"labels":[],"label_agreement":null},{"id":"W2403071270","doi":"","title":"L(2,1)-labeling of a circular graph","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.02461642617630742,"score_gpt":0.23714212371680482,"score_spread":0.2125256975404974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403071270","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5976464,0.0005165767,0.27632785,0.006376089,0.0003583847,0.00019760236,0.0038942439,0.0014957396,0.11318718],"genre_scores_gemma":[0.7801593,0.00037150088,0.17629774,0.0014198096,0.0002057332,0.00025817676,0.0033902582,0.00062186574,0.03727554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989537,0.0003285914,0.0000640417,0.0002788687,0.00013155161,0.00024318004],"domain_scores_gemma":[0.995673,0.0020182182,0.00054359634,0.0008614718,0.00035364935,0.00054998574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081295555,0.0006267029,0.00085992465,0.0012708779,0.002954746,0.00394337,0.001794054,0.0023535497,0.013393171],"category_scores_gemma":[0.0033503599,0.00073636294,0.0008819414,0.0017932677,0.0019751056,0.0040049143,0.0020313738,0.0023564794,0.0019259469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043447377,0.00016377303,0.0019012276,0.00028116914,0.00003152149,0.00020265608,0.0006649068,0.008234,0.008585275,0.93119854,0.018739821,0.029562585],"study_design_scores_gemma":[0.00008591821,0.000051105504,0.001265327,0.00005677217,0.00004724296,0.00031484125,0.00046959284,0.036724966,0.005630368,0.93957096,0.015742498,0.00004037877],"about_ca_topic_score_codex":0.0025566127,"about_ca_topic_score_gemma":0.0033735698,"teacher_disagreement_score":0.013393171,"about_ca_system_score_codex":0.0019466191,"about_ca_system_score_gemma":0.0011977741,"threshold_uncertainty_score":0.044804573},"labels":[],"label_agreement":null},{"id":"W2403114573","doi":"","title":"Chromatic Uniqueness of Certain Complete 4-partite Graphs.","year":2009,"lang":"fr","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Uniqueness; Combinatorics; Mathematical analysis","score_opus":0.02756299012734584,"score_gpt":0.25064975260103495,"score_spread":0.2230867624736891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403114573","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86162615,0.000622284,0.0459936,0.0014976414,0.00009899999,0.000066473505,0.0012804559,0.00018542577,0.08862884],"genre_scores_gemma":[0.96886873,0.00033541705,0.016641889,0.00024367527,0.000070994,0.000059215356,0.0011048003,0.00010194271,0.012573306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995815,0.000110094654,0.000017856437,0.000117249474,0.000068474095,0.00010471067],"domain_scores_gemma":[0.9978695,0.001175877,0.00030030656,0.00022794212,0.00017799363,0.00024836647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005350574,0.000368912,0.00050287734,0.0013751712,0.0025945997,0.0029774029,0.00096558157,0.00132705,0.010627664],"category_scores_gemma":[0.0029611136,0.0007637139,0.0006822109,0.001319761,0.001721182,0.002671457,0.001220103,0.0015098649,0.000778669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021800553,0.0000481583,0.003272506,0.00013154195,0.00003280486,0.00022702783,0.00056970486,0.0066375737,0.005540778,0.9676117,0.0066987653,0.009011452],"study_design_scores_gemma":[0.00008186087,0.00005421396,0.005751037,0.000056928668,0.00006305739,0.00072924444,0.0010917276,0.029187309,0.0057813805,0.9445216,0.012630195,0.000051496478],"about_ca_topic_score_codex":0.001904905,"about_ca_topic_score_gemma":0.0032196443,"teacher_disagreement_score":0.010627664,"about_ca_system_score_codex":0.001290289,"about_ca_system_score_gemma":0.00059863535,"threshold_uncertainty_score":0.035553038},"labels":[],"label_agreement":null},{"id":"W2403141327","doi":"","title":"On Star Chromatic Number of Sunlet Graph Families.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Star (game theory); Combinatorics; Graph; Mathematical analysis","score_opus":0.017007569895743056,"score_gpt":0.2448576919815253,"score_spread":0.22785012208578223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403141327","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7414654,0.0030587004,0.09868876,0.0063479403,0.00042946675,0.00010103342,0.0026306398,0.0004828261,0.14679526],"genre_scores_gemma":[0.96249855,0.0013130973,0.020557247,0.00045340718,0.0003153645,0.00010534022,0.0011047054,0.00017675049,0.013475547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991229,0.00027878725,0.000030014557,0.00022916606,0.00015653827,0.00018261287],"domain_scores_gemma":[0.9935899,0.0041508786,0.00064512854,0.0005015482,0.00041104748,0.00070156483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013859584,0.00054543593,0.0008133096,0.00306785,0.0024902227,0.0029993595,0.0017288892,0.0013000891,0.014472602],"category_scores_gemma":[0.00758582,0.0005337496,0.000593913,0.0027753066,0.002711343,0.0068195607,0.0018402928,0.0020896967,0.0011502572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002756903,0.00009400694,0.0039719,0.0001975668,0.00003722778,0.00008076776,0.00041290297,0.014615665,0.0019588105,0.9384303,0.018937973,0.02098717],"study_design_scores_gemma":[0.00004780671,0.00003884083,0.002508305,0.000066187335,0.00002960939,0.00020124632,0.00041427749,0.05286487,0.0013240061,0.93358886,0.008882399,0.00003361634],"about_ca_topic_score_codex":0.0028905512,"about_ca_topic_score_gemma":0.00365636,"teacher_disagreement_score":0.014472602,"about_ca_system_score_codex":0.002952453,"about_ca_system_score_gemma":0.0009205075,"threshold_uncertainty_score":0.04841566},"labels":[],"label_agreement":null},{"id":"W2403235839","doi":"","title":"Bounds on Hosoya Index Involving Some Other Topological Indices.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Topological index; Topology (electrical circuits); Combinatorics; Statistics; Computer science","score_opus":0.014040801529501117,"score_gpt":0.2270899867526192,"score_spread":0.21304918522311808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403235839","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19958082,0.010577282,0.3415089,0.009147551,0.0015792918,0.00015660006,0.0026111412,0.0015549946,0.43328348],"genre_scores_gemma":[0.8698051,0.0038722714,0.083068006,0.0011941714,0.0014493555,0.00034785396,0.0016500575,0.00078433024,0.037828874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810874,0.00040509072,0.00009657794,0.00037494113,0.0005252892,0.0004892948],"domain_scores_gemma":[0.98547167,0.009829678,0.0008200852,0.001647559,0.00097320165,0.0012578388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028839302,0.0013776027,0.0016064177,0.0049915663,0.0030389067,0.005688137,0.0035588343,0.0023135417,0.017398018],"category_scores_gemma":[0.015611755,0.00056471885,0.001059957,0.00397233,0.0034837786,0.014018104,0.0044806465,0.005863309,0.0028564865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021155222,0.0000933151,0.0012329111,0.00022029484,0.000036998583,0.00010644851,0.00025082447,0.0045476696,0.0019311669,0.95864415,0.012909491,0.019815182],"study_design_scores_gemma":[0.000022852615,0.000026387215,0.000732957,0.000070708586,0.000049404458,0.00016804445,0.00012275767,0.022778567,0.0019217422,0.9648032,0.009266505,0.00003688892],"about_ca_topic_score_codex":0.0017639349,"about_ca_topic_score_gemma":0.003040226,"teacher_disagreement_score":0.017398018,"about_ca_system_score_codex":0.0033502516,"about_ca_system_score_gemma":0.0015983141,"threshold_uncertainty_score":0.058202207},"labels":[],"label_agreement":null},{"id":"W2403588483","doi":"","title":"λ'-optimal regular graphs with two orbits.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.015965427051903538,"score_gpt":0.2299600730696368,"score_spread":0.21399464601773327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403588483","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.606055,0.0009795387,0.14417316,0.0058928183,0.000384695,0.00013443813,0.004109111,0.0016588651,0.2366124],"genre_scores_gemma":[0.88380784,0.00044668416,0.07744468,0.00081028184,0.000108616834,0.00011393948,0.0021516914,0.00031792524,0.034798373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952185,0.000111829075,0.00002381294,0.00012506216,0.000079562145,0.00013790044],"domain_scores_gemma":[0.99789435,0.0010711893,0.0002649044,0.0003222394,0.00015122573,0.0002961706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051512744,0.0004313138,0.00045720916,0.0007790453,0.001389026,0.0022879776,0.0010796192,0.0011180014,0.013307632],"category_scores_gemma":[0.0029565503,0.00048526845,0.0005154718,0.0008256237,0.0012750438,0.0032050416,0.0013485824,0.0014041228,0.0015291236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035300647,0.00012635614,0.0013032635,0.00019877094,0.000028357117,0.00012833165,0.00021658743,0.0066484157,0.004213995,0.9384729,0.021569503,0.026740493],"study_design_scores_gemma":[0.000064491105,0.000029711506,0.0009838133,0.000050886,0.000023449486,0.00020192824,0.00030524467,0.017443564,0.002469102,0.96597844,0.012432533,0.000016756947],"about_ca_topic_score_codex":0.0014367214,"about_ca_topic_score_gemma":0.0022131326,"teacher_disagreement_score":0.013307632,"about_ca_system_score_codex":0.0014257642,"about_ca_system_score_gemma":0.0008070559,"threshold_uncertainty_score":0.04451847},"labels":[],"label_agreement":null},{"id":"W2403732233","doi":"","title":"Some new classes of upper embeddable graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.009877066417694036,"score_gpt":0.23151536188302987,"score_spread":0.22163829546533584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403732233","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26948658,0.003971166,0.31751433,0.0061223637,0.00078064256,0.00022355016,0.003410159,0.002114879,0.39637637],"genre_scores_gemma":[0.7910869,0.0026598412,0.11102529,0.0024654057,0.00092303474,0.00031175796,0.004558957,0.00080139906,0.086167455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907184,0.00016893753,0.000049544873,0.00026994906,0.00022173725,0.00021790183],"domain_scores_gemma":[0.9967667,0.0016456884,0.0003357004,0.0006096247,0.00020224226,0.00044008874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072326395,0.0006842783,0.0005882762,0.0023438458,0.0016207033,0.0048935073,0.0014748493,0.0013911532,0.019526418],"category_scores_gemma":[0.0040056333,0.0006161859,0.0008441878,0.00207469,0.0021084724,0.007014791,0.0026553897,0.0038066888,0.0019049965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004982809,0.00005461638,0.0005753544,0.000083407846,0.000007925282,0.0001410362,0.00025385158,0.0011609748,0.0010081629,0.9648492,0.009947615,0.021868112],"study_design_scores_gemma":[0.000020995361,0.000019039642,0.00076308154,0.00004902946,0.000014528174,0.0004277235,0.00023366744,0.006796908,0.0009950016,0.95848674,0.032177553,0.00001576465],"about_ca_topic_score_codex":0.00093354104,"about_ca_topic_score_gemma":0.0016884683,"teacher_disagreement_score":0.019526418,"about_ca_system_score_codex":0.001598419,"about_ca_system_score_gemma":0.00039839666,"threshold_uncertainty_score":0.0653224},"labels":[],"label_agreement":null},{"id":"W2403793505","doi":"","title":"A note on the neighbor condition for up-embeddability of graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.012931381662010528,"score_gpt":0.2580098579800494,"score_spread":0.24507847631803886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403793505","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14984192,0.0074950615,0.3627988,0.016401121,0.0051064347,0.00015631808,0.0017754798,0.0012947298,0.45513013],"genre_scores_gemma":[0.8480582,0.0054047513,0.097415715,0.004769449,0.0032691031,0.00025846274,0.0016590314,0.0005995877,0.03856568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858415,0.00035014586,0.00008314235,0.00039713635,0.00038234977,0.0002031483],"domain_scores_gemma":[0.9917617,0.0059205424,0.000271382,0.0010338502,0.00044433784,0.0005683005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014129215,0.00059214217,0.001179225,0.0013607932,0.0022258656,0.0030081116,0.0021651778,0.002563686,0.017015558],"category_scores_gemma":[0.011170049,0.00059594156,0.0010792244,0.0016472364,0.0033745642,0.0100935735,0.0036578998,0.0055887112,0.0021449723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102943224,0.000049228296,0.00081183366,0.00017145174,0.000012677573,0.00022120214,0.00022035635,0.0012275297,0.0024131371,0.96465087,0.01259006,0.017528668],"study_design_scores_gemma":[0.000025405892,0.000045438643,0.0008794549,0.00004541443,0.000026843338,0.0003185803,0.00020573015,0.0065409844,0.0021134422,0.9699146,0.019855522,0.000028657274],"about_ca_topic_score_codex":0.0019471741,"about_ca_topic_score_gemma":0.002296987,"teacher_disagreement_score":0.017015558,"about_ca_system_score_codex":0.0011180488,"about_ca_system_score_gemma":0.00054844975,"threshold_uncertainty_score":0.056922674},"labels":[],"label_agreement":null},{"id":"W2403933701","doi":"","title":"Bordered magic squares: elements for a comprehensive approach","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Magic square; Mathematics; MAGIC (telescope); Geometry; Astrophysics; Physics","score_opus":0.05130015768727548,"score_gpt":0.25867670121241937,"score_spread":0.2073765435251439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403933701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008343627,0.008576307,0.8374519,0.009397727,0.0011931843,0.0000959237,0.0003016438,0.00054190616,0.13409775],"genre_scores_gemma":[0.2261108,0.011965624,0.6974477,0.004247031,0.002169439,0.0003901387,0.0008551482,0.0006684918,0.056145646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998555,0.00050337473,0.000102937825,0.00028794233,0.0004221139,0.00012861843],"domain_scores_gemma":[0.9976172,0.0008943626,0.00010200016,0.0007802097,0.00041826803,0.0001879641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001993071,0.00093463884,0.0015386137,0.002654651,0.0030815275,0.0058177556,0.0035479984,0.002765792,0.013061284],"category_scores_gemma":[0.004183962,0.0008566913,0.0011439458,0.0035717543,0.0063805073,0.012963881,0.0053229243,0.0075968946,0.0027225967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004498018,0.000008906934,0.000038222213,0.000038167214,0.0000032559196,0.000012742786,0.00006257808,0.0006629097,0.00010569457,0.987981,0.0032687865,0.0078132395],"study_design_scores_gemma":[0.0000024003318,0.0000034452423,0.00002000106,0.000021198932,0.0000031715854,0.00002849406,0.00004671134,0.0018320463,0.00009118838,0.97929823,0.018647801,0.000005251168],"about_ca_topic_score_codex":0.0010663585,"about_ca_topic_score_gemma":0.0023128332,"teacher_disagreement_score":0.013061284,"about_ca_system_score_codex":0.001727712,"about_ca_system_score_gemma":0.0011956885,"threshold_uncertainty_score":0.043694377},"labels":[],"label_agreement":null},{"id":"W2403942000","doi":"","title":"L(j, k)-labelings of Cartesian products of three complete graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cartesian product; Combinatorics; Discrete mathematics","score_opus":0.03628478527906736,"score_gpt":0.23163073248893587,"score_spread":0.1953459472098685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403942000","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5490472,0.00071451144,0.26734307,0.0023503848,0.00038659287,0.00015977258,0.0028044733,0.001367792,0.17582616],"genre_scores_gemma":[0.849706,0.00027115698,0.11961061,0.0005020894,0.00008059581,0.00015624236,0.0022506807,0.0004033463,0.027019259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999035,0.00029318104,0.00007016831,0.00024606308,0.0001460039,0.00020963396],"domain_scores_gemma":[0.9967535,0.0012868457,0.0005056508,0.0005462807,0.0004002721,0.00050729595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008092163,0.000424394,0.0004989397,0.0011733052,0.0022288924,0.0033761694,0.0010330948,0.0012509724,0.013375402],"category_scores_gemma":[0.002846041,0.0006898413,0.001043067,0.0013465853,0.0023692474,0.0033503931,0.002031165,0.001833388,0.0020549519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023118663,0.0000637533,0.0013786608,0.00014040778,0.000023444363,0.00027312626,0.00082509447,0.002101971,0.003870647,0.96611464,0.00717127,0.01780569],"study_design_scores_gemma":[0.000046485173,0.00004114142,0.0014569334,0.00006068073,0.000033788154,0.00047382148,0.00062046346,0.0067808265,0.0040241135,0.9629207,0.023501309,0.00003972297],"about_ca_topic_score_codex":0.0019930692,"about_ca_topic_score_gemma":0.0027783145,"teacher_disagreement_score":0.013375402,"about_ca_system_score_codex":0.0014320087,"about_ca_system_score_gemma":0.0007407191,"threshold_uncertainty_score":0.044745147},"labels":[],"label_agreement":null},{"id":"W2404004722","doi":"","title":"On Graceful And Cordial Labeling Of Shell Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Shell (structure); Combinatorics; Composite material; Materials science","score_opus":0.008118015804574432,"score_gpt":0.20633631412307196,"score_spread":0.19821829831849752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404004722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34025395,0.0023370367,0.3735483,0.006382407,0.0006106676,0.00015982684,0.0013194049,0.0018925738,0.27349594],"genre_scores_gemma":[0.8548269,0.0016197346,0.07997425,0.0012649754,0.0004905405,0.00016970486,0.0014265426,0.0006587186,0.05956859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911064,0.00026692616,0.00004729917,0.00019442843,0.00017861674,0.00020202844],"domain_scores_gemma":[0.9958423,0.002034875,0.00042505533,0.0009263578,0.0002680407,0.00050329434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010886763,0.00066506816,0.00067235157,0.0014166058,0.0024410426,0.0027032606,0.0013997329,0.0014264584,0.011944525],"category_scores_gemma":[0.0062044226,0.000505026,0.0007742167,0.0016354222,0.0035622534,0.0072352295,0.0032351464,0.0027472863,0.0016292257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049511513,0.000032198008,0.0003557439,0.00005456961,0.0000053338945,0.00004506566,0.00021945254,0.0024657424,0.0005926369,0.9790875,0.0052489545,0.01184332],"study_design_scores_gemma":[0.000008814923,0.0000072334974,0.0001836178,0.000018347242,0.00000544984,0.00005553771,0.00009431997,0.0068125804,0.00042928517,0.98744744,0.0049286205,0.000008783814],"about_ca_topic_score_codex":0.0033167277,"about_ca_topic_score_gemma":0.005029447,"teacher_disagreement_score":0.011944525,"about_ca_system_score_codex":0.002251438,"about_ca_system_score_gemma":0.0009574221,"threshold_uncertainty_score":0.039958417},"labels":[],"label_agreement":null},{"id":"W2404038546","doi":"","title":"On The Complexity Of Unique List Colourability And The Fixing Number Of Graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.018726383164453072,"score_gpt":0.24433112981344127,"score_spread":0.2256047466489882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404038546","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6155777,0.0071472465,0.17882268,0.021476839,0.00091511663,0.00027236165,0.0052229846,0.0013570088,0.16920803],"genre_scores_gemma":[0.9499438,0.0027165334,0.030958882,0.0008290503,0.0007520813,0.00024269159,0.0022393956,0.0004605139,0.011856999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960217,0.001373462,0.00018297463,0.00079994154,0.0007518143,0.00087008905],"domain_scores_gemma":[0.9418017,0.049738698,0.0025165859,0.0033696683,0.00095952005,0.0016138699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039586434,0.0011431909,0.0019981365,0.0026326254,0.0031150146,0.0074305744,0.0046823067,0.0038693156,0.022280648],"category_scores_gemma":[0.037502345,0.001346084,0.0020473932,0.004582615,0.0064622555,0.017740188,0.0044324454,0.005950502,0.001573894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053749915,0.0001967877,0.0042101275,0.00043815965,0.00009906815,0.00018096284,0.00050690444,0.041420855,0.0014444427,0.8962414,0.02283548,0.03188829],"study_design_scores_gemma":[0.00007190934,0.000026268559,0.0011138837,0.00005127502,0.00005574089,0.00019643336,0.00019118522,0.04402647,0.00071247405,0.9503484,0.003166367,0.00003961762],"about_ca_topic_score_codex":0.0044200253,"about_ca_topic_score_gemma":0.004046134,"teacher_disagreement_score":0.022280648,"about_ca_system_score_codex":0.004766277,"about_ca_system_score_gemma":0.0023824729,"threshold_uncertainty_score":0.074536264},"labels":[],"label_agreement":null},{"id":"W2404131809","doi":"","title":"Multi-level distance labelings for helm graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.03730367357894914,"score_gpt":0.264582921999417,"score_spread":0.22727924842046787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404131809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.119175866,0.0012280724,0.7497338,0.002990371,0.00039120569,0.00015595212,0.0018320035,0.0015674484,0.12292528],"genre_scores_gemma":[0.58446586,0.00095676066,0.3511009,0.0010660648,0.00035533126,0.00026957953,0.0026069148,0.0007795337,0.05839908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860257,0.00040059647,0.000087805296,0.000335683,0.00032818876,0.00024510332],"domain_scores_gemma":[0.9954334,0.0022285688,0.00040058422,0.0011102789,0.00041804797,0.00040907526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011514188,0.00053020474,0.0007423282,0.0020522685,0.0024134342,0.0029538865,0.002177502,0.0017449851,0.018618595],"category_scores_gemma":[0.0069393157,0.00063815055,0.00086807203,0.0023537625,0.001828883,0.007228615,0.003898615,0.0031068497,0.0037237636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006283422,0.000061979816,0.0005737017,0.00014796383,0.000013464676,0.000053041756,0.00021122662,0.0040268525,0.0013459733,0.9403111,0.010219213,0.04297273],"study_design_scores_gemma":[0.000014775277,0.000018224095,0.00031315873,0.000051039624,0.000015456224,0.00014002292,0.000214584,0.02205588,0.0016813419,0.9595676,0.015907032,0.000020850575],"about_ca_topic_score_codex":0.0014483305,"about_ca_topic_score_gemma":0.002844516,"teacher_disagreement_score":0.018618595,"about_ca_system_score_codex":0.0019736108,"about_ca_system_score_gemma":0.0008814785,"threshold_uncertainty_score":0.062285364},"labels":[],"label_agreement":null},{"id":"W2404163602","doi":"","title":"A Study On Stable, Positive And Negative Edges With Respect To Irregularity Strength Of A Graph.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.01733608514684852,"score_gpt":0.24828316501515454,"score_spread":0.23094707986830604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404163602","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87963164,0.0016893933,0.07871067,0.0012146505,0.0001337275,0.000056353238,0.00043336366,0.0001559564,0.03797429],"genre_scores_gemma":[0.98530316,0.0004392477,0.010133901,0.000103677245,0.000090946174,0.000025177333,0.00018654857,0.00006629486,0.0036510334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909604,0.00035585405,0.00004605513,0.00021699734,0.00015767707,0.00012733351],"domain_scores_gemma":[0.98435163,0.010284525,0.0018934058,0.0012111564,0.001006389,0.0012528871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016195987,0.00039677182,0.0005775503,0.0024075669,0.0012595406,0.0025987283,0.0009381326,0.00088786415,0.0044293264],"category_scores_gemma":[0.0130658895,0.00037119893,0.00050638197,0.0020372295,0.0022113884,0.0034484628,0.0010864395,0.0013080261,0.00031426564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002828986,0.000106897714,0.015662193,0.00015634455,0.00004236344,0.00024603444,0.00044165677,0.017831603,0.008573666,0.92456186,0.0028671918,0.029227337],"study_design_scores_gemma":[0.000046506506,0.00025695766,0.015038816,0.000118445896,0.00012927002,0.0013428471,0.0011270278,0.18757614,0.005968736,0.78014964,0.008168762,0.000076819575],"about_ca_topic_score_codex":0.0010647497,"about_ca_topic_score_gemma":0.0010033333,"teacher_disagreement_score":0.0044293264,"about_ca_system_score_codex":0.0011255302,"about_ca_system_score_gemma":0.00041181254,"threshold_uncertainty_score":0.0148175955},"labels":[],"label_agreement":null},{"id":"W2404354977","doi":"","title":"On Constructions which yield Fully Magic Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; MAGIC (telescope); Yield (engineering); Combinatorics; Composite material; Materials science; Astronomy; Physics","score_opus":0.015235640461991422,"score_gpt":0.22582591326209314,"score_spread":0.21059027280010173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404354977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19578382,0.0030159352,0.4449496,0.0073734075,0.0006350031,0.0002491991,0.0019917646,0.0023465862,0.3436546],"genre_scores_gemma":[0.7608893,0.0026567532,0.18726167,0.0022841962,0.00033364983,0.00040615228,0.0025366056,0.0011967139,0.042435024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808085,0.0006990452,0.000105337924,0.0003312363,0.00038814073,0.00039549236],"domain_scores_gemma":[0.99179345,0.005526324,0.000532389,0.0013900326,0.0003691436,0.00038863544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018332351,0.0007961326,0.00067566027,0.0019399743,0.00270191,0.0034506675,0.001546873,0.0020007885,0.013996222],"category_scores_gemma":[0.008591864,0.0009917174,0.0011084055,0.0025892807,0.0038823867,0.010825799,0.0058040097,0.0038321158,0.0027119662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005622639,0.000039852308,0.00030360065,0.000108430584,0.000009569462,0.000060983482,0.0002478318,0.001852096,0.0009968285,0.9741399,0.007908798,0.014275881],"study_design_scores_gemma":[0.000014511444,0.000008126562,0.00011315107,0.000041703035,0.0000092224345,0.00007702969,0.0001152186,0.0035560485,0.0007597915,0.9893461,0.0059469123,0.000012269829],"about_ca_topic_score_codex":0.001047199,"about_ca_topic_score_gemma":0.0025220287,"teacher_disagreement_score":0.013996222,"about_ca_system_score_codex":0.0018873097,"about_ca_system_score_gemma":0.00091291725,"threshold_uncertainty_score":0.04682201},"labels":[],"label_agreement":null},{"id":"W2404360708","doi":"","title":"Gracefulness Of A Cycle With Parallel Chords And Parallel P k -Chords Of Different Lengths.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.009770357163489231,"score_gpt":0.21984016642465065,"score_spread":0.21006980926116142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404360708","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70152986,0.00087322894,0.15059616,0.0025913331,0.00034307444,0.00022221377,0.0026010673,0.00082854077,0.1404146],"genre_scores_gemma":[0.94687116,0.0003511735,0.028379995,0.00037584503,0.00015216012,0.00010385883,0.0013577724,0.00022637937,0.022181595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993382,0.000121172714,0.000049831535,0.00019787536,0.00011024245,0.00018278675],"domain_scores_gemma":[0.9972746,0.0010609959,0.00037958997,0.00062526116,0.00020061349,0.00045906656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048681817,0.00043326415,0.0005016508,0.0010322222,0.0024496734,0.0027959424,0.0011913622,0.001093842,0.013037304],"category_scores_gemma":[0.0033517964,0.00060930464,0.0009850134,0.0012490377,0.0020431867,0.003713948,0.0025932242,0.001594224,0.0013674814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059395045,0.00006912437,0.0017149547,0.00015603169,0.000033217297,0.00036309435,0.0007289937,0.005549648,0.008232164,0.95341724,0.007478566,0.021663101],"study_design_scores_gemma":[0.00008460573,0.000072400035,0.0012799951,0.000042317974,0.0000466596,0.000518718,0.00045035675,0.01222572,0.0041234093,0.9666473,0.014462344,0.000046282057],"about_ca_topic_score_codex":0.0039978335,"about_ca_topic_score_gemma":0.0037392303,"teacher_disagreement_score":0.013037304,"about_ca_system_score_codex":0.0011340302,"about_ca_system_score_gemma":0.00091209554,"threshold_uncertainty_score":0.04361409},"labels":[],"label_agreement":null},{"id":"W2404415034","doi":"","title":"The Singular Chromatic Number of a Graph.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Graph; Combinatorics; Discrete mathematics","score_opus":0.016086258748206995,"score_gpt":0.24622616486728965,"score_spread":0.23013990611908267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404415034","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.645171,0.002652062,0.11023572,0.00882611,0.00077039754,0.0000975022,0.0035711299,0.0006419958,0.2280341],"genre_scores_gemma":[0.9632135,0.0009444443,0.017899735,0.00033110444,0.00030839347,0.00006105193,0.00085097324,0.00015565034,0.016235068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992619,0.00015699634,0.000032411466,0.00025916504,0.00014540323,0.00014407659],"domain_scores_gemma":[0.9965065,0.0018193999,0.00041478037,0.0004333508,0.0002790877,0.0005468344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007299995,0.00054855243,0.00059387286,0.0028568276,0.002242503,0.0036815037,0.0012193606,0.0014438191,0.013890911],"category_scores_gemma":[0.005239438,0.00040157902,0.0005293889,0.0023169683,0.004328295,0.004838627,0.0017607026,0.0020998968,0.001435038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014571627,0.000031583695,0.001896592,0.00013230357,0.000025862544,0.000069211565,0.00030021957,0.0048992606,0.0024827416,0.964593,0.010268904,0.01515459],"study_design_scores_gemma":[0.000019374402,0.000017462264,0.0010553167,0.000042064177,0.000024562367,0.0001887517,0.00024256547,0.014448121,0.0015611316,0.97362536,0.008754128,0.000021197115],"about_ca_topic_score_codex":0.0027109578,"about_ca_topic_score_gemma":0.0032033387,"teacher_disagreement_score":0.013890911,"about_ca_system_score_codex":0.0024266855,"about_ca_system_score_gemma":0.0009835997,"threshold_uncertainty_score":0.046469748},"labels":[],"label_agreement":null},{"id":"W2404506644","doi":"","title":"On the Four Color Ramsey Numbers for Hexagons.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.018429798323042347,"score_gpt":0.22322380530119287,"score_spread":0.20479400697815053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404506644","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30021656,0.0067869597,0.17217019,0.012603043,0.0017838955,0.00016203156,0.001645978,0.0007456946,0.50388575],"genre_scores_gemma":[0.8762968,0.0031499916,0.068369955,0.0020263733,0.00064886047,0.00025554333,0.0008654018,0.00028289523,0.048104115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991934,0.0002994418,0.000038761606,0.00013788287,0.00015858389,0.00017201761],"domain_scores_gemma":[0.9970811,0.0017849241,0.00025817164,0.00028993073,0.0002465042,0.0003392806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012532133,0.0006372122,0.00074117846,0.0017892239,0.00232362,0.0034942913,0.0014288689,0.0014065077,0.01809035],"category_scores_gemma":[0.005704863,0.0005112849,0.00058683753,0.0015716772,0.003168145,0.007900845,0.0026395456,0.002966169,0.0025914586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011068817,0.000029528428,0.0002862983,0.00009440648,0.000008825869,0.00003800351,0.00015197476,0.0029280942,0.0005245352,0.9669138,0.01276152,0.01615237],"study_design_scores_gemma":[0.00002196845,0.000012689603,0.00023001592,0.000043087966,0.00000775836,0.0000746573,0.00017608474,0.0060024937,0.0003903674,0.98373,0.0092945825,0.000016342374],"about_ca_topic_score_codex":0.0019293809,"about_ca_topic_score_gemma":0.0026092774,"teacher_disagreement_score":0.01809035,"about_ca_system_score_codex":0.002023736,"about_ca_system_score_gemma":0.0009981447,"threshold_uncertainty_score":0.060518205},"labels":[],"label_agreement":null},{"id":"W2404614881","doi":"","title":"On endotype of bipartite graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Endotype; Bipartite graph; Mathematics; Combinatorics; Graph; Medicine; Internal medicine","score_opus":0.009916802603308223,"score_gpt":0.2125497521483922,"score_spread":0.20263294954508398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404614881","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34206864,0.004145586,0.33397117,0.010507199,0.0011033135,0.00019344043,0.0043010116,0.0009299195,0.3027797],"genre_scores_gemma":[0.82961285,0.002781018,0.07928085,0.0030840759,0.0017914029,0.00033916716,0.004718834,0.0005722035,0.07781949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997976,0.0007017376,0.00011395024,0.00044194452,0.0004192405,0.0003471197],"domain_scores_gemma":[0.9921335,0.0046962174,0.00068168464,0.001110974,0.000564819,0.0008127036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015867786,0.0006866794,0.0011240334,0.002752759,0.0025108817,0.0040109316,0.0019646334,0.001700211,0.017959675],"category_scores_gemma":[0.007227466,0.00059508963,0.001226528,0.0029773756,0.0033206898,0.011780413,0.0041523655,0.004223947,0.0023057866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061086976,0.00003978525,0.00061693246,0.000068000336,0.000008639455,0.00005028761,0.00012549927,0.0011056962,0.00037431213,0.98350453,0.005271124,0.008774088],"study_design_scores_gemma":[0.000017087557,0.000010393088,0.00044359555,0.00003354555,0.0000071499207,0.00012571519,0.000094340765,0.0067371847,0.0003164038,0.9851553,0.007049919,0.000009564559],"about_ca_topic_score_codex":0.0015819337,"about_ca_topic_score_gemma":0.0021131488,"teacher_disagreement_score":0.017959675,"about_ca_system_score_codex":0.0022105502,"about_ca_system_score_gemma":0.0006413904,"threshold_uncertainty_score":0.060081124},"labels":[],"label_agreement":null},{"id":"W2404661821","doi":"","title":"Minimum Metric Dimension of Illiac Networks.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dimension (graph theory); Metric (unit); Combinatorics; Business","score_opus":0.008666398882376473,"score_gpt":0.21432591404807108,"score_spread":0.2056595151656946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404661821","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5497047,0.0049851905,0.26629293,0.008248802,0.00046613129,0.00013440657,0.0053813388,0.0006790885,0.16410746],"genre_scores_gemma":[0.9201129,0.0014718188,0.0575753,0.0006342617,0.00030512764,0.00015710146,0.0023764602,0.00018196493,0.017185051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991019,0.00031286236,0.000043395747,0.00020416749,0.00018372279,0.0001539897],"domain_scores_gemma":[0.99542445,0.0025322547,0.00056422816,0.0004292331,0.00044944865,0.0006003268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007802032,0.0005477481,0.00079389097,0.0020778785,0.0017780141,0.0036733013,0.0015164858,0.0015571757,0.009193212],"category_scores_gemma":[0.0075147757,0.00045323904,0.0004461935,0.0018239861,0.0016890053,0.005604926,0.0020779704,0.0018816951,0.0009752589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001661987,0.00004431853,0.0020890718,0.00020706303,0.000032134365,0.00006329355,0.00022601234,0.010592198,0.0015667224,0.9492541,0.013000135,0.022758784],"study_design_scores_gemma":[0.000022534034,0.000021348185,0.0012300619,0.000053358122,0.000020204927,0.0001701272,0.00021289459,0.031133654,0.0012496971,0.955093,0.010775822,0.000017227983],"about_ca_topic_score_codex":0.0012754835,"about_ca_topic_score_gemma":0.0018326166,"teacher_disagreement_score":0.009193212,"about_ca_system_score_codex":0.002272948,"about_ca_system_score_gemma":0.0006144547,"threshold_uncertainty_score":0.030754328},"labels":[],"label_agreement":null},{"id":"W2404700317","doi":"","title":"On the choosability of bipartite graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Graph","score_opus":0.013018324968379688,"score_gpt":0.22769009035681367,"score_spread":0.214671765388434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404700317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31062478,0.0074967495,0.41244462,0.013605676,0.00096088613,0.00022882456,0.0028291778,0.00093686994,0.25087252],"genre_scores_gemma":[0.8877622,0.004829957,0.068681374,0.0018583798,0.0012285584,0.0002845942,0.0024920614,0.00052266865,0.032340188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861515,0.000540908,0.00006792903,0.00027274186,0.00026233585,0.00024085068],"domain_scores_gemma":[0.98835605,0.00926779,0.0005379813,0.0010217635,0.000245282,0.00057107705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015363423,0.0006412862,0.001035947,0.0014176368,0.001565054,0.0030168048,0.0018162127,0.0017704244,0.01591538],"category_scores_gemma":[0.010612753,0.0008086551,0.00091537996,0.0022860777,0.0034166703,0.008100083,0.0025379802,0.00344233,0.001760608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014953925,0.00008169293,0.0012350149,0.00024123378,0.000032811902,0.000093823226,0.00023583537,0.0097218845,0.0013613242,0.9421238,0.016496794,0.028226404],"study_design_scores_gemma":[0.000039602703,0.000018625888,0.00060284487,0.000040506377,0.000017244241,0.00013620137,0.000118486016,0.01799714,0.00056079886,0.9750562,0.005398049,0.000014347608],"about_ca_topic_score_codex":0.0017391308,"about_ca_topic_score_gemma":0.002317493,"teacher_disagreement_score":0.01591538,"about_ca_system_score_codex":0.0019004043,"about_ca_system_score_gemma":0.00080449553,"threshold_uncertainty_score":0.053242326},"labels":[],"label_agreement":null},{"id":"W2404819344","doi":"","title":"On super (a, 1)-edge entimagic total labelings of grids and crowns.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Geometry; Artificial intelligence; Computer science","score_opus":0.009369720389831096,"score_gpt":0.22019661542364935,"score_spread":0.21082689503381824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404819344","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42680487,0.0024148854,0.33317736,0.0040296256,0.0003773102,0.00016011958,0.0029631776,0.0009914163,0.22908124],"genre_scores_gemma":[0.82898396,0.0013237532,0.12673949,0.0012948549,0.00026332313,0.00017579386,0.0021266951,0.0003271732,0.038764894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992817,0.00022369217,0.000040871975,0.0001507462,0.00014030427,0.00016273936],"domain_scores_gemma":[0.99727803,0.0015616491,0.0002427499,0.00041196152,0.00022911864,0.00027656998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008632327,0.0004599167,0.00060806953,0.0015284525,0.0021442184,0.0026666145,0.0011672882,0.0011254,0.01186467],"category_scores_gemma":[0.0040731155,0.00050575775,0.00061342685,0.0019363583,0.002035803,0.0053456943,0.0023550964,0.0018947005,0.0013621062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097512566,0.000030221325,0.000701814,0.000112696085,0.000012558872,0.000051750765,0.00025298455,0.0037493103,0.0010677644,0.9683562,0.007470533,0.018096708],"study_design_scores_gemma":[0.000020849677,0.0000165031,0.00052863377,0.00003209547,0.000013402,0.000109907654,0.0001965786,0.011431581,0.0005878054,0.9780903,0.00896163,0.000010678578],"about_ca_topic_score_codex":0.0029300372,"about_ca_topic_score_gemma":0.0060045603,"teacher_disagreement_score":0.01186467,"about_ca_system_score_codex":0.0018212681,"about_ca_system_score_gemma":0.0006806562,"threshold_uncertainty_score":0.03969127},"labels":[],"label_agreement":null},{"id":"W2404911565","doi":"","title":"An Expansion Technique on Super Edge-Magic Total Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; MAGIC (telescope); Enhanced Data Rates for GSM Evolution; Combinatorics; Astronomy; Computer science; Physics; Artificial intelligence","score_opus":0.009216528485985096,"score_gpt":0.23695937171858916,"score_spread":0.22774284323260408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404911565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07826542,0.0010318367,0.78008497,0.0012745409,0.00024849983,0.00012581593,0.0006996541,0.0012161203,0.13705313],"genre_scores_gemma":[0.47700506,0.0012089928,0.46979198,0.0010622379,0.00024667016,0.00027900058,0.0014476611,0.0007753894,0.04818314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996045,0.0001079217,0.000014451968,0.00008039848,0.00012953716,0.0000632694],"domain_scores_gemma":[0.9990946,0.0004264909,0.00004185023,0.0002469422,0.00012424885,0.00006596511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005404171,0.0004047019,0.00041198215,0.0013838,0.00084260217,0.00089677057,0.0012798492,0.00051258196,0.011841136],"category_scores_gemma":[0.0020950423,0.00036256568,0.0005302143,0.0020074933,0.0010669535,0.0033749698,0.0024675932,0.0018689246,0.0014016745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008662063,0.00005462881,0.00033997186,0.00016375388,0.00001277083,0.000089982095,0.0003107436,0.0035850364,0.006605849,0.874672,0.014901694,0.09917692],"study_design_scores_gemma":[0.00003797574,0.000044377604,0.00052937237,0.00007968681,0.000042285923,0.0003272663,0.00019864381,0.042236976,0.005289732,0.9145938,0.03659857,0.0000211874],"about_ca_topic_score_codex":0.0011180047,"about_ca_topic_score_gemma":0.0026514954,"teacher_disagreement_score":0.011841136,"about_ca_system_score_codex":0.000675082,"about_ca_system_score_gemma":0.00051237975,"threshold_uncertainty_score":0.03961259},"labels":[],"label_agreement":null},{"id":"W2404912828","doi":"","title":"Minimal forbidden graphs of reducible additive hereditary graph properties.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph","score_opus":0.013715493714572657,"score_gpt":0.21769292330337592,"score_spread":0.20397742958880327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404912828","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67997044,0.0008946821,0.18193994,0.0020783055,0.00015162824,0.00012901291,0.0025464878,0.001016026,0.13127345],"genre_scores_gemma":[0.9648681,0.00021321834,0.023589358,0.00025082298,0.00006850844,0.00006730304,0.0014801204,0.000109396235,0.009353087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916077,0.00025240064,0.00004785729,0.00021807716,0.00017838193,0.000142476],"domain_scores_gemma":[0.9953892,0.0028607831,0.0005898986,0.00063281186,0.00025753406,0.0002698144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056025456,0.00038027513,0.00045776338,0.0011325069,0.0012705439,0.0026868174,0.001041972,0.00082706386,0.007370893],"category_scores_gemma":[0.0035102356,0.0005417203,0.0005762823,0.0009259502,0.0016852595,0.0030981163,0.0012823371,0.0013959176,0.00063528935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015005744,0.00009692559,0.001956396,0.00012843567,0.00003261111,0.00024129462,0.000352588,0.004586025,0.003875937,0.96774876,0.004625808,0.016205085],"study_design_scores_gemma":[0.000030681007,0.000022464565,0.0011086279,0.00003445715,0.000044817116,0.0004920552,0.0003037113,0.011445424,0.0037995426,0.97511035,0.007591971,0.000015909553],"about_ca_topic_score_codex":0.001142183,"about_ca_topic_score_gemma":0.001832491,"teacher_disagreement_score":0.007370893,"about_ca_system_score_codex":0.0010734893,"about_ca_system_score_gemma":0.0005625313,"threshold_uncertainty_score":0.024658084},"labels":[],"label_agreement":null},{"id":"W2404933767","doi":"","title":"On the tree with maximum general Randic Index.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Tree (set theory); Combinatorics; Statistics; Computer science","score_opus":0.00796176716452101,"score_gpt":0.19649131523824162,"score_spread":0.1885295480737206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404933767","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38553736,0.0067050993,0.26061967,0.010292645,0.00059277826,0.00015858372,0.003703264,0.0012910108,0.33109954],"genre_scores_gemma":[0.8388692,0.002453291,0.10654523,0.0017256384,0.0005540233,0.00015916962,0.0021629746,0.0005903814,0.046940148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917287,0.00024541127,0.000037167323,0.00018690125,0.00016852914,0.0001890373],"domain_scores_gemma":[0.99630415,0.002232737,0.0003414371,0.0005120721,0.00025372772,0.00035587602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010124795,0.00043942468,0.0010975129,0.0018776971,0.002079646,0.0037210668,0.0013019324,0.0017862822,0.012426536],"category_scores_gemma":[0.00660715,0.0004759961,0.0004991545,0.0021641592,0.0019792872,0.0068237614,0.00224263,0.0022079055,0.0025299257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014636762,0.000044025215,0.0005424712,0.00013265146,0.000014394283,0.000067565,0.00019153212,0.0040063593,0.0012666645,0.9543563,0.016528297,0.02270336],"study_design_scores_gemma":[0.000030139898,0.00001657044,0.00039662476,0.000046765268,0.000014689182,0.00017257313,0.00012280443,0.012860561,0.0006698564,0.9754402,0.0102151465,0.000013948201],"about_ca_topic_score_codex":0.0013735677,"about_ca_topic_score_gemma":0.0028931238,"teacher_disagreement_score":0.012426536,"about_ca_system_score_codex":0.0019315364,"about_ca_system_score_gemma":0.0008521094,"threshold_uncertainty_score":0.041570842},"labels":[],"label_agreement":null},{"id":"W2405014331","doi":"","title":"A brute-force method for studying the chromatic properties of homomorphic graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Homomorphic encryption; Mathematics; Chromatic scale; Brute force; Brute-force attack; Combinatorics; Algorithm; Computer science; Cryptography; Computer security; Encryption","score_opus":0.025129582280539832,"score_gpt":0.25088573591898544,"score_spread":0.22575615363844562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405014331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08005059,0.00057017576,0.86061597,0.0008771063,0.00016498809,0.00030076524,0.0005739039,0.00093442615,0.055912066],"genre_scores_gemma":[0.62367964,0.0007592174,0.3465075,0.00047593119,0.00027043337,0.00072266127,0.0009906241,0.0006655088,0.025928566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998978,0.00032666812,0.000020761981,0.00024096693,0.00031534172,0.000118318916],"domain_scores_gemma":[0.9958192,0.0023734777,0.00020423139,0.0011970525,0.00021709301,0.00018892999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012635142,0.0008471855,0.0006313966,0.0022106983,0.0017404268,0.0012138088,0.0019460262,0.0011986883,0.009698854],"category_scores_gemma":[0.005185574,0.00063633034,0.0009020245,0.001613651,0.002197159,0.0028599126,0.0021614076,0.002705205,0.0017028328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021534777,0.00028308065,0.0017991306,0.00023659447,0.0000719397,0.0001282613,0.00047919725,0.019008504,0.013032194,0.88330704,0.011578744,0.069860004],"study_design_scores_gemma":[0.00008021728,0.000079721714,0.0011425698,0.000042065072,0.000040377887,0.00022016742,0.00017807525,0.15442748,0.007007988,0.82143563,0.015296583,0.000049282764],"about_ca_topic_score_codex":0.002303198,"about_ca_topic_score_gemma":0.004019417,"teacher_disagreement_score":0.009698854,"about_ca_system_score_codex":0.0013526698,"about_ca_system_score_gemma":0.0009764498,"threshold_uncertainty_score":0.032445967},"labels":[],"label_agreement":null},{"id":"W2405045104","doi":"","title":"On Metric Dimension of Generalized Petersen Graphs P(n, 3).","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Metric dimension; Mathematics; Combinatorics; Dimension (graph theory); Metric (unit); Constant (computer programming); Discrete mathematics; Graph; Chordal graph; 1-planar graph","score_opus":0.01014705084220965,"score_gpt":0.22276694766794833,"score_spread":0.21261989682573867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405045104","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9234059,0.0013031121,0.042930637,0.0013815138,0.00010637725,0.000028719374,0.00031196268,0.00007042596,0.030461337],"genre_scores_gemma":[0.98794156,0.0005465479,0.009035693,0.00016251144,0.0001002579,0.000023124654,0.00020468414,0.000017305763,0.0019683475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995708,0.000120184806,0.0000150480855,0.000106536856,0.00009035002,0.00009717911],"domain_scores_gemma":[0.9983853,0.00082453544,0.00034604385,0.00013490436,0.0000994933,0.00020965973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004862686,0.00042526957,0.00037181214,0.0015436837,0.0013378526,0.0012646213,0.0005476001,0.0007879437,0.0021971413],"category_scores_gemma":[0.0021586213,0.00026228308,0.00031248858,0.0012088295,0.0019718506,0.0025713022,0.0012805101,0.0009411568,0.00020059024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012338065,0.000042088348,0.0044015744,0.00010631635,0.000029384222,0.00020435752,0.00058361987,0.008220056,0.0037920196,0.96603507,0.0021998242,0.014262387],"study_design_scores_gemma":[0.000021563492,0.00006865148,0.004162083,0.00003009711,0.000024003039,0.0005941464,0.00037157672,0.025955591,0.002550886,0.9581478,0.008037137,0.000036419384],"about_ca_topic_score_codex":0.0007644264,"about_ca_topic_score_gemma":0.000691853,"teacher_disagreement_score":0.0021971413,"about_ca_system_score_codex":0.00095597375,"about_ca_system_score_gemma":0.00028676767,"threshold_uncertainty_score":0.0073502064},"labels":[],"label_agreement":null},{"id":"W2405309453","doi":"","title":"On super (a, d)-edge-antimagic total labeling of subdivided stars.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Stars; Enhanced Data Rates for GSM Evolution; Combinatorics; Astrophysics; Artificial intelligence; Physics; Computer science","score_opus":0.01470256567222547,"score_gpt":0.23355309271789368,"score_spread":0.2188505270456682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405309453","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43944657,0.0020441345,0.4077856,0.0024343075,0.00029619303,0.00019422943,0.0021786734,0.0009798487,0.14464036],"genre_scores_gemma":[0.7588974,0.0013865068,0.20852554,0.0011401337,0.00018685036,0.00019715633,0.0026614459,0.00033740752,0.02666752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991968,0.00025654506,0.000052922693,0.00018000862,0.0001564794,0.0001571681],"domain_scores_gemma":[0.99722123,0.0014338532,0.00023218035,0.000549065,0.00024405986,0.00031967481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009688381,0.00051433704,0.0008053431,0.0013217529,0.0019489217,0.0025141875,0.0012592011,0.0014376075,0.0080632195],"category_scores_gemma":[0.0036952223,0.000492717,0.00077298377,0.0023412248,0.0016284403,0.0044065784,0.002999518,0.0017028004,0.0013792325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022782724,0.00007019692,0.0011560018,0.0002728189,0.000032148786,0.00010325099,0.00040597035,0.009243809,0.003834815,0.93688554,0.010474757,0.037292894],"study_design_scores_gemma":[0.000038824535,0.000042612075,0.00069266197,0.000052359344,0.00003593893,0.00019101251,0.00026903168,0.021556305,0.0015824036,0.96480733,0.010713708,0.000017897077],"about_ca_topic_score_codex":0.0019844472,"about_ca_topic_score_gemma":0.0034142374,"teacher_disagreement_score":0.0080632195,"about_ca_system_score_codex":0.0016517878,"about_ca_system_score_gemma":0.0008338864,"threshold_uncertainty_score":0.026974201},"labels":[],"label_agreement":null},{"id":"W2405397543","doi":"","title":"On super edge magic deficiency of kite graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Kite; Mathematics; MAGIC (telescope); Enhanced Data Rates for GSM Evolution; Geometry; Astronomy; Computer science; Telecommunications; Physics","score_opus":0.013389781274663658,"score_gpt":0.2268194314642749,"score_spread":0.21342965018961124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405397543","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6271959,0.003236126,0.16400108,0.0064259,0.0004734541,0.00009752209,0.0013801967,0.0005599878,0.19662984],"genre_scores_gemma":[0.94212306,0.0011999838,0.03716923,0.0008671701,0.00022350198,0.00009397592,0.00093672454,0.00015429028,0.01723219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992661,0.0002471078,0.000031807267,0.00013339202,0.00017022807,0.00015132171],"domain_scores_gemma":[0.9963348,0.0023285146,0.00027553027,0.0004473838,0.00027618825,0.00033754972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010117823,0.00047384258,0.000813879,0.0018062812,0.0014359744,0.0021003734,0.0011827219,0.0013796358,0.009149434],"category_scores_gemma":[0.005437815,0.000468291,0.00045715226,0.0014227905,0.002505039,0.0058243927,0.0024725173,0.0023337721,0.0011858755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096434705,0.000035671284,0.0009139381,0.00011226679,0.00001087112,0.00008649926,0.00019657565,0.002953529,0.0010418855,0.9725487,0.0065480117,0.01545554],"study_design_scores_gemma":[0.000019189234,0.000014415904,0.0003962125,0.000030363793,0.00000830377,0.00017477656,0.00014262725,0.009066541,0.00051936915,0.98533636,0.0042801825,0.0000115881],"about_ca_topic_score_codex":0.0011222679,"about_ca_topic_score_gemma":0.0014227465,"teacher_disagreement_score":0.009149434,"about_ca_system_score_codex":0.0011077399,"about_ca_system_score_gemma":0.0005509269,"threshold_uncertainty_score":0.03060788},"labels":[],"label_agreement":null},{"id":"W2405507427","doi":"","title":"Some C 4 -supermagic graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.010009002474049724,"score_gpt":0.20966783335995443,"score_spread":0.1996588308859047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405507427","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44603974,0.00087092246,0.12797943,0.0057564243,0.00039153668,0.00013726336,0.0034951025,0.0008326429,0.41449693],"genre_scores_gemma":[0.88128906,0.00046580893,0.06269012,0.0013115598,0.00014490393,0.0001099209,0.002520142,0.00017361164,0.05129488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959296,0.000104012695,0.000015683738,0.00009288112,0.00008612986,0.0001083324],"domain_scores_gemma":[0.998769,0.0004854954,0.00015474044,0.00016798469,0.0002012522,0.00022153056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035747397,0.00044012078,0.00033863075,0.0012238945,0.0019373078,0.0019604082,0.000882907,0.0009330044,0.013794956],"category_scores_gemma":[0.0014095958,0.00032247737,0.0004970706,0.0012571077,0.0012268785,0.0020661887,0.0012400493,0.001756503,0.0016192371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009723513,0.000037926446,0.00055991975,0.00009337181,0.000014094387,0.00017589386,0.00017552136,0.0011744662,0.0024441462,0.9739525,0.010633049,0.010641931],"study_design_scores_gemma":[0.000034790293,0.000013550319,0.0008317507,0.000030571664,0.000018343744,0.00026081628,0.0002749682,0.00701869,0.0021114666,0.9611372,0.028252397,0.000015575719],"about_ca_topic_score_codex":0.0025856108,"about_ca_topic_score_gemma":0.0048969104,"teacher_disagreement_score":0.013794956,"about_ca_system_score_codex":0.0012777238,"about_ca_system_score_gemma":0.00056994695,"threshold_uncertainty_score":0.046148717},"labels":[],"label_agreement":null},{"id":"W2405565081","doi":"","title":"Pebbling Number Of The Graph D n , C m .","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph","score_opus":0.00910272598086932,"score_gpt":0.22505562980620158,"score_spread":0.21595290382533228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405565081","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7082505,0.000856149,0.10463483,0.0051436834,0.00042687144,0.00011805811,0.0040565883,0.0008013005,0.17571191],"genre_scores_gemma":[0.92288345,0.00032749146,0.040026996,0.00042537614,0.00010907688,0.0001062067,0.0015527327,0.00019132218,0.03437732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951065,0.00010307339,0.000022747774,0.00013721986,0.00009277273,0.00013349645],"domain_scores_gemma":[0.9975262,0.0012732935,0.00022598161,0.00031476066,0.00023352221,0.00042625045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004701651,0.00042128947,0.0005083677,0.0014774962,0.0023124272,0.0027608473,0.0010631644,0.0013575669,0.018334452],"category_scores_gemma":[0.0034779364,0.00030654483,0.000358189,0.0009950711,0.0013382776,0.0029297879,0.001115341,0.001641576,0.002480183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044752512,0.0001601113,0.0031662534,0.00026753443,0.000024603461,0.00022606611,0.0003821801,0.0095447805,0.013524506,0.906657,0.022036586,0.04356289],"study_design_scores_gemma":[0.000048994476,0.000086140804,0.0034173043,0.000075499236,0.000035978694,0.00058945944,0.00042478836,0.04023331,0.010524191,0.91838914,0.026129242,0.000045919118],"about_ca_topic_score_codex":0.0018764775,"about_ca_topic_score_gemma":0.0030375419,"teacher_disagreement_score":0.018334452,"about_ca_system_score_codex":0.0015230973,"about_ca_system_score_gemma":0.0010336393,"threshold_uncertainty_score":0.06133485},"labels":[],"label_agreement":null},{"id":"W2405623444","doi":"","title":"An improved upper bound on the adjacent vertex distinguishing edge chromatic number of a simple graph.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Windmill graph; Chromatic scale; Combinatorics; Edge contraction; Simple graph; Simple (philosophy); Graph; Upper and lower bounds; Enhanced Data Rates for GSM Evolution; Friendship graph; Edge coloring; Line graph; Graph power; Computer science; Mathematical analysis; Telecommunications","score_opus":0.011408938425104027,"score_gpt":0.23971276136335537,"score_spread":0.22830382293825136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405623444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2170053,0.006305671,0.486318,0.0066370717,0.0023054709,0.00048419676,0.006028734,0.004870466,0.270045],"genre_scores_gemma":[0.68691957,0.00234291,0.2727903,0.001787192,0.0010971138,0.0004797783,0.004454729,0.0012787208,0.028849678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976497,0.0004056647,0.00010090437,0.000610825,0.0007419656,0.00049088825],"domain_scores_gemma":[0.9875437,0.008053807,0.00045357997,0.0024221162,0.00073535653,0.0007914982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023421682,0.0019005735,0.0016328138,0.0032556215,0.0022857364,0.004701968,0.004995864,0.0020016131,0.022467637],"category_scores_gemma":[0.012210461,0.00087955216,0.0013878444,0.003642358,0.002799967,0.008300598,0.0046008313,0.0052933996,0.0047853445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018214303,0.0008654763,0.005094712,0.0012272649,0.00019173096,0.0005035998,0.0006012652,0.07640873,0.040836792,0.62993675,0.084436804,0.15807554],"study_design_scores_gemma":[0.00018928052,0.00023511476,0.0039698407,0.00020397478,0.00025943478,0.0007886986,0.00025210655,0.26419342,0.014102348,0.6676144,0.048038956,0.00015246919],"about_ca_topic_score_codex":0.0033247152,"about_ca_topic_score_gemma":0.007535802,"teacher_disagreement_score":0.022467637,"about_ca_system_score_codex":0.0038722553,"about_ca_system_score_gemma":0.0021914062,"threshold_uncertainty_score":0.075161755},"labels":[],"label_agreement":null},{"id":"W2405709304","doi":"","title":"Super edge-magic total labeling of subdivided stars","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"MAGIC (telescope); Stars; Combinatorics; Mathematics; Graph; Enhanced Data Rates for GSM Evolution; Integer (computer science); Physics; Astrophysics; Computer science; Artificial intelligence","score_opus":0.02445440731796151,"score_gpt":0.23909247914728635,"score_spread":0.21463807182932484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405709304","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5302051,0.00053793873,0.42062804,0.0004204894,0.00007017406,0.000056610854,0.00041584266,0.0002452368,0.04742067],"genre_scores_gemma":[0.87566173,0.00032503018,0.11150244,0.00014204772,0.000059931437,0.000064895896,0.0005566768,0.00007743695,0.011609768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997068,0.0000692596,0.000017237104,0.00008185477,0.0000636224,0.000061170365],"domain_scores_gemma":[0.99951303,0.00014597364,0.000065963286,0.000114166665,0.00008576291,0.00007499402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000309654,0.0002218568,0.0002840913,0.0005262591,0.00062105147,0.0007998854,0.0005378895,0.00035568676,0.0028297782],"category_scores_gemma":[0.0007663475,0.0002001993,0.00037524267,0.00071564905,0.000825118,0.0014111781,0.0008710291,0.0005617108,0.00027295706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011295328,0.000024654457,0.0013208927,0.00010376906,0.000010907627,0.00008211862,0.00036762355,0.020901391,0.008026861,0.93891066,0.0023697594,0.0277684],"study_design_scores_gemma":[0.000026789834,0.00010051041,0.0013182821,0.00003228153,0.000027878172,0.00030201516,0.00032737947,0.12742297,0.006019122,0.8409141,0.023488827,0.000019836154],"about_ca_topic_score_codex":0.0011364548,"about_ca_topic_score_gemma":0.0018784004,"teacher_disagreement_score":0.0028297782,"about_ca_system_score_codex":0.0008105278,"about_ca_system_score_gemma":0.00037425078,"threshold_uncertainty_score":0.0094665885},"labels":[],"label_agreement":null},{"id":"W2405720617","doi":"","title":"Some results on neighbourhood highly irregular graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Neighbourhood (mathematics); Mathematical analysis","score_opus":0.020585298826413335,"score_gpt":0.21466408654415936,"score_spread":0.19407878771774603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405720617","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17448975,0.0123233525,0.24042118,0.012669415,0.0015265786,0.00015799809,0.0026108266,0.0011669312,0.55463403],"genre_scores_gemma":[0.7968418,0.010937568,0.08253049,0.0037394585,0.002421919,0.0003377776,0.0043767085,0.0008304398,0.09798381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992238,0.00020068936,0.000040732022,0.00017287921,0.00024062338,0.00012126033],"domain_scores_gemma":[0.99476504,0.003258293,0.00041852676,0.0006983436,0.00033671048,0.0005231041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009892045,0.0006955811,0.00095368526,0.0026387626,0.0024215828,0.0031858315,0.0015179436,0.0015245983,0.016098652],"category_scores_gemma":[0.0063027125,0.0006206861,0.0009200033,0.0038594313,0.0027730362,0.0058224597,0.0028070027,0.0035176221,0.0028999434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062874125,0.000055558066,0.0007976779,0.00029475772,0.000018705168,0.00015477899,0.0002708377,0.0039403634,0.00086561724,0.95540375,0.018991053,0.019144047],"study_design_scores_gemma":[0.000015123798,0.000017621649,0.0005256803,0.000045462937,0.000019031755,0.00026015993,0.00018200757,0.006771404,0.0005261455,0.9693944,0.022229873,0.000013081842],"about_ca_topic_score_codex":0.0015687458,"about_ca_topic_score_gemma":0.0022617853,"teacher_disagreement_score":0.016098652,"about_ca_system_score_codex":0.0018801464,"about_ca_system_score_gemma":0.0005111714,"threshold_uncertainty_score":0.05385536},"labels":[],"label_agreement":null},{"id":"W2405749931","doi":"","title":"Recognizing Tenacious Graphs Is NP-Hard.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.014142947458738002,"score_gpt":0.21921614121325944,"score_spread":0.20507319375452143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405749931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30616966,0.0022959644,0.56200314,0.013397344,0.000817763,0.00038672512,0.009481022,0.0055763694,0.09987197],"genre_scores_gemma":[0.7623529,0.001015728,0.19969392,0.0015487302,0.0002892417,0.00022692156,0.010233143,0.00073603267,0.023903314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835336,0.00033236318,0.000121400364,0.00063460605,0.0003098388,0.00024853024],"domain_scores_gemma":[0.98972255,0.0073701623,0.00060771866,0.0013373471,0.00055773783,0.0004045165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088867755,0.00087033754,0.0011307902,0.0014986085,0.002408867,0.0047528287,0.002047363,0.0021423255,0.010456625],"category_scores_gemma":[0.0077142073,0.00083148427,0.0015985516,0.002490867,0.0021706645,0.008153175,0.0026052215,0.003959732,0.0023350948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042711748,0.0004680324,0.007924597,0.001151522,0.00016984472,0.0006875111,0.0011168638,0.036554817,0.006697161,0.6590148,0.09152014,0.1942676],"study_design_scores_gemma":[0.000024169596,0.000020582978,0.0008271025,0.000066399654,0.000036212517,0.00040092034,0.0005644805,0.057783734,0.0029011818,0.9201913,0.017152825,0.00003101899],"about_ca_topic_score_codex":0.0041423356,"about_ca_topic_score_gemma":0.008113004,"teacher_disagreement_score":0.010456625,"about_ca_system_score_codex":0.0016872165,"about_ca_system_score_gemma":0.0013261972,"threshold_uncertainty_score":0.034980893},"labels":[],"label_agreement":null},{"id":"W2405803305","doi":"","title":"(a, d)-Edge-Antimagic Total Labelings Of Cycle.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Artificial intelligence; Computer science","score_opus":0.01656134205944651,"score_gpt":0.21529835908835226,"score_spread":0.19873701702890575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405803305","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39747423,0.0017177614,0.3260641,0.0025185272,0.00039554373,0.00023061203,0.0060242573,0.0015057763,0.26406923],"genre_scores_gemma":[0.79569846,0.0009224546,0.14890842,0.0008662148,0.00014593486,0.00026056872,0.0044462825,0.0004033741,0.048348166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993242,0.00018770467,0.000054263794,0.00017795179,0.00012288238,0.00013286626],"domain_scores_gemma":[0.99757403,0.0010093391,0.00021743121,0.00055532454,0.0003324932,0.0003114187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005699701,0.00048638173,0.0005570467,0.0014180419,0.0018431162,0.0030917064,0.0010938685,0.0012913198,0.012770784],"category_scores_gemma":[0.0032736047,0.0004899503,0.0007617456,0.0019917693,0.001139338,0.0032395334,0.0019340318,0.0014169147,0.0018739688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016845502,0.000051132753,0.00087426626,0.00019489108,0.000030696552,0.00010097134,0.00026384182,0.003577661,0.0034289923,0.94614303,0.013869155,0.031296916],"study_design_scores_gemma":[0.000036890484,0.00003680288,0.00068631343,0.000051940537,0.00004069343,0.00027958333,0.00019949731,0.012743547,0.0024648872,0.96083516,0.022604601,0.000020063704],"about_ca_topic_score_codex":0.0017281413,"about_ca_topic_score_gemma":0.002877259,"teacher_disagreement_score":0.012770784,"about_ca_system_score_codex":0.0014638884,"about_ca_system_score_gemma":0.0007040654,"threshold_uncertainty_score":0.042722464},"labels":[],"label_agreement":null},{"id":"W2405972438","doi":"","title":"The List Point Arboricity of Some Complete Multi-partite Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Point (geometry); Combinatorics; Graph; Geometry; Planar graph","score_opus":0.024149819981733815,"score_gpt":0.24352770042509123,"score_spread":0.2193778804433574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405972438","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7992554,0.0007457935,0.07106658,0.0021013848,0.000088836496,0.000075921635,0.0025592793,0.000333453,0.12377342],"genre_scores_gemma":[0.96580285,0.00045506767,0.017180996,0.00021180157,0.00009416788,0.0000730792,0.0015750035,0.0000803315,0.014526657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999699,0.000092300994,0.00001560437,0.00006944511,0.000058777216,0.00006492254],"domain_scores_gemma":[0.99779546,0.0013509223,0.00029180732,0.00020359314,0.00016322981,0.00019510654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002919913,0.00028054244,0.00034956654,0.0011725572,0.001386388,0.0019891663,0.0006131104,0.00080793386,0.0088264225],"category_scores_gemma":[0.002222011,0.0003425799,0.00042872122,0.0012654345,0.0010237006,0.002423911,0.00088271906,0.0012500748,0.000829166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023134224,0.00006502856,0.0025917948,0.00021181672,0.000031443178,0.00040476836,0.00064485933,0.009199662,0.0053680553,0.946393,0.011294937,0.023563368],"study_design_scores_gemma":[0.00005675639,0.000058948113,0.002950774,0.000060849852,0.00005510259,0.0005598853,0.0006184695,0.035132825,0.004304989,0.942258,0.013917112,0.000026355787],"about_ca_topic_score_codex":0.0010737072,"about_ca_topic_score_gemma":0.0017705255,"teacher_disagreement_score":0.0088264225,"about_ca_system_score_codex":0.00074213755,"about_ca_system_score_gemma":0.00028363205,"threshold_uncertainty_score":0.029527366},"labels":[],"label_agreement":null},{"id":"W2406055866","doi":"","title":"On the m-Hull Number of the Join and Composition of Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Join (topology); Mathematics; Hull; Composition (language); Combinatorics; Discrete mathematics; Materials science; Composite material","score_opus":0.011367421330954955,"score_gpt":0.2246293934790618,"score_spread":0.21326197214810685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406055866","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64572954,0.001305733,0.24053591,0.0017009857,0.00032045986,0.00010703522,0.0009582711,0.00030427607,0.109037764],"genre_scores_gemma":[0.9465525,0.00046304215,0.04618049,0.00017079704,0.00023580354,0.00010183342,0.00045099898,0.000072803305,0.005771708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982363,0.0004700788,0.00010540117,0.0003655716,0.000517355,0.000305142],"domain_scores_gemma":[0.98863727,0.007712764,0.0012191744,0.0010403884,0.00044735582,0.0009429517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018908321,0.0005227004,0.0007109264,0.0029584498,0.0025140042,0.0036427407,0.0013515302,0.001184417,0.00789433],"category_scores_gemma":[0.00940542,0.00051010423,0.0007188387,0.0021015683,0.004543331,0.010276324,0.0032520893,0.0023274391,0.0009519863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028191772,0.00005621431,0.0029446061,0.000096372554,0.0000177209,0.000120341,0.00043743066,0.006038806,0.0027064115,0.96880597,0.0028775304,0.015616657],"study_design_scores_gemma":[0.000031310716,0.00010513679,0.0038946124,0.00006960339,0.000032307642,0.0005411031,0.00057228864,0.039621092,0.0053895423,0.9420143,0.0076730396,0.00005559956],"about_ca_topic_score_codex":0.00061576377,"about_ca_topic_score_gemma":0.00062957016,"teacher_disagreement_score":0.00789433,"about_ca_system_score_codex":0.0016119389,"about_ca_system_score_gemma":0.00046985128,"threshold_uncertainty_score":0.026409209},"labels":[],"label_agreement":null},{"id":"W2406096518","doi":"","title":"Rooted General Maps on All Surfaces.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Geometry; Pure mathematics","score_opus":0.012872839994744,"score_gpt":0.22521423765963247,"score_spread":0.21234139766488846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406096518","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3914685,0.00204734,0.22608057,0.003465872,0.0006003457,0.00010225312,0.0022815627,0.0009694039,0.3729841],"genre_scores_gemma":[0.8569059,0.001248958,0.053962644,0.0006240353,0.0003421734,0.000096999065,0.0020442936,0.00039741065,0.084377624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994789,0.000087263834,0.000023513994,0.00016522915,0.00012157444,0.00012363897],"domain_scores_gemma":[0.9991704,0.00032038247,0.00008614462,0.00018600459,0.000117028925,0.00012003383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029963432,0.0005683667,0.00056300685,0.0014439841,0.0017720509,0.0026589986,0.0009878945,0.0010691263,0.01356913],"category_scores_gemma":[0.0015708767,0.00038621874,0.00066676526,0.0013376902,0.0015515471,0.004735005,0.0023940133,0.0022538172,0.0023692022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029839512,0.000016877166,0.00026994426,0.000047409572,0.0000065409267,0.000053211475,0.00012837333,0.00086621894,0.0010361412,0.97936636,0.0045947563,0.013584205],"study_design_scores_gemma":[0.0000066799853,0.000007341806,0.0003411933,0.00001555883,0.0000074096347,0.00011490236,0.0001414356,0.0028040903,0.00082981406,0.97965485,0.016068932,0.000007852225],"about_ca_topic_score_codex":0.0011760236,"about_ca_topic_score_gemma":0.0020309137,"teacher_disagreement_score":0.01356913,"about_ca_system_score_codex":0.0011734248,"about_ca_system_score_gemma":0.000409384,"threshold_uncertainty_score":0.04539323},"labels":[],"label_agreement":null},{"id":"W2406248079","doi":"","title":"Lower and Upper Orientable Strong Radius and Strong Diameter of the Cartesian Product of Complete Graphs","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; RADIUS; Cartesian coordinate system; Product (mathematics); Combinatorics; Geometry; Computer science","score_opus":0.00913719301420765,"score_gpt":0.20880120925466283,"score_spread":0.19966401624045518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406248079","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78894585,0.003994497,0.14873396,0.0017139638,0.00012860584,0.000056949215,0.0009421948,0.0007105152,0.05477353],"genre_scores_gemma":[0.9629131,0.0012512726,0.027264865,0.0002838876,0.00025912258,0.00012364211,0.0007100776,0.00026863615,0.0069255126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759334,0.00071636395,0.00014819395,0.0007511537,0.0004188496,0.00037203726],"domain_scores_gemma":[0.97772676,0.0147586,0.0022889816,0.0014629683,0.0008195528,0.0029431018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025318156,0.00158314,0.0021806331,0.0023324625,0.0018364752,0.006746747,0.0032000928,0.0016282991,0.007138705],"category_scores_gemma":[0.013027301,0.0021192662,0.0013721825,0.0019924461,0.0043771616,0.00902323,0.0046624267,0.0034450726,0.0011856158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067254284,0.00010609796,0.0037734695,0.00037677464,0.000073511255,0.00019199771,0.0012405174,0.013019878,0.0065699513,0.9573789,0.004357671,0.0122386515],"study_design_scores_gemma":[0.00010959162,0.00022539472,0.0050575277,0.00010913169,0.00019172835,0.0007661202,0.0006509361,0.053633384,0.007124802,0.9219446,0.010070356,0.00011631885],"about_ca_topic_score_codex":0.0007515129,"about_ca_topic_score_gemma":0.0009275489,"teacher_disagreement_score":0.007138705,"about_ca_system_score_codex":0.0015481728,"about_ca_system_score_gemma":0.00058396463,"threshold_uncertainty_score":0.023881316},"labels":[],"label_agreement":null},{"id":"W2406367216","doi":"","title":"ON SUPER (a, 2)-EDGE-ANTIMAGIC TOTAL LABELING OF DISCONNECTED GRAPHS","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Edge-graceful labeling; Arithmetic progression; Graph; Graph labeling; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Graph power; Line graph; Computer science; Artificial intelligence","score_opus":0.008266548985325757,"score_gpt":0.21469165795534087,"score_spread":0.20642510897001512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406367216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79488105,0.0010004677,0.14691885,0.00102968,0.00008083353,0.00006673885,0.0007214315,0.00035574232,0.054945286],"genre_scores_gemma":[0.9493794,0.0006552794,0.042939536,0.00024396554,0.0000928648,0.000088370594,0.00072438596,0.00006720059,0.0058090487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993266,0.00021139122,0.000055710396,0.00015836065,0.0001230918,0.00012487362],"domain_scores_gemma":[0.9964737,0.0021490406,0.00041029596,0.0003116046,0.00025625664,0.00039909378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007934421,0.00046346823,0.0005035177,0.0019459577,0.0015726307,0.0019134679,0.00057594466,0.0011899428,0.003606544],"category_scores_gemma":[0.0031204014,0.00041766677,0.00053575804,0.0019344056,0.002009399,0.002697406,0.0017366086,0.0011384262,0.00047932574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016004205,0.000046952453,0.0024415348,0.00015208722,0.000016148342,0.00025911772,0.00064586755,0.009560627,0.0061555305,0.961845,0.002578026,0.016139083],"study_design_scores_gemma":[0.00002865602,0.000054890497,0.0010857044,0.000033244196,0.000022395108,0.0005763818,0.00043387193,0.031690903,0.0024565835,0.95703095,0.006558569,0.000027891796],"about_ca_topic_score_codex":0.0007636022,"about_ca_topic_score_gemma":0.001106829,"teacher_disagreement_score":0.003606544,"about_ca_system_score_codex":0.0012595694,"about_ca_system_score_gemma":0.00047063592,"threshold_uncertainty_score":0.012065113},"labels":[],"label_agreement":null},{"id":"W2406638558","doi":"","title":"Edge Colorings of Planar Graphs without adjacent special cycles.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Planar graph; Edge coloring; Planar; Geometry; Graph; Computer science; Artificial intelligence; Computer graphics (images); Line graph","score_opus":0.01648212332690365,"score_gpt":0.23399863046376645,"score_spread":0.2175165071368628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406638558","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66475177,0.0024282408,0.17034408,0.0037249948,0.0004298597,0.00014996705,0.0032875347,0.0009269266,0.15395671],"genre_scores_gemma":[0.9232281,0.0009626606,0.053017054,0.0005083118,0.00018697657,0.00010522961,0.002088011,0.00022730051,0.019676436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994161,0.00018539623,0.00003644619,0.00012530416,0.0000884586,0.00014839962],"domain_scores_gemma":[0.996815,0.001863292,0.00040998988,0.00041448246,0.00019779612,0.00029939986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052786974,0.0004988739,0.0005309982,0.0014365365,0.0016739699,0.0029042056,0.001084804,0.0012024449,0.008861341],"category_scores_gemma":[0.003965817,0.0007105877,0.00059477746,0.0016595972,0.0014897487,0.003062498,0.0014717123,0.0015268989,0.0010143487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024235729,0.00009872901,0.0026865522,0.00019799951,0.00003440233,0.00019701984,0.00034804753,0.012106637,0.0039619356,0.9262996,0.018895945,0.0349308],"study_design_scores_gemma":[0.00006451796,0.00003208328,0.0015859114,0.000055845165,0.000034667348,0.00038076504,0.00036869326,0.02527279,0.0021639597,0.95465654,0.015357775,0.000026447477],"about_ca_topic_score_codex":0.0021927445,"about_ca_topic_score_gemma":0.00326617,"teacher_disagreement_score":0.008861341,"about_ca_system_score_codex":0.0013751502,"about_ca_system_score_gemma":0.00061873876,"threshold_uncertainty_score":0.029644132},"labels":[],"label_agreement":null},{"id":"W2406728108","doi":"","title":"Integer-Magic Spectra of Sun Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; MAGIC (telescope); Integer (computer science); Combinatorics; Spectral line; Discrete mathematics; Astrophysics; Astronomy; Physics; Computer science","score_opus":0.013286494821636602,"score_gpt":0.22980663798093548,"score_spread":0.21652014315929888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406728108","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61933637,0.0016455576,0.11765344,0.0025540362,0.000366161,0.000050973398,0.0014820948,0.00060669234,0.25630474],"genre_scores_gemma":[0.9632648,0.00044989397,0.021307737,0.00029453557,0.00010514376,0.000036761878,0.0006486006,0.00011636943,0.013776178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996468,0.00008201613,0.00001870961,0.000085493375,0.00007852125,0.000088441055],"domain_scores_gemma":[0.9989654,0.00047700887,0.00016073039,0.00013527746,0.00009528084,0.00016625009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035783113,0.00033261222,0.0003775024,0.0014350271,0.0015168664,0.002211581,0.00074003823,0.0006793711,0.013749328],"category_scores_gemma":[0.0016884137,0.00029615551,0.00037059802,0.0009864852,0.0013101503,0.004002773,0.0012083206,0.0011985359,0.001198654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007852458,0.000022315096,0.00045576575,0.00005640922,0.0000057754555,0.000065609864,0.00015082982,0.0011266867,0.0015080652,0.98325044,0.0039338376,0.009345788],"study_design_scores_gemma":[0.00001636565,0.0000074137433,0.00037002368,0.0000182802,0.0000055806727,0.00013362114,0.00018788927,0.0050764005,0.0010871463,0.98859173,0.004497592,0.000007953361],"about_ca_topic_score_codex":0.00084999285,"about_ca_topic_score_gemma":0.0015187777,"teacher_disagreement_score":0.013749328,"about_ca_system_score_codex":0.00086237525,"about_ca_system_score_gemma":0.00040238223,"threshold_uncertainty_score":0.04599607},"labels":[],"label_agreement":null},{"id":"W2406758234","doi":"","title":"On b-coloring of cartesian product of graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Combinatorics; Mathematics; Chromatic scale; Brooks' theorem; Complete coloring; Vertex (graph theory); Graph coloring; Graph; Fractional coloring; Edge coloring; Discrete mathematics; Product (mathematics); Graph power; 1-planar graph; Chordal graph; Line graph; Geometry","score_opus":0.014121446160679224,"score_gpt":0.2284767205718585,"score_spread":0.21435527441117927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406758234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40405822,0.008483126,0.46619907,0.0020049487,0.000559948,0.00016188492,0.00092072965,0.00036851125,0.117243655],"genre_scores_gemma":[0.81933963,0.0046257684,0.1536403,0.0006614822,0.00063957204,0.0002635197,0.0009031126,0.00026289045,0.01966368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985446,0.0005265265,0.00006944468,0.00038545404,0.00025521786,0.00021885954],"domain_scores_gemma":[0.99462056,0.003090158,0.0007027589,0.00053051405,0.00052308466,0.00053288357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019324237,0.0009280284,0.0007032868,0.002603781,0.001978435,0.0022651388,0.00082269084,0.0010319238,0.005998186],"category_scores_gemma":[0.0052719587,0.00065524934,0.00085186266,0.0032016584,0.0041140337,0.006469494,0.002559988,0.001832036,0.00095021375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007047511,0.000021518284,0.0010339598,0.00008391608,0.00001240512,0.000081131904,0.00038746156,0.0030309898,0.0011583247,0.98074645,0.002521518,0.010851877],"study_design_scores_gemma":[0.000021141028,0.00007194393,0.0009621246,0.000052432046,0.000019268613,0.0004983456,0.00021597232,0.014537315,0.0010396616,0.96464634,0.01790936,0.000025986481],"about_ca_topic_score_codex":0.002038201,"about_ca_topic_score_gemma":0.0014041857,"teacher_disagreement_score":0.005998186,"about_ca_system_score_codex":0.0017558184,"about_ca_system_score_gemma":0.000585538,"threshold_uncertainty_score":0.020065963},"labels":[],"label_agreement":null},{"id":"W2406758422","doi":"","title":"Global Defensive Alliances in the Join, Corona and Composition of Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Join (topology); Mathematics; Composition (language); Corona (planetary geology); Combinatorics; Astrobiology; Art; Physics","score_opus":0.014566551260108097,"score_gpt":0.24126506585155755,"score_spread":0.22669851459144946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406758422","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46528137,0.0020391757,0.32240224,0.005387355,0.0002637376,0.00019692289,0.00078387046,0.00058147794,0.20306383],"genre_scores_gemma":[0.91043836,0.000831392,0.05773724,0.0004126863,0.0001683312,0.00013530218,0.00058199256,0.00012276933,0.029571928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986387,0.0005037132,0.00006970158,0.0003382943,0.00019986232,0.0002497848],"domain_scores_gemma":[0.99418384,0.002876737,0.0007403801,0.00088566524,0.00031015975,0.0010032965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015882849,0.00039876142,0.00087266933,0.0011174089,0.0033284875,0.004377425,0.0010865342,0.0018493773,0.010187783],"category_scores_gemma":[0.006276843,0.0005094888,0.000856535,0.0015662316,0.0031467376,0.011385713,0.0034416607,0.0025404212,0.0011530909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040974017,0.000021283695,0.00045692324,0.00003686074,0.000009023246,0.00005053896,0.00027612437,0.0017932525,0.00042438047,0.9885232,0.0018724928,0.006494858],"study_design_scores_gemma":[0.0000229994,0.00001849854,0.0004734057,0.000031055926,0.000024929375,0.00018505925,0.00059439143,0.009469907,0.0006307103,0.9784815,0.010054884,0.000012478015],"about_ca_topic_score_codex":0.0010764786,"about_ca_topic_score_gemma":0.0019476413,"teacher_disagreement_score":0.010187783,"about_ca_system_score_codex":0.0013772275,"about_ca_system_score_gemma":0.0008334094,"threshold_uncertainty_score":0.03408152},"labels":[],"label_agreement":null},{"id":"W2406826233","doi":"","title":"Further Results On Super Edge-Magic Deficiency Of Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; MAGIC (telescope); Enhanced Data Rates for GSM Evolution; Combinatorics; Astrophysics; Computer science; Artificial intelligence; Physics","score_opus":0.02431516721843813,"score_gpt":0.22228861468510125,"score_spread":0.19797344746666312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406826233","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27126145,0.0065255803,0.24638848,0.017132089,0.0012108056,0.00012563489,0.0024231107,0.0010531773,0.45387968],"genre_scores_gemma":[0.8883048,0.0033117633,0.06784911,0.0033427742,0.00078485854,0.00011773849,0.0022852113,0.00033264695,0.03367097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992034,0.00020956036,0.0000346737,0.00016684743,0.00023089923,0.00015473232],"domain_scores_gemma":[0.9941947,0.0036257524,0.00034976093,0.00079961115,0.00049991073,0.0005303076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012944057,0.0007942663,0.0008879035,0.002145984,0.0013095152,0.0023557586,0.0013940366,0.0013322117,0.022527631],"category_scores_gemma":[0.0071676495,0.00047873653,0.00074922974,0.0024974141,0.0022578225,0.007593488,0.0025563377,0.0039005948,0.0019486127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001655874,0.00008411807,0.0017992238,0.00027503847,0.000020089981,0.00014469672,0.000285237,0.0031804394,0.002479363,0.94960356,0.01789871,0.024063954],"study_design_scores_gemma":[0.000023425764,0.000020293775,0.0007190368,0.000045845918,0.000017356233,0.00025787728,0.00015628492,0.0070395456,0.0010164874,0.97763515,0.013055057,0.000013639963],"about_ca_topic_score_codex":0.0013510598,"about_ca_topic_score_gemma":0.0018033509,"teacher_disagreement_score":0.022527631,"about_ca_system_score_codex":0.0012587694,"about_ca_system_score_gemma":0.0007141896,"threshold_uncertainty_score":0.075362444},"labels":[],"label_agreement":null},{"id":"W2407092834","doi":"","title":"L(j, k)-Labelings and L(j, k)-Edge-Labelings of Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Computer science; Artificial intelligence","score_opus":0.012016427333859747,"score_gpt":0.2242686751119269,"score_spread":0.21225224777806717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407092834","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46170616,0.0035159888,0.27229163,0.01147305,0.000829061,0.00017374476,0.0062328926,0.001182003,0.24259546],"genre_scores_gemma":[0.8712168,0.0013083662,0.08963902,0.0015549537,0.00044322998,0.00018150701,0.003240485,0.00032761807,0.032087967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832433,0.0005014963,0.00012792624,0.00043615507,0.00022222588,0.0003879338],"domain_scores_gemma":[0.9929792,0.00354898,0.0010090313,0.001025039,0.00054982357,0.00088786456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011355462,0.0005343128,0.00057485385,0.0017116944,0.0026953006,0.0043264236,0.0014554011,0.0020269367,0.012144835],"category_scores_gemma":[0.006833877,0.00067497935,0.0010100112,0.0021520334,0.003099246,0.007200834,0.0027011351,0.0027937747,0.0019398116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014151438,0.000050144296,0.0016157436,0.000118387055,0.000017918488,0.000105012026,0.0003576028,0.0015806814,0.0014619826,0.96981066,0.009367233,0.0153731],"study_design_scores_gemma":[0.000022493407,0.000015556601,0.00090881373,0.000041586427,0.000017185923,0.00030380063,0.00025002594,0.0050295983,0.0010740255,0.9810637,0.011251661,0.000021467476],"about_ca_topic_score_codex":0.0016285643,"about_ca_topic_score_gemma":0.0021221833,"teacher_disagreement_score":0.012144835,"about_ca_system_score_codex":0.00185552,"about_ca_system_score_gemma":0.0008393211,"threshold_uncertainty_score":0.040628493},"labels":[],"label_agreement":null},{"id":"W2407239930","doi":"","title":"On Mean Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.009171224263642476,"score_gpt":0.21356839097634212,"score_spread":0.20439716671269964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407239930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10239676,0.014121348,0.4406387,0.017613659,0.0023006268,0.00012537169,0.0030628925,0.0015110818,0.41822955],"genre_scores_gemma":[0.6971059,0.009653577,0.12832254,0.0058082566,0.0042195907,0.00046998868,0.004798902,0.0012933142,0.14832805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908304,0.00026955793,0.000037806836,0.00024941738,0.00022389677,0.00013626053],"domain_scores_gemma":[0.99614775,0.0019095222,0.0003084616,0.00080948346,0.0004303187,0.00039435877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010424986,0.0008842217,0.001302204,0.0031542177,0.0024728982,0.0031302806,0.0016045368,0.0019946443,0.02110819],"category_scores_gemma":[0.0067607383,0.00062542956,0.0011248715,0.0027772868,0.0023564515,0.007252237,0.0031365468,0.0044254926,0.004200843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023527606,0.00002217151,0.00037726903,0.00007199948,0.000016360973,0.000025255595,0.00009881093,0.0012047909,0.00025918786,0.96313816,0.017397052,0.017365392],"study_design_scores_gemma":[0.0000052523474,0.0000047811727,0.0002589398,0.000020244766,0.000008909128,0.000053639174,0.000046233377,0.003996424,0.00012198822,0.9855854,0.00989254,0.000005562593],"about_ca_topic_score_codex":0.001507544,"about_ca_topic_score_gemma":0.0029841284,"teacher_disagreement_score":0.02110819,"about_ca_system_score_codex":0.0022130674,"about_ca_system_score_gemma":0.0007226411,"threshold_uncertainty_score":0.07061392},"labels":[],"label_agreement":null},{"id":"W2407401919","doi":"","title":"On edge cover coloring of join graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Join (topology); Mathematics; Enhanced Data Rates for GSM Evolution; Edge coloring; Cover (algebra); Combinatorics; Graph; Computer science; Line graph; Artificial intelligence","score_opus":0.024780045162280693,"score_gpt":0.2188419330595564,"score_spread":0.19406188789727571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407401919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27627927,0.0046814885,0.4633161,0.008936386,0.0010856873,0.0002664108,0.0025874726,0.0012596127,0.24158753],"genre_scores_gemma":[0.76923394,0.0039325543,0.15456893,0.0019571942,0.0014241546,0.00031726918,0.0037572214,0.0007921694,0.06401644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987344,0.00042495658,0.000042310123,0.00023218298,0.0002602179,0.00030591505],"domain_scores_gemma":[0.9946138,0.0035398896,0.0003347389,0.0007618553,0.00030348948,0.00044618742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011594744,0.00078019046,0.0009597181,0.0017034424,0.002372501,0.0030740383,0.0016747748,0.0015977923,0.013940888],"category_scores_gemma":[0.006017398,0.0006595009,0.0008364437,0.0026057332,0.0021631327,0.0076660058,0.0027963533,0.002741432,0.002062671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018315128,0.00014682805,0.001366889,0.00020586753,0.000036886646,0.000115551506,0.00034474974,0.01412105,0.0016742116,0.9122938,0.029473787,0.04003714],"study_design_scores_gemma":[0.000036078483,0.00003178994,0.0007705546,0.0000523537,0.000026554548,0.00018581649,0.00027775808,0.03800679,0.0011626774,0.94365555,0.015775885,0.000018098719],"about_ca_topic_score_codex":0.002757335,"about_ca_topic_score_gemma":0.004116086,"teacher_disagreement_score":0.013940888,"about_ca_system_score_codex":0.0023234854,"about_ca_system_score_gemma":0.001000634,"threshold_uncertainty_score":0.04663694},"labels":[],"label_agreement":null},{"id":"W2407529045","doi":"","title":"On Balance Index Sets of Rooted Trees.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Vertex (graph theory); Combinatorics; Balance (ability); Graph; Tree (set theory); Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.008650949077141224,"score_gpt":0.22895129333622213,"score_spread":0.2203003442590809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407529045","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48874325,0.0015890851,0.44467866,0.0005799581,0.000092099486,0.00016347016,0.0021861354,0.0003887471,0.061578695],"genre_scores_gemma":[0.8508138,0.0010500802,0.1366678,0.00029028545,0.00024575897,0.00038921356,0.002575413,0.0002778702,0.0076898625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849474,0.0002669504,0.00010346207,0.00029507268,0.00059170893,0.00024803833],"domain_scores_gemma":[0.99324507,0.0046278895,0.00079756626,0.0005145175,0.0003852742,0.00042968066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016812419,0.0007428154,0.00092829554,0.0044903113,0.0022941849,0.0027530354,0.0011892539,0.0008442554,0.004231714],"category_scores_gemma":[0.009175057,0.00074316125,0.00084689044,0.0032112922,0.0024306828,0.0049761673,0.002655502,0.001513408,0.00076827605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027047255,0.000118874916,0.0048489426,0.00013761171,0.00003256598,0.00018770836,0.0009843961,0.01676589,0.010068229,0.9070045,0.0031426752,0.056438185],"study_design_scores_gemma":[0.00002633397,0.000045116238,0.0022353102,0.00006718435,0.000020886251,0.0003726853,0.00023799665,0.035935346,0.0053044083,0.9494015,0.0063196644,0.000033570668],"about_ca_topic_score_codex":0.0009563003,"about_ca_topic_score_gemma":0.00093607185,"teacher_disagreement_score":0.0044903113,"about_ca_system_score_codex":0.0021390375,"about_ca_system_score_gemma":0.00046059382,"threshold_uncertainty_score":0.015519857},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9279209,0.0047082016,0.03434853,0.0028891168,0.000119884695,0.0000441944,0.001542873,0.0001890099,0.028237231],"genre_scores_gemma":[0.9765335,0.0013608219,0.016622864,0.00024042944,0.00013879681,0.000056349923,0.0007330299,0.00006752286,0.0042468016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990884,0.00020034438,0.00006501817,0.00024919948,0.00017272808,0.00022427963],"domain_scores_gemma":[0.99162287,0.005748266,0.0012138342,0.00047252525,0.00044101066,0.00050146854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007788801,0.00040170268,0.00062340434,0.0019469489,0.0015694301,0.002148843,0.0011507439,0.0011270778,0.004301362],"category_scores_gemma":[0.00653579,0.00048340674,0.00042007116,0.002145599,0.001759317,0.0032751502,0.0012756239,0.0007464454,0.000282344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011004534,0.0002429932,0.03173176,0.0015195311,0.00020918208,0.00070951186,0.001572696,0.11018928,0.02000279,0.7022243,0.017486308,0.113011144],"study_design_scores_gemma":[0.00007443594,0.0001560013,0.0101166535,0.00017612478,0.00009357441,0.001303868,0.0013146573,0.10552183,0.0074518058,0.854292,0.019393139,0.000106042695],"about_ca_topic_score_codex":0.0022061623,"about_ca_topic_score_gemma":0.0034402905,"teacher_disagreement_score":0.004301362,"about_ca_system_score_codex":0.0017019276,"about_ca_system_score_gemma":0.0006319932,"threshold_uncertainty_score":0.014389515},"labels":[],"label_agreement":null},{"id":"W2407581734","doi":"","title":"On Prime Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Prime (order theory); Combinatorics","score_opus":0.012789955418397708,"score_gpt":0.22931111650859382,"score_spread":0.21652116109019612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407581734","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088212624,0.013213052,0.18516682,0.014492754,0.0022335695,0.00011567771,0.0022128678,0.0010031002,0.69334954],"genre_scores_gemma":[0.7131992,0.0096152,0.07346234,0.003990706,0.0029933266,0.0002604596,0.003229471,0.0007304694,0.19251886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991841,0.00022764396,0.000031710402,0.00022005841,0.0001985205,0.00013798181],"domain_scores_gemma":[0.9980533,0.00096420967,0.00016065486,0.00041345393,0.0001740994,0.00023435189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007857037,0.0007722883,0.00096170756,0.0023583656,0.0021303338,0.003211385,0.0010197777,0.0012022342,0.023214264],"category_scores_gemma":[0.0032284078,0.00053421146,0.00078946643,0.0024791297,0.0023441268,0.006786161,0.0031511858,0.003542246,0.0046210946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025402398,0.000021910602,0.00029451045,0.00007232344,0.000008748729,0.000031688534,0.00011539279,0.0007020402,0.0002920539,0.9618783,0.017815106,0.018742595],"study_design_scores_gemma":[0.0000064056558,0.0000058169067,0.00020907063,0.000023180783,0.000006833823,0.0001004383,0.00006134771,0.002085832,0.0002332585,0.9774361,0.019826602,0.0000051718043],"about_ca_topic_score_codex":0.0009488988,"about_ca_topic_score_gemma":0.0016440089,"teacher_disagreement_score":0.023214264,"about_ca_system_score_codex":0.0019797366,"about_ca_system_score_gemma":0.0006247397,"threshold_uncertainty_score":0.07765943},"labels":[],"label_agreement":null},{"id":"W2407603576","doi":"","title":"On Oriented Graphs with Certain Extension Properties.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Extension (predicate logic); Computer science; Programming language","score_opus":0.02385744119622255,"score_gpt":0.21961450156388734,"score_spread":0.1957570603676648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407603576","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5481647,0.0016934577,0.23695442,0.004177061,0.00026089692,0.00010957612,0.0013783623,0.0005339236,0.20672753],"genre_scores_gemma":[0.92489195,0.0013641894,0.050066683,0.00086167105,0.0004062974,0.0001453378,0.0014324026,0.00019351605,0.020637859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990299,0.00032634847,0.000056971112,0.00023132107,0.0001604253,0.00019507368],"domain_scores_gemma":[0.99426985,0.0034223686,0.000650997,0.00072512473,0.00033382117,0.00059798895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012689922,0.00047812267,0.0005915806,0.0017097741,0.0017560465,0.0029106182,0.00095018797,0.0011503883,0.007012971],"category_scores_gemma":[0.00535769,0.00046096474,0.00070033193,0.002150762,0.0026404131,0.0076561267,0.002486615,0.0020662302,0.0009629797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053371095,0.000045967798,0.0010259714,0.00006391742,0.000008386348,0.00010850398,0.00021266913,0.0017248928,0.00073770666,0.98135847,0.0035075368,0.011152619],"study_design_scores_gemma":[0.00001758817,0.00001264412,0.0006345987,0.000034149547,0.000011132715,0.00027394367,0.00022631533,0.0060861637,0.0005487599,0.9857875,0.0063565997,0.00001058505],"about_ca_topic_score_codex":0.0007964248,"about_ca_topic_score_gemma":0.0010845409,"teacher_disagreement_score":0.007012971,"about_ca_system_score_codex":0.0010946414,"about_ca_system_score_gemma":0.00051214633,"threshold_uncertainty_score":0.023460686},"labels":[],"label_agreement":null},{"id":"W2407621886","doi":"","title":"The Independence Number of the Cartesian Product of Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Independence (probability theory); Independence number; Product (mathematics); Combinatorics; Discrete mathematics; Arithmetic; Statistics; Geometry; Graph","score_opus":0.014823919605706953,"score_gpt":0.22128805892366804,"score_spread":0.2064641393179611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407621886","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49174032,0.00366282,0.18317874,0.0059982855,0.00056381547,0.00009248424,0.0037329616,0.0005262304,0.31050435],"genre_scores_gemma":[0.9534357,0.0011693585,0.023415491,0.0003521549,0.0004442943,0.00009845164,0.0015802984,0.00018916067,0.019315124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854267,0.00043122208,0.00008013275,0.0003849965,0.0003239226,0.0002370698],"domain_scores_gemma":[0.990262,0.0065703783,0.00078801805,0.0009793136,0.00056480675,0.0008355155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013525918,0.0004946971,0.0007277338,0.0022324095,0.0018751866,0.003631101,0.0011295581,0.0010523875,0.0118665155],"category_scores_gemma":[0.009299784,0.00081764255,0.00064247206,0.0020662055,0.0034764544,0.007200759,0.0019602636,0.0029214865,0.0016351856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001355555,0.000035624227,0.0016025017,0.00010663765,0.000019575944,0.000045680157,0.00022421737,0.002386389,0.0010792337,0.971475,0.008701114,0.014188391],"study_design_scores_gemma":[0.000022144191,0.000022132073,0.0018876536,0.000033681787,0.00002471178,0.00022770718,0.00010219517,0.0111652585,0.0016922294,0.97513753,0.009663537,0.000021221233],"about_ca_topic_score_codex":0.0012293602,"about_ca_topic_score_gemma":0.0013690771,"teacher_disagreement_score":0.0118665155,"about_ca_system_score_codex":0.0014150876,"about_ca_system_score_gemma":0.00082872837,"threshold_uncertainty_score":0.03969741},"labels":[],"label_agreement":null},{"id":"W2407850864","doi":"","title":"On Cliques and Forcing m-Convexity Numbers of Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Convexity; Forcing (mathematics); Combinatorics; Mathematical analysis; Economics","score_opus":0.013092285066528236,"score_gpt":0.23910913531164196,"score_spread":0.22601685024511373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407850864","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4286749,0.0049943277,0.28143358,0.018623512,0.0007883909,0.00019750357,0.0025689234,0.00063316553,0.26208562],"genre_scores_gemma":[0.92979336,0.0016581641,0.045374062,0.0013487715,0.0008167099,0.00030553836,0.0010817492,0.00020176159,0.019419936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983512,0.00061165687,0.0000756002,0.00033194086,0.00029900545,0.0003306783],"domain_scores_gemma":[0.98436487,0.0119864885,0.0008549797,0.0010933599,0.00054750306,0.0011527387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024762766,0.000685203,0.0010918046,0.002374086,0.0036104734,0.0041214605,0.0017819029,0.0019142376,0.011606373],"category_scores_gemma":[0.0124201635,0.00094531005,0.001205565,0.0023822677,0.0060186447,0.010943514,0.0036195524,0.0047573936,0.0010736121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000635044,0.00003303834,0.0007330226,0.00006635539,0.000011730229,0.000038919545,0.00013039829,0.003401044,0.0005108601,0.9846192,0.005236146,0.005155894],"study_design_scores_gemma":[0.000023651526,0.000014297682,0.00091207685,0.00003436253,0.000011697909,0.00007748628,0.0001482419,0.011381114,0.00043531222,0.9832388,0.0037039437,0.000019054043],"about_ca_topic_score_codex":0.0030357651,"about_ca_topic_score_gemma":0.004789466,"teacher_disagreement_score":0.011606373,"about_ca_system_score_codex":0.0032466117,"about_ca_system_score_gemma":0.0013333198,"threshold_uncertainty_score":0.03882718},"labels":[],"label_agreement":null},{"id":"W2407870741","doi":"","title":"Chromatic Uniqueness of Complete Bipartite Graphs With Certain Edges Deleted.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Uniqueness; Chromatic scale; Combinatorics; Foster graph; Discrete mathematics; Graph; Mathematical analysis; Line graph; Voltage graph","score_opus":0.030791085862214265,"score_gpt":0.21710684521645315,"score_spread":0.18631575935423889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407870741","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83177125,0.00072412024,0.10236797,0.0022306198,0.00017681862,0.00010400242,0.0014990317,0.00026953136,0.060856655],"genre_scores_gemma":[0.9571817,0.0003432264,0.027814114,0.00032525288,0.000112357775,0.00009585919,0.0011876551,0.0001536465,0.012786305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992964,0.0002539234,0.000028625347,0.00018100422,0.00008379889,0.00015626293],"domain_scores_gemma":[0.9957052,0.002471842,0.0005219121,0.00051102054,0.00031875868,0.00047130874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011420932,0.00039534087,0.0005781077,0.001490331,0.0027683673,0.002680143,0.0016343085,0.0015410336,0.008380323],"category_scores_gemma":[0.005942235,0.00069346733,0.00065616827,0.0013440787,0.0022908289,0.0038905037,0.0015850373,0.0017826002,0.0007762744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003798991,0.00007150554,0.0039359513,0.00014136282,0.00003522099,0.00018736892,0.0004706718,0.009681092,0.004747677,0.95882136,0.008667561,0.01286033],"study_design_scores_gemma":[0.00009121133,0.000056358007,0.0036522185,0.000056682817,0.00005818233,0.00051886885,0.0007675317,0.045982946,0.0054756324,0.9340732,0.00920923,0.000057853948],"about_ca_topic_score_codex":0.002463321,"about_ca_topic_score_gemma":0.003178624,"teacher_disagreement_score":0.008380323,"about_ca_system_score_codex":0.0016399232,"about_ca_system_score_gemma":0.0010575162,"threshold_uncertainty_score":0.028034985},"labels":[],"label_agreement":null},{"id":"W2407900408","doi":"","title":"Toughness and Existence of Fractional (g, f)-factors in Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Toughness; Composite material; Materials science","score_opus":0.014090947025186651,"score_gpt":0.2377869134994423,"score_spread":0.22369596647425566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407900408","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78615576,0.0013814445,0.1406166,0.0031470885,0.0002299635,0.000082649116,0.0010603874,0.00050336827,0.0668228],"genre_scores_gemma":[0.96907985,0.0003198312,0.02199274,0.0002511821,0.00013185303,0.00007178289,0.0004451723,0.00009369113,0.007613985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869627,0.0003006769,0.00007720865,0.000377477,0.00020582967,0.00034251448],"domain_scores_gemma":[0.99097997,0.0053823073,0.0010381107,0.0008421504,0.00043834027,0.0013189785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011641219,0.0005890137,0.00085298065,0.0023453783,0.0036203607,0.004376621,0.0012473869,0.00163043,0.0105754165],"category_scores_gemma":[0.009768486,0.00081214326,0.0009937297,0.0017402454,0.0044390685,0.006852505,0.0027298827,0.0020263745,0.0008194958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021409626,0.00005411689,0.0023336317,0.00010088271,0.00002398456,0.00014292316,0.0006548997,0.003307022,0.002466638,0.9768718,0.0040657204,0.009764329],"study_design_scores_gemma":[0.000031788197,0.00002356329,0.001169427,0.000041322968,0.000023653147,0.00028493957,0.00045587675,0.009877463,0.0012899699,0.98208964,0.0046822764,0.000030098383],"about_ca_topic_score_codex":0.0027326036,"about_ca_topic_score_gemma":0.0025016502,"teacher_disagreement_score":0.0105754165,"about_ca_system_score_codex":0.0017334957,"about_ca_system_score_gemma":0.0006713166,"threshold_uncertainty_score":0.035378277},"labels":[],"label_agreement":null},{"id":"W2407922042","doi":"","title":"Further results on super edge magic deficiency of unicyclic graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; MAGIC (telescope); Enhanced Data Rates for GSM Evolution; Combinatorics; Astrophysics; Artificial intelligence; Computer science; Physics","score_opus":0.026578258816374763,"score_gpt":0.22588227168264205,"score_spread":0.19930401286626728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407922042","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38035947,0.0070273136,0.15467703,0.013046869,0.0010886965,0.0001244147,0.0021577396,0.0008606753,0.44065776],"genre_scores_gemma":[0.93141824,0.0031648995,0.03673428,0.0020695326,0.00057247415,0.00008905114,0.0018281179,0.00019670639,0.023926724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993772,0.00014335265,0.000028504632,0.00013515652,0.00018157541,0.00013429427],"domain_scores_gemma":[0.99513334,0.0030429866,0.00034696332,0.00064844126,0.00038000895,0.00044828613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008507209,0.00069988024,0.00080446264,0.0019485534,0.0011937892,0.002119955,0.0012364485,0.001085391,0.01935894],"category_scores_gemma":[0.005923191,0.0004200305,0.0005460258,0.0025880323,0.0018559952,0.005420261,0.0023822824,0.0030207653,0.0014671673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002522487,0.000104681436,0.002263519,0.00042249728,0.000024821467,0.00022182986,0.000364657,0.0046900534,0.004584291,0.9297837,0.01958744,0.037700452],"study_design_scores_gemma":[0.000036478228,0.00003409955,0.001054165,0.00006831409,0.000025080422,0.0004250917,0.00024555303,0.009762853,0.0018868907,0.9691417,0.017300442,0.00001933977],"about_ca_topic_score_codex":0.0012651471,"about_ca_topic_score_gemma":0.0017222312,"teacher_disagreement_score":0.01935894,"about_ca_system_score_codex":0.0011343403,"about_ca_system_score_gemma":0.0006356867,"threshold_uncertainty_score":0.064762056},"labels":[],"label_agreement":null},{"id":"W2407942700","doi":"","title":"Adjacent vertex distinguishing edge-coloring of planar graphs with girth at least five.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Girth (graph theory); Vertex (graph theory); Combinatorics; Planar graph; Enhanced Data Rates for GSM Evolution; Planar; Edge coloring; Graph; Computer science; Telecommunications; Line graph","score_opus":0.00910409737301284,"score_gpt":0.19796429761199413,"score_spread":0.18886020023898129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407942700","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7725292,0.0011615789,0.1298135,0.002339494,0.00028212674,0.00014107754,0.0023184514,0.000821274,0.09059316],"genre_scores_gemma":[0.9368303,0.00035742178,0.051372845,0.00030019044,0.0000787878,0.000056731085,0.0019288108,0.00012465476,0.008950232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991536,0.00023899968,0.000050652794,0.00018101805,0.00012960845,0.00024616084],"domain_scores_gemma":[0.995507,0.0027688898,0.00047290447,0.0006407434,0.00022778186,0.0003826948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070042006,0.00051980384,0.0005824449,0.0009967639,0.001493401,0.002285025,0.0015712813,0.0010754659,0.0059305406],"category_scores_gemma":[0.004149423,0.00049782643,0.00060446706,0.0015258619,0.0013649917,0.0024987806,0.0018498509,0.0016560962,0.000708631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085938594,0.0003121787,0.0075955335,0.0004521005,0.000073288924,0.00045051667,0.0006142126,0.03219703,0.0112479,0.8443279,0.023217207,0.07865268],"study_design_scores_gemma":[0.00010018555,0.00009933701,0.0033924822,0.00006422879,0.000071219925,0.00064999255,0.0006461517,0.0583674,0.007219758,0.91540706,0.013939033,0.00004319756],"about_ca_topic_score_codex":0.0021915827,"about_ca_topic_score_gemma":0.0031820568,"teacher_disagreement_score":0.0059305406,"about_ca_system_score_codex":0.0013949873,"about_ca_system_score_gemma":0.000946612,"threshold_uncertainty_score":0.019839644},"labels":[],"label_agreement":null},{"id":"W2408032326","doi":"","title":"A study on the chaotic numbers of graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chaotic; Computer science; Artificial intelligence","score_opus":0.0193211483478812,"score_gpt":0.24495170933397864,"score_spread":0.22563056098609743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408032326","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6420327,0.006055447,0.106563665,0.004783991,0.00057636754,0.00008908794,0.0006267267,0.00019634131,0.23907565],"genre_scores_gemma":[0.9767551,0.0016244913,0.010360799,0.00020969287,0.00021475115,0.000053279644,0.00018048799,0.00005640013,0.010545166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966705,0.00011634221,0.00001300433,0.00006037413,0.00007800686,0.000065253545],"domain_scores_gemma":[0.99712676,0.0018621663,0.00030775557,0.0002811314,0.00017773634,0.00024450335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004549406,0.00027445023,0.0003733535,0.0014193957,0.0012011004,0.0018651213,0.00060690753,0.0006347894,0.005092418],"category_scores_gemma":[0.004763044,0.0001966578,0.00036479277,0.0013892475,0.0019733245,0.0030345672,0.0011832037,0.0010393121,0.00038628926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026117841,0.000012364238,0.000862991,0.000048925023,0.0000045087468,0.000038222915,0.00016617897,0.003152532,0.0006221406,0.9886126,0.0018057473,0.004647686],"study_design_scores_gemma":[0.000016225218,0.000032777403,0.0015281071,0.000043975477,0.000011569935,0.00024285672,0.00030120046,0.025397193,0.0011513152,0.95846605,0.012792081,0.000016537866],"about_ca_topic_score_codex":0.00089907757,"about_ca_topic_score_gemma":0.00087422645,"teacher_disagreement_score":0.005092418,"about_ca_system_score_codex":0.0012787586,"about_ca_system_score_gemma":0.00051931274,"threshold_uncertainty_score":0.017035842},"labels":[],"label_agreement":null},{"id":"W2408059908","doi":"","title":"Note on the choosability of bipartite graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Discrete mathematics; Graph","score_opus":0.011782587158340381,"score_gpt":0.2348878012915454,"score_spread":0.22310521413320503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408059908","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060848475,0.01754349,0.27789712,0.03546676,0.008484235,0.00013713796,0.0020567058,0.0009888248,0.5965772],"genre_scores_gemma":[0.7762137,0.02369442,0.1015495,0.011020448,0.011911747,0.00026623308,0.002137598,0.0006131931,0.07259321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998992,0.00024795084,0.00004234401,0.00028144062,0.0003084739,0.00012778018],"domain_scores_gemma":[0.99162614,0.006717081,0.00020462861,0.00080305204,0.0002464054,0.00040271424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012821698,0.00089026784,0.0009454376,0.0015409632,0.0013790821,0.0024341238,0.0016208667,0.0013184614,0.01835794],"category_scores_gemma":[0.0065794257,0.0006066276,0.0009240223,0.002174183,0.0042593754,0.005049418,0.0029859843,0.005101943,0.0019323922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010753233,0.000056844554,0.0006943929,0.00029055311,0.00003305074,0.00029015407,0.00015589845,0.0025294537,0.0022960554,0.93732196,0.035812605,0.020411449],"study_design_scores_gemma":[0.000021255479,0.000032676962,0.00074934296,0.0000401202,0.000023431834,0.0002952274,0.00006631878,0.0038499916,0.00093129074,0.96424925,0.029720005,0.000021151342],"about_ca_topic_score_codex":0.0024145436,"about_ca_topic_score_gemma":0.0032406037,"teacher_disagreement_score":0.01835794,"about_ca_system_score_codex":0.0014133098,"about_ca_system_score_gemma":0.0006961318,"threshold_uncertainty_score":0.061413407},"labels":[],"label_agreement":null},{"id":"W2408124517","doi":"","title":"(d, 1)-Total labellings of regular nonbipartite graphs and an application to flower snarks.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.00617550334832843,"score_gpt":0.2297922704067854,"score_spread":0.22361676705845698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408124517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35262853,0.0011379003,0.48310226,0.002420837,0.00045051874,0.00025883873,0.0023862757,0.0018049326,0.15580995],"genre_scores_gemma":[0.7427171,0.0008005623,0.21959259,0.00073422684,0.00021815741,0.0002605873,0.002131839,0.00055623084,0.032988794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992267,0.0002912018,0.00005023871,0.00017538277,0.00013262202,0.0001238727],"domain_scores_gemma":[0.9966523,0.0018539868,0.00034416319,0.0005327036,0.00027765054,0.00033919018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011416477,0.0004738961,0.00066838186,0.0015690738,0.0021415509,0.0031187774,0.0015230798,0.0015372063,0.008648126],"category_scores_gemma":[0.005532779,0.0006267244,0.0011941718,0.0022127314,0.001782405,0.0030214577,0.0021971788,0.0017260178,0.0009277044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009459686,0.000044534474,0.0006724764,0.00012228488,0.000015148479,0.00008086215,0.00021362098,0.006139182,0.0013395657,0.9610856,0.007655919,0.0225361],"study_design_scores_gemma":[0.000029871473,0.000023296407,0.0003800029,0.000036501417,0.000018189467,0.00016118288,0.00013721864,0.02802569,0.0010379694,0.9630042,0.007125581,0.000020297815],"about_ca_topic_score_codex":0.0026234204,"about_ca_topic_score_gemma":0.004520799,"teacher_disagreement_score":0.008648126,"about_ca_system_score_codex":0.0020981699,"about_ca_system_score_gemma":0.0007818435,"threshold_uncertainty_score":0.028930843},"labels":[],"label_agreement":null},{"id":"W2408144770","doi":"","title":"A Note on Edge Coloring of Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Edge coloring; Enhanced Data Rates for GSM Evolution; Graph coloring; Combinatorics; Graph; Computer science; Artificial intelligence; Line graph","score_opus":0.02661254135441729,"score_gpt":0.2514698320177264,"score_spread":0.2248572906633091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408144770","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011032337,0.04978235,0.34521696,0.08242499,0.06088033,0.0001453112,0.0019407136,0.0019661132,0.44661093],"genre_scores_gemma":[0.22893406,0.07972354,0.42429632,0.05405349,0.0468604,0.0004374479,0.0024133425,0.0023559835,0.16092552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985164,0.0005659116,0.000069715505,0.00032537204,0.00035994453,0.00016265988],"domain_scores_gemma":[0.99275076,0.0053416286,0.00013094489,0.0009387818,0.00046276025,0.0003751625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001983534,0.0012475229,0.0013481664,0.0019488716,0.0026862833,0.0034096602,0.0029907979,0.0021545333,0.01627869],"category_scores_gemma":[0.0069314893,0.00073184015,0.0013555048,0.0036515084,0.004388672,0.008891208,0.0033138462,0.011132071,0.005026098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008499801,0.00007384917,0.00040097738,0.00043221822,0.000032716314,0.00026436232,0.00022777451,0.0020305424,0.0011687261,0.7339058,0.21638247,0.044995464],"study_design_scores_gemma":[0.000012334791,0.000023621391,0.00034712238,0.00010327499,0.000020229316,0.00021964089,0.000118322954,0.0024491884,0.0005509557,0.7922978,0.20383179,0.000025854131],"about_ca_topic_score_codex":0.0047151595,"about_ca_topic_score_gemma":0.008610056,"teacher_disagreement_score":0.01627869,"about_ca_system_score_codex":0.0019666278,"about_ca_system_score_gemma":0.0011795615,"threshold_uncertainty_score":0.054457605},"labels":[],"label_agreement":null},{"id":"W2408260111","doi":"","title":"On L(d, 1)-Labelings of the Cartesian Product of Two Cycles.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Product (mathematics); Cartesian coordinate system; Combinatorics; Geometry","score_opus":0.018703492018346073,"score_gpt":0.2449356037239683,"score_spread":0.22623211170562224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408260111","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40659958,0.002799272,0.35772827,0.005870403,0.0006760402,0.00023657609,0.0040892926,0.0013093795,0.22069116],"genre_scores_gemma":[0.80292124,0.0015168934,0.1443622,0.0017286901,0.00043229805,0.00035793186,0.0034550766,0.0006288841,0.044596884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980438,0.0006794227,0.00013667475,0.00050878496,0.00026649467,0.00036478933],"domain_scores_gemma":[0.9931538,0.004143977,0.00078797224,0.00090679445,0.00045762485,0.00054985075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013211205,0.0007259059,0.00087778305,0.0021602497,0.0030560018,0.0045419144,0.0014442427,0.0019355272,0.014333265],"category_scores_gemma":[0.0072185346,0.0009831355,0.0012374334,0.0027981673,0.0029860127,0.0076811244,0.003728136,0.002817547,0.0025270756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009990861,0.00003526104,0.00066617556,0.00011436241,0.000014118472,0.000094391515,0.00037162047,0.0020134342,0.00085014856,0.9738831,0.007044267,0.014813314],"study_design_scores_gemma":[0.000025146179,0.000014816805,0.00031355437,0.00005209654,0.000013505761,0.00015962658,0.00020832557,0.0053527337,0.0006029629,0.9835623,0.009676612,0.000018418457],"about_ca_topic_score_codex":0.002301128,"about_ca_topic_score_gemma":0.003004267,"teacher_disagreement_score":0.014333265,"about_ca_system_score_codex":0.0026260503,"about_ca_system_score_gemma":0.00092971744,"threshold_uncertainty_score":0.047949612},"labels":[],"label_agreement":null},{"id":"W2408407322","doi":"","title":"Study of Some Problems of Cordial Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.015892154410374695,"score_gpt":0.2388266079978831,"score_spread":0.2229344535875084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408407322","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26104003,0.016764108,0.2380628,0.028293362,0.0015828368,0.0002584382,0.0017475868,0.0006405042,0.45161024],"genre_scores_gemma":[0.80384314,0.00818475,0.101521984,0.0024631538,0.0022704818,0.00025040362,0.0020209746,0.00032686177,0.07911822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916315,0.00031772116,0.000031773066,0.00017113342,0.0001780713,0.00013813915],"domain_scores_gemma":[0.99523586,0.003345138,0.0003223813,0.0003874439,0.00028714017,0.00042214038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011673394,0.0008035937,0.00084579206,0.001960022,0.0021845845,0.0029615515,0.0020022257,0.0018104472,0.015319813],"category_scores_gemma":[0.0090199895,0.00051210145,0.0009853458,0.0023998523,0.0024276427,0.00604666,0.0018949269,0.0038331957,0.0010863588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028860362,0.000057271023,0.00042040247,0.00018154443,0.000013650285,0.00006127063,0.00016971515,0.004085823,0.0003063707,0.9720044,0.011310923,0.011359861],"study_design_scores_gemma":[0.000019021823,0.000017979024,0.0003719321,0.000056140554,0.000013914447,0.0001807803,0.00019688658,0.014309557,0.00045952943,0.96797514,0.016388401,0.000010745383],"about_ca_topic_score_codex":0.002493386,"about_ca_topic_score_gemma":0.0027082453,"teacher_disagreement_score":0.015319813,"about_ca_system_score_codex":0.0027409117,"about_ca_system_score_gemma":0.0011918742,"threshold_uncertainty_score":0.05124992},"labels":[],"label_agreement":null},{"id":"W2408411972","doi":"","title":"L(2, 1)-labeling of flower snark and related graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.006622875648179369,"score_gpt":0.19888039469246988,"score_spread":0.1922575190442905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408411972","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45668384,0.0016613755,0.29777536,0.007238782,0.000589576,0.0002756849,0.0052600238,0.0018495014,0.22866581],"genre_scores_gemma":[0.8078165,0.00070926774,0.14447412,0.0014915138,0.00028034043,0.00023163944,0.0038628308,0.00046714875,0.040666644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919575,0.00026270625,0.000037090274,0.00021504631,0.00011483968,0.00017463531],"domain_scores_gemma":[0.9971077,0.0013653333,0.00037626817,0.0005953736,0.00022498188,0.00033024244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006805491,0.0004950393,0.0007549799,0.001047025,0.0024706468,0.0027852168,0.0016539146,0.0020758573,0.013840511],"category_scores_gemma":[0.003823412,0.00048467625,0.0009071408,0.001570342,0.0016603542,0.004535251,0.0019009265,0.002157001,0.0018296397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020722112,0.00010722292,0.0012101352,0.00019694456,0.000023453422,0.00017334674,0.00027736602,0.008874063,0.0020403543,0.93809146,0.021831302,0.026967123],"study_design_scores_gemma":[0.000042033127,0.000024705736,0.00064640265,0.00003465801,0.000022155797,0.00022616053,0.00021306788,0.023872588,0.0013533322,0.96233714,0.011207509,0.000020411597],"about_ca_topic_score_codex":0.0027518063,"about_ca_topic_score_gemma":0.0045442176,"teacher_disagreement_score":0.013840511,"about_ca_system_score_codex":0.0022904463,"about_ca_system_score_gemma":0.0010347512,"threshold_uncertainty_score":0.046301186},"labels":[],"label_agreement":null},{"id":"W2408539218","doi":"","title":"On the Metric Dimension of Generalized Petersen Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Metric dimension; Dimension (graph theory); Metric (unit); Combinatorics; Graph; Chordal graph; 1-planar graph","score_opus":0.017458354049227087,"score_gpt":0.2315830421515974,"score_spread":0.21412468810237031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408539218","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60248214,0.009616638,0.1870279,0.011504624,0.0008618843,0.00009389896,0.00201635,0.00045620624,0.18594041],"genre_scores_gemma":[0.9604619,0.003082132,0.022394009,0.0006798944,0.0007760656,0.000107699845,0.000789721,0.00013690391,0.011571649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887425,0.00040904924,0.000050075785,0.00021555174,0.00023800906,0.00021298137],"domain_scores_gemma":[0.99475455,0.0032622963,0.00053319935,0.0005372921,0.00034008513,0.0005725893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013206474,0.00065858196,0.00088836893,0.002840395,0.0021295424,0.0031489895,0.0014792623,0.001681117,0.006146327],"category_scores_gemma":[0.007978245,0.0005145712,0.00052779296,0.0027433543,0.0038250922,0.009576285,0.0030570112,0.0026423517,0.00086003524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041452033,0.000023445093,0.00064493873,0.00005949088,0.000013693541,0.00003378915,0.00013542897,0.0029415681,0.00036008348,0.9815671,0.004878664,0.0093004],"study_design_scores_gemma":[0.000008949792,0.000009334773,0.00054530735,0.000020607631,0.000008837917,0.00008211009,0.00012297383,0.009330239,0.00027295089,0.98549044,0.004093863,0.000014344987],"about_ca_topic_score_codex":0.0016606546,"about_ca_topic_score_gemma":0.0017327854,"teacher_disagreement_score":0.006146327,"about_ca_system_score_codex":0.0018291998,"about_ca_system_score_gemma":0.00059776136,"threshold_uncertainty_score":0.020561576},"labels":[],"label_agreement":null},{"id":"W2408557205","doi":"","title":"On antimagic total labeling of some families of graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.007060733959477603,"score_gpt":0.21875937717909333,"score_spread":0.21169864321961573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408557205","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49702924,0.001919007,0.30907577,0.004919737,0.00022318136,0.00015724401,0.0021674691,0.0009407606,0.18356751],"genre_scores_gemma":[0.88047904,0.0013413983,0.08725745,0.00096754223,0.0001979761,0.0002290146,0.002110549,0.00028457708,0.027132463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987412,0.00049365155,0.00006651565,0.00028171603,0.00021220028,0.0002046877],"domain_scores_gemma":[0.9943597,0.0034788938,0.00041567057,0.0008198976,0.00043424297,0.00049167103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014183606,0.00044937799,0.00070251577,0.0018556807,0.0034770672,0.0029944056,0.0012450425,0.0015272588,0.008914008],"category_scores_gemma":[0.006036806,0.00063792855,0.0010397037,0.0024285365,0.0021652675,0.005962629,0.0025454669,0.0018031689,0.0009807686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006757203,0.000033615983,0.0008402204,0.000102502265,0.000015726338,0.00007751672,0.00035430441,0.0025529535,0.0009674715,0.9752373,0.0062151924,0.01353556],"study_design_scores_gemma":[0.00001772459,0.00001945266,0.00063035486,0.00003813229,0.0000250622,0.00023216146,0.00029619547,0.012214772,0.0008027499,0.97685355,0.0088557135,0.000014002597],"about_ca_topic_score_codex":0.002081134,"about_ca_topic_score_gemma":0.0030145939,"teacher_disagreement_score":0.008914008,"about_ca_system_score_codex":0.0024633843,"about_ca_system_score_gemma":0.00089090725,"threshold_uncertainty_score":0.029820263},"labels":[],"label_agreement":null},{"id":"W2408600575","doi":"","title":"On Zero Magic Sums of Integer Magic Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"MAGIC (telescope); Mathematics; Zero (linguistics); Integer (computer science); Combinatorics; Discrete mathematics; Physics; Computer science; Quantum mechanics; Linguistics; Philosophy","score_opus":0.021122100248399042,"score_gpt":0.2384093176482177,"score_spread":0.21728721739981866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408600575","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4672118,0.004695956,0.20320763,0.0048799976,0.0009942764,0.00010268914,0.0013043103,0.0007335377,0.3168698],"genre_scores_gemma":[0.9192035,0.0014579252,0.045424208,0.0009828147,0.00049564295,0.00012254379,0.001040041,0.00028642698,0.030986939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989127,0.00033786555,0.0000621103,0.00022633045,0.00022965578,0.00023120108],"domain_scores_gemma":[0.9957521,0.0027721333,0.00038100805,0.00039229004,0.00027854973,0.00042383047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009901098,0.00073082856,0.00088782696,0.0024420342,0.0022996124,0.0039550806,0.001742297,0.0013026834,0.011187839],"category_scores_gemma":[0.0062424275,0.0006445346,0.0007042875,0.0020181101,0.003593338,0.007514279,0.0034341868,0.002869863,0.001554267],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060628383,0.000024830326,0.00032543816,0.000085381645,0.000008694811,0.000045156314,0.00012063293,0.001777311,0.0005260878,0.98240525,0.0040855696,0.010535056],"study_design_scores_gemma":[0.000010962305,0.0000069604675,0.00013055315,0.000024738003,0.0000075220128,0.00007063195,0.000076557226,0.0040370594,0.0003979972,0.9922078,0.003019442,0.000009712453],"about_ca_topic_score_codex":0.0010356255,"about_ca_topic_score_gemma":0.0019207259,"teacher_disagreement_score":0.011187839,"about_ca_system_score_codex":0.0015509563,"about_ca_system_score_gemma":0.00071880064,"threshold_uncertainty_score":0.037427068},"labels":[],"label_agreement":null},{"id":"W2408690479","doi":"","title":"Total edge irregularity strength of strong product of two paths.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Product (mathematics); Geometry; Computer science; Artificial intelligence","score_opus":0.015521136936981239,"score_gpt":0.24501372391963602,"score_spread":0.2294925869826548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408690479","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83137953,0.0006127364,0.10423265,0.0011206497,0.00017071361,0.00006504862,0.00077068014,0.00026137533,0.061386712],"genre_scores_gemma":[0.9829063,0.0002060683,0.011380417,0.00012065232,0.00008232687,0.000049831353,0.0003086229,0.0000701579,0.0048756693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986432,0.00042183526,0.00007416771,0.0003182088,0.00031797186,0.00022457963],"domain_scores_gemma":[0.9900233,0.005310215,0.0012814198,0.0011577352,0.00097035826,0.0012569146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015598676,0.00045171782,0.00082944264,0.002273107,0.0017704437,0.0026777862,0.0013510855,0.0010958591,0.008709121],"category_scores_gemma":[0.008949172,0.00054722105,0.00061629486,0.0014622756,0.002051178,0.004539339,0.0023246051,0.0016532188,0.0007672438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041265733,0.000072734714,0.005268564,0.00018984907,0.00006154798,0.00031437207,0.00035782778,0.008649303,0.005910838,0.95626414,0.003836048,0.018662121],"study_design_scores_gemma":[0.000051033312,0.000106621934,0.003333668,0.000064537504,0.000097157805,0.00080616004,0.00040587547,0.053153977,0.0051627094,0.93021274,0.006556317,0.000049197566],"about_ca_topic_score_codex":0.0005614311,"about_ca_topic_score_gemma":0.00056237023,"teacher_disagreement_score":0.008709121,"about_ca_system_score_codex":0.00091633026,"about_ca_system_score_gemma":0.000478484,"threshold_uncertainty_score":0.02913493},"labels":[],"label_agreement":null},{"id":"W2408740683","doi":"","title":"Vertex-magic total labeling of the union of suns.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Suns in alchemy; MAGIC (telescope); Vertex (graph theory); Mathematics; Combinatorics; Horticulture; Physics; Biology; Astronomy; Graph","score_opus":0.010776505039238528,"score_gpt":0.21678719601725238,"score_spread":0.20601069097801386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408740683","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.428834,0.0011884957,0.33689922,0.0022600805,0.00043080802,0.00011958972,0.0038899595,0.0014862006,0.2248917],"genre_scores_gemma":[0.82396287,0.0004951982,0.13408075,0.00052977103,0.00013448442,0.00010246609,0.0033620466,0.00047173523,0.03686066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924433,0.00019303542,0.00004401215,0.00020943827,0.00014465408,0.00016464196],"domain_scores_gemma":[0.99804604,0.0007716656,0.0002087861,0.00046986647,0.00023364947,0.00026991864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060477137,0.00042002133,0.00064579817,0.0010568268,0.0022128504,0.0024620933,0.0012540258,0.0009444021,0.013895641],"category_scores_gemma":[0.0027413473,0.00051289744,0.00077193585,0.0016654317,0.0015163119,0.004079529,0.001998459,0.0015326601,0.0016260876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020805642,0.00004673158,0.0010548353,0.00018018701,0.00002666085,0.00009528879,0.00032553103,0.004473852,0.00298012,0.9492655,0.012973335,0.028369965],"study_design_scores_gemma":[0.000036995636,0.000028894066,0.00089837785,0.000047519923,0.00003950963,0.00021901418,0.00034909698,0.017260257,0.0030816179,0.96100074,0.017017929,0.00002006628],"about_ca_topic_score_codex":0.0023316194,"about_ca_topic_score_gemma":0.004612967,"teacher_disagreement_score":0.013895641,"about_ca_system_score_codex":0.0012670923,"about_ca_system_score_gemma":0.0008540892,"threshold_uncertainty_score":0.046485543},"labels":[],"label_agreement":null},{"id":"W2408755481","doi":"","title":"Graceful and Edge-Antimagic Labelings.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Arithmetic; Computer science; Artificial intelligence","score_opus":0.007444644362127632,"score_gpt":0.21950250761011966,"score_spread":0.21205786324799203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408755481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24809861,0.0034350294,0.38821042,0.008953615,0.0007785316,0.00017502092,0.0034110653,0.0019459866,0.3449918],"genre_scores_gemma":[0.84639037,0.0019434578,0.08223046,0.0012329306,0.0005954534,0.00017565448,0.0022871078,0.0004853025,0.06465921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982774,0.00042077564,0.00011982481,0.00044255127,0.0004063014,0.00033314104],"domain_scores_gemma":[0.994514,0.0025949343,0.0005638378,0.0013036701,0.00037642964,0.00064712553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001304767,0.0007454044,0.00078867533,0.0018262698,0.0029429807,0.004623984,0.0016698265,0.0017372676,0.014810121],"category_scores_gemma":[0.0060087484,0.00060170254,0.0011676925,0.0027676444,0.0032925429,0.00766566,0.0035387368,0.002998272,0.0024832461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045712222,0.000025099689,0.00025036946,0.000053983473,0.000008977129,0.000042819032,0.00013607678,0.001552195,0.00051015633,0.9812983,0.0057069133,0.010369271],"study_design_scores_gemma":[0.000009848356,0.000008296241,0.00015147675,0.000015945765,0.000010132198,0.00008639746,0.00008275084,0.0035671531,0.0005044369,0.9859744,0.009578681,0.0000105397585],"about_ca_topic_score_codex":0.0020899542,"about_ca_topic_score_gemma":0.002875283,"teacher_disagreement_score":0.014810121,"about_ca_system_score_codex":0.002363858,"about_ca_system_score_gemma":0.0010844556,"threshold_uncertainty_score":0.04954475},"labels":[],"label_agreement":null},{"id":"W24235330","doi":"10.1684/abc.2013.0901","title":"On Some Parameters Related to Uniquely Vertex-Colourable Graphs and Defining Sets.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Discrete mathematics; Graph","score_opus":0.01075096092046544,"score_gpt":0.22581488685195225,"score_spread":0.21506392593148682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24235330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3785863,0.0053603165,0.5099586,0.006552064,0.0006449422,0.0002842937,0.0041226945,0.0004962437,0.093994595],"genre_scores_gemma":[0.8585761,0.0037132527,0.11416798,0.0010120352,0.00096969836,0.00053368916,0.004022557,0.00031133645,0.016693408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810934,0.0006986439,0.0001192686,0.00047536407,0.0003345162,0.00026293437],"domain_scores_gemma":[0.9851029,0.010394886,0.0017545677,0.0009100398,0.00092587696,0.0009117886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023776612,0.0012221176,0.001212786,0.0046898555,0.002286824,0.0033313278,0.0016862707,0.0021039625,0.009180928],"category_scores_gemma":[0.01239529,0.00060619414,0.0015591877,0.0036089863,0.0036028223,0.005874855,0.0025157041,0.004110698,0.0010402601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063528525,0.000042858,0.0012437706,0.0001358983,0.000028862434,0.000117197036,0.00026195083,0.007039475,0.0005143012,0.9777605,0.0024077229,0.010384037],"study_design_scores_gemma":[0.000014198462,0.000036849367,0.0009597083,0.000043605487,0.000016173224,0.00023913362,0.00010437135,0.017768579,0.00024160286,0.9759556,0.004595242,0.000024965415],"about_ca_topic_score_codex":0.0012453254,"about_ca_topic_score_gemma":0.0011469219,"teacher_disagreement_score":0.009180928,"about_ca_system_score_codex":0.0028010642,"about_ca_system_score_gemma":0.00080621114,"threshold_uncertainty_score":0.03071326},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"agree"},{"id":"W24363857","doi":"10.4097/kjae.2013.65.5.480","title":"Antimagic Labelings of Generalized Petersen Graphs That Are Plane.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Plane (geometry); Geometry","score_opus":0.016673438934911928,"score_gpt":0.22365998022897612,"score_spread":0.20698654129406419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24363857","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.713756,0.00064601976,0.13823685,0.0018704934,0.00018989503,0.000120356344,0.0017085241,0.00082767964,0.14264421],"genre_scores_gemma":[0.92984927,0.00056491303,0.047305796,0.0003709032,0.00009441985,0.00009409732,0.0017560482,0.00019457201,0.01976992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993098,0.00016866623,0.000043555465,0.00016260386,0.00015549039,0.00015987938],"domain_scores_gemma":[0.9977556,0.0010197901,0.00036956512,0.0004102447,0.00020208141,0.00024276704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040979887,0.00041146865,0.0004997994,0.0013902487,0.0018956835,0.0036269922,0.00081818155,0.0014539029,0.008470421],"category_scores_gemma":[0.0029349462,0.0006129444,0.0006105382,0.001904527,0.0014297107,0.004424984,0.0017294226,0.0016472766,0.001214362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000972568,0.000047069803,0.0007847253,0.00008403978,0.000018058943,0.00018384146,0.00035563626,0.0033809263,0.002873205,0.96985257,0.0055473554,0.01677536],"study_design_scores_gemma":[0.000024013802,0.000020137666,0.00079101406,0.00003454088,0.00002545921,0.00030922928,0.00044033892,0.010899231,0.0027058744,0.97051066,0.014221969,0.000017468396],"about_ca_topic_score_codex":0.0013038608,"about_ca_topic_score_gemma":0.0022937658,"teacher_disagreement_score":0.008470421,"about_ca_system_score_codex":0.0010911459,"about_ca_system_score_gemma":0.0004986497,"threshold_uncertainty_score":0.028336346},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85002106,0.0017463142,0.06518941,0.0044630687,0.0003060275,0.000040017963,0.0007408904,0.0002146888,0.077278554],"genre_scores_gemma":[0.9826341,0.00067997683,0.0096860435,0.00020253572,0.0003339297,0.00004514384,0.00037785515,0.00008344104,0.005956925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934417,0.00020133027,0.000027588547,0.00017210757,0.00013768199,0.00011703811],"domain_scores_gemma":[0.9945945,0.0030201399,0.0010166372,0.00044366135,0.0003326751,0.0005923187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010394373,0.00064019253,0.00072331633,0.0036583268,0.0019463402,0.003988251,0.002248904,0.0014312201,0.007148371],"category_scores_gemma":[0.0066963322,0.0005395465,0.00048692888,0.0030232568,0.005058954,0.006786492,0.0018263193,0.002223936,0.0005502722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019835046,0.000044122353,0.0026141193,0.00007624706,0.000022842882,0.000037685542,0.0002514998,0.012375536,0.0020184934,0.9680633,0.0030613686,0.0112365],"study_design_scores_gemma":[0.000023193996,0.000016115822,0.001723754,0.00002441224,0.000016727274,0.00007144519,0.00013867604,0.025714064,0.000827626,0.9690063,0.0024153765,0.000022287586],"about_ca_topic_score_codex":0.00208113,"about_ca_topic_score_gemma":0.002284612,"teacher_disagreement_score":0.007148371,"about_ca_system_score_codex":0.0027801262,"about_ca_system_score_gemma":0.0008989842,"threshold_uncertainty_score":0.023913741},"labels":[],"label_agreement":null},{"id":"W24865198","doi":"","title":"On the vertex distinguishing equitable edge-coloring of graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Enhanced Data Rates for GSM Evolution; Edge coloring; Graph coloring; Graph; Computer science; Line graph; Artificial intelligence","score_opus":0.025566698070572356,"score_gpt":0.22635348457898022,"score_spread":0.20078678650840787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24865198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36823845,0.003561855,0.41416165,0.010505114,0.00086359726,0.0001931369,0.0019189494,0.0010903513,0.19946697],"genre_scores_gemma":[0.86967224,0.0017671374,0.099034816,0.0013881351,0.000614447,0.00018906176,0.0014446689,0.00034514588,0.025544282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984118,0.0006190237,0.0000710164,0.00027789996,0.00027504584,0.0003451835],"domain_scores_gemma":[0.9900238,0.0069537987,0.0006143234,0.0013108129,0.00047383466,0.00062353275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017835457,0.00070434355,0.0009374155,0.0018052136,0.0024035105,0.0029339155,0.002074241,0.0018923583,0.008600914],"category_scores_gemma":[0.010629766,0.00063215377,0.0006296962,0.0025681292,0.0032123055,0.008173263,0.0031578736,0.0032927792,0.0012402589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014710418,0.00007687618,0.0010870176,0.00013101935,0.000018640516,0.00007886304,0.00021903748,0.0077330656,0.0009461304,0.9537536,0.011658983,0.024149636],"study_design_scores_gemma":[0.000023329976,0.000019360017,0.00042926337,0.000032320357,0.000016740865,0.00012931152,0.00015976325,0.018532716,0.00067061593,0.97411865,0.005853527,0.000014385469],"about_ca_topic_score_codex":0.0020029424,"about_ca_topic_score_gemma":0.0025306793,"teacher_disagreement_score":0.008600914,"about_ca_system_score_codex":0.0020513271,"about_ca_system_score_gemma":0.0009815781,"threshold_uncertainty_score":0.02877295},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94612956,0.00093939883,0.03356116,0.0006657375,0.00014876798,0.000027668231,0.0008306607,0.00015676959,0.017540278],"genre_scores_gemma":[0.99091095,0.00022190256,0.0074134017,0.00008161526,0.000075168995,0.000022401728,0.00035581508,0.000024104544,0.0008947191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992003,0.00016703637,0.000051960218,0.0001616391,0.00024718017,0.00017195451],"domain_scores_gemma":[0.99722123,0.0008976997,0.0005903853,0.0002681427,0.00041040799,0.0006121934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044133095,0.00033996315,0.0004279328,0.0017691869,0.0009817806,0.0017324234,0.00055205513,0.00044189824,0.0018202929],"category_scores_gemma":[0.0033065213,0.0002872446,0.0002896575,0.0012129627,0.0012350684,0.0015711774,0.0010439368,0.0007532982,0.00017940716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040038387,0.00008739789,0.008263386,0.00020875683,0.00008797305,0.00040194136,0.00067595684,0.016488934,0.019901901,0.9133003,0.006701119,0.03348199],"study_design_scores_gemma":[0.000051998686,0.00014474762,0.008401449,0.000046684192,0.000048998296,0.001064427,0.00035638726,0.07844017,0.008959289,0.8873598,0.015030043,0.00009602774],"about_ca_topic_score_codex":0.001041028,"about_ca_topic_score_gemma":0.0009705316,"teacher_disagreement_score":0.0018202929,"about_ca_system_score_codex":0.00114356,"about_ca_system_score_gemma":0.0004989901,"threshold_uncertainty_score":0.008297145},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5526076,0.0043303696,0.34031,0.021172572,0.00084433716,0.00016930701,0.0010726248,0.0004757761,0.07901741],"genre_scores_gemma":[0.9556782,0.001744264,0.01944821,0.0012876272,0.00076909806,0.00015313695,0.0005220391,0.0001500543,0.020247301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980982,0.000849424,0.00006248499,0.00036550712,0.00033676653,0.000287686],"domain_scores_gemma":[0.9871946,0.0078492705,0.001482587,0.0011906992,0.0007846,0.0014983297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016515173,0.0006237476,0.0012906989,0.001992118,0.0021981073,0.006264474,0.0013538555,0.0034251558,0.007246198],"category_scores_gemma":[0.013656529,0.00078757555,0.00087493064,0.0017886457,0.0042323773,0.007920571,0.0035980702,0.004509613,0.0006812912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000448177,0.000030728377,0.00059706636,0.000055236174,0.000012386885,0.000044217395,0.00019932006,0.0043462655,0.00056362554,0.9860146,0.0035087154,0.0045830677],"study_design_scores_gemma":[0.000015164971,0.000008270678,0.00021075441,0.000016627848,0.0000075553553,0.00008336488,0.00009385255,0.0254286,0.00021700322,0.9719445,0.0019642953,0.000010011054],"about_ca_topic_score_codex":0.0014687071,"about_ca_topic_score_gemma":0.0008697399,"teacher_disagreement_score":0.007246198,"about_ca_system_score_codex":0.0024270192,"about_ca_system_score_gemma":0.0009827468,"threshold_uncertainty_score":0.02424097},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001468132,0.055281214,0.042383213,0.0056185964,0.0063190437,0.00006124032,0.0008010887,0.0013128773,0.8867546],"genre_scores_gemma":[0.018065102,0.055988193,0.031309575,0.00211811,0.0055127484,0.0001760523,0.0015092411,0.0014627089,0.88385826],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993536,0.000082264014,0.000021294189,0.00013655465,0.00034929463,0.000056922217],"domain_scores_gemma":[0.9993356,0.00021888546,0.00003381725,0.00018127823,0.00013949159,0.00009086114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004151828,0.0017917465,0.0013413542,0.0031065634,0.0015119936,0.0044448925,0.0015325696,0.00095186016,0.07520117],"category_scores_gemma":[0.0014625911,0.00092398183,0.00077965873,0.0061391857,0.0020587612,0.005788937,0.002378378,0.0051888265,0.052707378],"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.000014375025,0.000038468683,0.00009752381,0.0003734822,0.0000144717105,0.000023856335,0.000087263004,0.0010010285,0.00046446116,0.28120774,0.47932985,0.23734736],"study_design_scores_gemma":[0.0000041014628,0.0000057102516,0.0001391044,0.0001481441,0.000007481906,0.00007095894,0.00003629946,0.0008043167,0.0002010558,0.1689848,0.8295895,0.000008588411],"about_ca_topic_score_codex":0.0015381133,"about_ca_topic_score_gemma":0.0039478117,"teacher_disagreement_score":0.07520117,"about_ca_system_score_codex":0.0029442094,"about_ca_system_score_gemma":0.0019650823,"threshold_uncertainty_score":0.25157297},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07599918,0.0027362588,0.025194505,0.002429463,0.0009464928,0.000041549007,0.000303805,0.0002956318,0.892053],"genre_scores_gemma":[0.7514425,0.0022966051,0.010187427,0.000756718,0.0011971974,0.00008288687,0.0006546616,0.00046747838,0.23291457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996126,0.00007836969,0.00001621183,0.00009206253,0.00013206113,0.0000687679],"domain_scores_gemma":[0.9997234,0.00007349133,0.000024466533,0.00005822981,0.000051038125,0.00006949252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031729546,0.00053669955,0.00064602995,0.0013642125,0.0015380051,0.0025474848,0.00060791225,0.000432454,0.018745825],"category_scores_gemma":[0.0010666796,0.00025825473,0.00044234283,0.0010399038,0.0026197971,0.003537323,0.0020305251,0.002139956,0.00245314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000774815,0.0000045315624,0.000033719436,0.000011150667,0.0000015338874,0.000012368775,0.00008617304,0.000050533927,0.00015400688,0.9910903,0.002635399,0.0059125526],"study_design_scores_gemma":[0.000006792288,0.0000066014554,0.00012186976,0.000008327165,0.0000036897277,0.00008293361,0.000076016535,0.00025884557,0.0002687418,0.96376413,0.035398148,0.000004022605],"about_ca_topic_score_codex":0.0006318399,"about_ca_topic_score_gemma":0.00069286645,"teacher_disagreement_score":0.018745825,"about_ca_system_score_codex":0.0012720732,"about_ca_system_score_gemma":0.00042199728,"threshold_uncertainty_score":0.062711},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53317237,0.0013741871,0.39663422,0.0011779564,0.00017614201,0.00007027311,0.0011914575,0.00049154094,0.06571188],"genre_scores_gemma":[0.9627485,0.00034768504,0.031327568,0.00015522499,0.0001211451,0.000072049945,0.0007179935,0.000091489695,0.0044182586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987047,0.00023295211,0.00008648839,0.00037752083,0.00037794196,0.00022044507],"domain_scores_gemma":[0.99678814,0.0010647402,0.00036333807,0.0007235446,0.00056113856,0.0004991446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000813912,0.00040463553,0.0005455353,0.0016748131,0.00096387335,0.0020042944,0.00088320574,0.00057235395,0.0039523784],"category_scores_gemma":[0.0043487037,0.00020404218,0.0009053244,0.0011823665,0.0024621966,0.0044452827,0.0021015971,0.001454966,0.0004297196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031145973,0.000022069758,0.002045967,0.000058050882,0.000019139661,0.00016105035,0.000377018,0.0042362865,0.0025552087,0.97856915,0.0012306009,0.010694215],"study_design_scores_gemma":[0.0000073863725,0.00006247907,0.0020383182,0.00003339362,0.000018192644,0.00071465736,0.00018328155,0.028665068,0.0021660642,0.952625,0.01345523,0.00003093487],"about_ca_topic_score_codex":0.0008678776,"about_ca_topic_score_gemma":0.0005478786,"teacher_disagreement_score":0.0039523784,"about_ca_system_score_codex":0.0014943072,"about_ca_system_score_gemma":0.00042435314,"threshold_uncertainty_score":0.013222039},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6526536,0.00037724068,0.2767552,0.00092178775,0.0001036598,0.000055242584,0.000928959,0.0007410383,0.06746338],"genre_scores_gemma":[0.93012166,0.00020070687,0.058376793,0.00033000397,0.00005559213,0.000053817133,0.0007846804,0.00009128936,0.009985507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962664,0.00005787524,0.000015086087,0.000104788625,0.00008985264,0.000105714586],"domain_scores_gemma":[0.99893504,0.00037106828,0.00013871046,0.0002191189,0.00019801936,0.00013794388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028305256,0.00022082165,0.0002881921,0.0007420937,0.0011616732,0.0010836662,0.00043755837,0.00046579103,0.0060813255],"category_scores_gemma":[0.0012142255,0.000204511,0.00060576556,0.0006438927,0.000841865,0.0018264174,0.0012644598,0.0010093931,0.0006511813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014092562,0.000043772783,0.0044672727,0.00009770741,0.000020270241,0.00025072444,0.0005312645,0.006495682,0.014115649,0.9363423,0.004593416,0.032901116],"study_design_scores_gemma":[0.000016934471,0.00008207979,0.0043075797,0.000025684156,0.000031792468,0.0008108374,0.00043687783,0.047424983,0.009035625,0.91636354,0.021430103,0.000034049248],"about_ca_topic_score_codex":0.001202697,"about_ca_topic_score_gemma":0.0026254035,"teacher_disagreement_score":0.0060813255,"about_ca_system_score_codex":0.00080366037,"about_ca_system_score_gemma":0.00063989544,"threshold_uncertainty_score":0.020344019},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6683716,0.00018004912,0.24644764,0.0008065556,0.000120467375,0.00007585278,0.0005036943,0.0007993956,0.0826947],"genre_scores_gemma":[0.93193054,0.00012069992,0.05115054,0.0002178493,0.000046256766,0.00005528618,0.00049252686,0.0001208204,0.015865434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996954,0.000055254503,0.000011784754,0.00010916389,0.000072170544,0.00005613818],"domain_scores_gemma":[0.99922776,0.00020999598,0.00009045279,0.00018536253,0.00019610568,0.0000903745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002768858,0.00024073006,0.0002148951,0.00048110416,0.00089867454,0.0005822603,0.00037328553,0.00035443922,0.005579158],"category_scores_gemma":[0.0010971166,0.0002551976,0.00032658427,0.00036900505,0.00084826304,0.0010825008,0.00079045555,0.0009455479,0.00071390555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003247189,0.000075343276,0.003559966,0.00020077234,0.000030310237,0.00042359447,0.0011696131,0.012307404,0.058343645,0.8402716,0.0074621765,0.075830825],"study_design_scores_gemma":[0.00006427817,0.00019319278,0.0061659627,0.00005939443,0.00006931639,0.0009488814,0.00088027207,0.080817536,0.06282611,0.7906019,0.05732217,0.000050955296],"about_ca_topic_score_codex":0.0007577293,"about_ca_topic_score_gemma":0.0012392404,"teacher_disagreement_score":0.005579158,"about_ca_system_score_codex":0.00079616945,"about_ca_system_score_gemma":0.0003463581,"threshold_uncertainty_score":0.018664122},"labels":[],"label_agreement":null},{"id":"W25261710","doi":"10.1016/j.ijpharm.2014.09.035","title":"On the Toughness of the Middle Graph of a Graph.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Allergy and Infectious Diseases","keywords":"Mathematics; Graph; Toughness; Combinatorics; Composite material; Materials science","score_opus":0.022204926381563184,"score_gpt":0.21556352523421562,"score_spread":0.19335859885265244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W25261710","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15571646,0.018392848,0.055926543,0.0073298677,0.014510711,0.0008334215,0.02761075,0.008979804,0.71069956],"genre_scores_gemma":[0.54379386,0.0062880334,0.02724234,0.0033973954,0.0006688309,0.00081876956,0.013731281,0.0036757083,0.40038386],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901366,0.00007023886,0.000044127602,0.000265019,0.00043459403,0.00017235267],"domain_scores_gemma":[0.9975547,0.00076486723,0.00024020817,0.0001731011,0.0010133154,0.00025381905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005485242,0.0014849359,0.0008977572,0.0028158017,0.0011851161,0.0012938534,0.001305128,0.0013251404,0.2640787],"category_scores_gemma":[0.0032672116,0.0005657034,0.000881198,0.0014051279,0.00082457176,0.0015650614,0.0011166034,0.0022329001,0.06283589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018084103,0.0005069312,0.0069365385,0.0035249111,0.00026055865,0.00118445,0.0007301724,0.0097685335,0.2615843,0.017170085,0.31633922,0.38018578],"study_design_scores_gemma":[0.00008766234,0.0012935239,0.033393435,0.00062368315,0.00031316778,0.0016113227,0.0027945049,0.022368034,0.13819492,0.015108982,0.7839283,0.0002825215],"about_ca_topic_score_codex":0.0030848077,"about_ca_topic_score_gemma":0.0035920336,"teacher_disagreement_score":0.2640787,"about_ca_system_score_codex":0.0006607506,"about_ca_system_score_gemma":0.00052712683,"threshold_uncertainty_score":0.8834313},"labels":[],"label_agreement":null},{"id":"W252754","doi":"","title":"The domatic numbers of factors of graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.008305826801499328,"score_gpt":0.21371586878130647,"score_spread":0.20541004197980714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W252754","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4592778,0.006936964,0.39488667,0.002430914,0.000515845,0.00021590048,0.002596339,0.0004307856,0.13270876],"genre_scores_gemma":[0.8819897,0.0019737673,0.09989187,0.00035613618,0.00036499865,0.00020924938,0.00096433144,0.00012019527,0.01412965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983132,0.00048807298,0.00012962917,0.00045655304,0.00039853348,0.00021402363],"domain_scores_gemma":[0.99548715,0.0024893407,0.0005922163,0.00058504916,0.00034202295,0.00050422014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016574472,0.0007962207,0.000641274,0.0025027941,0.0018442168,0.0032345592,0.0007538911,0.00076393154,0.003914141],"category_scores_gemma":[0.008464536,0.0005615898,0.00078338356,0.0017495696,0.0036246171,0.005257582,0.0019319336,0.001442842,0.0007676752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024379276,0.000022633352,0.0030079465,0.00016181183,0.000025327201,0.00006297183,0.00033358563,0.0049986714,0.0047448985,0.9597473,0.0027508247,0.023900202],"study_design_scores_gemma":[0.000022247266,0.00006808111,0.0017336934,0.000061353545,0.000027546685,0.0005258551,0.00020059811,0.013544952,0.005632788,0.94817054,0.029977439,0.000034869532],"about_ca_topic_score_codex":0.00041532092,"about_ca_topic_score_gemma":0.00069555186,"teacher_disagreement_score":0.003914141,"about_ca_system_score_codex":0.0017622496,"about_ca_system_score_gemma":0.00057137094,"threshold_uncertainty_score":0.013094127},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55203086,0.0030843953,0.35313228,0.008303588,0.0003133502,0.00020120418,0.001580295,0.0005476688,0.08080629],"genre_scores_gemma":[0.90095556,0.002098322,0.07365698,0.0010989457,0.00062326196,0.00017153098,0.0012152949,0.00036495132,0.019815141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799395,0.0005304671,0.00009341138,0.0004256381,0.0004415996,0.00051500415],"domain_scores_gemma":[0.9887229,0.0077652344,0.0009435623,0.0010491452,0.0004952527,0.0010239347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027688488,0.0013787453,0.0014357215,0.0018039305,0.0022555464,0.005389882,0.0031142624,0.0025032798,0.008941976],"category_scores_gemma":[0.013216123,0.0011941958,0.0019116475,0.004281403,0.005194365,0.009514142,0.003420527,0.0065905214,0.0009565677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003766314,0.00026747974,0.0014811194,0.00022815305,0.000034269255,0.0002750865,0.00060807343,0.009617166,0.0016550366,0.95682967,0.008751754,0.019875469],"study_design_scores_gemma":[0.00008602674,0.000024967876,0.00047251626,0.00002216808,0.000036101825,0.000189649,0.00015868376,0.027721548,0.00066081993,0.9688053,0.0018021037,0.000020072815],"about_ca_topic_score_codex":0.003721576,"about_ca_topic_score_gemma":0.0054802,"teacher_disagreement_score":0.008941976,"about_ca_system_score_codex":0.0027281372,"about_ca_system_score_gemma":0.0014886686,"threshold_uncertainty_score":0.029913902},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7717477,0.0020866585,0.1642537,0.012700918,0.0003596801,0.00022440005,0.0030930548,0.000828606,0.044705298],"genre_scores_gemma":[0.9453797,0.00088149356,0.04243636,0.0006707313,0.000462933,0.00022772404,0.0021765886,0.00030932596,0.0074551073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99529004,0.0015777808,0.00020869305,0.0011590846,0.00092801964,0.00083633634],"domain_scores_gemma":[0.9429084,0.048349597,0.0023726798,0.0029891224,0.0013191474,0.0020610096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034450707,0.0013782609,0.0020775236,0.0024896564,0.0030536347,0.009905562,0.006461123,0.0030730302,0.013450731],"category_scores_gemma":[0.028494693,0.0013690132,0.0019537115,0.003797687,0.0055258074,0.014976179,0.004871454,0.0066590738,0.000947601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017514713,0.00068965025,0.015538504,0.00079399755,0.00020556437,0.00026411467,0.0015416491,0.15933214,0.005427966,0.74790376,0.018522497,0.048028804],"study_design_scores_gemma":[0.00014361521,0.00007016823,0.0021454662,0.00004423531,0.000086364635,0.00016276466,0.0003641516,0.23782973,0.0012634029,0.75598395,0.0018619588,0.000044213542],"about_ca_topic_score_codex":0.004163256,"about_ca_topic_score_gemma":0.0053291004,"teacher_disagreement_score":0.013450731,"about_ca_system_score_codex":0.0061447774,"about_ca_system_score_gemma":0.0037772788,"threshold_uncertainty_score":0.044997215},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23631638,0.0005822186,0.69331235,0.006778584,0.0005048273,0.00039638294,0.0024038895,0.0024659801,0.057239477],"genre_scores_gemma":[0.83533925,0.00037279786,0.14437321,0.0008256559,0.0002910644,0.00022006322,0.0013587648,0.00045913647,0.01676001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99666876,0.0015100462,0.0001516563,0.00051896775,0.0004579794,0.00069261994],"domain_scores_gemma":[0.98280454,0.008426067,0.0010074162,0.004778525,0.0016333385,0.0013501239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00249614,0.000841367,0.0011511736,0.00082460826,0.0018338645,0.00414558,0.0023317968,0.0016545375,0.018474504],"category_scores_gemma":[0.014094669,0.00059007143,0.00066301867,0.0025715982,0.0014213563,0.008206483,0.0021709597,0.0019369324,0.0017966733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016124872,0.0005287074,0.003979865,0.00054143014,0.00009487441,0.00031426942,0.0006025126,0.08590338,0.0066386643,0.7616841,0.04040188,0.09769771],"study_design_scores_gemma":[0.000119196695,0.00009739236,0.0005422131,0.000039943756,0.0000563653,0.0002940585,0.00048139042,0.21489438,0.0056527546,0.7582294,0.019547494,0.00004543866],"about_ca_topic_score_codex":0.0022094366,"about_ca_topic_score_gemma":0.0026773429,"teacher_disagreement_score":0.018474504,"about_ca_system_score_codex":0.0025315857,"about_ca_system_score_gemma":0.0018548444,"threshold_uncertainty_score":0.06180334},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1185261,0.016154159,0.69175375,0.061073657,0.0020818836,0.0002331996,0.0045422586,0.005062846,0.10057214],"genre_scores_gemma":[0.69978356,0.013107445,0.24085553,0.011284809,0.0047415826,0.00064187235,0.004096116,0.002798732,0.022690428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947255,0.0011629744,0.0001738172,0.0012680298,0.0009198157,0.0017498236],"domain_scores_gemma":[0.9460411,0.041484937,0.0016656911,0.007260624,0.0013340036,0.0022135524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051170513,0.0025298586,0.0037196141,0.0018411358,0.0029606575,0.008963524,0.0076397145,0.0048973938,0.019117454],"category_scores_gemma":[0.040357865,0.0018003543,0.003246593,0.0047261706,0.0059011052,0.028377246,0.006354104,0.013955487,0.0049557416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026335176,0.0010814286,0.0050778603,0.002151923,0.00027789094,0.00020409536,0.0008617428,0.06056743,0.00973471,0.63250715,0.0871591,0.19774324],"study_design_scores_gemma":[0.00011867555,0.00010455785,0.0008877565,0.00019160999,0.00013679013,0.00017982711,0.00022763819,0.07781995,0.0026247115,0.90468484,0.012969037,0.00005453374],"about_ca_topic_score_codex":0.002984192,"about_ca_topic_score_gemma":0.0044037364,"teacher_disagreement_score":0.019117454,"about_ca_system_score_codex":0.005496623,"about_ca_system_score_gemma":0.0037995223,"threshold_uncertainty_score":0.063954234},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21840437,0.0040790066,0.5101392,0.004503907,0.0010781302,0.00007006624,0.0006527041,0.000623893,0.26044866],"genre_scores_gemma":[0.8090827,0.0025508576,0.14066657,0.0023114544,0.001462854,0.00015810775,0.00072787085,0.00042054526,0.0426191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992461,0.0001818958,0.000035553046,0.00023277786,0.00018264777,0.000121118566],"domain_scores_gemma":[0.9985654,0.0005644775,0.00016134471,0.00028321522,0.00022573429,0.00019993952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011611184,0.00035070762,0.0006392167,0.0019243943,0.0018979603,0.0014853595,0.0009570988,0.0010228017,0.009839932],"category_scores_gemma":[0.0027793546,0.00034076037,0.0009172301,0.0014425308,0.00228072,0.0046891607,0.0019015308,0.0027084462,0.0010211485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016062926,0.000010558323,0.00030487735,0.000067920235,0.0000045185625,0.00003698109,0.00016372392,0.0009793036,0.0008438832,0.9887543,0.0014902187,0.007327556],"study_design_scores_gemma":[0.000005009311,0.000024301504,0.0004783388,0.000023977987,0.0000079650745,0.00011114983,0.000104407634,0.0054006996,0.00058032986,0.9814704,0.011780406,0.000012879515],"about_ca_topic_score_codex":0.0007919786,"about_ca_topic_score_gemma":0.0010258836,"teacher_disagreement_score":0.009839932,"about_ca_system_score_codex":0.0014458293,"about_ca_system_score_gemma":0.00056696864,"threshold_uncertainty_score":0.032917798},"labels":[],"label_agreement":null},{"id":"W2571698871","doi":"","title":"Signed (j, k)-domatic number of graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.009548078273400035,"score_gpt":0.23017928033944288,"score_spread":0.22063120206604284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571698871","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5019108,0.0010667621,0.2188358,0.009934592,0.0013287704,0.00015206078,0.0041523953,0.0011382818,0.2614806],"genre_scores_gemma":[0.9120593,0.00033089914,0.046362247,0.00079835724,0.0003393468,0.00013009689,0.001296957,0.00022787163,0.03845491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886525,0.00031750888,0.00008835,0.00027462043,0.00022960304,0.0002247637],"domain_scores_gemma":[0.9956358,0.0017458774,0.00063859473,0.00068305584,0.0005304759,0.0007662384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010567628,0.00043725377,0.0006125555,0.0017515861,0.0023730292,0.004854466,0.0014577071,0.0014161149,0.018417338],"category_scores_gemma":[0.0066419845,0.00036436645,0.0005755973,0.0015696641,0.0024306583,0.0069473973,0.0019499924,0.0021531507,0.0023704085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020078193,0.00005253698,0.0014991779,0.00010654715,0.000016000762,0.000079774334,0.00016410851,0.0019626908,0.0023288568,0.963741,0.0101182405,0.019730363],"study_design_scores_gemma":[0.000035698366,0.000035779554,0.0012319331,0.000032278353,0.000020150177,0.00031169006,0.0002059908,0.010734025,0.0027433555,0.969942,0.014675382,0.000031779105],"about_ca_topic_score_codex":0.00077071466,"about_ca_topic_score_gemma":0.0014541841,"teacher_disagreement_score":0.018417338,"about_ca_system_score_codex":0.0017395747,"about_ca_system_score_gemma":0.0011400052,"threshold_uncertainty_score":0.06161213},"labels":[],"label_agreement":null},{"id":"W2571906584","doi":"","title":"The Super Vertex-Graceful Labeling Of Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.009741109062009853,"score_gpt":0.21467932911614504,"score_spread":0.2049382200541352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571906584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23544018,0.0039835004,0.47516078,0.008507978,0.00086235465,0.00012551977,0.00191958,0.001640019,0.2723602],"genre_scores_gemma":[0.8671002,0.0020129355,0.08762975,0.0015186032,0.00076541567,0.00017408389,0.0013138029,0.0005313167,0.03895382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989543,0.00033794343,0.000045188477,0.000241395,0.0002352317,0.00018603248],"domain_scores_gemma":[0.99686974,0.0012858395,0.00031485182,0.0009566357,0.0001975945,0.00037542506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010536355,0.0006001167,0.0006672856,0.0014700028,0.0021667753,0.0029142462,0.0015235714,0.001323645,0.009144861],"category_scores_gemma":[0.004632857,0.0005416263,0.0008440659,0.0018649349,0.0034484318,0.005869458,0.0028168461,0.002961215,0.001653543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031164618,0.000012244413,0.00018000999,0.00004634936,0.0000050276954,0.000020027295,0.00009340398,0.0018515033,0.00044929318,0.98373187,0.0046081194,0.008971042],"study_design_scores_gemma":[0.0000061129117,0.000005611695,0.00010370076,0.000012215479,0.0000049310497,0.00003618285,0.00003878016,0.0054225414,0.00032615318,0.9885727,0.005464844,0.0000060698885],"about_ca_topic_score_codex":0.002108626,"about_ca_topic_score_gemma":0.0024552366,"teacher_disagreement_score":0.009144861,"about_ca_system_score_codex":0.0018556259,"about_ca_system_score_gemma":0.0009858068,"threshold_uncertainty_score":0.03059262},"labels":[],"label_agreement":null},{"id":"W2571948696","doi":"","title":"Upper Bounds of Four Types of Graph Labelings.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph; Edge-graceful labeling; Discrete mathematics; Line graph; Graph power","score_opus":0.01268965586747951,"score_gpt":0.22074951115332392,"score_spread":0.20805985528584442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571948696","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091953695,0.008876013,0.4162958,0.013119112,0.0014713684,0.0005103837,0.0069493316,0.004607056,0.45621714],"genre_scores_gemma":[0.6254936,0.005336877,0.293917,0.0041991444,0.0020109985,0.0010429556,0.008846389,0.0022076853,0.056945425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99012756,0.002303448,0.0006340856,0.0018878413,0.0028522222,0.002194877],"domain_scores_gemma":[0.92553127,0.05077441,0.0031432814,0.012604857,0.003246476,0.004699717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064023347,0.0029326603,0.0022451805,0.006825784,0.0041622696,0.014327331,0.008083267,0.0050605144,0.03812576],"category_scores_gemma":[0.04701311,0.0017454496,0.003290883,0.008682813,0.006274105,0.017515235,0.009122917,0.0093884785,0.0067894463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047385643,0.00027614326,0.0015443172,0.0005465244,0.000064982654,0.00009877349,0.0002703284,0.008684362,0.0017403675,0.89555496,0.034605015,0.05614031],"study_design_scores_gemma":[0.00009831094,0.0000926904,0.0012130586,0.00027561313,0.00015488343,0.000514383,0.00024014244,0.03512803,0.003706766,0.9277639,0.030724037,0.00008823805],"about_ca_topic_score_codex":0.001837311,"about_ca_topic_score_gemma":0.003088821,"teacher_disagreement_score":0.03812576,"about_ca_system_score_codex":0.006975175,"about_ca_system_score_gemma":0.0028281745,"threshold_uncertainty_score":0.12754333},"labels":[],"label_agreement":null},{"id":"W2572025762","doi":"","title":"A note on acyclic total coloring of plane graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Edge coloring; Plane (geometry); Complete coloring; Geometry; Graph; Line graph","score_opus":0.011595262055539344,"score_gpt":0.22706169778017482,"score_spread":0.21546643572463547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572025762","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02759,0.02461476,0.43357712,0.024283351,0.013448838,0.00014284607,0.0022254512,0.0014091015,0.47270846],"genre_scores_gemma":[0.4146204,0.0530231,0.37029502,0.014639679,0.012981064,0.00034455184,0.0028571477,0.0015595776,0.12967959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992557,0.00022884358,0.000037900307,0.00019019152,0.00019388538,0.00009347035],"domain_scores_gemma":[0.99660146,0.0022898428,0.000118797354,0.0005300767,0.0002504681,0.00020931287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012641948,0.00088652637,0.0007709387,0.0016308826,0.0017021851,0.0024367652,0.0016770046,0.00096632785,0.014391782],"category_scores_gemma":[0.0043190205,0.0005602559,0.00097138266,0.0034894529,0.0024254438,0.005117765,0.0021452908,0.004573083,0.0023420346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006942524,0.00004897858,0.00045893146,0.00034650243,0.000027750519,0.00018106036,0.0001755627,0.003737973,0.001289697,0.85739213,0.08588393,0.050388157],"study_design_scores_gemma":[0.000010180034,0.000023518396,0.00049550686,0.00008473404,0.00003203609,0.00022617778,0.00011609838,0.004256541,0.0007359989,0.8513988,0.14259952,0.000020866271],"about_ca_topic_score_codex":0.0052852132,"about_ca_topic_score_gemma":0.010232493,"teacher_disagreement_score":0.014391782,"about_ca_system_score_codex":0.0016447486,"about_ca_system_score_gemma":0.00093729224,"threshold_uncertainty_score":0.048145294},"labels":[],"label_agreement":null},{"id":"W2572121591","doi":"","title":"Neighbor sum distinguishing total choosability of a kind of sparse graph.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dense graph; Combinatorics; Graph; Line graph; Pathwidth","score_opus":0.013701937404662743,"score_gpt":0.22629641737560138,"score_spread":0.21259447997093864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572121591","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7335905,0.00047738935,0.18522117,0.0026921332,0.00021562775,0.00010627583,0.0016637301,0.00054530543,0.075487845],"genre_scores_gemma":[0.9523276,0.0001976896,0.034461576,0.0004584804,0.00014718277,0.00007257276,0.0014687576,0.00017800016,0.010688289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915445,0.00020487243,0.00004569665,0.00023636778,0.00021331762,0.00014525303],"domain_scores_gemma":[0.9939452,0.0038722348,0.00044324002,0.0009979631,0.00027485818,0.00046642718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071851956,0.00036575456,0.0007247833,0.00082643126,0.0012109654,0.002213595,0.0014297428,0.0012428997,0.009171888],"category_scores_gemma":[0.0050454885,0.00046805848,0.0007660383,0.0012606899,0.0015701058,0.00410152,0.0018330225,0.0021634158,0.00052461907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003041386,0.00010473247,0.002393872,0.0002064541,0.000040925286,0.00019698917,0.000344817,0.010619801,0.0060903705,0.94710004,0.008616993,0.023980727],"study_design_scores_gemma":[0.00006809963,0.000055227447,0.0015585336,0.000023842424,0.00004818149,0.0004139689,0.00018228717,0.048248064,0.0032869948,0.9415037,0.0045856875,0.000025529764],"about_ca_topic_score_codex":0.0012196585,"about_ca_topic_score_gemma":0.0021252383,"teacher_disagreement_score":0.009171888,"about_ca_system_score_codex":0.0011009135,"about_ca_system_score_gemma":0.0005381969,"threshold_uncertainty_score":0.030682981},"labels":[],"label_agreement":null},{"id":"W2572263450","doi":"","title":"Proper Nearly Perfect Sets in Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.0118478565487645,"score_gpt":0.22182307653534625,"score_spread":0.20997521998658175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572263450","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4298671,0.007002565,0.3626693,0.011328593,0.00051754166,0.00016455473,0.004692053,0.0010923586,0.18266593],"genre_scores_gemma":[0.9305421,0.0018459377,0.048299138,0.0008847199,0.0002865224,0.00012213174,0.001449885,0.00015215203,0.01641747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985037,0.0005465963,0.000098938006,0.00035511164,0.00028190808,0.00021381657],"domain_scores_gemma":[0.99411833,0.003733294,0.00055810704,0.00090617966,0.0002662383,0.00041785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012245651,0.00045652452,0.00085706037,0.0014390943,0.002010409,0.0037849487,0.0010958993,0.0013914886,0.008828225],"category_scores_gemma":[0.0063301213,0.0007086874,0.0006680119,0.002502212,0.0027138921,0.008375541,0.0024316518,0.002032626,0.0011408948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053880005,0.000022738035,0.0006613978,0.00010854882,0.000013722306,0.00003375924,0.0001669374,0.0027085182,0.00060312514,0.9785718,0.00491343,0.012142147],"study_design_scores_gemma":[0.000011766623,0.000009132074,0.00040258377,0.000028991268,0.000011360173,0.00011313592,0.00014070689,0.0055199126,0.00057167123,0.9876516,0.0055296286,0.000009499713],"about_ca_topic_score_codex":0.0014525944,"about_ca_topic_score_gemma":0.0020982698,"teacher_disagreement_score":0.008828225,"about_ca_system_score_codex":0.0019863208,"about_ca_system_score_gemma":0.00082666083,"threshold_uncertainty_score":0.029533327},"labels":[],"label_agreement":null},{"id":"W2572325465","doi":"","title":"Differential in Cartesian Product Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Differential (mechanical device); Product (mathematics); Pure mathematics; Combinatorics; Geometry; Physics","score_opus":0.009419862491526156,"score_gpt":0.21252056685025433,"score_spread":0.20310070435872818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572325465","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38588905,0.0036924784,0.33808023,0.006757566,0.0006255197,0.000085324995,0.0015779029,0.0007892175,0.26250276],"genre_scores_gemma":[0.907426,0.0013327659,0.046626072,0.0007522107,0.00029611666,0.000079652295,0.00093440246,0.00020256997,0.04235026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992798,0.00019034345,0.00003866287,0.0002144142,0.0001515313,0.00012527763],"domain_scores_gemma":[0.9980544,0.0010433735,0.00017619855,0.00029251026,0.0002248929,0.00020865092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007433716,0.00033596117,0.0005788981,0.0012585033,0.0015151182,0.0022073416,0.00080477813,0.000760347,0.0098092705],"category_scores_gemma":[0.0030121899,0.00039266076,0.0005036079,0.0016247907,0.002372975,0.005700861,0.002099774,0.0017804769,0.0011598819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002004762,0.000012037758,0.00035460593,0.000042692704,0.000003772797,0.000032041655,0.00014261197,0.0005873803,0.0003385883,0.9862104,0.0030835695,0.009172335],"study_design_scores_gemma":[0.000007392105,0.0000074092554,0.00027057214,0.00001701851,0.0000069502826,0.0001558156,0.00012413262,0.0034988853,0.0005660267,0.9843311,0.011008698,0.0000060558395],"about_ca_topic_score_codex":0.0014202786,"about_ca_topic_score_gemma":0.0017689216,"teacher_disagreement_score":0.0098092705,"about_ca_system_score_codex":0.0016208012,"about_ca_system_score_gemma":0.0005047654,"threshold_uncertainty_score":0.032815337},"labels":[],"label_agreement":null},{"id":"W2572495211","doi":"","title":"On Connected m-K 2 -Residual Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Residual; Combinatorics; Statistics; Algorithm","score_opus":0.010757773198907937,"score_gpt":0.21862394440773636,"score_spread":0.20786617120882842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572495211","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55978954,0.002277835,0.22362997,0.0060289055,0.00036176498,0.0001737021,0.0040493063,0.0013886663,0.20230033],"genre_scores_gemma":[0.8905574,0.0010112611,0.06604488,0.0009868675,0.00021687595,0.00014611162,0.0033013276,0.00033872877,0.037396524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922657,0.00022931381,0.00004000572,0.00018884728,0.0001161975,0.00019905277],"domain_scores_gemma":[0.9974841,0.0013007626,0.00038231668,0.0003984893,0.00016545545,0.0002689808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062306074,0.0006240814,0.0006564476,0.0013767778,0.0016985008,0.0025221547,0.0016688965,0.0014771038,0.013635123],"category_scores_gemma":[0.0029741093,0.00044683216,0.0006474899,0.0014128657,0.0020095883,0.0043742093,0.0023235418,0.0018512398,0.0026232083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021375739,0.00009133781,0.0013187723,0.0003171355,0.000028389897,0.00015873017,0.00036038604,0.008431261,0.0029761908,0.93991446,0.016837182,0.029352386],"study_design_scores_gemma":[0.000044234373,0.000032986474,0.0009840761,0.0000702562,0.000023847047,0.00028663204,0.000351902,0.020436645,0.001845535,0.9632072,0.012693797,0.000022879174],"about_ca_topic_score_codex":0.0018281848,"about_ca_topic_score_gemma":0.0029639248,"teacher_disagreement_score":0.013635123,"about_ca_system_score_codex":0.0011946304,"about_ca_system_score_gemma":0.00052759534,"threshold_uncertainty_score":0.045614064},"labels":[],"label_agreement":null},{"id":"W2572704965","doi":"","title":"On the adjacent vertex distinguishing edge chromatic number of graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Vertex (graph theory); Combinatorics; Enhanced Data Rates for GSM Evolution; Brooks' theorem; Graph; 1-planar graph; Chordal graph; Computer science; Artificial intelligence","score_opus":0.01327245613832504,"score_gpt":0.23085625598190704,"score_spread":0.217583799843582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572704965","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6615074,0.0039876592,0.15897684,0.010390202,0.000844361,0.00013705455,0.0019471394,0.00057833985,0.161631],"genre_scores_gemma":[0.95222217,0.0010300566,0.03304471,0.00060743035,0.00055117114,0.00011338594,0.00085142686,0.00019056186,0.011389026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985979,0.0005091544,0.000052269286,0.00033481148,0.00022018768,0.00028558442],"domain_scores_gemma":[0.98607177,0.010523389,0.0009977912,0.00092579424,0.00056349864,0.00091777486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022470655,0.00072425784,0.0008823549,0.003219138,0.0026285944,0.0031358553,0.0026638287,0.002159709,0.010877709],"category_scores_gemma":[0.013438051,0.0006179909,0.00057471276,0.0026721025,0.0045434,0.008117665,0.0023866564,0.003180256,0.0011014185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004520288,0.00013914632,0.004050928,0.00021175113,0.00003760577,0.000092569884,0.00032862875,0.019705754,0.002140141,0.92954016,0.015845928,0.027455376],"study_design_scores_gemma":[0.000059352224,0.000045566987,0.0020934655,0.000062175684,0.00003576751,0.00017093481,0.00028293228,0.06188975,0.0014355201,0.9284708,0.0054154033,0.00003835929],"about_ca_topic_score_codex":0.003066529,"about_ca_topic_score_gemma":0.0032432538,"teacher_disagreement_score":0.010877709,"about_ca_system_score_codex":0.0030688476,"about_ca_system_score_gemma":0.0012376156,"threshold_uncertainty_score":0.03638953},"labels":[],"label_agreement":null},{"id":"W2572723678","doi":"","title":"On Total Edge Irregularity Strength Of Graph.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Graph; Combinatorics; Computer science; Artificial intelligence","score_opus":0.009965319790610648,"score_gpt":0.21762115156549122,"score_spread":0.20765583177488056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572723678","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6783087,0.002660682,0.21435028,0.007134792,0.0005609035,0.00013653372,0.001386433,0.0004365435,0.09502504],"genre_scores_gemma":[0.9656047,0.0011006185,0.022842692,0.00055908255,0.0005177046,0.000119802964,0.0006424625,0.00018355611,0.008429376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799573,0.00075210875,0.00010049887,0.00042043274,0.00041649825,0.0003146725],"domain_scores_gemma":[0.9765737,0.014346982,0.0022870202,0.0027819953,0.0017226306,0.002287679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029651793,0.0007418098,0.0013949575,0.003673535,0.0022193748,0.002905069,0.002296063,0.0018421138,0.009137338],"category_scores_gemma":[0.019081498,0.00068976305,0.0008076933,0.0022725188,0.0035563803,0.0081209745,0.0032415248,0.0033467682,0.001092101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018893876,0.00009006963,0.004405803,0.0002136604,0.000058573773,0.0001517552,0.000287247,0.011964764,0.0024799816,0.9500286,0.007395859,0.02273479],"study_design_scores_gemma":[0.000030299387,0.00005160051,0.001913646,0.00006183127,0.000047500183,0.0003192351,0.00025921373,0.05065471,0.0013647294,0.94103944,0.0042232974,0.00003438227],"about_ca_topic_score_codex":0.00086290785,"about_ca_topic_score_gemma":0.00078986184,"teacher_disagreement_score":0.009137338,"about_ca_system_score_codex":0.0014658121,"about_ca_system_score_gemma":0.0005622357,"threshold_uncertainty_score":0.030567408},"labels":[],"label_agreement":null},{"id":"W2573615651","doi":"","title":"Neighbor Sum Distinguishing Total Choosability of Graphs with Larger Maximum Average Degree.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Statistics; Physics","score_opus":0.013488717033245348,"score_gpt":0.21439274248330797,"score_spread":0.20090402545006264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573615651","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8542049,0.00059998356,0.100475274,0.0017936603,0.00016870967,0.000074692376,0.0011853878,0.000486769,0.041010696],"genre_scores_gemma":[0.9723607,0.0001755744,0.020466235,0.0002759356,0.00011763632,0.000046010144,0.000883629,0.00017489407,0.005499469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877626,0.0003408611,0.00006708785,0.00037224707,0.00022977446,0.0002137579],"domain_scores_gemma":[0.9857545,0.0102530485,0.0009068606,0.0018013264,0.00040403416,0.00088035286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014343925,0.0004897,0.000923397,0.00096785324,0.0013231862,0.002780638,0.0018258786,0.0012119008,0.009454948],"category_scores_gemma":[0.007859889,0.00056385214,0.0008327902,0.0012665349,0.0015326724,0.005095054,0.0018274209,0.0022712012,0.0005585731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013515401,0.00032742662,0.008671252,0.0004989742,0.00010541199,0.00038110398,0.0006786598,0.044409435,0.018566871,0.85928506,0.012195199,0.053529132],"study_design_scores_gemma":[0.00016303828,0.00014404896,0.004643253,0.000051249895,0.00012017034,0.0007175976,0.0004447215,0.14357015,0.0117638875,0.831949,0.006379978,0.000052923613],"about_ca_topic_score_codex":0.0011084081,"about_ca_topic_score_gemma":0.0019324751,"teacher_disagreement_score":0.009454948,"about_ca_system_score_codex":0.0015985736,"about_ca_system_score_gemma":0.0006815474,"threshold_uncertainty_score":0.03162992},"labels":[],"label_agreement":null},{"id":"W2573651048","doi":"","title":"On irregularity strength of convex polytope graphs with certain pendent edges added.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Regular polygon; Combinatorics; Convex polytope; Polytope; Convex analysis; Geometry; Convex optimization","score_opus":0.01112844391133302,"score_gpt":0.21574202983313312,"score_spread":0.2046135859218001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573651048","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7826704,0.0009277294,0.13159078,0.00283269,0.00028315219,0.00009183956,0.000794648,0.00032817983,0.08048055],"genre_scores_gemma":[0.9712081,0.00046028002,0.018756576,0.00033395764,0.00016078156,0.00006940353,0.0005616215,0.0001468987,0.008302367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904245,0.00031837396,0.000046680772,0.0001967303,0.00021189416,0.00018390748],"domain_scores_gemma":[0.98832464,0.0070249117,0.0015496337,0.0010343333,0.0007015525,0.0013648564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012779953,0.0006943945,0.0009516616,0.0020902585,0.0018762775,0.00268345,0.001742428,0.0015678521,0.010151702],"category_scores_gemma":[0.010835771,0.00074580905,0.0006652105,0.0013350073,0.0025909338,0.0043865787,0.0022271918,0.0027818535,0.0009294314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024751126,0.000087597975,0.0029748313,0.00017220047,0.000043468648,0.00027048495,0.00029707444,0.026951334,0.0040163496,0.94218177,0.00665254,0.016104875],"study_design_scores_gemma":[0.00005034342,0.00007512989,0.0025708063,0.00006685773,0.00005329662,0.0004303326,0.0004514053,0.11780001,0.0027335219,0.87014854,0.005571225,0.000048463575],"about_ca_topic_score_codex":0.0014679912,"about_ca_topic_score_gemma":0.0014243874,"teacher_disagreement_score":0.010151702,"about_ca_system_score_codex":0.0012335442,"about_ca_system_score_gemma":0.0004386243,"threshold_uncertainty_score":0.03396088},"labels":[],"label_agreement":null},{"id":"W2573899140","doi":"","title":"Some Results On Super Edge Magic n-Stars.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Stars; MAGIC (telescope); Mathematics; Enhanced Data Rates for GSM Evolution; Astrophysics; Astronomy; Physics; Artificial intelligence; Computer science","score_opus":0.015593983607039738,"score_gpt":0.2264227491608315,"score_spread":0.21082876555379176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573899140","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14351921,0.010850875,0.24460223,0.009815619,0.0017092854,0.00015609292,0.0022500951,0.000840735,0.58625585],"genre_scores_gemma":[0.73340666,0.009750272,0.15993796,0.0060298466,0.0018561522,0.00034256472,0.004194998,0.00060667534,0.08387492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899215,0.00026825894,0.00006125894,0.00021704886,0.0002886511,0.00017266056],"domain_scores_gemma":[0.9959649,0.0022318012,0.00031380946,0.00056566886,0.0003788029,0.00054502045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014594793,0.0008505961,0.0010072988,0.0026908056,0.002341833,0.0029542446,0.0019666727,0.0016319039,0.022444725],"category_scores_gemma":[0.0046473574,0.0007256776,0.0011836985,0.004192458,0.0023521774,0.0066279583,0.0030737869,0.0036950184,0.0037896964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120868026,0.00008313572,0.0006680847,0.00039036732,0.000027900516,0.00013601925,0.00017429062,0.002853681,0.0010571578,0.9486507,0.020118037,0.025719687],"study_design_scores_gemma":[0.00002385849,0.000019546747,0.00035944086,0.000054984146,0.000019142684,0.00020186788,0.000096987045,0.004024587,0.0005691299,0.97732085,0.017295517,0.000013931899],"about_ca_topic_score_codex":0.001182402,"about_ca_topic_score_gemma":0.002309618,"teacher_disagreement_score":0.022444725,"about_ca_system_score_codex":0.0016388935,"about_ca_system_score_gemma":0.00087487354,"threshold_uncertainty_score":0.0750851},"labels":[],"label_agreement":null},{"id":"W2574060387","doi":"","title":"Toughness of Kronecker product of graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Kronecker product; Mathematics; Toughness; Product (mathematics); Kronecker delta; Combinatorics; Composite material; Materials science; Geometry; Physics","score_opus":0.011755845899409846,"score_gpt":0.2220867364911712,"score_spread":0.21033089059176135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574060387","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5878595,0.0018022076,0.27981535,0.0039793043,0.000576509,0.000087303655,0.0014626965,0.0005558087,0.12386129],"genre_scores_gemma":[0.9548853,0.0005335947,0.024652878,0.0004282809,0.00031502722,0.00009367268,0.000698157,0.00016145906,0.018231722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821943,0.00055490347,0.00012405113,0.00039191893,0.00044189618,0.0002677502],"domain_scores_gemma":[0.9908098,0.0049093184,0.001107161,0.001095065,0.00085590355,0.001222754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018316287,0.0005907732,0.00071302947,0.0023226563,0.001970104,0.0040333704,0.0015391888,0.0012409621,0.012743833],"category_scores_gemma":[0.0080406,0.00070412207,0.00084070914,0.0015103207,0.0035945622,0.00825152,0.0026263364,0.0026037213,0.0012485179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049568043,0.000025886919,0.0005512558,0.00004986328,0.0000095818605,0.000053016407,0.00018240935,0.0015212911,0.0005675598,0.9907567,0.002393652,0.0038392544],"study_design_scores_gemma":[0.000009914771,0.000018415822,0.00040278517,0.00002058065,0.000008168433,0.00013423752,0.00011795408,0.009401089,0.00048078105,0.9869119,0.0024777474,0.000016397062],"about_ca_topic_score_codex":0.0012287298,"about_ca_topic_score_gemma":0.0012445558,"teacher_disagreement_score":0.012743833,"about_ca_system_score_codex":0.0013222774,"about_ca_system_score_gemma":0.0005930744,"threshold_uncertainty_score":0.04263234},"labels":[],"label_agreement":null},{"id":"W2574697945","doi":"","title":"Entire Chromatic Number of 1-Tree.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tree (set theory); Chromatic scale; Combinatorics","score_opus":0.00945424832194002,"score_gpt":0.23234166617233848,"score_spread":0.22288741785039845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574697945","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66800207,0.0019845117,0.076175585,0.0062708706,0.00041143087,0.000078433135,0.004650557,0.0006330275,0.24179351],"genre_scores_gemma":[0.94102234,0.00093158183,0.02441679,0.00064065336,0.00021037039,0.00008341369,0.0023302885,0.00025099094,0.0301137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995565,0.00008466717,0.00001516731,0.00014222134,0.00008535083,0.0001161748],"domain_scores_gemma":[0.99807835,0.0010542138,0.00020333374,0.0002282792,0.00019130661,0.00024454747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047304307,0.00035671124,0.0005161766,0.0014392507,0.0018440859,0.0029222907,0.0013227352,0.0010718263,0.017502159],"category_scores_gemma":[0.0027559928,0.00032105923,0.00044986446,0.0014359321,0.0016035524,0.003914595,0.0012196644,0.0017321405,0.0019506253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028898037,0.00007340659,0.0023113745,0.00025806908,0.000025158883,0.000108557564,0.00035894633,0.008094603,0.0063589755,0.9332723,0.024589233,0.024260307],"study_design_scores_gemma":[0.000050180446,0.000032922573,0.0024890911,0.00005462611,0.000041320473,0.00030119467,0.00024946922,0.027548376,0.0033207177,0.947538,0.018347029,0.000027204484],"about_ca_topic_score_codex":0.002897748,"about_ca_topic_score_gemma":0.004188007,"teacher_disagreement_score":0.017502159,"about_ca_system_score_codex":0.0021445937,"about_ca_system_score_gemma":0.000800791,"threshold_uncertainty_score":0.058550537},"labels":[],"label_agreement":null},{"id":"W2574871842","doi":"","title":"On the f-chromatic class of a multi-wheel graph.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Friendship graph; Class (philosophy); Graph; Combinatorics; Computer science; Artificial intelligence; Voltage graph; Line graph","score_opus":0.017505403492978282,"score_gpt":0.227396045620655,"score_spread":0.20989064212767672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574871842","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6984459,0.0018002755,0.12086407,0.0048247273,0.0003710052,0.00009852736,0.002652057,0.0004916568,0.17045173],"genre_scores_gemma":[0.9554898,0.000841193,0.021124536,0.00048452875,0.00026205607,0.0000837021,0.0011411604,0.0001824987,0.020390544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993494,0.00012688618,0.000020485017,0.00017496991,0.0001074059,0.00022078122],"domain_scores_gemma":[0.99734604,0.0015191734,0.0002762759,0.00026016962,0.00017788296,0.0004204216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072991604,0.00050775777,0.0006543348,0.0027974823,0.0027891528,0.0037006189,0.0016510448,0.0017103862,0.016288245],"category_scores_gemma":[0.003573328,0.00047652563,0.00066061306,0.0020795965,0.0026741745,0.0052800067,0.0018654861,0.0023457464,0.0012949149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014518164,0.000057642083,0.0022456504,0.000084340114,0.00002071293,0.00006716816,0.00028798787,0.007246397,0.0014399586,0.9617177,0.011736287,0.014950877],"study_design_scores_gemma":[0.000043061915,0.000024540666,0.002552315,0.00006958871,0.000028064514,0.000174443,0.00041699124,0.03565914,0.0011226283,0.94841325,0.011460286,0.000035636178],"about_ca_topic_score_codex":0.009245168,"about_ca_topic_score_gemma":0.009226999,"teacher_disagreement_score":0.016288245,"about_ca_system_score_codex":0.0031529313,"about_ca_system_score_gemma":0.00095368846,"threshold_uncertainty_score":0.054489613},"labels":[],"label_agreement":null},{"id":"W2575136444","doi":"","title":"On the metric dimension of rotationally-symmetric graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Metric dimension; Dimension (graph theory); Metric (unit); Combinatorics; Pure mathematics; Graph; Chordal graph; 1-planar graph; Business","score_opus":0.012809019090368749,"score_gpt":0.22003943117314678,"score_spread":0.20723041208277804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575136444","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6237035,0.008575325,0.19541493,0.014948517,0.00090439525,0.00009963928,0.0025407448,0.00052462146,0.15328835],"genre_scores_gemma":[0.9575159,0.0024861982,0.026347937,0.0008772976,0.0008343938,0.000120719,0.0010418639,0.00017054821,0.010605108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872667,0.0005146588,0.00006063096,0.00022666714,0.00023050662,0.00024095224],"domain_scores_gemma":[0.9928438,0.004312303,0.0008018607,0.000775742,0.0004567971,0.00080946065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015043468,0.00068489416,0.0009388796,0.00242588,0.0021130654,0.0032819237,0.0018583986,0.0019439425,0.0069390847],"category_scores_gemma":[0.009164637,0.000504509,0.0005301213,0.0023890394,0.003666108,0.008731039,0.002905801,0.0026944857,0.001088694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006542755,0.000033506665,0.0008825167,0.00007361256,0.000013556663,0.000036576264,0.00015438058,0.0030928832,0.0005681873,0.977454,0.0072107995,0.010414437],"study_design_scores_gemma":[0.000014215187,0.000013992344,0.0006676683,0.000023756154,0.000010627084,0.00009944922,0.00014261552,0.01266467,0.0003454844,0.9817755,0.004224247,0.000017661903],"about_ca_topic_score_codex":0.0016664665,"about_ca_topic_score_gemma":0.0016373314,"teacher_disagreement_score":0.0069390847,"about_ca_system_score_codex":0.0019414176,"about_ca_system_score_gemma":0.00070161116,"threshold_uncertainty_score":0.023213565},"labels":[],"label_agreement":null},{"id":"W2575960886","doi":"","title":"Adjacent vertex distinguishing total colorings of graphs with four distinguishing constraints.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.01390378561601815,"score_gpt":0.2102359395646604,"score_spread":0.19633215394864226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575960886","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59441644,0.0007727354,0.27175596,0.002312011,0.00033004992,0.00021741974,0.0037275287,0.0012983711,0.12516949],"genre_scores_gemma":[0.88885254,0.0002871783,0.09173769,0.0004950222,0.000119829994,0.00011854479,0.002527486,0.00029229018,0.015569481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855274,0.00046373653,0.00009405615,0.00030622625,0.00021965736,0.00036357535],"domain_scores_gemma":[0.9919744,0.0049448153,0.0006205607,0.001389175,0.00041384838,0.00065704295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014849076,0.0007367837,0.0007335652,0.0012843205,0.0020456577,0.0034099778,0.0022205368,0.001333615,0.010731132],"category_scores_gemma":[0.005647963,0.0007064029,0.0009699382,0.0019600182,0.0020419718,0.0041444623,0.0023814894,0.0022436248,0.00093657454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003925293,0.00018789037,0.002629266,0.0002668434,0.000056319986,0.00022189118,0.00041639188,0.017663263,0.004858324,0.92104906,0.013125391,0.039132874],"study_design_scores_gemma":[0.000078251986,0.000051443563,0.0012644368,0.000043019532,0.000056730685,0.00027805116,0.0003036773,0.036744766,0.0032717925,0.94830424,0.009565925,0.000037644313],"about_ca_topic_score_codex":0.0023993864,"about_ca_topic_score_gemma":0.0041601616,"teacher_disagreement_score":0.010731132,"about_ca_system_score_codex":0.0018186294,"about_ca_system_score_gemma":0.0012372808,"threshold_uncertainty_score":0.035899222},"labels":[],"label_agreement":null},{"id":"W2577201559","doi":"","title":"On some results for the L(2, 1)-labeling on Cartesian sum graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cartesian product; Combinatorics; Cartesian coordinate system; Geometry","score_opus":0.017062799840080124,"score_gpt":0.2378321075969568,"score_spread":0.22076930775687667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577201559","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082299665,0.011316987,0.3630613,0.023976026,0.0025010877,0.0002849436,0.0027649135,0.0018546905,0.5119403],"genre_scores_gemma":[0.5813949,0.017180279,0.24959762,0.016040577,0.0051913704,0.0011242137,0.0052538523,0.0019527969,0.12226433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980038,0.00058833184,0.00011958262,0.000417933,0.00045040963,0.00041991202],"domain_scores_gemma":[0.99196726,0.005335029,0.00051300036,0.00095063285,0.0005547761,0.00067930535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030032136,0.0016071345,0.0020264469,0.0045088334,0.0049333367,0.005964395,0.003791677,0.003999575,0.025615254],"category_scores_gemma":[0.010889244,0.0013418269,0.0023892508,0.0070184553,0.0055600237,0.014279624,0.0061682872,0.009544423,0.0058884467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008281148,0.00010183393,0.00041737454,0.00029595976,0.000021638667,0.00011514507,0.00034116697,0.0022240698,0.0008239656,0.95657116,0.021135574,0.017869232],"study_design_scores_gemma":[0.000017939428,0.000020899359,0.0003265271,0.00007279576,0.000025969544,0.00013077991,0.00013108109,0.0038080935,0.00046387667,0.98207444,0.012905861,0.0000217484],"about_ca_topic_score_codex":0.0035742295,"about_ca_topic_score_gemma":0.0040787384,"teacher_disagreement_score":0.025615254,"about_ca_system_score_codex":0.0036002432,"about_ca_system_score_gemma":0.0017399688,"threshold_uncertainty_score":0.08569151},"labels":[],"label_agreement":null},{"id":"W2577524466","doi":"","title":"The Number of 1-Factors and Edge-Colorings of Mobius Ladder Graphs and Triangular Embeddings of K 12m+7 .","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Artificial intelligence; Computer science","score_opus":0.009000792358095562,"score_gpt":0.22869143161383748,"score_spread":0.21969063925574192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577524466","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91809285,0.00061479554,0.023602549,0.0019448779,0.00016361356,0.000031455413,0.0011998585,0.00022195047,0.05412807],"genre_scores_gemma":[0.97627664,0.00023811588,0.008256256,0.00017168812,0.00008136297,0.0000404693,0.0006525305,0.00009095247,0.014192058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926025,0.0001732934,0.000048304013,0.00017010634,0.00014446462,0.00020349106],"domain_scores_gemma":[0.9965397,0.0015112394,0.0007144508,0.00036227016,0.00026396263,0.00060838833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000710319,0.0005130055,0.0004689137,0.0014330852,0.001743968,0.0034296676,0.0013958339,0.0012875262,0.0152368415],"category_scores_gemma":[0.003605485,0.00043980582,0.00057882,0.0010189683,0.002459971,0.003348351,0.0013393965,0.0011667719,0.0013871362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008577905,0.000132424,0.0072097005,0.00025163114,0.000049415703,0.00022515793,0.0008348306,0.0068745236,0.011875768,0.9326938,0.0118374005,0.027157502],"study_design_scores_gemma":[0.000066498695,0.00007232987,0.005030953,0.000072275885,0.00005388619,0.0004611718,0.0006187068,0.020115139,0.006544183,0.9576015,0.0093068145,0.000056535613],"about_ca_topic_score_codex":0.0014277622,"about_ca_topic_score_gemma":0.002635771,"teacher_disagreement_score":0.0152368415,"about_ca_system_score_codex":0.0014737387,"about_ca_system_score_gemma":0.0007112761,"threshold_uncertainty_score":0.050972342},"labels":[],"label_agreement":null},{"id":"W2577568408","doi":"","title":"Regular sparse anti-magic squares with maximum density.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Magic square; MAGIC (telescope); Combinatorics; Astrophysics; Physics","score_opus":0.009486961630083644,"score_gpt":0.201786901499796,"score_spread":0.19229993986971236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577568408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28376892,0.0016203735,0.5758057,0.004197221,0.00042975397,0.00017016342,0.0025602982,0.0011550039,0.13029258],"genre_scores_gemma":[0.76975393,0.0006185841,0.19772878,0.001017321,0.00026389916,0.0002264146,0.0015220194,0.00037189704,0.02849721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908996,0.00032849115,0.000039310424,0.00019049432,0.00023582947,0.00011598312],"domain_scores_gemma":[0.99555725,0.0028120908,0.0003738999,0.00060505705,0.00038307506,0.00026865356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076298724,0.0005300026,0.00086758245,0.0008219151,0.0009417349,0.0016803137,0.0014785103,0.0013627763,0.009261649],"category_scores_gemma":[0.007906132,0.0006776445,0.00049113727,0.0012190917,0.0015691157,0.0027893267,0.0019413022,0.001690483,0.0016689411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029580778,0.00007761155,0.00082903926,0.00030694326,0.000043440992,0.00015674524,0.00020085493,0.022426646,0.0049425107,0.90904796,0.021489661,0.04018286],"study_design_scores_gemma":[0.000075530814,0.000034787423,0.00041920066,0.000040716608,0.000017967193,0.00028455598,0.00011996071,0.08652311,0.0021736284,0.90261424,0.007675443,0.000020851454],"about_ca_topic_score_codex":0.0010074889,"about_ca_topic_score_gemma":0.0019577127,"teacher_disagreement_score":0.009261649,"about_ca_system_score_codex":0.0006700314,"about_ca_system_score_gemma":0.0006796965,"threshold_uncertainty_score":0.03098327},"labels":[],"label_agreement":null},{"id":"W2577826848","doi":"","title":"A Note on the Adjacent Vertex Distinguishing Total Chromatic Number of Some Cubic Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics; Vertex (graph theory); Foster graph; Discrete mathematics; Graph; Line graph; Graph power","score_opus":0.011676787735977972,"score_gpt":0.2346533021200371,"score_spread":0.22297651438405913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577826848","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36143512,0.0088954065,0.20226184,0.017344788,0.005229851,0.00016339878,0.0023172756,0.0011546976,0.4011976],"genre_scores_gemma":[0.9074154,0.0024702768,0.06773093,0.0017976103,0.0013711555,0.00009833333,0.00079935323,0.00024633872,0.018070558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991473,0.00016028037,0.000036828074,0.00032532928,0.00021187477,0.00011840387],"domain_scores_gemma":[0.99620926,0.0024781292,0.0002130902,0.00054022606,0.00026263038,0.00029670203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010244313,0.0004781243,0.00060450507,0.0017340513,0.0021070433,0.0020787832,0.0021053567,0.0011091897,0.007878969],"category_scores_gemma":[0.0058831316,0.00036185008,0.0006859897,0.0027190102,0.0029020426,0.003476955,0.001980578,0.0044594947,0.00064894755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023345921,0.000075142125,0.0021133625,0.0003549732,0.000028784038,0.00024988802,0.00038057705,0.0068897936,0.005597779,0.92527133,0.025997642,0.03280725],"study_design_scores_gemma":[0.000029555094,0.00005170989,0.0022196951,0.000042033345,0.000044460634,0.00040517346,0.00019731782,0.020834284,0.002963155,0.9435524,0.029602366,0.00005781929],"about_ca_topic_score_codex":0.0044180993,"about_ca_topic_score_gemma":0.006108504,"teacher_disagreement_score":0.007878969,"about_ca_system_score_codex":0.0026312862,"about_ca_system_score_gemma":0.0011565215,"threshold_uncertainty_score":0.02635777},"labels":[],"label_agreement":null},{"id":"W2578417250","doi":"","title":"On Pell numbers and (k 1 , A 1 , k 2 , A 2 , k 3 , A 3 )-edge colouring in graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Computer science; Artificial intelligence","score_opus":0.008831258257989206,"score_gpt":0.2144585523735491,"score_spread":0.2056272941155599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578417250","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5137537,0.0069425465,0.17510396,0.018813236,0.0011000193,0.0001306568,0.0015044488,0.00056679494,0.2820846],"genre_scores_gemma":[0.92924577,0.0033667856,0.033879995,0.0012202238,0.0007343574,0.00015973876,0.00081138907,0.00023130409,0.030350368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869835,0.0005195049,0.00007726458,0.00021752209,0.00019939733,0.00028792268],"domain_scores_gemma":[0.9911975,0.0061787846,0.0009905315,0.0005907392,0.00036884318,0.000673512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013174528,0.0008794528,0.00083256804,0.0019830405,0.0023977023,0.0044225124,0.0015130477,0.0025642982,0.011882014],"category_scores_gemma":[0.011737861,0.0007307787,0.00078526395,0.0030859562,0.005845162,0.011353753,0.0035282704,0.0035868476,0.0016020569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006179876,0.000020785432,0.0005616074,0.000049249415,0.000006322788,0.000051961175,0.00020266321,0.0028156985,0.00032081135,0.98389524,0.0042109913,0.007802879],"study_design_scores_gemma":[0.000009841252,0.000006204705,0.00027592725,0.000020381925,0.0000051051848,0.00006123328,0.000109783396,0.0033524092,0.0001841702,0.993236,0.0027272028,0.000011772306],"about_ca_topic_score_codex":0.0028911778,"about_ca_topic_score_gemma":0.0032094808,"teacher_disagreement_score":0.011882014,"about_ca_system_score_codex":0.0026198106,"about_ca_system_score_gemma":0.001084839,"threshold_uncertainty_score":0.039749265},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8007098,0.0026416478,0.17113541,0.0049171536,0.00022677437,0.000045787776,0.0008330164,0.00013536889,0.019355072],"genre_scores_gemma":[0.9733061,0.0008318616,0.022821635,0.00023337864,0.00026419328,0.000050940347,0.000550453,0.00006166364,0.001879852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971648,0.0015637673,0.000121902005,0.00043411538,0.00046014987,0.00025529577],"domain_scores_gemma":[0.95900625,0.028791798,0.0040958542,0.003236845,0.0021423434,0.0027269276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003880414,0.0007869022,0.001149709,0.0032974351,0.0016869699,0.004675563,0.001742297,0.0016434501,0.003396246],"category_scores_gemma":[0.03269999,0.00058728794,0.00060559413,0.0031592667,0.0043984125,0.009858515,0.004152797,0.0021898898,0.00022220629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002167991,0.000057037494,0.0061855162,0.00013244023,0.000051868443,0.00003421664,0.00036522487,0.0149022965,0.00073717564,0.9597742,0.002491936,0.015051195],"study_design_scores_gemma":[0.000022773502,0.000052083844,0.0023837914,0.000030026526,0.000021275191,0.00007014505,0.00031463164,0.040535286,0.00046238507,0.95396465,0.002116605,0.000026363086],"about_ca_topic_score_codex":0.0012476251,"about_ca_topic_score_gemma":0.0014154265,"teacher_disagreement_score":0.004675563,"about_ca_system_score_codex":0.002149796,"about_ca_system_score_gemma":0.0008692113,"threshold_uncertainty_score":0.02052182},"labels":[],"label_agreement":null},{"id":"W2578493379","doi":"","title":"On full friendly index sets of twisted product of Mobius ladders.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Product (mathematics); Index (typography); Pure mathematics; Geometry; Computer science; World Wide Web","score_opus":0.010071749396784959,"score_gpt":0.22651815595973812,"score_spread":0.21644640656295316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578493379","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.724224,0.0006656466,0.14033197,0.0007461041,0.0002493338,0.00007269834,0.00079237204,0.00068245304,0.13223542],"genre_scores_gemma":[0.9486305,0.00036339893,0.025632074,0.00030090706,0.00013689775,0.00009522832,0.0006826215,0.00027235836,0.023885991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989654,0.00023360702,0.000060585215,0.00016280785,0.0002724348,0.00030514767],"domain_scores_gemma":[0.99776196,0.00096033135,0.00029813073,0.0003586457,0.00019842257,0.00042243482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008566803,0.000525966,0.00083685515,0.0026197832,0.0027906136,0.0041743335,0.0014009319,0.0011730224,0.012917803],"category_scores_gemma":[0.0031657605,0.0007107354,0.0008254168,0.00188247,0.0020593558,0.006153663,0.0032105702,0.0015389932,0.0019376111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005468068,0.0000232594,0.0003901976,0.00003143841,0.0000057491825,0.00010649778,0.00024713538,0.0009879613,0.000996749,0.99121463,0.0014690997,0.0044725495],"study_design_scores_gemma":[0.000018337621,0.000017871487,0.0003576096,0.000028167458,0.000011492892,0.00015958317,0.00017743431,0.007211557,0.001034377,0.98708504,0.0038824007,0.000016126984],"about_ca_topic_score_codex":0.00095134706,"about_ca_topic_score_gemma":0.0013423125,"teacher_disagreement_score":0.012917803,"about_ca_system_score_codex":0.0014079658,"about_ca_system_score_gemma":0.00046016046,"threshold_uncertainty_score":0.04321438},"labels":[],"label_agreement":null},{"id":"W2578701660","doi":"","title":"On metric dimension of convex polytopes with pendant edges.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Polytope; Dimension (graph theory); Regular polygon; Convex polytope; Metric (unit); Combinatorics; Convex analysis; Pure mathematics; Geometry; Convex optimization","score_opus":0.010988998384004611,"score_gpt":0.21409428389935142,"score_spread":0.20310528551534682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578701660","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.548299,0.007049152,0.3263846,0.008233874,0.0006417864,0.00014788026,0.004003984,0.0005339299,0.104705766],"genre_scores_gemma":[0.92140615,0.0025509603,0.05618207,0.0006890992,0.00069605286,0.0002189983,0.0022446886,0.00028648152,0.015725456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867684,0.0004678385,0.0000659618,0.00028043697,0.0002660934,0.000242782],"domain_scores_gemma":[0.9924631,0.0049013905,0.0008004772,0.0005432269,0.00044173954,0.00084998447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012837889,0.000994457,0.0013452985,0.0025716813,0.00181871,0.0041414797,0.0022145715,0.0018195672,0.008590012],"category_scores_gemma":[0.009690761,0.0008055096,0.000800804,0.002555724,0.0028491928,0.0071156486,0.0032357646,0.0031780484,0.0009784997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015662855,0.00008924528,0.0026103714,0.00022798363,0.000048668542,0.00010606633,0.00029489238,0.020460289,0.0011013844,0.9375671,0.015810004,0.021527363],"study_design_scores_gemma":[0.000031992044,0.00004254894,0.0021160238,0.00006932175,0.000027248154,0.00024365542,0.00036996184,0.07168117,0.00073531544,0.9158331,0.008808744,0.000040895273],"about_ca_topic_score_codex":0.002720817,"about_ca_topic_score_gemma":0.0024782573,"teacher_disagreement_score":0.008590012,"about_ca_system_score_codex":0.0025088463,"about_ca_system_score_gemma":0.00068009074,"threshold_uncertainty_score":0.028736472},"labels":[],"label_agreement":null},{"id":"W2578899218","doi":"","title":"General vertex-distinguishing total coloring of complete bipartite graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Vertex (graph theory); Complete coloring; Edge coloring; Complete bipartite graph; List coloring; Discrete mathematics; Graph; Line graph; Graph power","score_opus":0.019740437863475704,"score_gpt":0.2283816406556256,"score_spread":0.2086412027921499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578899218","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55173904,0.0011769225,0.3271009,0.0032431378,0.00031744663,0.00017366113,0.0036828439,0.0010557201,0.11151035],"genre_scores_gemma":[0.9175972,0.0005272931,0.060980394,0.0006460474,0.00016020292,0.000106667794,0.0025705935,0.00027964968,0.017131947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876934,0.00035601092,0.00005902834,0.0003420708,0.00021081284,0.00026260564],"domain_scores_gemma":[0.99394625,0.0034891772,0.00054044626,0.0011228656,0.0003395671,0.00056167995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014010458,0.0007518772,0.0008044599,0.0010711484,0.0016147008,0.0032530387,0.00193365,0.0014904077,0.008315055],"category_scores_gemma":[0.006000307,0.00065850094,0.0007971901,0.0018010272,0.0020049498,0.0045092064,0.001972149,0.0021116664,0.00070153066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022684208,0.00010774643,0.0016297372,0.00022704921,0.000031542404,0.000098682736,0.00021130058,0.018866425,0.0024662206,0.94729394,0.012666228,0.016174255],"study_design_scores_gemma":[0.000041198553,0.000019525289,0.0005584492,0.00002705188,0.000023700364,0.00016669321,0.00011953802,0.044891737,0.0013203367,0.94772375,0.0050932434,0.000014836048],"about_ca_topic_score_codex":0.0016704465,"about_ca_topic_score_gemma":0.002827716,"teacher_disagreement_score":0.008315055,"about_ca_system_score_codex":0.0021903182,"about_ca_system_score_gemma":0.0012608075,"threshold_uncertainty_score":0.027816653},"labels":[],"label_agreement":null},{"id":"W2579039377","doi":"","title":"On The Super Edge-Magic Deficiency Of 2-Regular Graphs With Two Components.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; MAGIC (telescope); Enhanced Data Rates for GSM Evolution; Combinatorics; Astrophysics; Computer science; Artificial intelligence; Physics","score_opus":0.01259334651858203,"score_gpt":0.20895596112473427,"score_spread":0.19636261460615223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579039377","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71779794,0.0024592644,0.11772868,0.0059130373,0.0004472814,0.000091487665,0.0014105553,0.00047717406,0.1536746],"genre_scores_gemma":[0.9528558,0.00091453944,0.032391284,0.0007811296,0.00023474262,0.000073050105,0.0008106382,0.00013704016,0.011801744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993349,0.00023575843,0.00003141441,0.00012394438,0.00014244266,0.00013150534],"domain_scores_gemma":[0.99651754,0.0022753174,0.0002986137,0.00034917257,0.00021971115,0.00033955713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010203345,0.00047849974,0.00079201174,0.0014953242,0.0014439162,0.0021970083,0.0012065569,0.0014274361,0.008338112],"category_scores_gemma":[0.0051255594,0.0005033802,0.00048591,0.0012654057,0.0023247933,0.005230283,0.0018596196,0.0020201893,0.0010503052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017731338,0.000047670987,0.0011927349,0.00014215459,0.000013529984,0.00012632547,0.00025128666,0.0039562797,0.0015748509,0.9702501,0.007972964,0.014294874],"study_design_scores_gemma":[0.000039072063,0.000021984913,0.00052795635,0.000035788984,0.000013016962,0.00024317461,0.00017845785,0.0124949375,0.00064467744,0.9811343,0.0046515726,0.00001500833],"about_ca_topic_score_codex":0.0013465617,"about_ca_topic_score_gemma":0.0014434885,"teacher_disagreement_score":0.008338112,"about_ca_system_score_codex":0.0010722445,"about_ca_system_score_gemma":0.0006453376,"threshold_uncertainty_score":0.027893782},"labels":[],"label_agreement":null},{"id":"W2579248681","doi":"","title":"Antimagic labelings of cycle powers.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.00785213682064568,"score_gpt":0.2189866468630564,"score_spread":0.21113451004241074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579248681","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25767308,0.002047033,0.34784603,0.004382925,0.00049695006,0.0001815578,0.0022986368,0.0010385682,0.38403514],"genre_scores_gemma":[0.8510118,0.0011958532,0.08055104,0.0009166735,0.0003378661,0.00017763182,0.0018585286,0.00040208627,0.06354853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987614,0.00040829997,0.000085178006,0.00028457487,0.0002647311,0.00019589886],"domain_scores_gemma":[0.99596465,0.0021583452,0.00035437322,0.00074060535,0.0003784069,0.00040360264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085850584,0.00047599745,0.00063013623,0.0019059542,0.002190513,0.003714804,0.0012478122,0.0013353722,0.017695978],"category_scores_gemma":[0.005592688,0.00054642203,0.00079089106,0.0024394477,0.0022213303,0.0064743967,0.0026506232,0.0021454734,0.0027442232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003368425,0.000017755669,0.00020320674,0.000052807613,0.0000058290734,0.000042684394,0.00014669048,0.0008046339,0.00062317087,0.9828631,0.0039693248,0.011237114],"study_design_scores_gemma":[0.000010340787,0.0000067631563,0.00011716066,0.000022132224,0.0000071533036,0.000086198095,0.000106643856,0.0031856531,0.0007128356,0.9855349,0.010203256,0.0000068522554],"about_ca_topic_score_codex":0.0012681705,"about_ca_topic_score_gemma":0.0020128915,"teacher_disagreement_score":0.017695978,"about_ca_system_score_codex":0.0017796753,"about_ca_system_score_gemma":0.0006508984,"threshold_uncertainty_score":0.059198976},"labels":[],"label_agreement":null},{"id":"W2579568859","doi":"","title":"Some new results on k-cordial labeling.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.016619732643166935,"score_gpt":0.23325387578560505,"score_spread":0.21663414314243812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579568859","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05823668,0.009106541,0.39112467,0.014436893,0.0026852065,0.00018484589,0.002927889,0.0025598633,0.5187374],"genre_scores_gemma":[0.5648724,0.011860562,0.26353204,0.011618621,0.004799098,0.00052957085,0.0056287134,0.0019065568,0.1352525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99862635,0.0003064668,0.00010335086,0.0003627877,0.00037905364,0.00022198021],"domain_scores_gemma":[0.9953768,0.0024228597,0.00033285865,0.00092615804,0.0004467657,0.0004945995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015328629,0.00114307,0.0009405902,0.002761404,0.0025056598,0.005139594,0.0023662073,0.001992482,0.027926158],"category_scores_gemma":[0.006527467,0.000702862,0.0012502213,0.005249498,0.003438728,0.012734136,0.003907161,0.006092911,0.00543846],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053892712,0.0000622456,0.0003376921,0.00026931535,0.000013408843,0.00008466935,0.00020688369,0.0014269789,0.0008687266,0.9456556,0.020996565,0.030024013],"study_design_scores_gemma":[0.00001519933,0.000017082777,0.00027871743,0.000057825022,0.000017679318,0.00019468172,0.00010869151,0.003996574,0.0007884031,0.9567473,0.037760958,0.00001686435],"about_ca_topic_score_codex":0.0020670865,"about_ca_topic_score_gemma":0.0030671137,"teacher_disagreement_score":0.027926158,"about_ca_system_score_codex":0.0031172822,"about_ca_system_score_gemma":0.0011344748,"threshold_uncertainty_score":0.09342229},"labels":[],"label_agreement":null},{"id":"W2579588715","doi":"","title":"Edge Friendly Labelings of Graph - I.","year":2016,"lang":"it","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Enhanced Data Rates for GSM Evolution; Combinatorics; Edge-graceful labeling; Line graph; Discrete mathematics; Artificial intelligence; Computer science; Graph power","score_opus":0.012442636603090038,"score_gpt":0.22711236371561294,"score_spread":0.2146697271125229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579588715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15886612,0.0013253794,0.5110995,0.0042149285,0.0006833604,0.00019160645,0.0035994751,0.0025115414,0.3175081],"genre_scores_gemma":[0.7263992,0.0010755117,0.20767109,0.001938743,0.00046206894,0.00027946976,0.0041777166,0.0011093108,0.056886915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99854565,0.0004279049,0.00008772747,0.00034120108,0.00029883446,0.00029881994],"domain_scores_gemma":[0.99600947,0.0018247071,0.00037934605,0.00097580766,0.0003543246,0.00045636413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010102523,0.00071143475,0.0006293335,0.0013855242,0.002014994,0.0042693084,0.0014807965,0.0013383095,0.015929464],"category_scores_gemma":[0.0049405093,0.0005936852,0.0009999665,0.0020878143,0.0016716397,0.0051932787,0.0031430018,0.0030805904,0.003356387],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000665572,0.000044880377,0.00038769623,0.00006933551,0.000008547707,0.000048454334,0.00017133902,0.0017413651,0.0011324857,0.9717082,0.010684885,0.013936402],"study_design_scores_gemma":[0.000014403938,0.000019568255,0.0002787951,0.000028310245,0.000013653328,0.00013022799,0.00011635584,0.0074963523,0.0013756872,0.9732026,0.01730963,0.000014333122],"about_ca_topic_score_codex":0.0011668286,"about_ca_topic_score_gemma":0.0016262517,"teacher_disagreement_score":0.015929464,"about_ca_system_score_codex":0.0015774439,"about_ca_system_score_gemma":0.0007647903,"threshold_uncertainty_score":0.053289354},"labels":[],"label_agreement":null},{"id":"W2579647206","doi":"","title":"On incidence coloring for some graphs of maximum degree 4.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Brooks' theorem; Complete coloring; Edge coloring; Graph coloring; Combinatorics; 1-planar graph; Chordal graph; Graph; Physics; Graph power; Line graph","score_opus":0.025518699968569106,"score_gpt":0.2441269282610874,"score_spread":0.2186082282925183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579647206","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54686385,0.003007801,0.21291818,0.014686446,0.0007477558,0.00019829575,0.0027785092,0.0008966478,0.21790253],"genre_scores_gemma":[0.87246954,0.002237137,0.07877458,0.002058216,0.00070039625,0.0002065195,0.002348663,0.0003800022,0.040824935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992384,0.00023010868,0.00003450924,0.00015397285,0.00011428517,0.0002287785],"domain_scores_gemma":[0.99498594,0.0033637295,0.0004562322,0.00045251692,0.00030503087,0.00043655714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097010913,0.0006126977,0.0006562512,0.0015824361,0.0021791882,0.0030101284,0.0012861982,0.0015358302,0.011045257],"category_scores_gemma":[0.005091976,0.0006151948,0.0008159773,0.0020732789,0.002075097,0.0051497295,0.0018030986,0.0027117739,0.0011832267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016474149,0.000115666735,0.0018215033,0.0001643912,0.000027196984,0.00017908015,0.00047173037,0.008740698,0.0018643434,0.9482711,0.020681897,0.017497726],"study_design_scores_gemma":[0.000031085616,0.000017047294,0.0008793324,0.000035523477,0.000019618135,0.00019461039,0.00032439255,0.018910626,0.0007566358,0.9707419,0.008070327,0.000018824576],"about_ca_topic_score_codex":0.00323941,"about_ca_topic_score_gemma":0.0056209345,"teacher_disagreement_score":0.011045257,"about_ca_system_score_codex":0.0025088512,"about_ca_system_score_gemma":0.0010242634,"threshold_uncertainty_score":0.03695005},"labels":[],"label_agreement":null},{"id":"W2579747194","doi":"","title":"On The Sequential Number And Super Edge-Magic Deficiency Of Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; MAGIC (telescope); Combinatorics; Computer science; Artificial intelligence; Astronomy; Physics","score_opus":0.013027618242226431,"score_gpt":0.22437219906192907,"score_spread":0.21134458081970264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579747194","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6281603,0.0035868061,0.2044501,0.010895045,0.000550287,0.000096827425,0.0016844581,0.00051766756,0.1500585],"genre_scores_gemma":[0.9397992,0.0012066494,0.043845408,0.0007347378,0.0003467949,0.00008772095,0.0007320247,0.0001374466,0.013110051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990652,0.00031095432,0.00004991075,0.0001991615,0.0002011388,0.0001736248],"domain_scores_gemma":[0.9915896,0.0057983208,0.00062140706,0.00094978255,0.00046575515,0.0005751212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016382165,0.0004955138,0.00087610947,0.0018064531,0.0015126056,0.0023919428,0.0015278086,0.0013784472,0.008692134],"category_scores_gemma":[0.010846847,0.0005255681,0.0005319983,0.0018442948,0.0030762865,0.008462219,0.0019533592,0.0022170118,0.00094956305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001572223,0.00004693023,0.0015279093,0.00010709519,0.000013291243,0.000066941044,0.00016632023,0.0045692576,0.0010422865,0.96913147,0.0070545087,0.016116884],"study_design_scores_gemma":[0.000025045674,0.00001728449,0.00047282153,0.000022836684,0.000010146482,0.00015377623,0.000099958714,0.012030198,0.0005087421,0.9833265,0.0033221322,0.000010630858],"about_ca_topic_score_codex":0.0015004684,"about_ca_topic_score_gemma":0.0016693273,"teacher_disagreement_score":0.008692134,"about_ca_system_score_codex":0.0014521139,"about_ca_system_score_gemma":0.00094292406,"threshold_uncertainty_score":0.029078126},"labels":[],"label_agreement":null},{"id":"W2579879218","doi":"","title":"Unique basis graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Basis (linear algebra); Geometry","score_opus":0.010930514856325233,"score_gpt":0.21687160193659177,"score_spread":0.20594108708026654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579879218","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08344003,0.0034206116,0.28609657,0.0047071013,0.0015490202,0.00015350123,0.0040759128,0.0016600647,0.6148972],"genre_scores_gemma":[0.66783065,0.0026215273,0.15362297,0.0019437146,0.00076108286,0.00033795703,0.006258529,0.0011780302,0.16544557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991941,0.00019398384,0.000032133146,0.00023671509,0.00018287354,0.00016021465],"domain_scores_gemma":[0.9987024,0.00039062198,0.00011909685,0.00035511798,0.00023779162,0.00019501924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062456937,0.0006985802,0.0008705109,0.0019749824,0.002154855,0.0029208031,0.0013597226,0.0013209677,0.033337303],"category_scores_gemma":[0.0026283618,0.000535015,0.0008415715,0.0017944564,0.0013962514,0.0043978575,0.0030769242,0.0033959232,0.008258317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024733059,0.000024983186,0.00018796253,0.000061363666,0.0000075957173,0.0000277621,0.00007004563,0.0004025245,0.00054328755,0.9610715,0.014624153,0.022954024],"study_design_scores_gemma":[0.000007619056,0.000006387353,0.00016134196,0.000027752463,0.000009424119,0.00013014609,0.00008088101,0.0021334898,0.00077704067,0.9703298,0.026327465,0.000008645666],"about_ca_topic_score_codex":0.0007091701,"about_ca_topic_score_gemma":0.0015803033,"teacher_disagreement_score":0.033337303,"about_ca_system_score_codex":0.0011117762,"about_ca_system_score_gemma":0.00070746464,"threshold_uncertainty_score":0.11152434},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1274305,0.0013108464,0.72334725,0.0029090082,0.0005844195,0.0002809505,0.0055186776,0.007029851,0.1315885],"genre_scores_gemma":[0.4688349,0.0011208425,0.43564224,0.0018663487,0.0004368419,0.0007540116,0.00828887,0.0030150125,0.08004096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983853,0.00042777476,0.00009083571,0.00050066103,0.00029783597,0.00029772692],"domain_scores_gemma":[0.9977621,0.00082555774,0.00023857215,0.0005759879,0.00030956438,0.00028816235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011175963,0.0010130343,0.00072420744,0.0017206159,0.0015511282,0.0028909717,0.0013633709,0.0009786871,0.014146361],"category_scores_gemma":[0.0042805616,0.0008080632,0.0011764438,0.0016878222,0.002035858,0.005183257,0.0025422801,0.002143486,0.0038160125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027038585,0.000059120783,0.00075555546,0.00020802401,0.000025375643,0.00011253852,0.00048579447,0.008367997,0.0039635682,0.8763324,0.023254318,0.08616495],"study_design_scores_gemma":[0.00002825734,0.000053298903,0.00052792445,0.000065781474,0.000022171043,0.00019019657,0.00014435391,0.021759182,0.0027421827,0.9214296,0.053004697,0.000032406748],"about_ca_topic_score_codex":0.0017728067,"about_ca_topic_score_gemma":0.0026931749,"teacher_disagreement_score":0.014146361,"about_ca_system_score_codex":0.0023733815,"about_ca_system_score_gemma":0.00081471825,"threshold_uncertainty_score":0.0473243},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56122017,0.001902078,0.376559,0.016801191,0.0002895084,0.00024456333,0.003521396,0.001123132,0.038339075],"genre_scores_gemma":[0.8912771,0.0010384048,0.09093754,0.0009206699,0.00046810976,0.00038689762,0.0031622944,0.00058862433,0.011220388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956214,0.0016949135,0.00018111069,0.0010539702,0.00084127847,0.0006073427],"domain_scores_gemma":[0.97418267,0.019832654,0.0014874376,0.0026582933,0.0008042925,0.0010346761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003343455,0.0011587236,0.002358204,0.0016279303,0.0018235596,0.009718994,0.00425977,0.0034463317,0.016461851],"category_scores_gemma":[0.025590448,0.0012840322,0.0018235779,0.00311088,0.004135425,0.013849601,0.004292606,0.004608028,0.001525875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00097254396,0.00024974518,0.00472332,0.00055279845,0.000099438446,0.00016344267,0.0007024379,0.0825311,0.004013242,0.8492066,0.015545145,0.0412401],"study_design_scores_gemma":[0.00007231774,0.000032789278,0.0005537692,0.000029416602,0.000036790887,0.00011149785,0.00015326086,0.14174755,0.00093709276,0.85470283,0.0016008002,0.00002185112],"about_ca_topic_score_codex":0.0018319313,"about_ca_topic_score_gemma":0.0018956944,"teacher_disagreement_score":0.016461851,"about_ca_system_score_codex":0.0039568054,"about_ca_system_score_gemma":0.0025120955,"threshold_uncertainty_score":0.0550704},"labels":[],"label_agreement":null},{"id":"W2592063071","doi":"","title":"L(d, 1)-labelings of the edge-multiplicity-path-replacements.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Multiplicity (mathematics); Enhanced Data Rates for GSM Evolution; Path (computing); Combinatorics; Geometry; Computer science; Telecommunications; Computer network","score_opus":0.01509829393060794,"score_gpt":0.24517396271623143,"score_spread":0.2300756687856235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592063071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36416593,0.0017146289,0.41626227,0.005892146,0.0007763589,0.00029987888,0.0074723475,0.0025674463,0.20084901],"genre_scores_gemma":[0.7893775,0.0007148143,0.16595134,0.0013686535,0.00026149326,0.00030922532,0.003987454,0.00066955166,0.03735995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823964,0.0005430194,0.00012867691,0.0004327574,0.00027632574,0.00037962155],"domain_scores_gemma":[0.9939825,0.0030197813,0.0005715919,0.0013624344,0.0005760213,0.00048771888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013278169,0.0006157949,0.0007021691,0.0015538387,0.0024009573,0.0035691082,0.001833928,0.0017418823,0.016969394],"category_scores_gemma":[0.008763156,0.0006024925,0.0010571379,0.0019182175,0.0019405466,0.004245341,0.0022471093,0.0026609013,0.002930217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028825944,0.000116651645,0.0017929093,0.00023709316,0.00002986605,0.00018356903,0.00034541867,0.004657532,0.003387732,0.92726594,0.021537751,0.0401572],"study_design_scores_gemma":[0.000042803924,0.00003383448,0.00068930665,0.00005791967,0.000033202567,0.00043829583,0.00021816295,0.015548351,0.0029140483,0.95768106,0.022312397,0.00003076586],"about_ca_topic_score_codex":0.001476743,"about_ca_topic_score_gemma":0.0021205996,"teacher_disagreement_score":0.016969394,"about_ca_system_score_codex":0.002312194,"about_ca_system_score_gemma":0.0012613938,"threshold_uncertainty_score":0.05676824},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6289968,0.0009366085,0.31895074,0.0018777504,0.0001819427,0.00013643171,0.002156183,0.0015241723,0.04523941],"genre_scores_gemma":[0.9078643,0.00028730006,0.07742875,0.00026939609,0.0000570808,0.000050779367,0.0031377727,0.00014312773,0.010761574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973816,0.000040449268,0.000012659191,0.00011245781,0.000049235696,0.000047035905],"domain_scores_gemma":[0.9992964,0.00027189293,0.00011269267,0.00014109467,0.00009467699,0.00008312203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012292423,0.00029790506,0.0003646806,0.0004473562,0.0003556525,0.0009866176,0.0004553046,0.0005903333,0.006227044],"category_scores_gemma":[0.0016233673,0.00022538303,0.000335159,0.00058452814,0.0006009913,0.0011568998,0.00071801984,0.0006398549,0.001328207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013322381,0.00022110128,0.011555936,0.0008637993,0.000076858196,0.0011355759,0.0012106181,0.06669602,0.13306993,0.44410953,0.04778977,0.29193857],"study_design_scores_gemma":[0.0001127527,0.00021385461,0.011898239,0.000064205225,0.00004615541,0.0016489031,0.0011826783,0.35997468,0.053505883,0.5199365,0.05136394,0.000052276195],"about_ca_topic_score_codex":0.0014696347,"about_ca_topic_score_gemma":0.00232041,"teacher_disagreement_score":0.006227044,"about_ca_system_score_codex":0.0003299073,"about_ca_system_score_gemma":0.0002765684,"threshold_uncertainty_score":0.020831525},"labels":[],"label_agreement":null},{"id":"W2592736199","doi":"","title":"b-coloring of Cartesian product of odd graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Product (mathematics); Combinatorics; Cartesian coordinate system; Geometry","score_opus":0.017924297168434855,"score_gpt":0.2442690939839433,"score_spread":0.22634479681550845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592736199","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5645368,0.001506915,0.29152498,0.0023163967,0.0005261762,0.00011717479,0.001994006,0.0011474751,0.13633001],"genre_scores_gemma":[0.8564455,0.00064432214,0.108626224,0.00051713525,0.00013222081,0.00010577251,0.0017235647,0.00039194158,0.031413287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993767,0.00019894374,0.00003440442,0.00016315423,0.00008337515,0.0001433601],"domain_scores_gemma":[0.99736387,0.0011792108,0.00030814068,0.000449645,0.0002719389,0.0004271682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006714967,0.00048674303,0.00049362006,0.0010062439,0.0016244078,0.0021460096,0.00092454767,0.00074983976,0.01104347],"category_scores_gemma":[0.002354495,0.00054656214,0.0005331038,0.0011710704,0.0015118056,0.0031821523,0.0017843175,0.0013802358,0.0015466117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002598168,0.00008065153,0.0024502578,0.00018031186,0.000022568289,0.00018192478,0.0003622842,0.00405772,0.0047215363,0.9469204,0.015720354,0.025042135],"study_design_scores_gemma":[0.000042173473,0.00004305965,0.0013670762,0.000047612935,0.00002449287,0.0004370211,0.00035360028,0.019448271,0.0033232674,0.9527717,0.02212017,0.000021602702],"about_ca_topic_score_codex":0.002581313,"about_ca_topic_score_gemma":0.003145858,"teacher_disagreement_score":0.01104347,"about_ca_system_score_codex":0.0009672269,"about_ca_system_score_gemma":0.00065022294,"threshold_uncertainty_score":0.03694403},"labels":[],"label_agreement":null},{"id":"W2593139637","doi":"","title":"Distance labelings and (total-)neighbor-distinguishing colorings of the edge-multiplicity-paths-replacements.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Multiplicity (mathematics); Combinatorics; Enhanced Data Rates for GSM Evolution; Geometry; Computer science; Artificial intelligence","score_opus":0.013429165889767324,"score_gpt":0.23930015890970527,"score_spread":0.22587099301993793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593139637","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49870625,0.0017198899,0.38729694,0.0035770726,0.0004243735,0.0001350381,0.0017353275,0.00086578744,0.10553931],"genre_scores_gemma":[0.8888888,0.0006388811,0.090367615,0.000511876,0.00020434447,0.0001194613,0.0011631206,0.00022783753,0.017878126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986895,0.00044470996,0.00007825402,0.00028946795,0.00024593127,0.0002521863],"domain_scores_gemma":[0.99360824,0.003543591,0.000702744,0.0011002859,0.00047905586,0.00056614244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013141199,0.00054318924,0.0006118264,0.0012097049,0.0017114222,0.0025106107,0.0017964826,0.0012898165,0.007656232],"category_scores_gemma":[0.0075656213,0.0005379728,0.00081862166,0.0018907575,0.0021343702,0.004353227,0.0022171575,0.0023814156,0.0009640749],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108622706,0.000043816864,0.0008641587,0.000081402846,0.000013620565,0.000062126834,0.00021002951,0.0055010184,0.0010612009,0.97107464,0.004717082,0.016262213],"study_design_scores_gemma":[0.00003116362,0.000026194468,0.00042648832,0.000023318515,0.000020416835,0.0002296973,0.0001481786,0.020365566,0.0010965046,0.97087145,0.00674294,0.00001803662],"about_ca_topic_score_codex":0.0014893487,"about_ca_topic_score_gemma":0.0019124537,"teacher_disagreement_score":0.007656232,"about_ca_system_score_codex":0.0018147228,"about_ca_system_score_gemma":0.0008231453,"threshold_uncertainty_score":0.025612712},"labels":[],"label_agreement":null},{"id":"W2593299067","doi":"","title":"On the Bounds for Sizes of Least Common Multiples of Several pairs of graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Multiple; Combinatorics; Arithmetic","score_opus":0.02349092314072028,"score_gpt":0.2534424320612935,"score_spread":0.22995150892057326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593299067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28376636,0.016095415,0.42500514,0.042246107,0.0023486873,0.0007658518,0.014728466,0.0046998346,0.21034406],"genre_scores_gemma":[0.7992262,0.0062038093,0.15761833,0.004001355,0.0037748413,0.0011493878,0.007064886,0.0026200216,0.018341163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9861436,0.004063705,0.0008458926,0.0034804067,0.0028141025,0.00265226],"domain_scores_gemma":[0.7038658,0.2567985,0.008576545,0.01661293,0.0057505616,0.0083956495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012071474,0.0035503863,0.0048708,0.007990682,0.004644398,0.013666826,0.01102663,0.00559474,0.023875946],"category_scores_gemma":[0.12466527,0.0031401152,0.0035637806,0.008277295,0.00892301,0.037418492,0.009633175,0.012255289,0.0049976422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027415352,0.0007002301,0.010204601,0.0015939648,0.0005074175,0.00053193484,0.0015018414,0.044678207,0.0072466913,0.8039906,0.060646772,0.06565627],"study_design_scores_gemma":[0.0001840083,0.00014827095,0.0024230646,0.0002845826,0.00028014573,0.00089301815,0.0004656629,0.070056655,0.0039632637,0.90977955,0.011384396,0.00013740624],"about_ca_topic_score_codex":0.0029714028,"about_ca_topic_score_gemma":0.003694529,"teacher_disagreement_score":0.023875946,"about_ca_system_score_codex":0.007770486,"about_ca_system_score_gemma":0.0041526216,"threshold_uncertainty_score":0.079873025},"labels":[],"label_agreement":null},{"id":"W2593347699","doi":"","title":"Multiplicity of Stars in Complete Graphs and Complete r-partite Graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Multiplicity (mathematics); Stars; Combinatorics; Discrete mathematics; Astronomy; Geometry; Physics","score_opus":0.029073186607363587,"score_gpt":0.25195236785808844,"score_spread":0.22287918125072487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593347699","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.726181,0.0033170532,0.1382135,0.005049347,0.00044273035,0.00008947906,0.0029627243,0.0005952715,0.12314896],"genre_scores_gemma":[0.96457416,0.0008923169,0.020404397,0.0002870399,0.0003238771,0.00008972179,0.0008093967,0.00013914445,0.012479932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834657,0.00055061176,0.00010670473,0.00042758667,0.00027876912,0.00028980602],"domain_scores_gemma":[0.9893366,0.0064152637,0.001527297,0.0009216873,0.0005637009,0.0012353662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014975136,0.0005752282,0.0010162073,0.0028901678,0.0022862137,0.004787377,0.0020081056,0.0018112581,0.010553068],"category_scores_gemma":[0.010350319,0.0009450232,0.00082408235,0.0026129333,0.0029472625,0.007012669,0.0026697677,0.0017574898,0.0014340961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022863378,0.000057583842,0.0038566964,0.00018327354,0.000035983463,0.00013864324,0.00042918907,0.0064500873,0.002072465,0.96247745,0.008998029,0.015071991],"study_design_scores_gemma":[0.000049950777,0.000036184272,0.002372854,0.000060792256,0.000044353732,0.00051178184,0.00040516636,0.018812394,0.0017252652,0.9690815,0.0068625323,0.000037163903],"about_ca_topic_score_codex":0.0009888056,"about_ca_topic_score_gemma":0.0012995383,"teacher_disagreement_score":0.010553068,"about_ca_system_score_codex":0.0017329347,"about_ca_system_score_gemma":0.00065835414,"threshold_uncertainty_score":0.035303533},"labels":[],"label_agreement":null},{"id":"W2593696988","doi":"","title":"Edge Even Graceful Labeling of Some Path and Cycle Related Graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Path (computing); Combinatorics; Computer science; Computer network; Telecommunications","score_opus":0.0106857448164046,"score_gpt":0.23138345278929637,"score_spread":0.22069770797289176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593696988","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6283947,0.0012058459,0.22049546,0.004106371,0.0002990326,0.00015704644,0.002878385,0.0014058106,0.14105737],"genre_scores_gemma":[0.8942335,0.0005994774,0.0745423,0.0006701955,0.0001565061,0.00011190747,0.0021570227,0.00034446354,0.027184673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994873,0.00014141586,0.000024509372,0.00014222316,0.000083616666,0.00012081206],"domain_scores_gemma":[0.9978399,0.00091360236,0.0002947043,0.00051156845,0.00016564301,0.00027441655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005089064,0.0004654535,0.00046058922,0.0009991137,0.001822116,0.0017383405,0.0010138714,0.0008444175,0.008294163],"category_scores_gemma":[0.0025760063,0.00032587576,0.0006074804,0.001212018,0.0012266483,0.0029361828,0.001382411,0.0016915527,0.00097087654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019936329,0.00009124366,0.001178502,0.00015055879,0.000021389711,0.00020195122,0.00040953374,0.00814591,0.0052192425,0.9434156,0.012504072,0.028462717],"study_design_scores_gemma":[0.000027128594,0.00003237169,0.00085615634,0.000027612234,0.00003261519,0.00023001496,0.00023222326,0.023696173,0.0029935234,0.9576965,0.014155421,0.000020229845],"about_ca_topic_score_codex":0.0023219471,"about_ca_topic_score_gemma":0.0027868515,"teacher_disagreement_score":0.008294163,"about_ca_system_score_codex":0.0013315476,"about_ca_system_score_gemma":0.00077249,"threshold_uncertainty_score":0.027746737},"labels":[],"label_agreement":null},{"id":"W2593880467","doi":"","title":"Classifying Pentavalent Symmetric Graphs Of Order 40p.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Order (exchange); Business","score_opus":0.025520373489121864,"score_gpt":0.26233813217348106,"score_spread":0.2368177586843592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593880467","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.835092,0.00047938598,0.044006463,0.0027184954,0.00022552554,0.000072601106,0.0016438714,0.0005193909,0.11524222],"genre_scores_gemma":[0.9626974,0.00028950616,0.015273641,0.00040936,0.00013270912,0.000057451896,0.002116452,0.00018836225,0.018835116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994435,0.000120146804,0.000026867063,0.00013502003,0.00012449571,0.0001498969],"domain_scores_gemma":[0.9979068,0.00095044676,0.00037486025,0.00033209796,0.00017488003,0.00026095097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046816425,0.00046065115,0.00055303395,0.0015230255,0.001855029,0.0033001755,0.0008773985,0.0013328482,0.00882201],"category_scores_gemma":[0.0021400943,0.0004240347,0.0005327914,0.0013530377,0.0019798034,0.00308505,0.0013903896,0.0018276464,0.0011969336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014804614,0.000095177886,0.0025806485,0.00009807945,0.000018461495,0.0001907524,0.00040796542,0.0028296062,0.0046159686,0.9591214,0.011510102,0.018383862],"study_design_scores_gemma":[0.000027048613,0.000021433363,0.0016386238,0.000028756327,0.0000142027875,0.0002456929,0.00034556957,0.011395877,0.0018597733,0.9771993,0.007208422,0.000015280952],"about_ca_topic_score_codex":0.0021445204,"about_ca_topic_score_gemma":0.0032636668,"teacher_disagreement_score":0.00882201,"about_ca_system_score_codex":0.0015655585,"about_ca_system_score_gemma":0.00079506746,"threshold_uncertainty_score":0.029512584},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7654784,0.0032623578,0.1874397,0.0029836092,0.00012510594,0.000103737046,0.0006878065,0.00040065867,0.039518617],"genre_scores_gemma":[0.93275803,0.0004661762,0.05992303,0.00023218588,0.00009297799,0.000063307896,0.00047799372,0.00008471759,0.005901646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956304,0.00017892408,0.000013464005,0.00011518598,0.00005329207,0.00007608843],"domain_scores_gemma":[0.9975809,0.0016784753,0.00024050075,0.00019822523,0.000119416065,0.00018252606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000945324,0.00027989698,0.0007782506,0.0016575026,0.0012903529,0.0013004073,0.0009813177,0.0008279171,0.003960321],"category_scores_gemma":[0.005255891,0.00037197556,0.00039330233,0.0011500272,0.0013480758,0.0019176559,0.0010860147,0.00076832215,0.00029000957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011452658,0.00021056435,0.015307639,0.00033305841,0.00014646725,0.0002340531,0.000585274,0.1805121,0.0047788494,0.6638618,0.01701237,0.11587255],"study_design_scores_gemma":[0.00018265814,0.0001431723,0.003107075,0.00006900632,0.000061034905,0.00023959066,0.0002852382,0.47744367,0.0023961936,0.50881207,0.00722167,0.000038590497],"about_ca_topic_score_codex":0.002166462,"about_ca_topic_score_gemma":0.0045253397,"teacher_disagreement_score":0.003960321,"about_ca_system_score_codex":0.0015781095,"about_ca_system_score_gemma":0.00055009284,"threshold_uncertainty_score":0.013248563},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030758081,0.0007210909,0.94697034,0.0018695418,0.00028889015,0.0003842696,0.00055502757,0.0005352357,0.017917436],"genre_scores_gemma":[0.21267898,0.0015342572,0.76789063,0.00084453897,0.00081075664,0.00078158133,0.002303075,0.00059924694,0.012556939],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973604,0.0010851118,0.000111331494,0.0004980677,0.00056804053,0.00037706952],"domain_scores_gemma":[0.9950597,0.0035706281,0.00026806895,0.0005348319,0.00033234732,0.00023439105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002311866,0.0018311999,0.0017365415,0.0016275026,0.0013832795,0.0025281708,0.002701821,0.0020885833,0.0062084515],"category_scores_gemma":[0.008670361,0.0007747539,0.002758059,0.0029384885,0.0018606944,0.0045574354,0.002791937,0.0043479726,0.0010075566],"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.0003768748,0.0007475544,0.0010095355,0.00056761166,0.00012299497,0.00027945326,0.00043807557,0.5827191,0.0026347253,0.23511374,0.02618054,0.14980978],"study_design_scores_gemma":[0.00012913934,0.00015601353,0.00042518863,0.00007428944,0.00006533114,0.0002481381,0.00019679179,0.6711007,0.0013911224,0.31170362,0.014470962,0.00003869111],"about_ca_topic_score_codex":0.005458819,"about_ca_topic_score_gemma":0.0038568676,"teacher_disagreement_score":0.0062084515,"about_ca_system_score_codex":0.0022265753,"about_ca_system_score_gemma":0.0022827587,"threshold_uncertainty_score":0.020769358},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38698915,0.007013869,0.4084616,0.021559315,0.0009903065,0.00035306392,0.005690414,0.00097549637,0.1679668],"genre_scores_gemma":[0.80262274,0.00441269,0.1475476,0.002103122,0.0012084743,0.00044197953,0.0061070328,0.00063828676,0.034918126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993925,0.00017702466,0.00002133303,0.00022127198,0.00009362207,0.00009416982],"domain_scores_gemma":[0.9964179,0.0023577109,0.00026806316,0.00031979557,0.00025208588,0.00038442353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061534136,0.00064393104,0.0015299487,0.0010278715,0.0015471986,0.0033501976,0.0015537958,0.0021461914,0.012648818],"category_scores_gemma":[0.0049103196,0.0005915183,0.0006961796,0.0022595087,0.001329971,0.004095957,0.0014816032,0.0027068818,0.0009980848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027150495,0.00016075201,0.000957196,0.00073810085,0.000047188132,0.00010714991,0.00027578603,0.028717222,0.00373181,0.85078746,0.0441361,0.0700698],"study_design_scores_gemma":[0.00006678852,0.000022018317,0.000433833,0.000053825588,0.000021485344,0.00009105422,0.00009962323,0.03782745,0.00088065595,0.9499111,0.010577083,0.000015128077],"about_ca_topic_score_codex":0.0015620653,"about_ca_topic_score_gemma":0.0016264437,"teacher_disagreement_score":0.012648818,"about_ca_system_score_codex":0.0019298015,"about_ca_system_score_gemma":0.0011854729,"threshold_uncertainty_score":0.04231453},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009696741,0.0042336923,0.06054547,0.0017067011,0.00085745595,0.000029077628,0.00046758482,0.00061376404,0.9218495],"genre_scores_gemma":[0.33674037,0.007650622,0.035873365,0.0014559071,0.0018310343,0.000151943,0.0016392161,0.0010016186,0.6136559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951935,0.00007115725,0.00002046319,0.000104169114,0.00021427282,0.000070586866],"domain_scores_gemma":[0.99971265,0.00007687184,0.000013572774,0.000100271056,0.00006333553,0.00003335594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003090329,0.000985096,0.0007554592,0.0017008503,0.0017064413,0.003777392,0.0010925588,0.0005977565,0.032696728],"category_scores_gemma":[0.0007762065,0.00053814077,0.00071836927,0.0022204872,0.0023048709,0.004317424,0.0021929657,0.0033736692,0.01155754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066102925,0.000011085835,0.00003913405,0.00004143495,0.00000385899,0.000011988303,0.00010224819,0.00014961767,0.0002317956,0.964999,0.012685844,0.021717522],"study_design_scores_gemma":[0.0000036055178,0.000006767274,0.00015039313,0.000029924435,0.000008841151,0.00009703278,0.000057722078,0.00038322754,0.00050211523,0.86666656,0.13208728,0.000006483128],"about_ca_topic_score_codex":0.0006760713,"about_ca_topic_score_gemma":0.0009433509,"teacher_disagreement_score":0.032696728,"about_ca_system_score_codex":0.0016671197,"about_ca_system_score_gemma":0.0006741249,"threshold_uncertainty_score":0.10938144},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19179145,0.0045236633,0.40438256,0.0028912402,0.0006917199,0.00008750127,0.0009438025,0.00067214854,0.39401603],"genre_scores_gemma":[0.81361663,0.0032391835,0.0941148,0.0007007886,0.0005942186,0.00018278336,0.0010982639,0.00059221924,0.085861124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996586,0.00005306134,0.000017490314,0.000090954854,0.00012391583,0.00005595385],"domain_scores_gemma":[0.9992673,0.0004337457,0.000057077767,0.00011157989,0.00006657024,0.00006378485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035446644,0.0005757526,0.0008661762,0.0015784138,0.0017190686,0.0029049348,0.00093518407,0.0011080042,0.009617011],"category_scores_gemma":[0.0015345956,0.00078920426,0.0007548749,0.001903156,0.0023388693,0.0052745547,0.002313523,0.003359403,0.0012036775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014839006,0.000006778907,0.0000411357,0.000030091218,0.0000014279335,0.000022598297,0.000081666396,0.0008755453,0.00034901648,0.9908021,0.0017609603,0.006013852],"study_design_scores_gemma":[0.000005298012,0.0000048573543,0.000070580965,0.00001209801,0.000002651803,0.000049926886,0.000077258104,0.002854521,0.00035924927,0.9902822,0.006277243,0.0000040935065],"about_ca_topic_score_codex":0.0010084102,"about_ca_topic_score_gemma":0.00088508567,"teacher_disagreement_score":0.009617011,"about_ca_system_score_codex":0.0011780687,"about_ca_system_score_gemma":0.00036377745,"threshold_uncertainty_score":0.032172084},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91500217,0.0011091175,0.068542905,0.00031769706,0.00007104193,0.000026484933,0.00052755175,0.00010168196,0.014301346],"genre_scores_gemma":[0.97338426,0.00068085914,0.023022715,0.00007662303,0.00010740166,0.000041924817,0.00047918814,0.00004766315,0.0021593196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926776,0.00014723442,0.00004584423,0.00019641507,0.00020438706,0.00013834402],"domain_scores_gemma":[0.9975406,0.0008867148,0.0005762487,0.00024304132,0.00035344047,0.00040001667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005335481,0.00041556646,0.00045873533,0.0019668692,0.0007192858,0.0017796627,0.00063088076,0.00047692098,0.0020309445],"category_scores_gemma":[0.0040669264,0.00027780572,0.00035515628,0.0016236779,0.0016954296,0.0021182348,0.0009892804,0.00075233413,0.00028572817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105320345,0.00003132864,0.00328025,0.000070667214,0.000024810237,0.00014097398,0.00056342024,0.010441348,0.004011057,0.9606994,0.0016582645,0.018973079],"study_design_scores_gemma":[0.000020844098,0.000079363635,0.0035826536,0.000028124818,0.000015852864,0.000405183,0.00018774079,0.042984862,0.0022556854,0.94326156,0.0071321432,0.00004596624],"about_ca_topic_score_codex":0.0014762986,"about_ca_topic_score_gemma":0.0009871908,"teacher_disagreement_score":0.0020309445,"about_ca_system_score_codex":0.0010281334,"about_ca_system_score_gemma":0.00046129624,"threshold_uncertainty_score":0.0074597},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80020857,0.00055217854,0.11042511,0.00040020113,0.000098091456,0.000096745935,0.0012639065,0.00033184202,0.086623356],"genre_scores_gemma":[0.9564807,0.00035998426,0.030625127,0.00015812043,0.00011992559,0.0001390408,0.001034713,0.00008248051,0.010999851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912995,0.00011640531,0.00007407369,0.00019137381,0.00029946334,0.00018879642],"domain_scores_gemma":[0.99862707,0.0003801715,0.00034268614,0.00017407577,0.0001949703,0.0002809975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068599393,0.00052018644,0.0004884553,0.0031156377,0.0014793025,0.0023491783,0.00068685383,0.0006170286,0.004533047],"category_scores_gemma":[0.001864619,0.00046080814,0.0006801407,0.0021681346,0.0017068953,0.0029363208,0.001337466,0.0010464041,0.000620737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000857155,0.000038692484,0.0010308549,0.00004608209,0.00001717401,0.00021953757,0.00044012634,0.0020068546,0.0028915014,0.9781637,0.001059895,0.013999739],"study_design_scores_gemma":[0.000019219076,0.000049704282,0.001759322,0.000019391236,0.000021596948,0.00036843348,0.00015689079,0.012761514,0.0021972158,0.97552764,0.0070875054,0.00003163696],"about_ca_topic_score_codex":0.0008797471,"about_ca_topic_score_gemma":0.0009693968,"teacher_disagreement_score":0.004533047,"about_ca_system_score_codex":0.0011029782,"about_ca_system_score_gemma":0.0004614189,"threshold_uncertainty_score":0.015164554},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4818406,0.005645005,0.28385207,0.023522876,0.0011743996,0.0001050453,0.0012406677,0.0006507971,0.2019685],"genre_scores_gemma":[0.9017805,0.0035092314,0.062248457,0.0017461032,0.0019436488,0.0003536198,0.00085859984,0.00042393844,0.027135937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978204,0.0010566511,0.000081510414,0.000372404,0.0003808859,0.0002881987],"domain_scores_gemma":[0.96725243,0.026062747,0.0018673823,0.0016219163,0.0011640087,0.0020315198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005222511,0.001368229,0.0018445951,0.0037907986,0.0031939854,0.005902347,0.0036608134,0.0031652462,0.008605421],"category_scores_gemma":[0.027474519,0.0013156309,0.0011575685,0.0038966434,0.0070629725,0.01402719,0.0034802528,0.006452286,0.001127428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014323575,0.00004310099,0.0007924028,0.00010447649,0.000014069155,0.000028431345,0.00021067708,0.0066387644,0.0005142503,0.98022753,0.0041570426,0.007126071],"study_design_scores_gemma":[0.000026538388,0.000011231692,0.00032107942,0.000027811806,0.000010885725,0.000040290994,0.000049513656,0.0224131,0.00022034241,0.9755293,0.0013362869,0.000013595041],"about_ca_topic_score_codex":0.0018824609,"about_ca_topic_score_gemma":0.0016853685,"teacher_disagreement_score":0.008605421,"about_ca_system_score_codex":0.004480142,"about_ca_system_score_gemma":0.0014967966,"threshold_uncertainty_score":0.03250581},"labels":[],"label_agreement":null},{"id":"W2612440810","doi":"","title":"The Adjacent Vertex Distinguishing Total Chromatic Number of Some Families of Snarks.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Vertex (graph theory); Combinatorics; Graph","score_opus":0.011504315404877936,"score_gpt":0.25035150257348376,"score_spread":0.23884718716860584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612440810","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88859427,0.000526738,0.032820962,0.0015152913,0.00016984373,0.00004742455,0.0012475393,0.0002427124,0.0748353],"genre_scores_gemma":[0.98371416,0.00019388006,0.009205566,0.00017737255,0.00006964509,0.000047466252,0.0006261755,0.00006755508,0.005898078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933076,0.00016805,0.000028669116,0.00020703193,0.00010427847,0.00016120773],"domain_scores_gemma":[0.99583364,0.002501785,0.0004779731,0.0003859528,0.00027746166,0.000523209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094508583,0.00039562667,0.00045921135,0.0017179855,0.0027453366,0.0025002963,0.0014942104,0.0011456988,0.010321419],"category_scores_gemma":[0.0046386085,0.0004675818,0.0006095376,0.0012472639,0.002104298,0.0034214098,0.0013123057,0.0015289051,0.0005211517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046857342,0.00008381389,0.005687103,0.00015618569,0.000044712586,0.000203284,0.00043344902,0.009351408,0.0054934127,0.95452935,0.009582592,0.01396597],"study_design_scores_gemma":[0.00009201011,0.00007425824,0.005025551,0.000053995023,0.000094307754,0.00062396453,0.0006280043,0.052873336,0.0041472074,0.9266141,0.009720514,0.00005272019],"about_ca_topic_score_codex":0.002272283,"about_ca_topic_score_gemma":0.0030775473,"teacher_disagreement_score":0.010321419,"about_ca_system_score_codex":0.0024236366,"about_ca_system_score_gemma":0.0008400461,"threshold_uncertainty_score":0.034528553},"labels":[],"label_agreement":null},{"id":"W2612936850","doi":"","title":"Every Tree is a subtree of Graceful Tree, Graceful Graph and Alpha-labeled Graph.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics; Tree (set theory); Alpha (finance); Discrete mathematics; Statistics","score_opus":0.015738610779799014,"score_gpt":0.24053841068903511,"score_spread":0.2247997999092361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612936850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39398244,0.0015754619,0.46652898,0.0034205369,0.00047052588,0.00014681208,0.0032554558,0.001437139,0.12918259],"genre_scores_gemma":[0.85726297,0.0011012581,0.108856715,0.0007681516,0.00031481902,0.00014603935,0.0024651194,0.00029152117,0.028793428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948066,0.000085170126,0.000035350527,0.00018889547,0.000087575296,0.00012234836],"domain_scores_gemma":[0.99804926,0.00067850476,0.0003182131,0.00041534446,0.00022402884,0.0003146336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045992061,0.00037275546,0.00041024564,0.0012288316,0.0014661681,0.002299177,0.00082774943,0.0008125849,0.006793892],"category_scores_gemma":[0.0018382471,0.00035119362,0.00062775734,0.0019284097,0.0018665405,0.004345554,0.0013521011,0.0013219216,0.0011800072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007530537,0.000025528823,0.00077600474,0.00008828262,0.000013484819,0.00013872297,0.00029145586,0.0011745151,0.003323145,0.973883,0.006401374,0.01380927],"study_design_scores_gemma":[0.000008835853,0.000017264325,0.0006359791,0.00002499032,0.000019823568,0.0003607924,0.0002411638,0.0053901114,0.0017291119,0.97049224,0.021064438,0.000015196939],"about_ca_topic_score_codex":0.0014271057,"about_ca_topic_score_gemma":0.0020258692,"teacher_disagreement_score":0.006793892,"about_ca_system_score_codex":0.0010668117,"about_ca_system_score_gemma":0.0005707211,"threshold_uncertainty_score":0.022727787},"labels":[],"label_agreement":null},{"id":"W2612952466","doi":"","title":"Some results on specific graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.02507550706600073,"score_gpt":0.24814020557703628,"score_spread":0.22306469851103555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612952466","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052537646,0.019053217,0.2995517,0.014233884,0.0019921216,0.00018870662,0.004171684,0.0018598629,0.6064112],"genre_scores_gemma":[0.6104542,0.035969768,0.18864231,0.0144944,0.00579117,0.0009224991,0.012044756,0.0021697436,0.12951122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845755,0.00043691832,0.00008254515,0.0004257294,0.0003770806,0.00022009751],"domain_scores_gemma":[0.99316,0.004248535,0.00046942392,0.0010951359,0.0005162629,0.0005105956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017960302,0.0015253666,0.0015911737,0.0039060386,0.0024252061,0.0041147647,0.0026906098,0.0023516717,0.025609192],"category_scores_gemma":[0.00789055,0.0009553399,0.0019932787,0.006695597,0.002915527,0.010095851,0.0036084703,0.0065923696,0.005458322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042563337,0.0000933278,0.00064456795,0.00062939845,0.000046604597,0.00016053404,0.00019406845,0.0027164915,0.0007909694,0.9315256,0.03711942,0.02603645],"study_design_scores_gemma":[0.00001581283,0.000016470223,0.0006129684,0.000090470545,0.000049230264,0.00032068626,0.000117452444,0.0046571163,0.0006486288,0.9506966,0.042755026,0.000019651574],"about_ca_topic_score_codex":0.0020035163,"about_ca_topic_score_gemma":0.0032528022,"teacher_disagreement_score":0.025609192,"about_ca_system_score_codex":0.002715174,"about_ca_system_score_gemma":0.000896988,"threshold_uncertainty_score":0.085671306},"labels":[],"label_agreement":null},{"id":"W2613842477","doi":"","title":"A stronger relation between coloring number and the modification of Randic index.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Relation (database); Computer science","score_opus":0.02387442292441819,"score_gpt":0.26434538633733534,"score_spread":0.24047096341291715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613842477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3232538,0.0054103397,0.36494088,0.008792361,0.0022568647,0.00018894703,0.0015230104,0.0017423241,0.29189143],"genre_scores_gemma":[0.9282019,0.0009609636,0.050495736,0.0017086649,0.001205084,0.0001410816,0.000482352,0.0004015022,0.016402721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965988,0.0009523419,0.0001792901,0.0012260517,0.0006412896,0.0004022713],"domain_scores_gemma":[0.97309387,0.014184507,0.0037540551,0.0054999045,0.0014513877,0.0020163208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028594597,0.00079578673,0.0012888808,0.002850762,0.0020781632,0.0048841885,0.0030326378,0.002206405,0.014139327],"category_scores_gemma":[0.02655322,0.00066044653,0.00075565185,0.0025923366,0.0043331333,0.012062493,0.0034417456,0.004783292,0.0017849836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019559624,0.00010260897,0.0031133965,0.00014569091,0.000033369008,0.00009626661,0.00017315189,0.0037940994,0.0031873228,0.96581495,0.007717051,0.015626553],"study_design_scores_gemma":[0.00005604811,0.000115500516,0.0039295703,0.00007586969,0.00006648227,0.0007393961,0.00014627824,0.036067974,0.003239224,0.9396236,0.015840882,0.000099109515],"about_ca_topic_score_codex":0.001058876,"about_ca_topic_score_gemma":0.001332308,"teacher_disagreement_score":0.014139327,"about_ca_system_score_codex":0.001949804,"about_ca_system_score_gemma":0.0010558738,"threshold_uncertainty_score":0.047300756},"labels":[],"label_agreement":null},{"id":"W2614067757","doi":"","title":"On (a, b;n)-graceful labeling of path Pn.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Path (computing); Arithmetic; Computer science; Computer network","score_opus":0.015365037558496041,"score_gpt":0.24806922529115652,"score_spread":0.23270418773266047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614067757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28566927,0.001583894,0.50599325,0.0052306233,0.00055960636,0.00024180343,0.003841455,0.003423754,0.19345625],"genre_scores_gemma":[0.78827786,0.0011681982,0.15016444,0.0016272492,0.00038066908,0.00030719343,0.0035072844,0.0010006814,0.053566385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850607,0.00040356847,0.00007651313,0.0003857407,0.00026743865,0.00036060394],"domain_scores_gemma":[0.996014,0.001938822,0.00040414822,0.0010151872,0.00023176993,0.00039613005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001269636,0.0007709849,0.0008123484,0.0013320956,0.0023137168,0.0029712317,0.0016058711,0.0012884671,0.013385373],"category_scores_gemma":[0.004825241,0.0005258329,0.0009928042,0.0020314183,0.002740474,0.0060609938,0.0035783416,0.0025471589,0.0024990377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017365892,0.00006165871,0.00058855925,0.00013345199,0.000018511308,0.00009193836,0.0003263065,0.009229978,0.0017978852,0.9498554,0.012610051,0.0251125],"study_design_scores_gemma":[0.000021756994,0.00001811358,0.00028004812,0.000028063721,0.000015024221,0.000085778396,0.00011831674,0.013066293,0.0009654168,0.97639126,0.008993118,0.000016662634],"about_ca_topic_score_codex":0.0039376263,"about_ca_topic_score_gemma":0.005056399,"teacher_disagreement_score":0.013385373,"about_ca_system_score_codex":0.0027504875,"about_ca_system_score_gemma":0.0014035753,"threshold_uncertainty_score":0.044778585},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.759602,0.0003965957,0.21317455,0.0010237077,0.000063400745,0.000039724357,0.00025031256,0.0005198839,0.024929836],"genre_scores_gemma":[0.95368844,0.0002311925,0.042906728,0.00018533398,0.000061874016,0.00004291969,0.0002894071,0.00009574465,0.002498388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994609,0.00013347733,0.000020543157,0.00015813018,0.00012655121,0.00010044323],"domain_scores_gemma":[0.9959675,0.002101039,0.0005045683,0.0006989588,0.00039684132,0.00033114385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006332295,0.00026740148,0.00044673166,0.0007199885,0.0011343511,0.0010060818,0.00059808703,0.00077600934,0.0025198366],"category_scores_gemma":[0.0041933376,0.00030305833,0.000546384,0.00058851787,0.0013399408,0.0017258411,0.001038048,0.001142788,0.00028056678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013673498,0.0000674157,0.0032260397,0.00011984112,0.000028667442,0.00033864318,0.0008465034,0.017302448,0.016102288,0.9349593,0.0040480196,0.022824168],"study_design_scores_gemma":[0.00001929695,0.00005536406,0.0016636028,0.000015484078,0.000020824245,0.00050991826,0.0002345739,0.15694068,0.005112349,0.82966083,0.0057390514,0.000027966846],"about_ca_topic_score_codex":0.00082457997,"about_ca_topic_score_gemma":0.0009314562,"teacher_disagreement_score":0.0025198366,"about_ca_system_score_codex":0.0010401441,"about_ca_system_score_gemma":0.0004159997,"threshold_uncertainty_score":0.008429706},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55426484,0.006796611,0.33503768,0.022138022,0.00086390146,0.0000980028,0.002522488,0.00037419578,0.0779042],"genre_scores_gemma":[0.94329345,0.003345367,0.03927222,0.0011496871,0.0015676004,0.00016510439,0.0013506867,0.00025439568,0.009601416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975447,0.0010783108,0.00010654146,0.00051772984,0.00043656176,0.0003161567],"domain_scores_gemma":[0.98092055,0.012536171,0.0017524135,0.0015550297,0.0012848813,0.0019509466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029602337,0.0012176243,0.0017095137,0.0039708307,0.0026988727,0.0063903914,0.00266299,0.002721476,0.006435321],"category_scores_gemma":[0.01876298,0.0010228184,0.00094504305,0.0045949384,0.0065031047,0.016056169,0.0045207,0.005375935,0.0006660523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048444905,0.000028269524,0.001005654,0.000057236644,0.000013144795,0.000024027295,0.00018609232,0.002990943,0.00026772567,0.98763937,0.0028754277,0.004863718],"study_design_scores_gemma":[0.000008206443,0.000006619814,0.00030815307,0.00001527717,0.000007839124,0.000032141477,0.00007283445,0.011201256,0.000104566316,0.98675376,0.0014770036,0.0000122712445],"about_ca_topic_score_codex":0.0021952372,"about_ca_topic_score_gemma":0.0015886954,"teacher_disagreement_score":0.006435321,"about_ca_system_score_codex":0.003214349,"about_ca_system_score_gemma":0.0011481959,"threshold_uncertainty_score":0.023321807},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52860457,0.0009847216,0.27765405,0.0023157792,0.00053156284,0.00012472758,0.0021595268,0.0011270009,0.18649803],"genre_scores_gemma":[0.8922726,0.00031289627,0.07438384,0.0004997456,0.00010352752,0.00010234657,0.0012290148,0.00027035823,0.030825725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916434,0.00018635769,0.000054557244,0.00021454548,0.00014830465,0.00023198075],"domain_scores_gemma":[0.9973074,0.0012773655,0.00030196106,0.00040487977,0.00035950943,0.00034887707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007229697,0.00040713744,0.0005680835,0.0012359904,0.0020194328,0.002934861,0.0010891878,0.0013471819,0.011701466],"category_scores_gemma":[0.004204072,0.00078752596,0.0008865045,0.00093788235,0.0025940163,0.003929212,0.0022241962,0.001563502,0.001649853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002029088,0.000023524446,0.0010293315,0.0000804215,0.0000129808695,0.00013421818,0.00031913666,0.0017721591,0.0019185143,0.9734327,0.0056250202,0.015448919],"study_design_scores_gemma":[0.00003661591,0.000017617564,0.0006171332,0.000041629428,0.0000158202,0.00020004186,0.00017644005,0.006470459,0.0015450558,0.9823498,0.008503968,0.00002552485],"about_ca_topic_score_codex":0.002143997,"about_ca_topic_score_gemma":0.0031469394,"teacher_disagreement_score":0.011701466,"about_ca_system_score_codex":0.0012960408,"about_ca_system_score_gemma":0.0006744164,"threshold_uncertainty_score":0.03914529},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81447643,0.00033497426,0.13291006,0.00208955,0.00013692133,0.00016984534,0.0038135366,0.00043384972,0.045634832],"genre_scores_gemma":[0.9155912,0.0002501031,0.064993866,0.00038501382,0.00014472246,0.00034040725,0.005056784,0.00024879657,0.012989094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979011,0.00068746344,0.00017499513,0.00045880748,0.0004486451,0.0003290491],"domain_scores_gemma":[0.98460567,0.008446523,0.002190264,0.0020203767,0.0011773553,0.0015597631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022173896,0.0007566311,0.0012379191,0.003382124,0.003824195,0.0053989515,0.0028785316,0.00209451,0.008177508],"category_scores_gemma":[0.010149738,0.0013476921,0.0015213542,0.0028840757,0.0039323955,0.006090997,0.0027023533,0.0024903137,0.0008728456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047140382,0.00012004295,0.0022750068,0.00018736848,0.000035336812,0.00016929947,0.0007978873,0.006776139,0.0021987,0.9691116,0.0055870158,0.0122702615],"study_design_scores_gemma":[0.000079033736,0.000034309072,0.00074802525,0.000034238077,0.000028753699,0.0001460778,0.00027077124,0.019640056,0.001378925,0.97527415,0.0023388288,0.00002688731],"about_ca_topic_score_codex":0.0013666376,"about_ca_topic_score_gemma":0.001799399,"teacher_disagreement_score":0.008177508,"about_ca_system_score_codex":0.0016442493,"about_ca_system_score_gemma":0.0014577084,"threshold_uncertainty_score":0.027356505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04596028,0.00023179626,0.9413225,0.0001693603,0.000034975015,0.000082084334,0.0001950772,0.00014480492,0.01185915],"genre_scores_gemma":[0.38961154,0.0005095666,0.60503453,0.00013174547,0.00018850838,0.00038111402,0.00066902937,0.00011725812,0.0033567057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929583,0.00012655517,0.000058133013,0.0001616208,0.00029958275,0.000058292066],"domain_scores_gemma":[0.99850523,0.00070624385,0.00020674456,0.00023148683,0.00025873721,0.00009155583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009792383,0.0005521196,0.0006599366,0.004629841,0.0012850105,0.0017390398,0.0011253158,0.00061450154,0.002921303],"category_scores_gemma":[0.0055576437,0.0003984356,0.00068506977,0.0022672897,0.0013402241,0.0038101403,0.0019260636,0.0011253362,0.00040784967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098585406,0.000118574026,0.0030706774,0.00015965528,0.000043956945,0.000097883334,0.0003093502,0.033387385,0.01032583,0.7772064,0.002138762,0.17304298],"study_design_scores_gemma":[0.000026654681,0.00007535121,0.0012649219,0.000030607225,0.000031103278,0.00023887352,0.00016229886,0.18527418,0.005527935,0.7990091,0.008318947,0.000039995866],"about_ca_topic_score_codex":0.0005725515,"about_ca_topic_score_gemma":0.0006250654,"teacher_disagreement_score":0.004629841,"about_ca_system_score_codex":0.0010109735,"about_ca_system_score_gemma":0.00056872173,"threshold_uncertainty_score":0.009772778},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29796374,0.005614983,0.16806757,0.015193932,0.0010267315,0.00023871846,0.004195335,0.0007991176,0.50689983],"genre_scores_gemma":[0.83256626,0.0035133634,0.047590815,0.0038657228,0.0011257322,0.000328071,0.0031970828,0.00033232308,0.10748065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986364,0.00028593745,0.00006886677,0.00048401896,0.00024751722,0.00027731905],"domain_scores_gemma":[0.9930059,0.003985164,0.0006039832,0.0009538506,0.00056106615,0.0008899734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009252888,0.000569997,0.0006287699,0.0026378366,0.0037552053,0.0045916946,0.0013296732,0.0021419637,0.026030965],"category_scores_gemma":[0.006590471,0.0005575157,0.0010273928,0.0031183239,0.0021608572,0.009240356,0.0029505894,0.002788027,0.0021488706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042862186,0.000033959106,0.00074354996,0.00006083486,0.000008637323,0.000059751586,0.00020671889,0.0003901026,0.0002679975,0.97835314,0.008813743,0.011018828],"study_design_scores_gemma":[0.000020634261,0.000017835237,0.0011281364,0.000061545565,0.000015842395,0.00032867576,0.00023028435,0.0030910482,0.00030838943,0.9671496,0.027631056,0.000016812082],"about_ca_topic_score_codex":0.0023079826,"about_ca_topic_score_gemma":0.0031005722,"teacher_disagreement_score":0.026030965,"about_ca_system_score_codex":0.0031241667,"about_ca_system_score_gemma":0.00079666387,"threshold_uncertainty_score":0.08708221},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21328638,0.0023832864,0.6825617,0.0054319827,0.00072807947,0.00036235657,0.00753512,0.0013331352,0.086378016],"genre_scores_gemma":[0.6285318,0.0024689697,0.33755928,0.0014498857,0.00055574975,0.00045673896,0.006636706,0.0007811793,0.021559762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991788,0.00023192461,0.00003814879,0.0002275798,0.0001566583,0.0001668731],"domain_scores_gemma":[0.9972671,0.0016018057,0.00022764728,0.00034969408,0.00020338579,0.00035028486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007372251,0.001005299,0.0013882185,0.00075376756,0.0010977288,0.0028498662,0.002506492,0.0019333077,0.01522988],"category_scores_gemma":[0.004408399,0.00070083066,0.0009644827,0.0025557252,0.0010338648,0.0036614847,0.002028226,0.0029764078,0.0012866871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011254087,0.00043658086,0.0017872973,0.0010000428,0.00013537929,0.00041624028,0.00045944884,0.13779157,0.0075734966,0.60462403,0.06522663,0.17942393],"study_design_scores_gemma":[0.00020257689,0.000097348304,0.0010933797,0.00012659891,0.0000605582,0.00043575003,0.00027487744,0.19650604,0.0029020805,0.7693164,0.02893039,0.00005408801],"about_ca_topic_score_codex":0.003071104,"about_ca_topic_score_gemma":0.0024079345,"teacher_disagreement_score":0.01522988,"about_ca_system_score_codex":0.0012900174,"about_ca_system_score_gemma":0.0012443721,"threshold_uncertainty_score":0.050949037},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43361858,0.0007377403,0.53326374,0.0020677438,0.00007562518,0.00024655132,0.00076430646,0.00094304036,0.028282776],"genre_scores_gemma":[0.7994789,0.0004124167,0.1915285,0.00037588013,0.000048354792,0.00022183084,0.00072441384,0.00014500746,0.0070648124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876595,0.00034934364,0.000053591724,0.00027904427,0.00029978107,0.00025225713],"domain_scores_gemma":[0.9967969,0.001336742,0.00035461757,0.00086199486,0.00032522553,0.0003246055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011582226,0.000501325,0.0008242072,0.00051716896,0.0014687029,0.0018719024,0.002285835,0.0014400485,0.0055515515],"category_scores_gemma":[0.0042468063,0.00040024862,0.0005321834,0.001029012,0.0011949132,0.0037240486,0.0023230952,0.001040951,0.0009903796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013752031,0.0003165559,0.002395761,0.0004592738,0.00009822273,0.0002549102,0.0005724467,0.27565327,0.037917793,0.52150685,0.01368993,0.1457598],"study_design_scores_gemma":[0.00014999231,0.0003360726,0.0008376039,0.000030103469,0.000045152665,0.00045808617,0.00029750768,0.7466131,0.016411949,0.22181858,0.012953474,0.000048422058],"about_ca_topic_score_codex":0.002244136,"about_ca_topic_score_gemma":0.0026832304,"teacher_disagreement_score":0.0055515515,"about_ca_system_score_codex":0.001972379,"about_ca_system_score_gemma":0.0011284174,"threshold_uncertainty_score":0.018571794},"labels":[],"label_agreement":null},{"id":"W2756549319","doi":"","title":"On the incidence energy of graphs under three graph decorations.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.020944007805663526,"score_gpt":0.24314225332933953,"score_spread":0.222198245523676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756549319","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7330327,0.0014305613,0.110832065,0.0044892174,0.00046359623,0.00004409785,0.00077591464,0.0002678809,0.14866403],"genre_scores_gemma":[0.9713458,0.0005290771,0.011558464,0.00037400742,0.00018235012,0.00007118304,0.00041180305,0.00015623016,0.015371091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994516,0.00015922856,0.00002512461,0.00008862995,0.00012943275,0.00014605462],"domain_scores_gemma":[0.9979292,0.0012157717,0.00021955746,0.000279831,0.00013711388,0.00021841699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008230983,0.00038713717,0.0005685439,0.0016201263,0.001474885,0.0024199674,0.0011801987,0.0018064401,0.011429977],"category_scores_gemma":[0.0037912144,0.0003741277,0.0004771636,0.0012873006,0.0022379989,0.003615376,0.001767661,0.0016254089,0.0009933766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005077782,0.00003155565,0.0007229955,0.000040800307,0.000008707025,0.000053434847,0.00011704371,0.0054861153,0.0013073393,0.98174953,0.003111198,0.0073204837],"study_design_scores_gemma":[0.000011106386,0.000010952158,0.0008998542,0.000020825608,0.0000070589886,0.00012349506,0.00018394798,0.023519034,0.00077813823,0.9724221,0.002010338,0.000013200988],"about_ca_topic_score_codex":0.00077790656,"about_ca_topic_score_gemma":0.0010801943,"teacher_disagreement_score":0.011429977,"about_ca_system_score_codex":0.0009967644,"about_ca_system_score_gemma":0.00035677213,"threshold_uncertainty_score":0.038237035},"labels":[],"label_agreement":null},{"id":"W2756842156","doi":"","title":"The Extremal Function for Three Disjoint Theta Graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Disjoint sets; Mathematics; Combinatorics; Function (biology); Discrete mathematics; Evolutionary biology; Biology","score_opus":0.02437847912830196,"score_gpt":0.24443164969916023,"score_spread":0.22005317057085827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756842156","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7514565,0.001035522,0.083440274,0.003903339,0.0002968627,0.00004337849,0.00070205773,0.0003672545,0.15875478],"genre_scores_gemma":[0.97711474,0.0003260554,0.011583317,0.00021001308,0.00009319798,0.00004169582,0.00033553498,0.00011404751,0.010181491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995796,0.00012738214,0.00001591813,0.0000679067,0.000082382496,0.00012678756],"domain_scores_gemma":[0.998543,0.0007714982,0.00018130675,0.0001477742,0.000105112784,0.00025127054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007512297,0.00052574044,0.00053333817,0.0021924295,0.0018796308,0.0028961655,0.0012303946,0.0016380918,0.009593319],"category_scores_gemma":[0.003380747,0.00032329437,0.0005908557,0.0011722981,0.0026045637,0.0033693449,0.001998541,0.002011345,0.0011939228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008231508,0.000022690052,0.0005487394,0.000042542026,0.0000086672035,0.00007340977,0.00013602481,0.0020272287,0.0009190042,0.98440033,0.003260857,0.008478237],"study_design_scores_gemma":[0.000022655482,0.000012355325,0.0007255824,0.000025687259,0.000012237309,0.00020482921,0.00021088263,0.0120015,0.0010100015,0.9817379,0.0040194206,0.00001683964],"about_ca_topic_score_codex":0.0008794344,"about_ca_topic_score_gemma":0.0009692,"teacher_disagreement_score":0.009593319,"about_ca_system_score_codex":0.0014611586,"about_ca_system_score_gemma":0.0005019861,"threshold_uncertainty_score":0.03209281},"labels":[],"label_agreement":null},{"id":"W2756969445","doi":"","title":"Upper bound on the primitive exponents of a class of three-colored digraphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Colored; Mathematics; Class (philosophy); Combinatorics; Upper and lower bounds; Mathematical analysis; Computer science; Artificial intelligence","score_opus":0.025171185437890913,"score_gpt":0.24406306707872613,"score_spread":0.21889188164083523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756969445","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62974155,0.0027242035,0.10926869,0.004732739,0.0006657897,0.0001467153,0.0028113062,0.0009188563,0.24899012],"genre_scores_gemma":[0.9637127,0.00077781634,0.020743849,0.00035894336,0.00031715241,0.00007435383,0.00086831127,0.00014999675,0.012996919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934167,0.00011004441,0.00003196001,0.000146616,0.00014632868,0.00022346829],"domain_scores_gemma":[0.9933323,0.0045727217,0.00040922762,0.00052952586,0.00033868407,0.00081756705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081274414,0.00085356727,0.0010480473,0.0015635899,0.0021229158,0.0036523894,0.001332819,0.000980018,0.013645613],"category_scores_gemma":[0.0057703243,0.0004618096,0.00071361987,0.0011353105,0.0021756308,0.003513613,0.002472662,0.0034662555,0.0017133525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022728418,0.00007794973,0.0017879903,0.00019460791,0.000023863708,0.00021714099,0.00024598776,0.003822201,0.0036267263,0.96350235,0.009816383,0.016457396],"study_design_scores_gemma":[0.00007250139,0.000051415987,0.0014650958,0.00007659396,0.000038491355,0.00043387522,0.00014668566,0.018589018,0.0023039128,0.9624278,0.014362384,0.00003218206],"about_ca_topic_score_codex":0.000772012,"about_ca_topic_score_gemma":0.0012510427,"teacher_disagreement_score":0.013645613,"about_ca_system_score_codex":0.0015785829,"about_ca_system_score_gemma":0.00079244206,"threshold_uncertainty_score":0.04564917},"labels":[],"label_agreement":null},{"id":"W2757174746","doi":"","title":"Yang Hui type magic squares with t-powered sum.","year":2017,"lang":"id","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Magic square; Mathematics; MAGIC (telescope); Type (biology); Combinatorics; Astrophysics; Physics; Biology; Ecology","score_opus":0.01977247855486697,"score_gpt":0.25166264595459675,"score_spread":0.23189016739972979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757174746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21084417,0.0017159064,0.39772618,0.0038046343,0.0020096067,0.00017732916,0.0013912355,0.0012335005,0.38109747],"genre_scores_gemma":[0.7410023,0.00071661425,0.1458802,0.0015704558,0.00046432042,0.000261317,0.0009154611,0.00056213536,0.10862715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994424,0.0001440258,0.000028417977,0.00012643125,0.0001480322,0.00011064357],"domain_scores_gemma":[0.9992459,0.00028696234,0.00008184387,0.00015179707,0.000106894084,0.00012669482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005586953,0.0005364034,0.0007508097,0.0010656528,0.0016748314,0.002038012,0.0012523142,0.0012784074,0.02200821],"category_scores_gemma":[0.0023837574,0.00047436453,0.0007582303,0.0012655038,0.0016721499,0.003887801,0.0028073767,0.0023026043,0.003436286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005723904,0.000019822903,0.00015357675,0.00006644969,0.000011741087,0.00009085082,0.0000903235,0.0011819928,0.0012461843,0.97827727,0.0070133014,0.0117913205],"study_design_scores_gemma":[0.000019968287,0.000013325541,0.000097074386,0.00001261573,0.000008031429,0.00012522348,0.000059490707,0.0053901165,0.0009624747,0.9872006,0.0060980357,0.000013062406],"about_ca_topic_score_codex":0.0005840701,"about_ca_topic_score_gemma":0.0012382086,"teacher_disagreement_score":0.02200821,"about_ca_system_score_codex":0.0006803793,"about_ca_system_score_gemma":0.0006846821,"threshold_uncertainty_score":0.07362479},"labels":[],"label_agreement":null},{"id":"W2757399776","doi":"","title":"On Lower Orientable Strong Diameter And Strong Radius Of Some Graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; RADIUS; Combinatorics; Computer science; Computer network","score_opus":0.014186388954428798,"score_gpt":0.23955809925915889,"score_spread":0.22537171030473008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757399776","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5947278,0.01042565,0.22327334,0.010520313,0.000595434,0.00012458308,0.0018661185,0.0010568098,0.15740994],"genre_scores_gemma":[0.9381181,0.0027111876,0.04183642,0.0012014197,0.0008781848,0.00021827148,0.0009270494,0.000454205,0.013655037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979513,0.00062380516,0.000098265176,0.0006125879,0.0003229494,0.00039103237],"domain_scores_gemma":[0.9801993,0.014403701,0.0015839002,0.0012847872,0.00072436716,0.0018040772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024641813,0.0012255459,0.0018187948,0.0026223739,0.0023015244,0.0045579374,0.0028934497,0.0021235552,0.009945833],"category_scores_gemma":[0.016688067,0.0009607107,0.001123245,0.0022530206,0.003721836,0.010698985,0.0034317088,0.0041893115,0.0016973392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033558215,0.00012051988,0.002683851,0.00034870656,0.000052261632,0.00014846155,0.0006333297,0.008680026,0.0036798278,0.9541932,0.011656233,0.017467964],"study_design_scores_gemma":[0.000056273482,0.000083442654,0.0027506107,0.000089047644,0.000087369546,0.0003871593,0.00041857606,0.033707872,0.0023346546,0.9498839,0.010149781,0.00005133688],"about_ca_topic_score_codex":0.0013200232,"about_ca_topic_score_gemma":0.0014778423,"teacher_disagreement_score":0.009945833,"about_ca_system_score_codex":0.002674298,"about_ca_system_score_gemma":0.000708069,"threshold_uncertainty_score":0.033272147},"labels":[],"label_agreement":null},{"id":"W2757767771","doi":"","title":"Genus embeddings of two types of graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Genus; Combinatorics; Zoology; Biology","score_opus":0.01544491280564171,"score_gpt":0.2648138469072235,"score_spread":0.24936893410158179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757767771","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.596602,0.0016285756,0.14955372,0.0061717397,0.0006721626,0.00010764499,0.0019147109,0.0010128956,0.2423365],"genre_scores_gemma":[0.9280729,0.00077758654,0.03969053,0.00067964295,0.0002132621,0.00010039157,0.0014636302,0.00029279248,0.02870925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989735,0.00025934854,0.00006646136,0.00023689066,0.00022200974,0.00024183352],"domain_scores_gemma":[0.9963044,0.0017887444,0.00048028617,0.0006593479,0.00023417761,0.00053296215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061373186,0.0006457745,0.00058566243,0.0022353022,0.0020812906,0.0046829516,0.0015223621,0.002169598,0.013138997],"category_scores_gemma":[0.005139911,0.000689082,0.00093436457,0.0021212122,0.0026604205,0.0071205255,0.0033632866,0.0025987383,0.001315602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008454402,0.000036825237,0.0011097022,0.00006593086,0.000008813295,0.00013386692,0.00042673762,0.0011574896,0.00093428465,0.980412,0.0049496605,0.01068022],"study_design_scores_gemma":[0.000026871474,0.000021545431,0.0013124787,0.000068807116,0.000027122785,0.00047570132,0.00072271953,0.007759656,0.0013447428,0.9740335,0.014181795,0.00002506544],"about_ca_topic_score_codex":0.0010856878,"about_ca_topic_score_gemma":0.0015056524,"teacher_disagreement_score":0.013138997,"about_ca_system_score_codex":0.0016395343,"about_ca_system_score_gemma":0.0004197297,"threshold_uncertainty_score":0.043954372},"labels":[],"label_agreement":null},{"id":"W2757968219","doi":"","title":"A class of degree-magic join graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Join (topology); Degree (music); MAGIC (telescope); Class (philosophy); Combinatorics; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.02861543545232307,"score_gpt":0.25266846482022015,"score_spread":0.2240530293678971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757968219","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41374967,0.0016474153,0.27054346,0.004225292,0.00049900066,0.0002977584,0.0053088767,0.002094924,0.30163357],"genre_scores_gemma":[0.8859088,0.0007859962,0.067218944,0.0009170195,0.00037035442,0.00017356401,0.0046831616,0.00028230742,0.039659884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999345,0.000083227445,0.000030308498,0.00023423016,0.00017606182,0.00013115912],"domain_scores_gemma":[0.9978319,0.0008371284,0.00035069554,0.0004287577,0.00020277701,0.00034876209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050238246,0.00041507636,0.00054926606,0.0014892536,0.0020477546,0.0033525722,0.0012719944,0.0009689064,0.013769154],"category_scores_gemma":[0.0026475417,0.0003772414,0.0006319851,0.0017433829,0.0013056352,0.003623164,0.0016899093,0.0019073688,0.001462759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010497142,0.00006237635,0.0010668642,0.00008340368,0.000016984673,0.00013511957,0.0001656205,0.0016760977,0.002092219,0.96261275,0.010606724,0.021376891],"study_design_scores_gemma":[0.00004587515,0.000028701255,0.0011214252,0.000032042386,0.000023948296,0.00049453933,0.00023194548,0.010763767,0.0017391342,0.94972444,0.035774287,0.000019944053],"about_ca_topic_score_codex":0.0011257469,"about_ca_topic_score_gemma":0.0015617158,"teacher_disagreement_score":0.013769154,"about_ca_system_score_codex":0.0009908684,"about_ca_system_score_gemma":0.0007567786,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2758173474","doi":"","title":"The chromatic number of the square of a Halin graph with maximum degree five is six.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Square (algebra); Graph; Degree (music); Discrete mathematics; Geometry","score_opus":0.015988689265407304,"score_gpt":0.24314686155322127,"score_spread":0.22715817228781396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758173474","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8927196,0.00046986385,0.015134271,0.0033466031,0.0002268665,0.000029514998,0.0010914044,0.00025104693,0.086730726],"genre_scores_gemma":[0.981023,0.00019689031,0.0071964287,0.00018517948,0.00004161287,0.00001570785,0.00059827487,0.000045702098,0.010697185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997484,0.000042266813,0.000009909691,0.00006615455,0.000045980894,0.00008728045],"domain_scores_gemma":[0.99877614,0.0005991168,0.00017703566,0.0001015697,0.0000862654,0.00025980698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023172399,0.00031894716,0.0002572646,0.0006641016,0.0015591749,0.0017939371,0.00061502215,0.0008413338,0.012030282],"category_scores_gemma":[0.0009817975,0.00024171558,0.00034212557,0.00060996297,0.0016619327,0.0014306144,0.000765165,0.0009340152,0.0011261163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018568297,0.00020744075,0.0125518255,0.00067466334,0.00008854266,0.0008203635,0.0011284981,0.019026058,0.05115037,0.82432765,0.029783882,0.058383882],"study_design_scores_gemma":[0.00017530177,0.00022998173,0.018439772,0.000110903275,0.00009164746,0.0013465441,0.0017249865,0.038758915,0.040966425,0.8401204,0.057901736,0.00013349146],"about_ca_topic_score_codex":0.0030864635,"about_ca_topic_score_gemma":0.005673851,"teacher_disagreement_score":0.012030282,"about_ca_system_score_codex":0.0010831181,"about_ca_system_score_gemma":0.00061531056,"threshold_uncertainty_score":0.040245295},"labels":[],"label_agreement":null},{"id":"W2758256579","doi":"","title":"Some results and remarks on harmonic mean and mean cordial labelings.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Harmonic mean; Combinatorics; Harmonic; Statistics; Acoustics; Physics","score_opus":0.01741133330315237,"score_gpt":0.24534224075566044,"score_spread":0.22793090745250807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758256579","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09837237,0.012626013,0.39520746,0.02601489,0.0030304699,0.00015097161,0.0025169172,0.0012861864,0.46079466],"genre_scores_gemma":[0.7046244,0.013486697,0.15221804,0.011382199,0.006003531,0.0005592343,0.0033108438,0.0011772501,0.1072378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859935,0.00044147452,0.00007521593,0.00030644418,0.000374522,0.00020299974],"domain_scores_gemma":[0.9936953,0.0040365253,0.00039633378,0.00075921713,0.000598109,0.0005145092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002130794,0.0008352872,0.0010201602,0.0026538318,0.0026311257,0.0042699454,0.002364416,0.0024646043,0.024375891],"category_scores_gemma":[0.011195764,0.0006173086,0.0011728331,0.0044515356,0.003843232,0.009342116,0.003432056,0.0053642094,0.00314844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025296484,0.000025007566,0.00023393695,0.00010466599,0.0000071784116,0.000044213375,0.00013556583,0.00071726704,0.00032648953,0.9804081,0.009384024,0.008588236],"study_design_scores_gemma":[0.0000066701955,0.000011888302,0.0002861056,0.000025391211,0.000008918425,0.00009250415,0.0000965396,0.002325082,0.00024014743,0.98559433,0.011299909,0.00001263317],"about_ca_topic_score_codex":0.002400751,"about_ca_topic_score_gemma":0.0030124537,"teacher_disagreement_score":0.024375891,"about_ca_system_score_codex":0.002762639,"about_ca_system_score_gemma":0.0009110299,"threshold_uncertainty_score":0.08154547},"labels":[],"label_agreement":null},{"id":"W2759293601","doi":"","title":"A note on broom number and maximum edge-cut of graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Broom; Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Geography; Artificial intelligence","score_opus":0.013546369645555768,"score_gpt":0.25286546818805405,"score_spread":0.23931909854249828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759293601","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0398005,0.054000136,0.26381978,0.041393388,0.018204676,0.00020659172,0.0027834917,0.0011997824,0.5785917],"genre_scores_gemma":[0.5500892,0.04376605,0.26009506,0.014005263,0.023025718,0.00047804305,0.0025887287,0.0013304973,0.10462141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997766,0.00059646886,0.00013915832,0.00065635674,0.0006282813,0.00021375278],"domain_scores_gemma":[0.98928016,0.008063871,0.000377696,0.0010892707,0.0006787052,0.0005102272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025186578,0.0013119983,0.0017811371,0.0048024654,0.0027143168,0.0046968297,0.0036918463,0.0029952812,0.017980652],"category_scores_gemma":[0.015050924,0.0009730064,0.0016310991,0.0055108806,0.005371865,0.012366213,0.0038146714,0.009044813,0.002797332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019834914,0.0000697567,0.00090157025,0.0004828899,0.000043005453,0.0002536068,0.00019487459,0.0029897715,0.0015854914,0.8935865,0.060553994,0.039140094],"study_design_scores_gemma":[0.000015972573,0.00002565231,0.00088549696,0.00010335161,0.000029508294,0.0002768424,0.0001005565,0.0044096876,0.00077834865,0.949407,0.043930274,0.000037239133],"about_ca_topic_score_codex":0.0036710787,"about_ca_topic_score_gemma":0.004925765,"teacher_disagreement_score":0.017980652,"about_ca_system_score_codex":0.0031175308,"about_ca_system_score_gemma":0.001029161,"threshold_uncertainty_score":0.06015134},"labels":[],"label_agreement":null},{"id":"W2759569093","doi":"","title":"Equitable coloring of Cartesian product of some graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Product (mathematics); Combinatorics; Geometry","score_opus":0.02055803068596021,"score_gpt":0.25059924738974604,"score_spread":0.23004121670378583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759569093","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49477592,0.00095852936,0.34671822,0.0026676827,0.00034889183,0.00011894029,0.0016376179,0.0009197793,0.15185447],"genre_scores_gemma":[0.859707,0.0004888396,0.10444124,0.0005100324,0.00015346846,0.00012310152,0.0016687171,0.00036646155,0.03254126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851817,0.0005034339,0.000087875196,0.00042324772,0.00020529683,0.00026197286],"domain_scores_gemma":[0.9949486,0.0024101576,0.00046409908,0.0010906844,0.0005574678,0.0005289437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010747653,0.00052094663,0.0005981996,0.0011100131,0.0023012706,0.0026736734,0.0011171832,0.0008947111,0.011731038],"category_scores_gemma":[0.0041474015,0.000627825,0.00070753717,0.001632412,0.0019242868,0.004697576,0.0024166796,0.0019228469,0.0013797922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118185424,0.000063206186,0.0011802487,0.00009797449,0.000017883058,0.0001716622,0.00043640457,0.0030104045,0.0020346032,0.9715386,0.00653243,0.014798448],"study_design_scores_gemma":[0.0000280967,0.000033205608,0.0008406954,0.000034208373,0.000032423006,0.00048741425,0.00036771243,0.012780007,0.0030486612,0.963569,0.018757926,0.000020744967],"about_ca_topic_score_codex":0.0018635269,"about_ca_topic_score_gemma":0.002637459,"teacher_disagreement_score":0.011731038,"about_ca_system_score_codex":0.0013974926,"about_ca_system_score_gemma":0.000705648,"threshold_uncertainty_score":0.039244175},"labels":[],"label_agreement":null},{"id":"W2760485458","doi":"","title":"On the vertex-distinguishing proper total colorings of complete p-partite graphs with equipotent parts.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.02871722934859999,"score_gpt":0.2302532340082373,"score_spread":0.2015360046596373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760485458","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67202985,0.0013380981,0.20229863,0.0026456825,0.00029046598,0.00013067653,0.0016385157,0.0005912173,0.11903681],"genre_scores_gemma":[0.9450018,0.0006090521,0.039201293,0.0005092282,0.00019261088,0.00010833401,0.0011539853,0.00020382875,0.013019853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989268,0.00039612892,0.000051494535,0.00022008906,0.00017971662,0.00022576754],"domain_scores_gemma":[0.9936924,0.0042350837,0.0005804805,0.00064003497,0.00028601213,0.00056608696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012178435,0.0006751119,0.00068457995,0.0015474085,0.0020771052,0.0032200757,0.0013679744,0.0014371716,0.006957682],"category_scores_gemma":[0.0059343874,0.0008661395,0.00095519616,0.0016875797,0.0029951318,0.004446528,0.0021319361,0.002339331,0.0007412989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015465454,0.000056904326,0.0013423448,0.00012009033,0.000021792686,0.00009897692,0.00038215253,0.00907251,0.0018971828,0.9698169,0.006130857,0.010905643],"study_design_scores_gemma":[0.000037144953,0.000028391076,0.0008910462,0.000036759393,0.000022802364,0.0001694742,0.00018563056,0.024090495,0.00084120425,0.97008497,0.0035933657,0.000018633567],"about_ca_topic_score_codex":0.0018328078,"about_ca_topic_score_gemma":0.0025668521,"teacher_disagreement_score":0.006957682,"about_ca_system_score_codex":0.0016670711,"about_ca_system_score_gemma":0.00076475245,"threshold_uncertainty_score":0.023275733},"labels":[],"label_agreement":null},{"id":"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7025543,0.00037854118,0.20761873,0.0022094087,0.0001943777,0.00020135952,0.00062552997,0.00029807424,0.08591967],"genre_scores_gemma":[0.9486315,0.00017420932,0.034508683,0.00016890744,0.000042408952,0.00010943261,0.00034309117,0.0001037222,0.01591807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875414,0.00045391367,0.00006328615,0.00024064173,0.0001755325,0.00031240616],"domain_scores_gemma":[0.99727863,0.0014439168,0.00021903237,0.0003011138,0.00012458599,0.00063278683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010937946,0.0007150025,0.0014731088,0.000648864,0.0019043963,0.0047018877,0.0020306788,0.0017850116,0.013807878],"category_scores_gemma":[0.006107007,0.00058397435,0.0009287738,0.0009273642,0.0029443677,0.0057148174,0.0027103173,0.0017874448,0.00081755297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031207153,0.00006055093,0.0004995847,0.0000622068,0.000018843506,0.000100480436,0.00025958114,0.023121879,0.0007608406,0.96764743,0.00214553,0.005010938],"study_design_scores_gemma":[0.00011466558,0.000042314943,0.0002528989,0.000021365844,0.000018505221,0.000060791946,0.00037174244,0.09758019,0.0005266793,0.89742196,0.0035704018,0.000018403427],"about_ca_topic_score_codex":0.0050064274,"about_ca_topic_score_gemma":0.0044031786,"teacher_disagreement_score":0.013807878,"about_ca_system_score_codex":0.0019834049,"about_ca_system_score_gemma":0.0010872046,"threshold_uncertainty_score":0.04619193},"labels":[],"label_agreement":null},{"id":"W2767238088","doi":"","title":"The Rainbow Vertex Connectivities Of Small Cubic Graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Rainbow; Vertex (graph theory); Combinatorics; Cubic graph; Graph; Line graph; Physics; Optics","score_opus":0.01837995889030375,"score_gpt":0.23173794839624468,"score_spread":0.21335798950594093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767238088","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77357656,0.0014663048,0.059444435,0.0030043526,0.00020666707,0.000076586075,0.0014513767,0.00040703703,0.1603666],"genre_scores_gemma":[0.9740969,0.00055597874,0.012622675,0.00024807127,0.00011355905,0.00007700009,0.00054850295,0.00010505773,0.011632263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994479,0.00014851874,0.000021209145,0.00014716477,0.00012343921,0.00011183167],"domain_scores_gemma":[0.9955422,0.0027247916,0.00057849626,0.00041837565,0.00027809854,0.0004579511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006215154,0.00038125357,0.0004109412,0.0023557956,0.0019117139,0.0024531086,0.0012820142,0.001211397,0.012761662],"category_scores_gemma":[0.0070881676,0.00057834055,0.00044168683,0.0018154968,0.0021954828,0.0039226334,0.0019039841,0.0019684087,0.0008633959],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015440652,0.000033497305,0.0018512032,0.00013814827,0.000015244437,0.0001010012,0.00029841336,0.006444042,0.0018766936,0.96868926,0.006146717,0.014251266],"study_design_scores_gemma":[0.00003951982,0.000017672535,0.0015688717,0.000052572548,0.000026158923,0.00020793699,0.0002733116,0.023506513,0.0015202618,0.96648717,0.0062790546,0.000021064014],"about_ca_topic_score_codex":0.002779841,"about_ca_topic_score_gemma":0.004724807,"teacher_disagreement_score":0.012761662,"about_ca_system_score_codex":0.0014440357,"about_ca_system_score_gemma":0.00073196326,"threshold_uncertainty_score":0.042692006},"labels":[],"label_agreement":null},{"id":"W2767387720","doi":"","title":"On Some Variants of Gracefulness of Cycle Graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.013452013949164846,"score_gpt":0.24331315950473253,"score_spread":0.2298611455555677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767387720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19862817,0.0033940538,0.4748298,0.007246526,0.00088164397,0.00029353108,0.0017861848,0.0016049952,0.31133518],"genre_scores_gemma":[0.84443605,0.0026697088,0.09454637,0.0026029975,0.0012038198,0.00037646576,0.0017651673,0.0009873911,0.051412072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985832,0.00042875367,0.00007457275,0.000375411,0.0002706845,0.00026749627],"domain_scores_gemma":[0.9945852,0.0029441824,0.00043889278,0.0011336934,0.00037745383,0.0005204548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017002433,0.0008112785,0.000875295,0.0023260876,0.0025360798,0.0036209372,0.0022236935,0.0016838657,0.015364071],"category_scores_gemma":[0.008174232,0.00074579543,0.0016541863,0.0031156112,0.0046310546,0.007809428,0.003797366,0.004166092,0.0015229862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029221406,0.00002090496,0.00022366094,0.00004418377,0.00000775781,0.00004626142,0.00015547067,0.0015573621,0.00039957426,0.9877259,0.003872557,0.0059170304],"study_design_scores_gemma":[0.000010536903,0.000009095965,0.0001717301,0.000018782519,0.000009792349,0.00007802761,0.00006934005,0.004301683,0.00028562715,0.9893377,0.0056968885,0.000010798758],"about_ca_topic_score_codex":0.0034561977,"about_ca_topic_score_gemma":0.0035663145,"teacher_disagreement_score":0.015364071,"about_ca_system_score_codex":0.0021385937,"about_ca_system_score_gemma":0.0011281279,"threshold_uncertainty_score":0.05139798},"labels":[],"label_agreement":null},{"id":"W2767485624","doi":"","title":"Strong Z 4p -Magic labeling.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"MAGIC (telescope); Mathematics; Astrophysics; Physics","score_opus":0.020997253277007407,"score_gpt":0.2595718912591848,"score_spread":0.23857463798217737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767485624","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20080182,0.0013323282,0.33616474,0.008642751,0.0007666127,0.00020374494,0.0053050765,0.002143544,0.4446394],"genre_scores_gemma":[0.79830277,0.0009317784,0.1228687,0.0020147413,0.0002943553,0.00021982286,0.004605089,0.0006325331,0.070130184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990922,0.0001957049,0.000046923866,0.00024026564,0.00020918064,0.00021578246],"domain_scores_gemma":[0.99806637,0.00081980467,0.00019472522,0.00043178818,0.00024030155,0.0002469613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007636764,0.00067450025,0.00058164995,0.0011053997,0.002131722,0.00322552,0.0013904228,0.0013494908,0.024318235],"category_scores_gemma":[0.002874762,0.0005355837,0.00086766883,0.001481637,0.0020193905,0.0054924563,0.003314758,0.0030665363,0.003930823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120443336,0.00003665077,0.00039365317,0.00012215502,0.000013101328,0.00006501813,0.000098867655,0.0011445843,0.0018187711,0.9664356,0.012453249,0.017297918],"study_design_scores_gemma":[0.000031111624,0.000015367275,0.00033918614,0.000026895814,0.000017359778,0.00013758233,0.00010960403,0.004437421,0.0019384868,0.9753519,0.017581105,0.0000139303365],"about_ca_topic_score_codex":0.0016254784,"about_ca_topic_score_gemma":0.0027578361,"teacher_disagreement_score":0.024318235,"about_ca_system_score_codex":0.0014180811,"about_ca_system_score_gemma":0.0011503367,"threshold_uncertainty_score":0.08135265},"labels":[],"label_agreement":null},{"id":"W2767669220","doi":"","title":"On edge irregularity strength of products of certain families of graphs with path P 2 .","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Path (computing); Combinatorics; Telecommunications; Computer network; Computer science","score_opus":0.012602205499643753,"score_gpt":0.22493721961468327,"score_spread":0.21233501411503952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767669220","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9429934,0.0003957037,0.032290205,0.0008371525,0.00005783515,0.000027905999,0.0003391237,0.00014341487,0.022915436],"genre_scores_gemma":[0.9898867,0.00022208117,0.0066553513,0.000102982965,0.00007312189,0.00003688572,0.00028531646,0.000060045837,0.00267755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990243,0.0003339424,0.00005131566,0.00021581327,0.00021082422,0.00016385672],"domain_scores_gemma":[0.9839131,0.009620955,0.0025638733,0.0011700229,0.00087065756,0.0018613809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019640902,0.0004619655,0.0007393482,0.0024896907,0.0017990839,0.0023450057,0.0012015862,0.0012284091,0.006169109],"category_scores_gemma":[0.010755109,0.0007016677,0.00060974126,0.0013176767,0.0023055233,0.0041966424,0.0017767543,0.0015366641,0.00047102798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000381438,0.00010190657,0.012654648,0.00015531784,0.00006287677,0.00047509174,0.00079678127,0.009485529,0.0052864905,0.9521594,0.0041446895,0.014295791],"study_design_scores_gemma":[0.00006496366,0.00012407279,0.008373816,0.000071640505,0.00009190047,0.0012142302,0.0008150118,0.06948887,0.0031831027,0.91098386,0.005528772,0.000059900085],"about_ca_topic_score_codex":0.00068413385,"about_ca_topic_score_gemma":0.000727774,"teacher_disagreement_score":0.006169109,"about_ca_system_score_codex":0.0008984935,"about_ca_system_score_gemma":0.00040304908,"threshold_uncertainty_score":0.02063775},"labels":[],"label_agreement":null},{"id":"W2767693939","doi":"","title":"The correlation between the f -chromatic class of the g c -chromatic class of a simple graph.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Class (philosophy); Friendship graph; Combinatorics; Graph; Correlation; Simple (philosophy); Simple graph; Artificial intelligence; Computer science; Line graph; Geometry; Graph power","score_opus":0.015727609554272347,"score_gpt":0.24319274975857044,"score_spread":0.2274651402042981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767693939","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9090296,0.0013515564,0.04400907,0.0017131529,0.00016192843,0.000045088454,0.002109163,0.0003883446,0.041192204],"genre_scores_gemma":[0.9936247,0.00022295209,0.0033335525,0.00010830446,0.00010150557,0.00003105562,0.00044150624,0.00005643034,0.0020799118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875903,0.0002691998,0.000037200993,0.00045722566,0.00019796993,0.0002794162],"domain_scores_gemma":[0.9772406,0.014050772,0.0032131786,0.002059272,0.0014709539,0.0019651481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014214132,0.0003628778,0.00058998994,0.0036851102,0.0015994359,0.0034218666,0.001386371,0.0014224158,0.008925688],"category_scores_gemma":[0.017900296,0.00044889507,0.00038834146,0.0022019772,0.0030205946,0.0035606236,0.001252428,0.0018404232,0.0007163764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006530773,0.00015775191,0.05410082,0.00019413701,0.0000897698,0.00017857368,0.00050618243,0.015780631,0.00800198,0.87292886,0.0149599435,0.03244828],"study_design_scores_gemma":[0.00008688025,0.00013156576,0.07456804,0.00011837853,0.00009660061,0.00068599946,0.00049427187,0.11019854,0.006072685,0.7987406,0.0086634485,0.00014286819],"about_ca_topic_score_codex":0.004173737,"about_ca_topic_score_gemma":0.004395046,"teacher_disagreement_score":0.008925688,"about_ca_system_score_codex":0.0022490679,"about_ca_system_score_gemma":0.0011128432,"threshold_uncertainty_score":0.029859364},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8207101,0.000919686,0.09655767,0.0017165341,0.00018524817,0.00008137828,0.002576243,0.00038258155,0.07687065],"genre_scores_gemma":[0.97548205,0.00034737537,0.015391849,0.00022460433,0.00012935376,0.000058761652,0.0013244537,0.0000963607,0.006945246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987081,0.0002632319,0.00007187868,0.00025805022,0.00047693605,0.00022168462],"domain_scores_gemma":[0.9976883,0.0006011048,0.00047692363,0.00023240387,0.0004963356,0.0005049732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007033156,0.0005593872,0.0006552793,0.0026334694,0.0013063654,0.0034320268,0.0008930201,0.00067060423,0.008681721],"category_scores_gemma":[0.0034505283,0.00045518597,0.00040870943,0.0018453968,0.0018427419,0.0035483998,0.0023659924,0.0012187453,0.0010053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001853221,0.00003618939,0.0022052831,0.00009984896,0.00002755923,0.00014188774,0.00041004104,0.0038229448,0.002966636,0.9660267,0.0051129763,0.018964726],"study_design_scores_gemma":[0.000032623087,0.00007521604,0.0032110729,0.000036242258,0.000042136966,0.0006615551,0.00068363844,0.025014924,0.003928496,0.94504523,0.021217376,0.000051399486],"about_ca_topic_score_codex":0.001217804,"about_ca_topic_score_gemma":0.00089120993,"teacher_disagreement_score":0.008681721,"about_ca_system_score_codex":0.0013250943,"about_ca_system_score_gemma":0.0003996946,"threshold_uncertainty_score":0.029043257},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15993325,0.18221974,0.4443359,0.006083739,0.0011431371,0.00021060901,0.0022735354,0.0009502167,0.20284982],"genre_scores_gemma":[0.68357885,0.12121303,0.16202271,0.0015922703,0.002780963,0.00029018658,0.003527185,0.00069425185,0.024300555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988617,0.00033051812,0.00005844204,0.00028651409,0.00033326293,0.0001295581],"domain_scores_gemma":[0.99785066,0.0014475717,0.00011265086,0.00018081132,0.000297781,0.00011064849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011847431,0.000797232,0.0012813037,0.0025139386,0.0011965482,0.0035402402,0.0012978405,0.0012360769,0.0049614236],"category_scores_gemma":[0.004666919,0.0005209486,0.00069924985,0.0048803664,0.0012958933,0.0049631777,0.0015169336,0.0016512241,0.0009454677],"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.00011921078,0.000075506345,0.0015249827,0.0011365364,0.000036921676,0.00006762686,0.00026206058,0.0120976055,0.0016701797,0.7288517,0.017748864,0.23640893],"study_design_scores_gemma":[0.00001882146,0.00015748768,0.001793387,0.00043481466,0.000056228284,0.00047895382,0.0002652714,0.04138704,0.0020690067,0.8618084,0.09147596,0.000054617525],"about_ca_topic_score_codex":0.0016982899,"about_ca_topic_score_gemma":0.0015935124,"teacher_disagreement_score":0.0049614236,"about_ca_system_score_codex":0.0029727083,"about_ca_system_score_gemma":0.0009945584,"threshold_uncertainty_score":0.021568596},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9132759,0.0003954052,0.064475104,0.00028486125,0.00004075702,0.000033070155,0.00039748065,0.000117525546,0.020979851],"genre_scores_gemma":[0.97855216,0.00022697855,0.01787104,0.00004545276,0.000049915045,0.000043188316,0.00039868205,0.000047797083,0.002764826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991148,0.00019052303,0.000088485416,0.0002299791,0.0002037739,0.00017243424],"domain_scores_gemma":[0.99750644,0.0011626134,0.0004348717,0.00023511352,0.0002963594,0.00036463156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096758176,0.00042934003,0.00049854134,0.0026573075,0.0015643456,0.0025033953,0.0008542638,0.0005369139,0.0036262015],"category_scores_gemma":[0.0026176549,0.00054137217,0.00064813567,0.0010563255,0.0032262206,0.004497545,0.0018952081,0.0010031516,0.0004569168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103523664,0.000022917262,0.0014162197,0.0000388553,0.000008155886,0.00010746571,0.0005593752,0.0010601173,0.0024473537,0.98758125,0.0005762919,0.0060784183],"study_design_scores_gemma":[0.000025950172,0.000042364612,0.0012092013,0.000029023317,0.00001467823,0.00031664473,0.00041551152,0.006362212,0.002520646,0.9862402,0.0027936753,0.000029875131],"about_ca_topic_score_codex":0.0006424452,"about_ca_topic_score_gemma":0.0005015664,"teacher_disagreement_score":0.0036262015,"about_ca_system_score_codex":0.00091388455,"about_ca_system_score_gemma":0.00052838493,"threshold_uncertainty_score":0.0121308565},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27204224,0.002125643,0.59037906,0.0038763515,0.00036400108,0.00008257114,0.0009181153,0.0006224305,0.12958956],"genre_scores_gemma":[0.74339163,0.0027769082,0.2076492,0.0021414647,0.0006371017,0.00025494117,0.0020445918,0.0006957293,0.040408365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933004,0.0001848434,0.000035387362,0.00019884093,0.00012967795,0.00012124339],"domain_scores_gemma":[0.99641234,0.0020126929,0.00027411254,0.00061991427,0.00031852786,0.0003623517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012407599,0.00091112324,0.001086306,0.0016784215,0.0020031265,0.00269511,0.0021158413,0.0013024664,0.011753138],"category_scores_gemma":[0.0047367713,0.00069775013,0.0017103652,0.0033737589,0.0023165266,0.008307894,0.0030559697,0.0051346836,0.0010045632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073055926,0.000039827697,0.00047885466,0.00018568299,0.000021485717,0.000049212824,0.00029826307,0.0041960836,0.0017424508,0.9771063,0.0033159298,0.012492897],"study_design_scores_gemma":[0.000014046437,0.000013093368,0.0003053148,0.000024940717,0.000027038988,0.000049680402,0.00010267448,0.013693216,0.00066937617,0.9807179,0.004369975,0.000012786159],"about_ca_topic_score_codex":0.0017160911,"about_ca_topic_score_gemma":0.0026317078,"teacher_disagreement_score":0.011753138,"about_ca_system_score_codex":0.0014254574,"about_ca_system_score_gemma":0.0008474543,"threshold_uncertainty_score":0.039318204},"labels":[],"label_agreement":null},{"id":"W2789261530","doi":"","title":"Super Edge-Magicness of Stars Like Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Stars; Mathematics; Enhanced Data Rates for GSM Evolution; Astrophysics; Combinatorics; Computer science; Artificial intelligence; Physics","score_opus":0.011839178988571586,"score_gpt":0.22878261921499665,"score_spread":0.21694344022642506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789261530","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5776848,0.002245824,0.20736343,0.00601175,0.00042280825,0.00009732327,0.0016520146,0.00051335944,0.20400862],"genre_scores_gemma":[0.9455504,0.0007085255,0.03737891,0.00076017284,0.00024941075,0.00006803349,0.00095277803,0.00012314659,0.014208605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904877,0.00030982852,0.00005178796,0.00022587716,0.00022156048,0.00014216918],"domain_scores_gemma":[0.99464333,0.0031786247,0.00051904423,0.0006514832,0.00042582126,0.00058162276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010342761,0.00037270554,0.0006084449,0.0013910335,0.0016238141,0.0026071589,0.0012453751,0.0012693584,0.011140967],"category_scores_gemma":[0.0057500205,0.00055377505,0.00063638436,0.0014606947,0.0025454392,0.0056526083,0.0020025612,0.0022986708,0.00096176256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007911875,0.000029796623,0.0008649408,0.0000932839,0.000011051563,0.00006354291,0.00018630865,0.0016277732,0.0011881861,0.9825965,0.00463516,0.008624472],"study_design_scores_gemma":[0.000016872931,0.000011784676,0.0004772783,0.00002029732,0.000010278219,0.00014136886,0.00012418767,0.006568253,0.0006899306,0.9884775,0.0034535336,0.000008638882],"about_ca_topic_score_codex":0.0009785406,"about_ca_topic_score_gemma":0.0015083848,"teacher_disagreement_score":0.011140967,"about_ca_system_score_codex":0.00094828696,"about_ca_system_score_gemma":0.00058715197,"threshold_uncertainty_score":0.037270248},"labels":[],"label_agreement":null},{"id":"W2789462440","doi":"","title":"Computing 3-total edge product cordial labeling of generalized Petersen graphs P(n, m).","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Product (mathematics); Computer science; Geometry; Telecommunications","score_opus":0.01425831397257204,"score_gpt":0.24097752672918335,"score_spread":0.2267192127566113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789462440","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7356045,0.00054810155,0.21409877,0.0012083531,0.00014273792,0.00011031677,0.0037653334,0.002300492,0.042221386],"genre_scores_gemma":[0.84593546,0.00023198652,0.13742451,0.0002513207,0.00005822396,0.000077245735,0.0045273155,0.00038646394,0.011107532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996438,0.00007615541,0.000019870478,0.000114381706,0.00006754154,0.000078129306],"domain_scores_gemma":[0.9987921,0.00046700734,0.00013510148,0.00034885172,0.00013442188,0.00012250766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038681016,0.00057373143,0.0005723122,0.0007547724,0.0008947716,0.0019992408,0.0009604686,0.0008707511,0.010661446],"category_scores_gemma":[0.0029166471,0.00031896785,0.0005832432,0.0012186511,0.00079644413,0.003019311,0.0011967409,0.00088318135,0.0016041868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011773005,0.00038462097,0.011784756,0.0010042432,0.00013771199,0.00048511292,0.001033722,0.12021559,0.018928694,0.50350845,0.04355351,0.2977864],"study_design_scores_gemma":[0.00007387883,0.00013825358,0.0030643968,0.00006036253,0.00006699139,0.00030886562,0.0004827639,0.24559191,0.0104718935,0.7236455,0.016058872,0.000036288617],"about_ca_topic_score_codex":0.002076627,"about_ca_topic_score_gemma":0.0058092177,"teacher_disagreement_score":0.010661446,"about_ca_system_score_codex":0.0012178128,"about_ca_system_score_gemma":0.0008783436,"threshold_uncertainty_score":0.035666108},"labels":[],"label_agreement":null},{"id":"W2789855541","doi":"","title":"New Results on Graceful Unicyclic Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.015875917161532,"score_gpt":0.24449616297779397,"score_spread":0.22862024581626197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789855541","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12178197,0.0105078025,0.303936,0.010749548,0.0021156531,0.00018857003,0.003302464,0.002662483,0.54475546],"genre_scores_gemma":[0.8140378,0.010436066,0.08348628,0.004565806,0.00271338,0.0003604608,0.003499447,0.001138094,0.07976279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987643,0.00024314762,0.00006486975,0.00033546818,0.00036879265,0.00022352625],"domain_scores_gemma":[0.9941262,0.0028763576,0.00063658325,0.0012161339,0.00041675035,0.00072787295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009444683,0.0012475329,0.00087171444,0.0031931188,0.0020795036,0.0037537783,0.0021062724,0.0012774805,0.01963445],"category_scores_gemma":[0.006036551,0.0006516361,0.00095248217,0.004367285,0.0031918548,0.008084876,0.0039709383,0.004278379,0.0030684785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053084852,0.000046579476,0.00043498474,0.00022850017,0.000014543765,0.00009184828,0.00019183925,0.0031845614,0.0012084914,0.9595721,0.015791822,0.01918167],"study_design_scores_gemma":[0.00001646508,0.000017890512,0.00033830013,0.00005280999,0.000021001457,0.00022083713,0.000121088415,0.0058507593,0.0008809433,0.96302885,0.02943192,0.000019085079],"about_ca_topic_score_codex":0.0016611852,"about_ca_topic_score_gemma":0.0026577485,"teacher_disagreement_score":0.01963445,"about_ca_system_score_codex":0.0022403095,"about_ca_system_score_gemma":0.00083987764,"threshold_uncertainty_score":0.06568378},"labels":[],"label_agreement":null},{"id":"W2791741897","doi":"","title":"A Note on Harmonic Index and Coloring Number of a Graph.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Edge coloring; Index (typography); Graph coloring; Fractional coloring; Graph; Combinatorics; Discrete mathematics; Graph power; Line graph; Computer science","score_opus":0.013715713843865659,"score_gpt":0.2534742253731617,"score_spread":0.23975851152929606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791741897","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063587286,0.03161,0.21356484,0.025931442,0.025773833,0.00013661449,0.0023808023,0.0011512808,0.63586384],"genre_scores_gemma":[0.714481,0.0209188,0.1412292,0.0067315777,0.018527161,0.00029292496,0.0017313862,0.001220075,0.09486784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987606,0.00025754204,0.00007896205,0.00039788478,0.00038028942,0.00012472522],"domain_scores_gemma":[0.9945555,0.0036494567,0.00027271133,0.00070729933,0.00041350664,0.0004015545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011244018,0.00092811463,0.0012042021,0.003381369,0.0017936195,0.0032105427,0.0024705187,0.0017183569,0.015909033],"category_scores_gemma":[0.009587196,0.00059315865,0.0007436075,0.0036524346,0.0037056631,0.008759081,0.003289363,0.0061601317,0.002966406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013061933,0.00005544654,0.00091610564,0.0002744977,0.000024576933,0.00019709785,0.00022655774,0.0022505342,0.0022539,0.90521395,0.049451206,0.039005395],"study_design_scores_gemma":[0.0000091462225,0.000029341607,0.0010374798,0.00005556023,0.000022142864,0.00024427043,0.00010791638,0.005062787,0.0008404524,0.94597006,0.046585646,0.00003532297],"about_ca_topic_score_codex":0.002579633,"about_ca_topic_score_gemma":0.003781969,"teacher_disagreement_score":0.015909033,"about_ca_system_score_codex":0.0022566197,"about_ca_system_score_gemma":0.0008160006,"threshold_uncertainty_score":0.053221047},"labels":[],"label_agreement":null},{"id":"W2792580356","doi":"","title":"On super (a, d)-edge-antimagic total labeling of a subdivided stars.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Stars; Enhanced Data Rates for GSM Evolution; Combinatorics; Astrophysics; Computer science; Artificial intelligence; Physics","score_opus":0.012920420431939897,"score_gpt":0.23520957320522748,"score_spread":0.2222891527732876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792580356","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49904695,0.0016995026,0.34932047,0.0027248932,0.00031408243,0.00017928239,0.0023426444,0.00083775236,0.14353453],"genre_scores_gemma":[0.7866288,0.001111326,0.18071078,0.0010624141,0.00017116996,0.00017032793,0.002585552,0.0002829637,0.02727665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934953,0.00019878587,0.00004198221,0.00015775063,0.000119509765,0.00013250229],"domain_scores_gemma":[0.99794286,0.0010426979,0.00017897665,0.00039113127,0.0001906785,0.00025370214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075875537,0.0004491463,0.0006909806,0.0011406004,0.0018511605,0.0022341562,0.0010721516,0.0013175518,0.008543886],"category_scores_gemma":[0.0027956567,0.00041914373,0.00071426283,0.0018825989,0.0014418454,0.0038476174,0.002559669,0.0015610274,0.0013743443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021880516,0.00006834298,0.0011882414,0.00026426537,0.000030793133,0.000118388496,0.00041734954,0.008441879,0.00465336,0.94373876,0.010909897,0.02994997],"study_design_scores_gemma":[0.000040914234,0.000048018144,0.0008074304,0.00005410592,0.000041288877,0.00023729405,0.0003171063,0.023077214,0.0020507954,0.9605742,0.0127318995,0.000019832358],"about_ca_topic_score_codex":0.0019464626,"about_ca_topic_score_gemma":0.0029798085,"teacher_disagreement_score":0.008543886,"about_ca_system_score_codex":0.0015304536,"about_ca_system_score_gemma":0.0007496057,"threshold_uncertainty_score":0.028582096},"labels":[],"label_agreement":null},{"id":"W2792587586","doi":"","title":"The L(j, k)-Edge-Labeling Problem on Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Artificial intelligence","score_opus":0.012760595017237782,"score_gpt":0.2338949424083237,"score_spread":0.22113434739108592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792587586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33738908,0.005411354,0.415182,0.03293447,0.0011869778,0.00030081085,0.011290675,0.0022950687,0.19400957],"genre_scores_gemma":[0.8079472,0.0021420198,0.14760417,0.002316131,0.000781288,0.00027170376,0.005794808,0.0006039526,0.032538705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983865,0.00056573167,0.000095142386,0.00041153267,0.00019901272,0.00034213244],"domain_scores_gemma":[0.9924418,0.004595388,0.00060669024,0.0012306309,0.00039394028,0.0007315161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015471302,0.00076233095,0.0012522062,0.0012402737,0.0028226397,0.0050439877,0.0025499626,0.0032664712,0.013167847],"category_scores_gemma":[0.010463501,0.0006876915,0.0009378729,0.0026181964,0.0024337184,0.009543601,0.0028497388,0.0032825244,0.002270353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004466639,0.0002543236,0.0024460405,0.00055501505,0.00006946841,0.00016875201,0.000507381,0.02032992,0.002626889,0.82547903,0.07628046,0.07083605],"study_design_scores_gemma":[0.00006290678,0.000033033946,0.00081379205,0.000070213864,0.00003440255,0.000263483,0.00040952634,0.032942522,0.00140158,0.95011157,0.013827804,0.00002920511],"about_ca_topic_score_codex":0.0027482938,"about_ca_topic_score_gemma":0.0033770313,"teacher_disagreement_score":0.013167847,"about_ca_system_score_codex":0.002596365,"about_ca_system_score_gemma":0.0017264673,"threshold_uncertainty_score":0.044050872},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19941875,0.0021161162,0.6511677,0.0018862628,0.00069784734,0.00022148757,0.0030784598,0.0010237502,0.14038964],"genre_scores_gemma":[0.6028948,0.001998314,0.32853013,0.00088609586,0.0003575879,0.00023574337,0.0055952487,0.0008937767,0.05860837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988675,0.00033747574,0.00006456957,0.00028053464,0.00036186771,0.00008806385],"domain_scores_gemma":[0.99717855,0.0015542156,0.00016034179,0.0006057946,0.0003556063,0.00014549903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058414275,0.00042238043,0.0003591414,0.0017640473,0.0008143208,0.002509177,0.0007640149,0.00076386094,0.008726939],"category_scores_gemma":[0.0038979463,0.000474021,0.00069186254,0.0019006504,0.0012368148,0.0026179126,0.0023290308,0.0016367955,0.0013596151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006365552,0.000041334817,0.0008412415,0.00019241375,0.000024031968,0.00016948259,0.00052910106,0.006589263,0.0058342936,0.91063714,0.009023478,0.0660546],"study_design_scores_gemma":[0.000027902232,0.000022541763,0.00081846357,0.000066328146,0.000021739897,0.00018129035,0.0001520672,0.016155252,0.005913833,0.9358535,0.04077031,0.000016766095],"about_ca_topic_score_codex":0.0011319892,"about_ca_topic_score_gemma":0.0034421582,"teacher_disagreement_score":0.008726939,"about_ca_system_score_codex":0.0017880184,"about_ca_system_score_gemma":0.00049612176,"threshold_uncertainty_score":0.029194474},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15916547,0.00032400154,0.75528693,0.0013678981,0.00015909626,0.00022404309,0.0010398926,0.0009273063,0.081505306],"genre_scores_gemma":[0.4311504,0.00051101943,0.5398739,0.0004985301,0.00008599821,0.00020835934,0.0026754215,0.00048473655,0.024511581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999453,0.00018113674,0.000027589447,0.00013180818,0.00012121495,0.00008526845],"domain_scores_gemma":[0.99832183,0.0006250433,0.000092695795,0.00045564814,0.0002637026,0.0002409752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006160056,0.0004550647,0.0005718498,0.0017462632,0.002194829,0.0018662837,0.0013578391,0.00084499776,0.008437094],"category_scores_gemma":[0.0018388674,0.00074392156,0.0010315571,0.0020466032,0.0015298636,0.0029553922,0.0026697982,0.001915353,0.0013555327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003696048,0.000035201305,0.00048330514,0.00007731628,0.0000074590735,0.00007029785,0.00030233618,0.0028901263,0.0024498706,0.971856,0.0033956154,0.018395463],"study_design_scores_gemma":[0.000014639592,0.000022480333,0.0004546129,0.00003474482,0.00002000978,0.00009949152,0.00018846568,0.020464757,0.0018288937,0.96016186,0.016696403,0.000013736423],"about_ca_topic_score_codex":0.002205287,"about_ca_topic_score_gemma":0.005394971,"teacher_disagreement_score":0.008437094,"about_ca_system_score_codex":0.0011965636,"about_ca_system_score_gemma":0.00081214757,"threshold_uncertainty_score":0.028224885},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8089911,0.00037118696,0.16179302,0.00061875733,0.000062919,0.00007654042,0.00067587243,0.000566842,0.026843883],"genre_scores_gemma":[0.92836297,0.00026059579,0.063058056,0.00014785815,0.000047807345,0.00009257934,0.00066409766,0.000083863626,0.007282191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997719,0.000043296786,0.000016195916,0.00007846318,0.000042198368,0.00004800998],"domain_scores_gemma":[0.99922264,0.00022022857,0.00017124761,0.00018147792,0.00007063486,0.00013375793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023662984,0.00025982276,0.00022430149,0.00058394513,0.0010679318,0.0008015205,0.00036684124,0.0004582882,0.0020577249],"category_scores_gemma":[0.0011475437,0.00031551844,0.0005000882,0.0006303311,0.00092454057,0.0013475664,0.0007903335,0.0008505219,0.0002848955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017900438,0.00006295257,0.003923817,0.00012658183,0.000022101634,0.00047747177,0.0013245997,0.0136311175,0.018412363,0.8957885,0.004181146,0.061870318],"study_design_scores_gemma":[0.000021708945,0.00009843969,0.0040457635,0.00003539745,0.000025339239,0.0008601122,0.00037513362,0.03147572,0.008600507,0.9366848,0.017740602,0.000036389985],"about_ca_topic_score_codex":0.0006417686,"about_ca_topic_score_gemma":0.0009533723,"teacher_disagreement_score":0.0020577249,"about_ca_system_score_codex":0.00048539173,"about_ca_system_score_gemma":0.00026835437,"threshold_uncertainty_score":0.0068838},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9308151,0.00022599279,0.049043722,0.00046466303,0.000057694615,0.00003974254,0.00047658014,0.00010432967,0.018772189],"genre_scores_gemma":[0.9749278,0.00015933593,0.020992814,0.00008328602,0.00005010186,0.000061026865,0.0007249837,0.00007548817,0.0029252528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985238,0.00034546727,0.00009607506,0.00045934468,0.00030068032,0.00027465253],"domain_scores_gemma":[0.9888904,0.0075133434,0.0011318695,0.00076804525,0.0007937469,0.0009026874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001779793,0.00061506283,0.00084469677,0.0022697991,0.0020352316,0.005977607,0.0016496661,0.0014098993,0.006033668],"category_scores_gemma":[0.008074578,0.001048344,0.0007770653,0.002018815,0.0040646945,0.0055009075,0.0023295204,0.0023451329,0.00040729734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052412425,0.00007923734,0.004581739,0.000115514595,0.000028960423,0.000118723794,0.0011608384,0.0044635492,0.005289027,0.96982026,0.0017553907,0.012062679],"study_design_scores_gemma":[0.000077816396,0.000087578475,0.0038921079,0.00007143019,0.00006726186,0.00025759434,0.0008447756,0.021907914,0.0066320035,0.9611702,0.004942654,0.000048708003],"about_ca_topic_score_codex":0.001481044,"about_ca_topic_score_gemma":0.0025665322,"teacher_disagreement_score":0.006033668,"about_ca_system_score_codex":0.002058569,"about_ca_system_score_gemma":0.0011819325,"threshold_uncertainty_score":0.020184577},"labels":[],"label_agreement":null},{"id":"W28495531","doi":"10.1016/j.bbrc.2017.05.038","title":"Two General Results on Harmonious Labelings.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.01685622446059893,"score_gpt":0.24563681211705116,"score_spread":0.22878058765645223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W28495531","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019804731,0.007914302,0.6197008,0.008888756,0.008265899,0.00046171286,0.0028768945,0.0063519017,0.32573512],"genre_scores_gemma":[0.31159455,0.0093562445,0.38461417,0.016862592,0.004481743,0.002258967,0.009577202,0.0071625416,0.25409204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952192,0.00069927773,0.00027379164,0.0020676684,0.0011284053,0.000611643],"domain_scores_gemma":[0.99737537,0.00043986703,0.00024129725,0.0011520137,0.00045135195,0.000340223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024161565,0.0013803954,0.0010535608,0.0018760692,0.002347832,0.0031866464,0.0021526313,0.0023351437,0.049584087],"category_scores_gemma":[0.0049770484,0.00095545873,0.0017646999,0.0017276724,0.0039501786,0.00439691,0.006759512,0.0034504298,0.0211492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027948432,0.00011582619,0.00093885843,0.0005991651,0.00010256495,0.00038172718,0.0003080645,0.0013108809,0.028305747,0.8139512,0.04535604,0.10835044],"study_design_scores_gemma":[0.00008991487,0.00015578506,0.0013760307,0.0001453972,0.00009016449,0.001921879,0.0001487165,0.0042999857,0.026732314,0.3784799,0.58646494,0.00009499032],"about_ca_topic_score_codex":0.00080880086,"about_ca_topic_score_gemma":0.0009822339,"teacher_disagreement_score":0.049584087,"about_ca_system_score_codex":0.0018336854,"about_ca_system_score_gemma":0.0016275436,"threshold_uncertainty_score":0.16587532},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7930045,0.0003390861,0.19304791,0.00018906727,0.000062545194,0.000041739284,0.0009436484,0.00025551152,0.012115998],"genre_scores_gemma":[0.93218565,0.00020149228,0.06431741,0.00008083381,0.000060952003,0.00004374794,0.001254569,0.00007889445,0.0017765749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916327,0.00014354287,0.000049307866,0.00028149958,0.00024224074,0.00012010086],"domain_scores_gemma":[0.9983138,0.0006369483,0.00026075757,0.00036614938,0.00026135333,0.0001609907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045252158,0.0004323753,0.00061657507,0.0022126734,0.0014115813,0.001650373,0.001419224,0.0007355143,0.0038475117],"category_scores_gemma":[0.0031342935,0.00033294596,0.0005951866,0.0014901827,0.0010279714,0.0038188072,0.0012467478,0.0009436893,0.0002631846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042523185,0.00016301085,0.019800134,0.0003920572,0.00009838891,0.0009661467,0.00082547107,0.084171094,0.03205475,0.7933643,0.004104865,0.06363447],"study_design_scores_gemma":[0.000041038264,0.0002122984,0.009286234,0.000077098724,0.000070870374,0.0022740385,0.0007401291,0.3589814,0.024214393,0.59405327,0.009925301,0.00012396502],"about_ca_topic_score_codex":0.00079007074,"about_ca_topic_score_gemma":0.00059005513,"teacher_disagreement_score":0.0038475117,"about_ca_system_score_codex":0.0006216923,"about_ca_system_score_gemma":0.00032719385,"threshold_uncertainty_score":0.012871206},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33034942,0.0003362499,0.6506963,0.0007895971,0.00010746813,0.00022210587,0.00092436065,0.0013520136,0.01522246],"genre_scores_gemma":[0.5121363,0.0003029612,0.47905988,0.00021268507,0.0000500864,0.00014262807,0.0020530364,0.00043249052,0.0056099785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994413,0.00015882457,0.000037316586,0.00017586365,0.000108692635,0.00007798539],"domain_scores_gemma":[0.99617285,0.00212486,0.00030732012,0.00082939334,0.0002856344,0.00027996043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006164258,0.0006638596,0.0009330818,0.0017752993,0.0011624563,0.0013886093,0.0018357849,0.0007964217,0.005371307],"category_scores_gemma":[0.005220849,0.0010783368,0.00090460276,0.0019071138,0.0012370864,0.0033834295,0.002768487,0.0018357518,0.0008128622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006379953,0.00042999868,0.0058908383,0.00071248127,0.00011712382,0.00031391854,0.0010413558,0.06563006,0.01987806,0.5790486,0.018438527,0.30786106],"study_design_scores_gemma":[0.00009588357,0.000080095386,0.0008371304,0.00005688645,0.000064684325,0.0001828898,0.0003924433,0.16092181,0.008240605,0.82052857,0.008560983,0.000038019643],"about_ca_topic_score_codex":0.0012139821,"about_ca_topic_score_gemma":0.003072177,"teacher_disagreement_score":0.005371307,"about_ca_system_score_codex":0.0007601521,"about_ca_system_score_gemma":0.0008788828,"threshold_uncertainty_score":0.017968774},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034164272,0.0030227518,0.56109387,0.0031920166,0.0012037542,0.0001648654,0.0015333557,0.0012828496,0.3943423],"genre_scores_gemma":[0.56399053,0.0041150562,0.34849808,0.002233381,0.0010182122,0.00035006308,0.0018590202,0.0008710137,0.077064626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903154,0.00019458296,0.00004447742,0.00024940475,0.00033566277,0.00014447949],"domain_scores_gemma":[0.99861526,0.0004135729,0.000086038395,0.00026764034,0.00048313662,0.00013438347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045863213,0.00063212245,0.0005329954,0.0013487462,0.001966564,0.0017298795,0.0009148385,0.00084821816,0.017822936],"category_scores_gemma":[0.0030991267,0.00030418436,0.000833434,0.0026985838,0.0017965245,0.0025009497,0.0033892663,0.002913242,0.002945339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012338436,0.000011761499,0.000102928076,0.000075656,0.0000038185453,0.0000570886,0.000117404044,0.0021015967,0.000625182,0.96421826,0.00864966,0.024024319],"study_design_scores_gemma":[0.0000061181386,0.000008627605,0.00012680191,0.000021642169,0.000005154083,0.0001746229,0.00008342196,0.008139261,0.0006534013,0.90996075,0.08080966,0.000010505438],"about_ca_topic_score_codex":0.005871489,"about_ca_topic_score_gemma":0.0051382068,"teacher_disagreement_score":0.017822936,"about_ca_system_score_codex":0.0018100989,"about_ca_system_score_gemma":0.0011388133,"threshold_uncertainty_score":0.05962372},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5195539,0.0011856506,0.4425248,0.0046977764,0.00016558691,0.00006017912,0.0009224663,0.0003083221,0.030581417],"genre_scores_gemma":[0.9346839,0.0010269482,0.0481978,0.00041652354,0.00052252103,0.00025306616,0.00095785526,0.00034643756,0.013594816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966628,0.0015209991,0.00015349545,0.000760641,0.00048845273,0.00041364486],"domain_scores_gemma":[0.96866983,0.024540601,0.0020553225,0.0015515395,0.0015238447,0.0016588635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046209544,0.0012812335,0.0016672054,0.0038174195,0.0029088033,0.006463263,0.0033632321,0.0026850621,0.0069058756],"category_scores_gemma":[0.03663364,0.0017911232,0.0012273273,0.0030380185,0.0048231804,0.010584382,0.0035701103,0.003948759,0.00076393306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009974604,0.00003666884,0.000784566,0.00008076363,0.000023388026,0.000032855634,0.00038612238,0.010450694,0.0008173935,0.9783546,0.0015682337,0.007364962],"study_design_scores_gemma":[0.000014136516,0.00000907543,0.0004277614,0.000017300745,0.000010856937,0.00002446385,0.00007073848,0.02764551,0.00029795992,0.97091866,0.0005489206,0.00001466206],"about_ca_topic_score_codex":0.0013159836,"about_ca_topic_score_gemma":0.0016035807,"teacher_disagreement_score":0.0069058756,"about_ca_system_score_codex":0.002652044,"about_ca_system_score_gemma":0.0011117286,"threshold_uncertainty_score":0.024438262},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8995357,0.0007396573,0.057845075,0.00042381175,0.00008244885,0.00003423244,0.00033258117,0.00018536509,0.040821046],"genre_scores_gemma":[0.98497576,0.00029554692,0.0112578105,0.000074901836,0.000083741164,0.000043748474,0.00020599646,0.000042016363,0.0030205613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993622,0.00010713749,0.00005415625,0.0001830294,0.00016745568,0.00012600199],"domain_scores_gemma":[0.99857354,0.0006332478,0.00027188493,0.00009753316,0.00013390223,0.00028982275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041159004,0.00048283086,0.00045976212,0.003227814,0.0017672629,0.0025425425,0.0007419184,0.0006872542,0.0049413764],"category_scores_gemma":[0.0018990068,0.00041198925,0.0004535446,0.0012627862,0.0020589493,0.003188996,0.0017883868,0.0007905832,0.00046776413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006647747,0.000029292725,0.001200602,0.00005481852,0.000011476174,0.00014221433,0.00052608666,0.0019340456,0.003541967,0.98353934,0.0008842732,0.008069352],"study_design_scores_gemma":[0.000018596986,0.000029424098,0.0010561164,0.000032394364,0.000014230573,0.00037991992,0.00058087707,0.013022674,0.003474936,0.9773702,0.003999417,0.000021115107],"about_ca_topic_score_codex":0.00057396386,"about_ca_topic_score_gemma":0.0005671078,"teacher_disagreement_score":0.0049413764,"about_ca_system_score_codex":0.001121772,"about_ca_system_score_gemma":0.00036741857,"threshold_uncertainty_score":0.016530514},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15249355,0.0034980094,0.40831518,0.0046326425,0.0020452014,0.0003899287,0.006393071,0.008633338,0.41359898],"genre_scores_gemma":[0.470823,0.0021253226,0.14180213,0.0013786203,0.0004448809,0.00044085633,0.0060572936,0.0038177413,0.37311018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902225,0.00014923862,0.000050737985,0.00030892424,0.00022199345,0.00024689225],"domain_scores_gemma":[0.99939716,0.00014249542,0.000041930594,0.00016657052,0.00019086135,0.00006092609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079344516,0.0011248147,0.00087149435,0.0014310285,0.0020098314,0.004881969,0.0010220152,0.0009773392,0.06927926],"category_scores_gemma":[0.0017498903,0.00053787977,0.001045596,0.0012403736,0.0026541587,0.0043511633,0.0033391265,0.0026439643,0.022103604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009707821,0.0001637406,0.004896916,0.00071155117,0.00009958874,0.00128876,0.00412137,0.0029375197,0.022432905,0.7126525,0.03931141,0.21041295],"study_design_scores_gemma":[0.00009129206,0.00017297908,0.0046493732,0.00026272787,0.00011546332,0.0014366655,0.0040951273,0.0066338535,0.017194895,0.4089545,0.5562412,0.00015193429],"about_ca_topic_score_codex":0.003652006,"about_ca_topic_score_gemma":0.0043947725,"teacher_disagreement_score":0.06927926,"about_ca_system_score_codex":0.0016515385,"about_ca_system_score_gemma":0.0011804625,"threshold_uncertainty_score":0.23176217},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5556565,0.0006068656,0.40567628,0.001307117,0.00012446736,0.00013470407,0.0019594475,0.0011936888,0.033340935],"genre_scores_gemma":[0.87869143,0.0005124249,0.09598846,0.00030892287,0.0000878032,0.0001733325,0.0023748218,0.00038169263,0.02148118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992461,0.0001781695,0.000045530054,0.00020405058,0.00014019897,0.00018601461],"domain_scores_gemma":[0.99559826,0.001516266,0.0007464373,0.0008357533,0.00043830136,0.0008650933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009115777,0.0006820146,0.0008327021,0.0021987779,0.0024219505,0.002884797,0.001831674,0.0011974855,0.006731924],"category_scores_gemma":[0.004076823,0.0007962237,0.001056462,0.002166298,0.0018714863,0.0034046327,0.0018041168,0.0021233815,0.0008497301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024947917,0.000070154536,0.0024811074,0.000154523,0.000025830599,0.00018087082,0.0005724736,0.036610622,0.004320003,0.91588366,0.0067618727,0.032689285],"study_design_scores_gemma":[0.000022431468,0.000028238966,0.0010596047,0.000031286254,0.000026371887,0.00010547809,0.00020031749,0.08781285,0.0016468439,0.9034747,0.00556807,0.000023882569],"about_ca_topic_score_codex":0.005041129,"about_ca_topic_score_gemma":0.008183423,"teacher_disagreement_score":0.006731924,"about_ca_system_score_codex":0.0018745959,"about_ca_system_score_gemma":0.0010022693,"threshold_uncertainty_score":0.022520542},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7664005,0.0008367188,0.041769207,0.0030376387,0.00031463057,0.00028279526,0.0077522374,0.00060157833,0.1790046],"genre_scores_gemma":[0.9160275,0.000508881,0.037204247,0.00052798353,0.00011640756,0.0001449842,0.0055051367,0.00016256611,0.0398023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996722,0.000060311253,0.000013065907,0.00007349247,0.00008981793,0.00009105651],"domain_scores_gemma":[0.9990343,0.00031479818,0.00015610979,0.0001096329,0.00016879028,0.00021646144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019327231,0.00047045387,0.00074362813,0.0012650567,0.002211619,0.002371481,0.0014832894,0.0012176788,0.01486233],"category_scores_gemma":[0.0014189536,0.0004837882,0.0005459665,0.0015546941,0.0013905128,0.0015301913,0.0009712975,0.001733901,0.0014553749],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007821074,0.00010901734,0.0020954036,0.00085541233,0.000047192694,0.0007038695,0.0006806232,0.014666167,0.008151705,0.90881854,0.02961611,0.033473793],"study_design_scores_gemma":[0.00023281247,0.00007974336,0.0034360217,0.00007219454,0.0000524961,0.00051708607,0.0005694547,0.043493543,0.002976222,0.9201527,0.028355435,0.00006228528],"about_ca_topic_score_codex":0.015775954,"about_ca_topic_score_gemma":0.021637281,"teacher_disagreement_score":0.015775954,"about_ca_system_score_codex":0.0017265577,"about_ca_system_score_gemma":0.0024207158,"threshold_uncertainty_score":0.049719453},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9096113,0.00039598334,0.056261737,0.0009201916,0.00016296092,0.000048542162,0.00046916615,0.00018363193,0.0319465],"genre_scores_gemma":[0.95756406,0.0003373165,0.031910546,0.00039464512,0.00007974967,0.000063966356,0.00060807023,0.00015418546,0.00888745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941874,0.00016200813,0.000036041467,0.000118536496,0.00010006899,0.00016453945],"domain_scores_gemma":[0.99546045,0.0023947435,0.00072964095,0.00043540268,0.0003115063,0.0006681818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005717202,0.00057326275,0.00047956,0.0015804943,0.0014313305,0.002453294,0.0010193081,0.0011450617,0.004341679],"category_scores_gemma":[0.0029224325,0.00074157584,0.00062763534,0.0012980718,0.001888245,0.0024462813,0.0014651442,0.0013723171,0.0004115753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044651062,0.00008583041,0.0037403672,0.00012767455,0.00003116066,0.00029786854,0.001045128,0.007543043,0.012962609,0.95152336,0.003539914,0.018656505],"study_design_scores_gemma":[0.00007000208,0.00003848674,0.0025641804,0.00004462386,0.00003584281,0.00018165908,0.0005183644,0.0113378465,0.0043427125,0.9747772,0.006059268,0.000029943421],"about_ca_topic_score_codex":0.0018219295,"about_ca_topic_score_gemma":0.0030055244,"teacher_disagreement_score":0.004341679,"about_ca_system_score_codex":0.0013357094,"about_ca_system_score_gemma":0.0005332134,"threshold_uncertainty_score":0.0145244},"labels":[],"label_agreement":null},{"id":"W2907709303","doi":"","title":"On Generalized Total Graceful Labellings of Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01131132811106516,"score_gpt":0.23091397186822876,"score_spread":0.2196026437571636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907709303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32782283,0.002234011,0.5171253,0.0054717097,0.0005811808,0.00026553945,0.002285539,0.001891303,0.1423225],"genre_scores_gemma":[0.8467633,0.0018636093,0.11032321,0.0016951568,0.00047027797,0.00041694843,0.0028589258,0.0007492222,0.034859367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982982,0.000516259,0.00009637765,0.0004351752,0.0003366089,0.00031740492],"domain_scores_gemma":[0.99485403,0.002317946,0.00058327336,0.0013022963,0.0003488504,0.0005935962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013152913,0.0009658842,0.00094950426,0.002041927,0.002707183,0.003127651,0.0016048654,0.0016049058,0.009500491],"category_scores_gemma":[0.0057342197,0.0008300023,0.0016856791,0.0024742915,0.0032171356,0.0068723615,0.0037793308,0.003017546,0.0012752345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049731603,0.000032032705,0.00051194266,0.00009241644,0.000015672282,0.00006428737,0.00033439827,0.004401241,0.0009530505,0.97290975,0.00564231,0.014993132],"study_design_scores_gemma":[0.000014939094,0.000010843254,0.00023295713,0.000025903386,0.000014102269,0.00007643387,0.00010371369,0.009876461,0.00037757072,0.98324984,0.0060048182,0.00001228322],"about_ca_topic_score_codex":0.0023869504,"about_ca_topic_score_gemma":0.0033419698,"teacher_disagreement_score":0.009500491,"about_ca_system_score_codex":0.0025056445,"about_ca_system_score_gemma":0.0011694161,"threshold_uncertainty_score":0.03178233},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6673356,0.00051037606,0.22239979,0.0016603312,0.00023908108,0.00011074117,0.00075356726,0.0005562124,0.10643434],"genre_scores_gemma":[0.90368336,0.0004327329,0.07424238,0.0005404868,0.000090952,0.000099183286,0.0007276195,0.00025944036,0.019923842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993741,0.00018425159,0.000024513143,0.0001547555,0.00010443108,0.00015790306],"domain_scores_gemma":[0.9984701,0.00054279866,0.00023747141,0.00033460552,0.00014916368,0.00026584225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005485417,0.0004409197,0.00073193957,0.00093477726,0.002061357,0.0026247457,0.0016439,0.0013544396,0.008248509],"category_scores_gemma":[0.002623938,0.00065163674,0.00070162193,0.0014193085,0.0018212844,0.003349659,0.0019633053,0.0019470925,0.0007804151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110848254,0.0000301227,0.0004941446,0.00006334505,0.000008999647,0.00010400605,0.0002951376,0.0047792466,0.0017232981,0.97855544,0.0022957288,0.011539676],"study_design_scores_gemma":[0.000028163442,0.000021316111,0.00038346028,0.000019975252,0.000014013819,0.00011910031,0.00025970396,0.018934183,0.0011125422,0.9738622,0.005228603,0.000016777449],"about_ca_topic_score_codex":0.003045296,"about_ca_topic_score_gemma":0.0035526967,"teacher_disagreement_score":0.008248509,"about_ca_system_score_codex":0.0012475009,"about_ca_system_score_gemma":0.0009723828,"threshold_uncertainty_score":0.02759403},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18631636,0.002989958,0.5061761,0.0022766218,0.0013294546,0.00045147407,0.004595759,0.00741296,0.28845125],"genre_scores_gemma":[0.5786449,0.0016866362,0.13483502,0.00073331915,0.00034630424,0.00055480935,0.0043267417,0.0025302537,0.27634215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990289,0.00012466106,0.000061428516,0.00029180935,0.00025706028,0.00023618352],"domain_scores_gemma":[0.9986199,0.00033923198,0.00010988117,0.00044106488,0.00034851313,0.00014139221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008190047,0.0009746839,0.00078814797,0.0014686133,0.0021029548,0.00415979,0.001168607,0.0009649433,0.061658975],"category_scores_gemma":[0.002452511,0.0006597838,0.0011438031,0.0011301033,0.0021698219,0.004275656,0.0024892038,0.0021085718,0.017238392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001282169,0.00043499388,0.009282883,0.0012664882,0.00013685825,0.0020424759,0.0040097656,0.0071511394,0.047886398,0.5413889,0.03403775,0.3510802],"study_design_scores_gemma":[0.00014695752,0.00052213157,0.010910226,0.00045961185,0.00018070945,0.00463034,0.004777646,0.018996391,0.05087249,0.43749636,0.47070092,0.0003061561],"about_ca_topic_score_codex":0.0015606468,"about_ca_topic_score_gemma":0.002218749,"teacher_disagreement_score":0.061658975,"about_ca_system_score_codex":0.0013509999,"about_ca_system_score_gemma":0.00120403,"threshold_uncertainty_score":0.20626986},"labels":[],"label_agreement":null},{"id":"W2914875335","doi":"","title":"On Harmonious Labelings of the Balanced Quadruple Shells.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.008527686614361873,"score_gpt":0.21501612014020313,"score_spread":0.20648843352584126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914875335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35144895,0.0012964208,0.43518922,0.0023850969,0.0003575679,0.00013846434,0.0011349805,0.0009076683,0.20714162],"genre_scores_gemma":[0.8319361,0.000816104,0.12346229,0.0007904164,0.00019863495,0.00019288968,0.0011787962,0.00043858722,0.04098617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992434,0.00027509197,0.000036961388,0.00016080916,0.00013540314,0.00014843087],"domain_scores_gemma":[0.9983,0.0007471546,0.00021114627,0.0003696802,0.00016192142,0.00021011298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007246645,0.00040619055,0.0006221843,0.0011560979,0.001837975,0.0022598268,0.0010845022,0.0011437917,0.013361861],"category_scores_gemma":[0.0037245315,0.00048007135,0.0005759474,0.0011388096,0.0017538094,0.005007625,0.0024835875,0.0014799598,0.0020860068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004621134,0.00001988816,0.00022942331,0.000044276745,0.000007360045,0.000035619934,0.00012977878,0.0026183054,0.0008610396,0.97688556,0.004283119,0.014839363],"study_design_scores_gemma":[0.000014201931,0.000012301805,0.0001943357,0.000019783183,0.0000058748583,0.00008257794,0.00013130426,0.009830498,0.0006529404,0.98147017,0.007576564,0.00000940183],"about_ca_topic_score_codex":0.00081948057,"about_ca_topic_score_gemma":0.0014965635,"teacher_disagreement_score":0.013361861,"about_ca_system_score_codex":0.00089529005,"about_ca_system_score_gemma":0.00038483102,"threshold_uncertainty_score":0.044699907},"labels":[],"label_agreement":null},{"id":"W2918261503","doi":"","title":"Tetravalent Normal Primitive Cayley Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cayley graph; Combinatorics; Graph","score_opus":0.011346234755462443,"score_gpt":0.22712490365238494,"score_spread":0.2157786688969225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918261503","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3620462,0.0014379626,0.2046489,0.0040986505,0.001018096,0.00013133774,0.0025253366,0.001520479,0.4225731],"genre_scores_gemma":[0.8603245,0.0010035306,0.057228744,0.00094616954,0.00027813247,0.00010846009,0.0025724927,0.00030883236,0.07722916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949324,0.000099072044,0.00002586155,0.00014518536,0.00012985335,0.00010671548],"domain_scores_gemma":[0.998599,0.00047318364,0.00019483212,0.00030985297,0.00020611545,0.00021707459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035575352,0.0003816634,0.0004945978,0.0012120382,0.0016347193,0.002398252,0.0011992977,0.0008945193,0.020845138],"category_scores_gemma":[0.0017834855,0.0003432244,0.00041678327,0.0014980279,0.0014328859,0.0034465918,0.0014683804,0.0021237351,0.003145934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046213096,0.000031362822,0.00032517163,0.00005139009,0.000005725709,0.00006127223,0.00009229851,0.0010609254,0.0015535144,0.9720168,0.009063103,0.01569211],"study_design_scores_gemma":[0.000014452297,0.00001650153,0.00026738935,0.000019038538,0.000007354914,0.00017459845,0.00016560455,0.00636922,0.0017607611,0.97442526,0.016768437,0.0000113274245],"about_ca_topic_score_codex":0.0012657847,"about_ca_topic_score_gemma":0.0027405613,"teacher_disagreement_score":0.020845138,"about_ca_system_score_codex":0.0013587957,"about_ca_system_score_gemma":0.0005798123,"threshold_uncertainty_score":0.06973398},"labels":[],"label_agreement":null},{"id":"W2918354268","doi":"","title":"Labeling Total Graphs with a Condition at Distance Two.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.007904088926362404,"score_gpt":0.22793766373462704,"score_spread":0.22003357480826463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918354268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35416698,0.0012306554,0.4037362,0.007441536,0.0010059505,0.00028469344,0.00748238,0.00331122,0.22134039],"genre_scores_gemma":[0.7898835,0.0007275258,0.1618602,0.0024022448,0.00041373135,0.00029921308,0.0070543485,0.001036797,0.036322378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813795,0.0005030179,0.00015492357,0.0004979303,0.0003737976,0.00033246932],"domain_scores_gemma":[0.9889665,0.006484257,0.0006954296,0.00223345,0.0007826715,0.0008375485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016175383,0.0007058175,0.0008921428,0.0013764808,0.002430603,0.0036366745,0.0020186622,0.0021808636,0.019963123],"category_scores_gemma":[0.012791194,0.00071751984,0.0009548568,0.0021177912,0.0023064646,0.007924802,0.0035804962,0.0034456912,0.002768425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006888292,0.00024790358,0.0019980904,0.0004704208,0.00005174755,0.00014884608,0.00047153403,0.0067996127,0.007968422,0.891553,0.038382173,0.051219366],"study_design_scores_gemma":[0.00010328087,0.000103343045,0.0011277221,0.00009848497,0.000053609012,0.00031551725,0.0005067001,0.018154342,0.006975656,0.9492984,0.023215739,0.000047251528],"about_ca_topic_score_codex":0.0020594923,"about_ca_topic_score_gemma":0.0031575465,"teacher_disagreement_score":0.019963123,"about_ca_system_score_codex":0.0020366448,"about_ca_system_score_gemma":0.0018171507,"threshold_uncertainty_score":0.06678325},"labels":[],"label_agreement":null},{"id":"W2918627044","doi":"","title":"The Feedback Number of Knodel graph W3, n.","year":2018,"lang":"it","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics; Discrete mathematics","score_opus":0.014242571200523047,"score_gpt":0.24997111424620916,"score_spread":0.2357285430456861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918627044","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7214799,0.0017051792,0.14879562,0.008143812,0.0006274745,0.00018868665,0.008106828,0.0019833336,0.10896908],"genre_scores_gemma":[0.94952744,0.0004456369,0.020587893,0.0005910907,0.00017424684,0.00020051425,0.0020904816,0.0002770381,0.026105652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916565,0.00019084115,0.0000356883,0.00023781753,0.00017062166,0.00019942195],"domain_scores_gemma":[0.9951871,0.0026419265,0.0005515284,0.00048358427,0.0004613256,0.000674472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008482493,0.00048253502,0.00066856184,0.0010301273,0.0016800362,0.0021738478,0.0015711362,0.0014303535,0.016211014],"category_scores_gemma":[0.009312788,0.00030522785,0.0003685271,0.0007274883,0.0012621809,0.0047274516,0.0011414204,0.0012895997,0.0016222554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010815773,0.0002031118,0.004622552,0.0007284049,0.000051303945,0.00017185447,0.00051521324,0.024042262,0.015416972,0.84976524,0.04650046,0.056901053],"study_design_scores_gemma":[0.000103644226,0.00011988661,0.00326867,0.00012972948,0.000049098337,0.00030672154,0.00042871467,0.10396218,0.011535701,0.8608092,0.01922461,0.00006177817],"about_ca_topic_score_codex":0.0020917153,"about_ca_topic_score_gemma":0.0031060379,"teacher_disagreement_score":0.016211014,"about_ca_system_score_codex":0.0017526386,"about_ca_system_score_gemma":0.0011549362,"threshold_uncertainty_score":0.054231226},"labels":[],"label_agreement":null},{"id":"W2918744402","doi":"","title":"Iterative algorithm for computing irregularity strength of complete graph.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Algorithm; Graph; Combinatorics","score_opus":0.01930189634969985,"score_gpt":0.2559862754358235,"score_spread":0.2366843790861236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918744402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022336308,0.00018225939,0.97104216,0.00017003826,0.00007873373,0.00012054872,0.0002548072,0.0011597609,0.004655355],"genre_scores_gemma":[0.18083756,0.00012549665,0.8132262,0.000096431984,0.0000509183,0.0003157595,0.00096039916,0.00025546367,0.0041316715],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991647,0.00026351956,0.000050147417,0.00016404834,0.00024487227,0.00011268802],"domain_scores_gemma":[0.99702954,0.0012188071,0.00018189708,0.0006161705,0.0007731094,0.000180454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012033456,0.0006535258,0.00088948273,0.0019642585,0.0007525818,0.0012696566,0.0020429883,0.0010261417,0.0076626795],"category_scores_gemma":[0.0073752627,0.00043257274,0.00081995357,0.0015233068,0.00089044514,0.0017909501,0.002208703,0.0014059036,0.0019272886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081983465,0.00038157133,0.0066131535,0.0006026012,0.00025190256,0.00020966008,0.0005559391,0.18536186,0.016677422,0.17843238,0.024540164,0.5855534],"study_design_scores_gemma":[0.000097424905,0.00012883177,0.0011378742,0.000037268277,0.00004567546,0.00014521503,0.00012789517,0.8679311,0.005355821,0.11948769,0.005473769,0.000031391595],"about_ca_topic_score_codex":0.0032033222,"about_ca_topic_score_gemma":0.006232142,"teacher_disagreement_score":0.0076626795,"about_ca_system_score_codex":0.0009302784,"about_ca_system_score_gemma":0.0019471684,"threshold_uncertainty_score":0.02563423},"labels":[],"label_agreement":null},{"id":"W2918864036","doi":"","title":"The Radio Number of Edge-Joint Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Joint (building); Enhanced Data Rates for GSM Evolution; Combinatorics; Telecommunications; Computer science; Structural engineering","score_opus":0.013036242085743627,"score_gpt":0.2378308400966959,"score_spread":0.22479459801095225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918864036","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54539955,0.0036898577,0.24401428,0.01041497,0.00068713824,0.00016234523,0.0045734183,0.00092431455,0.19013412],"genre_scores_gemma":[0.9416154,0.0010772039,0.033371575,0.00083100743,0.00040592966,0.000198181,0.0014274396,0.00029543054,0.0207779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802375,0.0008076855,0.00007851766,0.0004535,0.00029418766,0.00034233838],"domain_scores_gemma":[0.985788,0.009534926,0.0014535137,0.0012890953,0.00059534074,0.0013391806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018177233,0.0006707816,0.0009979198,0.002108913,0.0020344374,0.0045359633,0.0025469686,0.0016593711,0.015438809],"category_scores_gemma":[0.015241212,0.0007046581,0.0007039714,0.0017308005,0.0033299667,0.0065478208,0.0024337487,0.0024063177,0.0018870798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003514309,0.000068009256,0.0021150615,0.00025543137,0.000048486523,0.0000763455,0.00029793428,0.015327987,0.0025033387,0.9441846,0.016477378,0.018294025],"study_design_scores_gemma":[0.00008859756,0.00007514195,0.0018762483,0.0000937027,0.00007073793,0.0003677889,0.00031740539,0.065638274,0.0032698426,0.9110259,0.01713056,0.00004577388],"about_ca_topic_score_codex":0.0014096816,"about_ca_topic_score_gemma":0.0013409862,"teacher_disagreement_score":0.015438809,"about_ca_system_score_codex":0.0018972036,"about_ca_system_score_gemma":0.0009190027,"threshold_uncertainty_score":0.0516479},"labels":[],"label_agreement":null},{"id":"W2918944327","doi":"","title":"On the number of (A, B, 2C)-edge colourings in graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Artificial intelligence","score_opus":0.011897159054830898,"score_gpt":0.23915384795836364,"score_spread":0.22725668890353273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918944327","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7429976,0.0064246943,0.09527007,0.021080017,0.0013719046,0.0001889254,0.006132478,0.00084735506,0.12568694],"genre_scores_gemma":[0.9485872,0.0017522004,0.03363636,0.0012380666,0.0007968452,0.00024732054,0.001722772,0.0003370887,0.011682082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99564666,0.0015929948,0.00029582548,0.0010175884,0.0006499747,0.0007970334],"domain_scores_gemma":[0.9383994,0.04964347,0.003949646,0.0030296824,0.0018111741,0.0031666127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041251415,0.0008412444,0.0016215622,0.0036129702,0.003121774,0.007820797,0.0035218166,0.004064071,0.014507982],"category_scores_gemma":[0.03223566,0.0011715697,0.0011106017,0.003792407,0.0057881325,0.0103899855,0.0028147644,0.0036665641,0.001638477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014080867,0.0002822344,0.012383001,0.00077434693,0.00017195578,0.00022351439,0.00071507966,0.029159533,0.00640247,0.8696779,0.033214036,0.04558784],"study_design_scores_gemma":[0.00016409137,0.00010229245,0.004844677,0.00017296892,0.00012163803,0.00072256784,0.00058464624,0.06563616,0.0031855374,0.91552645,0.008858953,0.00008001073],"about_ca_topic_score_codex":0.0018655758,"about_ca_topic_score_gemma":0.00240674,"teacher_disagreement_score":0.014507982,"about_ca_system_score_codex":0.0034532328,"about_ca_system_score_gemma":0.0016291405,"threshold_uncertainty_score":0.048534036},"labels":[],"label_agreement":null},{"id":"W2918952405","doi":"","title":"Decycling Number of a class of 4-regular graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Class (philosophy); Combinatorics; Computer science; Artificial intelligence","score_opus":0.011375865053817203,"score_gpt":0.2493761877820263,"score_spread":0.2380003227282091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918952405","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86271733,0.0008847827,0.024555447,0.0016448218,0.00019832514,0.00006422969,0.0016515555,0.000479563,0.10780402],"genre_scores_gemma":[0.9734124,0.00031727977,0.0097558135,0.00028734672,0.00010339788,0.000064627515,0.0012986078,0.00009626553,0.014664337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957305,0.0000626457,0.000020685111,0.00015701931,0.000073363626,0.000113122864],"domain_scores_gemma":[0.9981993,0.00080024713,0.00028172915,0.0002442878,0.00013666149,0.0003377695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002947578,0.00033829082,0.00054730684,0.001853705,0.0014257935,0.002210282,0.0010431822,0.00083976507,0.012829576],"category_scores_gemma":[0.0019228981,0.00024311044,0.0003548539,0.0011098213,0.0010457933,0.0017048969,0.00097366853,0.0014132545,0.00096912903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042935985,0.00018136099,0.0049007605,0.00023153545,0.00003107524,0.00040364233,0.0004538741,0.007937274,0.0074475002,0.9133279,0.015551259,0.049104493],"study_design_scores_gemma":[0.00007882887,0.00008667737,0.0049258205,0.0000918199,0.000044493776,0.0009899815,0.0005787249,0.04201209,0.0065057366,0.9121352,0.03249896,0.000051682593],"about_ca_topic_score_codex":0.001194078,"about_ca_topic_score_gemma":0.0016072576,"teacher_disagreement_score":0.012829576,"about_ca_system_score_codex":0.0009928104,"about_ca_system_score_gemma":0.0005283011,"threshold_uncertainty_score":0.04291922},"labels":[],"label_agreement":null},{"id":"W2918957452","doi":"","title":"A Note on Color Chains of Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.012875506752105442,"score_gpt":0.2442486377232339,"score_spread":0.23137313097112847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918957452","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011865744,0.023850411,0.35334468,0.05892427,0.024121974,0.00012875428,0.0015454029,0.0016546907,0.52456415],"genre_scores_gemma":[0.27646312,0.042122845,0.43623972,0.03606199,0.024623824,0.00050604757,0.0018210296,0.0022975786,0.17986383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985133,0.00056047115,0.000065870285,0.00034342162,0.0003686469,0.0001483248],"domain_scores_gemma":[0.9922214,0.0055211424,0.00017228618,0.0010578475,0.0005574276,0.0004697574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019696597,0.0010383149,0.001134718,0.002024026,0.003069684,0.003691492,0.0027791166,0.002200515,0.024498804],"category_scores_gemma":[0.0071027614,0.00078572845,0.0012264041,0.0034275723,0.00519505,0.011832692,0.0038498312,0.009737668,0.0056308336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045574478,0.00003249838,0.00022508964,0.0001803257,0.000012772241,0.00011230127,0.00017970541,0.00093329535,0.0006506083,0.9062532,0.07102281,0.020351715],"study_design_scores_gemma":[0.0000071286254,0.000013658007,0.00014783024,0.000055932767,0.000009629856,0.000101838945,0.00007749752,0.0016574956,0.00038602925,0.88836455,0.109163515,0.000014893223],"about_ca_topic_score_codex":0.0040774215,"about_ca_topic_score_gemma":0.008053195,"teacher_disagreement_score":0.024498804,"about_ca_system_score_codex":0.0021434042,"about_ca_system_score_gemma":0.0012243557,"threshold_uncertainty_score":0.081956625},"labels":[],"label_agreement":null},{"id":"W2918973811","doi":"","title":"An application of the incidence matrix to digraphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Incidence matrix; Matrix (chemical analysis); Incidence (geometry); Geometry; Structural engineering","score_opus":0.007477007512825804,"score_gpt":0.25633863857868044,"score_spread":0.24886163106585463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918973811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026905438,0.003757529,0.8321574,0.0031481436,0.0009378113,0.0001196671,0.0011407129,0.00082222733,0.13101113],"genre_scores_gemma":[0.4988584,0.0062199067,0.4476275,0.0012889102,0.0015359024,0.00030849836,0.0015323282,0.0005685976,0.042060006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923277,0.0002752633,0.000050099017,0.00016305251,0.0001996285,0.00007912545],"domain_scores_gemma":[0.99715734,0.0017276149,0.00018739306,0.0004223532,0.00027831495,0.00022714256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078322156,0.0007260788,0.00073246774,0.0030056043,0.0016085323,0.0028423949,0.0012817876,0.0011168736,0.012861084],"category_scores_gemma":[0.007212092,0.00065840024,0.001075451,0.00461189,0.0017153143,0.004396419,0.0024578425,0.0029186292,0.0020034316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017122224,0.000031906107,0.0003370463,0.00007557886,0.000014822444,0.000079983016,0.00011321724,0.0035532417,0.00045811725,0.9603769,0.008128302,0.026813636],"study_design_scores_gemma":[0.0000092437485,0.000010729483,0.00021668023,0.000036339938,0.000013532199,0.00020614362,0.00005967794,0.021096654,0.00034212638,0.9626056,0.015389832,0.0000134371885],"about_ca_topic_score_codex":0.0031690777,"about_ca_topic_score_gemma":0.00472633,"teacher_disagreement_score":0.012861084,"about_ca_system_score_codex":0.0017858801,"about_ca_system_score_gemma":0.00095757627,"threshold_uncertainty_score":0.0430246},"labels":[],"label_agreement":null},{"id":"W2919025434","doi":"","title":"Matching in Toeplitz graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Toeplitz matrix; Mathematics; Matching (statistics); Combinatorics; Statistics; Pure mathematics","score_opus":0.011998820705201342,"score_gpt":0.2376903782897646,"score_spread":0.22569155758456327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919025434","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43918088,0.0022863424,0.3476873,0.0048700795,0.00046548533,0.00015026293,0.0017619656,0.0011968814,0.20240068],"genre_scores_gemma":[0.89978534,0.0009345762,0.056491125,0.0006877782,0.0002692659,0.000101752405,0.0010465899,0.00024902337,0.040434673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991129,0.00022905714,0.00004926214,0.00021714675,0.00018660222,0.0002049317],"domain_scores_gemma":[0.9972746,0.0014883974,0.0003082477,0.000434169,0.00020118234,0.0002934766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000779274,0.00050791196,0.00072043965,0.0017524277,0.0019632464,0.0031611086,0.0013470274,0.0015067382,0.014700187],"category_scores_gemma":[0.00419005,0.0004592538,0.00059996743,0.002488862,0.0016906045,0.0070586833,0.0018180808,0.002225567,0.0021123616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004763405,0.000049666098,0.00034881718,0.000066537,0.000007825181,0.00004344556,0.00009497178,0.002159058,0.00080254005,0.97976345,0.0033161768,0.013300036],"study_design_scores_gemma":[0.000009223728,0.000008915082,0.00015110576,0.000012258731,0.000005861152,0.000073354495,0.00009013614,0.009091521,0.00065656035,0.9863945,0.003498853,0.0000075790813],"about_ca_topic_score_codex":0.001429011,"about_ca_topic_score_gemma":0.002409322,"teacher_disagreement_score":0.014700187,"about_ca_system_score_codex":0.0017258362,"about_ca_system_score_gemma":0.0006914048,"threshold_uncertainty_score":0.04917699},"labels":[],"label_agreement":null},{"id":"W2919134707","doi":"","title":"One modulo N gracefulness of Crowns, Armed crowns and Chain of even cycles.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Modulo; Mathematics; Chain (unit); Combinatorics; Physics; Astronomy","score_opus":0.014587477308387584,"score_gpt":0.2322848075293288,"score_spread":0.21769733022094123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919134707","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6222448,0.0017582863,0.14894019,0.0035358267,0.0005004382,0.000102109196,0.001156463,0.00079353293,0.22096841],"genre_scores_gemma":[0.9443854,0.00054169167,0.03242209,0.000555338,0.00017914992,0.000049055026,0.00049295375,0.00016491792,0.021209368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951553,0.00009021132,0.000028981503,0.00016343278,0.00007219666,0.0001297118],"domain_scores_gemma":[0.9983536,0.0007171769,0.00017855002,0.00036644362,0.00010803239,0.00027616415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005256066,0.0003924499,0.0005108728,0.0007769061,0.0019974757,0.0026472835,0.0008736673,0.0008530343,0.008796072],"category_scores_gemma":[0.002439125,0.0004065545,0.0006936107,0.0006748063,0.0020850245,0.00452639,0.0017885264,0.001541468,0.0008624257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118559255,0.000033739412,0.00071958225,0.000077648205,0.0000111019,0.00013159118,0.00022740866,0.0013784649,0.0018562395,0.97797376,0.0048694597,0.012602468],"study_design_scores_gemma":[0.00001756609,0.000020229672,0.00034901727,0.000022866123,0.000013934818,0.00018913642,0.00013425921,0.0039092014,0.0010736759,0.98626596,0.007990308,0.000013852099],"about_ca_topic_score_codex":0.0015348843,"about_ca_topic_score_gemma":0.0025865827,"teacher_disagreement_score":0.008796072,"about_ca_system_score_codex":0.001108795,"about_ca_system_score_gemma":0.0006645632,"threshold_uncertainty_score":0.0294258},"labels":[],"label_agreement":null},{"id":"W2919198524","doi":"","title":"On the edge irregularity strength of disjoint union of star graph and subdivision of star graph.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Star (game theory); Mathematics; Subdivision; Graph; Combinatorics; Discrete mathematics; Mathematical analysis; Geography","score_opus":0.012866541259594142,"score_gpt":0.22314762620194933,"score_spread":0.2102810849423552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919198524","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7886984,0.0030213515,0.12848571,0.004029541,0.00037003617,0.00009154444,0.00056606,0.00023872156,0.07449857],"genre_scores_gemma":[0.9776653,0.0007886548,0.015192595,0.00033589665,0.00029537576,0.00006255648,0.00031935022,0.00009282691,0.0052475696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828595,0.0007264495,0.00007815589,0.00030936173,0.00035353354,0.0002464354],"domain_scores_gemma":[0.974596,0.016665224,0.0026087856,0.0020898774,0.0014846306,0.0025553924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025498606,0.0004970768,0.0012508973,0.002840983,0.0020212894,0.0025264963,0.0021681974,0.0017786362,0.0068027647],"category_scores_gemma":[0.022130094,0.00073771464,0.00071758416,0.001728157,0.003624908,0.006957286,0.0032660086,0.0026451729,0.0005826484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003332884,0.00009954922,0.0061023906,0.00018631457,0.00005499455,0.0001932571,0.00046572983,0.014400311,0.00313144,0.95130163,0.0055564195,0.018174686],"study_design_scores_gemma":[0.000062095496,0.000106600615,0.004630149,0.00009421047,0.00009754991,0.00046504234,0.0006207455,0.10711281,0.002098009,0.8791547,0.005503115,0.000055081815],"about_ca_topic_score_codex":0.00173841,"about_ca_topic_score_gemma":0.0015863192,"teacher_disagreement_score":0.0068027647,"about_ca_system_score_codex":0.0013630235,"about_ca_system_score_gemma":0.00052480266,"threshold_uncertainty_score":0.02275753},"labels":[],"label_agreement":null},{"id":"W2919327266","doi":"","title":"List injective Coloring of Planar Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Injective function; Mathematics; Planar; Planar graph; Combinatorics; Graph; Computer science; Computer graphics (images)","score_opus":0.013246325226428523,"score_gpt":0.23360655083332388,"score_spread":0.22036022560689536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919327266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34193,0.0040053856,0.36706483,0.007472395,0.0005960379,0.00016391708,0.0060660755,0.002381351,0.27032006],"genre_scores_gemma":[0.860222,0.0021173314,0.07370172,0.0009847027,0.00038192738,0.00014753218,0.0047504697,0.0005190474,0.057175394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999335,0.00018001445,0.000035194753,0.00014002812,0.00012440754,0.0001854765],"domain_scores_gemma":[0.99631906,0.0022635837,0.00030388634,0.0005612078,0.0002646563,0.00028761887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058222236,0.00060607336,0.00053902477,0.001185587,0.0014661107,0.0033021446,0.0015595796,0.000943911,0.01433344],"category_scores_gemma":[0.003969605,0.00050021376,0.00051498384,0.0021399925,0.0013286917,0.005250302,0.0019959975,0.0018067901,0.0021856097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016529781,0.000101687,0.0018903349,0.00031592607,0.000028961369,0.00011122873,0.00031013624,0.010968348,0.0028960016,0.898558,0.031162586,0.05349149],"study_design_scores_gemma":[0.000037661448,0.000028697208,0.0011774357,0.000049533755,0.00003869469,0.0002299915,0.00039283882,0.029187033,0.0032212152,0.942776,0.022835344,0.00002557002],"about_ca_topic_score_codex":0.0027718418,"about_ca_topic_score_gemma":0.0042192363,"teacher_disagreement_score":0.01433344,"about_ca_system_score_codex":0.0019843255,"about_ca_system_score_gemma":0.00094985985,"threshold_uncertainty_score":0.04795009},"labels":[],"label_agreement":null},{"id":"W2919329670","doi":"","title":"On k-distance Pell numbers and ((k-1)A, (k-1)B, kC)-edge coloured graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Telecommunications","score_opus":0.008923617244636667,"score_gpt":0.22488204618104157,"score_spread":0.2159584289364049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919329670","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48586637,0.0058476133,0.19480236,0.017271727,0.001094642,0.00014604157,0.0020293915,0.00064800674,0.29229394],"genre_scores_gemma":[0.90232587,0.0031297116,0.047234297,0.0015660867,0.00067068357,0.00018868114,0.0012892737,0.00027769266,0.043317627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988431,0.00037194422,0.000072471026,0.00023844124,0.0002193971,0.00025452138],"domain_scores_gemma":[0.9940556,0.004070938,0.0007125435,0.0003752657,0.00027749978,0.0005080534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009786577,0.0008016152,0.0007858,0.0019670133,0.002327427,0.0045223655,0.0015247791,0.0022338426,0.013850219],"category_scores_gemma":[0.008543442,0.0006084658,0.0006291434,0.0031780517,0.004679719,0.010201853,0.003446502,0.003358913,0.0021543948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006418722,0.000018077351,0.0004454025,0.00006601866,0.0000065515237,0.00005702492,0.00019414014,0.0026529485,0.00047089058,0.9833687,0.0047552073,0.007900895],"study_design_scores_gemma":[0.0000137892785,0.0000075672665,0.00028167723,0.00002252828,0.0000056532826,0.00010100529,0.00012171369,0.0033728061,0.00028670052,0.99110085,0.0046705217,0.000015264226],"about_ca_topic_score_codex":0.002373488,"about_ca_topic_score_gemma":0.0027305072,"teacher_disagreement_score":0.013850219,"about_ca_system_score_codex":0.0027139555,"about_ca_system_score_gemma":0.00084831513,"threshold_uncertainty_score":0.04633355},"labels":[],"label_agreement":null},{"id":"W2919430429","doi":"","title":"Cubic Edge-Transitive Graphs Of Order 22pn.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transitive relation; Enhanced Data Rates for GSM Evolution; Combinatorics; Order (exchange); Discrete mathematics; Computer science; Telecommunications; Business","score_opus":0.009973449825552743,"score_gpt":0.2316946766332426,"score_spread":0.22172122680768988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919430429","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3795992,0.0010115755,0.087366976,0.0034507604,0.0004230081,0.0003108366,0.01416221,0.0015620816,0.5121134],"genre_scores_gemma":[0.84096783,0.00065264147,0.045459326,0.00062746386,0.000113364295,0.00015639559,0.0077819787,0.00035385607,0.103887066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995234,0.00008529707,0.00002053694,0.000101441554,0.00012726717,0.00014211508],"domain_scores_gemma":[0.99860305,0.0005522464,0.00018944568,0.00031156515,0.00017414431,0.00016954681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021588376,0.00043071163,0.00051199255,0.00069373864,0.0016776563,0.0019329515,0.00096802664,0.0007531346,0.029124493],"category_scores_gemma":[0.0019532915,0.00030402493,0.00041459344,0.0013698622,0.00082004303,0.001771199,0.0011924442,0.0013982075,0.0029603252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003965899,0.00016001737,0.0016830777,0.000371788,0.000038902617,0.0005858028,0.00041308257,0.011846511,0.0059587257,0.88750905,0.04054444,0.050492067],"study_design_scores_gemma":[0.00008518188,0.000047412123,0.0019686415,0.00006124325,0.00002983161,0.00043217794,0.00042706513,0.02042936,0.0047483956,0.8952563,0.07647835,0.000035998],"about_ca_topic_score_codex":0.009564005,"about_ca_topic_score_gemma":0.020882783,"teacher_disagreement_score":0.029124493,"about_ca_system_score_codex":0.0017552358,"about_ca_system_score_gemma":0.0016408173,"threshold_uncertainty_score":0.09743118},"labels":[],"label_agreement":null},{"id":"W2919436614","doi":"","title":"Edge-Critical G, H Colorings.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Artificial intelligence","score_opus":0.015637673558514673,"score_gpt":0.2572041463921928,"score_spread":0.24156647283367813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919436614","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53704435,0.0021283084,0.20096253,0.0070429295,0.0011176819,0.00032436723,0.0063843434,0.0016194312,0.24337614],"genre_scores_gemma":[0.91158694,0.00068032095,0.055529904,0.0010582687,0.00018742867,0.00009903536,0.0024760398,0.00024276106,0.028139394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993967,0.00013325954,0.000029465009,0.00017561429,0.00007976413,0.0001851465],"domain_scores_gemma":[0.9969639,0.0013329771,0.0003657752,0.00044874984,0.00029911523,0.0005894027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006439571,0.00066344626,0.00050279923,0.0011804749,0.0024556685,0.0026440069,0.0011412557,0.0013694037,0.017301774],"category_scores_gemma":[0.0041950247,0.0004894228,0.0004958159,0.0010727916,0.0015968569,0.0026496602,0.0017365136,0.0016650931,0.0017278442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004422386,0.00013609852,0.0031722672,0.00034685765,0.000038941595,0.00043046023,0.00033999622,0.0069974023,0.00791798,0.90855753,0.04835632,0.023263972],"study_design_scores_gemma":[0.00011027473,0.000049120437,0.0017784747,0.00009951657,0.000042041305,0.0007513556,0.0007393183,0.021571571,0.0066856756,0.9363012,0.031839017,0.000032411746],"about_ca_topic_score_codex":0.0021362852,"about_ca_topic_score_gemma":0.0037936359,"teacher_disagreement_score":0.017301774,"about_ca_system_score_codex":0.001663796,"about_ca_system_score_gemma":0.0010293801,"threshold_uncertainty_score":0.057880163},"labels":[],"label_agreement":null},{"id":"W2919517672","doi":"","title":"On Co-PI Index of Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pi; Index (typography); Combinatorics; Statistics; Computer science; Geometry","score_opus":0.01241507167439332,"score_gpt":0.2467552856337838,"score_spread":0.23434021395939048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919517672","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34494704,0.0043942733,0.33573782,0.009595125,0.0010133635,0.00021392186,0.003545145,0.0015537463,0.29899952],"genre_scores_gemma":[0.8525082,0.0021071373,0.08953131,0.0015327791,0.0012072527,0.00033180712,0.0030392502,0.0008300508,0.04891229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978104,0.0005323911,0.00012447413,0.00051647,0.0005442923,0.00047206026],"domain_scores_gemma":[0.9879518,0.00679956,0.001280174,0.0019535967,0.0009794638,0.0010353669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018067455,0.0007894962,0.0014689561,0.0049053174,0.0037730718,0.00559125,0.0025436624,0.0023064723,0.012882713],"category_scores_gemma":[0.012456661,0.0005853722,0.0007460919,0.0056146644,0.0036014875,0.01424107,0.0036368503,0.0043621194,0.003090607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009470264,0.00007393957,0.0013487734,0.000109989596,0.000014800513,0.000058381003,0.00026112926,0.0021966903,0.000956358,0.96283495,0.009766183,0.022284092],"study_design_scores_gemma":[0.000015471025,0.000016800495,0.0006236425,0.00003637101,0.000015058271,0.00015522137,0.000156779,0.012360783,0.0010018352,0.9771763,0.008425971,0.000015704243],"about_ca_topic_score_codex":0.0019046793,"about_ca_topic_score_gemma":0.0025108054,"teacher_disagreement_score":0.012882713,"about_ca_system_score_codex":0.0033223426,"about_ca_system_score_gemma":0.0012540778,"threshold_uncertainty_score":0.04309696},"labels":[],"label_agreement":null},{"id":"W2919524422","doi":"","title":"The neighbor expanded sum distinguishing index of Halin graphs","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Index (typography); Computer science","score_opus":0.012323695238111743,"score_gpt":0.23994206256928932,"score_spread":0.22761836733117757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919524422","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7934263,0.0010693237,0.1159075,0.0028950986,0.000276132,0.00006318443,0.0010294876,0.0004965456,0.08483657],"genre_scores_gemma":[0.9645122,0.000284358,0.024001943,0.00038933332,0.00021025032,0.00006365558,0.0006516155,0.00017935653,0.009707197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904805,0.0002769174,0.000044235516,0.00021766464,0.00023989465,0.0001733485],"domain_scores_gemma":[0.9946413,0.0032208997,0.00051562587,0.0006737075,0.00038389114,0.00056442956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011483222,0.0005037109,0.0010321554,0.002140784,0.0022815329,0.003858311,0.002386502,0.00155853,0.0064612916],"category_scores_gemma":[0.0061931666,0.0004341837,0.00044604635,0.0018843479,0.0022729663,0.0065724077,0.0022733968,0.0026783503,0.00072786416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002791197,0.00008271294,0.0016969054,0.00010895745,0.000016749083,0.000071202645,0.00033228326,0.006345709,0.0033077921,0.9607727,0.005632217,0.021353688],"study_design_scores_gemma":[0.000026840198,0.000031346528,0.0007731895,0.000022072461,0.000023509325,0.0001263253,0.00013896474,0.036121216,0.0030421808,0.9559192,0.0037523094,0.000022733882],"about_ca_topic_score_codex":0.0008000398,"about_ca_topic_score_gemma":0.0010431191,"teacher_disagreement_score":0.0064612916,"about_ca_system_score_codex":0.0019321807,"about_ca_system_score_gemma":0.00082771544,"threshold_uncertainty_score":0.021615148},"labels":[],"label_agreement":null},{"id":"W2919529806","doi":"","title":"On safe sets of the Cartesian product of two complete graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Product (mathematics); Combinatorics; Geometry","score_opus":0.01613526313586127,"score_gpt":0.24405758213284087,"score_spread":0.2279223189969796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919529806","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46295026,0.0016617134,0.42462966,0.0031696653,0.00035932206,0.00018103051,0.0023404276,0.0006934802,0.104014374],"genre_scores_gemma":[0.8593148,0.0008784766,0.11056882,0.0006427376,0.00027934214,0.0002517173,0.0026125305,0.00039018504,0.025061434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996858,0.001168653,0.00021975959,0.00067243545,0.0005772747,0.0005039129],"domain_scores_gemma":[0.98790526,0.008041594,0.001095309,0.0013601196,0.00068459654,0.00091303355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002169126,0.00081176346,0.0011514121,0.0025961318,0.003385485,0.00550615,0.002277335,0.0019773196,0.011141713],"category_scores_gemma":[0.008725747,0.0013350758,0.0020100207,0.0024387399,0.004323943,0.013621668,0.0052369507,0.0032496527,0.0015038355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008349892,0.00004370691,0.00060932885,0.00007932676,0.000021076728,0.00010186554,0.00046293248,0.0033708054,0.00048578775,0.9842539,0.0022076333,0.008280142],"study_design_scores_gemma":[0.000015441548,0.000014394423,0.0002478329,0.000040718693,0.00001769717,0.00011350697,0.00025287937,0.0060850773,0.00058682886,0.9891102,0.0035006115,0.000014816465],"about_ca_topic_score_codex":0.0025216783,"about_ca_topic_score_gemma":0.0030264203,"teacher_disagreement_score":0.011141713,"about_ca_system_score_codex":0.002446785,"about_ca_system_score_gemma":0.0010943944,"threshold_uncertainty_score":0.03727275},"labels":[],"label_agreement":null},{"id":"W2919596741","doi":"","title":"The bounds of the sum of cubes of degrees of graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics; Arithmetic","score_opus":0.011775485508897704,"score_gpt":0.22712656967413533,"score_spread":0.21535108416523763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919596741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22321017,0.0149935,0.44837734,0.019890465,0.001955724,0.00011550052,0.0051548313,0.0010549102,0.28524768],"genre_scores_gemma":[0.87323135,0.004128876,0.086071104,0.0017874846,0.0018429351,0.0003230979,0.0022360845,0.0007357753,0.029643264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962321,0.0011784801,0.00019825554,0.0007779278,0.00096966024,0.0006436658],"domain_scores_gemma":[0.97767925,0.01638108,0.0010961371,0.0020255065,0.0013864931,0.0014316188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033243326,0.0016319357,0.0017096269,0.003669945,0.0024679126,0.006894106,0.004159699,0.0022066296,0.01668227],"category_scores_gemma":[0.028517809,0.001241008,0.0015305475,0.0032646984,0.004289387,0.015523209,0.0057527283,0.0057375375,0.0026330396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018717864,0.000037532533,0.0010036313,0.00017593637,0.000049460567,0.000055777156,0.00020897323,0.0070373304,0.0010413914,0.9613866,0.011422884,0.017393319],"study_design_scores_gemma":[0.000015959837,0.000018648301,0.00067340676,0.00007065529,0.000037970258,0.00016148499,0.000102324535,0.024559783,0.0012278927,0.96500146,0.008105638,0.000024814713],"about_ca_topic_score_codex":0.0021226106,"about_ca_topic_score_gemma":0.0026799978,"teacher_disagreement_score":0.01668227,"about_ca_system_score_codex":0.0032798515,"about_ca_system_score_gemma":0.0012617632,"threshold_uncertainty_score":0.05580777},"labels":[],"label_agreement":null},{"id":"W2919615934","doi":"","title":"Computing total edge product cordial labeling of circulant graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Circulant matrix; Mathematics; Enhanced Data Rates for GSM Evolution; Product (mathematics); Combinatorics; Computer science; Artificial intelligence; Geometry","score_opus":0.013668687130099026,"score_gpt":0.23560794408164107,"score_spread":0.22193925695154204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919615934","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.522974,0.00095178245,0.42357337,0.0015377428,0.00026675346,0.00016258654,0.004002504,0.003589815,0.04294133],"genre_scores_gemma":[0.7679306,0.00034932554,0.21309496,0.00033256842,0.00012870869,0.000114671464,0.0049531697,0.00064344617,0.012452493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941194,0.00016539307,0.000031605126,0.0001618489,0.0001146088,0.00011460476],"domain_scores_gemma":[0.99678934,0.0014943911,0.00029387113,0.0007621674,0.00037039942,0.00028994874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000651029,0.0006611988,0.0009030681,0.0011956242,0.0010269686,0.002279262,0.0013816706,0.0010850173,0.0106591815],"category_scores_gemma":[0.006554884,0.0003973358,0.00054343214,0.0018379829,0.0009133052,0.0033465044,0.0010509533,0.0011179572,0.0016762321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090006494,0.0004625901,0.007602005,0.0008823346,0.000098067285,0.00027123172,0.0004995721,0.11903672,0.0149427205,0.5274647,0.053004265,0.27483565],"study_design_scores_gemma":[0.000076778095,0.00012566433,0.0014356457,0.000056384702,0.0000430077,0.00019253018,0.00022166112,0.38887867,0.007398078,0.5896447,0.011896152,0.000030727017],"about_ca_topic_score_codex":0.0029151912,"about_ca_topic_score_gemma":0.0072819665,"teacher_disagreement_score":0.0106591815,"about_ca_system_score_codex":0.0016927192,"about_ca_system_score_gemma":0.0013378902,"threshold_uncertainty_score":0.03565854},"labels":[],"label_agreement":null},{"id":"W2919730175","doi":"","title":"On (A, 2B, 2C)-edge colouring in certain class of graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Class (philosophy); Combinatorics; Enhanced Data Rates for GSM Evolution; Computer science; Artificial intelligence","score_opus":0.012858385429157368,"score_gpt":0.2361231034346343,"score_spread":0.22326471800547693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919730175","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5781694,0.0028680721,0.17740771,0.013262458,0.0006189257,0.00020291288,0.0025407507,0.00071198255,0.22421774],"genre_scores_gemma":[0.91958165,0.0015190969,0.049536057,0.00203166,0.0005232814,0.00022115033,0.0014254014,0.0002459154,0.024915783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850804,0.00050052296,0.000060863178,0.00035041146,0.00020509945,0.00037513796],"domain_scores_gemma":[0.9916664,0.005528367,0.00078097195,0.0009094258,0.00036238652,0.00075255625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001260882,0.0005246391,0.0008288619,0.0018356816,0.0026803534,0.00367694,0.0015688363,0.0030933204,0.0131203085],"category_scores_gemma":[0.006044321,0.000596451,0.00091080344,0.0025450457,0.003318948,0.0063379603,0.0023760544,0.0034800163,0.0014059499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011517014,0.00006537567,0.00104719,0.000119582815,0.00001591249,0.00010710628,0.00029404962,0.0038670397,0.0013566931,0.9733046,0.010505895,0.009201503],"study_design_scores_gemma":[0.000037106365,0.00001769033,0.000834822,0.000049138078,0.000015918238,0.00024266409,0.00024376957,0.015601296,0.0006044937,0.9762122,0.006120954,0.000019966972],"about_ca_topic_score_codex":0.0024860885,"about_ca_topic_score_gemma":0.002896961,"teacher_disagreement_score":0.0131203085,"about_ca_system_score_codex":0.0025880372,"about_ca_system_score_gemma":0.0010249277,"threshold_uncertainty_score":0.043891847},"labels":[],"label_agreement":null},{"id":"W2919884788","doi":"","title":"γ-Max Labelings of Graphs with Exterior Major Vertices.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.008250059204412056,"score_gpt":0.21776795897396345,"score_spread":0.2095178997695514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919884788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39458197,0.0018183565,0.40071565,0.00525514,0.00043077185,0.00017142396,0.00575089,0.0017686498,0.18950716],"genre_scores_gemma":[0.80085564,0.0009557186,0.14810611,0.0014146675,0.00034870516,0.00023164261,0.005030842,0.0008701054,0.042186476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990484,0.0003255755,0.00005594946,0.00023552008,0.00014090262,0.00019358985],"domain_scores_gemma":[0.99454284,0.00313417,0.0006177874,0.00080995704,0.00037740788,0.0005178759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012546752,0.00076133234,0.0007322506,0.0015642531,0.0020578424,0.0034898608,0.0014620717,0.00129383,0.012744],"category_scores_gemma":[0.006620741,0.0007330393,0.0007812462,0.0016351287,0.0018956356,0.0058857375,0.0023956697,0.002572223,0.0020356993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026480106,0.000073715644,0.0014433786,0.00018625893,0.000019717594,0.00007425123,0.00028793735,0.0061487206,0.0023694218,0.9447773,0.017015066,0.027339324],"study_design_scores_gemma":[0.000028338087,0.000022043598,0.00063382904,0.000052364056,0.000017084798,0.0001492177,0.00025163262,0.01449657,0.0019312148,0.9699972,0.012404149,0.000016320239],"about_ca_topic_score_codex":0.001217125,"about_ca_topic_score_gemma":0.0019732078,"teacher_disagreement_score":0.012744,"about_ca_system_score_codex":0.0018507772,"about_ca_system_score_gemma":0.0007545059,"threshold_uncertainty_score":0.042632937},"labels":[],"label_agreement":null},{"id":"W2919988168","doi":"","title":"An Extension Result on Fractional ID-(g, f, m)-Deleted Graph.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Extension (predicate logic); Graph; Combinatorics; Discrete mathematics; Computer science; Programming language","score_opus":0.0169253529771934,"score_gpt":0.26215417324551804,"score_spread":0.24522882026832465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919988168","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3732407,0.002625595,0.33895144,0.006019882,0.0013376074,0.00020859165,0.0028414263,0.0011802677,0.2735945],"genre_scores_gemma":[0.845547,0.0014691119,0.0979932,0.0020836885,0.00056082784,0.000173999,0.0023608042,0.0003272058,0.049484175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999559,0.000078181176,0.000016006108,0.00014957492,0.000076101984,0.00012114818],"domain_scores_gemma":[0.9983334,0.00066332147,0.00011678266,0.00044966248,0.0001877118,0.00024915652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005133467,0.00047196035,0.0006586497,0.0011522977,0.0025572218,0.001850559,0.0017404949,0.0010591964,0.011324556],"category_scores_gemma":[0.0030979074,0.0002971406,0.00075516663,0.0015967604,0.0012647597,0.0046128333,0.0025948551,0.0021191128,0.0012828734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020679664,0.00011093417,0.0013565967,0.00024582312,0.000018460802,0.0002822238,0.00040888376,0.0045238826,0.004017197,0.932031,0.02295571,0.033842508],"study_design_scores_gemma":[0.000043379256,0.00004775743,0.0011508564,0.00007086533,0.00006297455,0.000808208,0.0003772728,0.020225057,0.0039416137,0.92424333,0.049001098,0.000027679103],"about_ca_topic_score_codex":0.0021185966,"about_ca_topic_score_gemma":0.0017750942,"teacher_disagreement_score":0.011324556,"about_ca_system_score_codex":0.0015453898,"about_ca_system_score_gemma":0.0008037163,"threshold_uncertainty_score":0.037884414},"labels":[],"label_agreement":null},{"id":"W2920201989","doi":"","title":"On the spectral radius of books.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; RADIUS; Computer science; Physics; Computer security; Quantum mechanics","score_opus":0.013156290760488385,"score_gpt":0.22218915655746418,"score_spread":0.2090328657969758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920201989","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17353907,0.023448959,0.22090994,0.024332438,0.0012805595,0.000108850545,0.0030015276,0.0013666204,0.552012],"genre_scores_gemma":[0.8938357,0.0070030447,0.04438577,0.0030874403,0.0017213159,0.0002977696,0.0018053573,0.0012719603,0.046591546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955369,0.002078719,0.00019639816,0.0008964138,0.0007353113,0.0005561991],"domain_scores_gemma":[0.96503663,0.0255193,0.0018473958,0.0034020606,0.0020836003,0.0021109586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029507382,0.0008847003,0.002155176,0.005651349,0.0058432035,0.007359065,0.0026085244,0.0028692738,0.028689958],"category_scores_gemma":[0.036138564,0.0010898177,0.0010080698,0.00741468,0.006622601,0.02168369,0.005483873,0.004199316,0.006004418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007023717,0.000020554826,0.00041974158,0.00007190176,0.000012377382,0.00001917478,0.00023355208,0.0009763831,0.00015253121,0.9788223,0.011176155,0.008025089],"study_design_scores_gemma":[0.000016357035,0.0000107135265,0.0005457935,0.000056641646,0.00001690213,0.000112728325,0.00027570562,0.0050066323,0.0002574593,0.9793635,0.0143207945,0.00001674295],"about_ca_topic_score_codex":0.0033342708,"about_ca_topic_score_gemma":0.002686728,"teacher_disagreement_score":0.028689958,"about_ca_system_score_codex":0.0037110974,"about_ca_system_score_gemma":0.0009785659,"threshold_uncertainty_score":0.095977426},"labels":[],"label_agreement":null},{"id":"W2920249708","doi":"","title":"Distance spectrum of the generalized lexicographic product of a graph with a family of regular graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Lexicographical order; Product (mathematics); Graph product; Graph; Combinatorics; Spectrum (functional analysis); Discrete mathematics; Line graph; Pathwidth; Geometry; Physics","score_opus":0.00898990812416968,"score_gpt":0.2047603004149597,"score_spread":0.19577039229079002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920249708","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8253641,0.00063280284,0.10868678,0.0013813778,0.00016416874,0.000028959517,0.000696052,0.0002534244,0.06279227],"genre_scores_gemma":[0.9714626,0.00024805294,0.018620651,0.0001922575,0.00012984313,0.00004826584,0.0004789441,0.00009904905,0.0087203495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995202,0.00011345515,0.00002243204,0.00013057026,0.00012982576,0.00008346795],"domain_scores_gemma":[0.99848026,0.0005704195,0.00026954027,0.0001576749,0.00017724722,0.0003448551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046357606,0.00033309677,0.0004782216,0.0017383884,0.0011726733,0.0018115615,0.0007807725,0.00081269414,0.007628827],"category_scores_gemma":[0.0019227738,0.00028446343,0.00039379986,0.0009728734,0.001298692,0.0021007394,0.0011875592,0.00092082814,0.0007373028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080536025,0.000023900762,0.0006248834,0.000033716376,0.000010221864,0.00010460003,0.00015014602,0.0017641168,0.0024880539,0.9870898,0.002001054,0.005628895],"study_design_scores_gemma":[0.000029461085,0.000042583346,0.0012404012,0.000025816185,0.000015106936,0.0005262267,0.0002719019,0.032197326,0.0019064094,0.95785964,0.0058634556,0.000021692542],"about_ca_topic_score_codex":0.00079668104,"about_ca_topic_score_gemma":0.0006687077,"teacher_disagreement_score":0.007628827,"about_ca_system_score_codex":0.00087420444,"about_ca_system_score_gemma":0.0004047455,"threshold_uncertainty_score":0.02552098},"labels":[],"label_agreement":null},{"id":"W2920313231","doi":"","title":"Distance two labelings in regular bipartite graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Discrete mathematics; Graph","score_opus":0.01041271974958137,"score_gpt":0.24002021229023857,"score_spread":0.2296074925406572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920313231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3905411,0.002829724,0.43791324,0.011247074,0.0007694705,0.000205485,0.003862682,0.0010174443,0.15161388],"genre_scores_gemma":[0.8565798,0.0010085008,0.109190345,0.001192883,0.00044633247,0.00020311301,0.0023563874,0.0003232516,0.028699473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971507,0.001091512,0.00020609445,0.00066345057,0.00050241995,0.00038573932],"domain_scores_gemma":[0.9861254,0.009577513,0.0011448284,0.0014526037,0.0006477581,0.0010518889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021123225,0.0005347056,0.0009588808,0.002420148,0.0024922974,0.004797047,0.0018123956,0.0025416925,0.012536641],"category_scores_gemma":[0.014512689,0.00069546804,0.0009364987,0.0029622752,0.00321757,0.008565119,0.0033177778,0.003402105,0.0017374726],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015384168,0.000063869826,0.0009791002,0.0001281937,0.00002341866,0.00006557999,0.00027561982,0.0027939249,0.0006976278,0.96843344,0.0076655857,0.01871987],"study_design_scores_gemma":[0.000032647204,0.000018191782,0.00039896433,0.00003977249,0.000019049867,0.0001728149,0.0002484155,0.013262822,0.0007817647,0.9777985,0.0072095958,0.000017404123],"about_ca_topic_score_codex":0.0013640196,"about_ca_topic_score_gemma":0.0016486134,"teacher_disagreement_score":0.012536641,"about_ca_system_score_codex":0.0025237987,"about_ca_system_score_gemma":0.001038402,"threshold_uncertainty_score":0.04193926},"labels":[],"label_agreement":null},{"id":"W2920493612","doi":"","title":"On list backbone coloring of graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Complete coloring; Graph coloring; List coloring; Edge coloring; Fractional coloring; Greedy coloring; Combinatorics; Graph; Line graph","score_opus":0.01357559685688206,"score_gpt":0.23368173776398318,"score_spread":0.22010614090710112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920493612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16631562,0.008033477,0.5058974,0.016595244,0.001980008,0.00034649338,0.0039062195,0.0022655271,0.29465994],"genre_scores_gemma":[0.65480226,0.008208177,0.22547702,0.0047113798,0.0024607324,0.0005272697,0.0061859027,0.0014020749,0.09622526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985662,0.00050981215,0.00005529203,0.0002909638,0.0002472321,0.00033053476],"domain_scores_gemma":[0.992591,0.00469636,0.00044646574,0.0011375992,0.00049927336,0.00062938436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015653408,0.0011341539,0.0011624448,0.0022059944,0.0028478615,0.0037085828,0.0024511747,0.0019375411,0.019877661],"category_scores_gemma":[0.00882329,0.0007782087,0.0008813659,0.0039274152,0.0027589668,0.0109276455,0.00353906,0.0037825597,0.0036112303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017433053,0.00017063487,0.001133721,0.0003122555,0.00003214382,0.00009200313,0.00031671065,0.011092337,0.0012519581,0.87999237,0.05233853,0.053092953],"study_design_scores_gemma":[0.00003703623,0.00002604771,0.00046239674,0.000069547525,0.0000239321,0.00012784454,0.0002501755,0.024110725,0.00076977984,0.9558948,0.01820859,0.000019041052],"about_ca_topic_score_codex":0.0042615053,"about_ca_topic_score_gemma":0.006769475,"teacher_disagreement_score":0.019877661,"about_ca_system_score_codex":0.0033443181,"about_ca_system_score_gemma":0.0016734615,"threshold_uncertainty_score":0.066497445},"labels":[],"label_agreement":null},{"id":"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022591467,0.0006714165,0.1310109,0.006978126,0.0021197738,0.0003374982,0.09640576,0.038088366,0.72212905],"genre_scores_gemma":[0.029354503,0.0020995466,0.08322265,0.0026841434,0.0008247296,0.00054395257,0.13910243,0.03876606,0.703402],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941564,0.00011368198,0.000042528944,0.00011937847,0.00024875673,0.000060051425],"domain_scores_gemma":[0.99852186,0.0005854193,0.000082663435,0.00030311747,0.0003829207,0.00012411749],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00071989174,0.0010966804,0.0010751581,0.0019776686,0.0011046965,0.00452158,0.0024649573,0.0013461072,0.62477905],"category_scores_gemma":[0.0037646517,0.00073982886,0.0011269351,0.0048294626,0.00066158175,0.0044992873,0.0019670462,0.0020174724,0.41340542],"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.00007331271,0.000043311673,0.00013056285,0.00020042896,0.000008863207,0.000048594746,0.00010272704,0.000560542,0.000960333,0.053057075,0.8977154,0.047098827],"study_design_scores_gemma":[0.000047648744,0.000013510845,0.0005976449,0.000091759204,0.0000067024644,0.000088388246,0.00008577494,0.0025735232,0.0017346756,0.06027666,0.9344551,0.000028676697],"about_ca_topic_score_codex":0.011246035,"about_ca_topic_score_gemma":0.018590648,"teacher_disagreement_score":0.62477905,"about_ca_system_score_codex":0.002811169,"about_ca_system_score_gemma":0.0010841107,"threshold_uncertainty_score":0.53520715},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8355177,0.00087893964,0.10151881,0.0012965208,0.00020057384,0.00007910053,0.0010306698,0.00041655553,0.059061058],"genre_scores_gemma":[0.93673193,0.0006522615,0.05380032,0.00037380558,0.00007846791,0.0000706068,0.0011411173,0.00019796107,0.0069534294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987779,0.0002608365,0.000062276886,0.00030778546,0.00021227385,0.0003788979],"domain_scores_gemma":[0.99206614,0.0040855147,0.0011930045,0.0011918463,0.00051193015,0.0009514918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062101806,0.0009106398,0.00059358,0.0010345367,0.0013332436,0.0024081361,0.001012999,0.00086595095,0.0061828587],"category_scores_gemma":[0.0038855486,0.00061231415,0.0008892718,0.0013414449,0.0019789953,0.0029673905,0.0023536526,0.0016265189,0.0008174463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014640625,0.00039329677,0.02695733,0.0007069664,0.00013462624,0.0007355824,0.0016814156,0.054465223,0.034503587,0.7609991,0.015933914,0.102025],"study_design_scores_gemma":[0.00014040702,0.00013600386,0.0077971476,0.00014586466,0.00014894172,0.00063030876,0.00091310067,0.050209973,0.01888891,0.89418375,0.026713345,0.00009222883],"about_ca_topic_score_codex":0.0029498027,"about_ca_topic_score_gemma":0.004751108,"teacher_disagreement_score":0.0061828587,"about_ca_system_score_codex":0.0016591856,"about_ca_system_score_gemma":0.00082051003,"threshold_uncertainty_score":0.020683706},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74162036,0.0008796046,0.23848385,0.0005341102,0.000045956775,0.00008974923,0.0010864873,0.00034204702,0.016917814],"genre_scores_gemma":[0.9307807,0.0007439866,0.05975342,0.00014020123,0.000092090304,0.00008259875,0.0011794271,0.00011986912,0.0071076755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993144,0.00016523995,0.000042394084,0.00023903632,0.00011769545,0.000121157704],"domain_scores_gemma":[0.9975605,0.0009972303,0.00042206564,0.00045290147,0.00026527734,0.000301968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065957755,0.000629472,0.0006411609,0.0013725916,0.0008847366,0.0013924979,0.00069307914,0.00063095207,0.0040100133],"category_scores_gemma":[0.0038986113,0.00044349063,0.0005561689,0.001503353,0.00124256,0.0032481686,0.0011895173,0.0007256344,0.00051241246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042470352,0.00008435351,0.0074187,0.00021354742,0.00006930265,0.00018101303,0.0006453225,0.03227704,0.013510495,0.88794714,0.004857396,0.05237098],"study_design_scores_gemma":[0.000044214943,0.00012788114,0.0026868267,0.000037789014,0.000044743476,0.00048700982,0.0002997046,0.08152796,0.0054291827,0.89471996,0.014567005,0.000027738968],"about_ca_topic_score_codex":0.000993351,"about_ca_topic_score_gemma":0.0011061223,"teacher_disagreement_score":0.0040100133,"about_ca_system_score_codex":0.0009212462,"about_ca_system_score_gemma":0.00031725885,"threshold_uncertainty_score":0.01341486},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55592185,0.0026312028,0.37447718,0.003321771,0.0002760134,0.0002569784,0.0027762577,0.002233454,0.058105223],"genre_scores_gemma":[0.9202289,0.0009457794,0.07106776,0.00033906198,0.00029728955,0.00014769203,0.0012266077,0.0003552956,0.00539168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990087,0.00018335787,0.000027993354,0.00040741957,0.00015984508,0.00021274471],"domain_scores_gemma":[0.987817,0.008261056,0.0007232107,0.0013017048,0.0006648115,0.0012321895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001520982,0.00085659866,0.0011622653,0.0022606226,0.0013983073,0.0028281612,0.0015868336,0.0009945163,0.0067133545],"category_scores_gemma":[0.014090701,0.0007538685,0.00068535714,0.0014272002,0.0024671203,0.0055576493,0.0017798158,0.0023241937,0.0018930446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022130061,0.00049792096,0.026422476,0.0011233649,0.00025919054,0.0016016308,0.0018695315,0.08056346,0.04917305,0.6516663,0.0399045,0.14470561],"study_design_scores_gemma":[0.00012895046,0.00039725675,0.009236941,0.00016650438,0.00017081402,0.00256068,0.00064285455,0.19850011,0.027346268,0.7301945,0.030543337,0.00011170679],"about_ca_topic_score_codex":0.00072131975,"about_ca_topic_score_gemma":0.00068679167,"teacher_disagreement_score":0.0067133545,"about_ca_system_score_codex":0.001582201,"about_ca_system_score_gemma":0.0010169031,"threshold_uncertainty_score":0.022458434},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56288964,0.00039020518,0.30540463,0.0016728401,0.00028977075,0.0004367199,0.002308746,0.0010689725,0.1255385],"genre_scores_gemma":[0.73915666,0.00025371785,0.23893562,0.00033574863,0.000079601865,0.0003071559,0.0025809433,0.00024492762,0.01810568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995921,0.000087036504,0.00002836399,0.00010719863,0.00008137629,0.00010390841],"domain_scores_gemma":[0.9988386,0.00033924525,0.00017174298,0.00020963054,0.00018783027,0.00025301176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003494586,0.00058214384,0.00044479445,0.0018027492,0.0025823223,0.0014864914,0.0009818564,0.00076739077,0.0073533133],"category_scores_gemma":[0.0010997447,0.00066354865,0.0012343404,0.001674881,0.001299261,0.0018269602,0.0016037646,0.001705181,0.0009832896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019616567,0.00009051506,0.0014994991,0.00020659616,0.00002823825,0.00032358276,0.00050622365,0.0022745938,0.011630038,0.9556652,0.0049993605,0.022579908],"study_design_scores_gemma":[0.00009066748,0.00006416143,0.0016071532,0.00004296664,0.00007677419,0.000422228,0.00043312742,0.010703187,0.010330122,0.96055746,0.015626417,0.000045856115],"about_ca_topic_score_codex":0.0013449859,"about_ca_topic_score_gemma":0.0018843254,"teacher_disagreement_score":0.0073533133,"about_ca_system_score_codex":0.0007570934,"about_ca_system_score_gemma":0.0012408864,"threshold_uncertainty_score":0.024599254},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94875264,0.000622027,0.022949858,0.0004997799,0.000043517324,0.00001571325,0.0012061012,0.00022909035,0.025681274],"genre_scores_gemma":[0.986803,0.00034074028,0.0103618475,0.00006580436,0.000038487222,0.000021131636,0.00065061817,0.00004729555,0.0016709878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996637,0.00008456981,0.000017085922,0.00008035211,0.00009571205,0.000058604543],"domain_scores_gemma":[0.9984931,0.0007706066,0.00024419316,0.00021941561,0.00011191082,0.00016072427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025515186,0.00029873868,0.00026881453,0.0012537714,0.00046532325,0.0010560704,0.00043042455,0.00023999444,0.002167157],"category_scores_gemma":[0.0024523723,0.0001932058,0.00023742442,0.0008827005,0.0015095444,0.0013419624,0.0007962745,0.0006125126,0.00021817714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045052244,0.00010241616,0.010303811,0.0002794035,0.00007554619,0.00016791931,0.0006926564,0.05837782,0.009290905,0.86040485,0.011755281,0.048098914],"study_design_scores_gemma":[0.000049624017,0.00006908074,0.010279277,0.000026848178,0.000028011218,0.00030840197,0.00032437636,0.113463245,0.006059322,0.85775757,0.011580498,0.000053742184],"about_ca_topic_score_codex":0.0012462889,"about_ca_topic_score_gemma":0.0014194464,"teacher_disagreement_score":0.002167157,"about_ca_system_score_codex":0.00075227063,"about_ca_system_score_gemma":0.00031842367,"threshold_uncertainty_score":0.0072498918},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86597866,0.00044572988,0.06814836,0.0017361732,0.000093836185,0.00009613265,0.0016389803,0.00063232356,0.061229754],"genre_scores_gemma":[0.9524602,0.00041775045,0.02515222,0.00034655954,0.000070337446,0.0000877819,0.0013926701,0.00026676912,0.019805746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940956,0.000112184905,0.000027727065,0.00018709392,0.000103641636,0.00015981776],"domain_scores_gemma":[0.99451447,0.0032688468,0.0005647605,0.0007681307,0.00028399163,0.0005998495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039284502,0.00093118334,0.0011055213,0.0014127796,0.0024092658,0.0033112124,0.0016447228,0.0011404238,0.011527411],"category_scores_gemma":[0.0036951555,0.0009523905,0.00060680194,0.0015652656,0.0022861408,0.003877221,0.001444863,0.0025481088,0.0008505025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045655124,0.00013445028,0.0037669793,0.00022357694,0.00005265309,0.00079588377,0.00084481924,0.016090961,0.0069698957,0.9411115,0.009276056,0.020276707],"study_design_scores_gemma":[0.000055786288,0.00002980562,0.0014115539,0.00003608579,0.00003473144,0.00040843966,0.00039688224,0.0216487,0.00224757,0.96781,0.005897052,0.000023524011],"about_ca_topic_score_codex":0.0029872668,"about_ca_topic_score_gemma":0.0051049283,"teacher_disagreement_score":0.011527411,"about_ca_system_score_codex":0.0013109572,"about_ca_system_score_gemma":0.00074652146,"threshold_uncertainty_score":0.038563073},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12592693,0.0017822707,0.48249552,0.005351386,0.00046252663,0.00014702338,0.0019942021,0.00079827703,0.38104188],"genre_scores_gemma":[0.7071663,0.0017392413,0.18298113,0.0020565917,0.00047564376,0.00035576,0.0022676368,0.0005178139,0.102439776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989447,0.00023454979,0.000050048,0.00039137944,0.00021843895,0.00016092308],"domain_scores_gemma":[0.99126667,0.005702343,0.00056564785,0.0012712894,0.0007918346,0.0004021638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00114013,0.0008051601,0.0006613381,0.0013919075,0.0020448626,0.002370052,0.0012507502,0.0018559996,0.0075574485],"category_scores_gemma":[0.00574328,0.00083632336,0.0010713934,0.0017517428,0.0033890025,0.004161912,0.0019371511,0.0046037254,0.0021430424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006180993,0.000021561455,0.0002056909,0.000073381925,0.0000053206536,0.000073198804,0.00009724447,0.0025414024,0.0010672004,0.97075665,0.006789134,0.018307371],"study_design_scores_gemma":[0.000008454054,0.0000071047984,0.00018922501,0.000015898559,0.0000054505867,0.00012315984,0.000023669814,0.004559866,0.00069255155,0.98887956,0.0054868944,0.000008197234],"about_ca_topic_score_codex":0.0013993783,"about_ca_topic_score_gemma":0.0017291452,"teacher_disagreement_score":0.0075574485,"about_ca_system_score_codex":0.0022304496,"about_ca_system_score_gemma":0.0010449119,"threshold_uncertainty_score":0.025282204},"labels":[],"label_agreement":null},{"id":"W2962768725","doi":"","title":"On the fractional metric dimension of corona product graphs and lexicographic product graphs","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Metric dimension; Mathematics; Combinatorics; Lexicographical order; Vertex (graph theory); Dimension (graph theory); Product (mathematics); Graph; Discrete mathematics; Chordal graph; 1-planar graph; Geometry","score_opus":0.017058077471779492,"score_gpt":0.23390648515683352,"score_spread":0.21684840768505403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962768725","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88029754,0.001083636,0.110105716,0.00042823722,0.000029686458,0.000026505659,0.00095201586,0.00032773084,0.0067488374],"genre_scores_gemma":[0.95436907,0.0004133308,0.043308802,0.00007115138,0.000051279414,0.000034905817,0.0007577323,0.00007112425,0.0009227052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994561,0.00012065551,0.000037835922,0.00016135439,0.000107164524,0.0001168723],"domain_scores_gemma":[0.99743927,0.001470837,0.00037701015,0.0003501973,0.00013882053,0.00022378861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057564996,0.0006159152,0.0008050991,0.0021714845,0.00096930494,0.00236888,0.0009015721,0.0008786417,0.0023639502],"category_scores_gemma":[0.0051760455,0.00040369527,0.00050906965,0.0030111708,0.0016583542,0.0052283625,0.0011565065,0.0008507724,0.00023524839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009835009,0.00023025098,0.033075653,0.00040217265,0.00017565292,0.0002558819,0.0012762416,0.17532408,0.011032376,0.61432076,0.0070521575,0.15587135],"study_design_scores_gemma":[0.000041321146,0.000084928484,0.007462223,0.00004721161,0.000057504625,0.0005146241,0.00044686848,0.23960647,0.0061060106,0.739152,0.00640373,0.000077097495],"about_ca_topic_score_codex":0.0018762551,"about_ca_topic_score_gemma":0.0020704898,"teacher_disagreement_score":0.00236888,"about_ca_system_score_codex":0.0014466846,"about_ca_system_score_gemma":0.00045321335,"threshold_uncertainty_score":0.010496438},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8921905,0.0011571017,0.07146265,0.00072905,0.00016779282,0.000066339904,0.00018615673,0.0002552888,0.033785027],"genre_scores_gemma":[0.96997815,0.0005804502,0.018539067,0.000096557735,0.00018771389,0.000071591574,0.00025508596,0.000093904884,0.010197509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998992,0.00016936845,0.000056543842,0.0002272924,0.00034163008,0.00021306134],"domain_scores_gemma":[0.998475,0.00066701736,0.0002828293,0.0001531067,0.00014006767,0.00028199542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083527766,0.00051325565,0.0005994839,0.0018657091,0.0020908862,0.0020928602,0.00062013976,0.00071410625,0.0059341397],"category_scores_gemma":[0.0029154867,0.00039716446,0.0005803054,0.00095723924,0.0030827906,0.004719888,0.0023241076,0.0013170494,0.0005655742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022172068,0.00004121346,0.002395931,0.000104616236,0.000015120981,0.00024587856,0.00085806864,0.00445446,0.009055525,0.96452135,0.00066390313,0.017422361],"study_design_scores_gemma":[0.000040170904,0.00007321811,0.0018662293,0.000059948725,0.000030312785,0.0006175498,0.00063831615,0.02180506,0.008336045,0.95693356,0.009563713,0.000035794903],"about_ca_topic_score_codex":0.0006960469,"about_ca_topic_score_gemma":0.0007590931,"teacher_disagreement_score":0.0059341397,"about_ca_system_score_codex":0.0015582443,"about_ca_system_score_gemma":0.00046061428,"threshold_uncertainty_score":0.019851685},"labels":[],"label_agreement":null},{"id":"W2963101942","doi":"","title":"A note on Erdös-Faber-Lovász Conjecture and edge coloring of complete graphs","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Enhanced Data Rates for GSM Evolution; Edge coloring; Graph coloring; Computer science; Graph; Artificial intelligence; Line graph","score_opus":0.01477613073365393,"score_gpt":0.22714554719184227,"score_spread":0.21236941645818833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963101942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22896557,0.019505527,0.36254182,0.08177177,0.006709745,0.00016982958,0.0024337417,0.0014370469,0.29646504],"genre_scores_gemma":[0.8626372,0.013047909,0.07291074,0.0076853307,0.0069776317,0.0001823552,0.0017606859,0.0003814218,0.034416683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974343,0.00080234447,0.000113879374,0.00080853485,0.0005027422,0.00033813887],"domain_scores_gemma":[0.9891284,0.007968622,0.00043875704,0.0012270722,0.00067800144,0.0005591504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038048301,0.0011080734,0.002160146,0.002841273,0.003731917,0.005856101,0.0029958426,0.003351637,0.008385682],"category_scores_gemma":[0.014318054,0.0010995965,0.0020837272,0.005308888,0.0057960902,0.014853682,0.0040032887,0.009144386,0.0010849527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116743475,0.000059798655,0.0008396885,0.00016063776,0.000024799057,0.000085070824,0.0003019015,0.0038513374,0.0006092149,0.9663684,0.015676552,0.011905967],"study_design_scores_gemma":[0.000019639881,0.000009579869,0.00027170207,0.000021525597,0.000014451684,0.000046429534,0.000098193974,0.0052704057,0.00023285276,0.98602575,0.007973455,0.000016027952],"about_ca_topic_score_codex":0.005917107,"about_ca_topic_score_gemma":0.0040453426,"teacher_disagreement_score":0.008385682,"about_ca_system_score_codex":0.0041874764,"about_ca_system_score_gemma":0.001394579,"threshold_uncertainty_score":0.030382454},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36025622,0.0005566732,0.6223865,0.0005338874,0.000095752875,0.00008394955,0.0004996858,0.0008420161,0.014745295],"genre_scores_gemma":[0.69901156,0.0005620954,0.29213613,0.00018399065,0.000043526292,0.00015146888,0.0006784009,0.00021391301,0.0070189186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896455,0.00019512753,0.000074445736,0.00025702728,0.00036098395,0.00014796141],"domain_scores_gemma":[0.99753857,0.0009588687,0.00038284872,0.00070438185,0.0003233769,0.00009205876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063936145,0.000614003,0.0005085989,0.0008758169,0.0011701499,0.0013864434,0.0008839736,0.0007005115,0.0019561064],"category_scores_gemma":[0.0035712062,0.000523466,0.00053079857,0.0013502454,0.0015827413,0.0016070053,0.0027333978,0.0009333729,0.0007289588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016822304,0.00006838378,0.0020384488,0.00024936147,0.000036556383,0.0003004846,0.0011419585,0.051614985,0.04063294,0.8181784,0.0022053083,0.083364956],"study_design_scores_gemma":[0.000047083504,0.0001429877,0.0017733823,0.00010793319,0.00003239945,0.0010104168,0.00026073196,0.18932338,0.09387934,0.6908859,0.022444434,0.00009214827],"about_ca_topic_score_codex":0.0007833659,"about_ca_topic_score_gemma":0.00095490407,"teacher_disagreement_score":0.0019561064,"about_ca_system_score_codex":0.00089813484,"about_ca_system_score_gemma":0.0007186846,"threshold_uncertainty_score":0.006543815},"labels":[],"label_agreement":null},{"id":"W2964173614","doi":"","title":"The partition dimension of corona product graphs","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Partition (number theory); Metric dimension; Connectivity; Graph; Discrete mathematics; Chordal graph; 1-planar graph","score_opus":0.011331266588769288,"score_gpt":0.21947306362596508,"score_spread":0.2081417970371958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964173614","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9097836,0.00080635137,0.06728418,0.00047448,0.000094102754,0.000045709974,0.0012308365,0.00030961423,0.01997102],"genre_scores_gemma":[0.98337597,0.0003719569,0.011188844,0.00012451892,0.000116847055,0.00006912542,0.0012335844,0.000096250325,0.0034228489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902093,0.00017661693,0.000053600197,0.000281452,0.0002522479,0.0002151215],"domain_scores_gemma":[0.9975504,0.00077164255,0.0004946034,0.0003181238,0.0003136817,0.0005515388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064852525,0.0005688765,0.0008357418,0.0029646803,0.001171303,0.0029881885,0.0010054949,0.00088912516,0.00395214],"category_scores_gemma":[0.0035940807,0.00047256335,0.0007003062,0.002118149,0.001861839,0.0036076885,0.0017842072,0.001085161,0.0004371908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003400994,0.00007103123,0.0051966324,0.00015107487,0.00009137986,0.00021915893,0.0010468338,0.013494853,0.0055489056,0.94432306,0.0045817452,0.024935227],"study_design_scores_gemma":[0.00005255163,0.00013706135,0.0072470265,0.000055375942,0.00006879538,0.0008248981,0.00044254703,0.076165006,0.0030398169,0.90005845,0.0118170595,0.00009151463],"about_ca_topic_score_codex":0.0013399567,"about_ca_topic_score_gemma":0.00095642096,"teacher_disagreement_score":0.00395214,"about_ca_system_score_codex":0.0016107728,"about_ca_system_score_gemma":0.0004313716,"threshold_uncertainty_score":0.013221264},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6193152,0.0012450378,0.3420393,0.004123516,0.0002547285,0.00010382313,0.0020000346,0.0010105814,0.029907823],"genre_scores_gemma":[0.9252474,0.0008852162,0.0597109,0.00057753525,0.00029137512,0.00016942083,0.001472481,0.00051454245,0.011131205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980185,0.00074996427,0.00007994859,0.00045224532,0.00028966356,0.00040958606],"domain_scores_gemma":[0.9756704,0.016774347,0.0018238378,0.0022824667,0.0015402985,0.0019086498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017213295,0.0011375828,0.0015733293,0.0015783776,0.0019811136,0.0057174456,0.0025747751,0.001499233,0.005206786],"category_scores_gemma":[0.013683351,0.0013445677,0.00091610546,0.0025649215,0.002043146,0.004532703,0.0022002137,0.0026819266,0.0006655279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008907615,0.000265269,0.005101424,0.00046271988,0.000089491456,0.00023915309,0.00080326374,0.16373421,0.013378357,0.7721338,0.012705009,0.030196501],"study_design_scores_gemma":[0.00007707566,0.000052972464,0.0015292815,0.000042476335,0.000049962273,0.00014948007,0.00022296031,0.25095803,0.0035050167,0.73977053,0.0036115404,0.000030651212],"about_ca_topic_score_codex":0.0030699812,"about_ca_topic_score_gemma":0.004393571,"teacher_disagreement_score":0.0057174456,"about_ca_system_score_codex":0.0039394484,"about_ca_system_score_gemma":0.0015900922,"threshold_uncertainty_score":0.028582871},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000729271,0.029820608,0.0049157133,0.039307293,0.8590771,0.00015784727,0.0022243483,0.000274475,0.063493334],"genre_scores_gemma":[0.0064473054,0.026955897,0.0048879194,0.010678839,0.75508416,0.0002242219,0.004973041,0.0008776943,0.18987095],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875045,0.00017890756,0.00012456182,0.00027371044,0.0005684543,0.00010381597],"domain_scores_gemma":[0.9926772,0.0016318435,0.0003460167,0.00058847916,0.003407401,0.0013490425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022086934,0.002464227,0.0022387072,0.0044976454,0.0017981713,0.0049658413,0.002078903,0.002863885,0.12569466],"category_scores_gemma":[0.008723878,0.00070317654,0.0015751332,0.00401346,0.0008032068,0.0039768266,0.0014564887,0.006305061,0.055842347],"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.000021771886,0.000028747556,0.000052131105,0.00016991567,0.000008379558,0.000018874603,0.000004435782,0.00026120024,0.00010464558,0.0015011181,0.97503227,0.022796491],"study_design_scores_gemma":[0.00002752656,0.00007102108,0.0012457452,0.00038094743,0.000027155967,0.00011878626,0.000025753036,0.0013455505,0.00023856685,0.011099422,0.98539484,0.000024822515],"about_ca_topic_score_codex":0.0018807488,"about_ca_topic_score_gemma":0.0031932693,"teacher_disagreement_score":0.12569466,"about_ca_system_score_codex":0.0027613384,"about_ca_system_score_gemma":0.002730485,"threshold_uncertainty_score":0.42049056},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79800284,0.0003605567,0.15689921,0.0009632026,0.00007348987,0.00008196589,0.0012552267,0.0005679688,0.041795537],"genre_scores_gemma":[0.87290215,0.000343414,0.112440534,0.00035973417,0.000063819956,0.00012223789,0.0016951163,0.00016818037,0.011904821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991566,0.00020068698,0.00006990092,0.00025649485,0.00016433572,0.0001519318],"domain_scores_gemma":[0.9966169,0.0015413763,0.00037510332,0.00060612406,0.0003136417,0.0005469341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000676331,0.000619288,0.0010078326,0.001456147,0.0021685408,0.0033177335,0.0014442701,0.0012594345,0.005002503],"category_scores_gemma":[0.0025639213,0.00073379447,0.00089220656,0.002134191,0.0014144104,0.0032099965,0.002501035,0.0013565264,0.0006378532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008580295,0.00018796674,0.003285464,0.00041022504,0.00011646669,0.0005148805,0.0010074356,0.023499962,0.022892307,0.90639436,0.0068382085,0.033994697],"study_design_scores_gemma":[0.00009969303,0.000112384485,0.0017728099,0.000053611162,0.00014313185,0.0005184216,0.00047015032,0.10783128,0.009246546,0.87207365,0.0076431073,0.000035265475],"about_ca_topic_score_codex":0.001304885,"about_ca_topic_score_gemma":0.0023263774,"teacher_disagreement_score":0.005002503,"about_ca_system_score_codex":0.0013938168,"about_ca_system_score_gemma":0.0008187699,"threshold_uncertainty_score":0.016735017},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3063457,0.0014748615,0.4986527,0.0045020003,0.00029476234,0.0000785302,0.0011820623,0.0006122811,0.18685707],"genre_scores_gemma":[0.8019798,0.0018393332,0.13906671,0.0016784664,0.0004943233,0.00026852157,0.0017356932,0.00053352944,0.05240358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988588,0.0003795295,0.000064604734,0.0002840592,0.00024330887,0.00016971382],"domain_scores_gemma":[0.9955634,0.0025044465,0.00029786184,0.00073194003,0.000445644,0.00045667202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016704751,0.00079761114,0.0010942192,0.0022150518,0.0029049432,0.0040473645,0.0018671715,0.001853205,0.010182587],"category_scores_gemma":[0.0053990846,0.0007897591,0.0013117822,0.0032488543,0.0029932673,0.007861295,0.003619812,0.004041266,0.000966251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001798554,0.000008335354,0.00009720592,0.000036588644,0.000005077691,0.000011549947,0.00009100093,0.000907439,0.00022400355,0.99439776,0.0012405077,0.0029626717],"study_design_scores_gemma":[0.0000060644293,0.00000387698,0.00007103711,0.0000065597064,0.0000074723907,0.000024665416,0.00003219635,0.0036569058,0.00017162289,0.9942801,0.0017354893,0.0000039762617],"about_ca_topic_score_codex":0.0012583421,"about_ca_topic_score_gemma":0.002228185,"teacher_disagreement_score":0.010182587,"about_ca_system_score_codex":0.0020112195,"about_ca_system_score_gemma":0.00080667494,"threshold_uncertainty_score":0.034064174},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6030463,0.0009012919,0.32673225,0.0018424462,0.00019618573,0.00017027187,0.0018754349,0.0007075877,0.064528145],"genre_scores_gemma":[0.8302296,0.0012792934,0.13740209,0.0006168538,0.0001954109,0.00031558433,0.0022183678,0.00036796596,0.027374942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991366,0.00023148503,0.0000628666,0.00025693284,0.00013687345,0.00017519294],"domain_scores_gemma":[0.9954111,0.0025031276,0.0005085858,0.00063322124,0.00033257916,0.0006113212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007824457,0.00088300003,0.0013548027,0.002200889,0.0027627726,0.0038165182,0.0018132852,0.0018160319,0.009109564],"category_scores_gemma":[0.004376295,0.0009990837,0.0011628536,0.004685906,0.002177185,0.006138046,0.0030582559,0.0022155705,0.00081793667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012389636,0.00005860649,0.00071377034,0.00015896112,0.000016600485,0.00009042694,0.00045245452,0.007206498,0.001469522,0.96570146,0.003623102,0.020384848],"study_design_scores_gemma":[0.000019806264,0.000023579452,0.0002849344,0.000028254464,0.000019311414,0.00010576026,0.00015968227,0.014229415,0.0006377184,0.98078674,0.003692905,0.00001177909],"about_ca_topic_score_codex":0.0017821931,"about_ca_topic_score_gemma":0.0024028167,"teacher_disagreement_score":0.009109564,"about_ca_system_score_codex":0.0018143221,"about_ca_system_score_gemma":0.0009053124,"threshold_uncertainty_score":0.030474484},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79535556,0.00030013194,0.15411866,0.000396729,0.000058620106,0.000071238646,0.000592401,0.00026337887,0.048843328],"genre_scores_gemma":[0.9226114,0.0002952198,0.06336726,0.00011861778,0.000044183354,0.00009249952,0.00060101453,0.00006642,0.012803369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965703,0.00008688416,0.000020971778,0.00008663421,0.00008246787,0.00006601615],"domain_scores_gemma":[0.99934703,0.0002623549,0.00011306451,0.00011567965,0.00007193345,0.00008988929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029431694,0.00025222014,0.00022595063,0.0011317336,0.0009674467,0.00091088493,0.00032598514,0.0004089916,0.003412904],"category_scores_gemma":[0.0009726079,0.00025999823,0.000370298,0.0011058594,0.00087568164,0.0012737972,0.00076534157,0.0005108823,0.0003209362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016385209,0.000035930425,0.00184777,0.00010714391,0.000021243497,0.00028760807,0.00057806313,0.013802792,0.009190451,0.9173128,0.0029987604,0.053653575],"study_design_scores_gemma":[0.000020083588,0.00007405909,0.002270551,0.000025217387,0.000022408027,0.00039719327,0.00026432524,0.03894481,0.004369697,0.93735266,0.016236005,0.000022959706],"about_ca_topic_score_codex":0.0010811703,"about_ca_topic_score_gemma":0.002084328,"teacher_disagreement_score":0.003412904,"about_ca_system_score_codex":0.0006729144,"about_ca_system_score_gemma":0.0003621303,"threshold_uncertainty_score":0.01141727},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036892844,0.15123744,0.19193277,0.019741494,0.0060297926,0.00012315343,0.00049866317,0.00075541844,0.625992],"genre_scores_gemma":[0.16477263,0.20401694,0.26449803,0.009362388,0.013846773,0.00074290903,0.001820136,0.0016931099,0.33924714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994728,0.00017476437,0.000022101884,0.00010117017,0.00019034572,0.000038718237],"domain_scores_gemma":[0.99910295,0.0005695135,0.00002303395,0.00015970062,0.00009480882,0.000050049053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006751672,0.0011595698,0.0008452426,0.0013827421,0.0009897801,0.004340698,0.000906555,0.0009276104,0.014317206],"category_scores_gemma":[0.0018965472,0.00044473293,0.0006124936,0.003756604,0.0027651584,0.003881011,0.0013853579,0.003738232,0.005257719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010474375,0.000019800964,0.000076599834,0.0002404816,0.000015773898,0.000023780563,0.000102106285,0.0029384478,0.00024503976,0.84467494,0.08048767,0.071164906],"study_design_scores_gemma":[0.0000057734205,0.000011054463,0.00014444113,0.00021206116,0.000006035181,0.000076953474,0.00003636925,0.005259187,0.00020564438,0.6415482,0.35248375,0.0000105294275],"about_ca_topic_score_codex":0.0013050168,"about_ca_topic_score_gemma":0.0015218178,"teacher_disagreement_score":0.014317206,"about_ca_system_score_codex":0.0022275608,"about_ca_system_score_gemma":0.0011798958,"threshold_uncertainty_score":0.04789585},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21612528,0.0002479668,0.77096087,0.00061618624,0.00009560773,0.0002615801,0.00033351636,0.0013348018,0.010024164],"genre_scores_gemma":[0.43611163,0.00015457615,0.5551867,0.0002001003,0.00005127595,0.00018807387,0.0006807737,0.00027374818,0.007153206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987447,0.00036615535,0.000109141234,0.0003479295,0.00025164578,0.00018028857],"domain_scores_gemma":[0.9957799,0.0016045043,0.00037211395,0.0015799572,0.00034822384,0.00031534946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013616153,0.0006128215,0.0008508044,0.0012842121,0.0009313182,0.0017210935,0.0016516133,0.0010007003,0.003955167],"category_scores_gemma":[0.0066371127,0.0005259369,0.0007489256,0.002447308,0.0014799633,0.0037491142,0.002201815,0.0012367077,0.000624681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062590535,0.000542231,0.0072714943,0.0003910955,0.00012686384,0.00016581772,0.0008214383,0.111738384,0.031059336,0.46705523,0.010319764,0.36988243],"study_design_scores_gemma":[0.00010684447,0.00016371346,0.0012776279,0.000047252695,0.00008018071,0.00025348738,0.00020343231,0.35687622,0.015267926,0.6147336,0.010944599,0.00004511951],"about_ca_topic_score_codex":0.0018140138,"about_ca_topic_score_gemma":0.0028606823,"teacher_disagreement_score":0.003955167,"about_ca_system_score_codex":0.0014977825,"about_ca_system_score_gemma":0.00082944817,"threshold_uncertainty_score":0.013231337},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5658796,0.0009008763,0.38320032,0.001298852,0.00016975502,0.00011368567,0.00073521875,0.0012208341,0.046480954],"genre_scores_gemma":[0.91459346,0.000446152,0.073599614,0.000512753,0.00019122045,0.00016304496,0.00084463967,0.00029115984,0.009357975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978714,0.00044401988,0.00014706513,0.0006687272,0.0004915883,0.00037722313],"domain_scores_gemma":[0.9911574,0.005194833,0.0009536903,0.0015971848,0.0005125708,0.00058424845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015740208,0.0006602287,0.0007491159,0.0014703878,0.00158861,0.002584979,0.001422485,0.0012541966,0.0049581993],"category_scores_gemma":[0.0080900295,0.0006929424,0.001003317,0.0014364006,0.003472535,0.005379139,0.0031209043,0.002238459,0.0005765395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021010968,0.00005438359,0.0012184379,0.00008478324,0.000013281468,0.00013958904,0.00064744666,0.012716179,0.004507486,0.957035,0.0012472485,0.022125954],"study_design_scores_gemma":[0.000032652857,0.00004457391,0.0003275783,0.000027175653,0.00001569393,0.00014061142,0.00012280133,0.028413437,0.0033331937,0.96282697,0.0046962444,0.000019171861],"about_ca_topic_score_codex":0.0012351879,"about_ca_topic_score_gemma":0.0010746359,"teacher_disagreement_score":0.0049581993,"about_ca_system_score_codex":0.002103559,"about_ca_system_score_gemma":0.000544088,"threshold_uncertainty_score":0.0165869},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.926653,0.0002523691,0.00872084,0.0001450571,0.000036440175,0.000016726846,0.00034736644,0.00010945704,0.063718654],"genre_scores_gemma":[0.9936546,0.00013949585,0.0031537341,0.000041338804,0.000015843858,0.0000123618,0.00029018614,0.00003842276,0.002654042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997913,0.00001944011,0.000008877579,0.000048051726,0.000044225217,0.00008818448],"domain_scores_gemma":[0.99929774,0.0002500159,0.000108590306,0.00008851699,0.00011308503,0.00014204696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002012834,0.00021826703,0.00015742006,0.0012793513,0.00093128183,0.001368712,0.00045172015,0.00036859457,0.0055739675],"category_scores_gemma":[0.0009453519,0.00017215511,0.00019245564,0.00082169235,0.0008986913,0.0010198748,0.0006185365,0.0004018877,0.0005403928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013401693,0.0001231033,0.021575874,0.00019992197,0.000044044617,0.00045826644,0.0008308463,0.027977468,0.09236038,0.7909991,0.009107747,0.05498302],"study_design_scores_gemma":[0.00014076754,0.00024407299,0.0396626,0.00008393215,0.00009373609,0.0010873665,0.0012102302,0.17499037,0.108862415,0.6400977,0.033349022,0.0001778081],"about_ca_topic_score_codex":0.0037140432,"about_ca_topic_score_gemma":0.0049814447,"teacher_disagreement_score":0.0055739675,"about_ca_system_score_codex":0.001387158,"about_ca_system_score_gemma":0.00043251933,"threshold_uncertainty_score":0.018646777},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72457725,0.0040891045,0.19284861,0.013596282,0.0005718497,0.00007069841,0.0021818895,0.00042561765,0.06163878],"genre_scores_gemma":[0.97553295,0.001243433,0.015692323,0.0004900422,0.0005603138,0.000101014106,0.00047861,0.00011411966,0.005787198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998664,0.00038666715,0.00006902563,0.00037364257,0.00028687486,0.00021967871],"domain_scores_gemma":[0.98783094,0.008242835,0.000955009,0.0010078145,0.00058737164,0.0013760375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014659432,0.00058725214,0.0013376112,0.0033572593,0.0016006426,0.0064726025,0.0018911456,0.0021581035,0.0051966603],"category_scores_gemma":[0.01022322,0.0007832081,0.0006817566,0.0027556103,0.005331988,0.0106081925,0.0030544621,0.0037599942,0.00043350874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007952979,0.000024294617,0.0011826922,0.00008110223,0.000017468743,0.000033710694,0.00021134409,0.0032375387,0.0013890482,0.9865546,0.0025098608,0.0046787206],"study_design_scores_gemma":[0.000014502868,0.000010208986,0.00066164427,0.000024418441,0.000013439619,0.00008784618,0.00010157763,0.02322762,0.00059537985,0.9734061,0.0018417073,0.000015614185],"about_ca_topic_score_codex":0.0010080967,"about_ca_topic_score_gemma":0.0006349721,"teacher_disagreement_score":0.0064726025,"about_ca_system_score_codex":0.0024515525,"about_ca_system_score_gemma":0.0008162456,"threshold_uncertainty_score":0.017787337},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020503122,0.002470756,0.0011383983,0.069218054,0.9116099,0.00003403293,0.0005061333,0.00023307005,0.014584657],"genre_scores_gemma":[0.011736788,0.012635133,0.0050974893,0.14883669,0.39371505,0.00027053294,0.00292763,0.0011254376,0.4236552],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972493,0.0004936607,0.00026738772,0.00055449404,0.0011843648,0.00025079545],"domain_scores_gemma":[0.9915125,0.00233997,0.00028289875,0.00069357053,0.004688497,0.00048259238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024536618,0.0018484937,0.0020202575,0.003914143,0.0039881244,0.0036465675,0.0044415006,0.005179789,0.05095116],"category_scores_gemma":[0.018020587,0.00096175924,0.00227917,0.0026409833,0.0021657043,0.0035943417,0.0018061959,0.007598462,0.028218959],"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.00001537326,0.0000068419104,0.00002065808,0.00005902228,0.0000071118693,0.00004512492,0.000009908529,0.000047908143,0.000041384956,0.0018094351,0.9950656,0.00287161],"study_design_scores_gemma":[0.000034200675,0.00002549181,0.0009998477,0.00017133931,0.00006465529,0.00017745385,0.00005663291,0.00066856545,0.00044188843,0.014893078,0.9824227,0.000044153523],"about_ca_topic_score_codex":0.020404613,"about_ca_topic_score_gemma":0.030457027,"teacher_disagreement_score":0.05095116,"about_ca_system_score_codex":0.0050593433,"about_ca_system_score_gemma":0.0028222746,"threshold_uncertainty_score":0.1704486},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.710759,0.00059258606,0.21949959,0.0005431104,0.00009919975,0.00017676444,0.001017341,0.0007347758,0.066577636],"genre_scores_gemma":[0.91118395,0.00045817002,0.08111315,0.00020417383,0.000043867673,0.00011196181,0.0010973029,0.00013944948,0.0056479922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995116,0.000062681516,0.000027712846,0.00014093904,0.00012228928,0.00013473108],"domain_scores_gemma":[0.9985959,0.00052049645,0.0002841646,0.00026698638,0.000208937,0.00012353728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026040582,0.0004642816,0.0004199042,0.000917036,0.0009529077,0.0011837719,0.0008066707,0.0004631454,0.0048296624],"category_scores_gemma":[0.0020980393,0.00032847526,0.0005431623,0.0013894645,0.001037732,0.0016942144,0.0011255157,0.0011293826,0.00054329226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003873996,0.00019405894,0.005976673,0.00046815307,0.000049220966,0.0004412911,0.0006026008,0.04859324,0.049839225,0.77879006,0.006884795,0.107773334],"study_design_scores_gemma":[0.00007698448,0.00022840725,0.006270496,0.00006229336,0.00010161866,0.00096865697,0.0005040388,0.14959368,0.035094026,0.77325106,0.03375186,0.00009692138],"about_ca_topic_score_codex":0.001958558,"about_ca_topic_score_gemma":0.0026006275,"teacher_disagreement_score":0.0048296624,"about_ca_system_score_codex":0.0012444064,"about_ca_system_score_gemma":0.00083387335,"threshold_uncertainty_score":0.016156852},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88795185,0.00063065597,0.093157455,0.0004525458,0.000036349622,0.000048514325,0.0007309788,0.0003719029,0.016619688],"genre_scores_gemma":[0.96279585,0.00038900966,0.028850919,0.00015857111,0.000037292157,0.00006409615,0.0008478668,0.00007246483,0.0067840023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958175,0.00005484693,0.000023439077,0.00017418222,0.000055629836,0.0001101182],"domain_scores_gemma":[0.9981845,0.0007644193,0.00040040928,0.00032369466,0.00011806122,0.00020887442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051244686,0.00028292605,0.00025658312,0.00055793114,0.0014967831,0.00074034964,0.00059851905,0.0006009363,0.0039172843],"category_scores_gemma":[0.0020870068,0.00038402053,0.00069218077,0.0006103529,0.0010474145,0.0017229911,0.0008849541,0.0006054415,0.0003972686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081862824,0.00017042007,0.031652883,0.00048310374,0.00009444687,0.002191025,0.004192318,0.056463376,0.06362784,0.74015087,0.011240499,0.08891467],"study_design_scores_gemma":[0.00010855781,0.0005211639,0.025657749,0.00018100018,0.00013506644,0.0054552527,0.0021491775,0.11790944,0.03241478,0.75514823,0.060148444,0.00017120337],"about_ca_topic_score_codex":0.0012420387,"about_ca_topic_score_gemma":0.0011340021,"teacher_disagreement_score":0.0039172843,"about_ca_system_score_codex":0.0007829585,"about_ca_system_score_gemma":0.00024425957,"threshold_uncertainty_score":0.013104618},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8053444,0.003384088,0.13481784,0.0018292774,0.0001443617,0.000053472286,0.0016308749,0.00054230896,0.05225339],"genre_scores_gemma":[0.97851676,0.0009907504,0.017275149,0.00017612574,0.00007044005,0.000041928914,0.0005292182,0.00004309435,0.0023565388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994259,0.00007584632,0.000031580927,0.00017415355,0.00014518043,0.00014733849],"domain_scores_gemma":[0.9982115,0.0007981179,0.00029553383,0.00027248348,0.00014631702,0.00027591636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028445068,0.00041982974,0.00037585132,0.0014143424,0.000864105,0.0016289628,0.0005141858,0.0005049928,0.0026652375],"category_scores_gemma":[0.0023409284,0.00030661296,0.00050728396,0.0012453977,0.0017865526,0.0026208723,0.0015215295,0.0011292406,0.0002404541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016735817,0.000049241564,0.0051562754,0.00018500426,0.00004374985,0.0001826713,0.0005054931,0.015300066,0.01347857,0.93176234,0.0058871806,0.02728203],"study_design_scores_gemma":[0.00002658821,0.00008060431,0.005970356,0.00006723126,0.000049955648,0.0010628684,0.0003358106,0.05634427,0.0067354906,0.9098942,0.019377494,0.000055097833],"about_ca_topic_score_codex":0.0012334818,"about_ca_topic_score_gemma":0.0010743845,"teacher_disagreement_score":0.0026652375,"about_ca_system_score_codex":0.0015805402,"about_ca_system_score_gemma":0.00045767965,"threshold_uncertainty_score":0.011467636},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1167635,0.00047073848,0.83966136,0.001114246,0.000091456066,0.000090851725,0.0005271056,0.0016525838,0.039628234],"genre_scores_gemma":[0.5879918,0.0008257546,0.39395115,0.0004172936,0.00009198837,0.0001749062,0.0010930378,0.00032643328,0.015127784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999405,0.00014226533,0.00001931159,0.00016693394,0.00015626203,0.00011011458],"domain_scores_gemma":[0.9976418,0.0011313885,0.00028694028,0.00060911285,0.0002105132,0.00012029609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044356738,0.00040602777,0.00033043517,0.00059442694,0.0010881564,0.0012180042,0.001004489,0.0006498809,0.0074912976],"category_scores_gemma":[0.0038688986,0.00028722954,0.00040497127,0.0012798614,0.0011983607,0.0028206822,0.0015679289,0.0011672365,0.0014780754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014349907,0.00007518165,0.00092453987,0.00025245687,0.000014533793,0.000088392975,0.00031436267,0.055813443,0.015712058,0.7858784,0.009510144,0.13127284],"study_design_scores_gemma":[0.000028267035,0.000103879545,0.0008037242,0.000042429598,0.000030885152,0.00024305034,0.00016750404,0.15876782,0.010372289,0.7965072,0.03289392,0.000039056045],"about_ca_topic_score_codex":0.002215891,"about_ca_topic_score_gemma":0.0025456317,"teacher_disagreement_score":0.0074912976,"about_ca_system_score_codex":0.0012154065,"about_ca_system_score_gemma":0.0008681402,"threshold_uncertainty_score":0.025060892},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032694128,0.024584696,0.7666313,0.005911205,0.0023022306,0.0002547998,0.0030234114,0.006073442,0.18794945],"genre_scores_gemma":[0.055199362,0.032229077,0.61288065,0.003111,0.0033400035,0.0010982853,0.011074996,0.005007901,0.27605876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99786586,0.0003348848,0.00019824537,0.0005050561,0.0009800731,0.00011584477],"domain_scores_gemma":[0.9972082,0.0009181293,0.00008242079,0.0013791156,0.00032308738,0.00008910622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012779599,0.0019897134,0.0024666332,0.0028046558,0.0018443598,0.007574348,0.0028154494,0.0015627533,0.043488532],"category_scores_gemma":[0.004960009,0.0017148734,0.0015797203,0.009714969,0.0028228464,0.013091469,0.003817115,0.005576643,0.03592772],"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.0000354426,0.00005481438,0.00017267968,0.0005020726,0.000040558873,0.00003538215,0.00019377717,0.002333221,0.00092921103,0.5227688,0.13651505,0.3364189],"study_design_scores_gemma":[0.00001611589,0.000015629712,0.00013044843,0.00012523838,0.000025109666,0.00017486652,0.000048972357,0.005827345,0.0010451751,0.71538574,0.27718863,0.000016823398],"about_ca_topic_score_codex":0.00088517636,"about_ca_topic_score_gemma":0.0009179268,"teacher_disagreement_score":0.043488532,"about_ca_system_score_codex":0.0020242126,"about_ca_system_score_gemma":0.001958781,"threshold_uncertainty_score":0.14548361},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18211877,0.000949389,0.7130075,0.005991643,0.0004831579,0.00059922406,0.010964381,0.021944363,0.06394154],"genre_scores_gemma":[0.33109358,0.00029017948,0.62298125,0.0010039535,0.00010169553,0.0005201012,0.013723036,0.0035189104,0.026767263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998447,0.00037899605,0.000083929604,0.00045602326,0.0003307144,0.0003032879],"domain_scores_gemma":[0.9955088,0.002225385,0.00018955354,0.0014279769,0.00035543597,0.00029286675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008619073,0.0012139967,0.0017861683,0.0014639449,0.0019511787,0.0041269637,0.0037621402,0.0027742842,0.03532813],"category_scores_gemma":[0.008038437,0.0009852645,0.0016463506,0.0036334447,0.0014068687,0.007390222,0.003894201,0.0027764444,0.009475916],"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.0014776688,0.0007657945,0.003082766,0.0013236898,0.00014315064,0.00045495955,0.0014144559,0.111117095,0.020365003,0.19512792,0.16497596,0.49975145],"study_design_scores_gemma":[0.00036831794,0.00017983331,0.0011088998,0.00012127641,0.000098401266,0.00021321687,0.00092797296,0.5628573,0.010731828,0.3938066,0.029527364,0.000059023612],"about_ca_topic_score_codex":0.0062742685,"about_ca_topic_score_gemma":0.018831098,"teacher_disagreement_score":0.03532813,"about_ca_system_score_codex":0.0023306157,"about_ca_system_score_gemma":0.0028343094,"threshold_uncertainty_score":0.11818433},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12125422,0.00061252667,0.8054108,0.0013984798,0.0005417063,0.00023892176,0.0005851248,0.0015586849,0.06839959],"genre_scores_gemma":[0.33710262,0.00060425734,0.6457828,0.0006399822,0.00021612772,0.00042656183,0.00069782784,0.0005978888,0.013931886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914217,0.00025307757,0.000070813294,0.00022244992,0.00019389202,0.000117556374],"domain_scores_gemma":[0.9967512,0.0014140052,0.00031873712,0.0006237107,0.00034937353,0.00054307136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081692095,0.0011316233,0.00067357044,0.0023966236,0.002331404,0.0030707843,0.0022593797,0.0014858759,0.008727091],"category_scores_gemma":[0.0031387112,0.0012352342,0.0012771484,0.002179519,0.0018406475,0.0044881245,0.0036073872,0.003689174,0.0016750683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067654386,0.00006450666,0.000230959,0.000093997995,0.000013879521,0.000098706725,0.00019908676,0.002087932,0.0046781716,0.9707807,0.0033094536,0.018375032],"study_design_scores_gemma":[0.00005801182,0.000042946747,0.00016960195,0.00004450747,0.000030320096,0.00026178805,0.00011754662,0.024542756,0.004755572,0.95712686,0.012808723,0.000041438943],"about_ca_topic_score_codex":0.0006021056,"about_ca_topic_score_gemma":0.001338379,"teacher_disagreement_score":0.008727091,"about_ca_system_score_codex":0.001079211,"about_ca_system_score_gemma":0.00083364686,"threshold_uncertainty_score":0.02919507},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.794585,0.0004045301,0.13366158,0.00063328596,0.0001585711,0.00007677642,0.0013831261,0.00078044063,0.06831669],"genre_scores_gemma":[0.89504606,0.0002882674,0.08588725,0.00022233913,0.000062936575,0.000090777794,0.0020085375,0.0002995795,0.016094241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993012,0.00014803103,0.00005773326,0.00021301938,0.00012816885,0.00015182632],"domain_scores_gemma":[0.9977296,0.0007956334,0.00025239892,0.0005250817,0.00030986647,0.00038742917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047430123,0.0004554993,0.0009475703,0.0011092986,0.0029905704,0.0032094135,0.0010800507,0.0009984486,0.0080771595],"category_scores_gemma":[0.0021284167,0.00063994114,0.0008614508,0.0018465864,0.0012168904,0.0027272631,0.0017950775,0.0011123271,0.0010318176],"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.00067871687,0.00013279407,0.003855864,0.00038725947,0.00007961359,0.00037386647,0.0011927692,0.012826958,0.017004233,0.90898705,0.0092936875,0.045187224],"study_design_scores_gemma":[0.000071038055,0.000090498965,0.0021929594,0.00005505512,0.00009641873,0.00042518458,0.0006150664,0.036368553,0.008700073,0.93865275,0.012697669,0.000034774526],"about_ca_topic_score_codex":0.0012067229,"about_ca_topic_score_gemma":0.0022290905,"teacher_disagreement_score":0.0080771595,"about_ca_system_score_codex":0.001121319,"about_ca_system_score_gemma":0.0008153808,"threshold_uncertainty_score":0.027020812},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7750495,0.0003263405,0.17809497,0.0006727157,0.00015204048,0.000078067234,0.00031297584,0.00028059198,0.045032807],"genre_scores_gemma":[0.9564003,0.00019424305,0.03626843,0.0001421347,0.000043279484,0.000048843383,0.00025930742,0.000048483253,0.0065948954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975854,0.000057886133,0.000012262063,0.00007046432,0.000042568776,0.00005829637],"domain_scores_gemma":[0.99957234,0.000117308686,0.00006402022,0.0000859497,0.00007043164,0.000089947294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018765994,0.00023445774,0.00023738277,0.0006949681,0.00088583404,0.0005811384,0.00029699644,0.00035172366,0.0032962316],"category_scores_gemma":[0.0005665589,0.00015209088,0.00033251676,0.00044567214,0.0008606386,0.0012282097,0.00089559006,0.00052924134,0.00025700667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018050725,0.00005218846,0.0027590352,0.00015325297,0.000015882388,0.00043970425,0.0006558991,0.008144115,0.018537128,0.92972153,0.003430696,0.03591004],"study_design_scores_gemma":[0.000040915857,0.00017713814,0.0032163209,0.00004714977,0.000033893084,0.0010324963,0.0006344605,0.05613535,0.01684915,0.89316666,0.02861882,0.000047584508],"about_ca_topic_score_codex":0.00087579014,"about_ca_topic_score_gemma":0.0007773134,"teacher_disagreement_score":0.0032962316,"about_ca_system_score_codex":0.00056904164,"about_ca_system_score_gemma":0.00025884464,"threshold_uncertainty_score":0.0110269785},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6008705,0.00039150406,0.3286091,0.0013360935,0.00037698654,0.00010930954,0.00028896786,0.001022152,0.06699537],"genre_scores_gemma":[0.88631576,0.00029300188,0.092193276,0.00045491432,0.00019529287,0.00015250761,0.00043804623,0.00048757566,0.019469611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942493,0.00012607529,0.000032190015,0.00016798396,0.00011966351,0.00012930506],"domain_scores_gemma":[0.9983469,0.0007236008,0.00019284275,0.00035639643,0.00012612586,0.0002540926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066196674,0.00048391754,0.00043489801,0.001214081,0.0021079127,0.001683029,0.0010192659,0.0011258342,0.00856524],"category_scores_gemma":[0.003444881,0.00047334077,0.00086690695,0.00071125577,0.0025497188,0.0032353143,0.0024184242,0.002134443,0.0009547563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006885289,0.000037440128,0.00061906705,0.000049738523,0.000006405764,0.00019564314,0.00078701077,0.0039858064,0.0037332738,0.97449005,0.002053437,0.013973374],"study_design_scores_gemma":[0.000029089992,0.0000521671,0.00033544272,0.000032400032,0.000010474684,0.0002045282,0.00029733375,0.022976698,0.002745729,0.95930696,0.0139796855,0.000029485882],"about_ca_topic_score_codex":0.0010183569,"about_ca_topic_score_gemma":0.0015336404,"teacher_disagreement_score":0.00856524,"about_ca_system_score_codex":0.0014608846,"about_ca_system_score_gemma":0.00036103843,"threshold_uncertainty_score":0.028653622},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7390609,0.0027613153,0.18918374,0.013797697,0.00043894077,0.00006146471,0.0016704333,0.00029576445,0.052729774],"genre_scores_gemma":[0.98038864,0.000783855,0.0129423505,0.00048279727,0.00049806637,0.000082319704,0.0003269199,0.00006964829,0.004425456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984907,0.0005293461,0.000069173504,0.00036093968,0.0003143878,0.00023555142],"domain_scores_gemma":[0.9870307,0.008699887,0.0011279054,0.0010394597,0.0006234177,0.0014786076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019480046,0.0006972177,0.0012610225,0.0031098037,0.0019366293,0.0062196474,0.00173508,0.001960396,0.0054234443],"category_scores_gemma":[0.010649295,0.0008283368,0.00075127016,0.002543151,0.006041131,0.012289106,0.0036264667,0.0041453107,0.0003642522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068683505,0.000018706069,0.00085826847,0.000059611953,0.000013817164,0.00002497488,0.00015881215,0.0021497244,0.0008191779,0.99133366,0.0016416537,0.002852938],"study_design_scores_gemma":[0.000012880608,0.000009172493,0.00046205005,0.000016284665,0.000010506461,0.00006098372,0.00007505548,0.01427693,0.00038317151,0.98356646,0.0011157596,0.000010882949],"about_ca_topic_score_codex":0.00073076616,"about_ca_topic_score_gemma":0.0005949036,"teacher_disagreement_score":0.0062196474,"about_ca_system_score_codex":0.0022780849,"about_ca_system_score_gemma":0.00075672485,"threshold_uncertainty_score":0.018143296},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8642395,0.002183477,0.094940625,0.0014137203,0.00010958651,0.000029379482,0.00052967767,0.00025372498,0.03630021],"genre_scores_gemma":[0.9864938,0.0007076386,0.009834333,0.0001328274,0.000089395864,0.000041014642,0.0002638116,0.00005734434,0.0023798577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994759,0.00011408973,0.000020833633,0.00016067579,0.00009484936,0.0001336889],"domain_scores_gemma":[0.9958664,0.0025471027,0.00059765996,0.00029451973,0.0002643827,0.00042992894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005297036,0.0006636717,0.0006211776,0.002567581,0.001030482,0.0016608412,0.0008400777,0.0007799181,0.003033983],"category_scores_gemma":[0.003827457,0.00042156182,0.00049057975,0.0012929185,0.0022872265,0.0035926534,0.0017000125,0.0011183791,0.00039283882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024660412,0.00006804164,0.0074751303,0.000259373,0.00006179649,0.0002935333,0.0007624407,0.02916735,0.016293066,0.91876876,0.0056993808,0.020904567],"study_design_scores_gemma":[0.00003186783,0.00012342686,0.007438464,0.0000721169,0.00004946157,0.00079742965,0.00047674344,0.1025276,0.012070699,0.8660065,0.010310025,0.00009566811],"about_ca_topic_score_codex":0.0006292237,"about_ca_topic_score_gemma":0.0006388093,"teacher_disagreement_score":0.003033983,"about_ca_system_score_codex":0.0010899438,"about_ca_system_score_gemma":0.00031734112,"threshold_uncertainty_score":0.010149717},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24643357,0.0025584488,0.42932713,0.045128662,0.0018361406,0.00020713624,0.0018956686,0.0021618493,0.2704515],"genre_scores_gemma":[0.8439064,0.0018676841,0.10566223,0.009680841,0.0017557351,0.00034358766,0.0021408938,0.0007816101,0.033861052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976179,0.00068091234,0.000082770115,0.00077716965,0.000481129,0.00036006057],"domain_scores_gemma":[0.98512244,0.009473246,0.0005796111,0.0028524154,0.0012033589,0.0007688594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003707297,0.0014279323,0.0023664515,0.003045522,0.0038670097,0.0058184313,0.0039184624,0.004166462,0.014255698],"category_scores_gemma":[0.017716365,0.0014083526,0.002082603,0.0044067083,0.0069395686,0.019648716,0.0068187057,0.009677032,0.0018030892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006199045,0.00002817669,0.0003403196,0.00007544249,0.000009559183,0.000025436831,0.00020872238,0.0019628224,0.00028821683,0.9861973,0.005608033,0.005193985],"study_design_scores_gemma":[0.000019178418,0.0000053784,0.00008511683,0.000014625236,0.000007353147,0.000017723863,0.00005249104,0.004789683,0.00017375677,0.9915605,0.0032658486,0.000008160815],"about_ca_topic_score_codex":0.0057110228,"about_ca_topic_score_gemma":0.0072121304,"teacher_disagreement_score":0.014255698,"about_ca_system_score_codex":0.0044088513,"about_ca_system_score_gemma":0.0017344756,"threshold_uncertainty_score":0.047690094},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8718213,0.00084692053,0.0892204,0.002316885,0.00013843668,0.00007941603,0.00097019435,0.00028704418,0.03431941],"genre_scores_gemma":[0.9516119,0.00083232584,0.03761873,0.00036339348,0.00016564493,0.00011115616,0.0011212208,0.0001983051,0.007977445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931514,0.00018962038,0.000041801308,0.00016520667,0.00013004421,0.00015815809],"domain_scores_gemma":[0.9922255,0.004371168,0.001017142,0.00065672374,0.0005227992,0.0012066287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078613544,0.00071063783,0.0010090495,0.0023549353,0.0026198681,0.004985438,0.0014565797,0.00193559,0.0053832578],"category_scores_gemma":[0.0062954007,0.0013308586,0.0007796309,0.0024589216,0.0022456432,0.0054160594,0.0023139822,0.0025903462,0.00083460775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034290837,0.0001298585,0.0036496334,0.00018081172,0.000028158642,0.0002185697,0.0006937795,0.009182784,0.006281946,0.95740354,0.004825429,0.017062645],"study_design_scores_gemma":[0.00004485867,0.00002122106,0.0012481753,0.000028348592,0.000022551345,0.00013478236,0.00042836543,0.016237216,0.0017096397,0.9774825,0.0026263744,0.000016045788],"about_ca_topic_score_codex":0.0020388674,"about_ca_topic_score_gemma":0.0037715253,"teacher_disagreement_score":0.0053832578,"about_ca_system_score_codex":0.0019098422,"about_ca_system_score_gemma":0.00085925666,"threshold_uncertainty_score":0.018008769},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7461472,0.00080702436,0.13069817,0.0017218319,0.00040544337,0.00012704692,0.0008100158,0.0012496321,0.118033685],"genre_scores_gemma":[0.92655414,0.000816835,0.02750012,0.0006870759,0.00022124324,0.00009470631,0.00080966175,0.00053296366,0.04278334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993223,0.0001264679,0.00002817919,0.00017129343,0.00010560422,0.0002462045],"domain_scores_gemma":[0.9980876,0.0007842349,0.00034518528,0.0003766236,0.000096618634,0.00030972649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004933992,0.0010883347,0.0010090686,0.0013268056,0.0026948457,0.002579055,0.0016816518,0.0016176422,0.01714369],"category_scores_gemma":[0.0021075488,0.00074746046,0.0010228568,0.0020486533,0.0031021438,0.004620055,0.003651739,0.002008618,0.0019456189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029356396,0.000076669814,0.00057777984,0.000117546646,0.000015757729,0.00030670647,0.00050301704,0.01309974,0.0051376284,0.9580641,0.00579375,0.01601391],"study_design_scores_gemma":[0.000048727008,0.000051503634,0.00039393347,0.00004117694,0.000017610444,0.00012527521,0.0002872302,0.012676558,0.0019520528,0.9785967,0.005774433,0.000034860866],"about_ca_topic_score_codex":0.0020785253,"about_ca_topic_score_gemma":0.0025917718,"teacher_disagreement_score":0.01714369,"about_ca_system_score_codex":0.0012151373,"about_ca_system_score_gemma":0.00046673216,"threshold_uncertainty_score":0.05735135},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60227233,0.0007371045,0.31980133,0.0027240585,0.00023615894,0.00013317849,0.0010315349,0.00046969825,0.072594605],"genre_scores_gemma":[0.86552036,0.00085847435,0.1100363,0.001056616,0.00030085733,0.00019443176,0.0016493918,0.0003196818,0.020063804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990338,0.00032224267,0.0000529135,0.00025403325,0.00016606339,0.00017109331],"domain_scores_gemma":[0.9934441,0.0039018618,0.00063296146,0.0007191578,0.00058093644,0.00072103395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011911023,0.0007322506,0.0009058038,0.0022046156,0.0024664386,0.0034211644,0.0017120049,0.0019526418,0.010820643],"category_scores_gemma":[0.00764676,0.00095019164,0.0011414395,0.0026157682,0.0026816272,0.006155906,0.0026032757,0.002663446,0.00085079065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007366914,0.000030855597,0.0006253206,0.00005558209,0.000007518976,0.00005425706,0.00031559626,0.0045929803,0.000810096,0.9830797,0.0021028027,0.008251765],"study_design_scores_gemma":[0.000012559091,0.000010599584,0.00018215057,0.000019397326,0.000006790387,0.00003863845,0.00009561221,0.014059991,0.00022811117,0.9834632,0.0018753823,0.0000075457497],"about_ca_topic_score_codex":0.0025458012,"about_ca_topic_score_gemma":0.0038243216,"teacher_disagreement_score":0.010820643,"about_ca_system_score_codex":0.0019201419,"about_ca_system_score_gemma":0.0008690605,"threshold_uncertainty_score":0.036198676},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67457384,0.005072533,0.25802046,0.004354192,0.00029577455,0.00010129023,0.0022492493,0.0003394324,0.054993205],"genre_scores_gemma":[0.956369,0.0014864132,0.03666459,0.00025725874,0.00028591353,0.00008584222,0.0007407699,0.000058505935,0.004051699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988967,0.0002673066,0.00007338772,0.00030556353,0.00022404337,0.00023299246],"domain_scores_gemma":[0.99502975,0.0025811554,0.0007512521,0.0005670927,0.00036067236,0.0007100743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011239365,0.00045396786,0.0006974852,0.0025228278,0.0013224279,0.0024131818,0.0008400685,0.000866454,0.0026262403],"category_scores_gemma":[0.005154916,0.00032833908,0.0005906592,0.0023264107,0.003008841,0.0048051034,0.0021244567,0.0013636663,0.00027319085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009419694,0.000031970932,0.002171166,0.0001000322,0.000027346396,0.00006797951,0.00029537233,0.00555415,0.0012939711,0.9719025,0.003677176,0.01478409],"study_design_scores_gemma":[0.000014397924,0.00002509556,0.00113023,0.000029732702,0.000017380484,0.00022262894,0.00016493101,0.017072566,0.0007285062,0.97474086,0.005834567,0.00001917567],"about_ca_topic_score_codex":0.00084449153,"about_ca_topic_score_gemma":0.0005404807,"teacher_disagreement_score":0.0026262403,"about_ca_system_score_codex":0.0017375612,"about_ca_system_score_gemma":0.00055487297,"threshold_uncertainty_score":0.012606978},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3314406,0.00044412544,0.61998916,0.0007920239,0.00020404387,0.00011791125,0.0004321809,0.00083599205,0.045744006],"genre_scores_gemma":[0.76232433,0.000445415,0.21614832,0.0004602481,0.00013812388,0.00021149334,0.0010937961,0.0005917598,0.018586442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994493,0.0000977274,0.000038197348,0.00017091604,0.00013469043,0.00010916846],"domain_scores_gemma":[0.99834704,0.00042424316,0.00020194644,0.00046141565,0.00026707925,0.00029831976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057933724,0.00042558284,0.00038653644,0.0010829691,0.0015714607,0.0011131925,0.00081056345,0.00094734365,0.0063186865],"category_scores_gemma":[0.0028233458,0.0004454003,0.000765351,0.0006884256,0.0020494002,0.002304509,0.0016187609,0.0016096957,0.0010772834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012056354,0.00003566102,0.0010680835,0.00012702888,0.000014941539,0.00021355352,0.00076413836,0.014675107,0.023204353,0.91495574,0.0032362225,0.041584674],"study_design_scores_gemma":[0.000027266542,0.00014936764,0.0009767351,0.00008240782,0.000030171528,0.0004256602,0.000503257,0.07672006,0.0187147,0.8664299,0.035876695,0.000063899075],"about_ca_topic_score_codex":0.0009240148,"about_ca_topic_score_gemma":0.0012076803,"teacher_disagreement_score":0.0063186865,"about_ca_system_score_codex":0.0007492593,"about_ca_system_score_gemma":0.00042673416,"threshold_uncertainty_score":0.021138132},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026230209,0.0047646803,0.86343485,0.011404938,0.002724536,0.00014377238,0.00060282316,0.00087810133,0.08981606],"genre_scores_gemma":[0.31315026,0.009648682,0.62046283,0.0072871987,0.0028994104,0.00049929495,0.0010306546,0.0011920327,0.043829735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809676,0.0007508454,0.00006708666,0.00045367828,0.0004732624,0.0001582993],"domain_scores_gemma":[0.99282116,0.00513417,0.00022027871,0.0010958151,0.00037520056,0.0003533836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017842522,0.0014912509,0.0017457079,0.0016089351,0.0021928842,0.0030787005,0.0035926022,0.0035529968,0.011269898],"category_scores_gemma":[0.010317475,0.0008133166,0.0014584048,0.004176802,0.0050240974,0.007269684,0.0058235554,0.008022893,0.0016105484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009204209,0.000048650505,0.00022636836,0.00018806297,0.000021623251,0.0000704896,0.00012727623,0.01169301,0.0012552374,0.9333993,0.01608908,0.03678882],"study_design_scores_gemma":[0.000017052742,0.000013521913,0.000102109414,0.00003449739,0.000014225222,0.000050070823,0.000028911303,0.019489637,0.00048917136,0.96637106,0.013375077,0.0000146750435],"about_ca_topic_score_codex":0.002895451,"about_ca_topic_score_gemma":0.0027928676,"teacher_disagreement_score":0.011269898,"about_ca_system_score_codex":0.002244405,"about_ca_system_score_gemma":0.0011922943,"threshold_uncertainty_score":0.037701547},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7850697,0.0004197765,0.18959196,0.0004889598,0.00006732535,0.000086335094,0.00034601748,0.00022504969,0.023704901],"genre_scores_gemma":[0.9452184,0.0003345996,0.04976366,0.000119766846,0.00005687051,0.00009702891,0.00047165834,0.00008125732,0.003856626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989791,0.00028402082,0.000054770542,0.00024658183,0.00025566152,0.00017992305],"domain_scores_gemma":[0.995103,0.0025966808,0.0007775027,0.00090678054,0.00029114675,0.00032491784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095810514,0.00039836703,0.0005303032,0.001364848,0.0016995133,0.0012759324,0.0009903861,0.0010578064,0.0032746848],"category_scores_gemma":[0.0060093803,0.00037971113,0.0009285109,0.0011980662,0.0019768444,0.0021196958,0.00087799557,0.0010781818,0.0004264216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108383996,0.00007872751,0.0046076425,0.000120908204,0.00003525525,0.0002877199,0.00054120674,0.01773595,0.014878774,0.9250626,0.0019804244,0.034562387],"study_design_scores_gemma":[0.00003491509,0.000111953545,0.0031076656,0.000045172455,0.00004152395,0.00078465923,0.00039772064,0.046174083,0.010015269,0.9316501,0.007594216,0.00004273629],"about_ca_topic_score_codex":0.0015200748,"about_ca_topic_score_gemma":0.0018539918,"teacher_disagreement_score":0.0032746848,"about_ca_system_score_codex":0.0012869787,"about_ca_system_score_gemma":0.0006632711,"threshold_uncertainty_score":0.0109549165},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92561775,0.0001935972,0.059714954,0.00018844315,0.000020979203,0.000027468815,0.00033878387,0.00010748344,0.013790531],"genre_scores_gemma":[0.98841363,0.00010944287,0.009839199,0.000037233367,0.000015833313,0.000021545236,0.00019164092,0.000026869871,0.0013446532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995136,0.00012452011,0.000029114197,0.00011321726,0.00013501689,0.00008455622],"domain_scores_gemma":[0.997189,0.0013800877,0.00042861875,0.0003229764,0.00043278557,0.00024645354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006371952,0.00024642848,0.00035773052,0.0017732016,0.00088976795,0.0010206263,0.00068371766,0.00041187147,0.002306334],"category_scores_gemma":[0.0029070198,0.0002996832,0.00040343404,0.0011798576,0.0012364786,0.0018890791,0.0007489106,0.00064862915,0.00019480848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036429617,0.00008489274,0.0248927,0.00031711298,0.00010402188,0.0005836515,0.0011633218,0.04160462,0.032467246,0.8465894,0.0027018895,0.0491269],"study_design_scores_gemma":[0.000034083536,0.00016306808,0.019284094,0.000057144916,0.0001016085,0.0012060907,0.0007873273,0.15129766,0.016578835,0.80082923,0.009584473,0.000076273885],"about_ca_topic_score_codex":0.00061331695,"about_ca_topic_score_gemma":0.00075614563,"teacher_disagreement_score":0.002306334,"about_ca_system_score_codex":0.0006549534,"about_ca_system_score_gemma":0.00021194233,"threshold_uncertainty_score":0.0077154636},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8363503,0.00041296042,0.11257188,0.0003694335,0.00004825407,0.000042957534,0.00063330465,0.00020805906,0.04936282],"genre_scores_gemma":[0.93787134,0.00029112844,0.047357377,0.0000799237,0.00003048291,0.000046544847,0.0007683941,0.000070691814,0.013484058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953794,0.00010193705,0.000024373136,0.00017154115,0.00008905856,0.00007520891],"domain_scores_gemma":[0.99861,0.0005963458,0.00018557541,0.00019090447,0.00022277396,0.00019434473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043630463,0.00031876078,0.00027783884,0.0007975211,0.0008040323,0.001203317,0.00041135508,0.00030214322,0.0033088983],"category_scores_gemma":[0.001411781,0.0003438793,0.0003997419,0.0008106348,0.0016584845,0.0012511058,0.000924231,0.0005745041,0.000253166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002797449,0.000052390453,0.0030509492,0.00017145206,0.000028432249,0.00031149996,0.0008981749,0.015581959,0.011278489,0.942479,0.0033543704,0.022513513],"study_design_scores_gemma":[0.000068796166,0.00014616048,0.00485054,0.000036484093,0.000057448848,0.0010601855,0.0004927874,0.062580325,0.008446787,0.9017321,0.020479904,0.000048348975],"about_ca_topic_score_codex":0.0023969896,"about_ca_topic_score_gemma":0.0027724192,"teacher_disagreement_score":0.0033088983,"about_ca_system_score_codex":0.000847796,"about_ca_system_score_gemma":0.00046983716,"threshold_uncertainty_score":0.011069357},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5690063,0.001456876,0.38707653,0.0010913954,0.0002175438,0.00007704956,0.0009385913,0.0007482863,0.039387345],"genre_scores_gemma":[0.93671405,0.0007081306,0.05189657,0.00030776206,0.00019242715,0.000074499876,0.0007044532,0.00021078836,0.00919126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993092,0.00014219036,0.0000480841,0.00020027765,0.00015176469,0.00014843752],"domain_scores_gemma":[0.9973609,0.00084489933,0.0004842779,0.0005524833,0.00030981697,0.0004476093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005904715,0.00033570055,0.0004160665,0.0011308123,0.0012487515,0.0017119584,0.00061497197,0.0006412636,0.0033757975],"category_scores_gemma":[0.0033778048,0.0002948986,0.0005329819,0.0010770587,0.0018607351,0.0034476896,0.0016556539,0.0012609535,0.00059629726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011686968,0.000027608176,0.0011206373,0.00008376884,0.000011882093,0.0002354898,0.00050513004,0.012671018,0.009132447,0.9525736,0.0021751549,0.0213464],"study_design_scores_gemma":[0.00001128872,0.00004118215,0.0005148915,0.000026253569,0.000008941361,0.00021261386,0.00018702599,0.022863116,0.0029032573,0.96461517,0.008597635,0.000018624027],"about_ca_topic_score_codex":0.0009834592,"about_ca_topic_score_gemma":0.0010576925,"teacher_disagreement_score":0.0033757975,"about_ca_system_score_codex":0.0010884467,"about_ca_system_score_gemma":0.00044410085,"threshold_uncertainty_score":0.011293173},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94608605,0.00018250827,0.0327995,0.00039907405,0.000018992767,0.000027573264,0.00029243418,0.0000981182,0.02009587],"genre_scores_gemma":[0.98954356,0.000100556164,0.008190762,0.00006362346,0.0000286248,0.00003661052,0.00027554794,0.000015209535,0.0017454863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996007,0.000101161975,0.000025400135,0.00010204188,0.00009223526,0.00007849622],"domain_scores_gemma":[0.99813384,0.00090427866,0.00038885328,0.00021483868,0.0001238932,0.00023433838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043945003,0.0002509407,0.00034309534,0.0010277716,0.0012069357,0.0015676543,0.0004787929,0.00058849435,0.0028966402],"category_scores_gemma":[0.0016612072,0.00037431307,0.00033516603,0.0007965022,0.0017029997,0.0016995716,0.00096752186,0.00056764425,0.00022336781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005413474,0.0000835288,0.0054233777,0.00018543926,0.000044758846,0.00038821966,0.0013750456,0.016326835,0.014603312,0.94224644,0.0031692728,0.015612471],"study_design_scores_gemma":[0.00011476837,0.00009682437,0.0031890124,0.000029708768,0.000030118563,0.00047352616,0.00047034232,0.036645245,0.003946076,0.95022476,0.004754643,0.000024996541],"about_ca_topic_score_codex":0.0007834585,"about_ca_topic_score_gemma":0.0010484173,"teacher_disagreement_score":0.0028966402,"about_ca_system_score_codex":0.0006271459,"about_ca_system_score_gemma":0.00035946717,"threshold_uncertainty_score":0.009690225},"labels":[],"label_agreement":null},{"id":"W31267046","doi":"","title":"The Dynamic Coloring Numbers of Pseudo-Halin Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Treewidth; Pathwidth; Graph; Line graph","score_opus":0.005903853570609179,"score_gpt":0.21390702935142047,"score_spread":0.2080031757808113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W31267046","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5428586,0.0022213166,0.17749073,0.0067199958,0.0008540306,0.00015027118,0.002340169,0.0007456937,0.26661927],"genre_scores_gemma":[0.94845355,0.00077037525,0.026176466,0.0004168358,0.0002793208,0.00019156854,0.0007109372,0.0001777716,0.022823181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991621,0.00022906798,0.000038023205,0.0001845781,0.00019736482,0.00018897704],"domain_scores_gemma":[0.99432015,0.0034247604,0.00060438825,0.0005145427,0.0005036727,0.00063244335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097563065,0.00051889097,0.0004219643,0.002854123,0.0022300314,0.0040673614,0.0014628503,0.0011802736,0.013977093],"category_scores_gemma":[0.008976965,0.00054228137,0.00035304372,0.0017745704,0.0028388237,0.0068342974,0.0016671997,0.0019809352,0.0014282613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010736772,0.000023516764,0.0007828907,0.000042422922,0.000005916555,0.000031114447,0.00014318051,0.003571711,0.0010963656,0.97865134,0.005127208,0.0104168635],"study_design_scores_gemma":[0.00003191213,0.000021425449,0.00091520353,0.000035966965,0.0000102195545,0.00012940065,0.00022292043,0.02241196,0.0024924532,0.96339214,0.010311439,0.000024851133],"about_ca_topic_score_codex":0.001452275,"about_ca_topic_score_gemma":0.0018602401,"teacher_disagreement_score":0.013977093,"about_ca_system_score_codex":0.002474261,"about_ca_system_score_gemma":0.0009512949,"threshold_uncertainty_score":0.046757996},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055132266,0.047715954,0.33799905,0.17432176,0.049881987,0.00017428731,0.0030185813,0.0011275657,0.33062863],"genre_scores_gemma":[0.6344471,0.027569637,0.17134896,0.02568778,0.05558615,0.0005818291,0.0016508442,0.0015373441,0.08159037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970914,0.001041201,0.0002075419,0.00077068893,0.0007163983,0.00017278804],"domain_scores_gemma":[0.97128916,0.02405595,0.00071535935,0.0020699294,0.000974134,0.000895475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003087362,0.0016523713,0.0030485278,0.0034267611,0.0033742208,0.0054068975,0.003697656,0.0034955118,0.013178596],"category_scores_gemma":[0.016666453,0.0008890125,0.0019516486,0.005352486,0.008769558,0.021305043,0.004463387,0.015507906,0.001862672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006943317,0.000037667305,0.0005086515,0.00021635661,0.000018914912,0.00020317496,0.0002685106,0.0008530996,0.001078641,0.94640905,0.033066705,0.01726975],"study_design_scores_gemma":[0.00001187804,0.000028670785,0.00047213482,0.000051792063,0.000026686064,0.00022532811,0.00009953824,0.003016128,0.0004920274,0.9470873,0.048446264,0.000042228134],"about_ca_topic_score_codex":0.0020237041,"about_ca_topic_score_gemma":0.0020961722,"teacher_disagreement_score":0.013178596,"about_ca_system_score_codex":0.0032387297,"about_ca_system_score_gemma":0.0008730727,"threshold_uncertainty_score":0.044086754},"labels":[],"label_agreement":null},{"id":"W3141989380","doi":"","title":"On (a, d)-Antimagic Labelings of Generalized Petersen Graphs P(n, 3).","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.01564480844889474,"score_gpt":0.22455993650482572,"score_spread":0.208915128055931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3141989380","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62382305,0.0017666051,0.17812277,0.004095464,0.00035122837,0.00017335785,0.0018913057,0.00070792256,0.18906839],"genre_scores_gemma":[0.9062314,0.0014600592,0.06495828,0.0009396979,0.00023436414,0.0001745594,0.0017067852,0.00020533218,0.02408959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990024,0.00033114207,0.000057980647,0.00021275878,0.00017946935,0.00021624984],"domain_scores_gemma":[0.9962191,0.0023056655,0.0004729856,0.00042265697,0.00020270293,0.00037682342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076501485,0.0006015985,0.0005877729,0.0017797651,0.0026525902,0.0034795352,0.0010139357,0.002038759,0.007469405],"category_scores_gemma":[0.0041216114,0.00067111314,0.00079050224,0.0023673128,0.002403626,0.0053632553,0.0027578021,0.0021589787,0.001335963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001304423,0.00006080343,0.00085866265,0.000115817464,0.000018887433,0.00014271546,0.00042723684,0.005007666,0.001846016,0.9637091,0.0078307865,0.01985191],"study_design_scores_gemma":[0.000024595172,0.00001882412,0.0004912378,0.000037655616,0.000013561724,0.00016296457,0.00026409916,0.010067944,0.00088685955,0.9819933,0.0060236207,0.0000153005],"about_ca_topic_score_codex":0.0018283885,"about_ca_topic_score_gemma":0.002936046,"teacher_disagreement_score":0.007469405,"about_ca_system_score_codex":0.0018085092,"about_ca_system_score_gemma":0.0007197462,"threshold_uncertainty_score":0.024987698},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26098153,0.0016906465,0.5973394,0.0045246333,0.0003336909,0.0000793303,0.00041595372,0.00022283728,0.13441205],"genre_scores_gemma":[0.87769973,0.001202722,0.09132648,0.0010694405,0.00039107335,0.0001418373,0.00032372537,0.00015412012,0.027690839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925464,0.0003256719,0.00002371634,0.00015791552,0.00012477238,0.00011329549],"domain_scores_gemma":[0.9975139,0.0014839364,0.00022289986,0.0002993559,0.00022648994,0.0002534891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012745745,0.000528457,0.0008229696,0.0014831172,0.002287259,0.0025396876,0.0017993443,0.0016533894,0.0065247337],"category_scores_gemma":[0.0037644408,0.0006263876,0.0011060148,0.0016608349,0.0035304101,0.0048462353,0.0024087285,0.0030423542,0.00033419605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051951724,0.000006189905,0.000054315882,0.000013157951,0.000003308431,0.000012754778,0.00003812881,0.0017507408,0.000111700814,0.99664223,0.00049305585,0.0008693247],"study_design_scores_gemma":[0.000004712555,0.0000022054592,0.000054455162,0.0000057850716,0.0000031928764,0.000020233923,0.000023516866,0.010144024,0.00007500642,0.9883831,0.0012796085,0.0000040470863],"about_ca_topic_score_codex":0.0029743707,"about_ca_topic_score_gemma":0.0033444276,"teacher_disagreement_score":0.0065247337,"about_ca_system_score_codex":0.001755271,"about_ca_system_score_gemma":0.0010815555,"threshold_uncertainty_score":0.02182746},"labels":[],"label_agreement":null},{"id":"W3149348444","doi":"","title":"On (a, d)-Antimagic Labelings of Generalized Petersen Graphs P(n, 2).","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Petersen graph; Discrete mathematics; Graph; Line graph; Voltage graph","score_opus":0.010177966502979077,"score_gpt":0.23125126471741325,"score_spread":0.22107329821443417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3149348444","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6234416,0.001783775,0.18128616,0.0041162856,0.00035229127,0.00018033854,0.0019385597,0.0007115017,0.18618947],"genre_scores_gemma":[0.9036883,0.001410841,0.06663361,0.0009275594,0.00023844188,0.00018291667,0.0017141458,0.00020348695,0.025000768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989792,0.000343719,0.000058614034,0.00021619431,0.00018293415,0.0002194473],"domain_scores_gemma":[0.99610317,0.00238364,0.00047425795,0.00044888095,0.00020627906,0.00038385854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077882595,0.0006071465,0.00060604623,0.0017654343,0.0026410576,0.0035138654,0.0010310011,0.0020558683,0.007624334],"category_scores_gemma":[0.0043486124,0.00068195997,0.00077448454,0.00236345,0.0023609665,0.005450991,0.0027624879,0.0021275876,0.0013187482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013816264,0.00006500321,0.0008414684,0.00011797329,0.000019575698,0.0001446589,0.00042881176,0.0053369314,0.0018351371,0.9625268,0.008217114,0.020328252],"study_design_scores_gemma":[0.000026108113,0.000019759624,0.0004768109,0.00003699461,0.000013457209,0.00016244131,0.0002565893,0.0108685205,0.00085368985,0.9813658,0.0059043886,0.000015317695],"about_ca_topic_score_codex":0.0017173437,"about_ca_topic_score_gemma":0.002775828,"teacher_disagreement_score":0.007624334,"about_ca_system_score_codex":0.0018016986,"about_ca_system_score_gemma":0.0007170475,"threshold_uncertainty_score":0.0255059},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4050624,0.00012251102,0.5675877,0.00030375048,0.000052434578,0.000059129965,0.00013975953,0.00025729873,0.026414959],"genre_scores_gemma":[0.84106296,0.00020844952,0.1488531,0.00013217171,0.00004025178,0.000100267105,0.00032013952,0.0001976968,0.009085124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996965,0.00008174401,0.00001196623,0.00006272709,0.00007217647,0.00007498198],"domain_scores_gemma":[0.9992005,0.00030681444,0.00007050885,0.00021675818,0.00010979167,0.000095559095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005847104,0.00040993604,0.00030456044,0.0009808232,0.00089989946,0.0009053076,0.000679519,0.0004593234,0.0028138233],"category_scores_gemma":[0.0021393,0.00024194799,0.0005487386,0.0009956027,0.0010225883,0.0022474302,0.0012615216,0.0009666801,0.00035581933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000710607,0.0000538694,0.0010622599,0.000056766912,0.000010413056,0.000105846106,0.00025027944,0.013268571,0.0134830745,0.933129,0.0011321341,0.037376713],"study_design_scores_gemma":[0.000032142885,0.00013258947,0.0018614891,0.000033499517,0.000046586763,0.00054944126,0.00037710293,0.16535927,0.026966812,0.7902285,0.014367986,0.0000445621],"about_ca_topic_score_codex":0.0009625096,"about_ca_topic_score_gemma":0.0014921246,"teacher_disagreement_score":0.0028138233,"about_ca_system_score_codex":0.0006706038,"about_ca_system_score_gemma":0.0006067244,"threshold_uncertainty_score":0.009413123},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57562464,0.00095432205,0.32292232,0.0019516158,0.00016481754,0.000072474744,0.00047903726,0.00045821964,0.09737256],"genre_scores_gemma":[0.94708794,0.00043186662,0.046049893,0.0002656771,0.00014161393,0.000063581305,0.0003034869,0.00006684419,0.0055890814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992137,0.00014945054,0.000047627163,0.0002543396,0.00021483844,0.00011993204],"domain_scores_gemma":[0.9974234,0.0015079131,0.0002374812,0.00037464185,0.00024627204,0.0002103393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057314197,0.00032459362,0.00042917227,0.0008840153,0.0012087771,0.0010029939,0.0006156614,0.00070354424,0.0056746765],"category_scores_gemma":[0.002350208,0.00035077636,0.000503606,0.0010168871,0.0027425273,0.0029089928,0.001656798,0.0017175374,0.0004729622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001228234,0.00003877081,0.0018371253,0.00009332726,0.00001353977,0.00024678741,0.0007753574,0.002672804,0.006581566,0.9690907,0.0015150945,0.017012183],"study_design_scores_gemma":[0.0000353343,0.0001321221,0.0013533975,0.000023238701,0.000036054542,0.000642918,0.00034162903,0.0112171015,0.0065528685,0.9674544,0.01218196,0.000028933391],"about_ca_topic_score_codex":0.0009320941,"about_ca_topic_score_gemma":0.001113322,"teacher_disagreement_score":0.0056746765,"about_ca_system_score_codex":0.00053904275,"about_ca_system_score_gemma":0.0003789425,"threshold_uncertainty_score":0.018983722},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3093276,0.009159077,0.6184725,0.006782968,0.00079705426,0.00024800515,0.0036368868,0.0016080261,0.049967844],"genre_scores_gemma":[0.8392875,0.003752575,0.140817,0.0012085835,0.0018500783,0.00058379443,0.0028293997,0.0013834375,0.008287626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99178654,0.0020340385,0.0005572165,0.002302241,0.0017694412,0.0015504726],"domain_scores_gemma":[0.86220396,0.11267165,0.0055647152,0.009802458,0.005150136,0.0046070935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008124912,0.0037466236,0.0036030072,0.00602125,0.0028672048,0.00952026,0.009410824,0.0035675382,0.011063429],"category_scores_gemma":[0.059341975,0.0022294002,0.0035298935,0.0066608116,0.0061381035,0.016193815,0.0049190014,0.009012065,0.00118608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028773225,0.0012629239,0.0145552335,0.0017900066,0.000577187,0.00043503114,0.0012792606,0.29533708,0.024436899,0.57132155,0.015044146,0.0710834],"study_design_scores_gemma":[0.00012053391,0.00018964833,0.003396359,0.00015398022,0.00022480097,0.00045643986,0.000268315,0.48820361,0.005983823,0.49763322,0.0032531493,0.0001161744],"about_ca_topic_score_codex":0.0021924723,"about_ca_topic_score_gemma":0.00367287,"teacher_disagreement_score":0.011063429,"about_ca_system_score_codex":0.0073233224,"about_ca_system_score_gemma":0.0022548824,"threshold_uncertainty_score":0.05313468},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39450616,0.0132493125,0.49425054,0.008516044,0.0012315463,0.00025640358,0.0058809672,0.0035372463,0.078571774],"genre_scores_gemma":[0.8479874,0.0045540463,0.13002814,0.0013416326,0.001265332,0.0003579477,0.0035359387,0.0016087972,0.009320693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9919778,0.0018404474,0.00045219337,0.002127422,0.001682427,0.0019197272],"domain_scores_gemma":[0.8896797,0.08567567,0.0033987348,0.012659978,0.0039914763,0.0045945165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005895558,0.0038385156,0.0037069132,0.0042148675,0.003335163,0.009244972,0.008807278,0.0031844596,0.012075091],"category_scores_gemma":[0.043201648,0.0023231127,0.002993899,0.0054119825,0.0042342907,0.014885156,0.005635863,0.006555555,0.0017186276],"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.0046784854,0.0013592321,0.018049976,0.0020602117,0.000710298,0.00048292635,0.00084541005,0.48443276,0.03874558,0.30218437,0.024918409,0.12153234],"study_design_scores_gemma":[0.00016873103,0.00022092237,0.0051682116,0.00016194192,0.00028268504,0.0005877904,0.0002713964,0.63302577,0.009291183,0.34499404,0.0056995084,0.00012784933],"about_ca_topic_score_codex":0.0029372524,"about_ca_topic_score_gemma":0.006909271,"teacher_disagreement_score":0.012075091,"about_ca_system_score_codex":0.007150395,"about_ca_system_score_gemma":0.0026950638,"threshold_uncertainty_score":0.051880002},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31714085,0.0068177185,0.2276645,0.08468646,0.0014893574,0.0001601462,0.004881853,0.0025589813,0.35460007],"genre_scores_gemma":[0.86779857,0.0044829366,0.06436137,0.0076975334,0.0018090146,0.000200546,0.0036754853,0.00082205667,0.049152456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816614,0.00042371955,0.00004150765,0.00042833987,0.0005718237,0.00036845656],"domain_scores_gemma":[0.98279816,0.010308793,0.0007908116,0.0032636742,0.0014047326,0.0014338265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028894204,0.00086316606,0.0018640814,0.0020113576,0.0043703774,0.0077616055,0.0029347148,0.0034872747,0.012114445],"category_scores_gemma":[0.014749083,0.0009816496,0.001087689,0.0038584543,0.007931962,0.011892129,0.0036063676,0.009446752,0.0024626593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093027425,0.00004428123,0.0005876756,0.00007940911,0.000010402677,0.000036569367,0.00028846945,0.0039151036,0.00035918527,0.96693945,0.019605214,0.0080412],"study_design_scores_gemma":[0.000016077129,0.0000032200226,0.00017007324,0.000016471216,0.000005909039,0.000018470248,0.00006795217,0.0055140057,0.0001344959,0.98985696,0.004189687,0.0000066464863],"about_ca_topic_score_codex":0.035960898,"about_ca_topic_score_gemma":0.0395905,"teacher_disagreement_score":0.035960898,"about_ca_system_score_codex":0.007216132,"about_ca_system_score_gemma":0.0049118483,"threshold_uncertainty_score":0.07150322},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.608549,0.007086399,0.18904568,0.010002607,0.0011563927,0.00010019515,0.0013558421,0.0004938598,0.18221007],"genre_scores_gemma":[0.95538574,0.001538169,0.021356447,0.0007481539,0.0007231139,0.00006238746,0.0005373104,0.00012131274,0.019527229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990545,0.00020534756,0.000037671834,0.00029921235,0.00017737655,0.00022603253],"domain_scores_gemma":[0.9948738,0.0030110448,0.0005827078,0.00039896707,0.00027302426,0.00086045824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086459634,0.00079221633,0.0009299239,0.0014615594,0.0024324954,0.0027700868,0.0013562435,0.00132916,0.014612483],"category_scores_gemma":[0.0060132556,0.0005245418,0.0010185693,0.0017535532,0.0036756422,0.0061523737,0.0025956477,0.003320267,0.000944908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011554527,0.000048129103,0.0020193884,0.00013894607,0.000025835488,0.0001264185,0.00046280213,0.0035967147,0.0008795592,0.9734196,0.00795651,0.011210567],"study_design_scores_gemma":[0.000014112099,0.000014055191,0.00090103305,0.000028737795,0.000012201723,0.00012070656,0.00018038045,0.0067510973,0.0003214623,0.98686254,0.004778314,0.00001535389],"about_ca_topic_score_codex":0.0032678174,"about_ca_topic_score_gemma":0.0030611763,"teacher_disagreement_score":0.014612483,"about_ca_system_score_codex":0.0016232746,"about_ca_system_score_gemma":0.0006445776,"threshold_uncertainty_score":0.048883677},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13508454,0.0048359507,0.43197072,0.033640295,0.002908889,0.00036025388,0.002718259,0.0020304318,0.38645074],"genre_scores_gemma":[0.7195402,0.0071924296,0.14145975,0.012174642,0.0045367535,0.0006275099,0.005313475,0.0015698957,0.1075853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812955,0.0004559039,0.00008794007,0.0005418642,0.00039403772,0.00039068135],"domain_scores_gemma":[0.98562104,0.009252193,0.00059690233,0.0021540353,0.0009782058,0.0013977011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027532657,0.002478777,0.0027594995,0.0031037736,0.0041277027,0.005315343,0.0037586654,0.0024521332,0.0341123],"category_scores_gemma":[0.013616077,0.00122641,0.0035771176,0.006822766,0.0053964476,0.016832616,0.0072449045,0.013126669,0.0038346925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033485907,0.00030714422,0.0014131424,0.00050528615,0.00004111669,0.00016656071,0.0005743427,0.006672259,0.0017560964,0.9163563,0.031846102,0.04002663],"study_design_scores_gemma":[0.000040313153,0.000029205245,0.00035312024,0.000041859246,0.000038720893,0.00014635499,0.00012379867,0.00854008,0.0006865577,0.980015,0.009965202,0.00001978017],"about_ca_topic_score_codex":0.0030597346,"about_ca_topic_score_gemma":0.0034524768,"teacher_disagreement_score":0.0341123,"about_ca_system_score_codex":0.003199457,"about_ca_system_score_gemma":0.00235801,"threshold_uncertainty_score":0.11411703},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32729545,0.0025472415,0.5251175,0.012790558,0.00052833103,0.00008682578,0.0009693633,0.0005169809,0.13014778],"genre_scores_gemma":[0.8577595,0.002254523,0.09951796,0.0016283117,0.0009094604,0.00025296904,0.0012257225,0.00042183365,0.036029864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998705,0.00057597196,0.00004974746,0.0002895277,0.00020121706,0.00017843443],"domain_scores_gemma":[0.9932928,0.004600204,0.00043818998,0.00072668487,0.00041483017,0.00052727223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023290706,0.0010257341,0.0013494934,0.0021752827,0.0027518298,0.0041145147,0.0018953606,0.0019525989,0.008613821],"category_scores_gemma":[0.009270781,0.0007858284,0.0013065216,0.0031189362,0.00528668,0.009393295,0.004240753,0.0054154866,0.0009528533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027829115,0.000014691117,0.00020867996,0.000039461065,0.0000035938876,0.000014542854,0.0001482097,0.0015524062,0.00015997133,0.9930906,0.0013151306,0.00342486],"study_design_scores_gemma":[0.000007333914,0.0000033762378,0.00006841702,0.000006955726,0.0000035992482,0.000014295979,0.00003295319,0.0044307397,0.00008487663,0.99438226,0.0009610196,0.0000040734994],"about_ca_topic_score_codex":0.0026001043,"about_ca_topic_score_gemma":0.0024759928,"teacher_disagreement_score":0.008613821,"about_ca_system_score_codex":0.0029973611,"about_ca_system_score_gemma":0.0013372622,"threshold_uncertainty_score":0.028816104},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7619226,0.0008232601,0.19933017,0.0020448074,0.000095020856,0.00015547783,0.00042166168,0.00028572502,0.03492134],"genre_scores_gemma":[0.9677205,0.00050936686,0.023575846,0.00026183474,0.00004910439,0.00013511328,0.00025908358,0.000065788125,0.007423322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991416,0.00036556376,0.000027628499,0.00015791573,0.00011705781,0.00019016526],"domain_scores_gemma":[0.9937429,0.004212505,0.00085446937,0.00028598792,0.0002508573,0.000653259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073659496,0.0009802287,0.0009632807,0.000990187,0.0011514379,0.0019074298,0.0010723405,0.0012173807,0.0038416951],"category_scores_gemma":[0.0065478175,0.0004463507,0.00053776184,0.0010580311,0.0021595757,0.0029697262,0.0020073347,0.0012885083,0.0004925597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006455744,0.00015345462,0.002632875,0.00026967516,0.000098979726,0.0005101562,0.000687296,0.3164716,0.010545662,0.63917524,0.0055740727,0.023235463],"study_design_scores_gemma":[0.000082127524,0.00011861843,0.00058208517,0.000033197906,0.00001907341,0.00016512557,0.000291954,0.7250095,0.0020930879,0.26873004,0.0028420843,0.000033099146],"about_ca_topic_score_codex":0.0019835634,"about_ca_topic_score_gemma":0.0016506024,"teacher_disagreement_score":0.0038416951,"about_ca_system_score_codex":0.0019542389,"about_ca_system_score_gemma":0.0006541184,"threshold_uncertainty_score":0.0141791105},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1349722,0.00055043446,0.82029176,0.0012266601,0.000098232056,0.00007448517,0.00043160398,0.0014312137,0.040923383],"genre_scores_gemma":[0.6639266,0.0008098314,0.32214212,0.000374185,0.000089364934,0.0001241218,0.00068941404,0.00026670893,0.011577698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995598,0.00010719211,0.000016142092,0.00011183802,0.00012404866,0.00008101353],"domain_scores_gemma":[0.99822515,0.0008144338,0.0002270404,0.0004613103,0.00018254886,0.00008956115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032672784,0.00031381205,0.0002880539,0.00052514917,0.0010027182,0.0010646482,0.00083015306,0.0005412063,0.005771394],"category_scores_gemma":[0.003220163,0.00023343903,0.00030977506,0.0010313115,0.0011246143,0.0023261218,0.0014879671,0.0010361859,0.0010740606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011748351,0.000053387517,0.00074400153,0.00020853298,0.00001128561,0.000096827134,0.00027321102,0.043450776,0.018073946,0.82518065,0.0065676165,0.10522225],"study_design_scores_gemma":[0.000018512643,0.00008240071,0.0005746249,0.00003396797,0.000022123624,0.0002450578,0.0001453022,0.12142704,0.009774224,0.8412416,0.026403671,0.00003145187],"about_ca_topic_score_codex":0.0016710168,"about_ca_topic_score_gemma":0.0018846393,"teacher_disagreement_score":0.005771394,"about_ca_system_score_codex":0.0009083876,"about_ca_system_score_gemma":0.00063301256,"threshold_uncertainty_score":0.019307256},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03331116,0.011884161,0.7040506,0.095277086,0.004302223,0.000228016,0.0012356606,0.0018709779,0.14784005],"genre_scores_gemma":[0.5992469,0.007610947,0.29767576,0.037089348,0.004742938,0.0011497377,0.0020044134,0.003114555,0.047365416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9926674,0.003590135,0.00026934437,0.001578296,0.0012153316,0.00067961594],"domain_scores_gemma":[0.9489013,0.041893546,0.0011420135,0.0035995517,0.0030612375,0.0014024071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014134621,0.001986558,0.0026796511,0.0018018606,0.0037773454,0.0051959204,0.0032740033,0.006116331,0.013507486],"category_scores_gemma":[0.08342011,0.0012472378,0.0021386163,0.0018939981,0.010278513,0.018156363,0.007167568,0.017273638,0.004772028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030665536,0.000058186553,0.001100085,0.00020854862,0.00007105436,0.00008456813,0.00025145474,0.01082082,0.00040645234,0.93423444,0.038686745,0.013771043],"study_design_scores_gemma":[0.000081996564,0.000048938527,0.0003994254,0.00017400904,0.00003016862,0.00010151057,0.00007010134,0.05835719,0.0007382446,0.92544556,0.014510521,0.00004219698],"about_ca_topic_score_codex":0.0034467948,"about_ca_topic_score_gemma":0.0025496644,"teacher_disagreement_score":0.014134621,"about_ca_system_score_codex":0.0034339144,"about_ca_system_score_gemma":0.0027340776,"threshold_uncertainty_score":0.07475191},"labels":[],"label_agreement":null},{"id":"W327581366","doi":"","title":"Erratum: a little emendation to the graceful labelling of the Generalized Petersen Graph P8t, 3 when t = 5.","year":2007,"lang":"en","type":"erratum","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Labelling; Mathematics; Graph; Combinatorics; Chemistry; Biochemistry","score_opus":0.017010267011709417,"score_gpt":0.2417993118362034,"score_spread":0.224789044824494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W327581366","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043313325,0.0020374686,0.0020050497,0.108902305,0.8689964,0.00002791356,0.0007091796,0.00045623118,0.016432324],"genre_scores_gemma":[0.024961788,0.015339621,0.014813693,0.2752327,0.31507242,0.0002072199,0.0040405635,0.0026251182,0.34770688],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99776244,0.0003673337,0.0002968032,0.00035297702,0.0009743206,0.0002461132],"domain_scores_gemma":[0.9930339,0.0022014496,0.00048523294,0.0007683122,0.002996834,0.0005142915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019396603,0.0018059355,0.0012163144,0.0027028401,0.0043121874,0.0026543026,0.003958429,0.005699421,0.03555329],"category_scores_gemma":[0.024883334,0.001095716,0.0012880554,0.002526494,0.003702791,0.0043349336,0.0017507251,0.009624131,0.02561044],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025565008,0.0000071021873,0.00002429294,0.000057216912,0.000004803101,0.00012978105,0.000019959232,0.000047673257,0.000044794662,0.0027446314,0.9926804,0.0042137555],"study_design_scores_gemma":[0.000025198753,0.000031774834,0.00043731445,0.00019050435,0.000025322432,0.0005655387,0.00009577863,0.0002914323,0.0004261753,0.011232459,0.98663425,0.00004435672],"about_ca_topic_score_codex":0.0077392426,"about_ca_topic_score_gemma":0.010777097,"teacher_disagreement_score":0.03555329,"about_ca_system_score_codex":0.003692541,"about_ca_system_score_gemma":0.0021081453,"threshold_uncertainty_score":0.11893767},"labels":[],"label_agreement":null},{"id":"W34358114","doi":"10.3390/ph14070688","title":"Face antimagic labelings of plane graphs Pba.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Narodowe Centrum Nauki","keywords":"Mathematics; Combinatorics; Plane (geometry); Geometry","score_opus":0.007376999723166518,"score_gpt":0.20877792333908377,"score_spread":0.20140092361591724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34358114","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84902644,0.01109449,0.06347924,0.00068874867,0.00042993188,0.00025589863,0.0010949136,0.000734962,0.073195405],"genre_scores_gemma":[0.937785,0.004078004,0.030023012,0.00034110114,0.000057729863,0.0001441349,0.0010820588,0.00010565197,0.026383277],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998988,0.000018186596,0.0000043684645,0.000030412004,0.000025323117,0.000022961702],"domain_scores_gemma":[0.99994576,0.000008410959,0.000015515303,0.000008771222,0.000012650969,0.000008893509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010051884,0.00036473747,0.00012601484,0.00031234353,0.00019580273,0.00022565956,0.00022618838,0.00036622718,0.006376666],"category_scores_gemma":[0.00012918573,0.00013335476,0.00016643966,0.00024053207,0.00014455068,0.00022311133,0.00025934906,0.0004464424,0.0020763157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011856526,0.00002019185,0.00014307498,0.00010885889,0.000009853436,0.00009443665,0.000023905575,0.00018024658,0.98631835,0.0016912903,0.0004554747,0.010835727],"study_design_scores_gemma":[0.0000117347545,0.00022206947,0.0005726346,0.0000115641005,0.000013816321,0.00018999483,0.000018985651,0.0010247492,0.9733193,0.00021949317,0.02438973,0.0000059042077],"about_ca_topic_score_codex":0.00053994695,"about_ca_topic_score_gemma":0.0008521662,"teacher_disagreement_score":0.006376666,"about_ca_system_score_codex":0.00025326211,"about_ca_system_score_gemma":0.00016995714,"threshold_uncertainty_score":0.021332026},"labels":[],"label_agreement":null},{"id":"W35311340","doi":"","title":"The Connectivity of Matching Transformation Graphs of Cubic Bipartite Plane Graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Matching (statistics); Transformation (genetics); Combinatorics; Plane (geometry); Graph; Geometry; Statistics; Chemistry","score_opus":0.01160662076294117,"score_gpt":0.22591766938675548,"score_spread":0.2143110486238143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35311340","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8318694,0.0011415455,0.06656927,0.0029406373,0.000100352154,0.00012254852,0.002169114,0.00038037708,0.09470679],"genre_scores_gemma":[0.98259485,0.0005356086,0.009877952,0.0001835718,0.0000822254,0.00007898999,0.0012303689,0.00008228721,0.0053340886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943143,0.00018774091,0.000025371337,0.00013279439,0.00009537695,0.0001272512],"domain_scores_gemma":[0.99511284,0.0030808947,0.00083438086,0.0003932115,0.00023200696,0.00034664874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041944894,0.00036592354,0.00045904596,0.0016615828,0.0014728205,0.0025040812,0.0011297663,0.0015189514,0.010039054],"category_scores_gemma":[0.006697697,0.00052870205,0.0004235705,0.0018458422,0.001762108,0.004114845,0.0013671448,0.0014500017,0.0008208714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003623288,0.00011268826,0.0047760247,0.0002432266,0.00003257273,0.00030085188,0.0007513465,0.020331066,0.00443323,0.91815233,0.013865178,0.036639035],"study_design_scores_gemma":[0.00007722088,0.000049196773,0.0042334786,0.00006921455,0.000042670727,0.00046165986,0.000728354,0.06613015,0.0029294707,0.9159755,0.009274857,0.000028154609],"about_ca_topic_score_codex":0.0031766032,"about_ca_topic_score_gemma":0.0029410603,"teacher_disagreement_score":0.010039054,"about_ca_system_score_codex":0.0011828993,"about_ca_system_score_gemma":0.00047940938,"threshold_uncertainty_score":0.033584},"labels":[],"label_agreement":null},{"id":"W36900608","doi":"10.3390/foods12051090","title":"Total Coloring of Series-Parallel Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Series (stratigraphy); Complete coloring; Fractional coloring; Greedy coloring; Brooks' theorem; Edge coloring; Total coloring; Graph coloring; Series and parallel circuits; Combinatorics; Chordal graph; Graph; 1-planar graph; Physics","score_opus":0.010598490676317253,"score_gpt":0.21465824861470736,"score_spread":0.20405975793839012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W36900608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1937303,0.0017823651,0.646603,0.0011121795,0.0007206926,0.00047858682,0.0044260398,0.0046855663,0.14646135],"genre_scores_gemma":[0.7391678,0.002134601,0.18637726,0.00054896687,0.00021715775,0.00042422206,0.0055012875,0.0010387114,0.06459004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933213,0.00013871517,0.00003516171,0.00023009033,0.00015912073,0.00010476264],"domain_scores_gemma":[0.9987016,0.0003115522,0.00019006612,0.000403738,0.00025599665,0.0001370986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005303536,0.00088973105,0.00043886417,0.0014014263,0.000905186,0.0013404755,0.0006641795,0.00035418235,0.01840572],"category_scores_gemma":[0.0018001753,0.0004190169,0.0009243235,0.0016031448,0.0009758831,0.0016122322,0.0010809153,0.0009424431,0.002525935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035219343,0.00016788127,0.0024076179,0.0011023735,0.00019874756,0.0005028901,0.0007312316,0.034989852,0.037078388,0.67335516,0.030411001,0.21870273],"study_design_scores_gemma":[0.000056380264,0.00022415048,0.002869107,0.00009761166,0.000102435835,0.0009606873,0.0002920283,0.06142487,0.018191114,0.8126173,0.1031099,0.00005434342],"about_ca_topic_score_codex":0.0017252071,"about_ca_topic_score_gemma":0.0021971182,"teacher_disagreement_score":0.01840572,"about_ca_system_score_codex":0.0009883107,"about_ca_system_score_gemma":0.0007105071,"threshold_uncertainty_score":0.061573207},"labels":[],"label_agreement":null},{"id":"W38963144","doi":"10.2478/aiht-2024-75-3819","title":"An Introduction to Maximum Sum Permutations of Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.008935909092831627,"score_gpt":0.23754806125519673,"score_spread":0.2286121521623651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W38963144","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015530654,0.011364892,0.9335806,0.0034557767,0.0028109578,0.00033081745,0.0051940894,0.00756799,0.034141865],"genre_scores_gemma":[0.049751308,0.021004332,0.8671991,0.0062531494,0.006824861,0.0023073107,0.015429785,0.006288583,0.024941467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950429,0.0019458883,0.0005014512,0.0011102256,0.0011353558,0.00026410437],"domain_scores_gemma":[0.98714846,0.009039777,0.00054618774,0.001997792,0.0009199001,0.00034799022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005209961,0.002726665,0.0022383982,0.0049827755,0.001651699,0.0051429747,0.0039711287,0.0029147868,0.045239244],"category_scores_gemma":[0.018423947,0.0020227192,0.0047262604,0.0062820683,0.0028052602,0.008532745,0.0044615907,0.007119042,0.018842826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001411443,0.0001416289,0.0011549431,0.002071342,0.00034186043,0.0006225892,0.0005214061,0.013971754,0.0017711391,0.59230906,0.14192995,0.24502325],"study_design_scores_gemma":[0.000035560523,0.000044497607,0.00030353025,0.00026365105,0.000047144465,0.00048672687,0.00007842682,0.02083426,0.00039784805,0.7933042,0.18415692,0.00004722515],"about_ca_topic_score_codex":0.0021343566,"about_ca_topic_score_gemma":0.0027705743,"teacher_disagreement_score":0.045239244,"about_ca_system_score_codex":0.0021419616,"about_ca_system_score_gemma":0.0020470386,"threshold_uncertainty_score":0.1513403},"labels":[],"label_agreement":null},{"id":"W41547039","doi":"","title":"On Skolem-Graceful and Cordial Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.00593498906881944,"score_gpt":0.2024602084891991,"score_spread":0.19652521942037965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W41547039","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.415452,0.0026887543,0.23488544,0.0072688754,0.0006365016,0.00015093136,0.001935532,0.0023186537,0.3346633],"genre_scores_gemma":[0.8929506,0.0013245034,0.045125976,0.0011206331,0.00036620288,0.000119193144,0.0013455242,0.00047466747,0.05717277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991443,0.00022401386,0.000045331755,0.00018402222,0.00018062872,0.00022160068],"domain_scores_gemma":[0.99718827,0.0013168226,0.00035026335,0.0006021797,0.0002003604,0.00034208258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008506933,0.00068929716,0.0006635686,0.0019145418,0.0026469762,0.0030075768,0.0013346793,0.0012076964,0.014013671],"category_scores_gemma":[0.0041531087,0.0004750041,0.0007673228,0.0023820978,0.0034623477,0.007818567,0.0032687976,0.002611075,0.0021562204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004526987,0.00002377891,0.00024720555,0.000050136758,0.000004892952,0.00004926874,0.00018289626,0.001036372,0.0005068986,0.9846503,0.0041672774,0.00903564],"study_design_scores_gemma":[0.000009415036,0.000007070371,0.00016506776,0.00001817307,0.000006301924,0.000069563655,0.000091156035,0.002274516,0.00048115218,0.9899615,0.0069069457,0.000009102308],"about_ca_topic_score_codex":0.0021948456,"about_ca_topic_score_gemma":0.0035664367,"teacher_disagreement_score":0.014013671,"about_ca_system_score_codex":0.0023825103,"about_ca_system_score_gemma":0.00073366304,"threshold_uncertainty_score":0.046880424},"labels":[],"label_agreement":null},{"id":"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14543794,0.00052049157,0.78411734,0.0020938755,0.00017035553,0.0001860857,0.000784716,0.0015484673,0.06514079],"genre_scores_gemma":[0.77779603,0.0005948757,0.19779235,0.00092208403,0.00013528066,0.00019619631,0.0013243144,0.0004958588,0.020743057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897254,0.0002250633,0.000051994666,0.00030246406,0.00023708185,0.00021082537],"domain_scores_gemma":[0.9953864,0.001962934,0.0004959472,0.0013609196,0.0005063587,0.0002874623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010850991,0.00043128047,0.00048519394,0.00067991286,0.0016168761,0.0023107238,0.0019765622,0.001246562,0.014005181],"category_scores_gemma":[0.0043240804,0.00036519847,0.00056049676,0.0012574064,0.0026463165,0.0054302616,0.00339027,0.0014663725,0.0021950712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036710087,0.000108114014,0.0015244028,0.00029923004,0.000022848686,0.00015950963,0.0004670735,0.03597418,0.01912031,0.85809064,0.011394352,0.0724723],"study_design_scores_gemma":[0.00008817437,0.00025076413,0.0010374365,0.00006074758,0.000034714645,0.0005861238,0.0003158828,0.1601249,0.026454028,0.77148306,0.039495714,0.0000683985],"about_ca_topic_score_codex":0.0012546399,"about_ca_topic_score_gemma":0.0016483034,"teacher_disagreement_score":0.014005181,"about_ca_system_score_codex":0.002019921,"about_ca_system_score_gemma":0.0011677436,"threshold_uncertainty_score":0.046851993},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012309394,0.84615,0.054381125,0.006359595,0.0035107827,0.00006522502,0.0013045153,0.0004523474,0.075467005],"genre_scores_gemma":[0.06591883,0.87377536,0.03125606,0.0030263779,0.0052129445,0.00009422648,0.0024540888,0.00037288203,0.0178892],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991986,0.00012406109,0.00006269884,0.00024191987,0.00028961693,0.00008317002],"domain_scores_gemma":[0.9969313,0.0017189666,0.00014034854,0.000293172,0.00073432404,0.00018180216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010822744,0.000964046,0.0012753942,0.0055975,0.0009002708,0.002532907,0.0010541652,0.0011673833,0.007464896],"category_scores_gemma":[0.0034768924,0.0007302187,0.0005727065,0.009961777,0.0018404005,0.006583295,0.0016272647,0.0024427942,0.0027749506],"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.000068937756,0.000102594684,0.0014884599,0.0026122716,0.00005459993,0.00010072342,0.00013769268,0.0071598906,0.0007693519,0.25305146,0.09119359,0.6432605],"study_design_scores_gemma":[0.000012905455,0.00006230659,0.001367803,0.00083879393,0.000046803016,0.0010356522,0.00017480382,0.0053572566,0.0008158432,0.16847269,0.82176036,0.000054744683],"about_ca_topic_score_codex":0.0020185162,"about_ca_topic_score_gemma":0.0018999568,"teacher_disagreement_score":0.007464896,"about_ca_system_score_codex":0.0020944234,"about_ca_system_score_gemma":0.0014691022,"threshold_uncertainty_score":0.024972558},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007446591,0.006778161,0.05302663,0.0026949504,0.0013742031,0.000028634788,0.0005653736,0.00070205034,0.9273834],"genre_scores_gemma":[0.28299552,0.010420834,0.03210067,0.0019372548,0.0029002526,0.00016558394,0.0017294678,0.0011851314,0.6665653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994475,0.00008497128,0.000021449672,0.00011471721,0.0002611291,0.00007021221],"domain_scores_gemma":[0.9996799,0.000080571874,0.000018599041,0.000115600604,0.00006917154,0.000036219742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029187856,0.0010249077,0.0008476885,0.0020652195,0.0016539508,0.0038244238,0.0010654365,0.00062418554,0.039968334],"category_scores_gemma":[0.00090523297,0.0005518487,0.00076559174,0.0026450255,0.002073044,0.0043292856,0.0021764145,0.0034143345,0.014015978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008606851,0.0000123061445,0.000051600196,0.00005418252,0.000005917456,0.000015815482,0.00007128546,0.00026361903,0.00021710039,0.9400803,0.027211273,0.032008067],"study_design_scores_gemma":[0.000004728427,0.0000067647084,0.00014463889,0.00003384736,0.000011011739,0.00012103521,0.000047651058,0.0005658763,0.00038467915,0.8384777,0.16019522,0.000006787695],"about_ca_topic_score_codex":0.000745469,"about_ca_topic_score_gemma":0.00096289435,"teacher_disagreement_score":0.039968334,"about_ca_system_score_codex":0.0017081122,"about_ca_system_score_gemma":0.0007302726,"threshold_uncertainty_score":0.1337074},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1278629,0.0052882973,0.6952292,0.008568705,0.0018499959,0.00035667166,0.002758155,0.003393586,0.15469255],"genre_scores_gemma":[0.7661882,0.0017512873,0.20077752,0.0015650006,0.0015641009,0.00049575197,0.0013655686,0.0010287465,0.025263792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964954,0.0008077029,0.00010972451,0.0009554552,0.0010344292,0.00059728045],"domain_scores_gemma":[0.98482496,0.009247877,0.0005187893,0.0031908462,0.0013142391,0.0009032852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004356492,0.0018507104,0.0013691501,0.0033322258,0.002039211,0.0035507712,0.0044199075,0.0018577741,0.022965983],"category_scores_gemma":[0.017177813,0.0008208542,0.0014053214,0.0025101856,0.003146286,0.008008876,0.0052637756,0.005371918,0.0028590478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015731198,0.00034043868,0.005087152,0.00067908206,0.0001801288,0.00026615968,0.00030624174,0.09917441,0.0170231,0.72171783,0.05345022,0.10020206],"study_design_scores_gemma":[0.000121741075,0.00019267885,0.0024610485,0.00014963046,0.00013435434,0.000280368,0.00009421868,0.47833213,0.0072258506,0.48787433,0.023034792,0.00009883982],"about_ca_topic_score_codex":0.0027276753,"about_ca_topic_score_gemma":0.0046912218,"teacher_disagreement_score":0.022965983,"about_ca_system_score_codex":0.005179644,"about_ca_system_score_gemma":0.0022971074,"threshold_uncertainty_score":0.0768289},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012900567,0.6273901,0.07966013,0.041919585,0.012524218,0.00026841083,0.0035983853,0.0011594153,0.22057922],"genre_scores_gemma":[0.097789474,0.61512226,0.09348508,0.011714839,0.023175247,0.00027382336,0.0081249075,0.0006963268,0.14961809],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99937373,0.00013817764,0.000052135583,0.000093035014,0.0002943522,0.000048545124],"domain_scores_gemma":[0.99766785,0.0008428606,0.00012275687,0.0001934791,0.0009608325,0.00021220118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022641076,0.00084141956,0.00122547,0.0036542383,0.0006842196,0.002469507,0.001148004,0.0009616439,0.05239362],"category_scores_gemma":[0.0021046626,0.00033667617,0.0005223575,0.0063899616,0.0009903093,0.002057443,0.0006752531,0.0012869248,0.01528656],"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.00023086728,0.00016094065,0.00055107847,0.002587731,0.00007817319,0.00030537337,0.000054619974,0.0036332512,0.007604622,0.028682334,0.2042118,0.7518991],"study_design_scores_gemma":[0.000051657204,0.00026031575,0.0011787831,0.0006587794,0.00008553854,0.0005959142,0.000075223164,0.0057092644,0.010152229,0.026486633,0.9547066,0.000039014027],"about_ca_topic_score_codex":0.0016676759,"about_ca_topic_score_gemma":0.0027081887,"teacher_disagreement_score":0.05239362,"about_ca_system_score_codex":0.0013367229,"about_ca_system_score_gemma":0.0012462117,"threshold_uncertainty_score":0.17527413},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6069603,0.00060370425,0.29318452,0.0013028192,0.00017533738,0.000102749684,0.0016096623,0.0006392733,0.0954216],"genre_scores_gemma":[0.8892965,0.00051970116,0.09230606,0.00032911293,0.00013881375,0.0000760005,0.0012631954,0.0001509071,0.015919736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929035,0.00014558427,0.00004530026,0.00025376503,0.00013525231,0.00012975506],"domain_scores_gemma":[0.9979931,0.00076324254,0.00027070215,0.00042931247,0.0003075454,0.0002361498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045652603,0.00037833644,0.0003730377,0.0007403864,0.0009403366,0.0013643593,0.00045057107,0.00054833444,0.0050700186],"category_scores_gemma":[0.0024264213,0.00026985558,0.00028386415,0.0009794865,0.0013067015,0.0018748705,0.0010474374,0.00071681006,0.0005765922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034443996,0.000097613614,0.0059003243,0.00021881696,0.000043564385,0.0005449754,0.00076950726,0.020089226,0.02614226,0.8782048,0.008728409,0.058916077],"study_design_scores_gemma":[0.00006198655,0.00017691111,0.0049884105,0.00006177846,0.000049565082,0.0023150605,0.00069842127,0.08881418,0.011386176,0.8305199,0.060879786,0.000047749716],"about_ca_topic_score_codex":0.00096914324,"about_ca_topic_score_gemma":0.0010298843,"teacher_disagreement_score":0.0050700186,"about_ca_system_score_codex":0.00082848564,"about_ca_system_score_gemma":0.00048912084,"threshold_uncertainty_score":0.016960919},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7125386,0.0002588416,0.27301455,0.00083835295,0.000033862347,0.0000967048,0.0007254088,0.0009281619,0.01156542],"genre_scores_gemma":[0.8884339,0.00021446084,0.10584841,0.00019410247,0.000032599288,0.00014003202,0.0011558068,0.00023936569,0.0037413056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889684,0.00027256602,0.00005351764,0.00041847222,0.00018875289,0.00016987576],"domain_scores_gemma":[0.9931289,0.0035594844,0.0005912257,0.0019722986,0.00035088224,0.00039723745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011598173,0.00044020195,0.0006441462,0.0008074855,0.0011222375,0.0017614102,0.0011067295,0.0007826351,0.004054342],"category_scores_gemma":[0.006564091,0.00057847035,0.00048733657,0.000946603,0.0017469033,0.0038010513,0.002048512,0.0013381444,0.00046022452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060011854,0.00023957365,0.0064986227,0.00023451634,0.000032966094,0.000088570516,0.000918137,0.07279139,0.017796012,0.7927956,0.007559826,0.10044474],"study_design_scores_gemma":[0.0000796928,0.00014548897,0.002611372,0.00004823422,0.00005582614,0.00026223928,0.00038759597,0.2559362,0.021211712,0.71062595,0.008589233,0.000046494282],"about_ca_topic_score_codex":0.0012481676,"about_ca_topic_score_gemma":0.0017071815,"teacher_disagreement_score":0.004054342,"about_ca_system_score_codex":0.0020127706,"about_ca_system_score_gemma":0.0010906549,"threshold_uncertainty_score":0.014603794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5712095,0.0032395166,0.15590812,0.08391666,0.001693239,0.00011478831,0.001798701,0.0030878773,0.17903163],"genre_scores_gemma":[0.9632023,0.00088649796,0.02086077,0.0046711555,0.001050535,0.000115941286,0.0005182521,0.00038107627,0.008313345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970753,0.00081925973,0.00010044277,0.000876535,0.0005679389,0.0005604835],"domain_scores_gemma":[0.9664606,0.026194822,0.001130417,0.0041942527,0.0010393957,0.000980451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033440639,0.0006747568,0.0012588282,0.0015998969,0.0027979307,0.00297487,0.0022000566,0.002914346,0.012186336],"category_scores_gemma":[0.024987362,0.0006253258,0.001055994,0.0021774855,0.0073557775,0.009935593,0.004728477,0.0055203047,0.0010255685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031787262,0.000048826583,0.0016450294,0.00013159787,0.000017156814,0.00017698704,0.0004698711,0.004313686,0.0017741529,0.95752573,0.023003971,0.010575094],"study_design_scores_gemma":[0.00010006198,0.00003864626,0.0010295281,0.000036250553,0.000020583522,0.00032364568,0.00026591032,0.016604511,0.0022001474,0.9651985,0.014144914,0.00003733007],"about_ca_topic_score_codex":0.0019143304,"about_ca_topic_score_gemma":0.0013755634,"teacher_disagreement_score":0.012186336,"about_ca_system_score_codex":0.0027282918,"about_ca_system_score_gemma":0.00073842535,"threshold_uncertainty_score":0.04076737},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8481182,0.0013356276,0.13595319,0.0012413195,0.00008140776,0.0000458231,0.00056717725,0.00033575212,0.012321623],"genre_scores_gemma":[0.8682936,0.0007325915,0.11181012,0.0002083766,0.00011734337,0.00008628388,0.00090117514,0.0002998715,0.017550604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993388,0.00017571134,0.000021018874,0.00027507474,0.00008759853,0.00010182522],"domain_scores_gemma":[0.9945365,0.0034847243,0.0005898316,0.0003816678,0.0004253559,0.0005819142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009991075,0.0007603601,0.0011378343,0.0023894873,0.0022302438,0.0044706482,0.0013463637,0.0017619855,0.004654365],"category_scores_gemma":[0.0049982606,0.0011986871,0.0009881011,0.0019286512,0.0022051015,0.0035175555,0.0019476996,0.0019121697,0.00046411215],"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.0018114683,0.00036151052,0.014101897,0.00066720694,0.00024093728,0.0008480393,0.00225604,0.62902474,0.028710267,0.2552302,0.0059088212,0.06083886],"study_design_scores_gemma":[0.00012698752,0.00019125234,0.01473871,0.00010444234,0.000085366686,0.00043459953,0.0013001005,0.8504379,0.0075748316,0.11808812,0.006859139,0.000058542057],"about_ca_topic_score_codex":0.012381707,"about_ca_topic_score_gemma":0.019960461,"teacher_disagreement_score":0.012381707,"about_ca_system_score_codex":0.0028929655,"about_ca_system_score_gemma":0.00070304086,"threshold_uncertainty_score":0.024619281},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82587606,0.0007659224,0.109076336,0.003147057,0.000272813,0.00010666063,0.001202232,0.0005287937,0.059024155],"genre_scores_gemma":[0.96282333,0.00057325675,0.021457378,0.0005826291,0.00041564676,0.00015417935,0.0015325586,0.00023486999,0.012226229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986846,0.00033029,0.000059203845,0.00041691452,0.00020687084,0.00030217253],"domain_scores_gemma":[0.99352807,0.0034472174,0.0007204657,0.0007123977,0.00046004404,0.0011318286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010353418,0.0007600735,0.0010239766,0.002247198,0.002653823,0.004884175,0.0014767072,0.0013939098,0.0067773573],"category_scores_gemma":[0.0050430642,0.0010575907,0.0011753304,0.002150629,0.0023693847,0.0029804094,0.0017729711,0.0027144447,0.0005072008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019536154,0.00013646983,0.0047199875,0.00016917294,0.000038395192,0.00024304538,0.0008270997,0.0058190324,0.0032678908,0.95854217,0.011802198,0.014239285],"study_design_scores_gemma":[0.00006872285,0.00003597012,0.002751654,0.000031478627,0.000044261815,0.0004523624,0.0003087641,0.031628873,0.0011575503,0.95527434,0.008220611,0.000025374555],"about_ca_topic_score_codex":0.002048791,"about_ca_topic_score_gemma":0.0026081535,"teacher_disagreement_score":0.0067773573,"about_ca_system_score_codex":0.002725575,"about_ca_system_score_gemma":0.0009228508,"threshold_uncertainty_score":0.022672474},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28432652,0.0122161815,0.4501075,0.014617273,0.00087384216,0.00024457066,0.0030295365,0.0012007919,0.23338372],"genre_scores_gemma":[0.8408783,0.004612504,0.12800108,0.0021116755,0.0014951061,0.0007815234,0.0014562997,0.00072637596,0.019937089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977888,0.00063761615,0.000080029655,0.0005845172,0.0004901784,0.00041885217],"domain_scores_gemma":[0.9809862,0.014262771,0.0011250229,0.0013250562,0.0007282856,0.0015726446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035277072,0.0024112999,0.0015069304,0.004893979,0.0022255818,0.0061814873,0.005278464,0.002167228,0.01284912],"category_scores_gemma":[0.016383458,0.0011656693,0.0012959958,0.0044898423,0.004923452,0.010362013,0.0054431097,0.0052004526,0.0014120673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009300676,0.00019116217,0.005659834,0.0006696532,0.00015807191,0.00014746968,0.00047019814,0.04159181,0.0070065428,0.8817743,0.019266944,0.042133953],"study_design_scores_gemma":[0.00010341683,0.00012609993,0.0035939766,0.00023282415,0.00018548468,0.0002888246,0.00020857887,0.14023446,0.0031455718,0.8387644,0.013020151,0.000096199656],"about_ca_topic_score_codex":0.0021904006,"about_ca_topic_score_gemma":0.0041780537,"teacher_disagreement_score":0.01284912,"about_ca_system_score_codex":0.0051583066,"about_ca_system_score_gemma":0.001789821,"threshold_uncertainty_score":0.042984605},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5140071,0.0065462776,0.20066196,0.04189857,0.0013812862,0.00015676903,0.002229053,0.0009143084,0.23220463],"genre_scores_gemma":[0.953689,0.0022232772,0.023668848,0.0038185497,0.0012802219,0.00016849628,0.001533711,0.00017062153,0.0134472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976036,0.0007203887,0.00007812987,0.00065913226,0.00048033815,0.00045848748],"domain_scores_gemma":[0.9872192,0.0086269155,0.0007615833,0.0017936415,0.00092162396,0.0006771182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003068957,0.0008454416,0.0011055393,0.0014427375,0.0033845068,0.003741933,0.0016196064,0.0026440497,0.010872883],"category_scores_gemma":[0.015299643,0.0007016874,0.0010494711,0.0017940139,0.0067341654,0.011450426,0.00555586,0.004264825,0.0017233833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013941126,0.00004126172,0.0019186378,0.0001413836,0.00002402972,0.00010246831,0.00033256138,0.0044268887,0.00051514007,0.9728968,0.00995878,0.009502571],"study_design_scores_gemma":[0.000025768655,0.000023926277,0.00047157868,0.000038686245,0.000013877661,0.000091631795,0.00019728809,0.008623845,0.00022319752,0.98536646,0.0049138875,0.000009803249],"about_ca_topic_score_codex":0.0019906396,"about_ca_topic_score_gemma":0.002074635,"teacher_disagreement_score":0.010872883,"about_ca_system_score_codex":0.0020374155,"about_ca_system_score_gemma":0.0012218981,"threshold_uncertainty_score":0.036373377},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27923018,0.0002467291,0.70602137,0.00083996437,0.0000706827,0.00018500393,0.0004251604,0.0022423777,0.010738397],"genre_scores_gemma":[0.7686003,0.00016767609,0.22650361,0.00020094744,0.00006702034,0.00023330617,0.0007455075,0.0004654002,0.0030163054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957718,0.0010894367,0.00035799624,0.0013269449,0.001055351,0.0003983079],"domain_scores_gemma":[0.9754146,0.013693522,0.0014977722,0.006635617,0.0018691341,0.0008892988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051482175,0.0009535504,0.0014175072,0.0027214927,0.0015322763,0.0048411074,0.0018097037,0.0017603517,0.0074348445],"category_scores_gemma":[0.027865417,0.0014993858,0.0014824359,0.0019666513,0.0039770515,0.012405702,0.007872616,0.0047186064,0.0013082369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006365291,0.0003528944,0.011907307,0.00056016113,0.00010233589,0.0004068446,0.0020063077,0.06625377,0.03167404,0.76911193,0.0041369908,0.11285095],"study_design_scores_gemma":[0.00007480904,0.00029873144,0.0017104709,0.00006206846,0.00006370102,0.00022300163,0.0005910792,0.24675563,0.032916747,0.7101067,0.0071146637,0.00008240287],"about_ca_topic_score_codex":0.0006438129,"about_ca_topic_score_gemma":0.00052468013,"teacher_disagreement_score":0.0074348445,"about_ca_system_score_codex":0.0018852672,"about_ca_system_score_gemma":0.00140777,"threshold_uncertainty_score":0.027226686},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90773374,0.0003259067,0.033165284,0.0005798856,0.000052258754,0.000038259874,0.00019177578,0.00015531275,0.05775753],"genre_scores_gemma":[0.9903618,0.000095730786,0.0045513664,0.000057374666,0.000030717092,0.000017015112,0.00012383383,0.000044230506,0.004717984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996997,0.000056010394,0.000009749628,0.000062287305,0.00007481023,0.00009735993],"domain_scores_gemma":[0.99943596,0.00021019345,0.00009924954,0.00007088832,0.00006626765,0.00011741859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030737038,0.00044422114,0.00028714412,0.0027121878,0.0011652901,0.0019480453,0.00062593253,0.0006412385,0.008580681],"category_scores_gemma":[0.0017552945,0.00023584039,0.00047125836,0.0007547519,0.0019537096,0.0032551526,0.0011254514,0.00097567483,0.0004895483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017196227,0.000012248895,0.000651362,0.000020299203,0.0000027483673,0.00004638954,0.00015958311,0.0017501905,0.0011615449,0.9928266,0.0003474918,0.0030044431],"study_design_scores_gemma":[0.000012137511,0.000020255255,0.0013063567,0.000026407757,0.0000073432057,0.00012451387,0.00024219086,0.02879918,0.0022692892,0.9623166,0.0048558405,0.000019863863],"about_ca_topic_score_codex":0.0016673743,"about_ca_topic_score_gemma":0.0025509137,"teacher_disagreement_score":0.008580681,"about_ca_system_score_codex":0.0014016691,"about_ca_system_score_gemma":0.00028242666,"threshold_uncertainty_score":0.02870524},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49113125,0.0058550145,0.29339236,0.0064182095,0.00037598555,0.00013440904,0.0022320652,0.0005889784,0.19987172],"genre_scores_gemma":[0.94300115,0.003245764,0.042784788,0.0005686888,0.0005814117,0.00025273729,0.0010330832,0.00022649026,0.008305994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977945,0.00055411475,0.0001320401,0.00059821655,0.00047525667,0.00044577525],"domain_scores_gemma":[0.96669465,0.025572281,0.0025502318,0.001991773,0.0012348732,0.00195614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031159236,0.0010145864,0.0010934663,0.002846976,0.0020486622,0.0030270922,0.0018155645,0.0011687023,0.007012394],"category_scores_gemma":[0.01626518,0.0009195038,0.00094906654,0.002677674,0.0056213425,0.0077186874,0.003152855,0.0042938762,0.0013298499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061116053,0.00016004131,0.008408015,0.0005741119,0.00008192388,0.00027889773,0.00067554595,0.030267647,0.009339731,0.901321,0.012228988,0.036052816],"study_design_scores_gemma":[0.00004765399,0.000101327234,0.007871391,0.0001380073,0.00008844722,0.0007244401,0.00019709504,0.092440404,0.0080078235,0.88093096,0.009349475,0.00010299596],"about_ca_topic_score_codex":0.000982988,"about_ca_topic_score_gemma":0.0008485181,"teacher_disagreement_score":0.007012394,"about_ca_system_score_codex":0.0021802234,"about_ca_system_score_gemma":0.00080706045,"threshold_uncertainty_score":0.023458779},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8249943,0.0012734227,0.13897039,0.0027244627,0.00009944584,0.000102089674,0.0018190143,0.00035865157,0.029658219],"genre_scores_gemma":[0.91523635,0.0009058972,0.065819174,0.0006075773,0.00020043436,0.00016680466,0.0022302878,0.00015834508,0.01467515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991153,0.00024694283,0.00005612899,0.00025134787,0.00019396948,0.00013625778],"domain_scores_gemma":[0.9908851,0.0063981647,0.0009981893,0.0004476291,0.00044790984,0.00082312356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081590074,0.0004978998,0.0010114181,0.0018277481,0.0017461685,0.0030354229,0.0015090477,0.0012899499,0.004667521],"category_scores_gemma":[0.0055873333,0.0008749245,0.00075483747,0.0023070956,0.0015098865,0.0042104986,0.0013791012,0.002367714,0.00054525974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037423125,0.0002875412,0.0046206326,0.00033966237,0.00006768866,0.000484209,0.0011196471,0.016788902,0.006447814,0.9385032,0.007821765,0.023144688],"study_design_scores_gemma":[0.0000787438,0.000030595344,0.0018220146,0.000028475006,0.000036420228,0.00048354198,0.00027563688,0.044084243,0.0013150546,0.9486196,0.0032076435,0.00001793346],"about_ca_topic_score_codex":0.0011549707,"about_ca_topic_score_gemma":0.0021351054,"teacher_disagreement_score":0.004667521,"about_ca_system_score_codex":0.0012820447,"about_ca_system_score_gemma":0.0004754551,"threshold_uncertainty_score":0.01561439},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66573894,0.0027582229,0.13347207,0.012504264,0.000617309,0.00014077745,0.0013949289,0.00046652686,0.1829071],"genre_scores_gemma":[0.94889796,0.0015139148,0.02716389,0.0008225857,0.00053412345,0.00011857353,0.00089420355,0.00022609158,0.019828748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998816,0.00030415846,0.000052933003,0.000402537,0.00018357916,0.0002407627],"domain_scores_gemma":[0.9891044,0.007051599,0.0011971889,0.00096555095,0.0005400689,0.0011413649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013659066,0.0008813584,0.0012362495,0.0022235487,0.0035046292,0.0059721945,0.00230791,0.0019269777,0.014687153],"category_scores_gemma":[0.0076131257,0.001493775,0.0009458492,0.0035633468,0.006576681,0.012010094,0.0028432722,0.004989421,0.0010601135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001492192,0.0000843082,0.0022508188,0.0000821475,0.000013677964,0.000048158192,0.00039407716,0.0027655698,0.0010947377,0.98026156,0.005368071,0.007487723],"study_design_scores_gemma":[0.000036774123,0.000013426621,0.0010454899,0.000020173458,0.000019923318,0.00009139441,0.00019124188,0.006141492,0.00051563146,0.9889231,0.0029816513,0.000019683544],"about_ca_topic_score_codex":0.0033645525,"about_ca_topic_score_gemma":0.004521734,"teacher_disagreement_score":0.014687153,"about_ca_system_score_codex":0.003014925,"about_ca_system_score_gemma":0.0011380141,"threshold_uncertainty_score":0.04913342},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046607535,0.053801365,0.19363755,0.03247144,0.0061114216,0.0002934488,0.004683486,0.0013630892,0.7029775],"genre_scores_gemma":[0.30490068,0.10397481,0.18774611,0.022095421,0.016745063,0.001211273,0.012394528,0.0015216722,0.34941038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748886,0.00064165913,0.00013957109,0.0007727901,0.0007664597,0.00019055669],"domain_scores_gemma":[0.9970789,0.0011412823,0.00013965603,0.0007481978,0.0007094774,0.00018252437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018051002,0.0010591616,0.001213166,0.0029907366,0.0023117804,0.005423313,0.0017998822,0.001959607,0.041821115],"category_scores_gemma":[0.005277428,0.0006127651,0.001067443,0.003306515,0.0045781992,0.005142962,0.0029584623,0.004925683,0.019043375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008642678,0.000011434205,0.00018006183,0.00017276194,0.000013115182,0.00004737602,0.00015013626,0.0005601241,0.00016172563,0.9115471,0.048246752,0.03890082],"study_design_scores_gemma":[0.0000057211323,0.0000075747234,0.00019636335,0.0001110017,0.000005452321,0.00014846092,0.00004802797,0.00069493667,0.00010469965,0.7202446,0.2784232,0.0000100800635],"about_ca_topic_score_codex":0.003676725,"about_ca_topic_score_gemma":0.0021413076,"teacher_disagreement_score":0.041821115,"about_ca_system_score_codex":0.0035234871,"about_ca_system_score_gemma":0.0019006821,"threshold_uncertainty_score":0.13990557},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7830903,0.00067798566,0.15102997,0.0007936936,0.00011057314,0.00013003404,0.0009233112,0.00046368618,0.062780485],"genre_scores_gemma":[0.9497028,0.00047022593,0.04203624,0.00015599687,0.00007692027,0.00016821035,0.000808712,0.00017935362,0.006401616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872774,0.0003209936,0.000071328825,0.00032980504,0.00028671263,0.0002634905],"domain_scores_gemma":[0.99379843,0.003621419,0.0008510331,0.00077042606,0.0004653663,0.00049329136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012428227,0.0005151186,0.00053739775,0.002698834,0.002172548,0.0018824375,0.0014977198,0.0012992363,0.0068799676],"category_scores_gemma":[0.008226094,0.0005739743,0.0009048333,0.0014115484,0.0028245503,0.0029041255,0.0012400628,0.0016259924,0.0007838719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011206618,0.000042805852,0.0028452843,0.000068569905,0.000021012478,0.00012170853,0.00033792245,0.014417096,0.0064127236,0.9584186,0.0023027647,0.014899412],"study_design_scores_gemma":[0.00003907611,0.00008190427,0.0020354502,0.000044277174,0.000037896083,0.0003843833,0.00025669945,0.036472734,0.0064998167,0.9469042,0.0071852473,0.00005830553],"about_ca_topic_score_codex":0.0013693346,"about_ca_topic_score_gemma":0.0014461481,"teacher_disagreement_score":0.0068799676,"about_ca_system_score_codex":0.0021018733,"about_ca_system_score_gemma":0.00057761424,"threshold_uncertainty_score":0.023015738},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49710765,0.0009659855,0.37134248,0.009382079,0.00019683366,0.00016073724,0.0005194345,0.00031257587,0.12001222],"genre_scores_gemma":[0.94903505,0.0006821917,0.027533868,0.0006343045,0.0001309608,0.00017671037,0.00025771768,0.000089322675,0.021459924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891925,0.0005237776,0.000033584725,0.00015251581,0.00014912536,0.0002218637],"domain_scores_gemma":[0.9948992,0.0035005019,0.00035690732,0.00026987682,0.00021904244,0.0007545482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012094151,0.00070833525,0.0011964405,0.0010132794,0.0016148961,0.004291351,0.0016881821,0.0023198954,0.0066328826],"category_scores_gemma":[0.0056588887,0.00051756715,0.00053094915,0.0013727209,0.0036331788,0.0070070964,0.002809727,0.0024637475,0.00060877006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007523012,0.000030626194,0.00015603659,0.000036086756,0.0000058845094,0.00003480648,0.000118739445,0.0063185575,0.0004737933,0.9864269,0.0018323875,0.0044909986],"study_design_scores_gemma":[0.00003791916,0.000014444219,0.000092265036,0.000011411965,0.0000054544075,0.000027884209,0.00010326338,0.03198614,0.00019389213,0.96606034,0.0014584959,0.000008543589],"about_ca_topic_score_codex":0.002618854,"about_ca_topic_score_gemma":0.0019029215,"teacher_disagreement_score":0.0066328826,"about_ca_system_score_codex":0.0023810486,"about_ca_system_score_gemma":0.0012330966,"threshold_uncertainty_score":0.02218926},"labels":[],"label_agreement":null},{"id":"W4385341391","doi":"10.61091/ars156-05","title":"Equitable Edge Coloring of Splitting Graph of Some Classes of Wheel Graphs","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Edge coloring; Mathematics; Combinatorics; Graph coloring; Brooks' theorem; Graph; Fractional coloring; List coloring; Chromatic scale; Complete coloring; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Graph power; Line graph; Computer science; Artificial intelligence","score_opus":0.023230566677458306,"score_gpt":0.25226463351926687,"score_spread":0.22903406684180855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385341391","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8772908,0.00017892904,0.10262872,0.0002016513,0.000031714084,0.000047168214,0.00043102124,0.00014396313,0.019046018],"genre_scores_gemma":[0.9750329,0.00012452189,0.02121501,0.00005071251,0.000014831015,0.00003984246,0.00055371353,0.000042877004,0.002925563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956125,0.00007313015,0.000022838138,0.00012589064,0.000074575495,0.00014222719],"domain_scores_gemma":[0.99905723,0.00027668237,0.00014753311,0.00020246954,0.00016185905,0.00015421356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027933152,0.00027521822,0.00029188916,0.0009101293,0.0010497925,0.0007762837,0.00055973866,0.0003659448,0.003956779],"category_scores_gemma":[0.0011285375,0.00021832886,0.00026713673,0.0006683758,0.0006450471,0.0013799387,0.000587239,0.00051045953,0.00018622896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007612092,0.0003324716,0.028055899,0.00026396304,0.00007557261,0.0010184182,0.0014338173,0.06917396,0.06382351,0.7102953,0.008326913,0.11643904],"study_design_scores_gemma":[0.00009531192,0.00017169387,0.021612523,0.00005901099,0.00007914902,0.0016186137,0.0012467414,0.29345474,0.029072965,0.62570375,0.026814286,0.0000712368],"about_ca_topic_score_codex":0.002507905,"about_ca_topic_score_gemma":0.0038708944,"teacher_disagreement_score":0.003956779,"about_ca_system_score_codex":0.0009041814,"about_ca_system_score_gemma":0.0004289113,"threshold_uncertainty_score":0.0132367015},"labels":[],"label_agreement":null},{"id":"W4385341959","doi":"10.61091/ars156-01","title":"Radio Antipodal Labeling of Mongolian Tent and Torus Grid Graphs","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"SSN College of Engineering","keywords":"Antipodal point; Mathematics; Torus; Grid; Combinatorics; Geometry","score_opus":0.012926107791912875,"score_gpt":0.2251847969094647,"score_spread":0.2122586891175518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385341959","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97387064,0.0001027133,0.018650142,0.00009664908,0.000009780452,0.000013021334,0.00024007996,0.000049621794,0.0069673695],"genre_scores_gemma":[0.98098826,0.00009460396,0.016335798,0.000025502239,0.000008696929,0.000022495497,0.00036417934,0.000014250353,0.002146207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99986815,0.000030333822,0.000008677758,0.00003173187,0.000020176776,0.000040931587],"domain_scores_gemma":[0.9993795,0.00026586116,0.00013387094,0.00008931694,0.000049917882,0.00008147522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019514778,0.00015055621,0.00022023753,0.0005067791,0.00059235276,0.00062166504,0.00038973647,0.00030519496,0.0020170854],"category_scores_gemma":[0.00089665904,0.00017699288,0.00017917124,0.00038822985,0.0005328412,0.0008288572,0.00048533693,0.00026439913,0.00017591826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011613863,0.00019340265,0.033306967,0.00040257364,0.000064492546,0.00064270437,0.0018899161,0.09591376,0.050813988,0.70575804,0.0075457734,0.102307044],"study_design_scores_gemma":[0.00011853825,0.00041873552,0.024397166,0.00008113882,0.00007585103,0.0017735038,0.0015806366,0.38104194,0.023416448,0.5329895,0.034040503,0.00006606248],"about_ca_topic_score_codex":0.0010893304,"about_ca_topic_score_gemma":0.0017085781,"teacher_disagreement_score":0.0020170854,"about_ca_system_score_codex":0.00063110417,"about_ca_system_score_gemma":0.0003164704,"threshold_uncertainty_score":0.006747782},"labels":[],"label_agreement":null},{"id":"W4385349867","doi":"10.61091/ars156-02","title":"Further Results on Radio Number of Wedge sum of Graphs","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Injective function; Graph; Physics","score_opus":0.01695318783950207,"score_gpt":0.25242533733964795,"score_spread":0.2354721495001459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385349867","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80482775,0.0011481756,0.15409304,0.00029889485,0.00006917289,0.000044912733,0.00084806926,0.0007200114,0.037949953],"genre_scores_gemma":[0.9511923,0.0004941885,0.040678494,0.00012841859,0.00008956303,0.0000760514,0.0014975268,0.0002630748,0.0055803163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995173,0.00008137044,0.000021057222,0.00012029832,0.00014620624,0.000113768925],"domain_scores_gemma":[0.99855417,0.00066724233,0.00025042813,0.00021041316,0.00013319583,0.00018449112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045124933,0.00055298075,0.00044746557,0.0019193398,0.00063576724,0.00093000237,0.0010161588,0.00034624353,0.004994255],"category_scores_gemma":[0.003033846,0.0002537022,0.00065088324,0.0012833585,0.00096095284,0.0020090463,0.0011556349,0.00081193744,0.00051734323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007056393,0.00029706286,0.03932593,0.0008923529,0.00016180218,0.001145729,0.0016802646,0.1532589,0.04325174,0.62573004,0.010909714,0.1226409],"study_design_scores_gemma":[0.000059497543,0.00042376434,0.029344387,0.00011905757,0.0001948841,0.002304703,0.00080662436,0.42311162,0.025340283,0.4841866,0.034011006,0.000097620774],"about_ca_topic_score_codex":0.0006888378,"about_ca_topic_score_gemma":0.0006909308,"teacher_disagreement_score":0.004994255,"about_ca_system_score_codex":0.0005312187,"about_ca_system_score_gemma":0.00023716199,"threshold_uncertainty_score":0.01670742},"labels":[],"label_agreement":null},{"id":"W4385350581","doi":"10.61091/ars156-04","title":"A Note on Distance Irregular Labeling of Graphs","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Bound graph; Graph power; Discrete mathematics; Line graph","score_opus":0.013396903220207557,"score_gpt":0.24255414817006432,"score_spread":0.22915724494985676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385350581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2728746,0.0057803104,0.62925565,0.0025740725,0.001254166,0.000083824234,0.0005945253,0.0010070123,0.086575784],"genre_scores_gemma":[0.8311045,0.004307085,0.15330012,0.00059370045,0.00082799647,0.00007000042,0.00072016555,0.00026596303,0.008810443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992467,0.00017040994,0.0000512587,0.00022333095,0.00022070842,0.00008759931],"domain_scores_gemma":[0.99829227,0.0006474972,0.00020884418,0.00036813074,0.00027600658,0.00020730651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056240265,0.0004343495,0.00043697478,0.0012939299,0.00103782,0.0010313503,0.0006744948,0.0006670236,0.0030895027],"category_scores_gemma":[0.0030743815,0.0003078267,0.0005697737,0.0023078322,0.0014401452,0.0030453077,0.0011730224,0.0015026439,0.00051193306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015045992,0.00005337231,0.0051886453,0.00033086396,0.000034631757,0.00064634206,0.0011790138,0.022620857,0.014656497,0.8568552,0.0075099035,0.090774156],"study_design_scores_gemma":[0.000015597934,0.00016551295,0.0038200174,0.00006929702,0.000043571577,0.0011806434,0.0006922321,0.07810949,0.00755704,0.85325706,0.055009227,0.00008040512],"about_ca_topic_score_codex":0.0014445116,"about_ca_topic_score_gemma":0.0011299708,"teacher_disagreement_score":0.0030895027,"about_ca_system_score_codex":0.0008545874,"about_ca_system_score_gemma":0.00026731938,"threshold_uncertainty_score":0.010335445},"labels":[],"label_agreement":null},{"id":"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037062513,0.061988927,0.05699632,0.026397586,0.028610544,0.00025773988,0.0021189977,0.0007617247,0.81916183],"genre_scores_gemma":[0.14734101,0.15603691,0.085138254,0.010120762,0.042162456,0.0007245826,0.0054962025,0.0019369442,0.5510429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99665725,0.00052533235,0.00022614807,0.0005457622,0.0019058404,0.00013964956],"domain_scores_gemma":[0.9937331,0.0019287058,0.00032776102,0.0012138034,0.0022095004,0.00058704626],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016617846,0.000824384,0.0016890028,0.0036919902,0.0022533766,0.011372512,0.001110499,0.0013775096,0.068968944],"category_scores_gemma":[0.008804207,0.00059099,0.0007106734,0.0062149656,0.0032493423,0.00453569,0.0024541146,0.007594566,0.027695684],"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.000024143765,0.000057589066,0.00046776448,0.00049031206,0.000049815375,0.000077694145,0.0001300472,0.0010313602,0.0006683588,0.5254198,0.32609573,0.1454874],"study_design_scores_gemma":[0.000008542303,0.000015196571,0.0006998785,0.00020582335,0.000017129445,0.0003196857,0.00006764032,0.0020246576,0.00020512106,0.30352205,0.6928957,0.000018614275],"about_ca_topic_score_codex":0.001644459,"about_ca_topic_score_gemma":0.001620893,"teacher_disagreement_score":0.93103105,"about_ca_system_score_codex":0.0032595713,"about_ca_system_score_gemma":0.00531018,"threshold_uncertainty_score":0.23072416},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6005092,0.0016956062,0.33659413,0.0010264715,0.00013686848,0.00013688518,0.00063417153,0.0002551784,0.05901149],"genre_scores_gemma":[0.93869567,0.00065816415,0.053633668,0.0001664429,0.00006662978,0.00007598178,0.00039516465,0.00005012156,0.0062582237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992755,0.0002065935,0.0000374154,0.0002209884,0.00014400037,0.000115474184],"domain_scores_gemma":[0.99832946,0.00066140457,0.00031435175,0.00028274007,0.00028268667,0.0001294456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046721866,0.00028086145,0.00024410267,0.0011305021,0.0009561777,0.0010414281,0.00061834906,0.00057701935,0.0037077584],"category_scores_gemma":[0.0032608774,0.00020315251,0.00023502823,0.0015243865,0.0010355199,0.0021068507,0.0010585514,0.00073752523,0.00021521807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052372823,0.000018050609,0.0010655853,0.00006593382,0.000011617894,0.00018577129,0.00034683835,0.010176729,0.003174015,0.9592282,0.0010173678,0.024657462],"study_design_scores_gemma":[0.000006496796,0.000022851085,0.00066102354,0.000017766222,0.000010934874,0.0003235362,0.00020386635,0.022042044,0.0024228771,0.9623329,0.011943713,0.000012018363],"about_ca_topic_score_codex":0.0009776764,"about_ca_topic_score_gemma":0.0009777616,"teacher_disagreement_score":0.0037077584,"about_ca_system_score_codex":0.00090757775,"about_ca_system_score_gemma":0.00035913166,"threshold_uncertainty_score":0.012403727},"labels":[],"label_agreement":null},{"id":"W4385892758","doi":"10.61091/ars156-06","title":"Royal Colorings of Graphs","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Edge coloring; Mathematics; Vertex (graph theory); Complete coloring; Fractional coloring; List coloring; Graph; Greedy coloring; Graph coloring; Discrete mathematics; Graph power; Line graph","score_opus":0.014004832174625573,"score_gpt":0.22815570783966613,"score_spread":0.21415087566504054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385892758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34139132,0.0035649417,0.37293956,0.0025715274,0.00083105365,0.00015783685,0.0014530072,0.0012562154,0.27583447],"genre_scores_gemma":[0.8543522,0.0019982986,0.10957388,0.0007769136,0.00065458263,0.00012353105,0.0009629443,0.00041512362,0.031142568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978169,0.00051667535,0.00014143476,0.0004746692,0.00052237697,0.0005278752],"domain_scores_gemma":[0.9945615,0.0023870133,0.0007639706,0.0011243335,0.0005387619,0.000624373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017022663,0.000687439,0.00072090747,0.0018404094,0.0017699029,0.0034356688,0.0010729587,0.0008141983,0.0065009454],"category_scores_gemma":[0.005762027,0.0007779948,0.0011411482,0.0015053471,0.004024756,0.004539944,0.0025469433,0.0022926324,0.0015581709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008767967,0.000017773767,0.00041356654,0.00010375414,0.000012426138,0.00006396613,0.00030835968,0.0045802644,0.002172531,0.97488743,0.0037675365,0.013584705],"study_design_scores_gemma":[0.000029695946,0.000045346947,0.00061037287,0.000039890358,0.000017200076,0.00025881527,0.00017880891,0.014587767,0.0019647647,0.9590196,0.023210187,0.000037439804],"about_ca_topic_score_codex":0.00133004,"about_ca_topic_score_gemma":0.0016597173,"teacher_disagreement_score":0.0065009454,"about_ca_system_score_codex":0.0023433832,"about_ca_system_score_gemma":0.00070225546,"threshold_uncertainty_score":0.021747887},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16365963,0.021413812,0.7020146,0.008365188,0.0018529505,0.00015619167,0.002102254,0.0021706037,0.09826467],"genre_scores_gemma":[0.77457774,0.009424285,0.18795985,0.0021651941,0.0048059034,0.0006420292,0.0017954053,0.0019822265,0.016647363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963068,0.00080603344,0.00018416387,0.0010484664,0.0010446548,0.00060982275],"domain_scores_gemma":[0.9539951,0.034796212,0.0024280744,0.0040288237,0.0020395892,0.0027121985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045918953,0.0039563808,0.0035100838,0.0105569875,0.0027176673,0.0074760085,0.007875183,0.0038190938,0.011384774],"category_scores_gemma":[0.03624994,0.0020710998,0.002656078,0.0063792616,0.0060772714,0.021603307,0.008441215,0.0096168835,0.0016344261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005498914,0.0002983046,0.0046289978,0.0007121527,0.00020380219,0.00027225178,0.000654654,0.061115008,0.009337257,0.8438523,0.016093582,0.062281985],"study_design_scores_gemma":[0.000031379528,0.000074198775,0.0027173988,0.00016974617,0.00013400498,0.00039812195,0.00018220035,0.21461664,0.0033407845,0.7684699,0.009742787,0.0001228639],"about_ca_topic_score_codex":0.0013348579,"about_ca_topic_score_gemma":0.002778769,"teacher_disagreement_score":0.011384774,"about_ca_system_score_codex":0.006720583,"about_ca_system_score_gemma":0.001072878,"threshold_uncertainty_score":0.048761487},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8801542,0.0023126304,0.043724332,0.0021346277,0.00041626632,0.000046522175,0.000785025,0.00029230944,0.07013415],"genre_scores_gemma":[0.9901287,0.0003955275,0.005201913,0.00021965346,0.00018371332,0.000029848963,0.00029140763,0.00007582809,0.0034734213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989361,0.00027339996,0.00002443722,0.00019540299,0.00030104557,0.00026962577],"domain_scores_gemma":[0.9967865,0.0011075339,0.00045927396,0.0002252664,0.00050278136,0.0009187468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058998377,0.000738494,0.0007121514,0.0023821795,0.001640868,0.0021001596,0.0013593691,0.0009855316,0.0064661633],"category_scores_gemma":[0.0044308426,0.0003385462,0.00040653316,0.0014284267,0.0022363097,0.0022473724,0.0015001628,0.0015248901,0.0006748012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015197645,0.000045860696,0.0021906618,0.0001105434,0.000035311445,0.00016710206,0.00026222115,0.0065644505,0.00453237,0.9718141,0.0065194312,0.007605969],"study_design_scores_gemma":[0.000032566655,0.00008481462,0.0037554426,0.000067745015,0.00003068459,0.000371872,0.00025794268,0.07972047,0.002715004,0.9030108,0.009882661,0.00006989473],"about_ca_topic_score_codex":0.0027088572,"about_ca_topic_score_gemma":0.0026787452,"teacher_disagreement_score":0.0064661633,"about_ca_system_score_codex":0.0018761024,"about_ca_system_score_gemma":0.0006096959,"threshold_uncertainty_score":0.02163142},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5435908,0.0009284047,0.42089117,0.00038797784,0.00011543097,0.00006428759,0.00035182326,0.00010540564,0.033564672],"genre_scores_gemma":[0.94455427,0.0007060967,0.050433833,0.000077977864,0.000116778436,0.000050743245,0.00030252896,0.00004829282,0.003709518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947363,0.00015515028,0.00002858726,0.0001262494,0.00014398416,0.000072433],"domain_scores_gemma":[0.99766004,0.001088188,0.00047621888,0.00018286114,0.0003204649,0.00027222413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007333593,0.0005938001,0.00046193466,0.0029554176,0.0007564581,0.0015410255,0.00057146983,0.0004945165,0.0027941056],"category_scores_gemma":[0.0035240632,0.00020730394,0.00029043484,0.0017702549,0.0015770106,0.0029013765,0.0009755209,0.00092997175,0.0003502437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054959124,0.000030303645,0.0022385311,0.000051688137,0.00001117713,0.000076446966,0.00024215547,0.018361792,0.0033473414,0.9552055,0.0006147384,0.019765412],"study_design_scores_gemma":[0.0000139262875,0.0001039868,0.0031444388,0.000050812105,0.000019726218,0.00026393714,0.0003251102,0.13165592,0.0025351031,0.8557345,0.0061000763,0.00005257436],"about_ca_topic_score_codex":0.0007176262,"about_ca_topic_score_gemma":0.00081913784,"teacher_disagreement_score":0.0029554176,"about_ca_system_score_codex":0.00090720516,"about_ca_system_score_gemma":0.0002885495,"threshold_uncertainty_score":0.00934726},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8068314,0.0022081195,0.10772553,0.008647242,0.00033153873,0.00011217436,0.0021797963,0.00071407907,0.071250096],"genre_scores_gemma":[0.95436156,0.0011091859,0.030757036,0.0008743288,0.00041538556,0.00015911902,0.0011106062,0.00030989738,0.010902881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991829,0.00026091884,0.00002442259,0.000250883,0.00013080708,0.0001500772],"domain_scores_gemma":[0.98550665,0.009894793,0.0014430309,0.0014692554,0.00049207633,0.0011941921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076748215,0.000877324,0.0015833963,0.0024069257,0.0021458983,0.004407514,0.0016701602,0.0024549563,0.009434765],"category_scores_gemma":[0.010227458,0.0012750068,0.00071509107,0.0026250202,0.0036041217,0.0065470575,0.0025599138,0.0034697806,0.00088597497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002511406,0.000077589,0.002530788,0.00025850572,0.000042739866,0.00019763487,0.0003749035,0.0133060105,0.0035139897,0.9559069,0.01177299,0.011766783],"study_design_scores_gemma":[0.000043904347,0.000015502977,0.0011371246,0.000024271038,0.000021881098,0.00020355427,0.00013752143,0.015315948,0.00083200244,0.97964096,0.0026117202,0.00001562856],"about_ca_topic_score_codex":0.0007240432,"about_ca_topic_score_gemma":0.0011286293,"teacher_disagreement_score":0.009434765,"about_ca_system_score_codex":0.0015506579,"about_ca_system_score_gemma":0.0007215353,"threshold_uncertainty_score":0.031562388},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07706309,0.00228741,0.7047884,0.004514036,0.0008288583,0.00013714947,0.0012496073,0.0017700961,0.20736136],"genre_scores_gemma":[0.7801531,0.0020995399,0.14629456,0.0031078826,0.0007143315,0.00043867892,0.0009936601,0.0005081805,0.06569006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999074,0.000116870746,0.000040338982,0.00025999578,0.0002876464,0.00022113459],"domain_scores_gemma":[0.9975273,0.0013915071,0.0001430596,0.00045211674,0.00031884146,0.00016721086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010248193,0.0008557747,0.0007596423,0.0013684885,0.0016831589,0.001598773,0.0013752012,0.0012826353,0.013112199],"category_scores_gemma":[0.0049671894,0.0005141572,0.0011862535,0.0010339735,0.0025899382,0.004243418,0.0022350193,0.0024435634,0.0023290927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005163252,0.000012431977,0.00036642404,0.00008684404,0.000012981311,0.000069886315,0.00021276054,0.0033260167,0.0013000534,0.9677352,0.007994995,0.018830687],"study_design_scores_gemma":[0.000021297716,0.000015687485,0.000350456,0.00002601043,0.0000122963265,0.00015129594,0.000041996544,0.009879948,0.00094536535,0.9719802,0.016559012,0.000016438868],"about_ca_topic_score_codex":0.0038569039,"about_ca_topic_score_gemma":0.0031341414,"teacher_disagreement_score":0.013112199,"about_ca_system_score_codex":0.0016607661,"about_ca_system_score_gemma":0.0010078168,"threshold_uncertainty_score":0.043864608},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83205074,0.0018539566,0.13787071,0.002541388,0.00010324114,0.000103033984,0.0012399344,0.0005316548,0.023705408],"genre_scores_gemma":[0.95760345,0.00069597695,0.034134176,0.00043021663,0.000087302426,0.00009830383,0.00084932655,0.0001238224,0.005977432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993131,0.00015925842,0.000036726575,0.00027811664,0.000099980185,0.0001129013],"domain_scores_gemma":[0.9943046,0.0037030613,0.0006498263,0.0006326241,0.0002900643,0.00041988323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005322638,0.00047679123,0.00068990176,0.0012640583,0.001360766,0.0017809472,0.0013011501,0.00089843996,0.005359817],"category_scores_gemma":[0.0066801263,0.0007706621,0.00072028115,0.0012421777,0.0018463227,0.0029921732,0.0012723306,0.0012846928,0.0006243545],"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.00074696157,0.0002211624,0.014182661,0.0014499172,0.00024826126,0.0013280241,0.0020779683,0.062296916,0.02773205,0.79595554,0.013317306,0.08044325],"study_design_scores_gemma":[0.00010595574,0.00011406225,0.002558172,0.00012038232,0.00012618065,0.0008092125,0.0006203072,0.08197093,0.008296512,0.8952765,0.009957263,0.000044580647],"about_ca_topic_score_codex":0.0013230212,"about_ca_topic_score_gemma":0.0023825807,"teacher_disagreement_score":0.005359817,"about_ca_system_score_codex":0.0010326997,"about_ca_system_score_gemma":0.0006142228,"threshold_uncertainty_score":0.017930388},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18480542,0.007685204,0.55111784,0.009635159,0.0012021416,0.00025592584,0.0071503543,0.002990014,0.23515803],"genre_scores_gemma":[0.7221006,0.0039346716,0.21834202,0.0020477101,0.0014329053,0.00079908926,0.0060405317,0.0025400696,0.04276245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99563223,0.0009801425,0.00018715089,0.00089685025,0.0012327812,0.0010707779],"domain_scores_gemma":[0.9685789,0.023098987,0.0010430124,0.0037327758,0.0020104062,0.0015358543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047092596,0.0019119758,0.001982166,0.0046898504,0.0024956854,0.0070391023,0.006820495,0.002784176,0.036539312],"category_scores_gemma":[0.030446557,0.0014661456,0.0020837074,0.0040831477,0.003724682,0.014950829,0.0061372253,0.007500501,0.008418616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067050953,0.00024098506,0.0029965602,0.00064203073,0.000117872,0.00015980327,0.00056369865,0.03737636,0.002644898,0.86347955,0.040346537,0.050761268],"study_design_scores_gemma":[0.000055667508,0.000056047214,0.0011839239,0.00019340689,0.00008411324,0.00018080068,0.00014349112,0.064235434,0.0021371453,0.9219306,0.009731209,0.000068149275],"about_ca_topic_score_codex":0.0026787515,"about_ca_topic_score_gemma":0.005613434,"teacher_disagreement_score":0.036539312,"about_ca_system_score_codex":0.004777423,"about_ca_system_score_gemma":0.0023234377,"threshold_uncertainty_score":0.12223619},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7156685,0.00064972247,0.24657805,0.0009365872,0.000098952856,0.000049582828,0.0004843542,0.00024430617,0.03528999],"genre_scores_gemma":[0.9122472,0.00057193247,0.07230911,0.00019835099,0.00010029598,0.000095889554,0.00060367736,0.000108288106,0.013765215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966145,0.00006918583,0.000020872387,0.00009779617,0.00006115581,0.00008961025],"domain_scores_gemma":[0.9992231,0.00025909612,0.00018317558,0.00010235648,0.000074170865,0.00015802699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000400146,0.00026434546,0.00036875377,0.00092932564,0.0011424593,0.0011150987,0.00056211994,0.0004896692,0.0024106794],"category_scores_gemma":[0.0013610861,0.00022185278,0.00050967827,0.00083514,0.0012483073,0.0021811062,0.0010954745,0.00084680936,0.00030823078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008156023,0.000025782703,0.0010581311,0.000052990883,0.000012437844,0.00023878839,0.00045270254,0.004472285,0.003870972,0.9759529,0.0017605003,0.012021024],"study_design_scores_gemma":[0.000013750788,0.000033239656,0.00080343033,0.000017374554,0.000015424743,0.00034703538,0.00020534417,0.03301627,0.0021655825,0.9529324,0.01043285,0.00001719888],"about_ca_topic_score_codex":0.0012727027,"about_ca_topic_score_gemma":0.0011299019,"teacher_disagreement_score":0.0024106794,"about_ca_system_score_codex":0.00076579384,"about_ca_system_score_gemma":0.00041505098,"threshold_uncertainty_score":0.008064508},"labels":[],"label_agreement":null},{"id":"W4391127438","doi":"10.61091/ars157-09","title":"On Tades of Disjoint Union of Some Graphs","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Disjoint sets; Disjoint union (topology); Combinatorics; Discrete mathematics","score_opus":0.014070247058755914,"score_gpt":0.23380750556491342,"score_spread":0.2197372585061575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127438","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77761775,0.0002957876,0.19331299,0.00034877233,0.00006938419,0.000055500095,0.0006500062,0.00056612096,0.02708378],"genre_scores_gemma":[0.8729763,0.00022909445,0.113822624,0.00014023215,0.000056162848,0.00008599986,0.0015386362,0.00021068129,0.010940253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992793,0.00013995357,0.000041440126,0.000240927,0.00014876881,0.00014956147],"domain_scores_gemma":[0.99857473,0.000567603,0.00025532927,0.0002743754,0.00016827138,0.00015967496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050039834,0.0004670842,0.00047542359,0.0018381893,0.001298961,0.0015197296,0.00071803184,0.0006400925,0.0068910704],"category_scores_gemma":[0.0026537005,0.0005007588,0.00076146476,0.0012681372,0.0014842079,0.0024173371,0.001558473,0.00088569935,0.00068965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030156286,0.00007275862,0.0063735526,0.0001513627,0.000046230685,0.00032382665,0.00081224827,0.022786943,0.0071452055,0.92786056,0.0038146628,0.030310998],"study_design_scores_gemma":[0.000038941074,0.00010061878,0.0036354307,0.00005108725,0.0000461847,0.00056942913,0.00067783735,0.124727614,0.007208131,0.8471256,0.015791614,0.000027517824],"about_ca_topic_score_codex":0.0013908122,"about_ca_topic_score_gemma":0.0018376776,"teacher_disagreement_score":0.0068910704,"about_ca_system_score_codex":0.00095961714,"about_ca_system_score_gemma":0.00030627317,"threshold_uncertainty_score":0.02305293},"labels":[],"label_agreement":null},{"id":"W4391127440","doi":"10.61091/ars157-08","title":"Total Dominator Colorings of P 4 -reducible and P 4 -tidy Graphs","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.012254370400480987,"score_gpt":0.22937707837489707,"score_spread":0.21712270797441607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127440","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8832375,0.0002787587,0.098330185,0.0005407359,0.000031852203,0.00010157868,0.0017620883,0.0004838973,0.015233345],"genre_scores_gemma":[0.92442423,0.0002528316,0.066952735,0.00008849454,0.000026603106,0.00008768897,0.002344845,0.000097481214,0.005725078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999619,0.000063814725,0.00002573818,0.00011447458,0.00007676896,0.000100165234],"domain_scores_gemma":[0.9985636,0.00072938774,0.00022390502,0.00022296191,0.00011119029,0.00014894523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003736408,0.00038337437,0.0004637179,0.0012409803,0.0010260737,0.001942388,0.00070159347,0.00043235836,0.0026665232],"category_scores_gemma":[0.0018590613,0.00044629324,0.00063430745,0.0011178937,0.001065695,0.0014271697,0.0008865982,0.0008346416,0.00017821064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012656556,0.0002867882,0.027150182,0.00067813304,0.00012582116,0.000985241,0.0023004205,0.2259392,0.040795565,0.53188366,0.013447697,0.15514164],"study_design_scores_gemma":[0.0001380265,0.000120896475,0.0093493,0.000056036708,0.00007331036,0.00072006555,0.0009912688,0.26390612,0.015593119,0.6984646,0.010526322,0.000060954626],"about_ca_topic_score_codex":0.004280858,"about_ca_topic_score_gemma":0.0060222484,"teacher_disagreement_score":0.004280858,"about_ca_system_score_codex":0.0016660255,"about_ca_system_score_gemma":0.00079864246,"threshold_uncertainty_score":0.012087882},"labels":[],"label_agreement":null},{"id":"W4391127473","doi":"10.61091/ars157-06","title":"Results on Grundy Chromatic Number of Join Graph of Graphs","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Join (topology); Combinatorics; Graph","score_opus":0.017827237562604466,"score_gpt":0.2561446523972409,"score_spread":0.23831741483463642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127473","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6518283,0.004286314,0.21082075,0.0016965711,0.00024073213,0.000079656755,0.0014006259,0.00050694065,0.12914024],"genre_scores_gemma":[0.9546383,0.001597111,0.032996703,0.00016671063,0.00016963076,0.000078939134,0.0005450006,0.00013378952,0.009673826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994349,0.00008315043,0.00001969547,0.00018735004,0.00011672413,0.00015811928],"domain_scores_gemma":[0.9979001,0.00116095,0.00022761655,0.0002619061,0.00018298453,0.0002664891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059082784,0.0004959222,0.0006033036,0.0023184228,0.0018906533,0.0019050328,0.00088073,0.00058396405,0.0064060153],"category_scores_gemma":[0.0023576128,0.00035513227,0.0007449243,0.0020646583,0.0024080698,0.0037909278,0.00145221,0.0019374063,0.00071490393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021226128,0.000058446116,0.0046326527,0.00018343232,0.00003269724,0.000093070834,0.00058811833,0.02319783,0.006212322,0.93426746,0.0046708933,0.025850788],"study_design_scores_gemma":[0.0000403914,0.000114449766,0.0053157276,0.000056299963,0.000047810285,0.00034679496,0.00046089134,0.069440655,0.0072458927,0.89321643,0.023657737,0.000056978064],"about_ca_topic_score_codex":0.0037725002,"about_ca_topic_score_gemma":0.0034723864,"teacher_disagreement_score":0.0064060153,"about_ca_system_score_codex":0.0020295233,"about_ca_system_score_gemma":0.0007587803,"threshold_uncertainty_score":0.021430254},"labels":[],"label_agreement":null},{"id":"W4391127474","doi":"10.61091/ars157-01","title":"Sum Divisor Cordial Labeling of T p -Tree Related Graphs","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Divisor (algebraic geometry); Tree (set theory); Discrete mathematics","score_opus":0.014532946269376087,"score_gpt":0.23233158679085675,"score_spread":0.21779864052148065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127474","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7747695,0.0003986834,0.17449988,0.0005021417,0.000099633035,0.00009058688,0.0007431854,0.00080287986,0.04809351],"genre_scores_gemma":[0.9063729,0.0003079336,0.08036777,0.00015742792,0.000051994182,0.00007992062,0.0009915115,0.000105350446,0.0115650995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997863,0.000042983866,0.000015826005,0.00007168368,0.000041290135,0.000041967003],"domain_scores_gemma":[0.99924695,0.00018705706,0.00014389935,0.0001640005,0.00012345688,0.00013474756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017417708,0.0002032207,0.00026798772,0.0007341998,0.00095005,0.000959665,0.00048747525,0.00042951116,0.005113974],"category_scores_gemma":[0.001151496,0.00015151767,0.00025507913,0.0009855321,0.0006009446,0.001377827,0.0007167858,0.00060112367,0.00053344824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035692446,0.0001598557,0.004699207,0.00024575726,0.000027617096,0.0008262798,0.0009406775,0.018805034,0.043643206,0.7742277,0.007019629,0.14904806],"study_design_scores_gemma":[0.000049266022,0.00019949202,0.00414342,0.000056699002,0.00005425608,0.0016285256,0.0005800902,0.1313669,0.030701559,0.78747773,0.043701578,0.00004047766],"about_ca_topic_score_codex":0.0009579933,"about_ca_topic_score_gemma":0.0012471154,"teacher_disagreement_score":0.005113974,"about_ca_system_score_codex":0.0008600627,"about_ca_system_score_gemma":0.00037692057,"threshold_uncertainty_score":0.017108023},"labels":[],"label_agreement":null},{"id":"W4391127498","doi":"10.61091/ars157-10","title":"On Vertex-Edge Resolvability for the Web Graph and Prism Related Graph","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Graph; Neighbourhood (mathematics); Discrete mathematics; Mathematical analysis","score_opus":0.01510902090050381,"score_gpt":0.23677102527053426,"score_spread":0.22166200437003045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127498","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8417621,0.00062276074,0.12227633,0.0013977711,0.00008564917,0.000044936547,0.0006534794,0.00028035647,0.032876574],"genre_scores_gemma":[0.973369,0.00022333754,0.021678165,0.00014093556,0.00007920363,0.000059619328,0.0005492094,0.00011445661,0.0037859706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990074,0.00036287057,0.00003713244,0.00022146513,0.00017051883,0.00020054432],"domain_scores_gemma":[0.9943961,0.0035179502,0.0006635008,0.0006742548,0.0002296972,0.00051853183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013513692,0.00058640644,0.0006637299,0.0019038382,0.0017325999,0.0022221843,0.0017085196,0.0014372153,0.006486266],"category_scores_gemma":[0.0064013544,0.00039672854,0.0009068201,0.0012960105,0.0027255905,0.003954887,0.0024066144,0.0018355952,0.00052197423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009881473,0.000038044225,0.0021009988,0.000061586725,0.000016603879,0.000068541616,0.00018801916,0.022060758,0.0011319946,0.96551025,0.0019203568,0.006803907],"study_design_scores_gemma":[0.000021356886,0.000034572477,0.0013227207,0.000025144602,0.000015786734,0.00015076117,0.00019026727,0.104973786,0.0010945544,0.88972616,0.0024174377,0.000027468614],"about_ca_topic_score_codex":0.0019257206,"about_ca_topic_score_gemma":0.0020658122,"teacher_disagreement_score":0.006486266,"about_ca_system_score_codex":0.0017937842,"about_ca_system_score_gemma":0.000713403,"threshold_uncertainty_score":0.021698713},"labels":[],"label_agreement":null},{"id":"W4391127501","doi":"10.61091/ars157-07","title":"H - V -Super-Strong- ( a , d ) -antimagic decomposition of complete bipartite graphs","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Complete bipartite graph; Graph","score_opus":0.022046636902891516,"score_gpt":0.2638523015819857,"score_spread":0.24180566467909417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127501","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60964876,0.0004568682,0.34148833,0.00072379,0.00008908247,0.00018763964,0.0013455099,0.00043511385,0.045624923],"genre_scores_gemma":[0.8859842,0.00030853978,0.1036352,0.00027912523,0.0000616228,0.00013408653,0.0014105976,0.000065810484,0.008120793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994735,0.00011924986,0.000032651657,0.00013445459,0.00012564163,0.000114496455],"domain_scores_gemma":[0.9985343,0.00039480324,0.00024187456,0.0002258683,0.00026282066,0.00034027145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005149718,0.00047017407,0.0003352498,0.0008351794,0.0009968304,0.001137651,0.0006012491,0.0005109288,0.0031841965],"category_scores_gemma":[0.0014291961,0.00045080605,0.0006547762,0.0007718197,0.00087933516,0.0015699242,0.0016125552,0.0010827916,0.00053469924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046869167,0.00022223362,0.0051370417,0.00045105346,0.00011563884,0.00070990756,0.0011788487,0.02503255,0.051521897,0.8486437,0.007555933,0.058962464],"study_design_scores_gemma":[0.00007944048,0.00020817723,0.0032804722,0.0000766539,0.00008597415,0.0012334981,0.000791419,0.12086372,0.01881052,0.83114094,0.023386974,0.000042201907],"about_ca_topic_score_codex":0.0011096696,"about_ca_topic_score_gemma":0.002116938,"teacher_disagreement_score":0.0031841965,"about_ca_system_score_codex":0.00066303037,"about_ca_system_score_gemma":0.00078802335,"threshold_uncertainty_score":0.0106521845},"labels":[],"label_agreement":null},{"id":"W4391127513","doi":"10.61091/ars157-04","title":"Rainbow Vertex Connection Numbers and Total Rainbow Connection Numbers of Middle and Total Graphs","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Foundation of Henan Educational Committee; National Natural Science Foundation of China; Henan Normal University","keywords":"Rainbow; Connection (principal bundle); Mathematics; Vertex (graph theory); Combinatorics; Graph; Geometry; Physics; Optics","score_opus":0.01376848703772906,"score_gpt":0.22084355689478874,"score_spread":0.20707506985705967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127513","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69658643,0.0024160526,0.23611192,0.0008658097,0.00018460419,0.00011673438,0.001686546,0.00043641252,0.061595522],"genre_scores_gemma":[0.92869693,0.00089579483,0.061564397,0.0001664459,0.00012764467,0.00012800538,0.00073501107,0.00015055774,0.0075352173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988111,0.00020091627,0.00006804436,0.00041009966,0.00024348435,0.00026639557],"domain_scores_gemma":[0.99469155,0.0027332762,0.0007612869,0.0005676089,0.00040735194,0.000839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009757534,0.0007378609,0.00053605024,0.0024773662,0.0013070885,0.0023071712,0.0013740296,0.00068188,0.00729384],"category_scores_gemma":[0.004906318,0.00043800258,0.00091163605,0.002150894,0.0022434667,0.0056387368,0.001781846,0.0014730422,0.00046824882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042731053,0.00009584085,0.0067053563,0.00046068843,0.00008788981,0.00016811996,0.00056521466,0.026599238,0.009627948,0.90062845,0.0048741885,0.04975978],"study_design_scores_gemma":[0.000041353294,0.00015641454,0.0043024253,0.000093405346,0.00010377981,0.00052249327,0.00034964047,0.04958812,0.0070615546,0.9245584,0.013158957,0.00006345754],"about_ca_topic_score_codex":0.0009473672,"about_ca_topic_score_gemma":0.0012845839,"teacher_disagreement_score":0.00729384,"about_ca_system_score_codex":0.0017447012,"about_ca_system_score_gemma":0.00059836614,"threshold_uncertainty_score":0.024400353},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83379936,0.0004053296,0.1230484,0.0011350423,0.00010911879,0.000061441286,0.0004774065,0.00040890448,0.040555064],"genre_scores_gemma":[0.9598846,0.00018259686,0.034507364,0.00025496344,0.000050957296,0.0000436424,0.0004005454,0.000043767697,0.004631497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992387,0.00012843894,0.00005211373,0.00025016378,0.00014734686,0.00018323069],"domain_scores_gemma":[0.9983942,0.00064291625,0.00027927844,0.00032021082,0.00015415016,0.00020922697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005014555,0.00035613714,0.0003912387,0.00080149947,0.0013724099,0.0011551937,0.00070493144,0.0006848785,0.0045384057],"category_scores_gemma":[0.0019979123,0.00030590955,0.0006852115,0.00083139155,0.0018999903,0.0025834881,0.0016192603,0.00095854246,0.0005844223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034148773,0.00009690306,0.003178096,0.00014864061,0.00002450252,0.00026862306,0.000559014,0.0052305455,0.013519047,0.94419765,0.0028797386,0.029555755],"study_design_scores_gemma":[0.000053415773,0.00013882773,0.0013883654,0.000033444307,0.000041485153,0.00081520167,0.00026620185,0.022333065,0.010865449,0.9541474,0.009872364,0.000044796085],"about_ca_topic_score_codex":0.0008033479,"about_ca_topic_score_gemma":0.00079205324,"teacher_disagreement_score":0.0045384057,"about_ca_system_score_codex":0.00073205883,"about_ca_system_score_gemma":0.0005399804,"threshold_uncertainty_score":0.015182495},"labels":[],"label_agreement":null},{"id":"W4391127623","doi":"10.61091/ars156-1","title":"Radio Antipodal Labeling of Mongolian Tent and Torus Grid Graphs","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"SSN College of Engineering","keywords":"Antipodal point; Torus; Mathematics; Grid; Combinatorics; Geometry","score_opus":0.012926107791912875,"score_gpt":0.2251847969094647,"score_spread":0.2122586891175518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127623","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97387064,0.000102713195,0.018650126,0.00009664908,0.000009780452,0.00001302131,0.00024007996,0.0000496217,0.0069673597],"genre_scores_gemma":[0.98098826,0.000094603776,0.016335798,0.000025502213,0.000008696914,0.000022495453,0.00036417885,0.000014250299,0.0021462059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99986815,0.000030333764,0.00000867775,0.00003173181,0.000020176736,0.000040931547],"domain_scores_gemma":[0.9993795,0.0002658604,0.00013387081,0.000089316774,0.000049917788,0.00008147507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019514778,0.00015055592,0.00022023731,0.0005067791,0.0005923525,0.00062166475,0.00038973632,0.00030519438,0.0020170817],"category_scores_gemma":[0.00089665817,0.0001769927,0.00017917108,0.00038822947,0.00053284044,0.0008288556,0.0004853364,0.00026439887,0.00017591791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011613857,0.00019340245,0.03330696,0.0004025736,0.00006449254,0.0006427043,0.001889915,0.09591389,0.050813984,0.705758,0.0075457655,0.102306984],"study_design_scores_gemma":[0.000118538075,0.0004187353,0.024397152,0.00008113878,0.000075850905,0.0017735037,0.0015806358,0.38104233,0.023416419,0.5329892,0.03404046,0.00006606238],"about_ca_topic_score_codex":0.0010893304,"about_ca_topic_score_gemma":0.0017085774,"teacher_disagreement_score":0.0020170817,"about_ca_system_score_codex":0.0006311036,"about_ca_system_score_gemma":0.0003164701,"threshold_uncertainty_score":0.006747782},"labels":[],"label_agreement":null},{"id":"W4391127629","doi":"10.61091/ars156-2","title":"Further Results on Radio Number of Wedge sum of Graphs","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wedge (geometry); Combinatorics; Discrete mathematics; Geometry","score_opus":0.01695318783950207,"score_gpt":0.25242533733964795,"score_spread":0.2354721495001459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127629","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80482775,0.0011481756,0.15409304,0.00029889485,0.00006917289,0.000044912733,0.00084806926,0.0007200114,0.037949953],"genre_scores_gemma":[0.9511923,0.0004941885,0.040678494,0.00012841859,0.00008956303,0.0000760514,0.0014975268,0.0002630748,0.0055803163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995173,0.00008137044,0.000021057222,0.00012029832,0.00014620624,0.000113768925],"domain_scores_gemma":[0.99855417,0.00066724233,0.00025042813,0.00021041316,0.00013319583,0.00018449112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045124933,0.00055298075,0.00044746557,0.0019193398,0.00063576724,0.00093000237,0.0010161588,0.00034624353,0.004994255],"category_scores_gemma":[0.003033846,0.0002537022,0.00065088324,0.0012833585,0.00096095284,0.0020090463,0.0011556349,0.00081193744,0.00051734323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007056393,0.00029706286,0.03932593,0.0008923529,0.00016180218,0.001145729,0.0016802646,0.1532589,0.04325174,0.62573004,0.010909714,0.1226409],"study_design_scores_gemma":[0.000059497543,0.00042376434,0.029344387,0.00011905757,0.0001948841,0.002304703,0.00080662436,0.42311162,0.025340283,0.4841866,0.034011006,0.000097620774],"about_ca_topic_score_codex":0.0006888378,"about_ca_topic_score_gemma":0.0006909308,"teacher_disagreement_score":0.004994255,"about_ca_system_score_codex":0.0005312187,"about_ca_system_score_gemma":0.00023716199,"threshold_uncertainty_score":0.01670742},"labels":[],"label_agreement":null},{"id":"W4391127630","doi":"10.61091/ars156-6","title":"Royal Colorings of Graphs","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.014004832174625573,"score_gpt":0.22815570783966613,"score_spread":0.21415087566504054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23254558,0.0053551267,0.40693608,0.0035144587,0.0014010937,0.0001781284,0.0016569266,0.0012958554,0.34711665],"genre_scores_gemma":[0.81703675,0.0032668596,0.13272144,0.001232184,0.0011466487,0.00016779009,0.0011644076,0.00049229315,0.04277161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976882,0.00059541356,0.00014824113,0.00051183003,0.0005413135,0.0005151258],"domain_scores_gemma":[0.9944258,0.0025250912,0.0007274377,0.0011101753,0.0005959999,0.0006155477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016446164,0.0007222198,0.0007170403,0.0020745234,0.0018657341,0.0035283607,0.0010027708,0.0009044623,0.007985463],"category_scores_gemma":[0.005773167,0.00076992996,0.001153942,0.0016011305,0.0043760478,0.004492819,0.0025272751,0.002407244,0.0020011114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005481191,0.000012220304,0.0002816162,0.00007846496,0.000008960215,0.000047301586,0.0002543077,0.002764796,0.0012788987,0.98011094,0.003990311,0.011117227],"study_design_scores_gemma":[0.000021437556,0.000028463488,0.00039121904,0.00003516884,0.000011651085,0.00020199396,0.00015246053,0.0075644585,0.0011558112,0.9614724,0.028937425,0.00002764578],"about_ca_topic_score_codex":0.0014858001,"about_ca_topic_score_gemma":0.0017249368,"teacher_disagreement_score":0.007985463,"about_ca_system_score_codex":0.0024395124,"about_ca_system_score_gemma":0.0007599222,"threshold_uncertainty_score":0.026714087},"labels":[],"label_agreement":null},{"id":"W4391127631","doi":"10.61091/ars156-4","title":"A Note on Distance Irregular Labeling of Graphs","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.013396903220207557,"score_gpt":0.24255414817006432,"score_spread":0.22915724494985676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38325876,0.0077757905,0.4768943,0.0063852696,0.001588507,0.00007701348,0.0008963372,0.0008803612,0.12224366],"genre_scores_gemma":[0.893838,0.0031078379,0.09333038,0.00074198673,0.0008112221,0.000045547265,0.0004976981,0.00015582104,0.007471525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992705,0.00019647107,0.00004162072,0.00019925545,0.00019805167,0.000094093426],"domain_scores_gemma":[0.9972248,0.0014309869,0.00028052885,0.0005092905,0.00027927713,0.00027509686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006805018,0.00037702243,0.00048958475,0.0013790854,0.001174557,0.0011503767,0.0006773104,0.00074311876,0.0029350468],"category_scores_gemma":[0.0037362985,0.00029325258,0.0005016338,0.002313392,0.0017087489,0.0031385482,0.0013158213,0.0018458026,0.00042554128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089164576,0.000035745048,0.004195262,0.00016822093,0.000020545065,0.00025748712,0.00060355855,0.012194218,0.005348306,0.93151146,0.0059307273,0.039645344],"study_design_scores_gemma":[0.0000092206,0.000082610655,0.002778847,0.000039936513,0.000021641681,0.0006727138,0.00039062614,0.03396017,0.002493513,0.9212003,0.038311522,0.000038976916],"about_ca_topic_score_codex":0.0013286872,"about_ca_topic_score_gemma":0.0010652939,"teacher_disagreement_score":0.0029350468,"about_ca_system_score_codex":0.001050637,"about_ca_system_score_gemma":0.0003101696,"threshold_uncertainty_score":0.009818733},"labels":[],"label_agreement":null},{"id":"W4391127632","doi":"10.61091/ars156-5","title":"Equitable Edge Coloring of Splitting Graph of Some Classes of Wheel Graphs","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Edge coloring; Enhanced Data Rates for GSM Evolution; Graph coloring; Combinatorics; Graph; Line graph; Computer science; Graph power; Artificial intelligence","score_opus":0.023230566677458306,"score_gpt":0.25226463351926687,"score_spread":0.22903406684180855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127632","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8681142,0.00018384073,0.114799574,0.00019074364,0.000028564093,0.000045078414,0.00042337843,0.0001432007,0.016071422],"genre_scores_gemma":[0.973683,0.00012199308,0.022929925,0.000044118,0.000013644836,0.000035418416,0.0005187733,0.000040336537,0.002612821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995321,0.000081993814,0.000025333922,0.00013825345,0.000082241204,0.00014010769],"domain_scores_gemma":[0.99899656,0.0002983499,0.00017295993,0.0002162391,0.00016379546,0.00015217294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028934068,0.00027086315,0.00029444968,0.0008792878,0.0010041973,0.00076078915,0.00054130895,0.00035404935,0.003645696],"category_scores_gemma":[0.001223574,0.00022661385,0.00026418368,0.0006702077,0.0006311806,0.001414465,0.0005663567,0.00048332053,0.00017831738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009277692,0.00034978046,0.032900088,0.00030379806,0.00008394675,0.001080245,0.0015624284,0.0884122,0.06958037,0.6631275,0.008030363,0.13364147],"study_design_scores_gemma":[0.000089505986,0.00017797694,0.021723576,0.000057340734,0.000074385454,0.0015277518,0.0011956245,0.3118364,0.029789105,0.6083359,0.025123762,0.00006862964],"about_ca_topic_score_codex":0.002480983,"about_ca_topic_score_gemma":0.0038321232,"teacher_disagreement_score":0.003645696,"about_ca_system_score_codex":0.0008486996,"about_ca_system_score_gemma":0.00041548547,"threshold_uncertainty_score":0.012196064},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8436005,0.0011678558,0.10796589,0.0006540013,0.000074831994,0.000084326406,0.00090492726,0.00024747546,0.04530017],"genre_scores_gemma":[0.9564158,0.00077486393,0.0372176,0.00013831102,0.00007204946,0.00007440294,0.000762208,0.00005404238,0.004490717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920636,0.00016826593,0.00004614045,0.00019325317,0.00016573939,0.00022034599],"domain_scores_gemma":[0.99716175,0.0015100817,0.0004811611,0.0003474826,0.000224824,0.00027475986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005424362,0.0005552031,0.00047434506,0.001442004,0.0012685504,0.0016692574,0.0006591213,0.0006275504,0.0027830284],"category_scores_gemma":[0.002490245,0.00048061303,0.00055724796,0.0015279918,0.0018850304,0.0024307568,0.001163019,0.0009980353,0.0003332743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043692318,0.000064798594,0.0039354693,0.00024204263,0.000030887437,0.00040741448,0.0006212883,0.019116156,0.008924248,0.929838,0.002688095,0.03369455],"study_design_scores_gemma":[0.00006013084,0.00011203011,0.0020925002,0.00006417385,0.00003861848,0.0007486327,0.00045198086,0.033276923,0.0047240336,0.946112,0.012278244,0.000040815856],"about_ca_topic_score_codex":0.0011865048,"about_ca_topic_score_gemma":0.0015122563,"teacher_disagreement_score":0.0027830284,"about_ca_system_score_codex":0.0008980416,"about_ca_system_score_gemma":0.00051421253,"threshold_uncertainty_score":0.009310186},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6890906,0.002917058,0.25734022,0.0033568637,0.00014813548,0.000054772667,0.0009833019,0.00049539434,0.045613587],"genre_scores_gemma":[0.96833974,0.001019597,0.023632439,0.0002316676,0.00024577888,0.00005801873,0.000519777,0.00013143783,0.005821527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769884,0.00068784173,0.00008586849,0.0006321847,0.00058039586,0.00031481872],"domain_scores_gemma":[0.9808384,0.013863355,0.0012865529,0.0018712807,0.00090122514,0.0012391434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013855228,0.0006133137,0.0010333379,0.0024987285,0.0020661042,0.00519771,0.0015750643,0.0014548461,0.005240594],"category_scores_gemma":[0.011636135,0.000900387,0.0009894548,0.0028315883,0.0039880467,0.007649196,0.0037006633,0.0036255985,0.0005607517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009699679,0.00002015985,0.001449319,0.00013111443,0.000034257624,0.000071993745,0.00038164444,0.009351356,0.0020838869,0.9760134,0.0012725333,0.009093314],"study_design_scores_gemma":[0.000015679472,0.000020593283,0.0008074004,0.000030058383,0.000018099516,0.00018410796,0.00015026584,0.025308918,0.001403323,0.9688487,0.0031911412,0.000021743832],"about_ca_topic_score_codex":0.0012608501,"about_ca_topic_score_gemma":0.0013980623,"teacher_disagreement_score":0.005240594,"about_ca_system_score_codex":0.0023301623,"about_ca_system_score_gemma":0.0006153895,"threshold_uncertainty_score":0.017531514},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5710056,0.0009863484,0.366357,0.0006290181,0.0000973379,0.000076607656,0.0012892897,0.0003845739,0.059174333],"genre_scores_gemma":[0.90821606,0.0010216605,0.07146681,0.00022072857,0.00007863469,0.00007078469,0.001007178,0.0001417932,0.017776283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995523,0.00009293945,0.000016966822,0.00012639476,0.00009862672,0.00011275981],"domain_scores_gemma":[0.99885714,0.00054471416,0.00009319716,0.00018349239,0.00020132793,0.00012001679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042533726,0.00039443249,0.00035600242,0.000908349,0.0009058448,0.0012441931,0.0004720996,0.0002778685,0.0033105607],"category_scores_gemma":[0.0010809633,0.00021881566,0.00033054673,0.0014289566,0.00091298594,0.0012896709,0.00062902167,0.00056912814,0.00025246604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016340213,0.00005846135,0.0046528475,0.00029890522,0.000066576125,0.00021898153,0.0007118615,0.052909825,0.020842452,0.8717433,0.0069047892,0.041428495],"study_design_scores_gemma":[0.000041999607,0.000121732184,0.003691992,0.000050221424,0.00007456655,0.00079355587,0.0004942134,0.1485517,0.0110248,0.7975114,0.037607323,0.00003643738],"about_ca_topic_score_codex":0.002380016,"about_ca_topic_score_gemma":0.003563374,"teacher_disagreement_score":0.0033105607,"about_ca_system_score_codex":0.0013272883,"about_ca_system_score_gemma":0.0006759591,"threshold_uncertainty_score":0.01107496},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4380216,0.0055767084,0.3850803,0.0036480394,0.0010852717,0.0001559066,0.0013776468,0.0020224003,0.16303204],"genre_scores_gemma":[0.84880096,0.0041275234,0.11432923,0.0005736311,0.0009098045,0.00022694562,0.00088124943,0.0008525875,0.029298058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986683,0.00026174303,0.00007119504,0.00033438578,0.0003990488,0.00026528488],"domain_scores_gemma":[0.99366885,0.0042989515,0.00038097278,0.00068916084,0.0005546876,0.0004074084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002110534,0.0011908523,0.0011036242,0.0024201332,0.0013618013,0.0034418635,0.000898863,0.0008445442,0.012653042],"category_scores_gemma":[0.016590074,0.0004143161,0.0007795113,0.0017661403,0.002928714,0.0066113453,0.0022373123,0.0014874438,0.0021897305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004570229,0.00007411273,0.0028714233,0.0005700384,0.00006552975,0.000536003,0.0005357533,0.024300307,0.014022021,0.8323666,0.009895622,0.1143056],"study_design_scores_gemma":[0.000023451135,0.00009932445,0.0012979127,0.00012658861,0.000046665245,0.00075368525,0.00013170768,0.029281484,0.008569516,0.947523,0.012096226,0.000050482715],"about_ca_topic_score_codex":0.00068862445,"about_ca_topic_score_gemma":0.0007065308,"teacher_disagreement_score":0.012653042,"about_ca_system_score_codex":0.0012181202,"about_ca_system_score_gemma":0.0009868179,"threshold_uncertainty_score":0.042328656},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18852286,0.00020600672,0.7965213,0.0005856805,0.00007869471,0.00007900633,0.00025792106,0.00013248937,0.013616011],"genre_scores_gemma":[0.70859325,0.00033014276,0.28312767,0.00021959619,0.00008334613,0.00013189757,0.0003943031,0.000067676745,0.007052106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994166,0.0001578366,0.00003135101,0.00018367816,0.000149285,0.00006135052],"domain_scores_gemma":[0.99829227,0.00075004797,0.00024157943,0.00023549989,0.00031570462,0.00016483512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007453336,0.00035745488,0.00054640224,0.0014197951,0.0015254718,0.0014522044,0.00064464455,0.0009808247,0.0026904538],"category_scores_gemma":[0.0030560887,0.00030038485,0.0007242199,0.0011089905,0.001680873,0.0030823012,0.0010688346,0.0013479687,0.00030665562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060831917,0.00002931429,0.0008452944,0.000055075212,0.000012771643,0.00018351317,0.0002543875,0.019938858,0.0033631038,0.94977224,0.0012189472,0.024265703],"study_design_scores_gemma":[0.000013598751,0.000025975773,0.00042725576,0.000019250407,0.000012529824,0.00019873049,0.00014436236,0.19439453,0.0018431776,0.79877913,0.004119944,0.000021551232],"about_ca_topic_score_codex":0.0017307979,"about_ca_topic_score_gemma":0.0016255094,"teacher_disagreement_score":0.0026904538,"about_ca_system_score_codex":0.00094253203,"about_ca_system_score_gemma":0.0005065326,"threshold_uncertainty_score":0.00900048},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27378267,0.0050815833,0.62430626,0.0039577717,0.00019696112,0.000109642526,0.00039335707,0.00031011843,0.09186165],"genre_scores_gemma":[0.86504656,0.0037903802,0.121770896,0.00041896166,0.00035510998,0.000115489805,0.00028293268,0.00012910916,0.008090494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958354,0.00016385624,0.000016909135,0.00011540606,0.00006727187,0.00005292601],"domain_scores_gemma":[0.99875724,0.0006784187,0.0002008947,0.00013178088,0.00009719248,0.00013460731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006718155,0.0004962852,0.0004738997,0.0021549053,0.0013045786,0.0020061543,0.00072437036,0.0012340877,0.0028409448],"category_scores_gemma":[0.0026907455,0.00030876874,0.0007310375,0.0017294259,0.0030791056,0.0041425633,0.00140534,0.0012875869,0.00030464263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006308515,0.000006254779,0.0003763496,0.00002571044,0.0000024389733,0.00004057198,0.00014534332,0.003993044,0.0002360467,0.9888132,0.0006582805,0.0056964676],"study_design_scores_gemma":[0.0000028306106,0.000014971188,0.00027470174,0.000027657292,0.0000049290747,0.00017430226,0.0001977263,0.024041928,0.000264939,0.965737,0.009249983,0.000009059501],"about_ca_topic_score_codex":0.0018539962,"about_ca_topic_score_gemma":0.0013602757,"teacher_disagreement_score":0.0028409448,"about_ca_system_score_codex":0.0015852102,"about_ca_system_score_gemma":0.00049309543,"threshold_uncertainty_score":0.01150161},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019407958,0.011448092,0.03471437,0.0030351826,0.0014513955,0.00006651566,0.0005331181,0.00056980114,0.94624066],"genre_scores_gemma":[0.08539575,0.030414455,0.07091561,0.004010793,0.0035763509,0.00034529803,0.0024116924,0.0011365458,0.8017935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993375,0.000151433,0.000029272282,0.00013764955,0.000282814,0.00006125896],"domain_scores_gemma":[0.99912745,0.0003991679,0.000025347415,0.00019164929,0.00018479855,0.00007151576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006255052,0.0011566062,0.0007757361,0.0022155622,0.0018200437,0.0036884644,0.0014484051,0.0014062545,0.12708029],"category_scores_gemma":[0.003177908,0.00043444472,0.00085842854,0.0030304198,0.0012723786,0.003021356,0.0023413452,0.0028957548,0.03722624],"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.000018432693,0.00003015646,0.00010969103,0.000247128,0.000008698406,0.00011227408,0.00012964092,0.0012402282,0.0004893024,0.7661548,0.11262363,0.118835956],"study_design_scores_gemma":[0.000004710768,0.000009063484,0.00012261461,0.000118812466,0.00000476747,0.00037963886,0.00006571643,0.001146572,0.0002508063,0.3631469,0.6347432,0.0000072678454],"about_ca_topic_score_codex":0.00096560415,"about_ca_topic_score_gemma":0.0013871745,"teacher_disagreement_score":0.12708029,"about_ca_system_score_codex":0.0019624962,"about_ca_system_score_gemma":0.0007737395,"threshold_uncertainty_score":0.42512596},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4237282,0.0033462197,0.5137674,0.009028798,0.000500482,0.0006805749,0.0053791134,0.0033150094,0.04025427],"genre_scores_gemma":[0.8478982,0.0010211263,0.13087115,0.0010420987,0.00041807207,0.00059150363,0.0041586314,0.0010290742,0.012970142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99322,0.0016716566,0.00036325844,0.0017124645,0.0013389478,0.0016936245],"domain_scores_gemma":[0.96189916,0.028657913,0.0019793415,0.0042642653,0.0014702604,0.0017289942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003920944,0.0020775008,0.003130306,0.0011152299,0.0018904597,0.0045635593,0.006548491,0.0035093396,0.014980351],"category_scores_gemma":[0.030541878,0.0011643564,0.001689499,0.003130553,0.0025256262,0.012722636,0.005503057,0.004454696,0.0020122104],"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.0036682084,0.00089365145,0.0036259806,0.0014004847,0.00022579753,0.0006301598,0.0010752209,0.65426075,0.0067574023,0.1961238,0.034345444,0.096993096],"study_design_scores_gemma":[0.00021625645,0.00014942407,0.00024448137,0.00004631216,0.000039836825,0.00013221698,0.00010201417,0.8124862,0.0018377365,0.18265358,0.0020625764,0.00002932236],"about_ca_topic_score_codex":0.004264499,"about_ca_topic_score_gemma":0.0032374908,"teacher_disagreement_score":0.014980351,"about_ca_system_score_codex":0.0052549215,"about_ca_system_score_gemma":0.0039832424,"threshold_uncertainty_score":0.050114274},"labels":[],"label_agreement":null},{"id":"W4394793194","doi":"10.61091/ars158-06","title":"Component Intersection Graph of Finite Dimensional Vector Spaces","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Intersection graph; Clique graph; Intersection (aeronautics); Graph; Vector space; Connected component; Discrete mathematics; Intersection number; Block graph; Line graph; Graph power; Pure mathematics; Geometry; 1-planar graph","score_opus":0.011640247785428864,"score_gpt":0.22800729992271804,"score_spread":0.21636705213728918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394793194","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6486082,0.00074019877,0.3238181,0.00049875944,0.0000822454,0.000074925294,0.00082708016,0.00042384784,0.024926707],"genre_scores_gemma":[0.9476489,0.000412933,0.046623647,0.00009101167,0.000045083616,0.000095307216,0.0010333437,0.000073331204,0.0039764172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932253,0.00013886328,0.00003122257,0.00018251094,0.00020024975,0.00012467631],"domain_scores_gemma":[0.998398,0.0006133538,0.00029223366,0.00017102879,0.000321722,0.00020371568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028519038,0.0004388815,0.0005085008,0.0020488903,0.001329874,0.0020270313,0.0009709413,0.0005025328,0.0034912475],"category_scores_gemma":[0.0017146784,0.00024799095,0.00036975244,0.0029427665,0.0013719453,0.0029091865,0.0012999289,0.00092383963,0.0003448254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107077445,0.000044755234,0.002409862,0.000090536785,0.000027847893,0.00017999021,0.00037200045,0.010866933,0.003559457,0.96023816,0.001593908,0.020509424],"study_design_scores_gemma":[0.000020135649,0.00010413795,0.0035074994,0.000043445118,0.000042934218,0.0006110776,0.0005443105,0.12652911,0.0062101567,0.8445568,0.017778855,0.0000515594],"about_ca_topic_score_codex":0.0020032017,"about_ca_topic_score_gemma":0.0011283251,"teacher_disagreement_score":0.0034912475,"about_ca_system_score_codex":0.0011053318,"about_ca_system_score_gemma":0.0005073775,"threshold_uncertainty_score":0.011679411},"labels":[],"label_agreement":null},{"id":"W4394793212","doi":"10.61091/ars158-02","title":"\\((d,1)\\)-Total Labelling of Generalized Petersen Graphs \\(P(n,k)\\)","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Labelling; Mathematics; Combinatorics; Chemistry","score_opus":0.01254218486588947,"score_gpt":0.23351784059567426,"score_spread":0.22097565572978478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394793212","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95987326,0.00015844115,0.019363772,0.00025493323,0.000032235537,0.00003211029,0.0004271417,0.000098871584,0.019759307],"genre_scores_gemma":[0.9739275,0.00019927758,0.019540137,0.000119540266,0.000020957761,0.00006892335,0.00079874747,0.00005615926,0.0052687414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995328,0.00010093203,0.000024088711,0.0001241966,0.00008399972,0.00013402344],"domain_scores_gemma":[0.998211,0.000854725,0.00033455156,0.0002701917,0.00014014258,0.00018937583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043523815,0.00032922585,0.0002817868,0.0009252685,0.0017449762,0.0014742237,0.00060569256,0.00066776073,0.0041421345],"category_scores_gemma":[0.0016343568,0.00032991488,0.0004607293,0.0008537296,0.0012633969,0.0015932522,0.00097333465,0.00064840785,0.00035382883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007484516,0.00022158904,0.033876047,0.0005910176,0.00009027407,0.0009160859,0.0014620874,0.035691,0.059849817,0.78724277,0.009113239,0.07019761],"study_design_scores_gemma":[0.00013942193,0.00028981947,0.028486384,0.0001216337,0.00016357772,0.003929435,0.0023230098,0.13226138,0.059367597,0.7291105,0.04369273,0.00011457297],"about_ca_topic_score_codex":0.000872358,"about_ca_topic_score_gemma":0.0018992499,"teacher_disagreement_score":0.0041421345,"about_ca_system_score_codex":0.0008606907,"about_ca_system_score_gemma":0.0005016187,"threshold_uncertainty_score":0.013856828},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8311787,0.0004816653,0.14905797,0.0006401694,0.00004253341,0.00006462788,0.0012244823,0.00056474394,0.016745174],"genre_scores_gemma":[0.97170883,0.0002239029,0.024486305,0.00009699033,0.00003357207,0.000053775144,0.0008628123,0.00012714435,0.0024066358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914515,0.00013609926,0.000035480087,0.00032557535,0.00016495485,0.00019275524],"domain_scores_gemma":[0.99300486,0.0036941003,0.00093902304,0.0012485384,0.00037705686,0.0007364567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008409102,0.0005855165,0.000630594,0.0014250408,0.00097602623,0.002281753,0.0016754487,0.00068012316,0.0031854908],"category_scores_gemma":[0.005720016,0.00043693374,0.00064121955,0.001119455,0.0020406477,0.0026002254,0.0014929118,0.0012341235,0.0002905606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010060376,0.00014333848,0.016912159,0.00042287834,0.00010740767,0.00019995258,0.0009881444,0.16976269,0.03998346,0.7188463,0.0065748733,0.045052793],"study_design_scores_gemma":[0.0000990807,0.00021792448,0.010078653,0.00008654245,0.00009328459,0.0005813179,0.00043206447,0.31708506,0.02103755,0.63942784,0.010785251,0.000075434014],"about_ca_topic_score_codex":0.0026713337,"about_ca_topic_score_gemma":0.004093311,"teacher_disagreement_score":0.0032927964,"about_ca_system_score_codex":0.0032927964,"about_ca_system_score_gemma":0.00086274464,"threshold_uncertainty_score":0.023891032},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4983096,0.001467126,0.47350693,0.005367407,0.00023491237,0.00036154647,0.0030924843,0.0026551555,0.015004819],"genre_scores_gemma":[0.84312254,0.0009065739,0.14583156,0.0006830825,0.0001708278,0.00032413835,0.0030144146,0.00073532516,0.005211559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99525625,0.001512404,0.00024709007,0.0011663175,0.00087480067,0.00094308873],"domain_scores_gemma":[0.96907884,0.02300368,0.0022396946,0.00337508,0.0012637209,0.0010390179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031694751,0.0013212891,0.0016599228,0.0011237598,0.0012014637,0.0030281849,0.004375871,0.002450848,0.0067705433],"category_scores_gemma":[0.023602536,0.001155001,0.0016784566,0.0017763983,0.0016537234,0.007686706,0.00221736,0.0022251045,0.0009860698],"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.0011868434,0.00029777316,0.0037261427,0.00048608723,0.00023782073,0.00028880013,0.00024708794,0.849271,0.0063229534,0.07367877,0.010684282,0.053572457],"study_design_scores_gemma":[0.00007981296,0.00007940853,0.00076234585,0.00001705806,0.0000504527,0.00015044908,0.000076227894,0.92784,0.0016466278,0.067885794,0.0013907229,0.000021079146],"about_ca_topic_score_codex":0.005247116,"about_ca_topic_score_gemma":0.0054161213,"teacher_disagreement_score":0.0067705433,"about_ca_system_score_codex":0.00409572,"about_ca_system_score_gemma":0.0024214033,"threshold_uncertainty_score":0.02971667},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7706375,0.0016122181,0.20214999,0.0007269366,0.00012909243,0.00012308244,0.0030800514,0.0009781931,0.020562975],"genre_scores_gemma":[0.9264376,0.00036783528,0.0679406,0.00013455888,0.00005068921,0.000084953164,0.002487415,0.00008108305,0.0024153246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994474,0.00007242467,0.000028043169,0.00013597551,0.00018820517,0.00012799348],"domain_scores_gemma":[0.997957,0.00070409157,0.0003002238,0.00026561393,0.0004956948,0.00027730752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035505186,0.00060779083,0.00053913135,0.0038366981,0.00094366237,0.0014211418,0.0012841694,0.0008637395,0.002821235],"category_scores_gemma":[0.0058532814,0.0003049911,0.0005849596,0.0036795838,0.00084496563,0.0017388669,0.0014437181,0.00089440553,0.00030617623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006115412,0.00027053436,0.027905673,0.000831982,0.00012846824,0.0012880098,0.0011051848,0.27331585,0.009045246,0.4612946,0.023165038,0.20103794],"study_design_scores_gemma":[0.00003427676,0.00007834978,0.0070183813,0.000049291597,0.00002437641,0.0005095773,0.00046711427,0.7408599,0.001820551,0.23698884,0.012085885,0.00006339762],"about_ca_topic_score_codex":0.011656581,"about_ca_topic_score_gemma":0.009954138,"teacher_disagreement_score":0.011656581,"about_ca_system_score_codex":0.0014668928,"about_ca_system_score_gemma":0.0007401127,"threshold_uncertainty_score":0.023177445},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9346875,0.0006151374,0.038165484,0.00021684596,0.000039026785,0.000019505644,0.0005079082,0.00013838704,0.025610203],"genre_scores_gemma":[0.9838786,0.0002959419,0.0139905615,0.00006303472,0.00003469915,0.000021806729,0.00030482083,0.00003901353,0.0013715604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974436,0.000030900443,0.000015410644,0.000078558725,0.000068742345,0.00006203801],"domain_scores_gemma":[0.999158,0.0003345673,0.00015522617,0.00008385603,0.000095093135,0.00017325717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023755597,0.00025952273,0.0002846292,0.0015989953,0.0007974359,0.0011938922,0.0004471528,0.00031145618,0.002234643],"category_scores_gemma":[0.0012669681,0.00023828894,0.0002783848,0.0007181872,0.0011984486,0.0019740371,0.0008090841,0.0006568484,0.00031434116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019553705,0.000043483495,0.003130749,0.00010858519,0.000013101352,0.0002204613,0.0008000345,0.0052975314,0.02645528,0.93943995,0.0022372461,0.022057928],"study_design_scores_gemma":[0.000037294347,0.00005766684,0.0045722234,0.000059340582,0.00002029533,0.0007454105,0.0006802014,0.02944581,0.015690219,0.93931973,0.009324561,0.00004726169],"about_ca_topic_score_codex":0.00045110163,"about_ca_topic_score_gemma":0.0004371958,"teacher_disagreement_score":0.002234643,"about_ca_system_score_codex":0.0005140329,"about_ca_system_score_gemma":0.00026953468,"threshold_uncertainty_score":0.0074756145},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86384225,0.00029216168,0.099103294,0.0003106756,0.00006456096,0.000056183617,0.0011864254,0.0004175473,0.034727015],"genre_scores_gemma":[0.95147157,0.00018070808,0.039814584,0.00007275924,0.000030315352,0.000062306484,0.0013778516,0.000120592405,0.0068694293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964535,0.000040476152,0.0000132685245,0.00012309362,0.00006945437,0.00010834687],"domain_scores_gemma":[0.999479,0.00014391204,0.000083562554,0.00006578828,0.000110298264,0.0001174194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002303448,0.0004274411,0.00028086413,0.0020617505,0.001180869,0.0018033457,0.0007698426,0.000534172,0.0057831546],"category_scores_gemma":[0.0011557434,0.00024964634,0.00038393596,0.0013822621,0.0009355129,0.0015286541,0.0006216043,0.00054595637,0.00066763855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012805698,0.00016674332,0.019543828,0.00028137,0.00008582925,0.00065612776,0.0012138336,0.06712094,0.061464526,0.756702,0.012309807,0.079174384],"study_design_scores_gemma":[0.00010734135,0.00022017329,0.013916817,0.000091880574,0.00008936338,0.00081229565,0.0010268731,0.29351276,0.031686984,0.6315457,0.026870975,0.000118848446],"about_ca_topic_score_codex":0.008201688,"about_ca_topic_score_gemma":0.0077339793,"teacher_disagreement_score":0.008201688,"about_ca_system_score_codex":0.002000345,"about_ca_system_score_gemma":0.0010380395,"threshold_uncertainty_score":0.019346535},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7913759,0.000233694,0.17771819,0.0002669993,0.00003756721,0.000061301434,0.0002618859,0.00030467904,0.029739812],"genre_scores_gemma":[0.94474655,0.00014811441,0.047127455,0.000119410506,0.000032355092,0.00012492352,0.00042553825,0.00011213033,0.007163561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891186,0.00021963372,0.00006353272,0.00036017003,0.00022648225,0.0002182652],"domain_scores_gemma":[0.9978624,0.00080911565,0.00035816262,0.00044414465,0.00026476104,0.00026140886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080609246,0.00022901683,0.0003630475,0.0012278049,0.0017748036,0.0011845445,0.00075789326,0.0004734895,0.0033395388],"category_scores_gemma":[0.002922277,0.000596706,0.00072178425,0.0009073396,0.0017167251,0.0023610855,0.00199006,0.0007634683,0.00032729367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001733091,0.000042053547,0.003378349,0.000054285996,0.000029832889,0.00049490156,0.001946691,0.0048313593,0.008043567,0.9600174,0.0009043025,0.020084154],"study_design_scores_gemma":[0.00005212084,0.00011781803,0.0042735236,0.00006120626,0.00008893101,0.0009600006,0.0019398836,0.04474844,0.013985789,0.9105299,0.023187472,0.000054995795],"about_ca_topic_score_codex":0.0014409828,"about_ca_topic_score_gemma":0.0017161148,"teacher_disagreement_score":0.0033395388,"about_ca_system_score_codex":0.0010348142,"about_ca_system_score_gemma":0.00042482387,"threshold_uncertainty_score":0.011171818},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8316994,0.00050161657,0.13842097,0.0012723838,0.000095199226,0.00003705137,0.000468503,0.00025712987,0.027247734],"genre_scores_gemma":[0.94642085,0.00035397432,0.046652835,0.0002790102,0.00010436413,0.000044481032,0.00045488556,0.00006234316,0.005627272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975747,0.00006575561,0.000011644937,0.00006293286,0.00004412539,0.00005811851],"domain_scores_gemma":[0.9991461,0.00027517776,0.00017107012,0.00015272222,0.0001232922,0.00013170148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029596305,0.00022406659,0.0003336574,0.00072578725,0.0013269319,0.000768858,0.00042451642,0.0006956172,0.002591231],"category_scores_gemma":[0.0015335432,0.0002007142,0.0004374597,0.0005705427,0.0007842959,0.0015079639,0.0006387268,0.0007615112,0.00022574261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016736989,0.000058680846,0.0039346577,0.00010239364,0.000022834627,0.00034864803,0.00057744543,0.019011544,0.010513371,0.9287694,0.0059007267,0.030593041],"study_design_scores_gemma":[0.000019282541,0.000059667374,0.0031346076,0.000017187218,0.000020597477,0.00044878406,0.00037522457,0.086416095,0.0030378327,0.89698124,0.009466092,0.000023487504],"about_ca_topic_score_codex":0.0013065421,"about_ca_topic_score_gemma":0.001488425,"teacher_disagreement_score":0.002591231,"about_ca_system_score_codex":0.00081328134,"about_ca_system_score_gemma":0.0003791443,"threshold_uncertainty_score":0.008668482},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42622668,0.00060953526,0.5311974,0.0010981779,0.00015530488,0.00010828759,0.00052154314,0.0006020388,0.039481066],"genre_scores_gemma":[0.9436374,0.00025451346,0.04702761,0.00026281527,0.000051158724,0.0001033339,0.0002755229,0.00010193036,0.008285738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991605,0.00014210482,0.00006374089,0.00020777692,0.00022575383,0.00020022418],"domain_scores_gemma":[0.99758685,0.0011273207,0.00030451687,0.00060917775,0.0002006587,0.00017144746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008565318,0.0003025191,0.00034802148,0.0007902827,0.001138571,0.0014436617,0.0005215928,0.0007346376,0.0037253224],"category_scores_gemma":[0.0035578841,0.0002002602,0.00056995463,0.0008439815,0.0025440701,0.0028587244,0.0017884448,0.001383964,0.00053178536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010331471,0.000020451953,0.0005648207,0.00005126633,0.000005378553,0.00009511482,0.00025275646,0.0036741146,0.0041739317,0.97110206,0.00080703537,0.01914966],"study_design_scores_gemma":[0.0000308866,0.00008225515,0.00035435765,0.00004121417,0.000013234491,0.0003774687,0.00015501112,0.017291108,0.013725238,0.9556283,0.012263945,0.000037103247],"about_ca_topic_score_codex":0.0003996746,"about_ca_topic_score_gemma":0.00033236557,"teacher_disagreement_score":0.0037253224,"about_ca_system_score_codex":0.0013173305,"about_ca_system_score_gemma":0.00056735787,"threshold_uncertainty_score":0.012462437},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32428023,0.0009780796,0.21883827,0.0047889235,0.0004195296,0.00015624241,0.0030420925,0.0015244109,0.4459722],"genre_scores_gemma":[0.8013567,0.0012725504,0.07963733,0.0011311639,0.00031202773,0.00018016736,0.0042212056,0.00077388546,0.11111499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935335,0.00012654591,0.000030022882,0.00015918755,0.00013922041,0.0001916133],"domain_scores_gemma":[0.99816906,0.0008061174,0.00017186782,0.00034682083,0.00024738678,0.0002588142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041001337,0.0006569019,0.00056193245,0.0013585233,0.0028054044,0.0042722975,0.0012334707,0.0012401503,0.026875615],"category_scores_gemma":[0.0023278156,0.0005918688,0.00071792444,0.001996273,0.0013870213,0.004303855,0.0022058906,0.0026712103,0.004564855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098782606,0.00006610513,0.0007327495,0.00008199549,0.000007082876,0.00007437625,0.00024372712,0.0012699529,0.0020857307,0.95774275,0.013751843,0.023844954],"study_design_scores_gemma":[0.000026020347,0.000012688442,0.00043649253,0.000027455982,0.000019989266,0.00017218791,0.00023829649,0.005261777,0.0023353267,0.97129244,0.020163605,0.000013726387],"about_ca_topic_score_codex":0.001989493,"about_ca_topic_score_gemma":0.003448679,"teacher_disagreement_score":0.026875615,"about_ca_system_score_codex":0.0017243384,"about_ca_system_score_gemma":0.0008407011,"threshold_uncertainty_score":0.089907885},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4020138,0.0006718483,0.55755776,0.000603202,0.00009549942,0.0001653885,0.0016888671,0.0008674933,0.03633608],"genre_scores_gemma":[0.7728491,0.00094607397,0.20835733,0.00028855223,0.00013342862,0.00034914867,0.0026735985,0.00036164108,0.014041224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847955,0.00031168383,0.00012874173,0.00041900066,0.00041970954,0.00024131825],"domain_scores_gemma":[0.99477804,0.002638205,0.0006148503,0.00091651146,0.00068091095,0.00037140897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011002943,0.0007211923,0.00078047905,0.002445575,0.0014591292,0.002512215,0.0010539095,0.000857519,0.004423739],"category_scores_gemma":[0.00711113,0.00067568093,0.0010962277,0.0028687173,0.0017447942,0.003412857,0.0018937421,0.00097035087,0.00059508055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026028126,0.00005457612,0.0028103378,0.00031762908,0.00006128381,0.0001692846,0.00057742535,0.04117219,0.0066608624,0.874101,0.0048904843,0.068924606],"study_design_scores_gemma":[0.0000406651,0.000079229765,0.00079973147,0.00006055201,0.00003948044,0.00029903397,0.0002393972,0.07865536,0.004232873,0.9042321,0.011290478,0.00003117569],"about_ca_topic_score_codex":0.001224659,"about_ca_topic_score_gemma":0.0015611323,"teacher_disagreement_score":0.004423739,"about_ca_system_score_codex":0.0015012894,"about_ca_system_score_gemma":0.00084001326,"threshold_uncertainty_score":0.01479888},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32977477,0.0018898355,0.33509114,0.002421281,0.00083361106,0.00050446554,0.0049285647,0.0015490236,0.32300738],"genre_scores_gemma":[0.8079943,0.0012066336,0.12970662,0.0011069261,0.00024867852,0.00028575538,0.0031918227,0.0001247084,0.056134593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941015,0.00009746976,0.00005049499,0.00021828203,0.00010430426,0.000119347074],"domain_scores_gemma":[0.99825484,0.0004851071,0.0002407569,0.0002531648,0.0004034904,0.00036263835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040366393,0.00041294162,0.0003457501,0.0012672795,0.0014952795,0.0017594553,0.00066886935,0.00064634776,0.01194883],"category_scores_gemma":[0.0024990886,0.00027882602,0.00037519672,0.00117751,0.0011028475,0.00222251,0.0012846721,0.0010863412,0.0014851736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001257237,0.000052634037,0.0011284379,0.00015823473,0.000015642681,0.00037113336,0.00044255337,0.002585296,0.004343976,0.9349448,0.0071315253,0.04870007],"study_design_scores_gemma":[0.000047974307,0.00009703404,0.0012530253,0.00006793437,0.000035818604,0.0009143832,0.00027853117,0.016187495,0.0039032362,0.86594415,0.11123183,0.00003858496],"about_ca_topic_score_codex":0.0014412057,"about_ca_topic_score_gemma":0.0025800706,"teacher_disagreement_score":0.01194883,"about_ca_system_score_codex":0.0014472276,"about_ca_system_score_gemma":0.00048988184,"threshold_uncertainty_score":0.039972782},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3869099,0.00074716046,0.5104896,0.00072144443,0.00068288506,0.00018150442,0.0009516103,0.0013930767,0.09792293],"genre_scores_gemma":[0.78119594,0.00025285507,0.20372891,0.0004345545,0.00007872995,0.00021778229,0.0007710258,0.00013520618,0.013185024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941313,0.0001466865,0.000057737037,0.00012968898,0.00012095919,0.00013179588],"domain_scores_gemma":[0.9988826,0.0003450691,0.00023176256,0.0002381223,0.0001722727,0.00013017797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036407934,0.00043575247,0.00033195678,0.0004369798,0.0006518827,0.0010359732,0.0006795326,0.0005070316,0.0069151064],"category_scores_gemma":[0.0018417037,0.00038062097,0.00034708763,0.00058282976,0.00086451805,0.0012019755,0.0011316335,0.0005526151,0.001384581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009090924,0.000084008774,0.0016635332,0.00031651516,0.00004044763,0.0011976052,0.00034222877,0.010538841,0.10412849,0.7664305,0.013671878,0.10067684],"study_design_scores_gemma":[0.000486378,0.0012425678,0.0030570345,0.00017728462,0.00010011128,0.004601495,0.0007320321,0.115368865,0.17388266,0.5102274,0.18986613,0.0002580015],"about_ca_topic_score_codex":0.00034400896,"about_ca_topic_score_gemma":0.0004926078,"teacher_disagreement_score":0.0069151064,"about_ca_system_score_codex":0.00026203264,"about_ca_system_score_gemma":0.00050266937,"threshold_uncertainty_score":0.023133278},"labels":[],"label_agreement":null},{"id":"W4400512457","doi":"10.61091/ars159-08","title":"Super Edge-magic Total Strength of Some Unicyclic Graphs","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Bijection; MAGIC (telescope); Simple graph; Graph; Vertex (graph theory); Conjecture; Discrete mathematics; Physics; Quantum mechanics","score_opus":0.009943952473893777,"score_gpt":0.22997066693811213,"score_spread":0.22002671446421834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400512457","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9477513,0.00030674238,0.02522373,0.0002988533,0.000020610614,0.000031465912,0.0005096776,0.00013090557,0.025726868],"genre_scores_gemma":[0.9870842,0.00017300883,0.01043434,0.00008294462,0.000022660339,0.000031318334,0.0004155743,0.000026022957,0.0017298077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996494,0.0000646415,0.000026232154,0.00009746093,0.00009209323,0.00007015966],"domain_scores_gemma":[0.9979163,0.0007793558,0.00045091248,0.00019457586,0.00032198505,0.00033688277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038026136,0.00026889553,0.0003177038,0.0014624699,0.00072937546,0.00069796393,0.0005039654,0.00035239427,0.0027059333],"category_scores_gemma":[0.002081448,0.00032292042,0.0003398719,0.0011579137,0.0007938267,0.0009907674,0.0006175537,0.0006498341,0.00016236768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007412351,0.00009564055,0.01984453,0.00061024923,0.0001991027,0.0010317921,0.0013436902,0.0232294,0.07747977,0.7979189,0.0049887123,0.072517045],"study_design_scores_gemma":[0.00016513129,0.00041648452,0.027867517,0.00012568253,0.0003125732,0.0039101844,0.0010087782,0.11832136,0.034143377,0.788451,0.02514635,0.00013150644],"about_ca_topic_score_codex":0.00080787495,"about_ca_topic_score_gemma":0.0012740156,"teacher_disagreement_score":0.0027059333,"about_ca_system_score_codex":0.000567323,"about_ca_system_score_gemma":0.00031521954,"threshold_uncertainty_score":0.009052217},"labels":[],"label_agreement":null},{"id":"W4400512525","doi":"10.61091/ars159-11","title":"Graceful Labellings of Variable Windmills Using Skolem-type Sequences","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Type (biology); Mathematics; Graph; Combinatorics; Discrete mathematics; Computer science; Geology","score_opus":0.019184589989957968,"score_gpt":0.25428148416126767,"score_spread":0.2350968941713097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400512525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2871679,0.00029439974,0.66200584,0.0005624908,0.00026278693,0.00008888512,0.00024955472,0.0010867433,0.048281383],"genre_scores_gemma":[0.82892865,0.0003093761,0.15010862,0.00034637118,0.00010443531,0.00015477711,0.00041472557,0.0005780229,0.019055009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992017,0.00019233534,0.000049722963,0.0002094575,0.00018884365,0.00015799151],"domain_scores_gemma":[0.99821305,0.00072516926,0.0002172862,0.00042983543,0.00019876592,0.00021595742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008763804,0.000565318,0.00038309125,0.0011277325,0.0018759774,0.0015380174,0.00090410555,0.00094019243,0.005474641],"category_scores_gemma":[0.002949222,0.0005573106,0.0009836142,0.00068748486,0.0025556607,0.003995533,0.0019328383,0.0021479595,0.0010887987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000613224,0.000021285447,0.00042915362,0.000040262687,0.0000058312057,0.00016424645,0.0004330472,0.0036201675,0.0049899286,0.9809795,0.00074193854,0.008513266],"study_design_scores_gemma":[0.000012254227,0.000034152614,0.00019513103,0.000035680732,0.0000092355285,0.00016427261,0.00015229086,0.0118564665,0.0058896155,0.97238886,0.009230735,0.000031264404],"about_ca_topic_score_codex":0.0006625762,"about_ca_topic_score_gemma":0.0010787377,"teacher_disagreement_score":0.005474641,"about_ca_system_score_codex":0.0010380455,"about_ca_system_score_gemma":0.00047548683,"threshold_uncertainty_score":0.01831448},"labels":[],"label_agreement":null},{"id":"W4400513417","doi":"10.61091/ars159-04","title":"\\(4\\)-Total Prime Cordial Labeling of Some Derived Graphs","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Prime (order theory); Combinatorics","score_opus":0.010543433514159846,"score_gpt":0.2301129023131489,"score_spread":0.21956946879898906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400513417","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8423026,0.00028480895,0.09062988,0.00044987598,0.000050354247,0.000053600386,0.00039432017,0.00026738003,0.0655671],"genre_scores_gemma":[0.93510884,0.00033649322,0.04758648,0.00014497452,0.000039515246,0.00004573853,0.00080754183,0.00006776525,0.01586269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998666,0.000023773244,0.000007660638,0.000045697743,0.0000251729,0.00003108242],"domain_scores_gemma":[0.9997037,0.00007949092,0.000049432965,0.000055039174,0.00006198001,0.000050304698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014903859,0.00017440143,0.00018517047,0.00039249423,0.00089618244,0.0005575938,0.00033618,0.00026074867,0.0030629856],"category_scores_gemma":[0.0005368742,0.00011599552,0.00023547684,0.00050857593,0.0005294954,0.00082732126,0.00043836306,0.0004695137,0.00028691423],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011807136,0.00005671445,0.0035088458,0.0001656247,0.000014783706,0.00042648436,0.000672446,0.0075792833,0.017826576,0.9178281,0.0035694186,0.048233747],"study_design_scores_gemma":[0.00005580434,0.00012284012,0.0051115486,0.000049508322,0.00007820788,0.0012639988,0.0005706065,0.059046127,0.029296365,0.8384324,0.06593482,0.000037797625],"about_ca_topic_score_codex":0.0014070803,"about_ca_topic_score_gemma":0.0020655065,"teacher_disagreement_score":0.0030629856,"about_ca_system_score_codex":0.0009047786,"about_ca_system_score_gemma":0.00037692633,"threshold_uncertainty_score":0.010246754},"labels":[],"label_agreement":null},{"id":"W4400513463","doi":"10.61091/ars159-02","title":"Computing Edge Irregularity Strength of Star and Banana Trees Using Algorithmic Approach","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Star (game theory); Enhanced Data Rates for GSM Evolution; Tree (set theory); Combinatorics; Computer science; Artificial intelligence; Mathematical analysis","score_opus":0.018458059347602654,"score_gpt":0.24229526607082805,"score_spread":0.22383720672322538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400513463","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5359907,0.00033835223,0.4528656,0.00019565433,0.000033556666,0.000076425065,0.0003299185,0.00071074464,0.009459037],"genre_scores_gemma":[0.80424297,0.00016497647,0.19296297,0.00006146469,0.000018248425,0.000059733255,0.0007810962,0.000079076606,0.0016294315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.999539,0.000060284936,0.000029002313,0.00012990697,0.00016644441,0.00007537694],"domain_scores_gemma":[0.9981267,0.0008795496,0.00025878864,0.00021495909,0.0004019593,0.00011806451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052001886,0.0003696104,0.00043438261,0.002030243,0.0006442871,0.0011259827,0.00066566485,0.00056250155,0.0019362755],"category_scores_gemma":[0.003947225,0.00025682518,0.0004847125,0.0014306089,0.00067612564,0.0017198381,0.00074153236,0.00057582144,0.00026363466],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007702,0.00026026435,0.041495647,0.0004890486,0.000107851214,0.00063891354,0.0007663987,0.33990148,0.044745933,0.26506433,0.005506238,0.30025378],"study_design_scores_gemma":[0.000020753074,0.00015466746,0.0051570376,0.000027506103,0.00003776571,0.00040824406,0.00024274085,0.891742,0.011416904,0.087007575,0.0037566568,0.000028133723],"about_ca_topic_score_codex":0.0019399419,"about_ca_topic_score_gemma":0.0032944933,"teacher_disagreement_score":0.002030243,"about_ca_system_score_codex":0.0006732932,"about_ca_system_score_gemma":0.0006150541,"threshold_uncertainty_score":0.006477535},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8352185,0.00140508,0.0692746,0.027436117,0.0006361946,0.00035293517,0.004517153,0.0018253035,0.059334073],"genre_scores_gemma":[0.9713747,0.0005787611,0.014906409,0.0015138409,0.0006919881,0.00022409097,0.0028808697,0.0005033049,0.0073259524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965222,0.0010597107,0.00016096729,0.001007434,0.0006015261,0.0006481676],"domain_scores_gemma":[0.92253774,0.06510727,0.003857371,0.0039360286,0.0017034995,0.0028581102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035683517,0.00239054,0.0038808528,0.0025880062,0.005423763,0.009414061,0.005235749,0.0061940257,0.016626809],"category_scores_gemma":[0.03222279,0.0029187223,0.0026714138,0.0033912158,0.010016922,0.015144989,0.005800288,0.01033773,0.0018237499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030656545,0.0009551935,0.0073718354,0.0011591594,0.00035153417,0.0009603515,0.0010901991,0.088501185,0.007614697,0.82845974,0.040212616,0.020257814],"study_design_scores_gemma":[0.0003113926,0.00007891256,0.0009725197,0.00005531395,0.000043559336,0.00030007624,0.00034930216,0.043697372,0.0014211673,0.95099175,0.0017247624,0.000053792395],"about_ca_topic_score_codex":0.0028270453,"about_ca_topic_score_gemma":0.0030816318,"teacher_disagreement_score":0.016626809,"about_ca_system_score_codex":0.0034923707,"about_ca_system_score_gemma":0.0030383754,"threshold_uncertainty_score":0.05562222},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9358215,0.00032399342,0.04105134,0.00040444813,0.000052636587,0.000035215468,0.00041002172,0.00014636996,0.021754567],"genre_scores_gemma":[0.9821669,0.00016856586,0.01499765,0.000051573505,0.000050928535,0.000034415534,0.0004232666,0.000029729108,0.0020769024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992324,0.00011205971,0.000050714112,0.00027324745,0.0001741499,0.00015745079],"domain_scores_gemma":[0.99545896,0.0025240893,0.0005537918,0.0005797681,0.0002476734,0.0006357059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005403813,0.0003078499,0.0004932285,0.0011701409,0.0013531658,0.0014644915,0.0007818394,0.00081839977,0.003085327],"category_scores_gemma":[0.003481561,0.0003002314,0.0006336404,0.00075307215,0.002113179,0.0025906393,0.0015238872,0.0011025612,0.000293513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006681334,0.0001997273,0.02452638,0.0002660019,0.000055376015,0.00047500213,0.0012854686,0.016689202,0.04459527,0.86296284,0.0038049633,0.04447168],"study_design_scores_gemma":[0.00008958776,0.00026401563,0.01457524,0.000041526193,0.00010999208,0.0019087363,0.000592255,0.09089197,0.02905106,0.84613013,0.016252998,0.00009252929],"about_ca_topic_score_codex":0.00046250195,"about_ca_topic_score_gemma":0.0004950202,"teacher_disagreement_score":0.003085327,"about_ca_system_score_codex":0.0014042385,"about_ca_system_score_gemma":0.0004606419,"threshold_uncertainty_score":0.010321379},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17484394,0.00047313547,0.7515212,0.0010517928,0.000416706,0.00018016486,0.000579636,0.0011097286,0.0698236],"genre_scores_gemma":[0.85210687,0.0006786726,0.12155332,0.0005100546,0.000243012,0.00019484185,0.00077997794,0.00037197166,0.023561276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991357,0.00021395762,0.000029055043,0.00022617508,0.00022007672,0.00017508671],"domain_scores_gemma":[0.99858236,0.00045499922,0.0001169761,0.00044994432,0.00026594137,0.00012976359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005843315,0.00049429334,0.00035317856,0.00084144564,0.0011118408,0.0015330053,0.0008320255,0.0005894582,0.007210768],"category_scores_gemma":[0.0021871398,0.00034055105,0.0006137488,0.0011602599,0.0017463579,0.0032212164,0.0015263574,0.0013465849,0.001008957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005970985,0.000030954503,0.00044791016,0.000059646445,0.000011138701,0.00008178307,0.00020349817,0.0072284495,0.0041029295,0.95932156,0.0034211366,0.025031356],"study_design_scores_gemma":[0.000021813023,0.000043781612,0.00041215582,0.000015118059,0.000015833348,0.0002110779,0.0001733675,0.029788064,0.003954272,0.94181025,0.023535118,0.000019083825],"about_ca_topic_score_codex":0.0014040907,"about_ca_topic_score_gemma":0.0021207198,"teacher_disagreement_score":0.007210768,"about_ca_system_score_codex":0.0016409509,"about_ca_system_score_gemma":0.0009069809,"threshold_uncertainty_score":0.024122417},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.771925,0.0014335403,0.18262097,0.0018746008,0.000112752474,0.00007789791,0.00063015136,0.0002965698,0.041028634],"genre_scores_gemma":[0.88275474,0.0011908201,0.10453777,0.00043329518,0.00009473185,0.00011836094,0.0008647782,0.00008122937,0.0099243475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959224,0.00011535645,0.000027081403,0.00010116508,0.000083255254,0.00008094859],"domain_scores_gemma":[0.9986339,0.0009146878,0.00015162093,0.00009209114,0.00010241112,0.00010527475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050758285,0.0003039064,0.00044236012,0.0013377017,0.0019599865,0.0015195343,0.00055577676,0.0010008629,0.0035059198],"category_scores_gemma":[0.0028750845,0.00047035742,0.0003659474,0.0016725329,0.001176618,0.0027529371,0.0010923024,0.00085547264,0.00042137862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006106218,0.000036714515,0.0010318191,0.00008518978,0.0000101745745,0.0001429016,0.00042724586,0.0098480545,0.0030604568,0.9619229,0.0033361432,0.0200374],"study_design_scores_gemma":[0.000013383552,0.000012510751,0.00038951443,0.000018528684,0.0000074558834,0.000114609786,0.00015445365,0.020914378,0.0008727406,0.97367203,0.0038230196,0.0000074284317],"about_ca_topic_score_codex":0.0014313407,"about_ca_topic_score_gemma":0.0021085388,"teacher_disagreement_score":0.0035059198,"about_ca_system_score_codex":0.0011494122,"about_ca_system_score_gemma":0.0005600327,"threshold_uncertainty_score":0.011728466},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8448182,0.00052760256,0.12868193,0.0013615298,0.000067493456,0.0001568118,0.00040192046,0.0002884609,0.023696078],"genre_scores_gemma":[0.96722925,0.00027215565,0.026697025,0.00019330131,0.00003958159,0.00007334904,0.00032334146,0.00006476982,0.0051072473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985121,0.0005219717,0.0000783173,0.0002981023,0.00019050219,0.00039909824],"domain_scores_gemma":[0.99009025,0.0073248683,0.00081001496,0.0006676314,0.00037054977,0.0007365577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011556911,0.0008662579,0.0009866294,0.0012005366,0.0016427798,0.002171348,0.0015771316,0.001717334,0.0039594127],"category_scores_gemma":[0.010127353,0.00053422136,0.0007407015,0.001154086,0.003158405,0.0048919567,0.0016876694,0.0016138346,0.0003618585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009069778,0.00016555924,0.0076813176,0.00024021784,0.00009142265,0.00047150618,0.0012531253,0.140589,0.005262935,0.8106755,0.005455567,0.027206995],"study_design_scores_gemma":[0.000093732684,0.0001104935,0.001198346,0.000054260217,0.000038275077,0.00022910959,0.00034900906,0.33301064,0.00268131,0.6588727,0.0033082536,0.00005380906],"about_ca_topic_score_codex":0.006657922,"about_ca_topic_score_gemma":0.004329849,"teacher_disagreement_score":0.006657922,"about_ca_system_score_codex":0.0029459149,"about_ca_system_score_gemma":0.0010178374,"threshold_uncertainty_score":0.021374226},"labels":[],"label_agreement":null},{"id":"W4403165685","doi":"10.61091/ars-160-15","title":"On Detour Index of Join of Hamilton-connected Graphs","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Join (topology); Mathematics; Index (typography); Combinatorics; Computer science; World Wide Web","score_opus":0.009935465471465751,"score_gpt":0.22702169703484976,"score_spread":0.217086231563384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165685","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6004817,0.0018712295,0.31650636,0.00051757245,0.00017541055,0.000068012596,0.00048308505,0.00026568587,0.0796309],"genre_scores_gemma":[0.9672034,0.000629487,0.025907977,0.00008559145,0.00013553872,0.00006382491,0.0002982627,0.00010749577,0.005568347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955755,0.000096722644,0.000019877612,0.00007953874,0.00016454332,0.000081717684],"domain_scores_gemma":[0.9971584,0.0017137261,0.00033719276,0.00021122364,0.00022801985,0.00035137276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068478164,0.0003166213,0.0004768721,0.0023408118,0.0010899315,0.0013859345,0.0010324494,0.000745436,0.0065775653],"category_scores_gemma":[0.004338071,0.00016700735,0.00030218472,0.0013680134,0.0015521434,0.0033066391,0.0015732506,0.0012472181,0.0006108627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118963486,0.000040101142,0.0016814199,0.00010300539,0.000010351436,0.00009991149,0.00028646138,0.016001223,0.0040020263,0.9598761,0.0013563293,0.016424134],"study_design_scores_gemma":[0.0000143646785,0.00006094816,0.0013877283,0.00003051007,0.000012456539,0.00014740521,0.00023247268,0.10657766,0.0030511788,0.8841409,0.004318463,0.000025863228],"about_ca_topic_score_codex":0.0007005078,"about_ca_topic_score_gemma":0.00087184657,"teacher_disagreement_score":0.0065775653,"about_ca_system_score_codex":0.0010855895,"about_ca_system_score_gemma":0.00029785253,"threshold_uncertainty_score":0.022004128},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8230009,0.0006620888,0.1662801,0.0006072384,0.000074841366,0.00008486374,0.0003064137,0.00013963526,0.00884387],"genre_scores_gemma":[0.8966031,0.00050519436,0.09899341,0.00018744639,0.000033008095,0.000064358675,0.00034728422,0.000059668786,0.0032065394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993832,0.00016564182,0.000039119197,0.00018657013,0.00008822788,0.0001372508],"domain_scores_gemma":[0.99818146,0.00092334155,0.00032111345,0.00020494049,0.0001264759,0.0002426056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008049503,0.0004082227,0.0005427165,0.0009990518,0.0012024181,0.0011030944,0.0007777842,0.0008475719,0.0018731118],"category_scores_gemma":[0.0029430953,0.00027784042,0.0005642457,0.0011193921,0.0017511819,0.0019295261,0.00077670807,0.0008250079,0.00017046693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012340111,0.00037972792,0.017863475,0.0008860865,0.00012723562,0.00097739,0.0020432232,0.18023662,0.08109285,0.62955225,0.0063233115,0.07928385],"study_design_scores_gemma":[0.0000948428,0.0002891738,0.00900079,0.00009026638,0.00012723217,0.0010848502,0.00080843805,0.27773345,0.021355078,0.6791116,0.010210419,0.000093882154],"about_ca_topic_score_codex":0.0017523259,"about_ca_topic_score_gemma":0.0018877524,"teacher_disagreement_score":0.0018731118,"about_ca_system_score_codex":0.0014107723,"about_ca_system_score_gemma":0.0005463741,"threshold_uncertainty_score":0.010235906},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4978098,0.0008094413,0.46886107,0.0005349264,0.00006482676,0.000059774207,0.00020381447,0.00014813303,0.031508166],"genre_scores_gemma":[0.9291879,0.0006923617,0.06382249,0.00011004721,0.00007698536,0.000090834976,0.000346685,0.0001309323,0.005541863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996871,0.00009415671,0.000009924204,0.00005084007,0.000116025105,0.000041932915],"domain_scores_gemma":[0.99811125,0.0012670705,0.00020405163,0.00016223623,0.00016612632,0.000089343564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000805793,0.00039147562,0.00038768654,0.0016544675,0.00058865285,0.0011240157,0.00061249506,0.0005801412,0.0045405477],"category_scores_gemma":[0.003952793,0.00018978507,0.00047110475,0.001112513,0.0014826985,0.0029047276,0.0010646487,0.00073738326,0.00043347466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059292397,0.00004803449,0.0016984398,0.0000781049,0.000015360185,0.00012635022,0.00024553947,0.06975924,0.0025901387,0.90246624,0.0010860699,0.021827262],"study_design_scores_gemma":[0.000008876033,0.000044121218,0.002031255,0.000026933902,0.0000072569296,0.00021001235,0.00024481828,0.27939752,0.0014936341,0.71382356,0.002681524,0.000030627234],"about_ca_topic_score_codex":0.0005113393,"about_ca_topic_score_gemma":0.0006108953,"teacher_disagreement_score":0.0045405477,"about_ca_system_score_codex":0.00041599394,"about_ca_system_score_gemma":0.0002756807,"threshold_uncertainty_score":0.015189588},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43586907,0.0030743813,0.50640154,0.0014378807,0.00040313648,0.00016534011,0.0020685084,0.0006894501,0.04989074],"genre_scores_gemma":[0.92803955,0.0010785231,0.061802335,0.00033424795,0.00028783243,0.00015176935,0.0011867812,0.000083076964,0.007035746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889743,0.00019763138,0.00009235672,0.00031793027,0.00034490114,0.00014973445],"domain_scores_gemma":[0.99764866,0.00078102463,0.0005785651,0.00027905844,0.00044238413,0.0002702497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004841683,0.00052128336,0.0004697655,0.0021644589,0.00082443224,0.0020360888,0.00074889173,0.0005138282,0.0025939064],"category_scores_gemma":[0.0038323523,0.00027671666,0.0005198806,0.0014690071,0.0016689299,0.0029429751,0.0014899777,0.0010376154,0.00035074793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012387217,0.000023272538,0.0011966808,0.00013908383,0.000035765697,0.00018109304,0.00041106946,0.03185883,0.003534534,0.92862034,0.0030030634,0.030872487],"study_design_scores_gemma":[0.000022764698,0.0000904005,0.0010525091,0.00002935048,0.000024454886,0.00046167156,0.00016270012,0.06578714,0.0018906953,0.9113935,0.019043615,0.000041261665],"about_ca_topic_score_codex":0.001071692,"about_ca_topic_score_gemma":0.00061054056,"teacher_disagreement_score":0.0025939064,"about_ca_system_score_codex":0.0013936795,"about_ca_system_score_gemma":0.000451421,"threshold_uncertainty_score":0.010111868},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9719944,0.00036559397,0.019518185,0.00029366915,0.000026153486,0.000014069338,0.00031494052,0.00004324772,0.0074297693],"genre_scores_gemma":[0.9926634,0.00020899021,0.005670883,0.00003149424,0.000043401244,0.000017322733,0.000270456,0.000013511894,0.001080494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966073,0.000071375915,0.000017144372,0.00011560555,0.000070824244,0.000064367625],"domain_scores_gemma":[0.9982133,0.00074801897,0.00039629926,0.00012326887,0.00015538762,0.00036374858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036149716,0.00030968824,0.00044646347,0.0022551066,0.0009483927,0.0014511903,0.00059320783,0.0005460292,0.0020336243],"category_scores_gemma":[0.0021284828,0.00022040264,0.00037709522,0.0011214397,0.0015749548,0.0026406455,0.00092308427,0.0006261593,0.00011942774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026463027,0.00007358981,0.018692382,0.00018019081,0.000048867303,0.00025484143,0.0009496742,0.011543936,0.006592599,0.9340211,0.0026215096,0.024756612],"study_design_scores_gemma":[0.00004098052,0.00012800777,0.017093772,0.00003918452,0.000049336526,0.0010005421,0.00064998755,0.054039277,0.0045030713,0.9151918,0.0072066933,0.000057260742],"about_ca_topic_score_codex":0.0009465989,"about_ca_topic_score_gemma":0.00072150986,"teacher_disagreement_score":0.0022551066,"about_ca_system_score_codex":0.0011985359,"about_ca_system_score_gemma":0.00033658423,"threshold_uncertainty_score":0.00869596},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36411473,0.0014494002,0.55826044,0.0011673584,0.00032963933,0.0001869156,0.0015286431,0.0010640882,0.07189876],"genre_scores_gemma":[0.80254436,0.00080801407,0.17422122,0.00037403798,0.00036511352,0.00038056116,0.001385489,0.0002559,0.019665312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978143,0.0003903494,0.00019557876,0.0007794657,0.0005983887,0.00022186844],"domain_scores_gemma":[0.9958413,0.0016505219,0.0006154124,0.0007551244,0.0006557238,0.00048178562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080943265,0.0007857475,0.0008712079,0.0019157131,0.0014345351,0.0023846861,0.0016967771,0.00097500015,0.005508736],"category_scores_gemma":[0.005463854,0.00047544306,0.00081927486,0.0017635856,0.0020679277,0.004978451,0.0023186896,0.0015838742,0.0014760857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029085172,0.00007087622,0.0021215528,0.0003644822,0.000052396084,0.00022431165,0.00041789486,0.014525794,0.010446475,0.90346557,0.0046113883,0.063408405],"study_design_scores_gemma":[0.0000912392,0.00021902806,0.0017905036,0.00007282803,0.0000788041,0.0012691208,0.00021125162,0.051918447,0.009807395,0.8998193,0.0346393,0.00008280009],"about_ca_topic_score_codex":0.00041010114,"about_ca_topic_score_gemma":0.00040251,"teacher_disagreement_score":0.005508736,"about_ca_system_score_codex":0.0012174185,"about_ca_system_score_gemma":0.0005933396,"threshold_uncertainty_score":0.018428624},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81773597,0.0005455892,0.13075292,0.00068767497,0.00008441024,0.000065599226,0.00072748656,0.0003787912,0.049021486],"genre_scores_gemma":[0.95225453,0.00023341973,0.038497884,0.00014694751,0.000029237088,0.000034589986,0.00062820205,0.000057539542,0.008117686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997037,0.00005570692,0.000009147581,0.00009700294,0.00006455851,0.00006983742],"domain_scores_gemma":[0.9989832,0.00041223026,0.00011788106,0.00017307149,0.00014921046,0.00016434169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022264212,0.00020755491,0.00018883977,0.0005311433,0.0008171697,0.0011294278,0.00049124355,0.0003226453,0.003373044],"category_scores_gemma":[0.0013311533,0.00023585747,0.00022380397,0.00064451643,0.0007967611,0.0010447144,0.0006811007,0.00057791185,0.0002704098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031776866,0.00008239144,0.009694668,0.00015780726,0.00003534721,0.00030351873,0.0007765397,0.033645015,0.025516544,0.87120706,0.007857821,0.05040559],"study_design_scores_gemma":[0.00004480872,0.00013945188,0.007853024,0.000040305644,0.00003377563,0.0007771973,0.0005903768,0.13098754,0.011020181,0.81091094,0.037563972,0.000038331316],"about_ca_topic_score_codex":0.0028065597,"about_ca_topic_score_gemma":0.002633309,"teacher_disagreement_score":0.003373044,"about_ca_system_score_codex":0.001467822,"about_ca_system_score_gemma":0.0005378574,"threshold_uncertainty_score":0.011283994},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1565518,0.0017752126,0.5926599,0.0040579448,0.00032426475,0.0003674888,0.0023770742,0.0010128877,0.24087335],"genre_scores_gemma":[0.7770887,0.0019955267,0.18535297,0.0014113274,0.0003821092,0.0004666001,0.0023094227,0.00038926827,0.030604025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988005,0.0002820005,0.00005137237,0.00028676988,0.00034614716,0.00023331554],"domain_scores_gemma":[0.9969292,0.001639848,0.00022760205,0.0006928069,0.00032393757,0.00018656533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007817899,0.00058268924,0.0006986773,0.0013085172,0.0016928465,0.0021227794,0.0008971013,0.0012613456,0.00924371],"category_scores_gemma":[0.0055804546,0.00034275273,0.00031801502,0.002976344,0.0018155791,0.004126082,0.0021753106,0.0017094397,0.0012494744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014499936,0.00007231837,0.0007035674,0.0001371464,0.0000071687496,0.00013347664,0.00020519117,0.031965625,0.002289301,0.88864785,0.011482772,0.06421052],"study_design_scores_gemma":[0.00002669874,0.00003354084,0.0004876279,0.000059024533,0.000010228188,0.0002442778,0.00012430882,0.1270124,0.0018306967,0.8450297,0.025120866,0.000020691401],"about_ca_topic_score_codex":0.0035502415,"about_ca_topic_score_gemma":0.002972717,"teacher_disagreement_score":0.00924371,"about_ca_system_score_codex":0.0033139659,"about_ca_system_score_gemma":0.0009787243,"threshold_uncertainty_score":0.030923247},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93366945,0.00086598314,0.047028337,0.00049915625,0.00027275342,0.0000297355,0.00038707966,0.00093787746,0.016309513],"genre_scores_gemma":[0.98145753,0.00018782502,0.01411557,0.000049032333,0.00001281539,0.00002027081,0.00018369625,0.00011750259,0.0038557022],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998871,0.000017012795,0.0000032525395,0.000023553275,0.000042767628,0.000026257916],"domain_scores_gemma":[0.9997446,0.00014019817,0.000024884086,0.000041334348,0.000030621643,0.000018297455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015934055,0.00029152818,0.0003183657,0.00060914556,0.0008082726,0.00052007067,0.00045046755,0.0008746564,0.0063579073],"category_scores_gemma":[0.0004950452,0.0002367668,0.00029558377,0.00037787756,0.00049371156,0.00053336076,0.0002269027,0.0005482364,0.00048854516],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065665273,0.00007067057,0.0012119899,0.00079570926,0.00005375585,0.0015344252,0.00066146784,0.026673507,0.8714677,0.06826529,0.0026757226,0.02593314],"study_design_scores_gemma":[0.0000836675,0.00040690633,0.0077028885,0.00009704406,0.00007002806,0.00093640987,0.0005719883,0.11122509,0.8304041,0.024243,0.02413976,0.00011919891],"about_ca_topic_score_codex":0.0008728956,"about_ca_topic_score_gemma":0.001839368,"teacher_disagreement_score":0.0063579073,"about_ca_system_score_codex":0.0005604594,"about_ca_system_score_gemma":0.00021871264,"threshold_uncertainty_score":0.021269321},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22985756,0.0009679467,0.7318012,0.0009998863,0.00032246264,0.0003413474,0.003080526,0.012474042,0.020155028],"genre_scores_gemma":[0.46425796,0.00065511843,0.5179119,0.00048184954,0.000051884417,0.00034945266,0.005343623,0.001118922,0.009829236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962544,0.00006119486,0.000025658106,0.00009945484,0.000118723714,0.00006952986],"domain_scores_gemma":[0.9989311,0.00036169033,0.00009059374,0.00035453582,0.00018053576,0.0000815194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025033017,0.0005970098,0.0003535439,0.00075838447,0.0006014804,0.0008463387,0.0013327777,0.00048173833,0.0047569536],"category_scores_gemma":[0.0020220657,0.00027284518,0.00051518244,0.0011879202,0.0004265503,0.0019870668,0.0012196654,0.0007514449,0.001596286],"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.0009080716,0.00032442398,0.0049282257,0.0006540214,0.0001245602,0.00056997826,0.0006880675,0.2756155,0.06840976,0.0377997,0.055151574,0.55482614],"study_design_scores_gemma":[0.00009625277,0.00024597786,0.002240596,0.000057591526,0.000041541,0.00025888928,0.0005533735,0.84810764,0.050026868,0.05207759,0.04624526,0.000048367692],"about_ca_topic_score_codex":0.003433149,"about_ca_topic_score_gemma":0.009416089,"teacher_disagreement_score":0.0047569536,"about_ca_system_score_codex":0.00072121114,"about_ca_system_score_gemma":0.00080232596,"threshold_uncertainty_score":0.015913606},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8014751,0.0009178923,0.15168095,0.001367379,0.000083400795,0.00009560689,0.001969453,0.00026575435,0.042144407],"genre_scores_gemma":[0.9586698,0.00038554188,0.033203542,0.00024738317,0.000084763655,0.00012644197,0.0013825165,0.000056292978,0.00584368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949765,0.00010483488,0.00003361821,0.00017808522,0.000083620085,0.000102216596],"domain_scores_gemma":[0.9983032,0.00076561485,0.00034664586,0.00021453931,0.00015057129,0.00021939502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032343494,0.00035271826,0.00048674535,0.0009999003,0.001454186,0.0014510833,0.0006835479,0.00082762353,0.005428205],"category_scores_gemma":[0.0021261475,0.0004330121,0.0006747195,0.0011028843,0.0010504363,0.0024196233,0.0009934268,0.0010171555,0.0004265629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021037395,0.00007561864,0.0031934401,0.00028949906,0.000046577432,0.00028906317,0.00081069925,0.015976613,0.0127515355,0.9403735,0.007118268,0.018864686],"study_design_scores_gemma":[0.000050087194,0.00010033525,0.006229646,0.000053323238,0.00007954449,0.0012482014,0.00066146534,0.068481974,0.006702273,0.8992761,0.017071566,0.00004566458],"about_ca_topic_score_codex":0.0007104283,"about_ca_topic_score_gemma":0.001279567,"teacher_disagreement_score":0.005428205,"about_ca_system_score_codex":0.00077848724,"about_ca_system_score_gemma":0.00040210635,"threshold_uncertainty_score":0.018159151},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8053017,0.0023706618,0.1689382,0.0011883104,0.00008927045,0.00002556173,0.00062138593,0.00022588257,0.02123905],"genre_scores_gemma":[0.9838387,0.00049368024,0.013673113,0.00008621484,0.000094837415,0.000025919244,0.0001530469,0.000036726422,0.0015977303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930584,0.00016281627,0.00003365089,0.00020157076,0.00015760916,0.00013852897],"domain_scores_gemma":[0.99719894,0.0013389898,0.0004330692,0.00043262486,0.00023945108,0.00035698427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066963345,0.00046018392,0.0006672856,0.002152834,0.001058275,0.0019384522,0.00074933574,0.00059117144,0.002249761],"category_scores_gemma":[0.004306125,0.00027232122,0.000598296,0.0016437522,0.0023433408,0.0038217525,0.0015645227,0.0010711591,0.00016490891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008950145,0.000020558906,0.0028793435,0.000075404736,0.000027430324,0.000078665355,0.00031434165,0.0163169,0.0028955764,0.96508735,0.0012233288,0.010991512],"study_design_scores_gemma":[0.000011699886,0.00004562358,0.003041085,0.000023480214,0.000025898136,0.0002849079,0.00020502055,0.06795948,0.0020416803,0.92018855,0.0061370265,0.00003566969],"about_ca_topic_score_codex":0.001057287,"about_ca_topic_score_gemma":0.00076062564,"teacher_disagreement_score":0.002249761,"about_ca_system_score_codex":0.0017024186,"about_ca_system_score_gemma":0.00033165785,"threshold_uncertainty_score":0.01235193},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16160272,0.000475576,0.73256934,0.0013733283,0.00048564732,0.00012375605,0.00071063,0.001881005,0.10077813],"genre_scores_gemma":[0.82824945,0.00081852614,0.14566845,0.0010597446,0.00020008789,0.0001534929,0.0007853483,0.00051746186,0.022547407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930894,0.00009177101,0.000027353575,0.00021099695,0.0001873897,0.0001735516],"domain_scores_gemma":[0.99847,0.00044948436,0.00019490097,0.00045476604,0.00027336177,0.00015746921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006213336,0.00081791874,0.00045476068,0.0009260151,0.0012143701,0.0015282698,0.0014881309,0.00074024353,0.009506443],"category_scores_gemma":[0.00223545,0.00045015267,0.0011884952,0.0011366415,0.0023611248,0.0029809522,0.002699422,0.0024455332,0.0016443854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000837506,0.000059935708,0.0010123648,0.00018719418,0.000035874233,0.0004930254,0.00041489396,0.016033126,0.006162892,0.9302159,0.0092384415,0.036062654],"study_design_scores_gemma":[0.00006031037,0.00007690059,0.0010109236,0.000041235708,0.000059435228,0.0008193817,0.00025738103,0.08951298,0.013772846,0.85481757,0.03948486,0.000086087624],"about_ca_topic_score_codex":0.0079738675,"about_ca_topic_score_gemma":0.005596855,"teacher_disagreement_score":0.009506443,"about_ca_system_score_codex":0.00171784,"about_ca_system_score_gemma":0.0012902182,"threshold_uncertainty_score":0.031802177},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9370103,0.0010580795,0.036664978,0.00062356895,0.00011879307,0.00002473249,0.0006069614,0.0001283169,0.023764344],"genre_scores_gemma":[0.9864476,0.0005111546,0.009748137,0.00013108322,0.00012421544,0.000031005744,0.00042660884,0.000046566176,0.0025336673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992544,0.00015874291,0.000038180282,0.00019364158,0.00020697407,0.0001478682],"domain_scores_gemma":[0.99821585,0.0006050695,0.00035362574,0.00018788294,0.0002727691,0.00036473153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040106388,0.00044449474,0.00052746106,0.0015207538,0.0009191644,0.0019364755,0.0007095595,0.0004978803,0.0022562344],"category_scores_gemma":[0.0024346958,0.00031661495,0.0003922068,0.0011902382,0.0015758901,0.0019372348,0.0014357291,0.0011064205,0.00033280253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010978389,0.000031339117,0.0023156018,0.00007592001,0.000030897,0.0001463709,0.0005366767,0.0042865877,0.005151252,0.97305095,0.002864052,0.011400471],"study_design_scores_gemma":[0.000025783058,0.0000777749,0.0037318158,0.00002506326,0.000028864917,0.00043686538,0.0002688102,0.039547376,0.0026102473,0.94336975,0.009831013,0.000046564095],"about_ca_topic_score_codex":0.0017400815,"about_ca_topic_score_gemma":0.001093019,"teacher_disagreement_score":0.0022562344,"about_ca_system_score_codex":0.0011458015,"about_ca_system_score_gemma":0.00045225248,"threshold_uncertainty_score":0.008313358},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6197375,0.0016651311,0.21695806,0.0015912516,0.00016307052,0.0001092405,0.002281297,0.00031036377,0.15718415],"genre_scores_gemma":[0.9367581,0.0010905092,0.040834766,0.00022094799,0.00010254478,0.00015586219,0.0007580113,0.000119434975,0.01995988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999534,0.00008640004,0.000020641266,0.0001268484,0.000121779114,0.0001103862],"domain_scores_gemma":[0.9985116,0.00081630575,0.0001275071,0.00012219978,0.0002791824,0.00014326168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006135558,0.00036369724,0.000336681,0.0019861988,0.0011732102,0.0017869557,0.0006152921,0.00035056993,0.005135999],"category_scores_gemma":[0.0022817934,0.00028290474,0.00039243346,0.0016997884,0.0015917683,0.001856983,0.00070462923,0.0008282512,0.0003085292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005519471,0.000015886693,0.0015077218,0.00008352525,0.000021936334,0.00003845187,0.00027035765,0.010236446,0.0030634603,0.9695201,0.0032650211,0.011921921],"study_design_scores_gemma":[0.000017797038,0.000019090485,0.0017800299,0.000029209681,0.00001802378,0.00012027622,0.00018350835,0.028586032,0.0019422505,0.95385474,0.013425912,0.000023088587],"about_ca_topic_score_codex":0.002471017,"about_ca_topic_score_gemma":0.003582169,"teacher_disagreement_score":0.005135999,"about_ca_system_score_codex":0.0022337204,"about_ca_system_score_gemma":0.0007575719,"threshold_uncertainty_score":0.017181695},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31803232,0.0013539991,0.5201187,0.0018947028,0.00013856239,0.000082729435,0.0005974605,0.00033091428,0.15745063],"genre_scores_gemma":[0.86754704,0.0014829045,0.10500192,0.0005538343,0.00021755905,0.00013596722,0.0009773297,0.00023103229,0.023852365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989674,0.00031238917,0.000054570894,0.00027861918,0.00023621673,0.00015077367],"domain_scores_gemma":[0.9962134,0.0019365026,0.00035026946,0.00072952313,0.00048638636,0.00028393546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014356668,0.00045520504,0.00060482725,0.0013012716,0.0019351626,0.0014726776,0.000924493,0.0006388406,0.007833362],"category_scores_gemma":[0.004342588,0.000381223,0.0008407772,0.0016239354,0.0019201263,0.004435559,0.001803167,0.0022565704,0.0005961748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028951794,0.000027265034,0.00065316533,0.000057388886,0.000008306307,0.00005483428,0.00029224303,0.006458812,0.0011975873,0.98154193,0.0011301722,0.008549243],"study_design_scores_gemma":[0.000009672948,0.00001960612,0.0005594836,0.000021824284,0.000011710978,0.0001217702,0.00017239233,0.017643465,0.00096714904,0.968695,0.011766786,0.000011198132],"about_ca_topic_score_codex":0.0012744197,"about_ca_topic_score_gemma":0.0017282013,"teacher_disagreement_score":0.007833362,"about_ca_system_score_codex":0.001843611,"about_ca_system_score_gemma":0.00053273456,"threshold_uncertainty_score":0.026205182},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7301198,0.00079192885,0.12630984,0.0008136476,0.000182845,0.00011405487,0.0006907873,0.00058389833,0.14039315],"genre_scores_gemma":[0.9532271,0.00049248623,0.030161044,0.0001799416,0.00014432773,0.00006191566,0.00053113315,0.000096774325,0.015105357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937505,0.00008603901,0.000043916145,0.00023613739,0.00013526416,0.00012367553],"domain_scores_gemma":[0.9982828,0.0005600373,0.00034017093,0.000310248,0.00017735825,0.00032947425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004007677,0.00035094426,0.00032861152,0.0010029614,0.0009604728,0.0017955594,0.0004943831,0.00033944755,0.005983954],"category_scores_gemma":[0.0018733257,0.00019781193,0.00052685384,0.00096537493,0.0016008309,0.0017796957,0.0013396064,0.00094954006,0.00048817464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015236325,0.000053726646,0.0015439652,0.00012673516,0.000009531507,0.0003024219,0.0003716459,0.0035593503,0.01048408,0.94142985,0.0016225397,0.04034372],"study_design_scores_gemma":[0.000034769644,0.00020921537,0.0024400032,0.000032149608,0.000026397194,0.0013969997,0.00030682038,0.020029388,0.016589014,0.9306323,0.028268209,0.000034787718],"about_ca_topic_score_codex":0.0010144757,"about_ca_topic_score_gemma":0.0012115701,"teacher_disagreement_score":0.005983954,"about_ca_system_score_codex":0.00096155267,"about_ca_system_score_gemma":0.0004292492,"threshold_uncertainty_score":0.02001828},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8812369,0.00014666612,0.09295162,0.00014379958,0.000037502992,0.000029949248,0.0001427151,0.0001547997,0.025156016],"genre_scores_gemma":[0.97973204,0.00013877019,0.017199619,0.000047524525,0.000015588006,0.00002876242,0.00023305508,0.000044974513,0.002559702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946004,0.00012713841,0.000025611913,0.00013389015,0.00011075595,0.00014252764],"domain_scores_gemma":[0.99912673,0.00022258316,0.00015671931,0.00021869848,0.0001620606,0.0001131592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028772262,0.00024199321,0.00030151245,0.0011228209,0.0011719794,0.0013088532,0.00073790905,0.00035465098,0.002216319],"category_scores_gemma":[0.0012149157,0.00020629322,0.00040513652,0.0010227711,0.001436995,0.001704574,0.0009106923,0.0006169613,0.00021833947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015729167,0.000054678192,0.0039076223,0.000056169927,0.000012685368,0.00019950197,0.0005039058,0.007801159,0.012138416,0.95027214,0.00092252565,0.023973916],"study_design_scores_gemma":[0.00003288372,0.00008806764,0.0047006602,0.000028787963,0.00003208991,0.00044849413,0.0008014392,0.080498986,0.016061163,0.8869348,0.010324361,0.00004823946],"about_ca_topic_score_codex":0.001345961,"about_ca_topic_score_gemma":0.001630073,"teacher_disagreement_score":0.002216319,"about_ca_system_score_codex":0.00084300217,"about_ca_system_score_gemma":0.00051847147,"threshold_uncertainty_score":0.0074142814},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19690892,0.05310057,0.3488823,0.016466,0.0049138474,0.00012675335,0.00093087927,0.0008130742,0.37785763],"genre_scores_gemma":[0.88050693,0.025937129,0.046654284,0.0047227675,0.00398674,0.00014526657,0.00095735193,0.00039923214,0.036690235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985648,0.00027784184,0.000065994915,0.00043354539,0.0003380366,0.0003197931],"domain_scores_gemma":[0.99641526,0.0020448552,0.00026491567,0.00047359715,0.0005681215,0.00023321407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015159552,0.0006524968,0.00073827023,0.0010654335,0.0019523918,0.0034056308,0.0013183414,0.0013980943,0.0058720736],"category_scores_gemma":[0.004689666,0.00042602347,0.0010090509,0.0021972414,0.005068852,0.006619211,0.0022285571,0.0033754895,0.001291093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003267506,0.000025040203,0.00093643396,0.00021336727,0.0000156002,0.00010084948,0.00038378267,0.0018221785,0.0004603348,0.9724396,0.0065504652,0.017019618],"study_design_scores_gemma":[0.000010755231,0.000030555988,0.0009268614,0.00013685694,0.000021845754,0.0004106998,0.00037523982,0.004593575,0.00082838093,0.9454082,0.047228128,0.000028991197],"about_ca_topic_score_codex":0.0026519694,"about_ca_topic_score_gemma":0.001599449,"teacher_disagreement_score":0.0058720736,"about_ca_system_score_codex":0.0026682548,"about_ca_system_score_gemma":0.0011482544,"threshold_uncertainty_score":0.019644022},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7685143,0.0016100009,0.15829435,0.000782769,0.00010192038,0.00009376371,0.0008503448,0.00037046566,0.069382146],"genre_scores_gemma":[0.9581895,0.00060367933,0.033274926,0.00021401381,0.00015040186,0.00008182581,0.00056765426,0.000090250534,0.00682774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993098,0.000071791925,0.000053077183,0.00022696498,0.0002026038,0.00013564387],"domain_scores_gemma":[0.99801326,0.0008703816,0.0004049295,0.0002495398,0.00024450867,0.0002173857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004570697,0.0006682481,0.00050103455,0.0017659965,0.0012848912,0.0021388186,0.00092885114,0.000726048,0.0036896472],"category_scores_gemma":[0.0022633679,0.00039974225,0.0004877746,0.0018398567,0.001746363,0.0036694831,0.0016146585,0.0017532203,0.0004847867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016381613,0.00006659603,0.0018668451,0.00013348128,0.000017541259,0.00018055057,0.0005504935,0.003172523,0.013610332,0.94028574,0.0019089802,0.038043004],"study_design_scores_gemma":[0.000037609065,0.000087645065,0.0017933856,0.000044129334,0.000039420993,0.000995162,0.00029038332,0.01144455,0.008035581,0.9575517,0.019620493,0.00005986898],"about_ca_topic_score_codex":0.00047985293,"about_ca_topic_score_gemma":0.00046755595,"teacher_disagreement_score":0.0036896472,"about_ca_system_score_codex":0.00092069607,"about_ca_system_score_gemma":0.000537831,"threshold_uncertainty_score":0.012343109},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6585614,0.0006958371,0.23750107,0.0011611047,0.00026548552,0.00009065492,0.0007480479,0.00062812195,0.10034824],"genre_scores_gemma":[0.8983648,0.00055598695,0.07868861,0.00028871302,0.00013200975,0.00008275996,0.00070774206,0.00013701442,0.021042265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997181,0.000051327555,0.000015823265,0.000081265716,0.00004348252,0.00008989617],"domain_scores_gemma":[0.9992094,0.0002784399,0.00017670063,0.00012683298,0.00009614764,0.00011248734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024055937,0.0003258208,0.00027869022,0.0006281907,0.0011626253,0.0008248755,0.0005373496,0.00049015094,0.005265031],"category_scores_gemma":[0.0012570752,0.00013091914,0.00034389502,0.0007448242,0.0010528539,0.0019257719,0.0006968872,0.0007553063,0.0005422656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003052504,0.00007039141,0.0018264685,0.00020520433,0.000009761065,0.00041390967,0.0006286874,0.011350717,0.013827814,0.8945124,0.004268987,0.0725804],"study_design_scores_gemma":[0.00004307473,0.00017405268,0.0021569002,0.00006314216,0.00003736941,0.0009430215,0.00043028314,0.0677421,0.020758444,0.85543203,0.052168597,0.000050831022],"about_ca_topic_score_codex":0.0014333056,"about_ca_topic_score_gemma":0.0019152473,"teacher_disagreement_score":0.005265031,"about_ca_system_score_codex":0.0011653489,"about_ca_system_score_gemma":0.00040242402,"threshold_uncertainty_score":0.017613292},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92040884,0.0009935788,0.03940985,0.0017615276,0.00021187626,0.00006909536,0.0020768163,0.00047441217,0.0345939],"genre_scores_gemma":[0.98588413,0.00033750074,0.007050312,0.00016373764,0.00010834035,0.00002964019,0.0022213627,0.00005976769,0.0041451426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993774,0.00013899892,0.000044944536,0.0001700721,0.00012477393,0.00014389302],"domain_scores_gemma":[0.996073,0.0018064418,0.0006263216,0.00061349035,0.0004043262,0.00047639088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051557005,0.0004157412,0.00067547517,0.0019576803,0.0012943421,0.0035027813,0.0011620766,0.0013823411,0.0075108046],"category_scores_gemma":[0.004527735,0.00033216254,0.00035991002,0.001841467,0.0014571866,0.003140578,0.0011375763,0.0010169985,0.0005230508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039387718,0.00014326719,0.014676851,0.00033337154,0.00003851596,0.00016205435,0.0005500846,0.0081798425,0.0046629254,0.86945367,0.022257812,0.07914777],"study_design_scores_gemma":[0.00007425554,0.00008163328,0.0068732915,0.00009217073,0.000037917198,0.00029820346,0.0004898277,0.06251968,0.0027266985,0.91532964,0.011443872,0.000032797045],"about_ca_topic_score_codex":0.001332805,"about_ca_topic_score_gemma":0.0016997261,"teacher_disagreement_score":0.0075108046,"about_ca_system_score_codex":0.0011287427,"about_ca_system_score_gemma":0.0006546773,"threshold_uncertainty_score":0.02512616},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64739335,0.00028636446,0.31568244,0.00065692345,0.00016038302,0.00007873272,0.0004097864,0.00052091567,0.034811113],"genre_scores_gemma":[0.9167009,0.00013396789,0.076033026,0.00022186412,0.00004136333,0.000073335,0.0005961849,0.00010891282,0.006090375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954826,0.00008636477,0.0000246598,0.000120487246,0.00013806672,0.00008212247],"domain_scores_gemma":[0.9981713,0.0005971549,0.00021347814,0.000439922,0.0003908531,0.00018718066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040911033,0.00023370514,0.00025708706,0.0006840341,0.0008164024,0.00094962324,0.00068435067,0.0004815168,0.0033702063],"category_scores_gemma":[0.0023437222,0.00030181732,0.00035319678,0.0004222321,0.000803299,0.0016843547,0.0013243569,0.00083064917,0.00039816773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002044378,0.00008195848,0.0033811198,0.00013016228,0.00001862714,0.00039974833,0.0005313871,0.0070506237,0.03381203,0.91461575,0.0042643296,0.035509814],"study_design_scores_gemma":[0.0000471113,0.0001307643,0.001528039,0.000039933988,0.00003524179,0.001055229,0.00029724842,0.11747667,0.027796745,0.82948136,0.022078356,0.000033266457],"about_ca_topic_score_codex":0.00020977666,"about_ca_topic_score_gemma":0.00038908384,"teacher_disagreement_score":0.0033702063,"about_ca_system_score_codex":0.00046461239,"about_ca_system_score_gemma":0.00037649053,"threshold_uncertainty_score":0.011274457},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6919186,0.0029035737,0.145499,0.005568814,0.00037324795,0.00008765106,0.00047458045,0.00030366253,0.15287085],"genre_scores_gemma":[0.9708307,0.0008422098,0.019987294,0.00044014503,0.00026735946,0.000080231854,0.00018227358,0.00010130289,0.007268498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992137,0.0002195453,0.000021874308,0.00017343015,0.00022523035,0.0001460835],"domain_scores_gemma":[0.99648607,0.0023606715,0.00029594052,0.00033939746,0.00024743503,0.0002705639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089878164,0.00047416452,0.0004375648,0.0021263105,0.0019926745,0.0019201301,0.0009459227,0.0009342426,0.006768632],"category_scores_gemma":[0.004849757,0.00038372687,0.00040651613,0.0012242835,0.0055271336,0.004165435,0.001919147,0.0026012894,0.00045452276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003138381,0.000010173957,0.0002935061,0.000033222794,0.000003824527,0.000028800832,0.00016707071,0.0037857227,0.0011300371,0.9899407,0.0009586779,0.0036169067],"study_design_scores_gemma":[0.000013194506,0.000013536279,0.00038512333,0.000019807567,0.000004888355,0.00004361429,0.00009097673,0.013935747,0.0005796137,0.98083246,0.0040649595,0.000016088885],"about_ca_topic_score_codex":0.0022177347,"about_ca_topic_score_gemma":0.0020525428,"teacher_disagreement_score":0.006768632,"about_ca_system_score_codex":0.001973004,"about_ca_system_score_gemma":0.00068992673,"threshold_uncertainty_score":0.022643387},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062750325,0.0013849374,0.826431,0.0018837644,0.0007651375,0.00015027168,0.00061503187,0.0020639335,0.10395558],"genre_scores_gemma":[0.54767287,0.0019005883,0.37867773,0.0009671794,0.0016562869,0.00041581763,0.0010931541,0.001946488,0.065669924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981622,0.00042279373,0.00007937924,0.00039674828,0.0007201359,0.00021882163],"domain_scores_gemma":[0.9962586,0.002197826,0.00020934764,0.0007523349,0.0003951862,0.00018663856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012038477,0.0013961059,0.0022989747,0.0030931188,0.0022147526,0.00415248,0.0026455994,0.0012123793,0.012232399],"category_scores_gemma":[0.0068380856,0.0010878926,0.0013903176,0.004979587,0.0022795289,0.008411179,0.00366045,0.004617999,0.0033359951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007587022,0.000046007084,0.0002681225,0.00015442759,0.000021047836,0.0000518576,0.00015097606,0.0030323889,0.0024027342,0.9128102,0.010009542,0.07097681],"study_design_scores_gemma":[0.000013530708,0.000015964537,0.00011579715,0.000025121468,0.000024295676,0.00013293845,0.000026846737,0.017941846,0.0018686736,0.97210073,0.0077132387,0.000021017555],"about_ca_topic_score_codex":0.0007000123,"about_ca_topic_score_gemma":0.0011877579,"teacher_disagreement_score":0.012232399,"about_ca_system_score_codex":0.0021201416,"about_ca_system_score_gemma":0.0008607703,"threshold_uncertainty_score":0.04092145},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9361312,0.00023063383,0.045144565,0.00028773415,0.00004129464,0.000021925855,0.00020217999,0.00014946866,0.017790955],"genre_scores_gemma":[0.9757544,0.00013771183,0.019840283,0.00009089436,0.000017247938,0.00007199949,0.00027718185,0.000060017315,0.0037503191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933356,0.000242652,0.000052818294,0.00013370493,0.000108125445,0.00012910941],"domain_scores_gemma":[0.99733377,0.0016134193,0.00034121968,0.0002317612,0.00016741552,0.00031242307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070535956,0.00024667225,0.00030607672,0.0009082352,0.00172944,0.0013949688,0.00069908926,0.0006073618,0.0022125936],"category_scores_gemma":[0.002991533,0.00040554733,0.0004994132,0.00049822446,0.0016365008,0.0016952818,0.00092715473,0.00068112824,0.00018516801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046205518,0.00008929568,0.0072698756,0.00014884991,0.0000351232,0.0006353368,0.00095724076,0.016230261,0.020678319,0.9236541,0.0030221322,0.026817426],"study_design_scores_gemma":[0.00011511927,0.0001894992,0.0061167357,0.00009986658,0.00008155219,0.0016508996,0.00090215623,0.09155426,0.01980708,0.8656089,0.013780136,0.00009389751],"about_ca_topic_score_codex":0.0007842698,"about_ca_topic_score_gemma":0.0014989146,"teacher_disagreement_score":0.0022125936,"about_ca_system_score_codex":0.0014304237,"about_ca_system_score_gemma":0.00048982323,"threshold_uncertainty_score":0.01037848},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74797076,0.0018409343,0.18125117,0.0020382572,0.00011754981,0.000040621922,0.00048127628,0.00019014426,0.066069305],"genre_scores_gemma":[0.96785027,0.00075329567,0.023120888,0.00017074001,0.00017274603,0.00005491698,0.0005558271,0.000086746266,0.0072346143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992561,0.0001804922,0.000048181017,0.00019385107,0.00021938737,0.00010206012],"domain_scores_gemma":[0.9975364,0.0011111682,0.0003968744,0.00022231684,0.0003135385,0.0004197466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005979152,0.0004997503,0.0005632924,0.002339124,0.0010897787,0.0019596207,0.00134508,0.00116393,0.003181995],"category_scores_gemma":[0.004093243,0.00032550626,0.00043233074,0.0014872022,0.002523057,0.004154764,0.0024314874,0.0018628982,0.00036235372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031541076,0.000014984732,0.00073111634,0.000040606246,0.0000058446813,0.00006145913,0.000235898,0.0033360403,0.0018651496,0.98724735,0.00071427674,0.0057157404],"study_design_scores_gemma":[0.000008158797,0.000028935872,0.0008522715,0.000024173783,0.00000830752,0.00021489161,0.00015562146,0.024661189,0.001037289,0.966923,0.006065818,0.000020465528],"about_ca_topic_score_codex":0.0008458457,"about_ca_topic_score_gemma":0.00060240924,"teacher_disagreement_score":0.003181995,"about_ca_system_score_codex":0.0015034354,"about_ca_system_score_gemma":0.00038351072,"threshold_uncertainty_score":0.010908246},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9501232,0.00041882432,0.035227574,0.0004693192,0.000013409281,0.00001849191,0.000333746,0.000111640955,0.013283852],"genre_scores_gemma":[0.9833778,0.000297143,0.013792299,0.000053316988,0.000020179128,0.000030514617,0.0003058336,0.000032677766,0.0020901558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964595,0.00006872529,0.000016903614,0.00011024002,0.000069873095,0.00008836047],"domain_scores_gemma":[0.9960526,0.0028667084,0.00037267126,0.0002341948,0.00016096373,0.00031272866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000515317,0.00030374792,0.00036198774,0.0017825713,0.0010980258,0.0011241052,0.00056210737,0.0007099153,0.0029180965],"category_scores_gemma":[0.0045870263,0.00025016576,0.0003599845,0.0010881968,0.0012166621,0.0022358787,0.0006229265,0.0008025289,0.00022803222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057926454,0.000166165,0.02878871,0.00028244886,0.000072795316,0.00071818515,0.00132625,0.11211466,0.027143782,0.745674,0.00717542,0.07595845],"study_design_scores_gemma":[0.000041675878,0.0001123516,0.012561509,0.000058021476,0.000056249643,0.0015135661,0.00045014327,0.3218164,0.014383364,0.6388941,0.010042958,0.00006973728],"about_ca_topic_score_codex":0.0011463478,"about_ca_topic_score_gemma":0.0011827975,"teacher_disagreement_score":0.0029180965,"about_ca_system_score_codex":0.0016491824,"about_ca_system_score_gemma":0.0003887637,"threshold_uncertainty_score":0.011965752},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61851865,0.00029962574,0.29940492,0.00058839784,0.00026505705,0.00015983956,0.0015722027,0.0016813839,0.077509895],"genre_scores_gemma":[0.8550549,0.00020166018,0.13127296,0.00025342722,0.00006952786,0.00022107163,0.0015830082,0.00020953229,0.011133835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992298,0.00012912284,0.00006417938,0.00019037296,0.00020108408,0.00018544246],"domain_scores_gemma":[0.9980876,0.0006271343,0.00030864732,0.00027587422,0.00038543402,0.00031540458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005102939,0.0003887272,0.00026869462,0.000722834,0.0008283349,0.0011935704,0.00078755524,0.0006239164,0.005451381],"category_scores_gemma":[0.002562706,0.0004974239,0.0005345675,0.0006416518,0.0008796603,0.0013281431,0.00085556146,0.001056853,0.00084733684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000831024,0.00014100871,0.005482861,0.0003389391,0.000039149647,0.00069786236,0.0005597707,0.022288946,0.05511037,0.82710296,0.012907218,0.07449987],"study_design_scores_gemma":[0.00020001299,0.00042732753,0.0040348535,0.00011982178,0.0000754863,0.0016932931,0.0006847972,0.123697095,0.054307837,0.7794567,0.035139855,0.00016296165],"about_ca_topic_score_codex":0.0015116401,"about_ca_topic_score_gemma":0.0026394038,"teacher_disagreement_score":0.005451381,"about_ca_system_score_codex":0.0007354316,"about_ca_system_score_gemma":0.00080383767,"threshold_uncertainty_score":0.018236697},"labels":[],"label_agreement":null},{"id":"W4408736722","doi":"10.61091/ars162-04","title":"Some results on 4- remainder cordial labeling of graphs","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Remainder; Mathematics; Combinatorics; Arithmetic","score_opus":0.012551693763359002,"score_gpt":0.24536131392617083,"score_spread":0.23280962016281184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408736722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24447556,0.0026500362,0.49724337,0.0018587696,0.00059050816,0.00021788005,0.0015693768,0.002625651,0.24876887],"genre_scores_gemma":[0.606701,0.0032660605,0.28164977,0.0018103133,0.000964333,0.00037245973,0.0044240835,0.0013081845,0.099503785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991635,0.00016910456,0.00007059371,0.00021930387,0.00019896752,0.00017853917],"domain_scores_gemma":[0.99825007,0.0006392044,0.00024376147,0.00042878196,0.0002729648,0.00016520693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009354478,0.00086827506,0.00064579176,0.0017334719,0.0016520481,0.0018782617,0.0013868079,0.0010141506,0.012146054],"category_scores_gemma":[0.0027267935,0.0005346416,0.0012559629,0.0024174603,0.0015181864,0.0033298892,0.0014172777,0.0019340971,0.0028063513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029834796,0.00010339579,0.001008512,0.00036163474,0.00002616043,0.00033306074,0.0008795819,0.017399354,0.009671476,0.86223674,0.010348368,0.09733344],"study_design_scores_gemma":[0.0000346139,0.00013987502,0.0010982397,0.00009913138,0.000050679908,0.00037707377,0.00022292504,0.05225847,0.008104998,0.88916343,0.048397187,0.000053321794],"about_ca_topic_score_codex":0.0037855334,"about_ca_topic_score_gemma":0.003308985,"teacher_disagreement_score":0.012146054,"about_ca_system_score_codex":0.0026985698,"about_ca_system_score_gemma":0.00070314406,"threshold_uncertainty_score":0.040632606},"labels":[],"label_agreement":null},{"id":"W4408736800","doi":"10.61091/ars162-06","title":"New families of tripartite graphs with local antimagic chromatic number 3","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics","score_opus":0.005649431403261357,"score_gpt":0.2232497043105079,"score_spread":0.21760027290724654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408736800","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7776154,0.0006573659,0.1802554,0.0011268051,0.0001265615,0.000122085,0.00054733903,0.0009936214,0.038555466],"genre_scores_gemma":[0.94476455,0.00030390001,0.045173287,0.00026831462,0.00006145324,0.00021662965,0.0005956313,0.00017350233,0.008442738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992768,0.00018536932,0.000034626548,0.00020019496,0.00016825405,0.0001347539],"domain_scores_gemma":[0.9968532,0.0014902506,0.00038688714,0.00043454528,0.00034568895,0.0004894965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057549466,0.00044122792,0.0004748321,0.0017946261,0.0022957635,0.0018125157,0.0016409367,0.0011539755,0.0055052526],"category_scores_gemma":[0.0028927398,0.00075473066,0.0009421589,0.0012600259,0.0015428123,0.0022305027,0.0017761084,0.0017358796,0.0003683873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021428429,0.00011829276,0.0026291204,0.0001990458,0.00007648291,0.00094746135,0.0012864084,0.013578574,0.020054441,0.9365479,0.005747825,0.018600186],"study_design_scores_gemma":[0.00017107587,0.0002778279,0.0040178243,0.00010661312,0.00016418427,0.0039403155,0.0012757933,0.15164268,0.014983316,0.7884632,0.034816302,0.00014090701],"about_ca_topic_score_codex":0.0010320324,"about_ca_topic_score_gemma":0.0018801705,"teacher_disagreement_score":0.0055052526,"about_ca_system_score_codex":0.0022378294,"about_ca_system_score_gemma":0.00046840886,"threshold_uncertainty_score":0.018416941},"labels":[],"label_agreement":null},{"id":"W4408736811","doi":"10.61091/ars162-01","title":"Acyclic total coloring of graphs with large girths","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics","score_opus":0.005903342176377706,"score_gpt":0.22022126215451493,"score_spread":0.21431791997813723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408736811","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79229254,0.00080941315,0.1689539,0.00071651855,0.00006836927,0.000066873145,0.0008954675,0.000550764,0.035646137],"genre_scores_gemma":[0.9548394,0.000574491,0.036332842,0.0002067017,0.00005488459,0.00007660153,0.0009076203,0.00011650547,0.0068909014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993887,0.00016082918,0.000026659065,0.00014815487,0.00010121434,0.00017430459],"domain_scores_gemma":[0.99604625,0.0020885367,0.00040119188,0.0006500706,0.00039996539,0.00041396377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006872382,0.0004402985,0.00032218118,0.0011921903,0.0011045476,0.0013088974,0.00064670824,0.00035437217,0.0026099503],"category_scores_gemma":[0.0030360883,0.00045410485,0.0004710282,0.0014027387,0.0012753346,0.0014048317,0.001363702,0.0006783395,0.0002405284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038491923,0.00008422387,0.008803699,0.0003101189,0.00007108206,0.00032500364,0.00055656664,0.072484955,0.023073062,0.84582245,0.008499876,0.039584216],"study_design_scores_gemma":[0.00009166008,0.00009578614,0.0044911387,0.00006150586,0.00008837244,0.00077597506,0.00036723714,0.19159383,0.012059521,0.7689657,0.021363975,0.00004529785],"about_ca_topic_score_codex":0.0031450104,"about_ca_topic_score_gemma":0.0057860063,"teacher_disagreement_score":0.0031450104,"about_ca_system_score_codex":0.0016237893,"about_ca_system_score_gemma":0.00089557294,"threshold_uncertainty_score":0.011781514},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41365033,0.0017991948,0.20138933,0.005907513,0.0012528982,0.00018012799,0.001359271,0.0017786669,0.3726826],"genre_scores_gemma":[0.96069247,0.00034908255,0.015594147,0.00040866912,0.0009820269,0.00020408169,0.00041943832,0.0003492154,0.021000888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820244,0.00029123446,0.00010811498,0.0004017681,0.0005968496,0.00039954524],"domain_scores_gemma":[0.9953694,0.0024305074,0.00038215032,0.0005431529,0.0006530807,0.00062170695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014716828,0.00088309427,0.0008049472,0.0030123577,0.0018598514,0.0047540334,0.0019255118,0.0017932064,0.024548016],"category_scores_gemma":[0.0074293604,0.00065019564,0.00060349103,0.0015327586,0.0039668195,0.010236004,0.0038588722,0.0032637103,0.0033513042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007443608,0.000023244025,0.00034292656,0.000049855826,0.000005969923,0.00012362027,0.00026039808,0.0005055464,0.0016036519,0.98676157,0.0019547811,0.00829404],"study_design_scores_gemma":[0.000023862907,0.000037708476,0.00025919982,0.000027129796,0.00000818441,0.00013358644,0.00013349399,0.0024186256,0.0018592216,0.98765,0.0074305986,0.000018394283],"about_ca_topic_score_codex":0.00043814184,"about_ca_topic_score_gemma":0.0002762622,"teacher_disagreement_score":0.024548016,"about_ca_system_score_codex":0.0018975466,"about_ca_system_score_gemma":0.00049270364,"threshold_uncertainty_score":0.08212131},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81029755,0.00025567424,0.1576716,0.0012661616,0.00009456826,0.00014772924,0.0012489901,0.00031497047,0.028702727],"genre_scores_gemma":[0.933007,0.00013115711,0.06018193,0.0001413933,0.000018606877,0.000084138024,0.00047406604,0.00007420808,0.0058876057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996259,0.00007353983,0.000017253962,0.00012983714,0.000062377694,0.00009113543],"domain_scores_gemma":[0.9986083,0.0006366779,0.0002216739,0.00026480487,0.00013634653,0.0001322401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044488814,0.00025806692,0.00047213043,0.00062586635,0.0013065876,0.0014044298,0.0011892238,0.0009934836,0.009162407],"category_scores_gemma":[0.0027127992,0.00036558058,0.00070430327,0.001299347,0.0012270228,0.0020173236,0.0005673457,0.00091431226,0.00047095725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000622322,0.00017540547,0.006506289,0.00032887992,0.00012000268,0.0008611262,0.00049825705,0.14428179,0.012532736,0.73476326,0.014686507,0.084623404],"study_design_scores_gemma":[0.000112135356,0.0001873953,0.002942291,0.000038201357,0.000044777145,0.0010653555,0.00047171998,0.41269633,0.0052556084,0.56578803,0.011343479,0.000054751352],"about_ca_topic_score_codex":0.0033682722,"about_ca_topic_score_gemma":0.0045269574,"teacher_disagreement_score":0.009162407,"about_ca_system_score_codex":0.0010261558,"about_ca_system_score_gemma":0.0015011989,"threshold_uncertainty_score":0.030651271},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8995857,0.0005972204,0.07587017,0.000645983,0.00007736385,0.00005111284,0.00015638619,0.00010912342,0.022906946],"genre_scores_gemma":[0.9785234,0.0003934842,0.017714035,0.00014232377,0.00010288376,0.00005236718,0.00018735175,0.000052332933,0.0028317885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905616,0.0002895621,0.000040241743,0.0002525066,0.00020467691,0.00015674157],"domain_scores_gemma":[0.99441564,0.0026852277,0.0009792829,0.0006556689,0.00052530627,0.0007389526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013520148,0.0004994139,0.0006359605,0.0014042932,0.001638612,0.0018495799,0.0009510652,0.0009991056,0.0034913286],"category_scores_gemma":[0.0051032742,0.00052859174,0.0006387694,0.0011746354,0.0023195436,0.0035706803,0.0018747072,0.0014789735,0.0003336714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003337681,0.00014051833,0.010981854,0.00020768393,0.000050845167,0.00039465004,0.0006061798,0.016319295,0.011967267,0.93265647,0.0021545507,0.024186807],"study_design_scores_gemma":[0.00007026717,0.0002876882,0.008155443,0.00009733207,0.00013655971,0.0013241345,0.0007389798,0.18640171,0.010046952,0.78298604,0.00965965,0.00009530205],"about_ca_topic_score_codex":0.00077100843,"about_ca_topic_score_gemma":0.0007301617,"teacher_disagreement_score":0.0034913286,"about_ca_system_score_codex":0.000888559,"about_ca_system_score_gemma":0.0004024129,"threshold_uncertainty_score":0.011679709},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6530983,0.0023281581,0.28511608,0.002998611,0.0003264599,0.00009871677,0.0010665612,0.00029014933,0.054677077],"genre_scores_gemma":[0.96556073,0.0010017205,0.027028523,0.0002914642,0.0002756474,0.000079340956,0.00048883137,0.000073683506,0.005200088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878937,0.00034456074,0.00006469154,0.00031224327,0.00026710407,0.0002221503],"domain_scores_gemma":[0.9913702,0.0055441475,0.00085037376,0.0005497617,0.0005916016,0.0010938208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011496772,0.0005825207,0.0005684827,0.0023682476,0.0014679967,0.0021627026,0.0013418723,0.0008643088,0.006497319],"category_scores_gemma":[0.0075472514,0.000539842,0.00078070664,0.0012774537,0.0025903683,0.0038497932,0.0018064282,0.0019465868,0.00044126427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007789355,0.000043840915,0.0020537884,0.00022530329,0.000037237758,0.00023224755,0.00057252287,0.017730672,0.0040729977,0.96082854,0.0029238625,0.011201012],"study_design_scores_gemma":[0.000010479401,0.000027615732,0.0011436571,0.00004476333,0.000014247499,0.00019451481,0.0002107025,0.03656322,0.0008329346,0.95697236,0.0039623375,0.000023187722],"about_ca_topic_score_codex":0.0011468388,"about_ca_topic_score_gemma":0.00084599195,"teacher_disagreement_score":0.006497319,"about_ca_system_score_codex":0.0010556148,"about_ca_system_score_gemma":0.00029692368,"threshold_uncertainty_score":0.021735728},"labels":[],"label_agreement":null},{"id":"W4408968077","doi":"10.61091/ars162-13","title":"The strict neighbor-distinguishing index of simple graphs with maximum degree five","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Simple (philosophy); Degree (music); Index (typography); Combinatorics; Statistics; Computer science; Physics","score_opus":0.011707687898848674,"score_gpt":0.2315710755330517,"score_spread":0.21986338763420302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408968077","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91659784,0.00048159287,0.038499437,0.00050711934,0.000041906507,0.00003169067,0.0003842861,0.00012511414,0.043330967],"genre_scores_gemma":[0.98389554,0.00023531691,0.012749916,0.00010188557,0.000030584768,0.000022580978,0.00040677018,0.00002403453,0.0025333005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948287,0.00008807913,0.00003893788,0.00013348294,0.00011908834,0.00013745247],"domain_scores_gemma":[0.9974496,0.0013503388,0.00044543121,0.00025878876,0.00017610016,0.0003197871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046730085,0.00027918193,0.0003076759,0.0008937172,0.00095636415,0.0014726227,0.00056190224,0.00033110875,0.0020090176],"category_scores_gemma":[0.0022053397,0.00031079416,0.0003150597,0.0009716683,0.0012532782,0.0018743728,0.0012666936,0.0007182772,0.00027031184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000682849,0.00017187666,0.025079362,0.00036080636,0.000053887285,0.00041813118,0.0016204213,0.014875489,0.031786866,0.8679987,0.0055904267,0.051361155],"study_design_scores_gemma":[0.00011168361,0.00023881455,0.01565943,0.00007970903,0.00010525668,0.0012666973,0.00095885573,0.073568836,0.027864015,0.85728455,0.022791259,0.00007082204],"about_ca_topic_score_codex":0.0011098365,"about_ca_topic_score_gemma":0.0018494794,"teacher_disagreement_score":0.0020090176,"about_ca_system_score_codex":0.0011488616,"about_ca_system_score_gemma":0.00043790136,"threshold_uncertainty_score":0.00833565},"labels":[],"label_agreement":null},{"id":"W4408968195","doi":"10.61091/ars162-12","title":"Total coloring of regular graphs of girth = degree + 1","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Girth (graph theory); Degree (music); Edge coloring; Combinatorics; Discrete mathematics; Graph; Physics; Graph power; Line graph","score_opus":0.013634592031019396,"score_gpt":0.22868228073811248,"score_spread":0.21504768870709307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408968195","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87323284,0.00023614231,0.09832956,0.00012486169,0.000023761531,0.000040276165,0.0005540223,0.00041872056,0.027039973],"genre_scores_gemma":[0.95810324,0.00024551657,0.033022024,0.000060268358,0.000011590852,0.00003809123,0.00096848124,0.00009685291,0.0074538873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977773,0.000045674948,0.000008359937,0.000050859613,0.000044589367,0.00007283553],"domain_scores_gemma":[0.99945587,0.00017694423,0.00007668356,0.00015431203,0.000067649315,0.00006846646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016330378,0.00027724134,0.0001931115,0.0005691514,0.00046843995,0.0007416759,0.00034972205,0.00015142943,0.0020854997],"category_scores_gemma":[0.0006684029,0.00023796721,0.00035488518,0.0007480847,0.0005573916,0.0005098286,0.00055604195,0.00025405778,0.0002800785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006091909,0.00012047707,0.009876543,0.00040320895,0.00009229047,0.0005485681,0.00077460683,0.16193733,0.119299,0.57631,0.0059214737,0.12410738],"study_design_scores_gemma":[0.00012143186,0.00045060695,0.0096706655,0.00006215633,0.00013960736,0.0013918522,0.00057201413,0.22446986,0.09569009,0.6277164,0.039662566,0.000052683117],"about_ca_topic_score_codex":0.0018996585,"about_ca_topic_score_gemma":0.0040706075,"teacher_disagreement_score":0.0020854997,"about_ca_system_score_codex":0.0006250503,"about_ca_system_score_gemma":0.0004167999,"threshold_uncertainty_score":0.0069767237},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1930121,0.00053520605,0.7569739,0.0018841751,0.00031447466,0.0005477129,0.0024128216,0.0078113163,0.036508303],"genre_scores_gemma":[0.37690932,0.0002348718,0.5978503,0.00057232735,0.000088159235,0.00032966587,0.0040492015,0.00089318544,0.019072944],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924445,0.00012538997,0.000051961175,0.00022266223,0.00016605628,0.00018958634],"domain_scores_gemma":[0.9984862,0.00041453523,0.000105044375,0.0005437408,0.0002912406,0.00015911298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005233435,0.0009382273,0.00075578544,0.0010931997,0.0014537424,0.0016633716,0.0017183814,0.0008712765,0.012498707],"category_scores_gemma":[0.0019119495,0.00050216314,0.001181035,0.0016023741,0.0008070201,0.0020882336,0.0027107128,0.00153946,0.0033049202],"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.0018797311,0.000856401,0.0038844175,0.00078875344,0.00016453204,0.00036848738,0.0007899971,0.06253841,0.050454184,0.21959957,0.057675894,0.60099965],"study_design_scores_gemma":[0.00042491348,0.00032997283,0.0020653268,0.0000702041,0.00011843977,0.00039822824,0.0003413537,0.4900911,0.03513355,0.43260005,0.03832832,0.000098578275],"about_ca_topic_score_codex":0.002543861,"about_ca_topic_score_gemma":0.0046482217,"teacher_disagreement_score":0.012498707,"about_ca_system_score_codex":0.0016483763,"about_ca_system_score_gemma":0.0024046504,"threshold_uncertainty_score":0.04181236},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048282433,0.005297008,0.8564852,0.0024076747,0.0008651067,0.00009800087,0.00063818536,0.00011806346,0.08580826],"genre_scores_gemma":[0.73744667,0.00574379,0.23418835,0.0013174821,0.0010997037,0.00022645068,0.0006199103,0.00015591359,0.019201783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985663,0.0003443767,0.00014824304,0.00032462148,0.000408221,0.00020833114],"domain_scores_gemma":[0.9978557,0.0008940246,0.00024813693,0.0001831791,0.0006913667,0.00012752399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026915108,0.0005407133,0.00042191462,0.0016163266,0.001031083,0.0020801865,0.0010540868,0.00079951045,0.005187648],"category_scores_gemma":[0.005814587,0.00022499163,0.0010413056,0.0014909387,0.0015297054,0.0042665442,0.0012073048,0.0025113667,0.0004927802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034176945,0.000010820546,0.00036681167,0.00012644536,0.000014487033,0.00018777486,0.00026976425,0.004112747,0.0028129013,0.9731021,0.0022356363,0.016726378],"study_design_scores_gemma":[0.000015523507,0.000060817398,0.0010015058,0.000098903714,0.000039777336,0.00047275133,0.0003150721,0.10172784,0.0033558817,0.87212515,0.02073199,0.000054845314],"about_ca_topic_score_codex":0.0018786722,"about_ca_topic_score_gemma":0.0020138926,"teacher_disagreement_score":0.005187648,"about_ca_system_score_codex":0.0016957015,"about_ca_system_score_gemma":0.0007307429,"threshold_uncertainty_score":0.017354429},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3246257,0.0007740342,0.3086747,0.0012122147,0.00074344175,0.00037557643,0.00488815,0.0038591821,0.3548471],"genre_scores_gemma":[0.7241807,0.0009202183,0.16270863,0.00070661976,0.00010150334,0.00030327178,0.004679096,0.0011790633,0.1052209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996778,0.000044714103,0.000013394135,0.000079189835,0.00007160539,0.00011331029],"domain_scores_gemma":[0.9993857,0.00016927304,0.000058988546,0.00015438671,0.00012615934,0.0001054845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020575887,0.0006675546,0.0005046805,0.0006741041,0.0013007375,0.0017695786,0.0010653087,0.0005289488,0.021972496],"category_scores_gemma":[0.0008949178,0.00049707625,0.0004672666,0.0014211148,0.00090663525,0.001698842,0.0010108381,0.0013914076,0.0033406848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048098247,0.00010980788,0.0006456434,0.0003634187,0.000030866053,0.00021750736,0.00045506837,0.015795825,0.021663383,0.8296961,0.04030827,0.09023311],"study_design_scores_gemma":[0.00011491483,0.00012573879,0.0013002588,0.0001075182,0.000071192575,0.0004934374,0.00052507455,0.035297703,0.022600112,0.8276738,0.111629196,0.00006109766],"about_ca_topic_score_codex":0.004355083,"about_ca_topic_score_gemma":0.009174354,"teacher_disagreement_score":0.021972496,"about_ca_system_score_codex":0.0010489728,"about_ca_system_score_gemma":0.00075995293,"threshold_uncertainty_score":0.07350534},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85813254,0.00036073773,0.10407841,0.000430416,0.00020962852,0.00006954818,0.00033748974,0.0004644438,0.035916694],"genre_scores_gemma":[0.9647575,0.00028260978,0.02512654,0.00021694663,0.00020683433,0.00016455787,0.0002912084,0.00026007518,0.008693783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987908,0.0002594384,0.000065855806,0.00028839783,0.00030068873,0.00029494235],"domain_scores_gemma":[0.99589974,0.0020738312,0.0006365474,0.00048628676,0.00028635783,0.00061721064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096241006,0.0005715161,0.0005922413,0.0016579294,0.0015014553,0.0032344642,0.00092367246,0.0008465265,0.004243666],"category_scores_gemma":[0.004209725,0.00053124834,0.00090679555,0.0011084857,0.0029316258,0.0027550298,0.0016529096,0.0020343221,0.00049132924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017169754,0.00008450939,0.0005310151,0.000049070626,0.000014378705,0.00014255976,0.00033518707,0.0037696254,0.007761296,0.97318166,0.0010175456,0.012941539],"study_design_scores_gemma":[0.00006917194,0.00012942347,0.0010843198,0.000028039854,0.000017602404,0.0003252629,0.000156183,0.027443085,0.008011715,0.9592179,0.0034754947,0.000041705654],"about_ca_topic_score_codex":0.0005542527,"about_ca_topic_score_gemma":0.0008006472,"teacher_disagreement_score":0.004243666,"about_ca_system_score_codex":0.0014245225,"about_ca_system_score_gemma":0.00068246125,"threshold_uncertainty_score":0.014196515},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33262858,0.0025101055,0.44217846,0.0025155647,0.0010266596,0.00014565187,0.002660957,0.0012468687,0.21508713],"genre_scores_gemma":[0.88394177,0.0015387066,0.056828704,0.000915556,0.00069715193,0.00017663267,0.0023576957,0.00057743915,0.052966416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990683,0.00016509497,0.000054549295,0.00029676285,0.00023512216,0.0001801701],"domain_scores_gemma":[0.99819916,0.00065808254,0.0002738078,0.00023032799,0.0003275635,0.00031107134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069487904,0.0010571425,0.00077188143,0.0035202908,0.001743236,0.003071098,0.00095485913,0.0010396037,0.019341644],"category_scores_gemma":[0.00262295,0.0005170467,0.0013161848,0.0020538403,0.002202522,0.005137393,0.0029330254,0.002598857,0.002674421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018772937,0.0000070627148,0.00014183787,0.00003538876,0.000005156707,0.000053591135,0.00016130348,0.00095686066,0.0004391356,0.99212205,0.0015657265,0.004493143],"study_design_scores_gemma":[0.0000094509505,0.000023764263,0.00033056704,0.000028428216,0.000008415153,0.00008900223,0.00014066137,0.0070157824,0.00040293706,0.9833909,0.008541761,0.000018219476],"about_ca_topic_score_codex":0.0020182934,"about_ca_topic_score_gemma":0.0019181845,"teacher_disagreement_score":0.019341644,"about_ca_system_score_codex":0.0019150185,"about_ca_system_score_gemma":0.00036167708,"threshold_uncertainty_score":0.06470424},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1482461,0.00092334114,0.8446863,0.00049257424,0.00004971681,0.00025412109,0.00033528154,0.0012478386,0.003764574],"genre_scores_gemma":[0.4848665,0.0005701283,0.5092555,0.00025133623,0.0000842863,0.0003123649,0.0013072079,0.0004548755,0.0028977438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992847,0.00024596314,0.00003620639,0.00020457657,0.00012949498,0.000099040415],"domain_scores_gemma":[0.9980545,0.001144932,0.00021517467,0.0002309769,0.00022024904,0.00013420814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009855762,0.0012987055,0.0016116742,0.0023380704,0.0010646279,0.0011457354,0.0014882761,0.00120324,0.0017243434],"category_scores_gemma":[0.004573287,0.0006946993,0.00067841576,0.0021211244,0.0007929361,0.0031069221,0.0013544648,0.00062372495,0.00039248398],"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.00033639843,0.00024954916,0.004479952,0.00037952693,0.000099811725,0.0002278516,0.00066219026,0.68104786,0.016551677,0.03224625,0.0073644584,0.25635442],"study_design_scores_gemma":[0.00005052685,0.000110692185,0.0008405769,0.000028605938,0.00003813196,0.00014724072,0.00025490238,0.9479734,0.004925258,0.043295477,0.002316056,0.000019114743],"about_ca_topic_score_codex":0.0024981746,"about_ca_topic_score_gemma":0.0041583995,"teacher_disagreement_score":0.0024981746,"about_ca_system_score_codex":0.00094123435,"about_ca_system_score_gemma":0.00093170826,"threshold_uncertainty_score":0.0068291426},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34335038,0.0017197243,0.37082696,0.009266874,0.0007212444,0.0002723434,0.0014181099,0.00068434165,0.27173993],"genre_scores_gemma":[0.90017575,0.001560876,0.05065723,0.0022587266,0.00090262725,0.00037741946,0.0013032967,0.0004932596,0.042270828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998271,0.00050903746,0.00010273087,0.0004593342,0.0003365216,0.00032138795],"domain_scores_gemma":[0.986842,0.009161821,0.0007920012,0.0014882567,0.00078950915,0.00092645985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023114076,0.0010847962,0.0015421243,0.0029876118,0.0031352828,0.0053946744,0.0032750724,0.002365164,0.015985975],"category_scores_gemma":[0.009244644,0.0015072756,0.002025904,0.003006716,0.005896676,0.012769475,0.0055244057,0.007959872,0.0015169053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025844252,0.000021415137,0.00028325422,0.00003311658,0.0000069570865,0.000026117594,0.00018419737,0.00073105784,0.00026024593,0.99461573,0.0015610111,0.0022509848],"study_design_scores_gemma":[0.00001917821,0.0000064835535,0.00017597985,0.000009445505,0.000009937577,0.000033525892,0.00006166737,0.0036955234,0.00022509175,0.99399626,0.0017575495,0.000009331661],"about_ca_topic_score_codex":0.0021087704,"about_ca_topic_score_gemma":0.0018924627,"teacher_disagreement_score":0.015985975,"about_ca_system_score_codex":0.0031079636,"about_ca_system_score_gemma":0.00096775824,"threshold_uncertainty_score":0.05347836},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81131196,0.0009783531,0.1593664,0.00027032432,0.000068709254,0.00004648378,0.00018989532,0.00013083666,0.02763706],"genre_scores_gemma":[0.96763724,0.000588612,0.02818312,0.000084843785,0.000074669224,0.0000347028,0.00020765302,0.00005907628,0.0031301745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996401,0.00007835578,0.000013786343,0.0001251402,0.0000718898,0.00007072997],"domain_scores_gemma":[0.99903286,0.00046111742,0.00012663183,0.00011928598,0.00015154893,0.000108594126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047277732,0.00035361518,0.00040982015,0.0007785406,0.0010333754,0.0010226298,0.0003979241,0.0003492476,0.0024599861],"category_scores_gemma":[0.0015191676,0.00023009346,0.0004639173,0.0008634634,0.0011570179,0.002015251,0.0007245195,0.000648499,0.00011935124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017574873,0.00006210434,0.003923385,0.00020599611,0.00003873307,0.0004611448,0.001179906,0.019537784,0.018457241,0.91990924,0.0025220155,0.033526782],"study_design_scores_gemma":[0.00004167657,0.00017427868,0.005082992,0.000053748077,0.000045684796,0.000997306,0.00049277203,0.1434979,0.0068552527,0.82341653,0.019292573,0.000049358336],"about_ca_topic_score_codex":0.001202524,"about_ca_topic_score_gemma":0.0013459643,"teacher_disagreement_score":0.0024599861,"about_ca_system_score_codex":0.0009182478,"about_ca_system_score_gemma":0.00030159784,"threshold_uncertainty_score":0.0082294345},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7517852,0.00023093139,0.152655,0.00066038297,0.00016388783,0.00016830766,0.00214967,0.0011842889,0.091002315],"genre_scores_gemma":[0.9012142,0.0002509867,0.04627085,0.00026370698,0.00006685295,0.00015997441,0.0035523472,0.0003295575,0.04789167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976784,0.00003060638,0.000009807114,0.0000658103,0.000045426495,0.00008062424],"domain_scores_gemma":[0.999481,0.000106030435,0.00007900198,0.00010416562,0.00009867565,0.000131212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016242852,0.000581023,0.00028174702,0.0006428604,0.0008802854,0.0008959182,0.00060549803,0.0003104036,0.008892389],"category_scores_gemma":[0.0006572517,0.00031501436,0.00037924497,0.0006069798,0.00068992743,0.00087924005,0.00086944405,0.00061602,0.0015041478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074586587,0.00024127403,0.0050797635,0.00030594954,0.00004998196,0.0010030853,0.0013029667,0.048078097,0.053919423,0.7112812,0.039531674,0.1384607],"study_design_scores_gemma":[0.00013811655,0.00022778865,0.007593789,0.000060520997,0.0000690838,0.0011020809,0.00056808715,0.13121276,0.024447897,0.738335,0.096165314,0.00007955949],"about_ca_topic_score_codex":0.0050392733,"about_ca_topic_score_gemma":0.005823081,"teacher_disagreement_score":0.008892389,"about_ca_system_score_codex":0.0011227588,"about_ca_system_score_gemma":0.00064069853,"threshold_uncertainty_score":0.029748023},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6700706,0.0012599224,0.26732752,0.0021437448,0.00012227733,0.0000758525,0.0013257131,0.00047437934,0.057199936],"genre_scores_gemma":[0.9398823,0.00084317045,0.045680005,0.00051769963,0.00014603607,0.00013594466,0.0013054453,0.00023427633,0.011255241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897003,0.0002562966,0.000044759683,0.00029335328,0.00025953198,0.00017602328],"domain_scores_gemma":[0.9964469,0.0012952136,0.00063294196,0.00046106614,0.000476802,0.00068718696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006967089,0.00060921645,0.0006552743,0.0019165886,0.0017978786,0.001798726,0.0012304309,0.0008851915,0.0068554976],"category_scores_gemma":[0.0039402046,0.00046067705,0.0007367353,0.0019449847,0.0017645496,0.0056261662,0.0019852982,0.0020976018,0.00067510735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007484745,0.00002735839,0.0013000324,0.00009005624,0.000016363447,0.00011684089,0.00031324982,0.007698471,0.0024712938,0.97490454,0.0025507696,0.010436271],"study_design_scores_gemma":[0.000018347557,0.000050804083,0.0018283095,0.000035623612,0.000024367326,0.0003989971,0.00028160165,0.05685767,0.0019177053,0.9257766,0.012771653,0.000038415626],"about_ca_topic_score_codex":0.0018067377,"about_ca_topic_score_gemma":0.0017729409,"teacher_disagreement_score":0.0068554976,"about_ca_system_score_codex":0.0020303966,"about_ca_system_score_gemma":0.00055225147,"threshold_uncertainty_score":0.0229339},"labels":[],"label_agreement":null},{"id":"W4411720731","doi":"10.61091/ars163-04","title":"Bounds on inverse sum indeg index of graph operations","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Inverse; Index (typography); Graph; Combinatorics; Computer science; Geometry","score_opus":0.010714163844504186,"score_gpt":0.24102494779738665,"score_spread":0.23031078395288246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411720731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11909033,0.004980598,0.5822532,0.0037541015,0.0012781295,0.00029410326,0.003944724,0.004484268,0.27992046],"genre_scores_gemma":[0.7311247,0.0040709823,0.17741615,0.0021872493,0.0027389782,0.0009444286,0.0058070556,0.004375383,0.0713351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950454,0.00068563106,0.00027146668,0.0010393261,0.0020427199,0.000915432],"domain_scores_gemma":[0.98594993,0.00810853,0.0007050836,0.002594652,0.0016069422,0.0010348655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032823216,0.0024344085,0.0018822872,0.0056001656,0.002012084,0.0067539597,0.0042839935,0.0015471757,0.022547988],"category_scores_gemma":[0.019309197,0.0009089971,0.001957328,0.0053316588,0.0034902738,0.018581111,0.0063599595,0.006397216,0.0067625567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006075313,0.00023596284,0.001525895,0.00045421696,0.000058511552,0.00021771548,0.0005710969,0.012337174,0.0029522416,0.8515461,0.020903416,0.108590156],"study_design_scores_gemma":[0.000038018152,0.000099856414,0.000610767,0.0000840978,0.00006519543,0.0002709044,0.00007281078,0.045872524,0.003531986,0.93186927,0.01743074,0.000053853702],"about_ca_topic_score_codex":0.0014343146,"about_ca_topic_score_gemma":0.0018447865,"teacher_disagreement_score":0.022547988,"about_ca_system_score_codex":0.0038958404,"about_ca_system_score_gemma":0.0016340106,"threshold_uncertainty_score":0.07543051},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24826328,0.0021628663,0.7194905,0.0021851344,0.00016855643,0.00032654539,0.0016597811,0.0036937112,0.022049528],"genre_scores_gemma":[0.75384116,0.0013739271,0.22823046,0.00086247525,0.00017341279,0.00015442741,0.004655932,0.0004606633,0.010247443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877864,0.00013978555,0.0000790049,0.00053701096,0.00025789646,0.00020764065],"domain_scores_gemma":[0.9953506,0.0022434324,0.0005441863,0.0011374779,0.00045967946,0.00026463563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005254158,0.0006746996,0.00086916203,0.0010792285,0.0009423286,0.0020748521,0.0018961827,0.0018784594,0.0050362567],"category_scores_gemma":[0.0041194977,0.00065849215,0.0010641173,0.0016780668,0.0022294025,0.00653142,0.0024387736,0.0024778175,0.0013561401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009011404,0.00035192101,0.01248857,0.0010993972,0.00015086016,0.0010480618,0.0018238602,0.10440668,0.03847212,0.4077607,0.025213776,0.40628296],"study_design_scores_gemma":[0.000065674125,0.00013277664,0.0039428705,0.00009420321,0.00006256166,0.00105878,0.0007758199,0.22084278,0.033935674,0.70679146,0.0322026,0.00009488448],"about_ca_topic_score_codex":0.004284915,"about_ca_topic_score_gemma":0.0034871553,"teacher_disagreement_score":0.0050362567,"about_ca_system_score_codex":0.0011130405,"about_ca_system_score_gemma":0.00076732715,"threshold_uncertainty_score":0.016847968},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76896214,0.0035003938,0.0938287,0.002577805,0.00025152796,0.000041459887,0.00047275194,0.00029555324,0.13006961],"genre_scores_gemma":[0.97130346,0.0015058273,0.017773144,0.0002860417,0.00022257707,0.000050489016,0.00035016972,0.00017795623,0.008330371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992893,0.0001708574,0.000026013427,0.00016501751,0.0001518177,0.00019703506],"domain_scores_gemma":[0.99521846,0.0032805032,0.0004391496,0.0004128983,0.00031797515,0.00033093177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087925885,0.00048800666,0.00060148985,0.0020104016,0.0012217544,0.0023039992,0.00091160514,0.00073057576,0.004305786],"category_scores_gemma":[0.0048570274,0.00036755047,0.00038258338,0.0015994658,0.003101445,0.0033772802,0.0015106357,0.0016306582,0.0006337451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039360535,0.0001062546,0.006495486,0.000121225334,0.000031474345,0.00016482855,0.00073625334,0.039218258,0.01056281,0.91173476,0.0066974005,0.02373759],"study_design_scores_gemma":[0.000036328896,0.000049800597,0.0028395883,0.000069175905,0.000023452545,0.0001544559,0.00034550688,0.0896482,0.00456747,0.8945791,0.007644606,0.000042343727],"about_ca_topic_score_codex":0.0029734334,"about_ca_topic_score_gemma":0.0030042045,"teacher_disagreement_score":0.004305786,"about_ca_system_score_codex":0.0021820394,"about_ca_system_score_gemma":0.0006716688,"threshold_uncertainty_score":0.015831888},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15321478,0.0055926833,0.6913298,0.008286641,0.0006023045,0.00024997574,0.002250509,0.002654636,0.1358186],"genre_scores_gemma":[0.75983685,0.0041300515,0.19217606,0.002418674,0.0006523915,0.00066872744,0.0023425173,0.0011059281,0.03666885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980665,0.00026012672,0.000068773676,0.00053057476,0.00039904303,0.00067495747],"domain_scores_gemma":[0.99486405,0.0030187725,0.00032044816,0.00097360497,0.00037662894,0.00044645168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001328467,0.002014068,0.001239365,0.0016165952,0.0020676365,0.0026340869,0.0032674975,0.0014823059,0.0153921],"category_scores_gemma":[0.0057480526,0.0006800888,0.0012078638,0.0017835906,0.0029000014,0.0066171824,0.0029559387,0.004071,0.0032914132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016407553,0.00036012701,0.004737574,0.0014601491,0.00022594277,0.0004278897,0.00075355533,0.27687272,0.0519219,0.48333335,0.052475553,0.12579057],"study_design_scores_gemma":[0.00016225158,0.00047875915,0.0039019103,0.00024746257,0.00020179006,0.0010594077,0.00041196254,0.60037404,0.02614397,0.30383706,0.06300255,0.00017891423],"about_ca_topic_score_codex":0.004040633,"about_ca_topic_score_gemma":0.007134512,"teacher_disagreement_score":0.0153921,"about_ca_system_score_codex":0.0036613108,"about_ca_system_score_gemma":0.0016572129,"threshold_uncertainty_score":0.051491678},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5024087,0.0024727308,0.21804433,0.0019293547,0.0004980484,0.00011319026,0.0018052572,0.0012857249,0.2714427],"genre_scores_gemma":[0.9183201,0.001014213,0.06353903,0.00033939964,0.00007221681,0.000071804905,0.0008635967,0.0002118554,0.015567678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955493,0.000062330335,0.000013482141,0.000071735885,0.00016272922,0.00013472611],"domain_scores_gemma":[0.9993042,0.00023134309,0.00008857075,0.00012506523,0.000119045246,0.00013176781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014616972,0.0004457826,0.00044522883,0.0007989834,0.0015691925,0.0010312614,0.00084774545,0.00067873485,0.008808761],"category_scores_gemma":[0.0011905234,0.0003672995,0.00045329024,0.0012600824,0.00094691146,0.0013403766,0.0014818587,0.0019541997,0.00071061484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014718492,0.000040614985,0.0008431659,0.0003391959,0.000019292529,0.00089674024,0.00064015307,0.014745252,0.012416931,0.9063627,0.010766109,0.052782614],"study_design_scores_gemma":[0.00007246806,0.00007074453,0.0019136005,0.00006902748,0.000040782223,0.0021318765,0.00055614434,0.037949882,0.0098218825,0.8622326,0.08504198,0.00009893089],"about_ca_topic_score_codex":0.0040310994,"about_ca_topic_score_gemma":0.009196121,"teacher_disagreement_score":0.008808761,"about_ca_system_score_codex":0.0009156338,"about_ca_system_score_gemma":0.000689374,"threshold_uncertainty_score":0.029468238},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57983655,0.0009382553,0.3490571,0.00097123085,0.00016271051,0.00011329889,0.0008718994,0.00032094188,0.067728005],"genre_scores_gemma":[0.89165527,0.000552949,0.095088705,0.00019663546,0.0001203378,0.000085441636,0.00047284662,0.000066250424,0.011761607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993857,0.00011455804,0.000022219487,0.00018110932,0.00018137014,0.00011503054],"domain_scores_gemma":[0.9980253,0.00084341504,0.00029359703,0.00027324288,0.00034168462,0.00022272975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005553476,0.0003826215,0.00034737145,0.0013594708,0.0011239616,0.0014214511,0.00059078075,0.0005683567,0.004485032],"category_scores_gemma":[0.0026952124,0.0002555046,0.00049943983,0.0014129296,0.0016468712,0.0019998814,0.000843432,0.0012390504,0.00029959835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013330439,0.00003717557,0.0007444949,0.0000887318,0.000017773935,0.000073814306,0.00024901592,0.024982959,0.0051763672,0.9470854,0.0017367329,0.019674258],"study_design_scores_gemma":[0.00003309042,0.000061623265,0.0012839125,0.000023211851,0.00002197985,0.00015034447,0.00021165097,0.09991407,0.0028231936,0.8861177,0.009322182,0.000037040114],"about_ca_topic_score_codex":0.0064855926,"about_ca_topic_score_gemma":0.005907066,"teacher_disagreement_score":0.0064855926,"about_ca_system_score_codex":0.001959633,"about_ca_system_score_gemma":0.0008439187,"threshold_uncertainty_score":0.015003979},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72508967,0.0020937216,0.22473945,0.002366614,0.00032289943,0.00009019067,0.0032009801,0.00032681815,0.04176967],"genre_scores_gemma":[0.94645673,0.0008522131,0.047362685,0.00022757988,0.00030252628,0.000112266905,0.0010721531,0.000048595277,0.0035652788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991547,0.00015197297,0.000064474094,0.00028944737,0.00021122991,0.00012823526],"domain_scores_gemma":[0.99763834,0.0011371273,0.00037629937,0.0003099141,0.00022380125,0.00031450883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005873515,0.00043632876,0.00049098,0.0019418539,0.00097459333,0.0019353873,0.0006289344,0.00057431334,0.0021027715],"category_scores_gemma":[0.002838227,0.00025921507,0.00062259915,0.0016513168,0.001965979,0.0030083447,0.0015087252,0.0009839643,0.00029340415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012750286,0.000036154688,0.003453096,0.00016045925,0.00003889719,0.000114339375,0.000427447,0.009589245,0.0060994257,0.948919,0.004382372,0.026652006],"study_design_scores_gemma":[0.000020109044,0.00007418351,0.003391323,0.00004131585,0.000025271389,0.0004928815,0.00019335996,0.038525432,0.0029992952,0.93628424,0.017902322,0.00005017545],"about_ca_topic_score_codex":0.00058076053,"about_ca_topic_score_gemma":0.0004916331,"teacher_disagreement_score":0.0021027715,"about_ca_system_score_codex":0.0012836533,"about_ca_system_score_gemma":0.00058555807,"threshold_uncertainty_score":0.009313643},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7026399,0.0036336286,0.1350544,0.0026062739,0.0002687156,0.00005685301,0.0006264779,0.00050288625,0.15461092],"genre_scores_gemma":[0.96620107,0.0015499942,0.017138707,0.00024757796,0.00023618965,0.00006160776,0.00040494217,0.00017034716,0.013989604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939895,0.00012079609,0.000019491094,0.00017573347,0.00014932154,0.0001357449],"domain_scores_gemma":[0.9970092,0.0018715201,0.00036343597,0.00023213497,0.00023592058,0.00028780985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000764265,0.0005392285,0.00048480288,0.0026297497,0.0015030281,0.0018805491,0.0010237868,0.0008639819,0.0067699016],"category_scores_gemma":[0.0044325697,0.0004044832,0.00042077753,0.0019045669,0.0029903827,0.0035504168,0.0014402906,0.0017405346,0.0005844053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017066633,0.000042001495,0.0016089774,0.00014275899,0.000022484352,0.00010297195,0.0004413415,0.0306587,0.004528425,0.9452286,0.004627617,0.012425386],"study_design_scores_gemma":[0.0000295763,0.00004172228,0.0018156443,0.000047607547,0.000027956703,0.00016396426,0.00028732145,0.0871852,0.0019374528,0.9000522,0.008366071,0.00004531572],"about_ca_topic_score_codex":0.0043422976,"about_ca_topic_score_gemma":0.0058210497,"teacher_disagreement_score":0.0067699016,"about_ca_system_score_codex":0.002465342,"about_ca_system_score_gemma":0.00060909794,"threshold_uncertainty_score":0.02264756},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82756346,0.006648016,0.0918519,0.003465019,0.00042106802,0.000051727126,0.0013646743,0.00032539075,0.068308644],"genre_scores_gemma":[0.97479445,0.0021209973,0.01630617,0.00048263615,0.00050482975,0.0000804188,0.000838506,0.00013925714,0.0047328263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909484,0.00027694355,0.000034931993,0.00022005556,0.00016895238,0.00020430531],"domain_scores_gemma":[0.99412835,0.00353226,0.00070639775,0.0003759752,0.00042875926,0.0008282308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083508267,0.0010034068,0.0009743525,0.0025718855,0.0012215378,0.0023409708,0.0014372563,0.0010221725,0.0044471803],"category_scores_gemma":[0.0050468286,0.00043340362,0.00048924884,0.0018543307,0.002528487,0.003799663,0.0022471917,0.0021755933,0.00080116576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002730763,0.00009858377,0.004208504,0.00023821682,0.000059420716,0.00017969139,0.00054313795,0.01722972,0.007530637,0.93415624,0.011344976,0.024137774],"study_design_scores_gemma":[0.000030244284,0.00008246873,0.003452185,0.00006596366,0.000042360025,0.0003334261,0.0002312136,0.07307008,0.0030500456,0.91068846,0.0088665495,0.00008700844],"about_ca_topic_score_codex":0.0010106354,"about_ca_topic_score_gemma":0.0010652336,"teacher_disagreement_score":0.0044471803,"about_ca_system_score_codex":0.0013013906,"about_ca_system_score_gemma":0.0005743267,"threshold_uncertainty_score":0.014877319},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7513337,0.00266026,0.13951933,0.010192754,0.0004715275,0.0001269127,0.002781263,0.0012044575,0.09170974],"genre_scores_gemma":[0.97308844,0.0010323554,0.019289188,0.0010001095,0.00024511685,0.00006793924,0.0015086189,0.00008836813,0.0036797903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745554,0.00050240126,0.00017782037,0.00089737086,0.0004438323,0.00052307895],"domain_scores_gemma":[0.98680127,0.007208027,0.0016585434,0.002538133,0.0008497988,0.00094422756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020490317,0.00070197,0.0009985194,0.0014921451,0.0023487457,0.0034832305,0.0018060094,0.0025145186,0.0065582073],"category_scores_gemma":[0.011789087,0.0007253869,0.0011988687,0.0025913354,0.0053110034,0.00816786,0.0027645258,0.002595002,0.0006189567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019393444,0.000077154524,0.007272039,0.00020702396,0.00002396483,0.0002450166,0.0013551317,0.011809248,0.0017651157,0.9551741,0.008019409,0.0138578415],"study_design_scores_gemma":[0.000032878717,0.000036425714,0.0018783383,0.00004411061,0.00002125524,0.00033399684,0.00072045415,0.011919058,0.001010925,0.9762635,0.0077037746,0.000035225505],"about_ca_topic_score_codex":0.0025906207,"about_ca_topic_score_gemma":0.002600108,"teacher_disagreement_score":0.0065582073,"about_ca_system_score_codex":0.0017854857,"about_ca_system_score_gemma":0.00082454423,"threshold_uncertainty_score":0.021939397},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83575827,0.00071028125,0.12698108,0.00039611186,0.00007599112,0.00005860642,0.00095425046,0.0003109641,0.03475438],"genre_scores_gemma":[0.96751183,0.00029301987,0.027195053,0.00009735166,0.000048062582,0.00003992531,0.00086586736,0.000053802905,0.003895153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995478,0.000084666994,0.000028851831,0.000116971794,0.00014178824,0.00007997303],"domain_scores_gemma":[0.99888355,0.0003291859,0.00018312539,0.00013674852,0.00024146217,0.00022592748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003952608,0.00033988585,0.00038249584,0.0015877412,0.0004575311,0.0007570924,0.00037496645,0.00030790715,0.0030883527],"category_scores_gemma":[0.0019895288,0.00025239697,0.0002759129,0.00083929754,0.0007807204,0.0015141021,0.0007630537,0.0005051714,0.0003872767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009318258,0.000078071134,0.013278542,0.00035939136,0.000059333655,0.00066793483,0.0007911109,0.022725306,0.03171947,0.8236541,0.007289268,0.09844563],"study_design_scores_gemma":[0.00006832554,0.00026919745,0.008763111,0.00007216981,0.000052794112,0.0021838876,0.00046199953,0.11026747,0.0133812195,0.8317175,0.03270859,0.000053709642],"about_ca_topic_score_codex":0.0007740009,"about_ca_topic_score_gemma":0.0010041082,"teacher_disagreement_score":0.0030883527,"about_ca_system_score_codex":0.0006535651,"about_ca_system_score_gemma":0.00037797974,"threshold_uncertainty_score":0.010331571},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17883664,0.0021243652,0.710568,0.0022493687,0.0006732688,0.00016812957,0.0006206511,0.0018065206,0.10295304],"genre_scores_gemma":[0.59074074,0.0023871302,0.3864472,0.0009172954,0.0002565483,0.00029774854,0.0007142242,0.0007568781,0.01748223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999231,0.00023918442,0.000049364095,0.00017998868,0.00014942419,0.00015115313],"domain_scores_gemma":[0.99914277,0.00028668248,0.00013904939,0.00020260896,0.00008451082,0.00014433774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005711047,0.0012403523,0.0006123526,0.0014859636,0.001939674,0.0021524695,0.0014381572,0.0011620685,0.0057833437],"category_scores_gemma":[0.0019044228,0.00087271,0.0010241537,0.0019153312,0.0034185478,0.0042403243,0.004070151,0.0026663481,0.0017230199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005102962,0.00002803327,0.00038337312,0.00011443372,0.000012018994,0.00021404758,0.00046992023,0.0049241534,0.0033902505,0.96968085,0.003421066,0.017310753],"study_design_scores_gemma":[0.000033212265,0.00005938953,0.00039707762,0.0000652644,0.000027556369,0.0005195188,0.0003274015,0.008069657,0.0039454084,0.9526848,0.033821136,0.000049658778],"about_ca_topic_score_codex":0.00045080477,"about_ca_topic_score_gemma":0.0007559958,"teacher_disagreement_score":0.0057833437,"about_ca_system_score_codex":0.0010598515,"about_ca_system_score_gemma":0.0003318685,"threshold_uncertainty_score":0.01934725},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7007432,0.0023909505,0.22408186,0.0015066598,0.00013646325,0.000094393,0.00075001374,0.00040281334,0.069893695],"genre_scores_gemma":[0.9495281,0.0013853449,0.042282715,0.00026723894,0.0001726662,0.00011129748,0.00055059296,0.00013946963,0.0055625956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992539,0.00016422718,0.00002750756,0.00017119109,0.0001772858,0.00020590024],"domain_scores_gemma":[0.99395084,0.004182857,0.0006376982,0.00045679495,0.00034786592,0.0004239964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010458945,0.00064534653,0.0005133198,0.0024309037,0.0011882444,0.001894173,0.0011694222,0.0006184239,0.0047607184],"category_scores_gemma":[0.007026196,0.0004648706,0.0003463325,0.002401803,0.0032950318,0.0033283352,0.0016220432,0.0011316335,0.00048157375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063299685,0.00016032354,0.011609188,0.00031690465,0.00006162313,0.00020881358,0.00069373904,0.12439961,0.017399702,0.7761168,0.008312204,0.060088005],"study_design_scores_gemma":[0.0000910555,0.00014664582,0.007076054,0.0001345885,0.000054483946,0.0004157412,0.00040466004,0.2293267,0.009279706,0.7395225,0.013466542,0.00008135359],"about_ca_topic_score_codex":0.0037766441,"about_ca_topic_score_gemma":0.0038326604,"teacher_disagreement_score":0.0047607184,"about_ca_system_score_codex":0.0025100757,"about_ca_system_score_gemma":0.0007026343,"threshold_uncertainty_score":0.018211901},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64830345,0.0021090729,0.32075697,0.0018452132,0.00015781989,0.00018251904,0.0010304829,0.0005572207,0.025057161],"genre_scores_gemma":[0.9107583,0.0012917741,0.07853687,0.00032725921,0.00015670879,0.00013760026,0.0010721548,0.00015264623,0.00756668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901795,0.00026403274,0.00005251086,0.0003479613,0.00013651529,0.00018099796],"domain_scores_gemma":[0.9942338,0.0038645444,0.0007949209,0.0005672403,0.00019076918,0.0003486573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056746736,0.0007686533,0.00058686995,0.0008692117,0.001047708,0.003042036,0.0011679683,0.0014370512,0.0034818207],"category_scores_gemma":[0.0060850563,0.0006605507,0.0006485747,0.0015560478,0.001886822,0.0047702305,0.0019199508,0.0014886128,0.0004162982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010762168,0.0002857646,0.012097895,0.0005930887,0.000119156735,0.0004841579,0.0007327842,0.12255198,0.017827371,0.72315735,0.009493637,0.11158057],"study_design_scores_gemma":[0.000062809486,0.000054813197,0.0017489387,0.000044176526,0.000042035233,0.00027159936,0.00026962458,0.11713727,0.0053260396,0.86753273,0.0074754604,0.000034593533],"about_ca_topic_score_codex":0.002097139,"about_ca_topic_score_gemma":0.0022101346,"teacher_disagreement_score":0.0034818207,"about_ca_system_score_codex":0.0011976383,"about_ca_system_score_gemma":0.0006284045,"threshold_uncertainty_score":0.01164788},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8057446,0.0017306576,0.16822474,0.00095088134,0.000056302728,0.000056332483,0.0007814814,0.0003182309,0.022136763],"genre_scores_gemma":[0.9689793,0.00056701095,0.027828744,0.00012109629,0.00007011444,0.0000630386,0.00048487366,0.000073058574,0.0018127013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992918,0.00013194235,0.000033314056,0.00020643379,0.0001815573,0.000154926],"domain_scores_gemma":[0.9942861,0.0037605371,0.0006485222,0.0004742143,0.00033838782,0.0004922868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009035488,0.00050990883,0.00064988405,0.0014615747,0.00073346694,0.0011741432,0.0008194868,0.00052147073,0.0020725913],"category_scores_gemma":[0.0041742264,0.00037683072,0.0005549055,0.0009250168,0.0020535071,0.0030127503,0.0015793158,0.0014150147,0.00022488396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058711716,0.00008420008,0.013091726,0.00028318053,0.000065056964,0.00026494343,0.0007294952,0.04783559,0.024698,0.8891081,0.0031935729,0.0200591],"study_design_scores_gemma":[0.00006964181,0.00018924849,0.010590684,0.000109965484,0.000092645794,0.00042277653,0.00039884023,0.16289431,0.0154364435,0.79894024,0.01079222,0.00006293329],"about_ca_topic_score_codex":0.0008351587,"about_ca_topic_score_gemma":0.0013257653,"teacher_disagreement_score":0.0020725913,"about_ca_system_score_codex":0.001138083,"about_ca_system_score_gemma":0.00037617984,"threshold_uncertainty_score":0.008257389},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8746025,0.00050894514,0.10532938,0.00007245945,0.00004280689,0.000033831177,0.00040709903,0.00030284972,0.018700143],"genre_scores_gemma":[0.97631377,0.00018485171,0.021293703,0.00001836697,0.00002818508,0.000022740456,0.0003590196,0.00008056619,0.0016987367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997594,0.000028846327,0.000010077104,0.00006426222,0.00008020591,0.00005717813],"domain_scores_gemma":[0.9992436,0.0002455066,0.00013256357,0.00010780005,0.00013874417,0.00013168772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003295719,0.0002873194,0.00029949925,0.0018014765,0.0005228913,0.0008061808,0.00045910434,0.0003255472,0.0022132264],"category_scores_gemma":[0.0017611622,0.00016151961,0.0003896711,0.0009518112,0.00074992015,0.0015627779,0.00077186123,0.00038924394,0.0002377656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006849463,0.0002016442,0.058873244,0.00039232225,0.00013928232,0.0007063923,0.0010908446,0.07211132,0.06632726,0.67896986,0.007873002,0.11263],"study_design_scores_gemma":[0.000039937255,0.00037069194,0.05751158,0.000054397242,0.00010966509,0.0016468333,0.00059872,0.3359702,0.032792654,0.55481416,0.015979998,0.00011104776],"about_ca_topic_score_codex":0.00074217183,"about_ca_topic_score_gemma":0.0008934567,"teacher_disagreement_score":0.0022132264,"about_ca_system_score_codex":0.0006958814,"about_ca_system_score_gemma":0.00033433532,"threshold_uncertainty_score":0.0074040294},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73525363,0.0003002048,0.21950997,0.0006070361,0.00010360591,0.000042334545,0.0002788033,0.0007235884,0.04318084],"genre_scores_gemma":[0.97559345,0.00008570553,0.020423267,0.00009157319,0.000047454298,0.000028415814,0.00017978197,0.000059638758,0.0034907346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991186,0.00015154429,0.00004688395,0.00033744535,0.00017323413,0.00017224801],"domain_scores_gemma":[0.9943651,0.0033076487,0.00039930077,0.0009196762,0.00035332394,0.00065484416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007934391,0.00036882164,0.0003845288,0.0010365453,0.0015011079,0.001732872,0.0010809221,0.00050362735,0.004252004],"category_scores_gemma":[0.003184319,0.00036242572,0.00067353866,0.000645876,0.0026760853,0.0039071944,0.0027576433,0.0020669596,0.0003037103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109509936,0.000051413084,0.0020144621,0.00007017062,0.000012457651,0.00013453943,0.00050539424,0.003965119,0.010281382,0.9710876,0.00069480785,0.011073284],"study_design_scores_gemma":[0.000021958456,0.000064979846,0.0011148932,0.00001862334,0.000023431614,0.00033891018,0.00018817555,0.021716798,0.010104422,0.9602173,0.0061624297,0.000027992348],"about_ca_topic_score_codex":0.0005987196,"about_ca_topic_score_gemma":0.0009148782,"teacher_disagreement_score":0.004252004,"about_ca_system_score_codex":0.0014612561,"about_ca_system_score_gemma":0.00046706016,"threshold_uncertainty_score":0.01422441},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8688939,0.00048215585,0.10275628,0.0008327077,0.000024818082,0.000044328583,0.0007242148,0.00025902133,0.025982441],"genre_scores_gemma":[0.9828787,0.00018491804,0.01398479,0.00006490572,0.00005932461,0.000049964146,0.0005521012,0.00004974264,0.002175745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872965,0.00023854744,0.00007509736,0.000504361,0.0002576176,0.00019462267],"domain_scores_gemma":[0.99632794,0.0018128919,0.00074652676,0.00044604132,0.00027786448,0.0003888542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007388249,0.0003869702,0.0005382921,0.0031667405,0.0016431317,0.0038290753,0.0008947742,0.00089183013,0.003036686],"category_scores_gemma":[0.003347104,0.00044041293,0.00058612094,0.002152531,0.0032647806,0.006457194,0.0024991338,0.0013006706,0.00024387284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008520769,0.000030947976,0.006969797,0.00004510662,0.000017033495,0.00009972919,0.0007570442,0.004490852,0.0021344647,0.97400224,0.0010402447,0.010327284],"study_design_scores_gemma":[0.000019856654,0.000039926636,0.005041458,0.000032056356,0.000028596256,0.00040466472,0.00095996715,0.027696354,0.0023528305,0.95473987,0.00865331,0.00003114511],"about_ca_topic_score_codex":0.0014959623,"about_ca_topic_score_gemma":0.0015649229,"teacher_disagreement_score":0.0038290753,"about_ca_system_score_codex":0.002057674,"about_ca_system_score_gemma":0.00037453847,"threshold_uncertainty_score":0.014929533},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36388475,0.0020237898,0.23008259,0.007972487,0.0015400234,0.00019927284,0.0017434816,0.002635876,0.3899178],"genre_scores_gemma":[0.9510475,0.0004450216,0.020448387,0.0006479048,0.001247314,0.00023627125,0.00060014956,0.0004971274,0.024830349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979584,0.00031423164,0.00012290746,0.0004656136,0.0007119632,0.0004267787],"domain_scores_gemma":[0.99448025,0.0027932394,0.00047066202,0.0007999251,0.00077863544,0.00067725516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014113844,0.000907497,0.0008253783,0.0029585273,0.0018184652,0.00474043,0.0018457833,0.0016784566,0.021964965],"category_scores_gemma":[0.007605999,0.0006511345,0.0007057007,0.001920035,0.004192502,0.011843692,0.004241126,0.003683101,0.0031156288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008252673,0.000025599304,0.0004304626,0.000054170992,0.000007796708,0.00013488415,0.00031253448,0.00058411097,0.0017500216,0.98246056,0.0028152808,0.011342027],"study_design_scores_gemma":[0.00002435249,0.000034702425,0.000246164,0.000024681269,0.000010485509,0.00014304878,0.00015047878,0.0024448968,0.0018380979,0.98466426,0.010401271,0.000017538801],"about_ca_topic_score_codex":0.00050852867,"about_ca_topic_score_gemma":0.0003121786,"teacher_disagreement_score":0.021964965,"about_ca_system_score_codex":0.0018242646,"about_ca_system_score_gemma":0.00049858936,"threshold_uncertainty_score":0.07348013},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14195813,0.0006141633,0.7673105,0.0005766161,0.00024364662,0.00009996263,0.00044904638,0.0004458745,0.08830202],"genre_scores_gemma":[0.7811505,0.0013005547,0.1874231,0.00042668585,0.0001899464,0.00012790666,0.00096973544,0.00026306487,0.0281485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979264,0.000036121994,0.0000068028617,0.00007194823,0.000053186,0.000039396487],"domain_scores_gemma":[0.99964046,0.000089571455,0.000031992986,0.000057509933,0.00011820005,0.0000622418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021933705,0.00037139625,0.00020539548,0.00074478803,0.0007723398,0.0006029299,0.0005737588,0.00030091027,0.005752736],"category_scores_gemma":[0.0010214876,0.00018260865,0.0005946924,0.000749108,0.0006064779,0.0011027335,0.0006239666,0.0011583897,0.00071001373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052663534,0.000066655215,0.0022550588,0.00015816826,0.000021729778,0.0004645345,0.00053484295,0.030434774,0.007924616,0.8834847,0.012490186,0.06211199],"study_design_scores_gemma":[0.000021473546,0.00006828302,0.0018268703,0.000051203107,0.000043577067,0.00090759766,0.0004192137,0.19146308,0.005714896,0.7561372,0.043306604,0.00003992413],"about_ca_topic_score_codex":0.0036970202,"about_ca_topic_score_gemma":0.0039493944,"teacher_disagreement_score":0.005752736,"about_ca_system_score_codex":0.0008783249,"about_ca_system_score_gemma":0.0006478513,"threshold_uncertainty_score":0.01924485},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072537765,0.0009541791,0.91855377,0.00092188135,0.00009366785,0.00016546948,0.0009749078,0.000689831,0.0051084687],"genre_scores_gemma":[0.5825463,0.0012590439,0.41155162,0.00047210322,0.00021635529,0.00037342648,0.0011164073,0.00017921522,0.0022856607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99721944,0.00073089986,0.00022293588,0.00091907446,0.0006431845,0.00026450213],"domain_scores_gemma":[0.98687035,0.008563604,0.0016213743,0.0018586933,0.0006722791,0.0004136804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015401389,0.0009953319,0.0010918733,0.0018074851,0.0010535467,0.0026077118,0.002641678,0.0013982487,0.0019087002],"category_scores_gemma":[0.009282069,0.00072781625,0.0009982854,0.002823938,0.0021180413,0.0083035035,0.0023608452,0.0019463226,0.00031400597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045088094,0.00021381935,0.0041113887,0.00074802834,0.00012894059,0.00034599678,0.00091512257,0.23999801,0.022137297,0.6348456,0.0065804026,0.08952454],"study_design_scores_gemma":[0.000055860884,0.00016433057,0.0014405434,0.0001006679,0.00007651949,0.0006621001,0.00025851806,0.39355046,0.013660315,0.5743034,0.015669465,0.000057830493],"about_ca_topic_score_codex":0.0009363684,"about_ca_topic_score_gemma":0.00096250826,"teacher_disagreement_score":0.002641678,"about_ca_system_score_codex":0.0018766491,"about_ca_system_score_gemma":0.0007437418,"threshold_uncertainty_score":0.013616145},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9127874,0.00019629058,0.060948282,0.00064618,0.0000819079,0.00010857618,0.0011128958,0.0003304388,0.023788089],"genre_scores_gemma":[0.96567065,0.00013770675,0.021087024,0.00020718771,0.00012908697,0.00012388697,0.0018121429,0.000164848,0.010667556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940217,0.00013718444,0.000036111604,0.00016695831,0.00012945413,0.00012813145],"domain_scores_gemma":[0.9953797,0.002499101,0.0006509093,0.00039334752,0.00029772962,0.000779194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004494277,0.0007268618,0.00080233894,0.0013894546,0.001574463,0.0024180918,0.0011563903,0.0007667026,0.00623314],"category_scores_gemma":[0.002718277,0.0012390215,0.0007074407,0.0010715383,0.0015079108,0.0022710066,0.0016592371,0.001546092,0.000652411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096011785,0.00047690218,0.0072802966,0.00024556046,0.000071378796,0.00086229877,0.0025424282,0.00525283,0.034429207,0.9122387,0.01146622,0.02417406],"study_design_scores_gemma":[0.00017760256,0.00014227742,0.006637789,0.000032533342,0.00004691225,0.0008234005,0.0007517871,0.02481414,0.006274082,0.9537256,0.006536164,0.000037757185],"about_ca_topic_score_codex":0.0010993037,"about_ca_topic_score_gemma":0.0017334092,"teacher_disagreement_score":0.00623314,"about_ca_system_score_codex":0.0006881409,"about_ca_system_score_gemma":0.0004149703,"threshold_uncertainty_score":0.02085191},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34220552,0.0019560673,0.6001983,0.0015178802,0.00015271112,0.00008581853,0.00071686466,0.0005463353,0.052620575],"genre_scores_gemma":[0.93655175,0.0009647593,0.05583016,0.00022520634,0.00021975984,0.00010196669,0.00065094366,0.00010960952,0.0053459094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850047,0.00044643963,0.000084296524,0.00046736348,0.00025913827,0.00024234847],"domain_scores_gemma":[0.9946386,0.0031154612,0.00060424546,0.0008315149,0.0004429906,0.00036724124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011870373,0.0006187883,0.0007050302,0.0012412333,0.0010907749,0.001712145,0.0006885346,0.0006657344,0.0047994126],"category_scores_gemma":[0.006212472,0.00039364668,0.0008482287,0.0011428725,0.003349989,0.003996949,0.0016412922,0.0013823161,0.0005458031],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012903009,0.000037641683,0.00084794895,0.00009252346,0.000019137302,0.00016200352,0.00043406972,0.010218975,0.0028374144,0.96503067,0.0019063203,0.018284338],"study_design_scores_gemma":[0.000014004577,0.000025932324,0.00026505388,0.000026161199,0.0000069249577,0.00012142876,0.000095388,0.022209782,0.0007311612,0.9732144,0.0032746645,0.000015026209],"about_ca_topic_score_codex":0.0018742424,"about_ca_topic_score_gemma":0.0011698724,"teacher_disagreement_score":0.0047994126,"about_ca_system_score_codex":0.0010321828,"about_ca_system_score_gemma":0.00045636308,"threshold_uncertainty_score":0.016055703},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7649152,0.0008775798,0.19955361,0.002076957,0.00024507646,0.00009180513,0.0005223314,0.00047693626,0.03124047],"genre_scores_gemma":[0.9751032,0.00026218538,0.020097518,0.0003220967,0.00017341414,0.00006953663,0.00024876322,0.0001009828,0.0036223202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998273,0.0003657155,0.00011810322,0.0004967819,0.00035277542,0.0003936485],"domain_scores_gemma":[0.988981,0.0065846597,0.0012502843,0.00087697303,0.0007509902,0.0015560833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015718432,0.0008236231,0.0007805742,0.002269542,0.0029606647,0.0038530566,0.0009521786,0.0017592167,0.007592625],"category_scores_gemma":[0.010956022,0.0009111445,0.0009971461,0.0014558044,0.004398718,0.0074653975,0.0028266783,0.0028470233,0.0007148117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039189422,0.00009656009,0.004269094,0.00014313756,0.000040205465,0.00053865835,0.0010409396,0.006986127,0.00927415,0.9629288,0.002555531,0.011734928],"study_design_scores_gemma":[0.000048147584,0.000074762705,0.0012297925,0.00004087035,0.000023165134,0.0005109596,0.00038761238,0.020845683,0.0030787783,0.9704901,0.0032209351,0.00004918691],"about_ca_topic_score_codex":0.0017523818,"about_ca_topic_score_gemma":0.0010057171,"teacher_disagreement_score":0.007592625,"about_ca_system_score_codex":0.0010158839,"about_ca_system_score_gemma":0.00054893637,"threshold_uncertainty_score":0.025399864},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5327756,0.00040554756,0.28897926,0.0010323894,0.00026061622,0.00015408198,0.0019196094,0.0009588701,0.17351411],"genre_scores_gemma":[0.9057767,0.00026780076,0.056282956,0.00030820287,0.00013865564,0.00019005827,0.0025753905,0.00019044292,0.034269895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950576,0.000063917854,0.00002536756,0.00014280164,0.00017573648,0.00008635971],"domain_scores_gemma":[0.99911815,0.00023540291,0.000116939016,0.00015672768,0.00019821496,0.00017454996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027345328,0.00038565198,0.00040064412,0.0015582474,0.0013486454,0.0016305293,0.00071149744,0.0005840854,0.013242043],"category_scores_gemma":[0.0012865174,0.00032273852,0.0005268084,0.0011562124,0.0013302661,0.0021518185,0.0014080402,0.0010724115,0.0016069501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010388033,0.000028600241,0.00055747054,0.00005896854,0.000011890141,0.0000991218,0.00029964806,0.0025755588,0.0029919078,0.9671243,0.003263689,0.022884957],"study_design_scores_gemma":[0.000031796346,0.000051883464,0.0007812678,0.00002126594,0.000020805177,0.0002524258,0.00021666118,0.015487158,0.0038521402,0.9616723,0.017585393,0.000026861244],"about_ca_topic_score_codex":0.0011139521,"about_ca_topic_score_gemma":0.0010057603,"teacher_disagreement_score":0.013242043,"about_ca_system_score_codex":0.0007973721,"about_ca_system_score_gemma":0.00061452994,"threshold_uncertainty_score":0.044299006},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8383743,0.0001330412,0.13143735,0.00024439054,0.00004103826,0.0000810009,0.0012807017,0.0006593934,0.02774875],"genre_scores_gemma":[0.9540177,0.00016571993,0.031370297,0.00008168319,0.00001795016,0.00008421664,0.0014871573,0.00016119363,0.012614102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996196,0.000054348984,0.00002209556,0.00010094051,0.00009731852,0.000105670704],"domain_scores_gemma":[0.998621,0.00039166491,0.0002567432,0.0002821599,0.00022126823,0.00022716032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023711676,0.0004368336,0.00023896739,0.00061088597,0.0006512062,0.0009037442,0.00060600956,0.00021256566,0.0046680793],"category_scores_gemma":[0.0013338799,0.00041525188,0.0005758436,0.0009262375,0.00090803363,0.000837202,0.00094577624,0.00042987632,0.00047251402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007057584,0.00015799783,0.009233615,0.00049825036,0.00010743959,0.00069671636,0.0012665185,0.20527713,0.06694471,0.62599504,0.01149627,0.0776207],"study_design_scores_gemma":[0.0001471291,0.00029981782,0.011398928,0.00006540269,0.00009417601,0.0012230262,0.00079690083,0.35662043,0.04211445,0.5656182,0.021542437,0.00007907283],"about_ca_topic_score_codex":0.0027412209,"about_ca_topic_score_gemma":0.0046354327,"teacher_disagreement_score":0.0046680793,"about_ca_system_score_codex":0.0011169907,"about_ca_system_score_gemma":0.000638974,"threshold_uncertainty_score":0.015616298},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3716125,0.0011781255,0.4967479,0.0011473548,0.00019646587,0.0001322071,0.0005220935,0.0008671793,0.1275961],"genre_scores_gemma":[0.8298833,0.0011293628,0.11955701,0.00050360046,0.0002928857,0.00024221753,0.0009531226,0.00046819024,0.04697031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952376,0.0001215639,0.00002500394,0.00012783955,0.00013016442,0.00007176225],"domain_scores_gemma":[0.9976229,0.0013695268,0.00029569553,0.000236905,0.00025910616,0.00021583964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008804376,0.00057178666,0.00055922434,0.0019158553,0.0018752713,0.0020717464,0.0009867417,0.001038317,0.011207727],"category_scores_gemma":[0.0046269456,0.000536073,0.0010130797,0.0024201826,0.0018379923,0.0026155082,0.00078255276,0.0013175048,0.0012222874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014675009,0.000014794536,0.00021242508,0.000031958607,0.000003769598,0.00008035757,0.00023200843,0.003714334,0.0007345728,0.98513085,0.0011354827,0.008694883],"study_design_scores_gemma":[0.000014097905,0.000039714087,0.0004267383,0.000044490906,0.000013420497,0.00024850413,0.00015407476,0.046289917,0.0012358108,0.94156194,0.009948773,0.000022484923],"about_ca_topic_score_codex":0.0027122367,"about_ca_topic_score_gemma":0.001959341,"teacher_disagreement_score":0.011207727,"about_ca_system_score_codex":0.0021792713,"about_ca_system_score_gemma":0.00087769906,"threshold_uncertainty_score":0.037493587},"labels":[],"label_agreement":null},{"id":"W4414631968","doi":"10.61091/ars164-01","title":"Forbidden trees with diameter six for 3-connected graphs","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vertex (graph theory); Graph; Path (computing); Tree (set theory); Enhanced Data Rates for GSM Evolution","score_opus":0.009599087843447162,"score_gpt":0.23017516000203417,"score_spread":0.22057607215858702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414631968","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8565194,0.0015109166,0.08938688,0.0013656388,0.00018652891,0.000101671794,0.0010517011,0.0005470445,0.049330227],"genre_scores_gemma":[0.9604818,0.0009034441,0.030228421,0.00029980822,0.00008332339,0.00021917606,0.0008590641,0.00009836499,0.006826637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945194,0.00009669288,0.000040392362,0.00011991476,0.00016393095,0.00012713761],"domain_scores_gemma":[0.997995,0.0010859165,0.00038393305,0.00015670057,0.00012648459,0.0002519701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038068448,0.0003387341,0.00041110555,0.0012806071,0.0013675479,0.0017072968,0.00065063173,0.0010724002,0.0030736905],"category_scores_gemma":[0.002299712,0.00049196614,0.0007347147,0.0009186928,0.0009923758,0.00127028,0.001263057,0.0011257018,0.00049835746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034556797,0.00009523469,0.0034020864,0.00031165412,0.000037919224,0.0013064266,0.0014159357,0.014963102,0.01903491,0.93482435,0.0051257294,0.019137044],"study_design_scores_gemma":[0.000115758594,0.00008849319,0.003197376,0.00011544638,0.000052679025,0.002143867,0.00036668216,0.0587179,0.006597815,0.90871423,0.01982517,0.00006455249],"about_ca_topic_score_codex":0.0011094317,"about_ca_topic_score_gemma":0.0013017853,"teacher_disagreement_score":0.0030736905,"about_ca_system_score_codex":0.0013084474,"about_ca_system_score_gemma":0.00047459904,"threshold_uncertainty_score":0.0102825165},"labels":[],"label_agreement":null},{"id":"W4414643038","doi":"10.61091/ars164-06","title":"On the interval coloring impropriety of graphs","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea; National Research Foundation; European Commission; National Science Foundation","keywords":"Appearance of impropriety; Interval (graph theory); Vertex (graph theory); Edge coloring; Graph coloring; Graph; Multipartite; Interval graph","score_opus":0.010761492838730572,"score_gpt":0.22974156598262163,"score_spread":0.21898007314389106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414643038","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61275613,0.0018291081,0.34137937,0.0010514669,0.00009781621,0.000104203595,0.0006023122,0.00064158347,0.041538026],"genre_scores_gemma":[0.925542,0.0009480097,0.07001204,0.00021133819,0.00019751389,0.00010076157,0.00054332975,0.00017726453,0.0022678198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977538,0.00052280497,0.00011686277,0.0004988811,0.0005954726,0.0005121891],"domain_scores_gemma":[0.98048604,0.014913392,0.0013251867,0.0017457918,0.0007394369,0.00079011294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019741405,0.0008294907,0.0009679118,0.0022463643,0.0017807786,0.0027649992,0.0016673631,0.0010932003,0.003986062],"category_scores_gemma":[0.009908092,0.0007938766,0.00088729715,0.0030862144,0.0034538438,0.0042043016,0.0021745947,0.0026787554,0.00046096128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007715852,0.00017622029,0.009660599,0.00032167585,0.00007378702,0.0005048074,0.0011603186,0.14635003,0.015851526,0.76508194,0.0041478653,0.055899605],"study_design_scores_gemma":[0.000066653585,0.00019549107,0.00386732,0.00009712886,0.00006372096,0.0010559977,0.0004581038,0.25271463,0.009148705,0.7215789,0.0106855,0.000067823166],"about_ca_topic_score_codex":0.0012685951,"about_ca_topic_score_gemma":0.0010934846,"teacher_disagreement_score":0.003986062,"about_ca_system_score_codex":0.0021536292,"about_ca_system_score_gemma":0.0005544606,"threshold_uncertainty_score":0.015625775},"labels":[],"label_agreement":null},{"id":"W4414643096","doi":"10.61091/ars164-03","title":"Local Distance Antimagic Labeling of Generalized Mycielskian Graphs","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bijection; Chromatic scale; Graph; Order (exchange); Arithmetic progression; Connectivity","score_opus":0.008163716929798307,"score_gpt":0.23567361686981855,"score_spread":0.22750989994002024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414643096","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9109139,0.00044538762,0.07250922,0.0003206552,0.00002556674,0.00004028009,0.00031732308,0.00013308383,0.015294566],"genre_scores_gemma":[0.97257566,0.00022039565,0.023137905,0.0000633223,0.00002230118,0.000042125794,0.00027735493,0.000021039317,0.003639948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999721,0.000052218,0.000018937228,0.000088564106,0.00004873096,0.0000705764],"domain_scores_gemma":[0.99936694,0.00019599464,0.00014872427,0.0000985101,0.00008333268,0.000106565414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023090288,0.00030713488,0.00029122675,0.0006911756,0.000910599,0.0009773974,0.0006174104,0.00045355325,0.0020438246],"category_scores_gemma":[0.00083483366,0.00018889378,0.00029979378,0.0009370346,0.0009125741,0.001604083,0.00082330534,0.0005650675,0.00019715363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003689834,0.00007529002,0.0056352336,0.00035972233,0.000040460272,0.00032712353,0.001003642,0.025812853,0.041667353,0.8837355,0.0021654367,0.038808428],"study_design_scores_gemma":[0.00007343268,0.00020161882,0.0074040573,0.00006477384,0.000101296035,0.0011963847,0.0011112909,0.12199107,0.026525747,0.816296,0.02496652,0.000067708934],"about_ca_topic_score_codex":0.0010555309,"about_ca_topic_score_gemma":0.0022762367,"teacher_disagreement_score":0.0020438246,"about_ca_system_score_codex":0.0011612378,"about_ca_system_score_gemma":0.00035229835,"threshold_uncertainty_score":0.008425355},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8571678,0.0009041281,0.10015448,0.0007031627,0.00006702848,0.000041883875,0.0006441786,0.00025354637,0.040063903],"genre_scores_gemma":[0.98089737,0.00029918313,0.015300269,0.000118617056,0.000058990798,0.000038137994,0.00037701722,0.000034840337,0.0028756252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968004,0.000059194226,0.000009741424,0.00007401536,0.0000949368,0.00008206549],"domain_scores_gemma":[0.99897313,0.00044283835,0.00016951504,0.000082275044,0.00014558373,0.00018669822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021211478,0.00030586348,0.0003801278,0.0011273136,0.0006928546,0.00097560603,0.0004916262,0.00037171273,0.0035358812],"category_scores_gemma":[0.0015663079,0.00013998736,0.0003670106,0.00064391724,0.0013553242,0.0015312582,0.00076053,0.0008772622,0.00024728026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001060847,0.000041321855,0.003926351,0.00010733478,0.000020410396,0.0003342485,0.0004119624,0.009549941,0.00607226,0.96077126,0.003521039,0.015137801],"study_design_scores_gemma":[0.000025980422,0.00007082756,0.0068183388,0.000031418807,0.00003240502,0.0009904061,0.00044834503,0.11405663,0.0041421307,0.8628182,0.010503629,0.000061671584],"about_ca_topic_score_codex":0.0029511435,"about_ca_topic_score_gemma":0.002721313,"teacher_disagreement_score":0.0035358812,"about_ca_system_score_codex":0.0007769768,"about_ca_system_score_gemma":0.00042703384,"threshold_uncertainty_score":0.011828661},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44970644,0.00066383666,0.47928208,0.0006192904,0.00032968586,0.000121413694,0.00033225675,0.00074576866,0.06819928],"genre_scores_gemma":[0.90178454,0.00048504886,0.08432438,0.0003150501,0.00017460767,0.00007681401,0.0004899418,0.0002476569,0.01210206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955386,0.00009415287,0.000021218415,0.00016951057,0.000087052016,0.00007418127],"domain_scores_gemma":[0.99931014,0.00022212944,0.00006851279,0.00024392796,0.000074188785,0.000081080936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033302055,0.00025269072,0.0003474483,0.00063991034,0.0005643952,0.0011566139,0.00056381314,0.00037597495,0.0045724967],"category_scores_gemma":[0.001420909,0.00020866313,0.00048102642,0.0005198073,0.0008682403,0.002000721,0.0013050535,0.0010510836,0.00045827535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007560438,0.0001049737,0.0007491233,0.00011434412,0.000012972433,0.0002009226,0.0003673746,0.0072158584,0.009583986,0.92052275,0.0031255442,0.0579265],"study_design_scores_gemma":[0.000023345547,0.00008212516,0.0010350301,0.000025288286,0.000024707902,0.0004739052,0.00017740086,0.042362075,0.008183129,0.92175436,0.025842542,0.000016091852],"about_ca_topic_score_codex":0.00037224143,"about_ca_topic_score_gemma":0.0003698353,"teacher_disagreement_score":0.0045724967,"about_ca_system_score_codex":0.00058686663,"about_ca_system_score_gemma":0.00026585843,"threshold_uncertainty_score":0.015296578},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5799402,0.00038522223,0.29913116,0.0011154304,0.0004849559,0.00014442495,0.0009405653,0.0012524289,0.11660562],"genre_scores_gemma":[0.92517084,0.00023495595,0.043592915,0.00029333468,0.00033605756,0.00025545366,0.0006274287,0.00034241847,0.029146612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99762195,0.00052291685,0.0001433775,0.0006967432,0.00061075384,0.00040411617],"domain_scores_gemma":[0.9944061,0.0023303512,0.0009755115,0.0007566142,0.0007225614,0.0008088932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017108073,0.000826777,0.00046095945,0.0019243117,0.001649912,0.0034884016,0.0009905895,0.0007290221,0.008214851],"category_scores_gemma":[0.005123576,0.0005891554,0.0010001551,0.0013273016,0.0031525223,0.0040622456,0.002418347,0.0023252037,0.0010099063],"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.00016301521,0.00006600338,0.0006318032,0.000059775808,0.000015042009,0.00010514409,0.00033822536,0.0035754275,0.0043164776,0.9679902,0.0018948159,0.02084414],"study_design_scores_gemma":[0.00005509555,0.00024375899,0.0011488064,0.000029155957,0.000026189324,0.00036926122,0.00021864696,0.026710102,0.009632663,0.95136696,0.010153052,0.00004629098],"about_ca_topic_score_codex":0.00060592673,"about_ca_topic_score_gemma":0.0008071335,"teacher_disagreement_score":0.008214851,"about_ca_system_score_codex":0.0018396081,"about_ca_system_score_gemma":0.000753982,"threshold_uncertainty_score":0.027481437},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88261056,0.00021567907,0.083732955,0.0016006704,0.00006763453,0.00003100571,0.00029051118,0.0002564936,0.03119449],"genre_scores_gemma":[0.9834567,0.00015200232,0.011920655,0.0001829228,0.00009811819,0.000052193882,0.00021234457,0.000056138357,0.0038689948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992156,0.00023460333,0.000028035167,0.00018743225,0.0001426256,0.00019172816],"domain_scores_gemma":[0.9965088,0.0019797264,0.0005807727,0.00035186173,0.00018667828,0.00039217336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079058664,0.0004428597,0.00047495114,0.0014012214,0.0014617243,0.0015376908,0.0005160516,0.0010334649,0.0048228465],"category_scores_gemma":[0.0047540106,0.00033132255,0.00038218696,0.0011558166,0.0025831047,0.0026465585,0.0011123234,0.0012095643,0.000657779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016474524,0.00006206676,0.0014481766,0.000050146282,0.0000102786325,0.00012653085,0.0005985011,0.007929098,0.0056579085,0.9727706,0.0036111143,0.007571018],"study_design_scores_gemma":[0.00003452474,0.000029617951,0.0013329807,0.000014141061,0.0000048721104,0.00012684909,0.00019322208,0.033250313,0.0016514439,0.96190876,0.0014287565,0.000024613762],"about_ca_topic_score_codex":0.0007097062,"about_ca_topic_score_gemma":0.0007172952,"teacher_disagreement_score":0.0048228465,"about_ca_system_score_codex":0.00086045737,"about_ca_system_score_gemma":0.0004598434,"threshold_uncertainty_score":0.016134024},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32099012,0.0001370876,0.45775717,0.0006554361,0.00031015603,0.00018785553,0.0020842203,0.002707343,0.21517062],"genre_scores_gemma":[0.73708266,0.00014342999,0.17912081,0.00043455718,0.00004657352,0.00021724512,0.0028549759,0.0006760202,0.07942369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996433,0.00005420679,0.000018842122,0.000087360466,0.00007671491,0.00011957591],"domain_scores_gemma":[0.9993861,0.000098833065,0.000060922743,0.00016660681,0.00015628367,0.00013130992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024406312,0.00033628914,0.00025018674,0.00066723785,0.0008543753,0.0011119684,0.00054820796,0.00055243704,0.024700308],"category_scores_gemma":[0.0009000598,0.00024646704,0.00038725603,0.00094186055,0.00063451234,0.0012938811,0.0010490367,0.00075207645,0.004470811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043343307,0.00014783104,0.001156793,0.00019270636,0.000017429811,0.00035824807,0.00061483233,0.0086718565,0.036208604,0.84689116,0.01530587,0.09000118],"study_design_scores_gemma":[0.00009971188,0.00015887586,0.0015022618,0.00007790611,0.000031986874,0.00032682388,0.0006297166,0.058759503,0.02940176,0.7976594,0.111299746,0.00005231646],"about_ca_topic_score_codex":0.0020787655,"about_ca_topic_score_gemma":0.003425726,"teacher_disagreement_score":0.024700308,"about_ca_system_score_codex":0.000993884,"about_ca_system_score_gemma":0.00048617154,"threshold_uncertainty_score":0.08263075},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7390484,0.0005339425,0.21216173,0.0011065044,0.00015545171,0.00012206223,0.00035115943,0.00035039434,0.046170373],"genre_scores_gemma":[0.9303918,0.00043920893,0.058435727,0.0002792582,0.00011445989,0.00012305319,0.00036164036,0.00008838483,0.009766516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968195,0.0000838325,0.000015812344,0.00010765456,0.000046355726,0.000064334134],"domain_scores_gemma":[0.99871695,0.00048541618,0.0002655909,0.00017178022,0.00012968853,0.00023056705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052226137,0.00037813,0.00036675457,0.0007164652,0.0013197535,0.0011298739,0.00046678487,0.00061822037,0.0033988485],"category_scores_gemma":[0.0022717975,0.000185015,0.00038877947,0.0006074903,0.0020149548,0.0023145424,0.0009963504,0.00092211517,0.00039371688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014089905,0.000035145975,0.0015307699,0.00009027839,0.0000062724034,0.00015003547,0.00050339865,0.0072305063,0.0051050605,0.9593183,0.0017458589,0.024143547],"study_design_scores_gemma":[0.000023399654,0.00012943402,0.000934777,0.000039382085,0.000018123907,0.0003811646,0.00028520863,0.047136333,0.0045742635,0.93367994,0.012776167,0.000021738091],"about_ca_topic_score_codex":0.0010382017,"about_ca_topic_score_gemma":0.0009162265,"teacher_disagreement_score":0.0033988485,"about_ca_system_score_codex":0.0010103283,"about_ca_system_score_gemma":0.0004812422,"threshold_uncertainty_score":0.011370242},"labels":[],"label_agreement":null},{"id":"W44666342","doi":"","title":"Which Graphs Have Hall Number Two","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.017097635612002098,"score_gpt":0.23867627100835304,"score_spread":0.22157863539635095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W44666342","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75360656,0.0039184326,0.07439493,0.021242287,0.00089411676,0.00008726577,0.0036867938,0.0019824621,0.14018707],"genre_scores_gemma":[0.9782633,0.00066734815,0.008221163,0.00076845154,0.00035973705,0.000042099095,0.0012530811,0.00021623203,0.010208518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983248,0.00045750962,0.00008301017,0.0004899088,0.00021488102,0.00042973273],"domain_scores_gemma":[0.9764717,0.015600125,0.0018680673,0.0031273786,0.00093323365,0.0019994467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015379398,0.0007452562,0.0016516808,0.0019222092,0.0025632484,0.008669774,0.00217196,0.0032480548,0.02011432],"category_scores_gemma":[0.011599154,0.0012046633,0.0010035206,0.0028515416,0.004975204,0.018689902,0.0023124348,0.0030765703,0.0023198812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011556484,0.00022792815,0.007273748,0.00055260473,0.00008570773,0.00017724201,0.0007395733,0.0053040492,0.0029372922,0.9162073,0.028001897,0.037336998],"study_design_scores_gemma":[0.000061427076,0.000023760815,0.0010511646,0.000045694767,0.00003909375,0.00018728386,0.0007195497,0.0042959373,0.002052832,0.984637,0.006852953,0.000033294415],"about_ca_topic_score_codex":0.000905793,"about_ca_topic_score_gemma":0.0013302972,"teacher_disagreement_score":0.02011432,"about_ca_system_score_codex":0.002164018,"about_ca_system_score_gemma":0.0012265303,"threshold_uncertainty_score":0.06728917},"labels":[],"label_agreement":null},{"id":"W45432375","doi":"","title":"The Niche Category of Dense Graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Niche; Combinatorics; Ecology; Biology","score_opus":0.012561579035767913,"score_gpt":0.22563545137408672,"score_spread":0.21307387233831881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W45432375","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31552085,0.008095589,0.28202128,0.01097455,0.000674919,0.00014982895,0.004263155,0.0016593041,0.37664056],"genre_scores_gemma":[0.9144073,0.002353037,0.039386366,0.0011837077,0.0005335351,0.00014734459,0.0024149236,0.00030359466,0.039270118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990073,0.00023518517,0.000040921586,0.00022804647,0.00024068277,0.00024785014],"domain_scores_gemma":[0.99761283,0.0010747105,0.0001951901,0.00037006114,0.00025636025,0.0004908347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008629301,0.00043821931,0.00081746886,0.0026376857,0.0033187573,0.0043116347,0.0013964894,0.0014983867,0.011766648],"category_scores_gemma":[0.0035377787,0.0005382267,0.00071827584,0.003176058,0.0034917984,0.008871204,0.0040446282,0.001855854,0.0013932707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025491212,0.0000092026285,0.00030829856,0.000045399294,0.0000046896985,0.000037374546,0.00020778563,0.00029894576,0.00024772418,0.98441607,0.0058174334,0.008581603],"study_design_scores_gemma":[0.00000811832,0.00000852126,0.00034111168,0.000025562524,0.000008124012,0.00016879024,0.00029636125,0.0024050258,0.00024212144,0.9779719,0.018516386,0.000007970239],"about_ca_topic_score_codex":0.0031621424,"about_ca_topic_score_gemma":0.003593092,"teacher_disagreement_score":0.011766648,"about_ca_system_score_codex":0.0017329628,"about_ca_system_score_gemma":0.0008835988,"threshold_uncertainty_score":0.039363325},"labels":[],"label_agreement":null},{"id":"W46611669","doi":"","title":"Set-magic labelings of infinite graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; MAGIC (telescope); Combinatorics; Discrete mathematics; Astrophysics; Physics","score_opus":0.02035034492159459,"score_gpt":0.222371672435287,"score_spread":0.2020213275136924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W46611669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33052087,0.0028533428,0.39474174,0.0047468874,0.00054195104,0.00011391464,0.0028903892,0.0014276935,0.26216316],"genre_scores_gemma":[0.8754644,0.00081876747,0.09537217,0.00058371347,0.00024270004,0.00011732739,0.0018182639,0.0002622142,0.025320508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998941,0.0003266554,0.00008034787,0.00021851857,0.00025772545,0.00017575952],"domain_scores_gemma":[0.99505424,0.0029976561,0.00047222938,0.00066067505,0.0003852787,0.00042988837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009003583,0.0004163246,0.00058127363,0.0019269373,0.002070537,0.0037282968,0.0012988087,0.0012725537,0.011007143],"category_scores_gemma":[0.0054936367,0.0006086633,0.00080748857,0.0018759533,0.0025533293,0.0065433276,0.0025161372,0.002605157,0.001211104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003910717,0.000014988616,0.0002625605,0.00004872692,0.000005458716,0.00003087984,0.00013390202,0.0010897766,0.0005888002,0.9864942,0.0030254864,0.008266144],"study_design_scores_gemma":[0.000009004352,0.0000060113744,0.00014177086,0.000021585574,0.0000063767293,0.000085454136,0.000081157894,0.0043245074,0.00062374986,0.99014705,0.00454472,0.000008569452],"about_ca_topic_score_codex":0.0012580083,"about_ca_topic_score_gemma":0.0020609393,"teacher_disagreement_score":0.011007143,"about_ca_system_score_codex":0.0017247013,"about_ca_system_score_gemma":0.00068976235,"threshold_uncertainty_score":0.036822498},"labels":[],"label_agreement":null},{"id":"W46767655","doi":"","title":"Vertex-distinguishing total coloring of graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Complete coloring; Brooks' theorem; Fractional coloring; Graph; 1-planar graph; Chordal graph; Line graph","score_opus":0.01794874767751408,"score_gpt":0.21871511490534734,"score_spread":0.20076636722783325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W46767655","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4580607,0.0020565672,0.35384125,0.0055216444,0.0006007127,0.00015779056,0.0037647237,0.0015525029,0.17444406],"genre_scores_gemma":[0.901763,0.00072494417,0.069451824,0.0007198021,0.00022732839,0.00009571426,0.0024746116,0.00029747802,0.024245363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894947,0.00032699757,0.000052892134,0.00024603098,0.0001924653,0.00023217584],"domain_scores_gemma":[0.9942826,0.0034718728,0.0004110335,0.001024693,0.0003423749,0.000467323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010747066,0.00062260753,0.00064691034,0.0011827062,0.0016079395,0.0027962641,0.0014694121,0.0011002581,0.007822355],"category_scores_gemma":[0.0051185056,0.0005188262,0.0006564069,0.001801443,0.0019133012,0.00442577,0.0022177948,0.0022018754,0.0009050533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001655242,0.000077998564,0.0017780863,0.00019295992,0.000027910723,0.00006671175,0.0002555312,0.008570135,0.00219894,0.9405715,0.016122984,0.029971644],"study_design_scores_gemma":[0.00002937471,0.000022723838,0.0006586199,0.000026723388,0.000022677486,0.0001642888,0.00015721419,0.022051662,0.0016131036,0.9671048,0.008135509,0.000013286743],"about_ca_topic_score_codex":0.0018404232,"about_ca_topic_score_gemma":0.0029078382,"teacher_disagreement_score":0.007822355,"about_ca_system_score_codex":0.002078557,"about_ca_system_score_gemma":0.0010260243,"threshold_uncertainty_score":0.026168406},"labels":[],"label_agreement":null},{"id":"W48206051","doi":"","title":"To Determine 1-Extendable Graphs and its Algorithm.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Algorithm","score_opus":0.013698340040704953,"score_gpt":0.2286208279347688,"score_spread":0.21492248789406385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W48206051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093541615,0.0014355034,0.84220266,0.0026660324,0.000473736,0.000341229,0.0028751907,0.0060266205,0.05043746],"genre_scores_gemma":[0.22401424,0.00068639533,0.74587184,0.00095389487,0.0001920275,0.0002964829,0.006136974,0.00094478787,0.020903343],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991247,0.00018718906,0.000050815775,0.0003473198,0.00017023727,0.00011976706],"domain_scores_gemma":[0.99788505,0.0010681775,0.0001119496,0.0005815487,0.00022050375,0.00013275517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009402229,0.0009137875,0.00081536407,0.0014491045,0.0011200348,0.0018739642,0.0018895529,0.001377204,0.0132775735],"category_scores_gemma":[0.004836937,0.00046940384,0.001188819,0.0019691067,0.00093467976,0.0038952834,0.0025976263,0.0026118401,0.00407245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055652164,0.00069600315,0.0061105485,0.0011128422,0.00016669462,0.00027074685,0.00066163,0.029266834,0.016208023,0.3194044,0.06938187,0.5561639],"study_design_scores_gemma":[0.000100687794,0.00013732628,0.0021163095,0.00011813995,0.000115791954,0.0005104111,0.00036338516,0.102429874,0.011242579,0.8368595,0.04594652,0.000059439575],"about_ca_topic_score_codex":0.0017677946,"about_ca_topic_score_gemma":0.003196294,"teacher_disagreement_score":0.0132775735,"about_ca_system_score_codex":0.0010641168,"about_ca_system_score_gemma":0.0012501028,"threshold_uncertainty_score":0.044417858},"labels":[],"label_agreement":null},{"id":"W49268","doi":"10.1111/j.1432-1033.1975.tb04105.x","title":"On the signed total chromatic number of a graph.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Friendship graph; Graph; Combinatorics; Discrete mathematics; Line graph; Graph power","score_opus":0.006953750136556667,"score_gpt":0.2111156864286416,"score_spread":0.20416193629208493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W49268","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65140957,0.002324704,0.23366137,0.0037528572,0.00075226807,0.0002077655,0.004542294,0.0006395009,0.10270968],"genre_scores_gemma":[0.9211341,0.0020404994,0.04744335,0.0004966366,0.0005505015,0.00030498544,0.0023802212,0.00022732977,0.025422389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999166,0.00024816487,0.000043525284,0.0002206443,0.00019556598,0.00012615471],"domain_scores_gemma":[0.9960343,0.001910877,0.0008467453,0.0003476232,0.00039424148,0.00046623187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000999595,0.00095708325,0.00064540654,0.0048426306,0.0011743099,0.002991863,0.000863025,0.00092337374,0.015769234],"category_scores_gemma":[0.0045674513,0.00026717494,0.0004884637,0.0031447636,0.0032582718,0.0035537856,0.0015376433,0.0013070636,0.001341264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002468613,0.000038015725,0.0022161198,0.00026324877,0.000048582482,0.0001326806,0.00036392795,0.010908503,0.004134108,0.9414343,0.0065828175,0.03363083],"study_design_scores_gemma":[0.00004452161,0.00009943978,0.0028261258,0.00007510132,0.00003248126,0.00037145903,0.00019075011,0.035885178,0.0012518213,0.94375503,0.015424178,0.00004398161],"about_ca_topic_score_codex":0.001263649,"about_ca_topic_score_gemma":0.0018068512,"teacher_disagreement_score":0.015769234,"about_ca_system_score_codex":0.0019400397,"about_ca_system_score_gemma":0.00060518156,"threshold_uncertainty_score":0.05275339},"labels":[],"label_agreement":null},{"id":"W49550489","doi":"","title":"On the Supermagic Edge-splitting Extension of Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Extension (predicate logic); Enhanced Data Rates for GSM Evolution; Computer science; Telecommunications; Programming language","score_opus":0.011577351313636712,"score_gpt":0.21117517839126634,"score_spread":0.19959782707762963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W49550489","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.481928,0.0023650846,0.23509671,0.005893478,0.0004926106,0.00007355176,0.00072206534,0.00052465935,0.2729039],"genre_scores_gemma":[0.9213542,0.001215134,0.049985863,0.0012211925,0.00045166718,0.00007301227,0.0005862537,0.00014468044,0.02496809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957806,0.00013662623,0.000016329739,0.00008966133,0.00008618198,0.00009321045],"domain_scores_gemma":[0.99855524,0.00070812716,0.00012332531,0.00023626297,0.0001262812,0.00025076632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007960686,0.0003542695,0.0005038727,0.0012464776,0.0015200959,0.0016313912,0.000991367,0.0009707453,0.007291017],"category_scores_gemma":[0.0021295706,0.00030909595,0.0005140278,0.0013145924,0.0021122661,0.005294929,0.001985456,0.0023963843,0.0009332862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003633582,0.00002764083,0.00023741047,0.00003174106,0.0000035945952,0.000044763732,0.00013067597,0.0009704502,0.0006855393,0.9874314,0.0027844687,0.007616068],"study_design_scores_gemma":[0.000009411698,0.000009833365,0.0002302945,0.000014461571,0.0000045351635,0.00008789729,0.000086886845,0.004502232,0.0003172798,0.98905176,0.0056795343,0.0000060092843],"about_ca_topic_score_codex":0.0010062899,"about_ca_topic_score_gemma":0.001514477,"teacher_disagreement_score":0.007291017,"about_ca_system_score_codex":0.00092321576,"about_ca_system_score_gemma":0.00041511786,"threshold_uncertainty_score":0.024390876},"labels":[],"label_agreement":null},{"id":"W49590405","doi":"","title":"Metric-Locating-Dominating Sets in Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dominating set; Metric (unit); Combinatorics; Graph; Business","score_opus":0.012007642032539796,"score_gpt":0.2406084657575433,"score_spread":0.2286008237250035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W49590405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25144118,0.009338003,0.6042835,0.013054961,0.0009400683,0.00035510186,0.0044431845,0.0013382917,0.11480568],"genre_scores_gemma":[0.8123201,0.0036343301,0.15500955,0.001272923,0.0005549342,0.00029104695,0.0026893776,0.0003168932,0.023910765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781007,0.0008015006,0.00014959913,0.0005178399,0.0004110339,0.00030989564],"domain_scores_gemma":[0.9909196,0.005795097,0.0008027772,0.0011812778,0.0005653697,0.00073586754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019669114,0.00083638,0.0014068312,0.0018207672,0.002043809,0.0041337856,0.0021865924,0.0021451144,0.006902426],"category_scores_gemma":[0.012754906,0.00077613175,0.00079358765,0.0032641804,0.0024154636,0.007910434,0.0031568727,0.0026094648,0.0014325366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021739269,0.000114208495,0.0017708909,0.0005416741,0.00007395949,0.0001167982,0.00039024322,0.017676627,0.0022026298,0.89878964,0.023761619,0.054344278],"study_design_scores_gemma":[0.00003965344,0.00005404911,0.00064539496,0.00006539231,0.00004601477,0.00042627973,0.00035811996,0.02514388,0.0018449281,0.956732,0.01461871,0.000025466794],"about_ca_topic_score_codex":0.0011499982,"about_ca_topic_score_gemma":0.001767782,"teacher_disagreement_score":0.006902426,"about_ca_system_score_codex":0.002926011,"about_ca_system_score_gemma":0.0011543626,"threshold_uncertainty_score":0.023090899},"labels":[],"label_agreement":null},{"id":"W49934358","doi":"","title":"A Labeling Problem on the Plane Graphs Pa, b.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Plane (geometry); Geometry","score_opus":0.013584339763092201,"score_gpt":0.21483331260099922,"score_spread":0.20124897283790702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W49934358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3279577,0.0028802322,0.44752026,0.019491062,0.00072298595,0.00029240453,0.0073797754,0.0010866115,0.19266888],"genre_scores_gemma":[0.72169966,0.0025744599,0.21733679,0.0020385291,0.0006341366,0.00032743262,0.007491981,0.00046573297,0.047431316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991615,0.00023228205,0.00004123994,0.00026822303,0.00014040773,0.00015632693],"domain_scores_gemma":[0.99614537,0.0024492238,0.00032051557,0.00053081027,0.00021298086,0.0003410888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076721306,0.0007201648,0.0008380513,0.0009809718,0.0020120677,0.0039036924,0.001380429,0.0025665446,0.01377295],"category_scores_gemma":[0.0048854407,0.000649131,0.0009344883,0.0022748953,0.0018352405,0.007124278,0.0021755819,0.0032293566,0.002045171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025219854,0.00016987692,0.0010857258,0.00025669564,0.0000325198,0.00010740459,0.0003248131,0.009407607,0.0025476934,0.8878733,0.0451899,0.05275231],"study_design_scores_gemma":[0.00006797598,0.00004335991,0.0008583621,0.00007110112,0.00003191176,0.00028193486,0.00042399063,0.026917204,0.0020353596,0.93856364,0.030681215,0.000023867413],"about_ca_topic_score_codex":0.0021990968,"about_ca_topic_score_gemma":0.0020072917,"teacher_disagreement_score":0.01377295,"about_ca_system_score_codex":0.0017611326,"about_ca_system_score_gemma":0.0011011227,"threshold_uncertainty_score":0.046075046},"labels":[],"label_agreement":null},{"id":"W5172298","doi":"","title":"A note on the difference between the upper irredundance and independent numbers of a graph.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics; Discrete mathematics","score_opus":0.01351885570207717,"score_gpt":0.2309128043171936,"score_spread":0.21739394861511643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W5172298","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053714223,0.022469407,0.18405902,0.042579427,0.014594328,0.00005656929,0.0009864981,0.00079646637,0.6807441],"genre_scores_gemma":[0.80473167,0.011123368,0.11196988,0.012311048,0.008814594,0.00015766866,0.00062525127,0.00078615255,0.049480367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99807054,0.000586055,0.000116923955,0.00050694,0.00054056273,0.0001789719],"domain_scores_gemma":[0.9892764,0.007961804,0.00040785875,0.0014945441,0.00043118486,0.0004282612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021696773,0.0007272949,0.0009148825,0.0019644706,0.0020811756,0.003732144,0.00214935,0.0018735594,0.009638749],"category_scores_gemma":[0.013497007,0.00046286514,0.00082250906,0.002185954,0.007961603,0.009196434,0.00354464,0.007883051,0.0015554862],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052445448,0.000012827306,0.00019542573,0.000057266603,0.0000069204193,0.000068736175,0.00012656524,0.0002497084,0.0005701427,0.98333365,0.0077743065,0.0075521055],"study_design_scores_gemma":[0.000007284912,0.000014283448,0.00035484636,0.000018674024,0.0000081398675,0.00015273721,0.00004120738,0.00065544056,0.0003771942,0.98209506,0.016262297,0.000012736983],"about_ca_topic_score_codex":0.0010029953,"about_ca_topic_score_gemma":0.0015381646,"teacher_disagreement_score":0.009638749,"about_ca_system_score_codex":0.001316643,"about_ca_system_score_gemma":0.00051137904,"threshold_uncertainty_score":0.03224486},"labels":[],"label_agreement":null},{"id":"W54538453","doi":"","title":"The Basis Number of the Direct Product of a Theta Graph and a Path.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Direct product; Graph; Combinatorics; Path (computing); Basis (linear algebra); Product (mathematics); Discrete mathematics; Computer science; Geometry","score_opus":0.007262431607025712,"score_gpt":0.2159267809290735,"score_spread":0.20866434932204778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W54538453","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.601651,0.0014883868,0.12175809,0.003907292,0.0010723813,0.000086677814,0.0036812043,0.0007633684,0.26559153],"genre_scores_gemma":[0.92835015,0.00072565256,0.032500006,0.0003291068,0.00025325626,0.00010980317,0.0014312138,0.00030143955,0.035999455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933714,0.00017003219,0.00003245721,0.00015418719,0.00011133916,0.00019485455],"domain_scores_gemma":[0.99823415,0.00079002517,0.00019982974,0.0002464955,0.00021989513,0.00030959418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006556479,0.0004928384,0.00069268065,0.0019313856,0.0021339557,0.0038348802,0.0011000234,0.001189974,0.01787338],"category_scores_gemma":[0.0028511432,0.00039829867,0.0005792798,0.001310496,0.0022656757,0.004524175,0.0016986552,0.00208316,0.004004228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017492892,0.000030954125,0.0009561859,0.00008770255,0.000012309401,0.000055253364,0.00017778162,0.0011462042,0.002614997,0.9714588,0.007320517,0.015964469],"study_design_scores_gemma":[0.000024162593,0.000038005302,0.0009969809,0.000046512385,0.000021378859,0.00027996307,0.00025771465,0.005241499,0.003577862,0.9731976,0.016291494,0.000026808755],"about_ca_topic_score_codex":0.0011469737,"about_ca_topic_score_gemma":0.0014205823,"teacher_disagreement_score":0.01787338,"about_ca_system_score_codex":0.0011288734,"about_ca_system_score_gemma":0.00080039166,"threshold_uncertainty_score":0.0597924},"labels":[],"label_agreement":null},{"id":"W55321067","doi":"","title":"On the Hull Number of the Composition of Graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hull; Composition (language); Combinatorics; Composite material; Art; Materials science; Literature","score_opus":0.009428213206039138,"score_gpt":0.2249279782758415,"score_spread":0.21549976506980234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W55321067","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4984594,0.0021681031,0.25714707,0.007835362,0.00073506904,0.0001233761,0.0017920259,0.00084059,0.23089904],"genre_scores_gemma":[0.88689315,0.0010612021,0.07039122,0.0006287055,0.0006681563,0.00014568609,0.0015819491,0.00044128567,0.03818851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834013,0.00055497745,0.000076855526,0.0003308525,0.00035395604,0.0003432368],"domain_scores_gemma":[0.9887051,0.00797539,0.0008745137,0.0009009823,0.0005434116,0.0010005775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018910032,0.00066720543,0.0011502962,0.0027347966,0.002835002,0.0045717694,0.0019686392,0.0020477937,0.017589025],"category_scores_gemma":[0.012699646,0.00075616257,0.0008857918,0.0020050127,0.004276417,0.0121801365,0.0029445565,0.003748361,0.0023598112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028973338,0.0000700051,0.0016207591,0.00012767913,0.000020565783,0.00009565643,0.0002758966,0.0069593033,0.0012139961,0.9589759,0.010861267,0.019489307],"study_design_scores_gemma":[0.000031684245,0.0000316334,0.0009437534,0.000044999677,0.000021986627,0.00016751217,0.00023088037,0.030660158,0.0016504045,0.96012604,0.0060704774,0.000020432048],"about_ca_topic_score_codex":0.0017206135,"about_ca_topic_score_gemma":0.002222563,"teacher_disagreement_score":0.017589025,"about_ca_system_score_codex":0.00239079,"about_ca_system_score_gemma":0.0008085851,"threshold_uncertainty_score":0.05884117},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9816089,0.00054954796,0.0064142547,0.0007140763,0.000046289624,0.000014601921,0.00102265,0.00018121893,0.009448443],"genre_scores_gemma":[0.99399406,0.0004466078,0.00220726,0.000076360135,0.000100330144,0.00002477807,0.000789551,0.00004338633,0.0023175909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989774,0.00017000371,0.00007148743,0.00033671717,0.0002010329,0.00024335494],"domain_scores_gemma":[0.98919606,0.006185435,0.001430618,0.001529029,0.00082616444,0.00083274377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014670995,0.00027873964,0.0007007796,0.0023619023,0.000983121,0.0023340809,0.0008465431,0.0006489921,0.005388113],"category_scores_gemma":[0.01548172,0.000332262,0.00017698461,0.0016316351,0.001722226,0.0025248637,0.001033981,0.00073701725,0.0007788148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035748037,0.0003265767,0.28494328,0.0007932769,0.00017489097,0.0010979386,0.0017801966,0.025845977,0.041408982,0.38321996,0.022843814,0.23399034],"study_design_scores_gemma":[0.00036825676,0.00087066385,0.18531105,0.00027717455,0.00027264326,0.012317642,0.003448431,0.13225248,0.047704633,0.56279093,0.054163255,0.00022283403],"about_ca_topic_score_codex":0.0005197104,"about_ca_topic_score_gemma":0.00034723588,"teacher_disagreement_score":0.005388113,"about_ca_system_score_codex":0.0008910312,"about_ca_system_score_gemma":0.00047614696,"threshold_uncertainty_score":0.01802504},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012225908,0.027484868,0.012996955,0.008834806,0.008111798,0.00006337745,0.00087757857,0.0007257354,0.93968225],"genre_scores_gemma":[0.006402737,0.013257021,0.0070926575,0.0031411406,0.0020015002,0.00006296634,0.0008696895,0.00044384648,0.9667283],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996822,0.000029911824,0.000009273667,0.000062865845,0.00018683536,0.000028886052],"domain_scores_gemma":[0.99948186,0.00019343167,0.000022177333,0.000055519606,0.00014463824,0.00010238572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024352477,0.0010357975,0.0008545817,0.0013184425,0.00138313,0.0025246344,0.0007606869,0.0008894912,0.074799486],"category_scores_gemma":[0.0009786409,0.00042086237,0.0006611919,0.0023806873,0.0010420211,0.0030223527,0.00094159675,0.003918965,0.042747285],"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.000011798627,0.000039804043,0.00012505056,0.00016167181,0.0000056886925,0.000050638646,0.00023106576,0.0002635843,0.0005006205,0.06371153,0.8491814,0.08571716],"study_design_scores_gemma":[0.0000015721907,0.000008040406,0.00020180614,0.000103553786,0.0000021649541,0.00009078193,0.000042721884,0.00010358026,0.000091682,0.017553868,0.9817976,0.0000027018655],"about_ca_topic_score_codex":0.0012594098,"about_ca_topic_score_gemma":0.0052960264,"teacher_disagreement_score":0.074799486,"about_ca_system_score_codex":0.0017100126,"about_ca_system_score_gemma":0.0013948726,"threshold_uncertainty_score":0.25022918},"labels":[],"label_agreement":null},{"id":"W57158432","doi":"","title":"Skolem arrays and skolem labellings of ladder graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Discrete mathematics","score_opus":0.013727473020705244,"score_gpt":0.2033244794500878,"score_spread":0.18959700642938257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W57158432","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22411466,0.002786851,0.4643023,0.005462559,0.00091161334,0.00012209947,0.0018851295,0.0020957878,0.29831898],"genre_scores_gemma":[0.80134076,0.001514446,0.12296731,0.0013329795,0.00047199652,0.00020873609,0.0016896398,0.00068681437,0.0697873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898154,0.0003510805,0.00006562147,0.00019020464,0.00019590861,0.00021565962],"domain_scores_gemma":[0.99736965,0.0013090777,0.00030890302,0.0005204932,0.00025689363,0.0002348982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008318773,0.00047339697,0.0006443964,0.0017419951,0.002398252,0.0033025746,0.0013737973,0.0015708661,0.013728136],"category_scores_gemma":[0.0040202397,0.0006653747,0.00078719924,0.002420269,0.002589447,0.0070807757,0.0026288133,0.002813426,0.00371108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004313195,0.000017503151,0.00015017779,0.000042344484,0.000004045337,0.00003572857,0.00015415139,0.0005384373,0.0007181639,0.985655,0.003500629,0.009140749],"study_design_scores_gemma":[0.00000784745,0.000007153864,0.00010539128,0.000021316775,0.000005137627,0.00007598031,0.000116163144,0.0019581895,0.00075436715,0.98749477,0.009444038,0.000009696529],"about_ca_topic_score_codex":0.0008471258,"about_ca_topic_score_gemma":0.0014661122,"teacher_disagreement_score":0.013728136,"about_ca_system_score_codex":0.0016557161,"about_ca_system_score_gemma":0.0006746748,"threshold_uncertainty_score":0.0459252},"labels":[],"label_agreement":null},{"id":"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024666227,0.017156258,0.1906844,0.0033831862,0.0032661115,0.0001581141,0.0023149666,0.0023405699,0.7782298],"genre_scores_gemma":[0.06428277,0.029754343,0.21342498,0.0024321869,0.004722027,0.00063901447,0.009043153,0.00377204,0.6719296],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991085,0.00013469394,0.000033071003,0.00021935163,0.00043612422,0.00006813235],"domain_scores_gemma":[0.9991555,0.0002690669,0.000027955579,0.00032302534,0.00015739919,0.0000670505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005804379,0.0019568745,0.0016093157,0.002252053,0.0011614636,0.0042355615,0.002441247,0.0012564097,0.08906781],"category_scores_gemma":[0.0022682662,0.0009082283,0.0013788424,0.0045481985,0.0011247826,0.0034463431,0.0020813844,0.0046889316,0.056437463],"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.000040377436,0.00011699666,0.00014672136,0.0004567801,0.000047354537,0.000042955126,0.000051462943,0.0052665747,0.00094730884,0.2977424,0.32455182,0.3705893],"study_design_scores_gemma":[0.000025129688,0.000021657052,0.00030461958,0.0001803901,0.000032641845,0.00021510075,0.000033223365,0.010913279,0.0009990196,0.46990484,0.5173518,0.000018278524],"about_ca_topic_score_codex":0.0008207948,"about_ca_topic_score_gemma":0.0013302262,"teacher_disagreement_score":0.08906781,"about_ca_system_score_codex":0.0021776054,"about_ca_system_score_gemma":0.0013584152,"threshold_uncertainty_score":0.29796153},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7729742,0.00025432103,0.21287051,0.00035025115,0.00004955235,0.00004219937,0.00024865108,0.0003716416,0.012838618],"genre_scores_gemma":[0.9534317,0.00020292461,0.041346762,0.000095523355,0.00004803848,0.00004000703,0.00032258817,0.000073443975,0.0044388906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967575,0.00007696701,0.00001984969,0.00009433297,0.000060056915,0.000072960735],"domain_scores_gemma":[0.9990369,0.000274521,0.00020916526,0.00024955717,0.000091888054,0.00013801546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032682472,0.0003306939,0.00025571662,0.000662198,0.0007443825,0.00077729154,0.00040132794,0.000417886,0.0017406862],"category_scores_gemma":[0.0009149937,0.00024605496,0.0003847411,0.0005825379,0.00085121754,0.0016323295,0.00094328617,0.00070728903,0.0002123309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027971886,0.00011097274,0.004503284,0.00013415249,0.00003142525,0.0004910657,0.0011621101,0.028634321,0.042341445,0.86057216,0.0029514167,0.05878791],"study_design_scores_gemma":[0.000021832282,0.00014201424,0.002380658,0.000025722606,0.00003057783,0.0005040581,0.00038405933,0.07126747,0.01500408,0.89810365,0.012097013,0.00003886895],"about_ca_topic_score_codex":0.0005159626,"about_ca_topic_score_gemma":0.000649014,"teacher_disagreement_score":0.0017406862,"about_ca_system_score_codex":0.0004030308,"about_ca_system_score_gemma":0.00018855836,"threshold_uncertainty_score":0.005823195},"labels":[],"label_agreement":null},{"id":"W59199974","doi":"","title":"On Optimal Orientations Of Tensor Product Of Complete Graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tensor product; Product (mathematics); Tensor (intrinsic definition); Pure mathematics; Combinatorics; Geometry","score_opus":0.017112285705789775,"score_gpt":0.2508220759577143,"score_spread":0.2337097902519245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W59199974","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.491427,0.0034425966,0.36240625,0.0038768076,0.0005480713,0.00019583091,0.0018934527,0.00094900164,0.13526091],"genre_scores_gemma":[0.8107498,0.002479223,0.15422077,0.00059943664,0.00038203227,0.0002152833,0.0026214884,0.0007910074,0.027940877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988053,0.00039188034,0.00006715426,0.00024093216,0.00020192239,0.000292842],"domain_scores_gemma":[0.995237,0.0024446074,0.00050183036,0.0006820878,0.00039162053,0.00074278266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014004356,0.00084474345,0.0009221156,0.0014682917,0.0017335569,0.0037413838,0.0014317606,0.0013278737,0.011632994],"category_scores_gemma":[0.00625851,0.0009350142,0.00072628504,0.0018456262,0.0024010271,0.0087339245,0.0024123865,0.0026882438,0.0017235744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019447702,0.00012613124,0.0011084671,0.00016864549,0.000019309586,0.000057144196,0.00029437183,0.010523143,0.0021404624,0.93352324,0.013842111,0.038002603],"study_design_scores_gemma":[0.000027839784,0.00003377122,0.00053734053,0.000046656132,0.000017144203,0.000083153485,0.0002972688,0.025470264,0.0012146947,0.96481556,0.0074376655,0.000018608895],"about_ca_topic_score_codex":0.002136997,"about_ca_topic_score_gemma":0.003988853,"teacher_disagreement_score":0.011632994,"about_ca_system_score_codex":0.0020960714,"about_ca_system_score_gemma":0.00093517144,"threshold_uncertainty_score":0.03891629},"labels":[],"label_agreement":null},{"id":"W60887568","doi":"","title":"How close to regular must a multipartite tournament be to secure a given path covering number","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multipartite; Tournament; Mathematics; Path (computing); Discrete mathematics; Combinatorics; Computer science; Computer network; Quantum mechanics; Quantum; Physics","score_opus":0.01579000519708357,"score_gpt":0.22801673884704984,"score_spread":0.21222673364996628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W60887568","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65780544,0.0008539152,0.28401062,0.009682363,0.00062235317,0.00020447286,0.0005386465,0.0017959189,0.04448626],"genre_scores_gemma":[0.96470135,0.00017234434,0.029824855,0.00053711404,0.00008908594,0.000062286854,0.00023801898,0.00014214269,0.0042327303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99594396,0.0012312412,0.00021414665,0.0010100751,0.00060776604,0.0009927419],"domain_scores_gemma":[0.98459506,0.0091808215,0.00083476334,0.0028847686,0.0008475423,0.0016570495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036395001,0.00067548,0.0012899105,0.0009616786,0.002293507,0.0062274835,0.0014486195,0.003100475,0.0059744995],"category_scores_gemma":[0.024986736,0.00047546756,0.00097527885,0.00078428915,0.0026499436,0.008570028,0.0036725055,0.0033829631,0.0012534412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004136258,0.00065054005,0.012050058,0.00035361052,0.0004653532,0.00038710242,0.0009830461,0.18587406,0.020640565,0.63889676,0.019310348,0.116252266],"study_design_scores_gemma":[0.00016360023,0.0005182924,0.0012298238,0.00006224481,0.00011366275,0.0005362419,0.00073845295,0.36256498,0.008410864,0.6182915,0.0073122955,0.00005818145],"about_ca_topic_score_codex":0.0015164425,"about_ca_topic_score_gemma":0.0016271112,"teacher_disagreement_score":0.0062274835,"about_ca_system_score_codex":0.0024094447,"about_ca_system_score_gemma":0.0020946127,"threshold_uncertainty_score":0.01998669},"labels":[],"label_agreement":null},{"id":"W61099736","doi":"","title":"Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs with Distance Sets Missing An Interval.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Interval (graph theory); Combinatorics; Discrete mathematics","score_opus":0.008913949687140479,"score_gpt":0.23078099404702346,"score_spread":0.22186704435988297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W61099736","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6332105,0.0022138646,0.22039376,0.0041350815,0.0004926415,0.000124015,0.0019793392,0.00057389744,0.13687693],"genre_scores_gemma":[0.9458001,0.00071368524,0.039963376,0.00036394995,0.00021364563,0.000110244895,0.0007133124,0.00012962168,0.011992032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901164,0.00021287684,0.000046693942,0.00025322795,0.00020379522,0.0002718048],"domain_scores_gemma":[0.9928445,0.0041559567,0.0009521189,0.0008741327,0.00051588047,0.0006572857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011150473,0.00048083407,0.00051604427,0.0020486445,0.0023012334,0.004268303,0.001783774,0.0013830193,0.011241762],"category_scores_gemma":[0.008952239,0.0005054349,0.00050411845,0.0026048485,0.0032657695,0.0056678653,0.0017923829,0.0019797753,0.0009356037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030695766,0.00003956862,0.001033396,0.00008834903,0.000013231536,0.000052124888,0.0002315196,0.0066993255,0.001973407,0.96955484,0.004806368,0.015200966],"study_design_scores_gemma":[0.000047898287,0.000029873872,0.0009585365,0.000041187708,0.00002517975,0.00017439948,0.00028753147,0.028237378,0.0021882555,0.95889693,0.009082532,0.000030279563],"about_ca_topic_score_codex":0.0028473863,"about_ca_topic_score_gemma":0.0024173546,"teacher_disagreement_score":0.011241762,"about_ca_system_score_codex":0.0028707462,"about_ca_system_score_gemma":0.0009604302,"threshold_uncertainty_score":0.03760743},"labels":[],"label_agreement":null},{"id":"W6110703","doi":"10.1007/bf01254914","title":"On the Local Colorings of Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.0163563646575823,"score_gpt":0.20771586847596632,"score_spread":0.191359503818384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6110703","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5371208,0.003805779,0.37140858,0.0029074699,0.00043900454,0.00019731733,0.00254759,0.00059095706,0.080982424],"genre_scores_gemma":[0.9143734,0.0021675602,0.054140866,0.00039837166,0.00043091955,0.00018312116,0.0019571353,0.00020668382,0.026142051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931145,0.00021780177,0.00003614695,0.00020974457,0.00011109468,0.00011374821],"domain_scores_gemma":[0.99735105,0.0012541112,0.00057898025,0.00037453073,0.00016142844,0.00027989034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000634846,0.0006920815,0.000638229,0.0018019978,0.0011007703,0.0018074008,0.00063828105,0.00069117855,0.008030605],"category_scores_gemma":[0.0024762151,0.00032057872,0.0008222688,0.0015747075,0.0019303206,0.001982629,0.0013814778,0.0010872196,0.00084880716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012658861,0.000037644808,0.0017935209,0.00028377082,0.000053676446,0.0001632293,0.00031946675,0.018877054,0.0029849699,0.9455606,0.004387,0.025412435],"study_design_scores_gemma":[0.000037054277,0.00007356702,0.0023986008,0.000058338715,0.000045966255,0.0004228341,0.00022766224,0.03703056,0.0013408402,0.94431764,0.014021859,0.000024992944],"about_ca_topic_score_codex":0.0010461126,"about_ca_topic_score_gemma":0.0022130432,"teacher_disagreement_score":0.008030605,"about_ca_system_score_codex":0.0015002491,"about_ca_system_score_gemma":0.00036216772,"threshold_uncertainty_score":0.026865005},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024584285,0.2029548,0.17860718,0.011018187,0.009949517,0.0001429196,0.001046722,0.0032896677,0.5905327],"genre_scores_gemma":[0.020323949,0.23042674,0.18590869,0.0038285586,0.009085294,0.00043145037,0.0023992176,0.0021034745,0.54549265],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938786,0.00009326179,0.00002708085,0.00012956542,0.00031508264,0.00004714218],"domain_scores_gemma":[0.9983712,0.0008891436,0.00006568653,0.00028188678,0.00028678935,0.00010526452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005952893,0.0020712367,0.0021116019,0.00289792,0.0012859153,0.0042025987,0.002256609,0.0011584564,0.04535632],"category_scores_gemma":[0.0025059197,0.0011318712,0.0008032156,0.010911911,0.0018861728,0.0074676517,0.0016199356,0.004317194,0.03143856],"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.00002809587,0.0000722072,0.00012273573,0.00086725905,0.000017416762,0.000029266475,0.00007966249,0.0021195672,0.000529207,0.19807176,0.4184888,0.379574],"study_design_scores_gemma":[0.000011095665,0.000008980625,0.00014677341,0.0001679221,0.000015927826,0.00012900808,0.00004035053,0.002925724,0.00027923632,0.19671892,0.79954356,0.000012533697],"about_ca_topic_score_codex":0.0019343956,"about_ca_topic_score_gemma":0.0038562242,"teacher_disagreement_score":0.04535632,"about_ca_system_score_codex":0.0023294163,"about_ca_system_score_gemma":0.0021658423,"threshold_uncertainty_score":0.15173197},"labels":[],"label_agreement":null},{"id":"W63952162","doi":"","title":"Cubic Graphs with Minimum Number of Spanning Trees.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spanning tree; Combinatorics; Minimum spanning tree","score_opus":0.008992087305351936,"score_gpt":0.21981494272233984,"score_spread":0.2108228554169879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W63952162","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5521905,0.0027416656,0.2535247,0.009562501,0.00054450607,0.00031669278,0.01415799,0.0021477148,0.16481367],"genre_scores_gemma":[0.8189481,0.0010102387,0.14572363,0.0007594619,0.00021606468,0.00020022182,0.0061946088,0.00048319515,0.026464531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929845,0.0001719527,0.000038978436,0.00017953555,0.00014208595,0.00016899664],"domain_scores_gemma":[0.9955004,0.0023006778,0.00060883746,0.0007792041,0.00036268114,0.00044832085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048186528,0.00049074064,0.00088053657,0.00076785195,0.0015279622,0.0025624998,0.001417499,0.0014728282,0.013164849],"category_scores_gemma":[0.006095863,0.0005766716,0.0005697091,0.0016898826,0.00081285794,0.0035916497,0.0014307356,0.0016282015,0.0017634623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010446965,0.00038083037,0.0042119827,0.0011348198,0.00011132892,0.00032124433,0.00045427913,0.055729624,0.015194826,0.70924836,0.08566693,0.12650107],"study_design_scores_gemma":[0.00018637523,0.00010685729,0.0030685237,0.00011198922,0.000072854986,0.00060800184,0.0005433606,0.10693572,0.0066711428,0.8475445,0.03410341,0.0000472157],"about_ca_topic_score_codex":0.0031604548,"about_ca_topic_score_gemma":0.0058793933,"teacher_disagreement_score":0.013164849,"about_ca_system_score_codex":0.0015191241,"about_ca_system_score_gemma":0.0014822939,"threshold_uncertainty_score":0.0440408},"labels":[],"label_agreement":null},{"id":"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00081210915,0.029366314,0.70331246,0.001557063,0.0017820388,0.00012011749,0.0004198771,0.00074524106,0.26188487],"genre_scores_gemma":[0.037577458,0.06901554,0.6870309,0.002594342,0.0032069257,0.0008652204,0.0014057629,0.001628306,0.19667561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912983,0.0002208024,0.00003993975,0.00012169145,0.0004487959,0.000039030998],"domain_scores_gemma":[0.9991823,0.00050901214,0.000035736983,0.0001108767,0.00012592104,0.000036138863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093973696,0.0026141042,0.0013610207,0.0014986171,0.00064599793,0.002226927,0.0014943079,0.0009896415,0.023100048],"category_scores_gemma":[0.0018471797,0.00092192984,0.0011519673,0.0035871493,0.0020364462,0.0024643862,0.0012355609,0.0048314547,0.012399874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025127483,0.000097793905,0.00006811988,0.00074410776,0.000045660225,0.000080048354,0.000088598346,0.039988864,0.0012761209,0.6401872,0.13696615,0.18043226],"study_design_scores_gemma":[0.000025550136,0.000033966393,0.00012874724,0.0003014738,0.000016452368,0.00021809207,0.00003542883,0.06108061,0.0007991278,0.5832433,0.35408217,0.000035067605],"about_ca_topic_score_codex":0.000873833,"about_ca_topic_score_gemma":0.0014640418,"teacher_disagreement_score":0.023100048,"about_ca_system_score_codex":0.0011410911,"about_ca_system_score_gemma":0.0011333568,"threshold_uncertainty_score":0.07727736},"labels":[],"label_agreement":null},{"id":"W65748452","doi":"","title":"Smallest defining number of r-regular k-chromatic graphs: r 1 k.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics","score_opus":0.007509431451224437,"score_gpt":0.2164806569491387,"score_spread":0.20897122549791428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W65748452","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6922359,0.0017185669,0.11004432,0.0067035523,0.0005633086,0.00018122426,0.003911235,0.001435943,0.18320598],"genre_scores_gemma":[0.9293043,0.00065896875,0.04365431,0.00080761634,0.0002683162,0.00017273001,0.0018359704,0.0004018177,0.02289589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989153,0.00026665794,0.00006404822,0.00040680263,0.00014291206,0.00020425963],"domain_scores_gemma":[0.9946516,0.0029370019,0.00063926616,0.00058009947,0.00038704442,0.0008050674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091933995,0.00076511037,0.0008809323,0.0011205502,0.001974633,0.004038191,0.0022154546,0.001515663,0.012825415],"category_scores_gemma":[0.00450954,0.00055755023,0.00075955945,0.0010635067,0.0030209953,0.0039364635,0.0020449443,0.0027245537,0.0021749402],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003500648,0.000093098606,0.0023074443,0.00032153114,0.000034380162,0.00014608301,0.00048609564,0.0024484103,0.00911858,0.95061487,0.01567775,0.018401602],"study_design_scores_gemma":[0.00013879381,0.00013943887,0.002785532,0.000074433374,0.00009241942,0.0010853044,0.00052190234,0.010588806,0.00999621,0.9426256,0.031866137,0.00008546338],"about_ca_topic_score_codex":0.0006307106,"about_ca_topic_score_gemma":0.0008910062,"teacher_disagreement_score":0.012825415,"about_ca_system_score_codex":0.0013288669,"about_ca_system_score_gemma":0.0008949451,"threshold_uncertainty_score":0.04290521},"labels":[],"label_agreement":null},{"id":"W68623258","doi":"","title":"Special Face Numbering of Plane Quartic Graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Numbering; Quartic function; Mathematics; Face (sociological concept); Plane (geometry); Combinatorics; Geometry; Pure mathematics; Algorithm; Linguistics; Philosophy","score_opus":0.008941546285403027,"score_gpt":0.2127337850931771,"score_spread":0.20379223880777408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W68623258","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64694536,0.00096599734,0.10208946,0.0018910676,0.0006155467,0.00008174691,0.0008003699,0.00058595446,0.2460245],"genre_scores_gemma":[0.9566003,0.0004288092,0.02271198,0.00030645815,0.00021312771,0.00005426167,0.00068086677,0.000121568955,0.018882578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996306,0.000078523866,0.000017990385,0.000095905685,0.00008687308,0.000090124006],"domain_scores_gemma":[0.99912614,0.00029576794,0.00015400726,0.0002082113,0.00009155301,0.00012425623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003357436,0.00031273774,0.00051699765,0.0012183894,0.001373189,0.0022084822,0.00090453733,0.00096723513,0.009710545],"category_scores_gemma":[0.0015882327,0.00027695234,0.0004466663,0.0009555917,0.0015948913,0.0024823262,0.0011316512,0.0013991839,0.0011685286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088051616,0.00003695796,0.0006931079,0.00007265128,0.0000070015026,0.00012955384,0.00018423235,0.00237951,0.002829686,0.96114147,0.006444311,0.02599337],"study_design_scores_gemma":[0.00001908769,0.000022823937,0.00071716594,0.000022972652,0.000009008213,0.0003201772,0.00017155494,0.0109353345,0.0016725892,0.9736502,0.012445379,0.000013655024],"about_ca_topic_score_codex":0.0008564179,"about_ca_topic_score_gemma":0.0013172991,"teacher_disagreement_score":0.009710545,"about_ca_system_score_codex":0.0009251601,"about_ca_system_score_gemma":0.0002957199,"threshold_uncertainty_score":0.03248501},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6138793,0.004208806,0.25052115,0.0065459437,0.00028970663,0.00005396617,0.0010288933,0.00020295191,0.12326931],"genre_scores_gemma":[0.9727893,0.0010178804,0.020120265,0.0002250148,0.00029351213,0.000054421962,0.00019424236,0.00007133168,0.005234156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921346,0.00026041077,0.00003696853,0.00016280758,0.00016743921,0.00015884],"domain_scores_gemma":[0.9928678,0.0051189642,0.0006590807,0.00049840123,0.00041971356,0.00043608586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012540598,0.00048481257,0.0005960194,0.0027880403,0.0013328139,0.003018463,0.0008009234,0.0008125675,0.0057973303],"category_scores_gemma":[0.0061422237,0.00023891841,0.0004458149,0.0025402906,0.00414573,0.007798303,0.0015535103,0.0019140963,0.00043220958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028047041,0.000014604052,0.00068697374,0.00003557726,0.0000053933422,0.000026647711,0.00012573674,0.0030025402,0.0007741507,0.9899204,0.00086198276,0.0045179115],"study_design_scores_gemma":[0.000005059811,0.000014506414,0.00079825893,0.000025877356,0.000008850881,0.0000971657,0.00010999444,0.0156319,0.0007846698,0.97999555,0.0025082447,0.000020002726],"about_ca_topic_score_codex":0.0011183919,"about_ca_topic_score_gemma":0.0010615365,"teacher_disagreement_score":0.0057973303,"about_ca_system_score_codex":0.0020616767,"about_ca_system_score_gemma":0.00047349557,"threshold_uncertainty_score":0.01939398},"labels":[],"label_agreement":null},{"id":"W70115582","doi":"","title":"On Determining the 2-Packing and Domination Numbers of the Cartesian Product of Certain Graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Product (mathematics); Combinatorics; Discrete mathematics; Geometry","score_opus":0.00754509029648136,"score_gpt":0.21210140087665727,"score_spread":0.2045563105801759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W70115582","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8385339,0.0019863753,0.10720398,0.0013700206,0.00013380371,0.000071993316,0.0013976215,0.00029687322,0.04900545],"genre_scores_gemma":[0.93633264,0.0010552714,0.053873878,0.0002211332,0.00016999233,0.00009266134,0.0016677348,0.00011344425,0.0064731278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902546,0.00031484975,0.00006253165,0.00024161834,0.0001728312,0.00018271159],"domain_scores_gemma":[0.98841643,0.0090506775,0.001082433,0.0006011189,0.0003793298,0.00047007677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013513989,0.00063980673,0.00075927976,0.002302965,0.0013026107,0.002856283,0.001195265,0.0012515712,0.006777245],"category_scores_gemma":[0.011175149,0.0006766594,0.00049563113,0.0022756325,0.002553752,0.0052019157,0.0013698452,0.0013862626,0.00096082425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073494605,0.00026939323,0.019010248,0.0005066436,0.000077059995,0.0004283933,0.0012446762,0.037528776,0.008182352,0.84226847,0.015930342,0.07381872],"study_design_scores_gemma":[0.00005601454,0.00008728775,0.0064883763,0.00007779705,0.00003099973,0.0006304095,0.0006202873,0.062017635,0.004425475,0.9187687,0.0067469855,0.000050078786],"about_ca_topic_score_codex":0.0016591098,"about_ca_topic_score_gemma":0.0022741086,"teacher_disagreement_score":0.006777245,"about_ca_system_score_codex":0.0011021218,"about_ca_system_score_gemma":0.0005517948,"threshold_uncertainty_score":0.022672176},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99402195,0.00012825587,0.002172279,0.000051108746,0.0000061410883,0.000008068729,0.0014418174,0.000107455904,0.0020627805],"genre_scores_gemma":[0.9973742,0.000041621362,0.0008235272,0.000016279073,0.0000037471125,0.0000071516974,0.0013318481,0.000014409811,0.00038720918],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99955374,0.00013097312,0.00003073589,0.0001325664,0.00007840634,0.000073557734],"domain_scores_gemma":[0.99835014,0.00095099414,0.00029268124,0.0001328368,0.00007997111,0.00019344679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00109414,0.0005173213,0.0003886257,0.0020202075,0.0006076023,0.0006909075,0.0006388455,0.00082722976,0.0031867325],"category_scores_gemma":[0.0010329334,0.00039238125,0.00049807254,0.0018192278,0.00049497536,0.0005348167,0.00069222297,0.00042338762,0.000485929],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.011405165,0.0010849573,0.3854009,0.0004080539,0.0010382481,0.0035796952,0.0007063979,0.031076398,0.5197927,0.023075448,0.004318954,0.01811309],"study_design_scores_gemma":[0.0003933177,0.0012032675,0.5277314,0.00002712192,0.00050611835,0.0035035436,0.0005194042,0.07562121,0.37454408,0.013582829,0.0022156353,0.00015199263],"about_ca_topic_score_codex":0.001558743,"about_ca_topic_score_gemma":0.0018110245,"teacher_disagreement_score":0.0031867325,"about_ca_system_score_codex":0.00050657964,"about_ca_system_score_gemma":0.00022920407,"threshold_uncertainty_score":0.010660708},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007298362,0.002377698,0.00012376276,0.013572414,0.010277941,0.00019790704,0.013612911,0.00048773494,0.9520512],"genre_scores_gemma":[0.010426799,0.00081467256,0.00008741998,0.0038967954,0.0009533984,0.00007857852,0.0050026635,0.00039226457,0.9783473],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994978,0.00002297985,0.000008958869,0.00006547112,0.00018707813,0.00021771964],"domain_scores_gemma":[0.9994062,0.00002130884,0.00001821375,0.00001875795,0.000114504146,0.0004209647],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000350604,0.00053326035,0.0003720112,0.00074374606,0.0058821333,0.0047192895,0.0007086354,0.0018528961,0.4342064],"category_scores_gemma":[0.0012632795,0.00030965373,0.0002274453,0.0013646303,0.00031327637,0.0013542979,0.0030912212,0.0025458727,0.13568638],"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.000021510605,0.0000112275975,0.00015810614,0.0000130769,6.5103137e-7,0.00006679654,0.00008870667,0.0000048497395,0.000055727316,0.00037142937,0.9938896,0.0053183646],"study_design_scores_gemma":[0.000006350407,0.0000068494883,0.0024506494,0.000036515714,9.5261436e-7,0.000024445497,0.00036744858,0.000012710418,0.000036045643,0.0000662541,0.99698895,0.0000027161793],"about_ca_topic_score_codex":0.21911626,"about_ca_topic_score_gemma":0.5195821,"teacher_disagreement_score":0.4342064,"about_ca_system_score_codex":0.0037845045,"about_ca_system_score_gemma":0.0037555331,"threshold_uncertainty_score":0.8070359},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9444005,0.0021213857,0.0005500735,0.005751451,0.00014190967,0.000049046175,0.00022336065,0.000031357653,0.046730902],"genre_scores_gemma":[0.9916094,0.0009641866,0.00022207467,0.00046656176,0.000012665294,0.000020461139,0.000090976086,0.000036443307,0.0065772547],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9947188,0.0016861768,0.00013124428,0.0003951204,0.0011718085,0.0018967788],"domain_scores_gemma":[0.9937038,0.0025345471,0.00054823124,0.00030593458,0.0014519992,0.0014554999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033865825,0.00081209955,0.0007315243,0.0031937065,0.041063588,0.012796752,0.0030427508,0.0025080482,0.0046675033],"category_scores_gemma":[0.007352443,0.00063870364,0.0004970912,0.005427878,0.025978042,0.0047309278,0.010749057,0.0055297106,0.00021177305],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","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.000033372355,0.00001815564,0.0039037159,0.000050394887,0.000009963159,0.0006643259,0.9813043,0.000098220014,0.00026562606,0.007686424,0.0024780205,0.0034875225],"study_design_scores_gemma":[0.0000012590751,0.0000052832597,0.0026235038,0.000075191776,0.000004403553,0.000059049104,0.97093874,0.000048109334,0.00010451478,0.00017680865,0.025943706,0.000019363939],"about_ca_topic_score_codex":0.96594954,"about_ca_topic_score_gemma":0.98771113,"teacher_disagreement_score":0.07917069,"about_ca_system_score_codex":0.07917069,"about_ca_system_score_gemma":0.068103716,"threshold_uncertainty_score":0.57442623},"labels":[],"label_agreement":null},{"id":"W7045266","doi":"","title":"On Some Chromatic Properties Of Jahangir Graph.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Graph; Combinatorics","score_opus":0.014492847829718289,"score_gpt":0.2169077993031049,"score_spread":0.2024149514733866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7045266","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42583683,0.0036816723,0.14558339,0.008478416,0.0006279793,0.00016171875,0.0020872361,0.000589003,0.41295367],"genre_scores_gemma":[0.9107984,0.0024125741,0.04366622,0.0012175605,0.0006860064,0.00016668667,0.0016193442,0.00034330052,0.03908996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930346,0.00020000145,0.000028028544,0.00015870607,0.00015162322,0.0001581318],"domain_scores_gemma":[0.9961888,0.002331285,0.00040439246,0.00040056068,0.0002906029,0.0003844015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010128682,0.00050452707,0.0005854487,0.0022918864,0.003053771,0.0028809619,0.0014026794,0.001471322,0.017916422],"category_scores_gemma":[0.0048448076,0.00055220886,0.0006719323,0.0027868568,0.0026821424,0.0074908403,0.001946694,0.0030050257,0.0019328577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047510555,0.00003446674,0.00049791444,0.000080901846,0.000008378596,0.000049378195,0.00022785805,0.0015515995,0.0009388928,0.9811267,0.007210899,0.008225416],"study_design_scores_gemma":[0.000017599272,0.000019691593,0.0008694692,0.000031283238,0.000016608667,0.00014095909,0.00027620388,0.0072868704,0.00071668066,0.98111373,0.00949095,0.000020050162],"about_ca_topic_score_codex":0.0025274998,"about_ca_topic_score_gemma":0.0033625977,"teacher_disagreement_score":0.017916422,"about_ca_system_score_codex":0.002094212,"about_ca_system_score_gemma":0.000723779,"threshold_uncertainty_score":0.059936345},"labels":[],"label_agreement":null},{"id":"W70538647","doi":"","title":"On Multiplicity of triangles in 2-edge colouring of graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Multiplicity (mathematics); Combinatorics; Enhanced Data Rates for GSM Evolution; Geometry; Artificial intelligence; Computer science","score_opus":0.014051823661386633,"score_gpt":0.24355066159426683,"score_spread":0.2294988379328802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W70538647","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6041229,0.0043480853,0.24415809,0.006949151,0.0013293186,0.00012344417,0.0014520596,0.00069534336,0.1368217],"genre_scores_gemma":[0.9383882,0.0012895596,0.04264408,0.00061506167,0.0006579803,0.00012343658,0.0006087662,0.0002471536,0.015425689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997581,0.0008222613,0.00016401934,0.0004665432,0.00045776425,0.0005084269],"domain_scores_gemma":[0.9809904,0.0130925495,0.0019227207,0.0016505988,0.00088837143,0.0014553528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022918873,0.00076666015,0.0014726067,0.0034076206,0.002921706,0.0044064843,0.003039632,0.0030012953,0.012720744],"category_scores_gemma":[0.016897889,0.001044359,0.00096344406,0.003159537,0.0045606205,0.010136913,0.0039079385,0.0029520586,0.0016274854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022408288,0.00006085632,0.003236023,0.00019100349,0.00002678885,0.00019496918,0.00052723,0.0066528795,0.0019042549,0.9595435,0.0072955373,0.020142885],"study_design_scores_gemma":[0.0000320618,0.00003267767,0.0011964213,0.000061726045,0.000025047648,0.00040323247,0.00032231657,0.017686335,0.0010810683,0.9745273,0.0045968913,0.000034936238],"about_ca_topic_score_codex":0.0015575754,"about_ca_topic_score_gemma":0.0019624962,"teacher_disagreement_score":0.012720744,"about_ca_system_score_codex":0.0020798321,"about_ca_system_score_gemma":0.00063183694,"threshold_uncertainty_score":0.042555094},"labels":[],"label_agreement":null},{"id":"W70810164","doi":"","title":"The Classification of Regular Graphs on f-colorings.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.023221544999808125,"score_gpt":0.226972505765043,"score_spread":0.20375096076523486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W70810164","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6345696,0.007923968,0.19455186,0.009934951,0.0011279024,0.00018675275,0.007951122,0.0014305331,0.14232336],"genre_scores_gemma":[0.9248073,0.0023708986,0.042712536,0.00094488874,0.00085818814,0.00013409133,0.005400748,0.0002784275,0.022492995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992207,0.0001835378,0.000043002914,0.00022158044,0.00013736493,0.00019379135],"domain_scores_gemma":[0.9954543,0.0025187174,0.000515925,0.0006782806,0.00033504076,0.00049776357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008618901,0.000646572,0.0008536978,0.002865195,0.0018270932,0.0041114986,0.0016034715,0.0019196037,0.009135478],"category_scores_gemma":[0.006341442,0.0005328727,0.00071956415,0.0027449618,0.0023068683,0.0055060876,0.001489072,0.0021401963,0.0013680181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000244536,0.000098805445,0.0053518093,0.00027289902,0.000039023915,0.00009032754,0.00040681465,0.006588817,0.001757601,0.87297356,0.04658253,0.06559333],"study_design_scores_gemma":[0.000042761618,0.000032541906,0.0030016687,0.000106044456,0.000027743852,0.0002982543,0.00030205655,0.023335574,0.0007903258,0.9493526,0.022681821,0.000028629314],"about_ca_topic_score_codex":0.0034354727,"about_ca_topic_score_gemma":0.0023267826,"teacher_disagreement_score":0.009135478,"about_ca_system_score_codex":0.0021734845,"about_ca_system_score_gemma":0.00081687234,"threshold_uncertainty_score":0.030561268},"labels":[],"label_agreement":null},{"id":"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021136017,0.0012016867,0.0006989648,0.0024903435,0.000681159,0.000051650346,0.010003342,0.0005602228,0.9821989],"genre_scores_gemma":[0.003934781,0.00054503843,0.0005643705,0.0002982449,0.000028491842,0.000011186247,0.00218318,0.00013903817,0.9922956],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993112,0.000030894214,0.00001213625,0.00021637157,0.0002802311,0.00014919511],"domain_scores_gemma":[0.99873763,0.00014362192,0.000042076314,0.00012787503,0.0006286317,0.00032017316],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022048164,0.0012018083,0.0008378381,0.0021146294,0.00525231,0.0037876288,0.0017234334,0.001718415,0.75933367],"category_scores_gemma":[0.0013690679,0.00045288407,0.0004741627,0.0030947058,0.0012438116,0.0012071639,0.0015016391,0.0013996143,0.43261993],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00022899784,0.00012938675,0.0013051826,0.00029564239,0.000028183918,0.00047843644,0.00012653279,0.00081344816,0.0024161693,0.041700065,0.75506496,0.19741298],"study_design_scores_gemma":[0.000018008977,0.0000089334135,0.0010693385,0.00007807472,0.0000059792783,0.000076203156,0.00014258336,0.00023919907,0.00049331423,0.0027938534,0.99506605,0.00000844584],"about_ca_topic_score_codex":0.5745911,"about_ca_topic_score_gemma":0.761969,"teacher_disagreement_score":0.4254089,"about_ca_system_score_codex":0.008947303,"about_ca_system_score_gemma":0.014155054,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W71060424","doi":"","title":"On Harmonious Labelings of Some Cycle Related Graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.011237612595566547,"score_gpt":0.20557688974523103,"score_spread":0.19433927714966448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W71060424","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51569784,0.0013425314,0.28089544,0.004237896,0.0002771821,0.00025522147,0.0015120233,0.0008648819,0.19491693],"genre_scores_gemma":[0.8578088,0.0009913052,0.10409349,0.0011381891,0.00025886166,0.0002515308,0.0018014726,0.0003339654,0.033322386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990381,0.00034695104,0.000047047142,0.00021424645,0.00016363553,0.00019002412],"domain_scores_gemma":[0.99688524,0.0016159398,0.00039217187,0.000550544,0.00023128898,0.00032480955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092249084,0.0004048825,0.0006516746,0.0017686994,0.0024717588,0.0022940875,0.0012174671,0.0013893798,0.010945212],"category_scores_gemma":[0.004989904,0.00051900174,0.00071787275,0.0018785845,0.002026307,0.004962843,0.0025968407,0.0019428948,0.0012748264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058673726,0.00004674265,0.0005053558,0.00007451567,0.00001314189,0.00006970602,0.00028942036,0.0026137603,0.0010543785,0.97269124,0.005703272,0.01687985],"study_design_scores_gemma":[0.000020047413,0.000020355543,0.00042715092,0.000023698389,0.00001556056,0.00013963164,0.0002629245,0.010123273,0.00088139466,0.97967416,0.008400431,0.000011309876],"about_ca_topic_score_codex":0.001165375,"about_ca_topic_score_gemma":0.0017680294,"teacher_disagreement_score":0.010945212,"about_ca_system_score_codex":0.0012547886,"about_ca_system_score_gemma":0.00051609514,"threshold_uncertainty_score":0.03661537},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5790624,0.00097081607,0.38628456,0.0006599963,0.00022186973,0.00020675486,0.0007227715,0.0017471507,0.030123753],"genre_scores_gemma":[0.91293925,0.00068198645,0.074310735,0.0002848184,0.00013133603,0.0001571134,0.0013704532,0.00016533888,0.009959017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994836,0.000060840426,0.00003687059,0.00018374478,0.00013718723,0.00009782186],"domain_scores_gemma":[0.99866986,0.00025337777,0.00033663792,0.00036768639,0.00014959631,0.00022275928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034806295,0.0008509795,0.00067504303,0.00086059305,0.0005879026,0.0009573856,0.0007768606,0.00095497776,0.003844296],"category_scores_gemma":[0.003479264,0.000455877,0.000677859,0.0010428926,0.0010332867,0.0033724622,0.001795097,0.0009943135,0.0009257195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000525108,0.00023329222,0.0047350987,0.0005033255,0.00014680346,0.00091457536,0.0009852097,0.18578441,0.05723265,0.5756346,0.009272594,0.16403225],"study_design_scores_gemma":[0.00008060263,0.0011971763,0.0051508793,0.00011716524,0.000119528195,0.0024182773,0.0007956021,0.18614705,0.029092344,0.7353267,0.039407864,0.00014674889],"about_ca_topic_score_codex":0.00034011598,"about_ca_topic_score_gemma":0.0005091053,"teacher_disagreement_score":0.003844296,"about_ca_system_score_codex":0.00044627176,"about_ca_system_score_gemma":0.00030322364,"threshold_uncertainty_score":0.012860417},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9484158,0.00022003429,0.038292892,0.00047350125,0.000024746965,0.000044666624,0.0007775661,0.00021219841,0.011538542],"genre_scores_gemma":[0.9861463,0.00013911014,0.010156054,0.0001193379,0.000025682652,0.000048147074,0.0011073025,0.000045329263,0.0022128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897075,0.000102546335,0.000091935966,0.00040932366,0.00018045305,0.00024501415],"domain_scores_gemma":[0.99469525,0.0028106328,0.0009676143,0.00078563695,0.0002829669,0.0004579373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051972654,0.00045259533,0.00071351306,0.0008085053,0.0012756998,0.0021784387,0.001271261,0.00072606636,0.0032362447],"category_scores_gemma":[0.003709612,0.00055685977,0.0012101515,0.0008124189,0.0018415792,0.0032180515,0.0015102949,0.0013604122,0.00034379208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024343473,0.0005868665,0.061704233,0.00096077094,0.0003368465,0.0030860717,0.0028809633,0.046278846,0.057225432,0.7354971,0.00874311,0.080265366],"study_design_scores_gemma":[0.00020343187,0.00027586662,0.017777758,0.000116956086,0.00015997609,0.0039920765,0.0012861913,0.06989778,0.020690918,0.8723278,0.01318553,0.00008567877],"about_ca_topic_score_codex":0.00075989106,"about_ca_topic_score_gemma":0.0010158704,"teacher_disagreement_score":0.0032362447,"about_ca_system_score_codex":0.0010396948,"about_ca_system_score_gemma":0.00048085497,"threshold_uncertainty_score":0.01082629},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08803907,0.017453877,0.7110596,0.0057451976,0.0012913498,0.000077606885,0.0013660376,0.0008905964,0.17407663],"genre_scores_gemma":[0.6516131,0.018626757,0.24679297,0.0043326635,0.003673561,0.0002078114,0.0032751195,0.0010235837,0.070454374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958986,0.00009868829,0.00001901629,0.00013860958,0.000098486424,0.000055281078],"domain_scores_gemma":[0.99868506,0.0006626284,0.00013772745,0.00021535558,0.00020585407,0.00009330756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061184657,0.0008122919,0.000671434,0.0016775684,0.0010130091,0.0011243728,0.0007949243,0.001054147,0.013567694],"category_scores_gemma":[0.0022421596,0.00032495684,0.0010979092,0.002499437,0.0009844936,0.0033870782,0.0011396903,0.0022529082,0.0019626569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000576136,0.00009132315,0.00092234614,0.00055631064,0.000045629822,0.00030687996,0.0005030804,0.010300472,0.0050085653,0.8951259,0.018864417,0.06821745],"study_design_scores_gemma":[0.000012611844,0.000062798405,0.001064338,0.00006279044,0.000038917817,0.00035585352,0.00022072744,0.02066883,0.0013144715,0.9216115,0.05455677,0.00003040746],"about_ca_topic_score_codex":0.0012713198,"about_ca_topic_score_gemma":0.0015847891,"teacher_disagreement_score":0.013567694,"about_ca_system_score_codex":0.00095877354,"about_ca_system_score_gemma":0.00030335493,"threshold_uncertainty_score":0.04538846},"labels":[],"label_agreement":null},{"id":"W7117409206","doi":"10.61091/ars165-02","title":"Regular pandiagonal sparse magic squares of order \\(n\\equiv 5 \\pmod{6}\\) with density 6","year":2025,"lang":"","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Soochow University","keywords":"Magic square; Diagonal; MAGIC (telescope); Generalization; Integer (computer science); Order (exchange)","score_opus":0.010174647057699375,"score_gpt":0.2272439442437728,"score_spread":0.21706929718607343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117409206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070322186,0.00045100434,0.74060845,0.0007439165,0.0008823475,0.00032138728,0.0027966837,0.006049032,0.17782506],"genre_scores_gemma":[0.44478205,0.00045494662,0.4447567,0.0009090511,0.00028984237,0.00075044576,0.0036577643,0.0026934613,0.10170575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994444,0.00009452833,0.00003315267,0.00015926629,0.00017188469,0.00009668191],"domain_scores_gemma":[0.99936587,0.00014092804,0.000067382665,0.00017962884,0.00017970955,0.000066501096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038541364,0.0008813617,0.00062260753,0.00069459405,0.00070131675,0.0009676076,0.0008085423,0.00048156225,0.030107353],"category_scores_gemma":[0.0020999357,0.00046289605,0.00038377297,0.0010001456,0.0011294957,0.0016058924,0.0016294483,0.0012531434,0.010982317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068968907,0.00010973631,0.00073341996,0.00055571523,0.000032267122,0.00034618544,0.0003061481,0.008773971,0.04218929,0.64006686,0.073137805,0.2330589],"study_design_scores_gemma":[0.00017441559,0.00035067153,0.0007370259,0.000105844716,0.000034016317,0.00077817315,0.00022447665,0.06740169,0.07263315,0.57396555,0.2834613,0.00013371186],"about_ca_topic_score_codex":0.00059308263,"about_ca_topic_score_gemma":0.0016616106,"teacher_disagreement_score":0.030107353,"about_ca_system_score_codex":0.0003844606,"about_ca_system_score_gemma":0.00067412754,"threshold_uncertainty_score":0.100719094},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62518686,0.0012582985,0.29985666,0.002781214,0.00027636564,0.00022658975,0.007968247,0.0009961239,0.0614497],"genre_scores_gemma":[0.91414124,0.0008499545,0.063704774,0.00041908043,0.00023426705,0.00032885125,0.005182734,0.00025751372,0.014881623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928576,0.00015594077,0.000039327577,0.0002906785,0.00011771789,0.00011069811],"domain_scores_gemma":[0.9964664,0.0014434669,0.00045987015,0.00034486625,0.0005006809,0.0007847162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008567105,0.00088094734,0.0010022632,0.001022721,0.0013675373,0.001958354,0.0013028211,0.00096224964,0.010583483],"category_scores_gemma":[0.00465181,0.0007488304,0.0007358533,0.0012938387,0.0010691717,0.0042484603,0.0016778584,0.0010787299,0.0012476393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010586503,0.00020851845,0.007818694,0.0015480806,0.00019741396,0.00074813224,0.00096660235,0.09615527,0.02076488,0.77922356,0.041421913,0.04988829],"study_design_scores_gemma":[0.00014966572,0.00031977502,0.004676637,0.00009570788,0.00012225242,0.0013710378,0.00040830128,0.23148438,0.007711699,0.7269556,0.02664053,0.000064405416],"about_ca_topic_score_codex":0.0008035149,"about_ca_topic_score_gemma":0.00090075517,"teacher_disagreement_score":0.010583483,"about_ca_system_score_codex":0.0010555947,"about_ca_system_score_gemma":0.0008469203,"threshold_uncertainty_score":0.03540528},"labels":[],"label_agreement":null},{"id":"W7117409928","doi":"10.61091/ars165-09","title":"On sum edge-colorings of graph products","year":2025,"lang":"","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Vertex (graph theory); Graph; Canonical normal form; Strength of a graph; Multiple edges; Extremal graph theory; Complete graph","score_opus":0.012062553462487097,"score_gpt":0.23375881193467574,"score_spread":0.22169625847218863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117409928","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18609373,0.0014754663,0.72998625,0.0009293925,0.0004963356,0.00018447604,0.0013410938,0.0015394057,0.07795387],"genre_scores_gemma":[0.65832704,0.002107618,0.28412235,0.0008555211,0.0006550169,0.00034136858,0.003713189,0.0018712594,0.048006676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983767,0.00043373206,0.000081947874,0.000466307,0.0003542321,0.0002869707],"domain_scores_gemma":[0.99655294,0.0017054603,0.00024852535,0.0006439247,0.0004847479,0.00036445432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013988015,0.0015639792,0.0012547838,0.0020677734,0.0019237952,0.003076981,0.0016138615,0.0009297086,0.012921646],"category_scores_gemma":[0.0049876906,0.00097352004,0.0017134324,0.0031473942,0.0027205728,0.005273884,0.0030228514,0.0026798104,0.0022028375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038498864,0.00013847183,0.0014694908,0.00037198456,0.00006177072,0.00023672677,0.000709989,0.042788,0.004772552,0.838007,0.013890051,0.09716905],"study_design_scores_gemma":[0.000030029267,0.000055811597,0.00038784402,0.000042821914,0.000023997905,0.00016195675,0.00012752044,0.056659337,0.0015699123,0.9322925,0.008620642,0.00002768445],"about_ca_topic_score_codex":0.002707631,"about_ca_topic_score_gemma":0.0024557903,"teacher_disagreement_score":0.012921646,"about_ca_system_score_codex":0.001833436,"about_ca_system_score_gemma":0.0009021629,"threshold_uncertainty_score":0.043227255},"labels":[],"label_agreement":null},{"id":"W71397827","doi":"","title":"On 1-Zm-well-covered and strongly Zm-well-covered graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.007502404796612714,"score_gpt":0.2087039548137085,"score_spread":0.20120155001709578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W71397827","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6502328,0.0030733335,0.17206953,0.005991932,0.0002421134,0.00013421617,0.004369467,0.00097307324,0.16291362],"genre_scores_gemma":[0.9385012,0.0014763799,0.03602595,0.000871724,0.00026518825,0.00012465792,0.0027282324,0.0002292823,0.019777397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894255,0.00026410422,0.000047424448,0.00023474352,0.00021953217,0.00029167507],"domain_scores_gemma":[0.9959506,0.002529735,0.0004766945,0.0004184096,0.00024375448,0.0003808157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007248489,0.0006772162,0.0007170871,0.0019971177,0.001730022,0.002920313,0.0011355414,0.001165545,0.008616444],"category_scores_gemma":[0.004012126,0.00065023283,0.0006677261,0.002092455,0.0018944137,0.0062219054,0.0027894657,0.0019743643,0.0012932043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016744286,0.000054235734,0.0018292338,0.00019752447,0.000029501945,0.00020217101,0.000516762,0.005473276,0.0027917153,0.9575676,0.01141202,0.019758604],"study_design_scores_gemma":[0.000025736099,0.000021163982,0.001444953,0.000049313057,0.000026508493,0.00040540166,0.0003179862,0.012373242,0.0014145154,0.97440165,0.009500765,0.000018873536],"about_ca_topic_score_codex":0.0016543446,"about_ca_topic_score_gemma":0.0023691638,"teacher_disagreement_score":0.008616444,"about_ca_system_score_codex":0.0016587741,"about_ca_system_score_gemma":0.00047872032,"threshold_uncertainty_score":0.028824866},"labels":[],"label_agreement":null},{"id":"W72709578","doi":"","title":"The mapping C: G -> C(G), a new graph theoretic map.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.009230056709497154,"score_gpt":0.2062562247875629,"score_spread":0.19702616807806575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W72709578","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18032546,0.003480473,0.6376078,0.009908824,0.002203922,0.00019050884,0.0015161635,0.0013479675,0.16341892],"genre_scores_gemma":[0.7536643,0.002139472,0.19567433,0.0022726122,0.001070927,0.00035757828,0.00079468056,0.00055879285,0.043467324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991561,0.0001935989,0.000039024282,0.00032637815,0.00016973344,0.00011515579],"domain_scores_gemma":[0.99803036,0.0008008304,0.00020086722,0.0003599581,0.0001969913,0.00041104192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006897617,0.00046672457,0.0003615525,0.0021355432,0.0020325156,0.0037850493,0.00086029625,0.0018899624,0.0063387174],"category_scores_gemma":[0.003402032,0.00026670078,0.0005489324,0.0021977548,0.0032744482,0.0065676337,0.0023341463,0.0024958514,0.0012816559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048037407,0.000031988464,0.0003816104,0.00007057574,0.000008502533,0.00007942131,0.00019226712,0.0010459864,0.0029321488,0.9671397,0.007864181,0.020205613],"study_design_scores_gemma":[0.000023902863,0.00004875338,0.00082228734,0.000046357905,0.000028744802,0.0009813806,0.00027110524,0.011007205,0.0031381587,0.89793575,0.085650876,0.000045570647],"about_ca_topic_score_codex":0.0010327022,"about_ca_topic_score_gemma":0.0009453555,"teacher_disagreement_score":0.0063387174,"about_ca_system_score_codex":0.0013912998,"about_ca_system_score_gemma":0.001012496,"threshold_uncertainty_score":0.021205127},"labels":[],"label_agreement":null},{"id":"W72770462","doi":"","title":"The crossing number of flower snarks and related graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Crossing number (knot theory); Combinatorics; Materials science; Composite material; Knot (papermaking)","score_opus":0.009311976865134602,"score_gpt":0.22762053317137684,"score_spread":0.21830855630624224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W72770462","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6730986,0.0047009527,0.10819546,0.0039899056,0.0006316856,0.00008902678,0.001966255,0.0005809468,0.20674725],"genre_scores_gemma":[0.97019595,0.0012288243,0.016530838,0.00030946583,0.00022653252,0.00006005365,0.0006495457,0.000117044125,0.010681664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936014,0.00018818371,0.000030990926,0.00016479047,0.00011935818,0.0001365213],"domain_scores_gemma":[0.99563,0.0026354422,0.00060896785,0.0003809014,0.00023511882,0.0005095119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009544934,0.00041125354,0.0006153381,0.0026413263,0.0017283561,0.0027623076,0.0012786351,0.0015867559,0.009299802],"category_scores_gemma":[0.006675426,0.00043853943,0.00048299888,0.0023151855,0.0020878431,0.0047469744,0.0015045446,0.0014619235,0.00089180924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014483112,0.000042181917,0.0020428232,0.000113344,0.000020310415,0.000120238925,0.00015748026,0.010683049,0.00146751,0.95874923,0.008488605,0.01797041],"study_design_scores_gemma":[0.000021735474,0.00002272191,0.0014016444,0.00004084495,0.000025084604,0.0003631997,0.00019193429,0.028780052,0.001350243,0.9608892,0.0068916227,0.000021688802],"about_ca_topic_score_codex":0.0011806766,"about_ca_topic_score_gemma":0.0013420576,"teacher_disagreement_score":0.009299802,"about_ca_system_score_codex":0.0017997966,"about_ca_system_score_gemma":0.00046895572,"threshold_uncertainty_score":0.031111002},"labels":[],"label_agreement":null},{"id":"W75757995","doi":"","title":"On Resolving Acyclic Partitions of Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Directed acyclic graph; Discrete mathematics","score_opus":0.012915192982007512,"score_gpt":0.23255418091974034,"score_spread":0.21963898793773282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75757995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13156706,0.009317914,0.65910316,0.010488324,0.0014479153,0.0004916282,0.003806935,0.0025409705,0.1812361],"genre_scores_gemma":[0.44987297,0.004681994,0.47498244,0.003181965,0.0013226036,0.0004472273,0.009231295,0.0014930504,0.054786343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99722373,0.001105745,0.00016567545,0.00054890104,0.00045621942,0.0004997142],"domain_scores_gemma":[0.9861015,0.00934184,0.0007333015,0.0023945607,0.0006925222,0.000736233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032062223,0.00095585943,0.0014514793,0.0031401494,0.0033051043,0.0048219925,0.0025924586,0.0028212739,0.014988804],"category_scores_gemma":[0.017861255,0.0009055837,0.0012017259,0.004412639,0.003383428,0.0157189,0.005545074,0.004256139,0.0030785832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023767594,0.00018267425,0.001305953,0.00034253713,0.000057730973,0.0001344531,0.00066471804,0.009379401,0.0013546392,0.8364619,0.0421665,0.10771188],"study_design_scores_gemma":[0.000024884126,0.00001957965,0.0002984366,0.000075227166,0.000021670836,0.0001431786,0.00037964937,0.013555309,0.0007737066,0.96534395,0.01934808,0.000016404903],"about_ca_topic_score_codex":0.0031552764,"about_ca_topic_score_gemma":0.0064252093,"teacher_disagreement_score":0.014988804,"about_ca_system_score_codex":0.002090736,"about_ca_system_score_gemma":0.0014638418,"threshold_uncertainty_score":0.050142586},"labels":[],"label_agreement":null},{"id":"W77652733","doi":"","title":"New Families of Graceful Disconnected Graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Totally disconnected space; Combinatorics; Locally compact space","score_opus":0.00810323921106155,"score_gpt":0.2114942933123648,"score_spread":0.20339105410130326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W77652733","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.389017,0.0038656294,0.35550764,0.0057885903,0.0006707371,0.00024288458,0.002603388,0.002717044,0.23958711],"genre_scores_gemma":[0.8888883,0.0020461436,0.054761026,0.0011964007,0.00048802875,0.00034555225,0.0023630129,0.0006761489,0.049235422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906796,0.00023268309,0.000043503416,0.00024319673,0.00025412167,0.00015859288],"domain_scores_gemma":[0.9951794,0.0021783072,0.0006000233,0.00083384395,0.00039426296,0.00081419485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009894407,0.00069434487,0.0005695921,0.0028668833,0.0026222963,0.0032234662,0.0017574832,0.0013902362,0.013503707],"category_scores_gemma":[0.0062080226,0.00071985944,0.0009339,0.001648049,0.0026116364,0.0055521647,0.0034389864,0.0022154439,0.0014519078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052578707,0.000022225635,0.0006424296,0.000069028894,0.000011073267,0.00023779485,0.0003769024,0.00201141,0.0012385043,0.9788603,0.0072126775,0.009265028],"study_design_scores_gemma":[0.000030570496,0.000021610354,0.00051034254,0.00003961545,0.00002088685,0.0007980344,0.00026724613,0.010597491,0.0010776595,0.9602154,0.02639821,0.000022779155],"about_ca_topic_score_codex":0.00081949274,"about_ca_topic_score_gemma":0.0012941376,"teacher_disagreement_score":0.013503707,"about_ca_system_score_codex":0.0017147043,"about_ca_system_score_gemma":0.0005625994,"threshold_uncertainty_score":0.04517436},"labels":[],"label_agreement":null},{"id":"W79324627","doi":"","title":"Coloring The Line.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Chromatic scale; Edge coloring; Upper and lower bounds; Graph; Brooks' theorem; Line (geometry); Discrete mathematics; Line graph; Graph power; Geometry; Mathematical analysis","score_opus":0.016802277317118676,"score_gpt":0.24196103809690092,"score_spread":0.22515876077978225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W79324627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070373364,0.0048745084,0.49420273,0.0047223847,0.0015886097,0.00026863615,0.0028883577,0.0033466478,0.41773483],"genre_scores_gemma":[0.5266554,0.0035282108,0.24026409,0.001580127,0.0005042723,0.00029300078,0.0041410485,0.0011015696,0.22193238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995309,0.0000807119,0.000016221084,0.0001638787,0.00011165767,0.0000967209],"domain_scores_gemma":[0.99942183,0.00016003248,0.00006545465,0.00015619137,0.00011711956,0.00007948609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025490456,0.00060752645,0.00041250818,0.00063465175,0.0012305599,0.001704781,0.0007417501,0.0007540265,0.03815258],"category_scores_gemma":[0.0012283173,0.0003583046,0.00044251746,0.0010887521,0.0009255008,0.002401193,0.0011693147,0.0011703254,0.00935616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004265162,0.00010932092,0.00092536514,0.0003032415,0.000032446635,0.00020183045,0.00041074655,0.0074338797,0.01385335,0.681784,0.106798664,0.1877207],"study_design_scores_gemma":[0.00008235537,0.000120569835,0.0007275308,0.000088628934,0.000034275472,0.0007551918,0.00037263235,0.02484537,0.010304745,0.671002,0.29162973,0.000037114598],"about_ca_topic_score_codex":0.0011638823,"about_ca_topic_score_gemma":0.002136268,"teacher_disagreement_score":0.03815258,"about_ca_system_score_codex":0.00122504,"about_ca_system_score_gemma":0.0004754179,"threshold_uncertainty_score":0.1276331},"labels":[],"label_agreement":null},{"id":"W79524663","doi":"","title":"Super Vertex-magic Total Labelings of W3, n.","year":2008,"lang":"it","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; MAGIC (telescope); Vertex (graph theory); Combinatorics; Discrete mathematics; Graph; Physics; Astronomy","score_opus":0.016772864980095056,"score_gpt":0.21931891609575857,"score_spread":0.2025460511156635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W79524663","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5461846,0.00066450617,0.19952658,0.0024511614,0.0002722117,0.00009280638,0.0034051035,0.0011231507,0.24627982],"genre_scores_gemma":[0.87413913,0.00036509015,0.07345785,0.0007848849,0.00013034076,0.00012214303,0.0032509486,0.0005280649,0.047221515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993957,0.0001423571,0.00003513056,0.00013013744,0.00014194578,0.00015468374],"domain_scores_gemma":[0.9981199,0.0008344706,0.00019954274,0.00038850107,0.00021638916,0.00024108827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065314793,0.00048007912,0.00047871418,0.0013463643,0.001698593,0.002450763,0.0011537843,0.00083441066,0.015799703],"category_scores_gemma":[0.0025892302,0.00045097995,0.0006662567,0.0015098936,0.0014497138,0.0034609097,0.0017413219,0.0016924137,0.0016430465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001379552,0.000034947592,0.00056852814,0.00007935552,0.00001139264,0.00008213378,0.0001872567,0.0020296858,0.00198396,0.9711269,0.0087028155,0.015055056],"study_design_scores_gemma":[0.000025175745,0.000012630989,0.0004363586,0.000020120513,0.0000121703515,0.000113164024,0.000112011716,0.008796187,0.0013019772,0.98234653,0.0068128,0.000010875693],"about_ca_topic_score_codex":0.002075485,"about_ca_topic_score_gemma":0.0042756014,"teacher_disagreement_score":0.015799703,"about_ca_system_score_codex":0.0011665585,"about_ca_system_score_gemma":0.0006925314,"threshold_uncertainty_score":0.052855253},"labels":[],"label_agreement":null},{"id":"W79533797","doi":"","title":"Super Edge-Magic Labelings of Generalized Petersen Graphs P(n, 3).","year":2007,"lang":"es","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; MAGIC (telescope); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Astrophysics; Physics; Telecommunications; Computer science","score_opus":0.013420879766842635,"score_gpt":0.24686036976779702,"score_spread":0.23343949000095437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W79533797","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6863785,0.0007120525,0.13433474,0.0016778843,0.00022976997,0.00007797924,0.001208707,0.00064840075,0.17473203],"genre_scores_gemma":[0.9350153,0.0003283829,0.047006328,0.0003517116,0.00008814627,0.00006384189,0.00085026224,0.00014400046,0.016152024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956256,0.00012026774,0.000022120612,0.000094670606,0.000103077175,0.000097272794],"domain_scores_gemma":[0.99873084,0.00060662907,0.00018033283,0.00021389459,0.00010250225,0.00016576434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041533637,0.0003341776,0.00032291672,0.0011019543,0.0014509894,0.001681871,0.000656441,0.00082415657,0.010236004],"category_scores_gemma":[0.001877603,0.00041936358,0.00043274142,0.0010287131,0.0012962093,0.0027548242,0.0014071595,0.001347595,0.00080605753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001279293,0.00003250333,0.00058875664,0.00007143811,0.000009385003,0.00014393263,0.00020805195,0.002947591,0.0026822155,0.96989113,0.0056146337,0.017682442],"study_design_scores_gemma":[0.000022713093,0.00001760674,0.0006582652,0.00002109837,0.000011909841,0.00018619257,0.00015665535,0.011887057,0.0018767482,0.97768205,0.007467207,0.0000124673925],"about_ca_topic_score_codex":0.0008759337,"about_ca_topic_score_gemma":0.0020503474,"teacher_disagreement_score":0.010236004,"about_ca_system_score_codex":0.00066766504,"about_ca_system_score_gemma":0.00045010034,"threshold_uncertainty_score":0.03424281},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78857976,0.00090936985,0.1390735,0.0024399837,0.00023555371,0.00008956919,0.0017668064,0.0010051868,0.06590021],"genre_scores_gemma":[0.94698477,0.00058675563,0.04265975,0.00030939435,0.00012364406,0.00010765109,0.0011728674,0.0002677886,0.007787477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802136,0.00037077165,0.00010904482,0.00047505047,0.0005535868,0.0004701966],"domain_scores_gemma":[0.9897877,0.0062273913,0.000813676,0.0020086942,0.00046746695,0.000695103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013658499,0.0005686539,0.0009326062,0.001428343,0.0014974873,0.0026530253,0.001367344,0.0008080481,0.013114],"category_scores_gemma":[0.00875909,0.00065068033,0.0010707128,0.0014864433,0.0026857264,0.0033990908,0.0026372331,0.0016566237,0.0012182025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001385814,0.00020748777,0.027070444,0.0006871316,0.00012173985,0.0005884507,0.0008599522,0.07437147,0.026364518,0.7357102,0.014549433,0.11808331],"study_design_scores_gemma":[0.00017494733,0.00026165732,0.011381723,0.0001367104,0.0001412746,0.0014408737,0.0005073235,0.20621222,0.018321665,0.7396972,0.021625793,0.00009869471],"about_ca_topic_score_codex":0.0009862497,"about_ca_topic_score_gemma":0.0016384902,"teacher_disagreement_score":0.013114,"about_ca_system_score_codex":0.0012618329,"about_ca_system_score_gemma":0.0007160833,"threshold_uncertainty_score":0.043870747},"labels":[],"label_agreement":null},{"id":"W81409481","doi":"","title":"On Harmonious Graphs of Order 6.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Order (exchange); Pure mathematics; Business","score_opus":0.01563067001445232,"score_gpt":0.21433968190140587,"score_spread":0.19870901188695356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W81409481","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47106263,0.002198501,0.21230185,0.004873594,0.00038882904,0.00016324704,0.0017059699,0.00091704336,0.30638844],"genre_scores_gemma":[0.866138,0.0013864735,0.06448516,0.001078712,0.0002851251,0.00017164534,0.0018766689,0.00036298888,0.06421531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900514,0.0003249686,0.000043936077,0.00020485392,0.00018022761,0.0002409305],"domain_scores_gemma":[0.9972855,0.001326618,0.0003662031,0.0005124553,0.00020034266,0.00030893588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066201284,0.00044040516,0.00066792814,0.001471753,0.002292641,0.002549953,0.0011687457,0.0010763786,0.013894047],"category_scores_gemma":[0.003295912,0.00050729676,0.00061265065,0.0017126268,0.0021485926,0.0064160842,0.0028068668,0.0019378021,0.0022074538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054002434,0.00003364292,0.0003996306,0.0000697134,0.000011819825,0.00006114599,0.00026908983,0.0023291693,0.00082272646,0.97502524,0.0065611773,0.014362741],"study_design_scores_gemma":[0.000014504346,0.00001311725,0.00036232432,0.000023424225,0.000009084157,0.00009605736,0.00025710696,0.0049023326,0.00069249375,0.9827419,0.010878147,0.0000094943825],"about_ca_topic_score_codex":0.0015650071,"about_ca_topic_score_gemma":0.003191659,"teacher_disagreement_score":0.013894047,"about_ca_system_score_codex":0.0013963936,"about_ca_system_score_gemma":0.0005690004,"threshold_uncertainty_score":0.04648024},"labels":[],"label_agreement":null},{"id":"W816148045","doi":"","title":"Trees Which Admit No alpha-labelings","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Alpha (finance); Combinatorics; Statistics","score_opus":0.013306730496009656,"score_gpt":0.23318393458889114,"score_spread":0.21987720409288147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W816148045","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6192138,0.0018431989,0.19610572,0.008317513,0.00040612763,0.00014389887,0.0058230055,0.0024654425,0.16568126],"genre_scores_gemma":[0.8680402,0.0012118174,0.08375277,0.0017311721,0.00040758413,0.00019673198,0.005161806,0.00074420264,0.03875361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981317,0.00041419128,0.00013107485,0.00054081116,0.00032415078,0.00045803748],"domain_scores_gemma":[0.98267937,0.011509499,0.0011990884,0.0024456156,0.000774045,0.0013923818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016215484,0.0009177099,0.001917666,0.0015608907,0.0033693416,0.0076897317,0.0023178724,0.0029983702,0.01247843],"category_scores_gemma":[0.0090205185,0.0017063641,0.0013152764,0.0030853169,0.0032539663,0.01190882,0.0033282738,0.0051873946,0.0024034807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035956423,0.00013255612,0.0023465436,0.0002631268,0.000035061934,0.00021179297,0.0006868371,0.003460114,0.0035631047,0.95504576,0.011791102,0.022104522],"study_design_scores_gemma":[0.000056772788,0.00002043253,0.0006826834,0.000042571242,0.000038969974,0.0003083342,0.00036735335,0.008637787,0.001642862,0.97959226,0.008587544,0.000022561988],"about_ca_topic_score_codex":0.0010308154,"about_ca_topic_score_gemma":0.0019068016,"teacher_disagreement_score":0.01247843,"about_ca_system_score_codex":0.0019753615,"about_ca_system_score_gemma":0.0008301091,"threshold_uncertainty_score":0.04174453},"labels":[],"label_agreement":null},{"id":"W83307727","doi":"","title":"Graceful Labeling Of A Family Of Quasistars With Paths In Arithmetic Progression.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arithmetic; Mathematics; Arithmetic progression; Combinatorics","score_opus":0.012457601080427075,"score_gpt":0.25431143517143134,"score_spread":0.24185383409100428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W83307727","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66048825,0.0008032764,0.21491987,0.0014736695,0.00028823194,0.00010190298,0.0015457546,0.0017805455,0.118598476],"genre_scores_gemma":[0.9112361,0.00043743034,0.055437192,0.00027432758,0.00012237683,0.00009618513,0.0012380009,0.00033088072,0.030827483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950135,0.0001008817,0.000030190482,0.00014864429,0.00010343786,0.00011555196],"domain_scores_gemma":[0.9986401,0.00054636685,0.00020419109,0.0002799166,0.0001171386,0.00021229823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005245454,0.00042738774,0.0004573447,0.0012190418,0.002229674,0.002194333,0.00083842705,0.00083962514,0.009388655],"category_scores_gemma":[0.0019471544,0.0004448644,0.00077501906,0.0011740939,0.0019252562,0.0029486555,0.0017218983,0.0014654038,0.0013663033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096214586,0.000028888691,0.0005821172,0.00004468748,0.000008529113,0.00018997131,0.00029998107,0.0022164618,0.0026642338,0.9797894,0.0031163094,0.010963338],"study_design_scores_gemma":[0.00003198075,0.000049431488,0.0006875346,0.000027136795,0.000019297597,0.00034026278,0.00020040652,0.008102571,0.0020841425,0.9718803,0.016551262,0.000025632151],"about_ca_topic_score_codex":0.001248899,"about_ca_topic_score_gemma":0.0015041198,"teacher_disagreement_score":0.009388655,"about_ca_system_score_codex":0.0011485656,"about_ca_system_score_gemma":0.00061113667,"threshold_uncertainty_score":0.03140819},"labels":[],"label_agreement":null},{"id":"W85618462","doi":"","title":"Antimagic labelings of Msbius grids.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.006653792010955298,"score_gpt":0.20664130603469208,"score_spread":0.19998751402373677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W85618462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3069889,0.001204036,0.3587256,0.0037673574,0.00047479584,0.00022515345,0.0032963585,0.0019446868,0.32337314],"genre_scores_gemma":[0.786895,0.00068483705,0.13547617,0.0007348225,0.0001568579,0.0002245429,0.003031072,0.0004815036,0.07231523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992342,0.00021734218,0.00005015703,0.00016102423,0.00016959394,0.00016763617],"domain_scores_gemma":[0.99809915,0.0007121838,0.00019691941,0.0004608561,0.00023404215,0.00029690875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043389326,0.0004081382,0.00054370123,0.0013332741,0.0024929743,0.0030637563,0.0010922566,0.0011239242,0.018381016],"category_scores_gemma":[0.002987457,0.0004945639,0.00058971136,0.0018373225,0.0013144736,0.003718199,0.0028049666,0.0015491343,0.0031993142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088704095,0.000024323055,0.00036355155,0.00006610342,0.000007697523,0.000063896594,0.00020456973,0.0017968501,0.0015124243,0.9727471,0.007234145,0.015890649],"study_design_scores_gemma":[0.000021424205,0.000017586033,0.00030396157,0.000035274803,0.000010565733,0.00015165206,0.0002785916,0.009442545,0.0023099813,0.9610569,0.026359443,0.000011981315],"about_ca_topic_score_codex":0.0019311631,"about_ca_topic_score_gemma":0.003256663,"teacher_disagreement_score":0.018381016,"about_ca_system_score_codex":0.0016775212,"about_ca_system_score_gemma":0.00069401244,"threshold_uncertainty_score":0.061490655},"labels":[],"label_agreement":null},{"id":"W86337286","doi":"","title":"Choice Number of Complete Multipartite Graphs with Part Size at Most Three.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multipartite; Mathematics; Combinatorics; Discrete mathematics; Quantum; Physics","score_opus":0.015502711279403218,"score_gpt":0.23160026924501825,"score_spread":0.21609755796561503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W86337286","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7765136,0.0017510151,0.08966929,0.00605096,0.00029527492,0.00015003102,0.006146495,0.00078448636,0.11863882],"genre_scores_gemma":[0.9529815,0.00058517646,0.025091836,0.0005151188,0.0001442959,0.00016310936,0.0024205046,0.0002479826,0.017850537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870896,0.00044749674,0.000062501764,0.00029560048,0.000270277,0.00021516532],"domain_scores_gemma":[0.9879529,0.00855485,0.0008336054,0.0009773263,0.00031756324,0.0013638682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014807485,0.0005511204,0.0009416761,0.0013554662,0.0017836476,0.004459194,0.0018370698,0.0018482078,0.015670562],"category_scores_gemma":[0.008333831,0.00083254697,0.0008387319,0.0016933928,0.002317587,0.0048303655,0.0022378466,0.0020577249,0.0013583285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019053931,0.00017901926,0.0063950988,0.00076264475,0.00013156167,0.00027268118,0.0004932526,0.031923402,0.008531997,0.8739061,0.04044604,0.035052948],"study_design_scores_gemma":[0.00022911422,0.000111425405,0.0029157884,0.00009006301,0.00008935668,0.00056092284,0.00025640984,0.068180434,0.005877107,0.9063749,0.015257844,0.000056746536],"about_ca_topic_score_codex":0.00081778434,"about_ca_topic_score_gemma":0.0012481409,"teacher_disagreement_score":0.015670562,"about_ca_system_score_codex":0.0018706645,"about_ca_system_score_gemma":0.0009274221,"threshold_uncertainty_score":0.0524233},"labels":[],"label_agreement":null},{"id":"W89854994","doi":"","title":"On the Cordiality of Corona Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Corona (planetary geology); Combinatorics; Physics; Astrobiology","score_opus":0.01135932491286377,"score_gpt":0.21319214483831533,"score_spread":0.20183281992545157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W89854994","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3960681,0.008504959,0.18923917,0.015346054,0.0009758276,0.0001118377,0.001659585,0.0008800844,0.3872144],"genre_scores_gemma":[0.9257646,0.0034267306,0.031853803,0.0019297375,0.0009107745,0.00009060966,0.0010632072,0.00031447053,0.03464601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925715,0.00020440984,0.000038850867,0.00020972898,0.00012416483,0.00016578512],"domain_scores_gemma":[0.9939976,0.0037627476,0.00048480488,0.000723796,0.0003722735,0.0006587677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001064954,0.00048979785,0.00071626884,0.0018571102,0.0026085568,0.0034498281,0.0011376576,0.0016407985,0.014004101],"category_scores_gemma":[0.008863602,0.0005341722,0.00056775595,0.0018197923,0.003933176,0.010098858,0.0029118308,0.0029051946,0.0015039322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050196213,0.000025105179,0.0006717716,0.00006748657,0.000006773562,0.00004435008,0.0001936899,0.0010520042,0.00046955442,0.9785241,0.0072525884,0.011642533],"study_design_scores_gemma":[0.000013764913,0.000011596959,0.00043060136,0.000028179897,0.000008301515,0.00011851774,0.00012640763,0.0034210721,0.0003136563,0.9874672,0.008052043,0.000008480665],"about_ca_topic_score_codex":0.0019718346,"about_ca_topic_score_gemma":0.0023432772,"teacher_disagreement_score":0.014004101,"about_ca_system_score_codex":0.0020046942,"about_ca_system_score_gemma":0.00056069985,"threshold_uncertainty_score":0.046848416},"labels":[],"label_agreement":null},{"id":"W93307239","doi":"","title":"Induced Graph Theorem on Magic Valuations.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; MAGIC (telescope); Graph; Combinatorics; Discrete mathematics; Astronomy; Physics","score_opus":0.018995170942781896,"score_gpt":0.2438095929287078,"score_spread":0.2248144219859259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W93307239","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12778166,0.002849733,0.41448745,0.0073402524,0.0009792451,0.0001577491,0.003464259,0.0013700625,0.44156966],"genre_scores_gemma":[0.8316587,0.0023199976,0.096941054,0.0023035486,0.0007823189,0.000289296,0.003372359,0.0004562438,0.06187644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999041,0.0002247396,0.000053891126,0.00024823702,0.000263286,0.000168705],"domain_scores_gemma":[0.9971654,0.0016341823,0.00020378614,0.0004534318,0.0002622439,0.00028107045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000849312,0.0005844298,0.0006794785,0.0018007613,0.001575029,0.0034918482,0.0016403235,0.0009692065,0.017961591],"category_scores_gemma":[0.0036948868,0.0005488892,0.00086192094,0.0021500324,0.0023870831,0.008632908,0.0031202694,0.0032943964,0.0021835982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022903843,0.000021774862,0.00016845312,0.000057935096,0.000007812613,0.000031016454,0.00006590161,0.000434821,0.0003777342,0.98379654,0.0062829265,0.008732193],"study_design_scores_gemma":[0.000015520645,0.000009536328,0.00020168886,0.000021370439,0.0000114919885,0.00011359062,0.000055473483,0.0021683534,0.0005421382,0.98606,0.010792673,0.000008121343],"about_ca_topic_score_codex":0.0010189576,"about_ca_topic_score_gemma":0.0014988662,"teacher_disagreement_score":0.017961591,"about_ca_system_score_codex":0.0015715716,"about_ca_system_score_gemma":0.00074807217,"threshold_uncertainty_score":0.060087502},"labels":[],"label_agreement":null},{"id":"W9394027","doi":"","title":"Upper bounds on signed 2-independence number of graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Independence number; Independence (probability theory); Combinatorics; Upper and lower bounds; Discrete mathematics; Graph; Statistics; Mathematical analysis","score_opus":0.01029402088109238,"score_gpt":0.240046454650999,"score_spread":0.22975243376990662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W9394027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20747058,0.0048325253,0.68058026,0.008743081,0.00097201974,0.00039995526,0.007586891,0.0017351574,0.08767957],"genre_scores_gemma":[0.84193057,0.0036076994,0.12867376,0.001495486,0.0011522074,0.0010723807,0.004673443,0.0005141832,0.016880231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99507034,0.0015119757,0.00025765938,0.0009756484,0.0014018433,0.000782593],"domain_scores_gemma":[0.939469,0.044393633,0.0050028698,0.0040654237,0.0036137702,0.0034553218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004150376,0.0017480662,0.0016279947,0.0045733997,0.0022802437,0.0043030577,0.002750077,0.0021016393,0.017801879],"category_scores_gemma":[0.03770152,0.0008702526,0.0016202503,0.0037564968,0.003700102,0.008593144,0.0033601823,0.0039898613,0.0024786182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009792055,0.00024143903,0.007274523,0.0009697384,0.00020848347,0.0004425772,0.0005127155,0.08584204,0.0037974236,0.8011308,0.021995194,0.076606],"study_design_scores_gemma":[0.000074354655,0.00015296125,0.002220539,0.00012942057,0.00006481692,0.00042900693,0.00010987218,0.1460076,0.0017578274,0.838173,0.010819447,0.00006112742],"about_ca_topic_score_codex":0.0012148735,"about_ca_topic_score_gemma":0.001794646,"teacher_disagreement_score":0.017801879,"about_ca_system_score_codex":0.0031062532,"about_ca_system_score_gemma":0.0013480341,"threshold_uncertainty_score":0.059553206},"labels":[],"label_agreement":null},{"id":"W94877583","doi":"","title":"On Connected Colourings of Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.013202555673874418,"score_gpt":0.21095254529869945,"score_spread":0.19774998962482504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W94877583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26038855,0.010819174,0.43928203,0.012403738,0.0015165232,0.0002053737,0.0025500422,0.0010636587,0.27177098],"genre_scores_gemma":[0.81026524,0.0072364123,0.117252715,0.0024533533,0.0014828364,0.00033734832,0.0027600764,0.00060175156,0.057610206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825484,0.0006648843,0.00010433899,0.00036813135,0.00032343974,0.00028435266],"domain_scores_gemma":[0.99047756,0.006728922,0.0006527224,0.001104902,0.00041883852,0.0006170767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014403551,0.0008831057,0.0009902668,0.0027230782,0.0023299085,0.0040702904,0.0016219004,0.0021289517,0.012216795],"category_scores_gemma":[0.008720209,0.0008777999,0.0010206806,0.003752427,0.0041252747,0.010141703,0.0034777995,0.0037867092,0.0019468627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003766352,0.00002504227,0.00043688974,0.00010728685,0.0000138006035,0.000047419115,0.00021102604,0.0020908061,0.00049749785,0.97468793,0.0072668376,0.014577672],"study_design_scores_gemma":[0.000009053418,0.000006241621,0.0001830838,0.000030578813,0.000007581863,0.00006270883,0.00009621339,0.0030928927,0.00022996464,0.99055535,0.0057199015,0.000006447432],"about_ca_topic_score_codex":0.0017353261,"about_ca_topic_score_gemma":0.0026513366,"teacher_disagreement_score":0.012216795,"about_ca_system_score_codex":0.002362329,"about_ca_system_score_gemma":0.00067487644,"threshold_uncertainty_score":0.040869296},"labels":[],"label_agreement":null},{"id":"W95397107","doi":"","title":"On the smallest edge defining sets of graphs.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Discrete mathematics; Computer science; Telecommunications","score_opus":0.0224228657694322,"score_gpt":0.21605770964768156,"score_spread":0.19363484387824936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W95397107","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3925091,0.005229139,0.3705827,0.007955187,0.00068805314,0.000185914,0.0043644486,0.00088024186,0.2176052],"genre_scores_gemma":[0.82579106,0.0026657023,0.13754687,0.0013285661,0.0006903575,0.0003117712,0.0040418115,0.00048295484,0.027140837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981292,0.00065531605,0.00014307386,0.0004666344,0.00030435307,0.000301435],"domain_scores_gemma":[0.98943824,0.007632744,0.0006814318,0.0010801721,0.00045824423,0.00070914754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016779957,0.00076772174,0.0011349061,0.0024530804,0.003007857,0.0050096,0.0019374985,0.001718793,0.007993861],"category_scores_gemma":[0.008722888,0.00073282945,0.0010003018,0.0025468392,0.0036780457,0.011084938,0.0037477557,0.0036519438,0.0014736237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006114076,0.000040235063,0.0008282227,0.00011146156,0.00001151888,0.00003797518,0.00028478427,0.0013845322,0.000719723,0.9743878,0.0053000115,0.016832603],"study_design_scores_gemma":[0.00001328782,0.000011478975,0.0004766552,0.00004229902,0.000012887131,0.0001244134,0.00022641866,0.0031773834,0.00065957604,0.98711085,0.008133115,0.000011568729],"about_ca_topic_score_codex":0.0010682503,"about_ca_topic_score_gemma":0.0016844093,"teacher_disagreement_score":0.007993861,"about_ca_system_score_codex":0.0015290114,"about_ca_system_score_gemma":0.0007517848,"threshold_uncertainty_score":0.0267421},"labels":[],"label_agreement":null},{"id":"W95416672","doi":"","title":"Edge-Magic Labelings of Petersen Graphs P(n, 2).","year":2001,"lang":"es","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; MAGIC (telescope); Combinatorics; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Astrophysics; Telecommunications; Computer science; Physics","score_opus":0.013495628783331633,"score_gpt":0.237949691088514,"score_spread":0.22445406230518236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W95416672","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5944436,0.0011260709,0.16214323,0.0021352344,0.00030477115,0.00012428922,0.0026233795,0.00091845455,0.23618093],"genre_scores_gemma":[0.9076188,0.0005576292,0.06318225,0.00033416183,0.00010870234,0.00009165972,0.0017763567,0.0001817887,0.026148511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994962,0.00013019434,0.0000284717,0.00010977369,0.00011625868,0.00011900478],"domain_scores_gemma":[0.998326,0.000886428,0.00025248912,0.00024255767,0.000118801756,0.00017370195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042928153,0.0003691808,0.0003112315,0.0013252464,0.0016880931,0.0020620213,0.00069851853,0.00094173715,0.010598773],"category_scores_gemma":[0.0026590556,0.00048667646,0.00038408788,0.0013834555,0.0012149678,0.002917916,0.0014155639,0.0013740689,0.0010953952],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018019645,0.000058542915,0.00091929466,0.000099955934,0.000014247775,0.00014685819,0.00026359857,0.005237222,0.0025925646,0.9489261,0.011861218,0.029700175],"study_design_scores_gemma":[0.00002892684,0.000023964798,0.0009045122,0.000029631494,0.000013878004,0.00022161608,0.00020648833,0.012934238,0.0024672924,0.9686845,0.014467324,0.000017595283],"about_ca_topic_score_codex":0.0010627907,"about_ca_topic_score_gemma":0.00240812,"teacher_disagreement_score":0.010598773,"about_ca_system_score_codex":0.0008110633,"about_ca_system_score_gemma":0.000491133,"threshold_uncertainty_score":0.03545642},"labels":[],"label_agreement":null},{"id":"W974543216","doi":"","title":"On the Gracefulness of the Digraphs n-C m .","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.010049641538381227,"score_gpt":0.21014307808589336,"score_spread":0.20009343654751213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W974543216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5153581,0.002299537,0.22084956,0.0077519864,0.00044280346,0.00012976378,0.0019842575,0.00094576506,0.2502382],"genre_scores_gemma":[0.9445113,0.0009885707,0.026949178,0.0010236464,0.00027818157,0.00010517186,0.0009646089,0.00029265656,0.024886709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992581,0.000233747,0.000042289455,0.00018780038,0.000108687105,0.00016940919],"domain_scores_gemma":[0.9944575,0.00343469,0.00045052168,0.0008149297,0.00026138866,0.0005810171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010384342,0.0004995312,0.0006509031,0.001490363,0.0026752264,0.0029549159,0.0011224957,0.0011386062,0.010913147],"category_scores_gemma":[0.006040472,0.0006184307,0.0008056586,0.0012928316,0.0035633403,0.0057087,0.0027371412,0.0024054572,0.001275178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008292717,0.000025194224,0.0005609935,0.000048705715,0.000008153432,0.000058157562,0.00026805367,0.0020462924,0.00068966375,0.9843106,0.004270547,0.007630599],"study_design_scores_gemma":[0.000014241692,0.000012958356,0.0003867561,0.000017159535,0.000008385252,0.00006977811,0.000103518614,0.004088858,0.0003345282,0.99097276,0.003980321,0.000010700462],"about_ca_topic_score_codex":0.0033795985,"about_ca_topic_score_gemma":0.0045429426,"teacher_disagreement_score":0.010913147,"about_ca_system_score_codex":0.0017761817,"about_ca_system_score_gemma":0.0008564338,"threshold_uncertainty_score":0.036508083},"labels":[],"label_agreement":null}]}