{"meta":{"query_hash":"b5fe1e382291","filters":{"topic":"Graph theory and applications"},"cohort_total":889,"direct_labels_cover":1,"predictions_cover":889,"exported":889,"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/b5fe1e382291","api":"https://metacan.xera.ac/api/v1/cohort?topic=Graph+theory+and+applications"},"results":[{"id":"W10447511","doi":"","title":"Extremal properties of (1, f)-odd factors in graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Mathematics; Combinatorics; Graph; Integer (computer science); Simple graph; Order (exchange); Discrete mathematics","score_opus":0.047090532514100086,"score_gpt":0.28114710867510534,"score_spread":0.23405657616100525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W10447511","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88889056,0.0011411234,0.07369677,0.000666052,0.00011010614,0.00006692902,0.00066546316,0.00028356953,0.034479383],"genre_scores_gemma":[0.98219436,0.00047929373,0.012952414,0.00007800526,0.00009811587,0.00004741507,0.00038021003,0.00008533369,0.0036848376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996061,0.00008765438,0.000021947037,0.0001030334,0.0000820645,0.000099207755],"domain_scores_gemma":[0.9976185,0.0012538297,0.0005446193,0.00017179825,0.00012736743,0.00028382905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005942514,0.00036439495,0.00045768375,0.0024566865,0.0011591988,0.0016149646,0.0004974877,0.00058871874,0.0052160616],"category_scores_gemma":[0.004410145,0.00037429074,0.0004699832,0.0010021696,0.0016390559,0.0019041316,0.00080153154,0.0005947718,0.000385677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042625645,0.000078925535,0.011287383,0.0003664433,0.000051662002,0.0009398005,0.00089641556,0.015063628,0.016015235,0.9146501,0.0051073027,0.03511698],"study_design_scores_gemma":[0.000039737915,0.00008231078,0.007224157,0.00005876195,0.00004047653,0.0012671428,0.00045572722,0.023427418,0.0033187352,0.95599365,0.008049458,0.000042426604],"about_ca_topic_score_codex":0.000758404,"about_ca_topic_score_gemma":0.0014441155,"teacher_disagreement_score":0.0052160616,"about_ca_system_score_codex":0.0006012795,"about_ca_system_score_gemma":0.00026281,"threshold_uncertainty_score":0.017449439},"labels":[],"label_agreement":null},{"id":"W105367266","doi":"10.1090/dimacs/069/13","title":"Variable neighborhood search for extremal graphs. 9. Bounding the irregularity of a graph","year":2007,"lang":"en","type":"book-chapter","venue":"DIMACS series in discrete mathematics and theoretical computer science","topic":"Graph theory and applications","field":"Mathematics","cited_by":64,"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":"Bounding overwatch; Variable (mathematics); Combinatorics; Graph; Mathematics; Computer science; Artificial intelligence; Mathematical analysis","score_opus":0.03964920218428527,"score_gpt":0.3063905946128505,"score_spread":0.26674139242856526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W105367266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069484495,0.021699326,0.6894992,0.0050102076,0.0013192078,0.00012881072,0.00084522506,0.0011912697,0.21082228],"genre_scores_gemma":[0.5724429,0.009335271,0.2727707,0.00082640705,0.0011445641,0.00022324942,0.0019604221,0.0009706182,0.14032583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997044,0.000063861524,0.000009459951,0.00006384186,0.00012602542,0.000032498137],"domain_scores_gemma":[0.99890244,0.0007231098,0.000060322545,0.00012973488,0.00012571676,0.000058544112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047663238,0.0003704544,0.00075195526,0.0007563265,0.0005521102,0.0010434714,0.0015167508,0.001000462,0.010972217],"category_scores_gemma":[0.00423631,0.00038954016,0.00033643714,0.0008921951,0.00074326183,0.0017357325,0.0010563682,0.0015102884,0.0022803782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015350021,0.00008038368,0.0011428972,0.00045200367,0.0000634707,0.00017838065,0.00017124119,0.094717525,0.003579101,0.5950604,0.08617191,0.21822916],"study_design_scores_gemma":[0.00003175468,0.00006877764,0.0008924232,0.0001176037,0.000032322056,0.00030295862,0.00008017161,0.2617998,0.0033504097,0.6739774,0.05932085,0.000025489311],"about_ca_topic_score_codex":0.00091669534,"about_ca_topic_score_gemma":0.0018860328,"teacher_disagreement_score":0.010972217,"about_ca_system_score_codex":0.0008584416,"about_ca_system_score_gemma":0.00039745154,"threshold_uncertainty_score":0.036705792},"labels":[],"label_agreement":null},{"id":"W105752137","doi":"","title":"Second Order Randic Index of Benzenoid Systems.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Order (exchange); Topological index; Combinatorics; Computer science; Business; World Wide Web","score_opus":0.016136095966339675,"score_gpt":0.2634067333482611,"score_spread":0.24727063738192143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W105752137","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44826585,0.0028957808,0.050288565,0.0020093478,0.00084561965,0.00007298305,0.0008983951,0.0003957844,0.4943276],"genre_scores_gemma":[0.944737,0.0006898484,0.009278744,0.0002914649,0.0002968985,0.00005588777,0.0003296729,0.00008773132,0.044232722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955076,0.00008183965,0.00001800335,0.00007306671,0.00016664206,0.000109608736],"domain_scores_gemma":[0.9991505,0.00026259615,0.00013444986,0.00012521197,0.00014961322,0.0001775495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003777301,0.00035824007,0.00055469957,0.0028104805,0.0015226868,0.002311003,0.00061955367,0.00086254324,0.014773437],"category_scores_gemma":[0.0017835118,0.00023074816,0.00027561237,0.0009060787,0.0015851626,0.0022826295,0.0013263797,0.0013032798,0.0019707736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029935529,0.000010611755,0.00028797903,0.000027602346,0.0000038875996,0.000035361285,0.00009984392,0.00051215506,0.00080521917,0.9898857,0.0023774193,0.0059241895],"study_design_scores_gemma":[0.000012267205,0.000021092186,0.00073665,0.000018396353,0.0000060148395,0.00015476714,0.00010667619,0.004236244,0.00096495176,0.98458415,0.0091413045,0.000017386465],"about_ca_topic_score_codex":0.0011999159,"about_ca_topic_score_gemma":0.0020454368,"teacher_disagreement_score":0.014773437,"about_ca_system_score_codex":0.0011646143,"about_ca_system_score_gemma":0.0004337109,"threshold_uncertainty_score":0.049422026},"labels":[],"label_agreement":null},{"id":"W117706154","doi":"","title":"PI Index of Armchair Polyhex Nanotubes.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Pure mathematics; Computer science; World Wide Web","score_opus":0.01437029627748487,"score_gpt":0.26014009830978607,"score_spread":0.2457698020323012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W117706154","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46460894,0.0010452507,0.03032821,0.001179912,0.0013325759,0.000060390576,0.0010744855,0.0006367282,0.49973348],"genre_scores_gemma":[0.94672656,0.00069670053,0.005914775,0.00034332462,0.0001689824,0.00011327428,0.00052755885,0.00016252721,0.045346368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998223,0.000020951775,0.000010079939,0.000030851115,0.000062245526,0.000053513864],"domain_scores_gemma":[0.9997826,0.00004035004,0.00004267158,0.000035875375,0.000042117284,0.00005637426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009996186,0.0003373615,0.00033857426,0.0014917857,0.0012864633,0.0021535174,0.0004610419,0.00090051064,0.02514483],"category_scores_gemma":[0.00050717493,0.00015876908,0.00012091108,0.0008277888,0.0006722619,0.0014073584,0.0010673896,0.0007335904,0.0030197576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015001131,0.000041661806,0.00041064373,0.00009591224,0.000007731629,0.00021965674,0.00012819332,0.00088481745,0.013594606,0.9559667,0.0071782228,0.021321803],"study_design_scores_gemma":[0.000026617805,0.00013482451,0.0023442463,0.000103230195,0.000023514134,0.00062160526,0.00049908366,0.023033218,0.030574718,0.8970405,0.045544,0.000054316017],"about_ca_topic_score_codex":0.00037411365,"about_ca_topic_score_gemma":0.00049932627,"teacher_disagreement_score":0.02514483,"about_ca_system_score_codex":0.0005152345,"about_ca_system_score_gemma":0.0003461805,"threshold_uncertainty_score":0.08411789},"labels":[],"label_agreement":null},{"id":"W119157955","doi":"","title":"The bounds of spectral radius of graphs with a given size of independent set.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; RADIUS; Set (abstract data type); Combinatorics; Physics; Computer science; Quantum mechanics; Eigenvalues and eigenvectors","score_opus":0.019379539123824067,"score_gpt":0.25622385202278847,"score_spread":0.2368443128989644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W119157955","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4203913,0.016599521,0.38854334,0.008263337,0.0009167511,0.00014705707,0.0027035468,0.0015817975,0.16085337],"genre_scores_gemma":[0.9581073,0.0030144972,0.03137108,0.0005255449,0.0007280075,0.00020626563,0.0006812348,0.00039337346,0.004972541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970487,0.001060121,0.000101100406,0.0006262721,0.00066158973,0.000502221],"domain_scores_gemma":[0.9579966,0.031212475,0.0022015919,0.0037905362,0.002130273,0.0026684622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035574601,0.0013374788,0.001557235,0.0034244284,0.0017347289,0.0033955362,0.0035470542,0.0020388172,0.00795905],"category_scores_gemma":[0.040927824,0.00092789147,0.0011828971,0.0019552743,0.0033930081,0.007658106,0.003195387,0.0029131146,0.0017912383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074769516,0.00011595375,0.002953463,0.0004981778,0.00015944708,0.00022554667,0.0006164184,0.045128528,0.008832,0.8993096,0.016611405,0.024801655],"study_design_scores_gemma":[0.000053885135,0.000102745755,0.003280979,0.00015007485,0.00012823075,0.00071503845,0.00032218796,0.15863189,0.0065388298,0.82113177,0.008870213,0.0000741989],"about_ca_topic_score_codex":0.0009891198,"about_ca_topic_score_gemma":0.00082060084,"teacher_disagreement_score":0.00795905,"about_ca_system_score_codex":0.0020949924,"about_ca_system_score_gemma":0.0007901633,"threshold_uncertainty_score":0.026625633},"labels":[],"label_agreement":null},{"id":"W123155392","doi":"","title":"Hyper Wiener index of zigzag polyhex nanotorus.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Zigzag; Mathematics; Index (typography); Wiener index; Combinatorics; Geometry; Computer science; World Wide Web","score_opus":0.020621807279015122,"score_gpt":0.288662217977348,"score_spread":0.26804041069833284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W123155392","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7188261,0.0008738151,0.055907052,0.0007240256,0.0005813372,0.00005732751,0.00078875944,0.00026262086,0.22197902],"genre_scores_gemma":[0.95076627,0.00055526145,0.008059353,0.00022358575,0.00017283515,0.00008151364,0.0004947425,0.00016853656,0.03947782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99980015,0.000030454248,0.000009237255,0.000034775236,0.00005950127,0.00006584997],"domain_scores_gemma":[0.9997383,0.00005393748,0.000050252875,0.000034064302,0.0000409917,0.000082477956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015988555,0.00035203432,0.0004505277,0.0019389328,0.0012221042,0.0018485959,0.000445969,0.000632895,0.016131902],"category_scores_gemma":[0.0006196384,0.00022159907,0.00027468687,0.0006929051,0.0009407301,0.0018804058,0.0014261738,0.0008191972,0.0022212986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093275165,0.00002444336,0.00052159687,0.000049248556,0.000008537093,0.00017648499,0.00012806502,0.0010549396,0.004552791,0.98221403,0.0024174661,0.00875902],"study_design_scores_gemma":[0.00002721727,0.0000715417,0.0018716078,0.000047498736,0.000017262902,0.00046569257,0.0003967039,0.017040184,0.00512193,0.9619391,0.012967421,0.000033860426],"about_ca_topic_score_codex":0.0005718891,"about_ca_topic_score_gemma":0.0007254245,"teacher_disagreement_score":0.016131902,"about_ca_system_score_codex":0.0005921462,"about_ca_system_score_gemma":0.00030037426,"threshold_uncertainty_score":0.05396658},"labels":[],"label_agreement":null},{"id":"W127273840","doi":"","title":"The Lattice Polynomial of a Graph.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Lattice (music); Discrete mathematics; Physics","score_opus":0.017642012168922992,"score_gpt":0.2738716593323168,"score_spread":0.2562296471633938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W127273840","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16451865,0.0077591394,0.27971235,0.018020533,0.0033921297,0.00009739833,0.0034466342,0.000859999,0.5221932],"genre_scores_gemma":[0.8634456,0.0044024438,0.042092573,0.0014005397,0.0019308167,0.000099201476,0.0012567989,0.00034703,0.08502501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992617,0.0001962405,0.000023974339,0.00015289932,0.00021118103,0.00015402431],"domain_scores_gemma":[0.99857366,0.0006768847,0.00016434985,0.00017833902,0.0001920761,0.00021463858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061176374,0.00059225026,0.0008039085,0.0023008576,0.0015161869,0.003519809,0.0009047445,0.00090312614,0.01839519],"category_scores_gemma":[0.0034141121,0.00034548485,0.00075435214,0.0025258402,0.0038604122,0.0063609146,0.0020224631,0.00417235,0.0049962527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028005996,0.00001646978,0.00015221159,0.000053124553,0.000007006609,0.000037757956,0.00012762942,0.0006295673,0.00036673355,0.9811798,0.0066701667,0.010731569],"study_design_scores_gemma":[0.000009172883,0.00000974625,0.00016864028,0.000017236087,0.0000053138924,0.00012167641,0.00007039371,0.0025069595,0.00024119036,0.98374903,0.013090777,0.00000984426],"about_ca_topic_score_codex":0.0024758668,"about_ca_topic_score_gemma":0.0026439265,"teacher_disagreement_score":0.01839519,"about_ca_system_score_codex":0.0017670206,"about_ca_system_score_gemma":0.0009961183,"threshold_uncertainty_score":0.06153804},"labels":[],"label_agreement":null},{"id":"W128270467","doi":"10.1007/978-3-642-21866-8_8","title":"Bound States and Variational Principle","year":2011,"lang":"en","type":"book-chapter","venue":"Universitext","topic":"Graph theory and applications","field":"Mathematics","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 Toronto; University of British Columbia","funders":"","keywords":"Eigenfunction; Eigenvalues and eigenvectors; Bound state; Mathematics; Variational principle; Upper and lower bounds; Pure mathematics; Applied mathematics; Mathematical physics; Mathematical analysis; Physics; Quantum mechanics","score_opus":0.03436899245826401,"score_gpt":0.2421800449968704,"score_spread":0.20781105253860638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W128270467","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.006412668,0.022111312,0.08740408,0.0057426677,0.0015799974,0.000032736993,0.0001962033,0.00022718689,0.8762931],"genre_scores_gemma":[0.22632864,0.020268712,0.028628327,0.0023134395,0.002872751,0.00022911551,0.00052104145,0.0006949724,0.718143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997137,0.000085741034,0.000007706566,0.00004223738,0.00012214859,0.000028349239],"domain_scores_gemma":[0.99987173,0.00005426257,0.000008073237,0.000025843132,0.000024015984,0.000016099493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003904959,0.0010224672,0.0009884462,0.0011909725,0.0014380374,0.0024594434,0.0010899117,0.0015896972,0.020316493],"category_scores_gemma":[0.0007248904,0.0005695006,0.0004880811,0.0014517475,0.0034054047,0.0037243406,0.0015916842,0.0036673083,0.005182414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002001335,0.000007652369,0.000005759463,0.00002367215,0.0000022918368,0.0000053592785,0.00004251294,0.00045961706,0.0001043179,0.98420215,0.009280081,0.0058645653],"study_design_scores_gemma":[0.000001912627,0.0000019256254,0.00002540402,0.00002153572,0.0000014026456,0.000014355119,0.000016776208,0.0010970425,0.000060992596,0.9682739,0.030480525,0.0000041689095],"about_ca_topic_score_codex":0.0013768413,"about_ca_topic_score_gemma":0.001829345,"teacher_disagreement_score":0.020316493,"about_ca_system_score_codex":0.0016347747,"about_ca_system_score_gemma":0.00073765067,"threshold_uncertainty_score":0.06796539},"labels":[],"label_agreement":null},{"id":"W128873098","doi":"","title":"The spectral radius of tricyclic graphs with n vertices and k pendant edges.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tricyclic; Mathematics; Combinatorics; RADIUS; Spectral radius; Stereochemistry; Chemistry; Physics; Quantum mechanics; Computer science; Computer network","score_opus":0.024983247294206985,"score_gpt":0.25476140904407985,"score_spread":0.22977816174987287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W128873098","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8420199,0.004676813,0.05150606,0.0017716896,0.00035724274,0.000057493635,0.0016738736,0.0004890348,0.09744789],"genre_scores_gemma":[0.9909779,0.0009700286,0.004027338,0.00010644228,0.000114888564,0.000049819082,0.0003805216,0.00007096681,0.003302078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993461,0.00023467826,0.00003616072,0.00011964723,0.00012098822,0.00014236508],"domain_scores_gemma":[0.99558157,0.0021556003,0.00093540666,0.00030555218,0.00037652065,0.0006451955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056666177,0.00049329834,0.0005647843,0.0024200801,0.0007359455,0.0015453295,0.0011470087,0.0009305852,0.0048275883],"category_scores_gemma":[0.0073158494,0.00033110497,0.00023481679,0.0010862258,0.0014875393,0.0018517015,0.0014448968,0.0006139945,0.0019243219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016183547,0.00012112118,0.005383759,0.0006661455,0.0001244313,0.0007667778,0.00090878055,0.06848815,0.02082391,0.80759096,0.03876265,0.05474495],"study_design_scores_gemma":[0.00012079753,0.00015573096,0.006865267,0.00022271145,0.00009369659,0.0017665868,0.0012356603,0.19263302,0.008888053,0.7714781,0.016434604,0.0001057796],"about_ca_topic_score_codex":0.0008627439,"about_ca_topic_score_gemma":0.0006553883,"teacher_disagreement_score":0.0048275883,"about_ca_system_score_codex":0.00064522936,"about_ca_system_score_gemma":0.00030118323,"threshold_uncertainty_score":0.016149879},"labels":[],"label_agreement":null},{"id":"W142077717","doi":"","title":"Edge Zeta Functions Of Graph Coverings.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Enhanced Data Rates for GSM Evolution; Combinatorics; Artificial intelligence; Computer science","score_opus":0.01659559937668688,"score_gpt":0.25193790865813276,"score_spread":0.2353423092814459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W142077717","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62379247,0.004039874,0.11027755,0.0031699326,0.0010118677,0.000050410268,0.00068176474,0.0005358245,0.25644025],"genre_scores_gemma":[0.9692039,0.001258023,0.0037705756,0.0002142637,0.00042536392,0.00003433824,0.00027599462,0.000120308694,0.02469719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968135,0.0000793158,0.000011370011,0.00004956602,0.00009485954,0.0000835527],"domain_scores_gemma":[0.9989654,0.0004336343,0.00013445853,0.00009850546,0.00013486257,0.0002332208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047455786,0.00072223425,0.00051971787,0.0032627503,0.0009896349,0.0026696573,0.0006428077,0.0007590309,0.007962481],"category_scores_gemma":[0.003447362,0.00027617687,0.00043489266,0.0013647797,0.0015941443,0.0033360207,0.0017530909,0.0016448268,0.0018205789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045819776,0.000020255955,0.0006476792,0.00004445878,0.000011254778,0.00007085229,0.00017398466,0.0012289678,0.0009700514,0.9815176,0.0037664848,0.011502548],"study_design_scores_gemma":[0.0000107454,0.000011646969,0.0007708536,0.000024032372,0.000009344895,0.00019394538,0.00014252627,0.007314813,0.0005549402,0.9855482,0.005408563,0.000010427111],"about_ca_topic_score_codex":0.00071876333,"about_ca_topic_score_gemma":0.00054139335,"teacher_disagreement_score":0.007962481,"about_ca_system_score_codex":0.0009050692,"about_ca_system_score_gemma":0.00025833724,"threshold_uncertainty_score":0.026637197},"labels":[],"label_agreement":null},{"id":"W143170565","doi":"","title":"Semi-regular Bipartite Graphs and an Extension of the Marriage Lemma.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Combinatorics; Mathematics; Lemma (botany); Hypercube; Matching (statistics); Discrete mathematics; Complete bipartite graph; Extension (predicate logic); Graph; Computer science","score_opus":0.022611245792453355,"score_gpt":0.27694563450556736,"score_spread":0.254334388713114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W143170565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30932495,0.0018092624,0.5812888,0.0014366955,0.0003280902,0.00015383672,0.0006213838,0.0005366071,0.104500376],"genre_scores_gemma":[0.9360116,0.0008219614,0.051762465,0.00047557073,0.00024843367,0.000084119194,0.00038561423,0.000076425196,0.01013387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931943,0.00021353665,0.00003912763,0.00017133722,0.00015477434,0.00010192137],"domain_scores_gemma":[0.9978124,0.0009151468,0.00040187372,0.00039308582,0.00024171098,0.00023567151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007538964,0.00021958124,0.00032361445,0.0006389079,0.0009206135,0.00080143724,0.00060560944,0.00047189827,0.004982156],"category_scores_gemma":[0.0034049351,0.00028873523,0.0006205737,0.0008947162,0.0014899607,0.0021839226,0.0018349516,0.00093475595,0.0006270829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008701335,0.000036017103,0.0010907094,0.000098043856,0.0000188937,0.00038218973,0.00041440706,0.0044546737,0.005574375,0.9675794,0.0025632358,0.017701041],"study_design_scores_gemma":[0.000028728997,0.000104668936,0.0016959747,0.000039531657,0.00003316544,0.0017741605,0.0003152421,0.038580492,0.0036982463,0.93009037,0.023610123,0.000029317343],"about_ca_topic_score_codex":0.0008939059,"about_ca_topic_score_gemma":0.0008626661,"teacher_disagreement_score":0.004982156,"about_ca_system_score_codex":0.00045882104,"about_ca_system_score_gemma":0.0002981517,"threshold_uncertainty_score":0.016666949},"labels":[],"label_agreement":null},{"id":"W1479917419","doi":"10.1007/11792086_16","title":"Doubly-Focused Enumeration of Pseudosquares and Pseudocubes","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph theory and applications","field":"Mathematics","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":"University of Calgary","funders":"","keywords":"Enumeration; Computer science; Theoretical computer science; Programming language; Discrete mathematics; Mathematics","score_opus":0.023634638628328132,"score_gpt":0.2701689228462606,"score_spread":0.24653428421793247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1479917419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10264,0.0012199336,0.7413382,0.00064253685,0.0003046029,0.00010717999,0.00042430512,0.0004888927,0.1528343],"genre_scores_gemma":[0.3966316,0.001952918,0.4966287,0.00048764783,0.00023765172,0.0003435104,0.0014690188,0.0006890381,0.10156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993581,0.00019838643,0.000038316735,0.00009734021,0.00024208496,0.00006566687],"domain_scores_gemma":[0.99886215,0.0004931029,0.000072844436,0.00020773448,0.00028786558,0.00007619826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043592902,0.00061214814,0.00072095584,0.0012383107,0.0011179604,0.001902016,0.0011213169,0.00076198817,0.010726446],"category_scores_gemma":[0.0025908328,0.00056184625,0.00063183,0.0020839593,0.0010706323,0.0030930277,0.002038365,0.0015963947,0.0023592422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047110578,0.000022254968,0.00023895175,0.000104481216,0.000007930472,0.000099651996,0.00017656085,0.0045962967,0.0034243162,0.9337919,0.0046823737,0.052808218],"study_design_scores_gemma":[0.000011956544,0.000023343518,0.0001834986,0.000049532882,0.000010998026,0.000362738,0.00013803362,0.02337473,0.0043353196,0.9447197,0.026773429,0.000016759308],"about_ca_topic_score_codex":0.00047825553,"about_ca_topic_score_gemma":0.001066161,"teacher_disagreement_score":0.010726446,"about_ca_system_score_codex":0.0005683508,"about_ca_system_score_gemma":0.0004627394,"threshold_uncertainty_score":0.035883546},"labels":[],"label_agreement":null},{"id":"W1498810156","doi":"10.37236/434","title":"The Orderings of Bicyclic Graphs and Connected Graphs by Algebraic Connectivity","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","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":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China; Hong Kong Baptist University; Fundamental Research Funds for the Central Universities; National Science Foundation","keywords":"Mathematics; Combinatorics; Algebraic connectivity; Chordal graph; Indifference graph; Algebraic number; Laplacian matrix; Pathwidth; Discrete mathematics; 1-planar graph; Graph; Metric dimension; Eigenvalues and eigenvectors; Connectivity; Line graph; Physics","score_opus":0.006625972996884825,"score_gpt":0.24965531773408564,"score_spread":0.2430293447372008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498810156","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8635864,0.0013878605,0.07372621,0.0006033629,0.0000658609,0.00007937496,0.0006998649,0.00014333334,0.059707783],"genre_scores_gemma":[0.9743936,0.0008320202,0.020971028,0.00010601217,0.000089494104,0.000052078878,0.0005738057,0.000034986588,0.0029469726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962986,0.00007210274,0.00002530829,0.00008635552,0.00011308269,0.00007331673],"domain_scores_gemma":[0.9980451,0.00069610303,0.00050177553,0.00019883542,0.0002726218,0.0002856281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002461129,0.00035106373,0.00024308657,0.0025172015,0.0008626201,0.0013047309,0.00032118414,0.00029831348,0.0024272418],"category_scores_gemma":[0.002323147,0.0002631199,0.00023012681,0.0019491637,0.0019777243,0.0018858353,0.00081925653,0.00061997457,0.00017536894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010765453,0.000035770943,0.0047765463,0.000121837875,0.000013006727,0.00024261804,0.00095902634,0.0091753,0.007666235,0.9404207,0.0023999426,0.034081373],"study_design_scores_gemma":[0.000028677521,0.00006602939,0.0070936945,0.000063971514,0.000026477892,0.0006308568,0.0007966096,0.025783487,0.004449872,0.94637966,0.014626882,0.000053791435],"about_ca_topic_score_codex":0.0021728748,"about_ca_topic_score_gemma":0.0037155414,"teacher_disagreement_score":0.0025172015,"about_ca_system_score_codex":0.0006296944,"about_ca_system_score_gemma":0.00045984826,"threshold_uncertainty_score":0.008119941},"labels":[],"label_agreement":null},{"id":"W1509996985","doi":"10.46298/dmtcs.3395","title":"On the Grone-Merris conjecture","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"University of Minnesota","keywords":"Mathematics; Conjecture; Combinatorics; Vertex (graph theory); Generalization; Graph; Laplace operator; Discrete mathematics; Mathematical analysis","score_opus":0.020331016537558595,"score_gpt":0.28958747060303053,"score_spread":0.26925645406547194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509996985","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62713087,0.0022262179,0.08288906,0.016225439,0.00078061386,0.000036670364,0.00029426895,0.00062342524,0.26979342],"genre_scores_gemma":[0.9776725,0.0006888661,0.0062980824,0.001176161,0.0005391946,0.00002836235,0.00020556457,0.00008229246,0.013308992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993191,0.000120566736,0.000019425295,0.00021904997,0.0001942675,0.00012759244],"domain_scores_gemma":[0.99818605,0.0009111032,0.00016849118,0.00026599457,0.00021072268,0.00025764268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082449825,0.00032100783,0.0005791423,0.0011419969,0.001483002,0.0019328338,0.00088228774,0.0017164119,0.0077298745],"category_scores_gemma":[0.0054629706,0.00033099356,0.00046099728,0.0009205386,0.0031584352,0.0045609456,0.0023377312,0.002031019,0.0010724952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005331602,0.000017903836,0.0004992227,0.000022164102,0.000004636332,0.000095555224,0.00020183776,0.0013811918,0.0007653324,0.9888237,0.0031417778,0.0049932846],"study_design_scores_gemma":[0.000017796892,0.000009897256,0.0005245762,0.0000120120085,0.0000035185208,0.00011973255,0.00010473329,0.006353986,0.00035218598,0.9889291,0.0035640425,0.000008433187],"about_ca_topic_score_codex":0.00094381795,"about_ca_topic_score_gemma":0.00086407986,"teacher_disagreement_score":0.0077298745,"about_ca_system_score_codex":0.00079878623,"about_ca_system_score_gemma":0.00042365975,"threshold_uncertainty_score":0.025859058},"labels":[],"label_agreement":null},{"id":"W1515989163","doi":"10.1109/icdcs.2015.57","title":"Discrete Load Balancing in Heterogeneous Networks with a Focus on Second-Order Diffusion","year":2015,"lang":"en","type":"preprint","venue":"","topic":"Graph theory and applications","field":"Mathematics","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":"Simon Fraser University","funders":"","keywords":"Rounding; Load balancing (electrical power); Computer science; Interconnection; Graph; Focus (optics); Upper and lower bounds; Node (physics); Diffusion; Mathematical optimization; Mathematics; Algorithm; Theoretical computer science; Computer network","score_opus":0.024379299351686378,"score_gpt":0.2829261644096263,"score_spread":0.25854686505793995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515989163","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07256039,0.0008014701,0.9227157,0.0005335424,0.00007450334,0.000057235913,0.000026082043,0.00013858895,0.0030925174],"genre_scores_gemma":[0.9330171,0.00063437433,0.063426964,0.00011687809,0.000110858215,0.00008012424,0.000036144247,0.000040600647,0.0025369357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886394,0.00035826574,0.0000457987,0.00023728747,0.00033191187,0.0001628514],"domain_scores_gemma":[0.99689496,0.0018695762,0.00038374547,0.00046439696,0.00023101478,0.00015628306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001835044,0.0005612858,0.00090540946,0.00058745197,0.0007392277,0.0017276832,0.0013340774,0.0010857235,0.0009246261],"category_scores_gemma":[0.0052979332,0.00028145063,0.0005942924,0.0008323689,0.0018710234,0.002812961,0.0011647003,0.001302034,0.00014574468],"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.00010276073,0.000044567314,0.000552406,0.000084504725,0.000031477437,0.000094505245,0.000119826844,0.8345519,0.0068014488,0.1440952,0.0003438887,0.013177517],"study_design_scores_gemma":[0.000013696215,0.000030593852,0.000095232914,0.0000035197038,0.0000054517204,0.000019337042,0.000015251846,0.9767279,0.000732361,0.021787057,0.00056366896,0.0000059105837],"about_ca_topic_score_codex":0.0022787752,"about_ca_topic_score_gemma":0.0012244595,"teacher_disagreement_score":0.0022787752,"about_ca_system_score_codex":0.0019780132,"about_ca_system_score_gemma":0.0007955487,"threshold_uncertainty_score":0.014351547},"labels":[],"label_agreement":null},{"id":"W1526088640","doi":"","title":"Reliability polynomials crossing more than twice","year":2011,"lang":"en","type":"article","venue":"TNO Repository","topic":"Graph theory and applications","field":"Mathematics","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":"Dalhousie University","funders":"","keywords":"Inflection point; Reliability (semiconductor); Combinatorics; Mathematics; Graph; Discrete mathematics; Computer science; Physics","score_opus":0.05487114720185865,"score_gpt":0.30474192691803226,"score_spread":0.2498707797161736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526088640","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7041318,0.0002685117,0.2825774,0.0002757544,0.00007981352,0.00003211595,0.00016037053,0.00040008908,0.012074135],"genre_scores_gemma":[0.97777563,0.00010475943,0.02023104,0.000039982668,0.00003183652,0.000017383012,0.000103502214,0.00007994417,0.0016158603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998698,0.00027085512,0.0000524433,0.00031725081,0.000364978,0.0002965035],"domain_scores_gemma":[0.99376535,0.0030369973,0.001140755,0.0009984443,0.00064030057,0.00041821523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013216214,0.000471677,0.00045121,0.00088494224,0.00089878205,0.0009280448,0.00061664206,0.000539913,0.0038606008],"category_scores_gemma":[0.00767086,0.00026215706,0.00090551464,0.0006634788,0.0011367232,0.0023118176,0.0011066889,0.0013849905,0.00048749728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007463077,0.00017557196,0.0121711325,0.0004006502,0.00014468582,0.002691949,0.0015154523,0.14496318,0.0756901,0.6716342,0.0035296127,0.08633714],"study_design_scores_gemma":[0.00007122018,0.000783885,0.008444981,0.00006622055,0.00016441812,0.0045107612,0.0007414546,0.3086504,0.05043111,0.61272985,0.013243517,0.00016216726],"about_ca_topic_score_codex":0.0004067801,"about_ca_topic_score_gemma":0.00037095958,"teacher_disagreement_score":0.0038606008,"about_ca_system_score_codex":0.00066146225,"about_ca_system_score_gemma":0.00034427474,"threshold_uncertainty_score":0.012914956},"labels":[],"label_agreement":null},{"id":"W1537722183","doi":"","title":"On Theorems Equivalent with Kotzig's Result on Graphs with Unique 1-Factors","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.023767092404476397,"score_gpt":0.2714564342471568,"score_spread":0.24768934184268043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537722183","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17543878,0.007419547,0.28902397,0.019904932,0.0038367147,0.00024096678,0.0017248018,0.0016627114,0.5007476],"genre_scores_gemma":[0.84045786,0.008038671,0.059429716,0.009150077,0.0033356736,0.0005619906,0.001974155,0.001430592,0.075621344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807644,0.0005486724,0.000106227635,0.0005113361,0.00039970974,0.00035763864],"domain_scores_gemma":[0.9946045,0.003650942,0.00038282256,0.0006199044,0.00038053485,0.0003612434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002110968,0.0020673631,0.002247967,0.0052600238,0.0045655696,0.0044256877,0.002959909,0.0029745332,0.019539801],"category_scores_gemma":[0.0075299595,0.0012625668,0.0035648576,0.006509041,0.006467466,0.020485435,0.0076117525,0.008028827,0.0028147027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005895937,0.00002711739,0.00012779303,0.00012801088,0.000016380704,0.0000993601,0.00044790897,0.0006193198,0.0004644334,0.9887087,0.004738599,0.0045634545],"study_design_scores_gemma":[0.000010960031,0.000008168125,0.00011416685,0.000018331422,0.000017472492,0.00008120416,0.000085289896,0.0006303426,0.00014071156,0.99586475,0.003018311,0.000010356147],"about_ca_topic_score_codex":0.003036787,"about_ca_topic_score_gemma":0.0025219747,"teacher_disagreement_score":0.019539801,"about_ca_system_score_codex":0.0033138539,"about_ca_system_score_gemma":0.000895768,"threshold_uncertainty_score":0.06536716},"labels":[],"label_agreement":null},{"id":"W153866119","doi":"","title":"A New s3 Type Condition for Heavy Cycles in Weighted Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Combinatorics; Biology","score_opus":0.03459558252301843,"score_gpt":0.3022723663448287,"score_spread":0.26767678382181026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W153866119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31277895,0.0013313388,0.36269602,0.004722343,0.0037190837,0.0005559598,0.003954593,0.0030713107,0.30717036],"genre_scores_gemma":[0.85245943,0.0008078257,0.09253822,0.0026233566,0.0013015936,0.0005898979,0.0030616857,0.0011995302,0.04541854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987784,0.00024170997,0.00012218604,0.00027973467,0.0002925355,0.00028544705],"domain_scores_gemma":[0.994835,0.0017654902,0.00044515426,0.0007644482,0.0011221004,0.0010677647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013020049,0.0006734597,0.0010339795,0.002430604,0.0028301429,0.0032162198,0.0018712565,0.0033965718,0.033138286],"category_scores_gemma":[0.00908745,0.00075521093,0.0015184936,0.0022955725,0.002367458,0.0070196814,0.0029791796,0.0033373036,0.0049574324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030397828,0.00006827478,0.0012192597,0.00020813152,0.000019364415,0.0004927936,0.00032129415,0.0009605239,0.0063734,0.9537394,0.018316003,0.017977647],"study_design_scores_gemma":[0.00008945928,0.000078590565,0.00073896104,0.00008382326,0.000029562952,0.00060788,0.00033362073,0.010516294,0.0044026366,0.9663821,0.016680753,0.00005634297],"about_ca_topic_score_codex":0.0015355569,"about_ca_topic_score_gemma":0.0019219898,"teacher_disagreement_score":0.033138286,"about_ca_system_score_codex":0.0012485231,"about_ca_system_score_gemma":0.0014139148,"threshold_uncertainty_score":0.11085856},"labels":[],"label_agreement":null},{"id":"W1558974145","doi":"10.37236/131","title":"Near Threshold Graphs","year":2009,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","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 Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Conjecture; Constructive; Lambda; Graph; Characterization (materials science); Degree (music); Discrete mathematics; Computer science; Physics","score_opus":0.017063879545052736,"score_gpt":0.28428539930241,"score_spread":0.26722151975735725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558974145","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63176566,0.0020888844,0.21096678,0.0031808638,0.00026855824,0.00012007087,0.00071373105,0.0007970967,0.15009834],"genre_scores_gemma":[0.96700513,0.00048816163,0.01825217,0.00068066403,0.00013052295,0.0000817108,0.0003308103,0.00009693512,0.012933991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946064,0.000092132585,0.000024850839,0.0001601187,0.00017269391,0.00008956286],"domain_scores_gemma":[0.9979305,0.0010187251,0.00021002379,0.0002934359,0.00020964177,0.00033775196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042839054,0.00029859174,0.00053267187,0.0018666711,0.0013298609,0.0021965068,0.0008313848,0.0011482718,0.0068333526],"category_scores_gemma":[0.0046351315,0.0003840024,0.00039700678,0.000861556,0.0016628141,0.0036970275,0.0019971346,0.0014916025,0.00079207966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038936585,0.000012889894,0.00056536816,0.00005574627,0.0000075679145,0.0001303529,0.00029432683,0.001608468,0.00339787,0.9873074,0.001586602,0.0049943244],"study_design_scores_gemma":[0.000009872812,0.000010762794,0.00031497498,0.000019084724,0.00000814245,0.00023742208,0.00018873058,0.0082162805,0.0010242958,0.9860719,0.00389114,0.0000074009986],"about_ca_topic_score_codex":0.0008110892,"about_ca_topic_score_gemma":0.0011292025,"teacher_disagreement_score":0.0068333526,"about_ca_system_score_codex":0.0012415856,"about_ca_system_score_gemma":0.00045762357,"threshold_uncertainty_score":0.022859812},"labels":[],"label_agreement":null},{"id":"W1567844118","doi":"","title":"Copnumber of graphs with strong isometric dimension two","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Isometric exercise; Mathematics; Dimension (graph theory); Pure mathematics; Medicine; Physical therapy","score_opus":0.023717553742848507,"score_gpt":0.2910267428076806,"score_spread":0.2673091890648321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567844118","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7591701,0.0006690339,0.08658362,0.0034715217,0.0007562344,0.00012880264,0.0013381629,0.0007730628,0.14710951],"genre_scores_gemma":[0.95580876,0.00040772045,0.02028056,0.0005832856,0.0005063866,0.00020757463,0.0010497158,0.00027943836,0.02087656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874973,0.00026096974,0.00006154302,0.0002879013,0.0003528446,0.00028697064],"domain_scores_gemma":[0.9953216,0.001989874,0.000768285,0.00050590525,0.00042693733,0.0009874859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008696085,0.0008923545,0.0013961324,0.004036586,0.00349611,0.004633242,0.0020731122,0.0015913047,0.012584487],"category_scores_gemma":[0.0051395968,0.0007915756,0.0010908024,0.0028564676,0.0032437164,0.0050701993,0.0031228275,0.0027785986,0.0010883056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012017315,0.000039606268,0.00067106576,0.00006366323,0.000011641301,0.0001245084,0.00021739825,0.00075301976,0.001220755,0.9859859,0.0042782137,0.006514128],"study_design_scores_gemma":[0.000031416614,0.000024150264,0.00094281253,0.000022032516,0.00002255767,0.0002923011,0.00014420155,0.006530267,0.0011145461,0.985995,0.004857321,0.000023415765],"about_ca_topic_score_codex":0.0009947887,"about_ca_topic_score_gemma":0.001195844,"teacher_disagreement_score":0.012584487,"about_ca_system_score_codex":0.0017401262,"about_ca_system_score_gemma":0.0008986994,"threshold_uncertainty_score":0.042099297},"labels":[],"label_agreement":null},{"id":"W1586346388","doi":"10.55016/ojs/cdm.v5i1.61965","title":"On the number of components of a graph","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Graph; Mathematics; Computer science; Combinatorics","score_opus":0.02451514538843506,"score_gpt":0.33137306333273153,"score_spread":0.30685791794429645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586346388","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63923615,0.0030710145,0.26118726,0.0037496767,0.00039584903,0.00012254575,0.0019601125,0.00067280786,0.08960453],"genre_scores_gemma":[0.90572983,0.0014196709,0.07624009,0.00028665495,0.0005033989,0.0003124983,0.0011630525,0.0002944943,0.014050307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851435,0.00034269618,0.000089965615,0.00042470716,0.0004173017,0.0002109392],"domain_scores_gemma":[0.9912567,0.005514418,0.00085976324,0.00068367546,0.000746961,0.0009384598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014092334,0.0006571186,0.0007009489,0.0031403166,0.0016361666,0.0034377251,0.0014501978,0.00090817246,0.005611244],"category_scores_gemma":[0.009854596,0.00039297028,0.00046274866,0.002455218,0.0033886316,0.007875008,0.0014561248,0.001574442,0.00075578433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022123852,0.000033824643,0.0045822933,0.00012207411,0.000028891853,0.000097290605,0.0004794926,0.005194271,0.0027463885,0.9614423,0.0028113683,0.022240583],"study_design_scores_gemma":[0.000027129412,0.000067765824,0.0035151623,0.00009462397,0.00004016122,0.0003687607,0.00028690256,0.040283453,0.003971639,0.9349055,0.016393088,0.000045705],"about_ca_topic_score_codex":0.00107748,"about_ca_topic_score_gemma":0.0009236068,"teacher_disagreement_score":0.005611244,"about_ca_system_score_codex":0.0027772854,"about_ca_system_score_gemma":0.00080865825,"threshold_uncertainty_score":0.020150661},"labels":[],"label_agreement":null},{"id":"W159907001","doi":"","title":"Regularized radial basis functional networks: theory and applications","year":2001,"lang":"en","type":"book","venue":"John Wiley & Sons, Inc. eBooks","topic":"Graph theory and applications","field":"Mathematics","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":"Radial basis function; Basis (linear algebra); Computer science; Mathematics; Artificial intelligence; Artificial neural network; Geometry","score_opus":0.02186997029793328,"score_gpt":0.2527054113073797,"score_spread":0.23083544100944645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W159907001","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.0032852686,0.02951366,0.9228614,0.0010715546,0.0005286858,0.000049500668,0.00054049905,0.0015415399,0.040607918],"genre_scores_gemma":[0.1257812,0.058636848,0.7012636,0.0004728175,0.0010838395,0.0003696525,0.0016034187,0.0011610442,0.109627604],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99970263,0.00005448043,0.000017084112,0.00006740858,0.00014073319,0.000017634524],"domain_scores_gemma":[0.9993585,0.00031178122,0.00006552077,0.00007808355,0.00015300412,0.000033134525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055178924,0.0010641913,0.0014919342,0.0015213296,0.0003379891,0.0018169448,0.0012735781,0.0011963886,0.014248623],"category_scores_gemma":[0.0020692665,0.0007154193,0.0005328714,0.0023890338,0.00077206315,0.0022578333,0.0011801353,0.0014714333,0.007664094],"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.000047937745,0.00004875543,0.00034718105,0.00080047635,0.000086770604,0.00013928684,0.00009002955,0.09394372,0.0033514008,0.27961707,0.07487748,0.5466499],"study_design_scores_gemma":[0.000018228828,0.000040191157,0.00049986964,0.00015589646,0.00004689891,0.0005904789,0.000049755752,0.4607584,0.0018427706,0.41832432,0.11762308,0.00005010163],"about_ca_topic_score_codex":0.0011483227,"about_ca_topic_score_gemma":0.001429318,"teacher_disagreement_score":0.014248623,"about_ca_system_score_codex":0.00047812244,"about_ca_system_score_gemma":0.0005223164,"threshold_uncertainty_score":0.04766637},"labels":[],"label_agreement":null},{"id":"W162420740","doi":"","title":"On the spectral radius of graphs with k-vertex cut.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Vertex (graph theory); RADIUS; Combinatorics; Graph; Physics; Quantum mechanics; Computer science; Eigenvalues and eigenvectors","score_opus":0.023932100537675093,"score_gpt":0.24676897304798728,"score_spread":0.2228368725103122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W162420740","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5704347,0.016810045,0.24831232,0.006983018,0.0009234565,0.000102785794,0.001299734,0.000952465,0.15418154],"genre_scores_gemma":[0.9668299,0.0037902691,0.020597907,0.00055393664,0.0008067533,0.0001267006,0.00054086687,0.00033417027,0.0064194202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845266,0.00069092517,0.00005896451,0.00024541805,0.00029154622,0.00026052908],"domain_scores_gemma":[0.98381996,0.011740811,0.0015188276,0.0007637498,0.0008592907,0.0012973974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002064467,0.0009317807,0.0014121427,0.004328819,0.0014839577,0.0027035833,0.0023310636,0.00202392,0.0067158765],"category_scores_gemma":[0.020233989,0.0006333506,0.00050056196,0.0022049283,0.0033659423,0.006073232,0.0027367065,0.0020783956,0.0022772125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033860118,0.00007297242,0.0021186708,0.00030147654,0.0000564041,0.00018276165,0.00052781607,0.021628616,0.0035985177,0.9340859,0.015176848,0.021911548],"study_design_scores_gemma":[0.000033362932,0.000041232943,0.0016772674,0.000102881364,0.000037973252,0.000409413,0.00040022656,0.06395994,0.00123168,0.92697906,0.005086779,0.00004015344],"about_ca_topic_score_codex":0.0012230276,"about_ca_topic_score_gemma":0.0008526199,"teacher_disagreement_score":0.0067158765,"about_ca_system_score_codex":0.0014486271,"about_ca_system_score_gemma":0.00042969748,"threshold_uncertainty_score":0.022466779},"labels":[],"label_agreement":null},{"id":"W1668942716","doi":"10.2139/ssrn.1382662","title":"The von Neumann Entropy of Networks","year":2008,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Graph theory and applications","field":"Mathematics","cited_by":59,"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":"Institut Périmètre de physique théorique; Industry Canada; Mitacs; Government of Canada; Canadian Institute for Advanced Research","keywords":"Von Neumann entropy; Mathematics; Statistical physics; Mathematical economics; Mathematical physics; Physics; Quantum mechanics; Quantum entanglement; Quantum","score_opus":0.01528840422355427,"score_gpt":0.2585444942038324,"score_spread":0.24325608998027815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1668942716","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6127344,0.0043293885,0.26641726,0.010512927,0.0006520634,0.00007085832,0.0007368349,0.00020358143,0.10434272],"genre_scores_gemma":[0.9850048,0.0013285977,0.006102737,0.00024851138,0.00074369536,0.00007479946,0.00016607305,0.000047092857,0.006283684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985594,0.00058736233,0.00007091746,0.00019582862,0.00041807577,0.00016838295],"domain_scores_gemma":[0.9929107,0.0049822987,0.00048720176,0.0006407533,0.00045809767,0.00052103563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026483499,0.0005101507,0.0010687541,0.0027193723,0.0012534931,0.0037731274,0.0010921587,0.0016470971,0.0038879062],"category_scores_gemma":[0.01192657,0.000579762,0.00056344224,0.0014576231,0.005494713,0.009696481,0.0022920205,0.0019587313,0.00031706414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012825361,0.0000056454064,0.00017898795,0.000016281401,0.0000059027416,0.000013544318,0.000068384485,0.003669884,0.00020009579,0.994518,0.00024341245,0.0010670401],"study_design_scores_gemma":[0.0000022659267,0.0000029971798,0.00011989994,0.000005217089,0.000002193392,0.0000138675305,0.00001504435,0.008647062,0.00007167682,0.9907178,0.0003961716,0.0000058329915],"about_ca_topic_score_codex":0.00085280306,"about_ca_topic_score_gemma":0.00068044185,"teacher_disagreement_score":0.0038879062,"about_ca_system_score_codex":0.0016644615,"about_ca_system_score_gemma":0.0009048807,"threshold_uncertainty_score":0.014006019},"labels":[],"label_agreement":null},{"id":"W1673729927","doi":"10.1002/jgt.22057","title":"Hermitian Adjacency Matrix of Digraphs and Mixed Graphs","year":2016,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Graph theory and applications","field":"Mathematics","cited_by":175,"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; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Digraph; Hermitian matrix; Combinatorics; Mathematics; Adjacency matrix; Eigenvalues and eigenvectors; Spectral radius; Matrix (chemical analysis); Interlacing; Arc (geometry); Spectrum (functional analysis); Discrete mathematics; Pure mathematics; Computer science; Graph; Physics","score_opus":0.019834450876697832,"score_gpt":0.29113338314279896,"score_spread":0.27129893226610113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1673729927","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47895136,0.0016798555,0.46539965,0.00079280796,0.00028076416,0.00007919076,0.00073645246,0.00040687606,0.051673137],"genre_scores_gemma":[0.9585103,0.0003608906,0.034301914,0.00015032498,0.000102962455,0.000058338963,0.00021439191,0.00004314077,0.0062577296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961674,0.00010562586,0.000025707408,0.00010136399,0.00009546889,0.000054993987],"domain_scores_gemma":[0.999008,0.00038144906,0.00018064679,0.00009988687,0.00016906646,0.00016096812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027857782,0.00034139998,0.00027880553,0.0020646753,0.00061501976,0.0011440008,0.00041790854,0.000413079,0.0050524636],"category_scores_gemma":[0.0014877015,0.00020561415,0.0002080808,0.00096568366,0.0010072255,0.0012302012,0.00070055784,0.00053608115,0.0005376317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025711652,0.000014753897,0.00040492546,0.000042167572,0.000008316307,0.000118321426,0.00016480028,0.0026515333,0.0035721601,0.981698,0.0009502069,0.010349106],"study_design_scores_gemma":[0.0000092010705,0.000029939536,0.00087782665,0.000020091982,0.0000070685583,0.0003199236,0.00013845474,0.03420577,0.0016765427,0.9565681,0.0061265873,0.000020384363],"about_ca_topic_score_codex":0.0006752634,"about_ca_topic_score_gemma":0.0006043294,"teacher_disagreement_score":0.0050524636,"about_ca_system_score_codex":0.0005815246,"about_ca_system_score_gemma":0.00023455454,"threshold_uncertainty_score":0.016902208},"labels":[],"label_agreement":null},{"id":"W1673750067","doi":"10.1016/j.disc.2015.08.024","title":"Colorings and spectral radius of digraphs","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"McGill University","funders":"Fundamental Research Funds for the Central Universities; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Spectral radius; Mathematics; Combinatorics; RADIUS; Order (exchange); Discrete mathematics; Eigenvalues and eigenvectors; Computer science; Physics; Quantum mechanics","score_opus":0.06394697952593209,"score_gpt":0.31423237553647776,"score_spread":0.25028539601054567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1673750067","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72340894,0.0021478953,0.21408372,0.0022550176,0.00018506922,0.00007963487,0.0008737759,0.00053027953,0.056435782],"genre_scores_gemma":[0.96887577,0.0009657939,0.02184104,0.0002940826,0.000218117,0.000103944185,0.00048452514,0.00017633558,0.0070403125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984536,0.0005797823,0.00007735741,0.00037192422,0.00027835934,0.00023895642],"domain_scores_gemma":[0.9829895,0.010270769,0.0022405402,0.000982449,0.0010831073,0.0024337051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016000805,0.000909396,0.0014907144,0.00391532,0.0023809536,0.00454816,0.0022831475,0.0014087759,0.0074791824],"category_scores_gemma":[0.014242704,0.0012000191,0.00066987186,0.00254507,0.0040821317,0.005188433,0.0024856948,0.0017405695,0.0009669698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013573105,0.000054327767,0.0012418281,0.00009423143,0.000027300215,0.000056502286,0.0004889504,0.013675817,0.0016466124,0.9740365,0.002324839,0.006217262],"study_design_scores_gemma":[0.000028191502,0.000020283376,0.0007036157,0.000028792827,0.000018826247,0.00011386981,0.00022532465,0.035569567,0.0005629537,0.9609252,0.0017844395,0.000018881718],"about_ca_topic_score_codex":0.001673722,"about_ca_topic_score_gemma":0.0018873573,"teacher_disagreement_score":0.0074791824,"about_ca_system_score_codex":0.0023013502,"about_ca_system_score_gemma":0.0006794967,"threshold_uncertainty_score":0.025020361},"labels":[],"label_agreement":null},{"id":"W169044707","doi":"","title":"Laplacian Eigenvalues and the Excess of a Graph.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Graph; Laplace operator; Laplacian matrix; Combinatorics; Mathematical analysis; Physics","score_opus":0.03011903369141844,"score_gpt":0.2670818628958165,"score_spread":0.23696282920439804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W169044707","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62346065,0.0048165033,0.12663797,0.006761159,0.0010087856,0.00003478105,0.0006576499,0.00069326727,0.2359293],"genre_scores_gemma":[0.9729279,0.0013098874,0.006852129,0.00034098234,0.0005052072,0.000032900272,0.00015604321,0.00009818891,0.017776657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996573,0.000079848345,0.000012519002,0.000056267134,0.00012972129,0.000064296844],"domain_scores_gemma":[0.99852365,0.00065659836,0.0002084198,0.00012963203,0.00020059789,0.00028113864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044439497,0.00050570763,0.0005280388,0.0025905936,0.00079761,0.0017715271,0.0007226532,0.0008203467,0.009601569],"category_scores_gemma":[0.0035166228,0.00024044632,0.00027139875,0.0009363287,0.001557708,0.0024528448,0.0011929031,0.0010974,0.0014083025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027810755,0.000015337771,0.0002960116,0.000034072174,0.000006597373,0.00009645054,0.00008675844,0.0013140035,0.0015515743,0.98791414,0.0027574128,0.0058998466],"study_design_scores_gemma":[0.000008561821,0.000009533956,0.00038944973,0.000014197372,0.0000056034837,0.0001946793,0.000092182745,0.0108386045,0.00038236502,0.985294,0.0027616203,0.000009344828],"about_ca_topic_score_codex":0.0005648287,"about_ca_topic_score_gemma":0.00090880966,"teacher_disagreement_score":0.009601569,"about_ca_system_score_codex":0.0006567576,"about_ca_system_score_gemma":0.00025887278,"threshold_uncertainty_score":0.032120407},"labels":[],"label_agreement":null},{"id":"W172056098","doi":"","title":"Average degrees of critical graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.028509372284495956,"score_gpt":0.30911033749573535,"score_spread":0.2806009652112394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W172056098","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76133084,0.0033521927,0.12628731,0.0029407376,0.0003948118,0.00007284489,0.0027576305,0.0005839068,0.10227973],"genre_scores_gemma":[0.986278,0.0009684609,0.006158654,0.00017519653,0.00027316174,0.000044019394,0.00063994696,0.00009731618,0.005365356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994066,0.0001344866,0.00002219041,0.0001417128,0.00014554901,0.00014944332],"domain_scores_gemma":[0.9937325,0.003251007,0.000775741,0.00057557586,0.0006795851,0.0009856442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087163394,0.00057910755,0.00076038577,0.004182502,0.0012858221,0.002736795,0.0012245366,0.0008187379,0.008040544],"category_scores_gemma":[0.010368215,0.00043553798,0.00042759575,0.0016952254,0.0017346416,0.0044498453,0.0012706624,0.0012251018,0.00088665436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001514671,0.000035879522,0.0035549367,0.00016483439,0.00004135032,0.00010358111,0.00033526198,0.009288937,0.0028288527,0.95684767,0.0088786585,0.017768549],"study_design_scores_gemma":[0.00001850381,0.000019749194,0.0019873232,0.00003455276,0.000027139684,0.00026476392,0.00019711419,0.017420702,0.0017391369,0.9730987,0.0051776334,0.000014764909],"about_ca_topic_score_codex":0.0010550538,"about_ca_topic_score_gemma":0.0016941121,"teacher_disagreement_score":0.008040544,"about_ca_system_score_codex":0.0014190469,"about_ca_system_score_gemma":0.00046388037,"threshold_uncertainty_score":0.026898324},"labels":[],"label_agreement":null},{"id":"W1722317191","doi":"10.1016/j.laa.2015.09.029","title":"Equiangular lines and covers of the complete graph","year":2015,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":32,"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","keywords":"Mathematics; Equiangular polygon; Combinatorics; Graph; Discrete mathematics; Geometry; Regular polygon","score_opus":0.06656879837350123,"score_gpt":0.30296537432111625,"score_spread":0.23639657594761504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1722317191","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68692887,0.0022177768,0.15925492,0.0018855534,0.00018336906,0.000056809255,0.0008838136,0.00029836717,0.14829056],"genre_scores_gemma":[0.9495859,0.0012853378,0.018936256,0.00034704368,0.00047668276,0.00008049259,0.0008569025,0.00014737813,0.028284015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928963,0.000209686,0.000028725188,0.00019188726,0.00015924482,0.000120822035],"domain_scores_gemma":[0.998418,0.0006687885,0.0003240793,0.00012618102,0.00021229331,0.00025057458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046395024,0.0005553875,0.00069905,0.0028480727,0.0017409298,0.0024675333,0.0009664444,0.00083261164,0.007630008],"category_scores_gemma":[0.0019583586,0.0004856335,0.00059973646,0.0018863291,0.002535121,0.0041897874,0.001452127,0.001616726,0.0007620204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034105557,0.000016713868,0.0002630302,0.000028323213,0.000010418713,0.00005603933,0.00024646422,0.0012700201,0.0005157908,0.9893546,0.0011488412,0.007055637],"study_design_scores_gemma":[0.0000075449484,0.000010961787,0.00033944435,0.00000883018,0.0000066135303,0.00007110134,0.00012317776,0.0043394277,0.0003652405,0.99132955,0.0033910787,0.0000070324036],"about_ca_topic_score_codex":0.0017455202,"about_ca_topic_score_gemma":0.001469424,"teacher_disagreement_score":0.007630008,"about_ca_system_score_codex":0.0011620269,"about_ca_system_score_gemma":0.00033487924,"threshold_uncertainty_score":0.025524974},"labels":[],"label_agreement":null},{"id":"W1737347830","doi":"10.37236/1785","title":"Enumerative Problems Inspired by Mayer's Theory of Cluster Integrals","year":2004,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":32,"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é du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Class (philosophy); Virial expansion; Enumeration; Cluster (spacecraft); Homogeneous space; Cluster expansion; Imperfect; Discrete mathematics; Virial coefficient; Computer science; Physics; Geometry; Quantum mechanics","score_opus":0.01686202179759467,"score_gpt":0.2683087266909238,"score_spread":0.25144670489332915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1737347830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25260547,0.0042210477,0.65483457,0.0064591854,0.0003692143,0.0001633084,0.0006158674,0.00046471375,0.08026667],"genre_scores_gemma":[0.7714905,0.0022341567,0.19420755,0.0010917232,0.00076891994,0.00032613464,0.0005267636,0.00025700603,0.029097177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949396,0.0001523565,0.0000295989,0.00008965506,0.00014308351,0.000091372276],"domain_scores_gemma":[0.99854493,0.00094722793,0.00010721887,0.00015755268,0.00015314034,0.00008987112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012503369,0.0004768887,0.0009562324,0.0028319207,0.0015847989,0.0019676154,0.0016549196,0.0017862057,0.005352245],"category_scores_gemma":[0.005523319,0.00035743258,0.0011366631,0.0018498632,0.0030281502,0.0050750365,0.0015675013,0.0020256264,0.00046717818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048832953,0.000005603438,0.000104949744,0.000027150294,0.0000033562878,0.00001527714,0.00006019077,0.0025555245,0.00017761867,0.9937657,0.0006576001,0.0026221077],"study_design_scores_gemma":[0.00000403944,0.0000036339795,0.00007007829,0.0000097341635,0.0000024828212,0.000027686849,0.000026396485,0.02111387,0.00017526736,0.9773071,0.0012546206,0.000005123863],"about_ca_topic_score_codex":0.0013411095,"about_ca_topic_score_gemma":0.0013398813,"teacher_disagreement_score":0.005352245,"about_ca_system_score_codex":0.002565313,"about_ca_system_score_gemma":0.0008733065,"threshold_uncertainty_score":0.018612683},"labels":[],"label_agreement":null},{"id":"W175032106","doi":"","title":"On the Laplacian Spectra of Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Laplacian matrix; Eigenvalues and eigenvectors; Laplace operator; Combinatorics; Graph; Algebraic connectivity; Resistance distance; Degree matrix; Discrete mathematics; Line graph; Mathematical analysis; Graph power; Physics","score_opus":0.021342993373551822,"score_gpt":0.266556041425976,"score_spread":0.24521304805242417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W175032106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09146449,0.010909664,0.7909786,0.0044014505,0.0007304741,0.000110236935,0.0011561984,0.00083644746,0.09941238],"genre_scores_gemma":[0.8451183,0.017804343,0.112098105,0.0019152027,0.0027940865,0.00041151157,0.0013717719,0.00057929306,0.017907355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985928,0.0003983728,0.000059509955,0.000291754,0.0004452852,0.00021223653],"domain_scores_gemma":[0.98889005,0.008177906,0.0008131683,0.0006639976,0.00086762395,0.00058721856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014206986,0.0018351148,0.0011274092,0.0043040733,0.0013583293,0.0022285858,0.0014725316,0.0016425445,0.008521268],"category_scores_gemma":[0.014290488,0.00053328555,0.0007268463,0.0027132935,0.0033001332,0.006348636,0.0031114446,0.0037627977,0.0030987759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007259766,0.00008053666,0.00095720903,0.00028439506,0.000041096453,0.00031457323,0.0005141314,0.02112748,0.007298808,0.9315389,0.009119635,0.02865068],"study_design_scores_gemma":[0.000009605542,0.000030472625,0.00079299445,0.00008370839,0.000013137786,0.00029089986,0.00017788864,0.0588601,0.0013432157,0.9333914,0.004971331,0.000035310288],"about_ca_topic_score_codex":0.0009748302,"about_ca_topic_score_gemma":0.0009168871,"teacher_disagreement_score":0.008521268,"about_ca_system_score_codex":0.001220414,"about_ca_system_score_gemma":0.00046036116,"threshold_uncertainty_score":0.028506458},"labels":[],"label_agreement":null},{"id":"W175104714","doi":"","title":"Orientable embedding distributions by genus for certain type of non-planar graphs (II).","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Embedding; Genus; Type (biology); Combinatorics; Planar graph; Planar; Book embedding; Type species; Pure mathematics; Chordal graph; 1-planar graph; Graph; Botany; Biology; Computer science; Artificial intelligence; Paleontology","score_opus":0.017751290286212723,"score_gpt":0.29741306604122736,"score_spread":0.2796617757550146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W175104714","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8866196,0.0008302472,0.067758,0.0010451748,0.00012502457,0.000056804005,0.0003990404,0.0004076511,0.042758398],"genre_scores_gemma":[0.98652565,0.00062585826,0.007106192,0.00014276522,0.00010435109,0.000047716174,0.00029144943,0.00011961323,0.0050364137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952126,0.0000898813,0.000022138565,0.00010246028,0.00013872529,0.00012556593],"domain_scores_gemma":[0.99688596,0.0013132415,0.0007081201,0.00029201043,0.00026138203,0.00053929206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005546142,0.0004314532,0.0004971703,0.001985267,0.0009908939,0.0026606747,0.001310363,0.0010359096,0.00657536],"category_scores_gemma":[0.005966954,0.00039649958,0.0005141684,0.0014903127,0.0022014522,0.0036532206,0.001553213,0.0015769168,0.00053964084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001370426,0.00006830557,0.0046926327,0.00008475364,0.000018717814,0.0003447303,0.00042855006,0.004486676,0.0043281075,0.96524394,0.0032790145,0.01688744],"study_design_scores_gemma":[0.000047707978,0.000064592125,0.008150141,0.000051774674,0.000044636472,0.0014384742,0.000711034,0.0326151,0.0029267287,0.94881564,0.005090708,0.00004346882],"about_ca_topic_score_codex":0.0006616814,"about_ca_topic_score_gemma":0.0009335037,"teacher_disagreement_score":0.00657536,"about_ca_system_score_codex":0.0011242583,"about_ca_system_score_gemma":0.00025204802,"threshold_uncertainty_score":0.021996737},"labels":[],"label_agreement":null},{"id":"W1755416306","doi":"10.1139/cjc-2015-0175","title":"On topological indices of a carbon nanotube network","year":2015,"lang":"en","type":"article","venue":"Canadian Journal of Chemistry","topic":"Graph theory and applications","field":"Mathematics","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Topological index; Molecular graph; Carbon nanotube; Hexagonal crystal system; Vertex (graph theory); Graph theory; Chemistry; Topology (electrical circuits); Graph; Lattice (music); Hexagonal lattice; Combinatorics; Computational chemistry; Discrete mathematics; Mathematics; Physics; Nanotechnology; Crystallography; Quantum mechanics; Materials science","score_opus":0.039725587843742076,"score_gpt":0.2700413748783405,"score_spread":0.23031578703459843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1755416306","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75103486,0.0017436229,0.18149316,0.00065698323,0.00024110197,0.00006332125,0.00039784674,0.00015814735,0.06421102],"genre_scores_gemma":[0.96754795,0.000993525,0.027282164,0.00008376654,0.00016271495,0.00007795015,0.00024947853,0.00008090982,0.0035215714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997924,0.000060632363,0.000009934522,0.00003105659,0.00007842611,0.000027661477],"domain_scores_gemma":[0.9986833,0.00055073807,0.00029164637,0.0000823716,0.00022593842,0.00016594926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038720804,0.0003258562,0.00028251336,0.0022554756,0.00052591634,0.0010478717,0.00038912412,0.00044572228,0.0017186481],"category_scores_gemma":[0.00290131,0.00015960618,0.00016458766,0.00089502655,0.0011560478,0.0020897903,0.00050144235,0.0005068009,0.00023702749],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054390508,0.000030642055,0.0015770915,0.00006578027,0.00000881613,0.00015196,0.00015388301,0.05225579,0.009889986,0.92477995,0.0013046467,0.009726971],"study_design_scores_gemma":[0.000014858735,0.0000824466,0.0018587986,0.000056539968,0.000011813428,0.00026517158,0.00014342512,0.36578137,0.0030087463,0.62303156,0.005710267,0.000035052908],"about_ca_topic_score_codex":0.00042589556,"about_ca_topic_score_gemma":0.00047190185,"teacher_disagreement_score":0.0022554756,"about_ca_system_score_codex":0.00054168986,"about_ca_system_score_gemma":0.0002421585,"threshold_uncertainty_score":0.0057494044},"labels":[],"label_agreement":null},{"id":"W176990240","doi":"","title":"Vertex and Edge Type Relations of Randic Index for Chemical Trees.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Type (biology); Index (typography); Enhanced Data Rates for GSM Evolution; Graph; Artificial intelligence; Computer science; Biology","score_opus":0.030343866383658387,"score_gpt":0.2724838222997454,"score_spread":0.242139955916087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W176990240","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38727832,0.004201488,0.11076323,0.0022141892,0.0009161329,0.00012029328,0.0025600344,0.0010340299,0.4909123],"genre_scores_gemma":[0.9413861,0.0010451797,0.02959497,0.00047603995,0.00042295738,0.00010554047,0.00084874633,0.0003704443,0.025750019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992818,0.00016976353,0.000050735292,0.00015664844,0.00021427625,0.00012671849],"domain_scores_gemma":[0.99797004,0.0008340195,0.00031243343,0.00034882635,0.00030211618,0.00023263672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082806067,0.00029303515,0.00063954305,0.0031943833,0.0018590213,0.003158465,0.001046633,0.0010367621,0.010913342],"category_scores_gemma":[0.0037201724,0.00037238502,0.0003715365,0.0018740393,0.0018397463,0.004896908,0.0012475145,0.0017248319,0.001872102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049165064,0.00001526333,0.0004818717,0.000032514447,0.0000044843855,0.000041045234,0.00014012249,0.00042630825,0.0013719978,0.9865623,0.0026369626,0.0082379],"study_design_scores_gemma":[0.000011334489,0.000014683831,0.0007386984,0.000025012721,0.0000124518,0.00018289605,0.00011730133,0.003851382,0.0015387196,0.9838194,0.009668933,0.000019284475],"about_ca_topic_score_codex":0.0010348631,"about_ca_topic_score_gemma":0.0017293534,"teacher_disagreement_score":0.010913342,"about_ca_system_score_codex":0.0010416713,"about_ca_system_score_gemma":0.00044761252,"threshold_uncertainty_score":0.03650874},"labels":[],"label_agreement":null},{"id":"W178751288","doi":"","title":"A sk type condition for heavy cycles in weighted graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Combinatorics; Geology","score_opus":0.024735094740734483,"score_gpt":0.310158737922295,"score_spread":0.2854236431815605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W178751288","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32583138,0.0013452724,0.29917333,0.006060572,0.003158139,0.00048052674,0.0051713055,0.002671762,0.35610774],"genre_scores_gemma":[0.89259434,0.00085242506,0.04027439,0.0019045596,0.0010490038,0.00038078293,0.0032645955,0.00081313524,0.058866616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986614,0.00026161317,0.00012946605,0.00028289747,0.00030148847,0.0003632406],"domain_scores_gemma":[0.99297947,0.0026654482,0.00059856736,0.0011718988,0.0016041395,0.000980377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013251645,0.0005731846,0.0010003038,0.001978485,0.0026050704,0.0030234824,0.0016561175,0.002476525,0.03426211],"category_scores_gemma":[0.011348204,0.00075137545,0.0011930998,0.0020281756,0.00220872,0.008679838,0.0028001827,0.003741215,0.0063248356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036592458,0.00006865337,0.0012856076,0.00023906732,0.000024431863,0.00032319568,0.00030831608,0.0012124839,0.0037526966,0.95800424,0.020051865,0.014363506],"study_design_scores_gemma":[0.00008533133,0.00005337215,0.00079452107,0.00007767669,0.00005123624,0.00044979385,0.00035250475,0.009781696,0.0028815644,0.97304916,0.012378807,0.00004430479],"about_ca_topic_score_codex":0.0019891937,"about_ca_topic_score_gemma":0.0028078933,"teacher_disagreement_score":0.03426211,"about_ca_system_score_codex":0.0013297803,"about_ca_system_score_gemma":0.0016354222,"threshold_uncertainty_score":0.11461824},"labels":[],"label_agreement":null},{"id":"W1788889037","doi":"10.1017/s0963548316000201","title":"Median Eigenvalues of Bipartite Subcubic Graphs","year":2016,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Graph theory and applications","field":"Mathematics","cited_by":10,"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":"Eigenvalues and eigenvectors; Bipartite graph; Interval (graph theory); Graph; Degree (music); Complete bipartite graph","score_opus":0.06222979210801924,"score_gpt":0.3082428999989921,"score_spread":0.2460131078909729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1788889037","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8972751,0.00036012506,0.07428471,0.0003082696,0.000030447989,0.000019367953,0.00025397938,0.00027177104,0.02719616],"genre_scores_gemma":[0.9932094,0.00011976666,0.004112476,0.000051438637,0.000033609205,0.000032624062,0.00015029813,0.000041427214,0.0022489824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968433,0.000059906815,0.000009590347,0.000059731792,0.00010329256,0.0000832157],"domain_scores_gemma":[0.99909055,0.00039614912,0.00015185744,0.0000940275,0.00011180705,0.00015563575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002794072,0.00031284775,0.00034780707,0.001917906,0.0005850167,0.0008074267,0.0004144344,0.00033710257,0.004129106],"category_scores_gemma":[0.0019546174,0.00019897906,0.0001691001,0.00081249786,0.00101139,0.0008650318,0.00085887156,0.00045411676,0.00047976052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038142267,0.00008093275,0.00397239,0.00012292001,0.000033038574,0.00034221384,0.0006332865,0.032374363,0.028054204,0.8909586,0.004715816,0.038330782],"study_design_scores_gemma":[0.000024895553,0.000027823367,0.003630234,0.000018588064,0.0000072196917,0.00016075608,0.00020303845,0.104466744,0.004177085,0.8846129,0.0026508789,0.000019820054],"about_ca_topic_score_codex":0.00052957464,"about_ca_topic_score_gemma":0.0004366452,"teacher_disagreement_score":0.004129106,"about_ca_system_score_codex":0.0005020081,"about_ca_system_score_gemma":0.0001852547,"threshold_uncertainty_score":0.013813257},"labels":[],"label_agreement":null},{"id":"W18057595","doi":"10.1107/s0108270107051104","title":"Graphs K1*4, 5, K1*5, 4, K1*4, 4, K2, 3, 4, have the property M(3).","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Property (philosophy); Combinatorics; Philosophy; Epistemology","score_opus":0.030689331042505236,"score_gpt":0.2913653033221387,"score_spread":0.26067597227963346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W18057595","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6328833,0.0007592769,0.053456135,0.0012295701,0.00053440203,0.0005239878,0.01200743,0.0017559957,0.29684988],"genre_scores_gemma":[0.8692134,0.00048974564,0.044177562,0.00030457176,0.000035983263,0.0002447959,0.012800189,0.00034392116,0.07238997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99983716,0.00001857913,0.000011373323,0.000044322795,0.000020807978,0.00006767984],"domain_scores_gemma":[0.99960357,0.00006087896,0.00012640558,0.00008684497,0.000059660473,0.00006255131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010104434,0.000776684,0.00030695894,0.0006944623,0.0014287974,0.0009884471,0.0005676256,0.0005403045,0.03856774],"category_scores_gemma":[0.0004677358,0.00025890535,0.0006482333,0.00068213744,0.0008121398,0.000978888,0.0006924117,0.00051451137,0.0059853294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002091595,0.0006563169,0.015075489,0.0020891458,0.00045821906,0.004945124,0.001101152,0.009045716,0.14298186,0.48063335,0.09848859,0.2424335],"study_design_scores_gemma":[0.00029599495,0.0005415376,0.059756625,0.0003229105,0.00039391013,0.00799608,0.0034070143,0.010093553,0.09682356,0.439111,0.3810784,0.000179463],"about_ca_topic_score_codex":0.0012920672,"about_ca_topic_score_gemma":0.0036098128,"teacher_disagreement_score":0.03856774,"about_ca_system_score_codex":0.0008163428,"about_ca_system_score_gemma":0.00057104026,"threshold_uncertainty_score":0.129022},"labels":[],"label_agreement":null},{"id":"W182726185","doi":"","title":"On the Spectral Radius of Unicyclic Graphs with n Vertices and Edge Independence Number q.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Combinatorics; Independence number; Enhanced Data Rates for GSM Evolution; Independence (probability theory); RADIUS; Graph; Eigenvalues and eigenvectors; Statistics; Physics; Computer science; Artificial intelligence; Quantum mechanics; Computer network","score_opus":0.017555822875046728,"score_gpt":0.2751346892003651,"score_spread":0.25757886632531835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W182726185","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7045635,0.012571963,0.15064959,0.0063216127,0.0005556763,0.000099866076,0.001265355,0.00064089213,0.123331554],"genre_scores_gemma":[0.9835143,0.0022347711,0.009259196,0.0003070082,0.00041599755,0.00009896581,0.00031848784,0.00014183485,0.0037095018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985683,0.0007362155,0.000052912306,0.00020923313,0.00022161767,0.00021178229],"domain_scores_gemma":[0.9802643,0.014765286,0.0020026024,0.0007484891,0.000835978,0.0013833251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020788566,0.0007405271,0.0011770984,0.0036363548,0.0011101601,0.0019168503,0.0019303932,0.001395493,0.005236114],"category_scores_gemma":[0.020554459,0.0005648532,0.00035567858,0.0017905786,0.003425999,0.003869834,0.0023195501,0.0016675456,0.0013986329],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006851384,0.00011056085,0.0038476791,0.00042161954,0.000089154295,0.00031332925,0.000688779,0.047534406,0.0054952335,0.8929276,0.020501168,0.02738525],"study_design_scores_gemma":[0.0000658382,0.00007883919,0.0029405968,0.00012571283,0.000047312562,0.0005027368,0.0005130896,0.109001264,0.001670467,0.87973726,0.0052581225,0.000058651764],"about_ca_topic_score_codex":0.0010984621,"about_ca_topic_score_gemma":0.0007831566,"teacher_disagreement_score":0.005236114,"about_ca_system_score_codex":0.0012998421,"about_ca_system_score_gemma":0.000417993,"threshold_uncertainty_score":0.017516553},"labels":[],"label_agreement":null},{"id":"W1844255844","doi":"10.1090/conm/558/11048","title":"Spectra and systems of equations","year":2011,"lang":"en","type":"other","venue":"Contemporary mathematics - American Mathematical Society","topic":"Graph theory and applications","field":"Mathematics","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":"Simon Fraser University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Spectral line; Pure mathematics; Mathematical analysis; Physics; Quantum mechanics","score_opus":0.07918179795817444,"score_gpt":0.30812891077371846,"score_spread":0.22894711281554403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1844255844","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.24460256,0.0020641694,0.5855027,0.0024664206,0.0003839862,0.00012270559,0.0005610764,0.00054058986,0.16375576],"genre_scores_gemma":[0.9213152,0.00046765618,0.061216947,0.0003330552,0.0002544211,0.00013672,0.00029098365,0.00009731879,0.015887683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885845,0.00031950965,0.00007932651,0.0002535129,0.00034315686,0.00014601152],"domain_scores_gemma":[0.9981427,0.0011378905,0.00016703518,0.0002076306,0.00024418594,0.000100576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012853874,0.00037291276,0.0004748357,0.0014243894,0.001183131,0.0020470172,0.0006880295,0.00075331336,0.007204953],"category_scores_gemma":[0.0032824574,0.00031409282,0.0010219641,0.00068365224,0.0034166474,0.0033448837,0.0017168305,0.001854404,0.000643658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002606856,0.000002780449,0.00007804312,0.0000107721735,0.0000020553528,0.000020336915,0.00011223664,0.0003773811,0.00025089865,0.9976102,0.00016916498,0.0013636044],"study_design_scores_gemma":[0.0000058929345,0.000005467075,0.00011514618,0.000009444511,0.0000026501366,0.000058139933,0.000049073074,0.0058478867,0.00033638097,0.99005073,0.0035135222,0.0000056026934],"about_ca_topic_score_codex":0.001228865,"about_ca_topic_score_gemma":0.0010630828,"teacher_disagreement_score":0.007204953,"about_ca_system_score_codex":0.0018175687,"about_ca_system_score_gemma":0.0007009118,"threshold_uncertainty_score":0.024102986},"labels":[],"label_agreement":null},{"id":"W1858499400","doi":"10.37236/1975","title":"Rank&amp;ndash;Three Matroids are Rayleigh","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":16,"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","keywords":"Matroid; Mathematics; Combinatorics; Rank (graph theory); Monotonic function; Set (abstract data type); Graphic matroid; Property (philosophy); Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.025276663000951327,"score_gpt":0.2897159135556395,"score_spread":0.2644392505546882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1858499400","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57082826,0.00077845214,0.29579034,0.001990559,0.000113791546,0.00010003023,0.0015620375,0.001054139,0.12778243],"genre_scores_gemma":[0.9659931,0.00023985494,0.02431375,0.00019892392,0.00005076037,0.00004625744,0.00041243396,0.00007013801,0.008674813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899274,0.00021759138,0.00006578475,0.00019069498,0.00029970906,0.00023348823],"domain_scores_gemma":[0.9964306,0.0011916723,0.00066210586,0.00058171677,0.00071609893,0.00041787335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071719446,0.000572099,0.0005453403,0.00072875916,0.0009852645,0.0032417746,0.00064213783,0.00067246053,0.007848541],"category_scores_gemma":[0.0029899178,0.0004262095,0.0006081513,0.00076433684,0.0020755336,0.003171989,0.0014590097,0.0014217658,0.0014201954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024398652,0.000039035647,0.0023079296,0.00015361588,0.00003998453,0.000423754,0.00044559367,0.012253307,0.016617307,0.9299113,0.0058800704,0.03168404],"study_design_scores_gemma":[0.0000386517,0.00011650261,0.002480892,0.000046152945,0.000037777765,0.0016640028,0.0006551132,0.07666318,0.023570858,0.8672996,0.027342493,0.00008472028],"about_ca_topic_score_codex":0.0019725873,"about_ca_topic_score_gemma":0.002475669,"teacher_disagreement_score":0.007848541,"about_ca_system_score_codex":0.00089117815,"about_ca_system_score_gemma":0.0006423028,"threshold_uncertainty_score":0.026255965},"labels":[],"label_agreement":null},{"id":"W1861968797","doi":"10.1016/j.jcta.2015.11.003","title":"Critical exponents of graphs","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Graph theory and applications","field":"Mathematics","cited_by":18,"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":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; UPS Foundation; National Science Foundation","keywords":"Chordal graph; Mathematics; Combinatorics; Critical exponent; Bipartite graph; Exponent; Treewidth; Indifference graph; Conjecture; Pathwidth; Invariant (physics); Discrete mathematics; Graph; Line graph","score_opus":0.04989356602177974,"score_gpt":0.3323412379104951,"score_spread":0.28244767188871533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1861968797","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6606956,0.010008663,0.05779233,0.014312901,0.0025048705,0.00015683041,0.00049759104,0.00073313015,0.2532981],"genre_scores_gemma":[0.9712406,0.0025631287,0.005154651,0.0006069483,0.0023404015,0.00012767907,0.00024442095,0.00020941073,0.01751283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938726,0.0002059664,0.000028622571,0.00009440753,0.00016865775,0.0001149965],"domain_scores_gemma":[0.99469805,0.0025179733,0.00071025407,0.00031020536,0.00062028796,0.0011432564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013866945,0.0015074974,0.0014607655,0.008700718,0.0024536664,0.0051793465,0.0012296411,0.0017143632,0.009789596],"category_scores_gemma":[0.013235913,0.00095645705,0.00066309766,0.002132697,0.0052782386,0.0057259775,0.0027853623,0.003802236,0.0009059747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027718945,0.000015298792,0.00032582172,0.00004049883,0.000008129143,0.000058991744,0.00025740085,0.00064178306,0.00045041938,0.99398285,0.0020652632,0.0021258052],"study_design_scores_gemma":[0.000020306847,0.0000067176475,0.00031330902,0.000028567634,0.0000063997068,0.000059293117,0.00007867642,0.0026700627,0.00013860679,0.9949562,0.0017140418,0.000007816171],"about_ca_topic_score_codex":0.0012093085,"about_ca_topic_score_gemma":0.0012160717,"teacher_disagreement_score":0.009789596,"about_ca_system_score_codex":0.002373466,"about_ca_system_score_gemma":0.00080104027,"threshold_uncertainty_score":0.032749414},"labels":[],"label_agreement":null},{"id":"W186627527","doi":"","title":"Extremal Trees with Respect to Dominance Order.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dominance (genetics); Order (exchange); Combinatorics; Mathematical economics; Biology; Business","score_opus":0.021152460912072353,"score_gpt":0.2829915776536043,"score_spread":0.26183911674153193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W186627527","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37082267,0.002582193,0.30946395,0.0038279928,0.00048063006,0.00008908051,0.0016851964,0.00058066193,0.31046766],"genre_scores_gemma":[0.92948866,0.0010254201,0.034297504,0.00047808798,0.00039188683,0.000067440305,0.0007777147,0.00016681767,0.03330649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999062,0.00022637658,0.00004774794,0.0001895738,0.00027973298,0.00019448962],"domain_scores_gemma":[0.9972324,0.001310269,0.00037555484,0.00033148727,0.00039545738,0.0003548767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006782671,0.0003505781,0.0006578812,0.002141117,0.0017829183,0.0037247173,0.0008080239,0.0010878998,0.008504967],"category_scores_gemma":[0.0049563716,0.00042539,0.00040420724,0.0015279206,0.0017660597,0.003991865,0.0015547001,0.0022232367,0.0011742942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029625953,0.000012541954,0.00030054248,0.000026826967,0.000007757722,0.00008355065,0.00012645163,0.0009835133,0.00073286874,0.98813397,0.0019721368,0.007590315],"study_design_scores_gemma":[0.0000081083745,0.000008121593,0.00032319303,0.00001518657,0.00000791341,0.00026099366,0.00010831683,0.00406901,0.00039044168,0.9895884,0.0052131624,0.0000071335535],"about_ca_topic_score_codex":0.0008764167,"about_ca_topic_score_gemma":0.0015952771,"teacher_disagreement_score":0.008504967,"about_ca_system_score_codex":0.001149554,"about_ca_system_score_gemma":0.00046074463,"threshold_uncertainty_score":0.02845192},"labels":[],"label_agreement":null},{"id":"W1872981680","doi":"10.1016/j.jnt.2016.01.013","title":"The Euclid–Mullin graph","year":2016,"lang":"en","type":"article","venue":"Journal of Number Theory","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"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":"Engineering and Physical Sciences Research Council; University of Waterloo; University of Bristol","keywords":"Mathematics; Graph; Discrete mathematics; Combinatorics","score_opus":0.02863460795594859,"score_gpt":0.31819958597645315,"score_spread":0.28956497802050457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1872981680","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4556033,0.003444501,0.26005858,0.007558718,0.0014715315,0.0001248119,0.0012374774,0.00062484643,0.2698763],"genre_scores_gemma":[0.8912729,0.0019581101,0.054392003,0.0016473827,0.00088239997,0.00012215292,0.0006546327,0.00023012645,0.04884034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99967694,0.00010037032,0.000012165333,0.000088774046,0.00008039894,0.000041339677],"domain_scores_gemma":[0.998979,0.00035695825,0.00019179852,0.00011116199,0.00018867826,0.00017246966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033709177,0.00040693916,0.000569168,0.002285683,0.0014823123,0.0015540295,0.0009019288,0.0010619179,0.006440366],"category_scores_gemma":[0.0019527272,0.00027119985,0.00033946,0.0013292524,0.0016324369,0.0025057672,0.0010785393,0.0014750719,0.0008856846],"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.000024581375,0.00000612253,0.0001551142,0.0000306104,0.0000051929774,0.000047302066,0.00008064082,0.001072247,0.0005904064,0.98640347,0.0029014712,0.008682888],"study_design_scores_gemma":[0.000009905428,0.000009380552,0.00030244558,0.00001224636,0.0000053749336,0.00012363255,0.00005407038,0.005718868,0.00031912376,0.9823956,0.01104004,0.000009340773],"about_ca_topic_score_codex":0.0011350509,"about_ca_topic_score_gemma":0.0011204793,"teacher_disagreement_score":0.006440366,"about_ca_system_score_codex":0.00077804225,"about_ca_system_score_gemma":0.00048204404,"threshold_uncertainty_score":0.021545172},"labels":[],"label_agreement":null},{"id":"W1906735889","doi":"10.1016/j.dam.2019.09.016","title":"On split graphs with four distinct eigenvalues","year":2019,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","topic":"Graph theory and applications","field":"Mathematics","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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Science Foundation Ireland; University of Manitoba","keywords":"Combinatorics; Mathematics; Eigenvalues and eigenvectors; Vertex (graph theory); Graph; Split graph; Block graph; Chordal graph; Discrete mathematics; Cograph; 1-planar graph; Physics","score_opus":0.04342340528400412,"score_gpt":0.2923687122327828,"score_spread":0.2489453069487787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1906735889","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7562487,0.00091754954,0.12355636,0.003127361,0.00064124254,0.0000927177,0.00057105033,0.00041795225,0.1144271],"genre_scores_gemma":[0.93324655,0.00064565224,0.025229009,0.00058472203,0.00043984354,0.00013272988,0.00049963035,0.00035113146,0.038870633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995153,0.00015646749,0.000014502146,0.00009793493,0.00012199862,0.00009372237],"domain_scores_gemma":[0.99844605,0.00068970496,0.00025234808,0.00015265887,0.00016205247,0.00029719583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004620395,0.0012226298,0.00087657117,0.003172309,0.0016857499,0.0022777987,0.0012108184,0.0018252131,0.011324917],"category_scores_gemma":[0.0023071088,0.0005680291,0.00064304826,0.0011306239,0.002581765,0.0031898725,0.0024562762,0.0019797704,0.0017304635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010828468,0.000046955574,0.0003085879,0.00008400012,0.000013751893,0.00022120429,0.00035077296,0.0033809207,0.002700977,0.98084533,0.0038623663,0.008076888],"study_design_scores_gemma":[0.000017783801,0.000011576931,0.00021106051,0.00001908866,0.000006436089,0.000118604075,0.00014199762,0.012039338,0.00045914372,0.98587286,0.0010935478,0.000008451145],"about_ca_topic_score_codex":0.0005146575,"about_ca_topic_score_gemma":0.0006316512,"teacher_disagreement_score":0.011324917,"about_ca_system_score_codex":0.0008640326,"about_ca_system_score_gemma":0.00034763702,"threshold_uncertainty_score":0.037885606},"labels":[],"label_agreement":null},{"id":"W1937228677","doi":"10.37236/5031","title":"Spectrally Extremal Vertices, Strong Cospectrality, and State Transfer","year":2016,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","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":"Ministério da Educação; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Wheel graph; Path graph; Discrete mathematics; Graph; Partition (number theory); Frequency partition of a graph; Graph power; Line graph","score_opus":0.029728523338030558,"score_gpt":0.2959702899511272,"score_spread":0.2662417666130966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1937228677","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8642526,0.000108526496,0.12015639,0.00022261904,0.00002407282,0.000027478369,0.00007605748,0.00020360929,0.01492863],"genre_scores_gemma":[0.98864543,0.00005099808,0.010203065,0.000029123441,0.00001064335,0.00002110817,0.000055602966,0.000025185473,0.0009588581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995919,0.000109636145,0.000018109513,0.00011425965,0.00010164791,0.00006443609],"domain_scores_gemma":[0.9984396,0.00064342085,0.00030023293,0.00038180003,0.00008028748,0.0001546254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003331517,0.00023705348,0.00025137607,0.00058859674,0.0008369815,0.0008594106,0.0004871745,0.0006740505,0.00245388],"category_scores_gemma":[0.0023490665,0.0002511384,0.000250423,0.0003907903,0.0016394632,0.0015466448,0.0010627755,0.0006657359,0.00020644766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022607794,0.0001238453,0.0022341434,0.00009247946,0.000020348509,0.0003677844,0.0003395559,0.02842099,0.06759819,0.88008374,0.00065055356,0.019842336],"study_design_scores_gemma":[0.000034000986,0.00013030184,0.002274487,0.000015386235,0.000019742418,0.0005352349,0.00023769125,0.113224715,0.038051296,0.8436501,0.0017988727,0.000028120228],"about_ca_topic_score_codex":0.00020183112,"about_ca_topic_score_gemma":0.00025215643,"teacher_disagreement_score":0.00245388,"about_ca_system_score_codex":0.00038476128,"about_ca_system_score_gemma":0.0002052095,"threshold_uncertainty_score":0.008209109},"labels":[],"label_agreement":null},{"id":"W1941981067","doi":"10.37236/1100","title":"Fractional Biclique Covers and Partitions of Graphs","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vancouver Island University","funders":"","keywords":"Combinatorics; Complete bipartite graph; Mathematics; Bipartite graph; Partition (number theory); Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.00994000341867928,"score_gpt":0.2605890001975506,"score_spread":0.2506489967788713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1941981067","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85404706,0.0019704807,0.10291957,0.00057208247,0.00008384687,0.000039791594,0.0002596795,0.00014070758,0.039966743],"genre_scores_gemma":[0.9799114,0.00054813555,0.015361068,0.00009196867,0.000099572804,0.00004300523,0.00020198223,0.000037834103,0.0037049963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921834,0.00017279667,0.00002955106,0.00014813215,0.00026098837,0.00017023375],"domain_scores_gemma":[0.9980324,0.0010495449,0.0003213151,0.00021654379,0.00016839328,0.00021178978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005508896,0.0004343936,0.00044161943,0.0022171796,0.0014079061,0.0018271697,0.00058250845,0.00066180277,0.0030294533],"category_scores_gemma":[0.0037213515,0.00039285998,0.00035606453,0.0013082039,0.001999082,0.0027549174,0.0011969216,0.0008056351,0.00029514168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030134438,0.000028650615,0.0017981813,0.00011898725,0.00002054742,0.00019461267,0.0005497014,0.022180311,0.00883465,0.93870485,0.0015116774,0.025756504],"study_design_scores_gemma":[0.00002064013,0.00007934991,0.0018602543,0.000045637622,0.000019080737,0.00055707817,0.00033842272,0.07879286,0.0072727716,0.9014518,0.009533284,0.000028808718],"about_ca_topic_score_codex":0.0014171475,"about_ca_topic_score_gemma":0.0017357203,"teacher_disagreement_score":0.0030294533,"about_ca_system_score_codex":0.001264284,"about_ca_system_score_gemma":0.0003012803,"threshold_uncertainty_score":0.010134578},"labels":[],"label_agreement":null},{"id":"W1964602237","doi":"10.1016/j.disc.2010.06.037","title":"SC-Hamiltonian graphs and digraphs: New necessary conditions and their impacts","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Hamiltonian path; Combinatorics; Hamiltonian (control theory); Separable space; Conjecture; Discrete mathematics; Pancyclic graph; Hamiltonian path problem; Digraph; Graph; Line graph; Pathwidth; Mathematical analysis","score_opus":0.019654365323875926,"score_gpt":0.2929845635242216,"score_spread":0.27333019820034565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964602237","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1580689,0.0078143375,0.54939485,0.019002922,0.0022329385,0.00043210358,0.004643341,0.0007549245,0.25765574],"genre_scores_gemma":[0.8509833,0.010146814,0.096565515,0.0033535988,0.0036586511,0.00091185566,0.0029065069,0.0005078252,0.030965894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820435,0.0005236534,0.00014801288,0.00040223234,0.00047261314,0.00024910248],"domain_scores_gemma":[0.9791878,0.014046281,0.0015545724,0.0010936704,0.002315543,0.0018021656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030009814,0.0014421674,0.0021051082,0.0042908234,0.003172506,0.0040130313,0.0025259387,0.0034597802,0.025077533],"category_scores_gemma":[0.022218103,0.0013182667,0.0022576195,0.004351948,0.0055690138,0.01251601,0.0044514444,0.008780383,0.001875997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043528216,0.00007199121,0.00037443935,0.00017603156,0.000013504643,0.00012959952,0.00016866362,0.0016144093,0.0005005005,0.9872896,0.0037989274,0.0058186892],"study_design_scores_gemma":[0.000019176654,0.000016290263,0.00026937484,0.00004460977,0.000017585122,0.00009930455,0.00014396558,0.006933759,0.00033955113,0.9897376,0.0023605116,0.000018363504],"about_ca_topic_score_codex":0.002016337,"about_ca_topic_score_gemma":0.0038674045,"teacher_disagreement_score":0.025077533,"about_ca_system_score_codex":0.002514192,"about_ca_system_score_gemma":0.0025842588,"threshold_uncertainty_score":0.08389264},"labels":[],"label_agreement":null},{"id":"W1966976508","doi":"10.1021/ci0342775","title":"Variable Neighborhood Search for Extremal Graphs. 10. Comparison of Irregularity Indices for Chemical Trees","year":2005,"lang":"en","type":"article","venue":"Journal of Chemical Information and Modeling","topic":"Graph theory and applications","field":"Mathematics","cited_by":75,"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","funders":"","keywords":"Mathematics; Mathematical chemistry; Measure (data warehouse); Variance (accounting); Combinatorics; Variable (mathematics); Degree (music); Statistics; Discrete mathematics; Computer science; Data mining; Mathematical analysis","score_opus":0.08588413040324633,"score_gpt":0.36034053793797227,"score_spread":0.27445640753472594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966976508","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73979276,0.0011982715,0.24842745,0.00050282537,0.000028104785,0.00009120786,0.0005782789,0.00022094723,0.009160048],"genre_scores_gemma":[0.9403118,0.0002465961,0.05748584,0.00004889488,0.000020045301,0.00005952297,0.00065527397,0.000051177023,0.0011208274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957436,0.0001780933,0.000020449295,0.00010224648,0.000073919444,0.000050874052],"domain_scores_gemma":[0.9939732,0.004460036,0.00055949733,0.0003855283,0.0003572593,0.00026453016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013280615,0.00017919875,0.000522982,0.0020433578,0.00076636876,0.00090086285,0.0007576932,0.00065653457,0.0021723765],"category_scores_gemma":[0.009057673,0.00024276903,0.0003736417,0.0010880672,0.0009365924,0.0013542442,0.00072637224,0.0004605337,0.00013079861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090021256,0.00024944427,0.036752418,0.0004885054,0.0002055603,0.00033461515,0.00058863015,0.4041534,0.007862738,0.44494605,0.005166009,0.0983523],"study_design_scores_gemma":[0.000058928552,0.00010548358,0.0059452336,0.00003474789,0.00003993596,0.00025187954,0.00020621352,0.7902874,0.0021820155,0.1991379,0.0017288495,0.000021454174],"about_ca_topic_score_codex":0.0010932721,"about_ca_topic_score_gemma":0.0017797168,"teacher_disagreement_score":0.0021723765,"about_ca_system_score_codex":0.00092669256,"about_ca_system_score_gemma":0.00047279827,"threshold_uncertainty_score":0.007267356},"labels":[],"label_agreement":null},{"id":"W1967121281","doi":"10.1016/j.laa.2007.10.024","title":"On the spectral radius of graphs with a given domination number","year":2007,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Spectral radius; Mathematics; Combinatorics; Domination analysis; Adjacency matrix; Chordal graph; Indifference graph; RADIUS; Metric dimension; Discrete mathematics; Graph; 1-planar graph; Eigenvalues and eigenvectors; Vertex (graph theory); Computer science; Physics","score_opus":0.017092979687010932,"score_gpt":0.2824911254626855,"score_spread":0.26539814577567455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967121281","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7239153,0.0037716394,0.20884663,0.003843143,0.00020115371,0.00006914844,0.0006962926,0.00063664606,0.058020126],"genre_scores_gemma":[0.9727041,0.0014978601,0.019815138,0.00032883623,0.0004969367,0.00012653584,0.00033865962,0.00023015615,0.0044616936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982408,0.00079235097,0.0000654385,0.00036864844,0.00029653235,0.00023619691],"domain_scores_gemma":[0.9736008,0.019821035,0.002302922,0.0010132773,0.0011695242,0.0020923796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029285527,0.0010907722,0.0020422682,0.0049250317,0.0017902383,0.003385271,0.0026127247,0.0018669857,0.0053411555],"category_scores_gemma":[0.020723311,0.0006949446,0.0006488808,0.0030002424,0.0048728595,0.0065210066,0.0026251776,0.0019893812,0.0008668371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041372242,0.000086545115,0.0019015148,0.00022342289,0.000050580253,0.00011280379,0.00070611073,0.026523063,0.00545597,0.9476712,0.004136885,0.012718161],"study_design_scores_gemma":[0.000046698176,0.000053888467,0.0015614901,0.000067347166,0.000048151596,0.0002943868,0.00036053293,0.101218954,0.0020113504,0.8919142,0.0023634846,0.00005946484],"about_ca_topic_score_codex":0.0010689971,"about_ca_topic_score_gemma":0.0007014591,"teacher_disagreement_score":0.0053411555,"about_ca_system_score_codex":0.0018463578,"about_ca_system_score_gemma":0.0006445982,"threshold_uncertainty_score":0.017867923},"labels":[],"label_agreement":null},{"id":"W1967520751","doi":"10.1016/j.laa.2011.03.033","title":"On Hadamard diagonalizable graphs","year":2011,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":20,"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","funders":"","keywords":"Mathematics; Diagonalizable matrix; Hadamard transform; Combinatorics; Discrete mathematics; Eigenvalues and eigenvectors; Mathematical analysis","score_opus":0.05550721298067455,"score_gpt":0.28859461260165303,"score_spread":0.2330873996209785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967520751","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47075197,0.0026142483,0.28003186,0.005788481,0.0016545644,0.000117519674,0.0006984179,0.0010337112,0.23730914],"genre_scores_gemma":[0.905597,0.0013490502,0.028785668,0.0012098622,0.0013173529,0.000114273425,0.000450797,0.00028472138,0.06089139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921787,0.0002511343,0.000026184494,0.00014668665,0.00019971767,0.00015838932],"domain_scores_gemma":[0.99847466,0.00056409475,0.00025069708,0.00020127562,0.00024440297,0.00026497553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071111275,0.001066095,0.0013477979,0.0032068563,0.0024351983,0.0027479501,0.0015331769,0.0013896285,0.011901501],"category_scores_gemma":[0.0020877994,0.00061012636,0.0010025392,0.0029485433,0.00438412,0.0040812595,0.0020216366,0.0029343758,0.0013784459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000146345965,0.000019097854,0.00003966016,0.000018916155,0.000003065142,0.000027918488,0.000118175936,0.00064698065,0.00043467243,0.99529797,0.0008478802,0.0025311154],"study_design_scores_gemma":[0.0000067947217,0.0000067392866,0.00004663773,0.0000065118757,0.0000021852275,0.00002283011,0.00004140979,0.003006017,0.00016769653,0.995752,0.0009332236,0.000007943198],"about_ca_topic_score_codex":0.0023084767,"about_ca_topic_score_gemma":0.0023772086,"teacher_disagreement_score":0.011901501,"about_ca_system_score_codex":0.0015533476,"about_ca_system_score_gemma":0.000761615,"threshold_uncertainty_score":0.039814472},"labels":[],"label_agreement":null},{"id":"W1967813253","doi":"10.1080/0308108031000122506","title":"A characterization of spectral integral variation in two places for Laplacian matrices","year":2004,"lang":"en","type":"article","venue":"Linear and Multilinear Algebra","topic":"Graph theory and applications","field":"Mathematics","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":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Eigenvalues and eigenvectors; Laplace operator; Mathematics; Algebraic connectivity; Algebraic number; Property (philosophy); Combinatorics; Characterization (materials science); Laplacian matrix; Mathematical analysis; Physics; Epistemology","score_opus":0.021314672983855275,"score_gpt":0.3189880807912712,"score_spread":0.29767340780741597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967813253","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7384149,0.00041047987,0.2122817,0.00068283407,0.00010759353,0.000041115476,0.00013240265,0.00033057018,0.047598433],"genre_scores_gemma":[0.99089676,0.000063082116,0.0057969335,0.00005795712,0.000047058493,0.000012508576,0.000041167732,0.00005443223,0.0030302645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994499,0.00008481346,0.000016177826,0.00012032566,0.0001984637,0.00013021192],"domain_scores_gemma":[0.99814594,0.0006423409,0.0003103401,0.00019175833,0.0002500349,0.00045967937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043558903,0.00041173914,0.00046071064,0.0021416794,0.00091813976,0.0019120486,0.0010009301,0.0008968252,0.0054390687],"category_scores_gemma":[0.0026915146,0.00024959492,0.00041030897,0.0011470552,0.0029602381,0.0018792178,0.0013683464,0.0008697899,0.00041166693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006722605,0.00003854504,0.0008210001,0.000028936627,0.000010313706,0.00025084263,0.00039520196,0.0066689923,0.009520181,0.97453386,0.0005701161,0.00709475],"study_design_scores_gemma":[0.000017791124,0.00005619968,0.0012210205,0.000016138927,0.00001043728,0.00043301834,0.00030225658,0.073962666,0.0033356564,0.9174614,0.0031419722,0.000041455838],"about_ca_topic_score_codex":0.0006182943,"about_ca_topic_score_gemma":0.0006161853,"teacher_disagreement_score":0.0054390687,"about_ca_system_score_codex":0.0008241306,"about_ca_system_score_gemma":0.00026826764,"threshold_uncertainty_score":0.01819551},"labels":[],"label_agreement":null},{"id":"W1967832448","doi":"10.1016/j.disc.2007.04.003","title":"Planarity of iterated line graphs","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"Simon Fraser University","funders":"","keywords":"Mathematics; Line graph; Combinatorics; Iterated function; Planarity testing; Graph; Block graph; Discrete mathematics; Line (geometry); 1-planar graph; Geometry","score_opus":0.043474325233040824,"score_gpt":0.3347128059348521,"score_spread":0.29123848070181124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967832448","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8162985,0.00060497224,0.098408945,0.0015099857,0.00008004593,0.000062481435,0.00032443766,0.000322447,0.08238819],"genre_scores_gemma":[0.9730839,0.0006285035,0.012323452,0.00020428335,0.00019927348,0.00006882426,0.00036273838,0.00011842738,0.013010618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993857,0.00013521453,0.000022896995,0.00015135627,0.00018703914,0.000117791096],"domain_scores_gemma":[0.9966625,0.0014534823,0.0007875208,0.00028671525,0.00045148487,0.00035835986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039850452,0.0005430308,0.0007524825,0.0025441526,0.0015036823,0.0033708678,0.0014603309,0.0012090235,0.0083066365],"category_scores_gemma":[0.0041683516,0.0006000812,0.0007615149,0.001574868,0.0030746346,0.0039953357,0.0018581835,0.0027509271,0.0007580012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000490259,0.000018956425,0.00056504,0.000053696527,0.000014773377,0.00011703975,0.00037994274,0.003133353,0.0017093617,0.98707217,0.00090350496,0.005983184],"study_design_scores_gemma":[0.000021734932,0.000021106436,0.00060118217,0.000011638242,0.000017534432,0.00017506938,0.00023021591,0.008228714,0.00078202336,0.9879723,0.0019233618,0.00001529191],"about_ca_topic_score_codex":0.0013181455,"about_ca_topic_score_gemma":0.001153809,"teacher_disagreement_score":0.0083066365,"about_ca_system_score_codex":0.0010293566,"about_ca_system_score_gemma":0.000373791,"threshold_uncertainty_score":0.0277884},"labels":[],"label_agreement":null},{"id":"W1968569626","doi":"10.1017/s0963548302005321","title":"The Wiener Index of Random Trees","year":2002,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Graph theory and applications","field":"Mathematics","cited_by":65,"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":"Mathematics; Wiener index; Bivariate analysis; Limit (mathematics); Limit of a function; Probabilistic logic; Index (typography); Binary number; Random variable; Applied mathematics; Statistical physics; Statistics; Mathematical analysis; Combinatorics; Computer science; Physics","score_opus":0.051646312621922104,"score_gpt":0.2780597385568273,"score_spread":0.2264134259349052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968569626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20753598,0.002881481,0.760775,0.0009666538,0.00012908946,0.00006386407,0.00025774716,0.00030724867,0.027082967],"genre_scores_gemma":[0.94628334,0.0021926595,0.039528616,0.00018350373,0.000264502,0.00015168184,0.000315493,0.00024552655,0.010834622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985043,0.0004574158,0.00007333706,0.00022492283,0.00050471764,0.00023540528],"domain_scores_gemma":[0.99293137,0.004264341,0.0008753946,0.00064737425,0.0007916326,0.00048981706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035063867,0.0006168325,0.0011480832,0.002615098,0.0010066552,0.003499311,0.0013089472,0.0012591394,0.0029368026],"category_scores_gemma":[0.023116522,0.00063215045,0.0008818498,0.002053251,0.0029484665,0.00648253,0.0018965635,0.0018586383,0.0008697622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017240916,0.00001117271,0.0006277405,0.000029263418,0.00001357575,0.00006049757,0.00011733096,0.02668284,0.0007389459,0.9663798,0.0005282673,0.0047932514],"study_design_scores_gemma":[0.000005947901,0.000017965647,0.00053354236,0.000022283699,0.000008529064,0.000069676185,0.000032124444,0.18326324,0.00033257506,0.8146525,0.0010379218,0.000023725104],"about_ca_topic_score_codex":0.0011443099,"about_ca_topic_score_gemma":0.0010113188,"teacher_disagreement_score":0.0035063867,"about_ca_system_score_codex":0.0017260925,"about_ca_system_score_gemma":0.0010904351,"threshold_uncertainty_score":0.01854378},"labels":[],"label_agreement":null},{"id":"W1969083090","doi":"10.1007/s004930070004","title":"On Cayley Graphs on the Symmetric Group Generated by Tranpositions","year":2000,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Graph theory and applications","field":"Mathematics","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 British Columbia","funders":"","keywords":"Combinatorics; Cayley graph; Mathematics; Bipartite graph; Symmetric group; Conjecture; Graph; Eigenvalues and eigenvectors; Discrete mathematics","score_opus":0.022248902024591323,"score_gpt":0.2555700609254552,"score_spread":0.23332115890086388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969083090","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.71503586,0.0018273945,0.095065065,0.0033832039,0.0010436785,0.000112378955,0.0006897238,0.00051514077,0.18232754],"genre_scores_gemma":[0.92473674,0.0021963287,0.014202118,0.00089630805,0.00082722545,0.00010178381,0.0007884589,0.00026707049,0.05598397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993973,0.00018513108,0.00002408207,0.00011250248,0.00013550409,0.00014550185],"domain_scores_gemma":[0.9979492,0.00082679914,0.00045140495,0.00022163916,0.00023409202,0.0003169307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005171016,0.0012072404,0.0008757064,0.0027274108,0.002074849,0.0031765623,0.0013973102,0.0015605399,0.014169655],"category_scores_gemma":[0.002044198,0.0006439044,0.0008553132,0.0025285906,0.0026542975,0.0049145874,0.0018483232,0.0022735535,0.002007093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041397092,0.000025529804,0.00020450613,0.000039750565,0.000008306126,0.00019027178,0.00026920333,0.0017106041,0.0012558307,0.98861605,0.0018730197,0.0057656053],"study_design_scores_gemma":[0.000014032954,0.000016023416,0.00018653432,0.000013489518,0.0000064789433,0.000106701154,0.00011780279,0.0036418196,0.00045950542,0.993226,0.0022000903,0.00001160992],"about_ca_topic_score_codex":0.0022584351,"about_ca_topic_score_gemma":0.003164106,"teacher_disagreement_score":0.014169655,"about_ca_system_score_codex":0.0013362342,"about_ca_system_score_gemma":0.00064736063,"threshold_uncertainty_score":0.047402263},"labels":[],"label_agreement":null},{"id":"W1969726110","doi":"10.1016/j.aml.2010.11.005","title":"General fractional <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>f</mml:mi></mml:math>-factor numbers of graphs","year":2010,"lang":"en","type":"article","venue":"Applied Mathematics Letters","topic":"Graph theory and applications","field":"Mathematics","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":"Thompson Rivers University","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Graph; Function (biology); Discrete mathematics","score_opus":0.017769775371557557,"score_gpt":0.25379967371518447,"score_spread":0.23602989834362692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969726110","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003768939,0.0016285839,0.14173034,0.0039798575,0.0017766639,0.00014389174,0.03792754,0.018446926,0.7905972],"genre_scores_gemma":[0.08216745,0.0045995875,0.12666468,0.0025326412,0.0017740425,0.00051316194,0.065957345,0.027219104,0.68857205],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995166,0.0000636917,0.00003782234,0.00011887653,0.00020521521,0.000057837973],"domain_scores_gemma":[0.9990907,0.00022853448,0.00005243461,0.00029109247,0.00027447398,0.00006280223],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00055690383,0.0012130643,0.0009994484,0.0028177907,0.0011975396,0.0038633249,0.0018389182,0.0010500022,0.37987733],"category_scores_gemma":[0.002439798,0.000605252,0.0011505209,0.0038714258,0.00078036083,0.006202976,0.0017733664,0.002080921,0.18145654],"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.000098965975,0.000036949048,0.00020636099,0.00037753032,0.000013186342,0.00009117886,0.00023705137,0.00095861993,0.0024476964,0.34976557,0.56922406,0.07654287],"study_design_scores_gemma":[0.000023519555,0.00001007466,0.0003486293,0.000060679336,0.0000073052975,0.00011395913,0.000053232117,0.0017377838,0.001955737,0.17617595,0.819485,0.000028151477],"about_ca_topic_score_codex":0.0045431023,"about_ca_topic_score_gemma":0.0066927024,"teacher_disagreement_score":0.37987733,"about_ca_system_score_codex":0.0023268391,"about_ca_system_score_gemma":0.0010069779,"threshold_uncertainty_score":0.8845297},"labels":[],"label_agreement":null},{"id":"W1971804470","doi":"10.4153/cmb-2014-023-5","title":"Maximizing the Index of Trees with Given Domination Number","year":2014,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Adjacency matrix; Index (typography); Combinatorics; Eigenvalues and eigenvectors; Graph; Domination analysis; Tree (set theory)","score_opus":0.01416549045514256,"score_gpt":0.2414708561069316,"score_spread":0.22730536565178902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971804470","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85339177,0.00039410032,0.12572455,0.00037447474,0.000027039208,0.000033605367,0.00028998632,0.00022094675,0.019543435],"genre_scores_gemma":[0.98078465,0.0001724694,0.016735895,0.000039648898,0.000030780684,0.000023033823,0.0001232401,0.00006521058,0.0020251053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963284,0.00009032375,0.000013866029,0.000071494505,0.00008655217,0.00010503701],"domain_scores_gemma":[0.99779093,0.0010578047,0.00030350863,0.0001499668,0.00028095616,0.00041676994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057733105,0.00027967157,0.0006402834,0.0010368021,0.00064030354,0.0014760809,0.0007279755,0.0006234679,0.0024662027],"category_scores_gemma":[0.004734506,0.00020299316,0.00020378418,0.00081958954,0.00071768597,0.0014106277,0.0007465549,0.0004092837,0.0002717434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006665993,0.0002709667,0.013295985,0.00048258647,0.00010650069,0.00095564517,0.0007162966,0.18478025,0.11894161,0.6117956,0.008421412,0.05956657],"study_design_scores_gemma":[0.000035536406,0.00014312817,0.005649937,0.000050737654,0.000034726283,0.0008739789,0.00034280596,0.5237257,0.015988762,0.44959116,0.0035150512,0.00004843051],"about_ca_topic_score_codex":0.00043122872,"about_ca_topic_score_gemma":0.00083541183,"teacher_disagreement_score":0.0024662027,"about_ca_system_score_codex":0.0008278796,"about_ca_system_score_gemma":0.00038694273,"threshold_uncertainty_score":0.008250296},"labels":[],"label_agreement":null},{"id":"W1973195334","doi":"10.1016/j.disc.2013.07.016","title":"The maximum Perron roots of digraphs with some given parameters","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":14,"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; Digraph; Combinatorics; Root (linguistics); Arc (geometry); Discrete mathematics; Geometry","score_opus":0.020782416247532434,"score_gpt":0.2620764638242689,"score_spread":0.24129404757673648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973195334","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5942365,0.0022574111,0.22249772,0.00430966,0.00041233902,0.00019370225,0.002243598,0.0009276964,0.1729213],"genre_scores_gemma":[0.91879493,0.001061926,0.04072107,0.00052606466,0.000264069,0.00025415205,0.00072421,0.00038186123,0.037271664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991019,0.0002967938,0.000041664884,0.00022211259,0.0001764373,0.00016119848],"domain_scores_gemma":[0.99585766,0.0024852064,0.00048491213,0.00032189835,0.00032251014,0.0005277323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093887834,0.00095891923,0.0014714783,0.0022514532,0.002016269,0.0035246927,0.0020310953,0.002587978,0.01414908],"category_scores_gemma":[0.00992841,0.0009125476,0.00080155145,0.0020217106,0.0021498573,0.0051364866,0.0018094642,0.0029875748,0.002239442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021844344,0.00005166396,0.0004695588,0.0002884812,0.000033177224,0.00014265803,0.00052509486,0.007259039,0.0031645221,0.9678093,0.0053155823,0.014722333],"study_design_scores_gemma":[0.000053686606,0.000030944208,0.000480964,0.00005542034,0.000025944142,0.00016821949,0.00020355337,0.014516122,0.0011235352,0.9788138,0.004498592,0.000029080098],"about_ca_topic_score_codex":0.00063586753,"about_ca_topic_score_gemma":0.0011305404,"teacher_disagreement_score":0.01414908,"about_ca_system_score_codex":0.0018252338,"about_ca_system_score_gemma":0.00080360146,"threshold_uncertainty_score":0.04733336},"labels":[],"label_agreement":null},{"id":"W1974452921","doi":"10.1137/120891265","title":"Lower Bounds for the Isoperimetric Numbers of Random Regular Graphs","year":2014,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","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 British Columbia","funders":"","keywords":"Isoperimetric inequality; Combinatorics; Mathematics; Upper and lower bounds; Vertex (graph theory); Graph; Discrete mathematics; Mathematical analysis","score_opus":0.026484326963304695,"score_gpt":0.3057508159746372,"score_spread":0.2792664890113325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974452921","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15926851,0.0087019885,0.7560831,0.007396044,0.00045481158,0.00030072877,0.002384106,0.0017728894,0.06363782],"genre_scores_gemma":[0.7897412,0.0070984946,0.17811838,0.0022203855,0.0016018106,0.001388495,0.0029032344,0.0014626244,0.01546547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9911376,0.0028913713,0.0003563081,0.002218214,0.0023509518,0.0010454993],"domain_scores_gemma":[0.91593456,0.0656515,0.004246933,0.007575786,0.0035295011,0.0030616447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00745567,0.003345337,0.0026097542,0.005807304,0.0023966578,0.004631918,0.0065850853,0.0032282192,0.008183946],"category_scores_gemma":[0.082646646,0.0018668445,0.0027871935,0.0035712523,0.0060834847,0.01355808,0.0067651677,0.010346866,0.0017529556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007939625,0.00032119115,0.00481527,0.00093815883,0.00027414924,0.00039942554,0.00059749867,0.19520952,0.013507081,0.7161911,0.012437976,0.054514747],"study_design_scores_gemma":[0.00005366463,0.0001426952,0.00230656,0.0001780814,0.00009104673,0.0005861253,0.00011348176,0.5191662,0.006188976,0.46426353,0.0067910757,0.000118564116],"about_ca_topic_score_codex":0.0013490263,"about_ca_topic_score_gemma":0.001290123,"teacher_disagreement_score":0.008183946,"about_ca_system_score_codex":0.0059616817,"about_ca_system_score_gemma":0.0014875521,"threshold_uncertainty_score":0.04325527},"labels":[],"label_agreement":null},{"id":"W1976871642","doi":"10.1016/j.laa.2006.09.020","title":"Alexandrov’s inequality and conjectures on some Toeplitz matrices","year":2006,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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":"McGill University","funders":"University of New South Wales; University of Victoria","keywords":"Toeplitz matrix; Mathematics; Unit circle; Conjecture; Combinatorics; Norm (philosophy); Exponential function; Matrix (chemical analysis); Pure mathematics; Mathematical analysis","score_opus":0.024515665233518023,"score_gpt":0.2978414858074609,"score_spread":0.2733258205739429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976871642","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32520258,0.0036397085,0.28886274,0.02343899,0.0022278882,0.00014329779,0.0011970495,0.0004570161,0.35483074],"genre_scores_gemma":[0.9289855,0.002074201,0.0264312,0.002237,0.0021458422,0.00018122197,0.0006866472,0.00019904706,0.03705933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981704,0.00047587347,0.0000991735,0.00039537114,0.0005350108,0.00032421283],"domain_scores_gemma":[0.9940024,0.0036590777,0.00044094765,0.0007108846,0.0007170476,0.00046975064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021433155,0.001519234,0.0019280985,0.0031554804,0.0036133635,0.0039308453,0.0027894538,0.0032945888,0.016784994],"category_scores_gemma":[0.010957898,0.00090425153,0.0013824622,0.0038504712,0.0052240565,0.010845414,0.003185895,0.0077044275,0.0024138775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055846416,0.000031086973,0.00014788199,0.000052634143,0.0000105705585,0.000079999656,0.00017311743,0.0011027089,0.0005328056,0.9906217,0.0032442515,0.003947531],"study_design_scores_gemma":[0.000008692479,0.000006897072,0.00009048258,0.000008589211,0.0000042528236,0.000039664254,0.00003545103,0.0032504345,0.0002514827,0.99524224,0.0010514363,0.000010484633],"about_ca_topic_score_codex":0.0017238903,"about_ca_topic_score_gemma":0.0014301676,"teacher_disagreement_score":0.016784994,"about_ca_system_score_codex":0.0016863077,"about_ca_system_score_gemma":0.0009726236,"threshold_uncertainty_score":0.05615139},"labels":[],"label_agreement":null},{"id":"W1977159155","doi":"10.1016/j.laa.2010.01.037","title":"Characteristic polynomials of nonnegative real square matrices and generalized clique polynomials","year":2010,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Square (algebra); Orthogonal polynomials; Clique; Combinatorics; Classical orthogonal polynomials; Difference polynomials; Wilson polynomials; Pure mathematics; Geometry","score_opus":0.020802096253234294,"score_gpt":0.309162723927635,"score_spread":0.2883606276744007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977159155","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4606291,0.0031680467,0.45302776,0.0032871612,0.00063989224,0.000083492065,0.0006048999,0.00027302024,0.078286566],"genre_scores_gemma":[0.9601574,0.0016964794,0.020670488,0.0003738446,0.00073057,0.00007624186,0.00018987864,0.000077869656,0.016027248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994307,0.00016006199,0.000015439933,0.00014268258,0.00014260273,0.0001083672],"domain_scores_gemma":[0.99720603,0.0014824864,0.0005271573,0.00017225473,0.0003032879,0.00030873044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006944219,0.00072181725,0.00071742345,0.0018639952,0.00081863964,0.002122947,0.0008928602,0.00077134394,0.0057056313],"category_scores_gemma":[0.0052709435,0.0004175191,0.00058896426,0.002647179,0.002899778,0.003489168,0.0011373985,0.0021644775,0.0005969054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033496824,0.000016097816,0.0002231473,0.00004662889,0.00000711206,0.000054271357,0.00017645503,0.0033849704,0.001086839,0.98664343,0.001264748,0.007062932],"study_design_scores_gemma":[0.000011633595,0.000011474431,0.00028768185,0.000008781364,0.0000055393934,0.00010057256,0.00005506167,0.013226679,0.00028775432,0.9842606,0.001727048,0.000017188191],"about_ca_topic_score_codex":0.0013628451,"about_ca_topic_score_gemma":0.0018307039,"teacher_disagreement_score":0.0057056313,"about_ca_system_score_codex":0.0011955064,"about_ca_system_score_gemma":0.00082701346,"threshold_uncertainty_score":0.019087195},"labels":[],"label_agreement":null},{"id":"W1977467103","doi":"10.1016/j.disc.2015.04.007","title":"Linearized Wenger graphs","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":17,"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; Bipartite graph; Combinatorics; Discrete mathematics; Class (philosophy); Indifference graph; Graph; Computer science","score_opus":0.0922781901024348,"score_gpt":0.34059069890046945,"score_spread":0.24831250879803463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977467103","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37255943,0.0013735204,0.1683426,0.005357315,0.0008457148,0.00011478025,0.00093040697,0.0015570957,0.44891924],"genre_scores_gemma":[0.8092683,0.0007636283,0.008710735,0.0011315163,0.00037207452,0.00007575924,0.0006154809,0.0003981747,0.17866443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99980015,0.000042650357,0.0000062128474,0.000040546714,0.000057292855,0.00005320304],"domain_scores_gemma":[0.99964213,0.000068556,0.00007635484,0.000058735044,0.00006967134,0.0000844839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019727586,0.0005783083,0.0004842793,0.0020301205,0.0011286164,0.0015135081,0.0006030526,0.0009962446,0.020662405],"category_scores_gemma":[0.0010391576,0.00031936858,0.0004195605,0.0008529262,0.0010516609,0.0025667679,0.0016459745,0.0021750634,0.0028996347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026368554,0.000015760676,0.000113382644,0.000021128688,0.000007721956,0.000062765735,0.00008698814,0.0019514463,0.0017497748,0.98715186,0.0025970568,0.006215838],"study_design_scores_gemma":[0.000011630036,0.000017533637,0.00049531425,0.0000105703,0.00000813653,0.0001725964,0.00016471463,0.009691157,0.0018851705,0.97944885,0.008075106,0.00001927141],"about_ca_topic_score_codex":0.0009079813,"about_ca_topic_score_gemma":0.0010098538,"teacher_disagreement_score":0.020662405,"about_ca_system_score_codex":0.00080545974,"about_ca_system_score_gemma":0.0003384781,"threshold_uncertainty_score":0.06912261},"labels":[],"label_agreement":null},{"id":"W1978314202","doi":"10.5539/apr.v6n5p100","title":"Regular Resistor Lattice Networks in Two Dimensions (Archimedean Lattices)","year":2014,"lang":"en","type":"article","venue":"Applied Physics Research","topic":"Graph theory and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Resistor; Laplacian matrix; Lattice (music); Ohm; Laplace operator; Fourier transform; Vertex (graph theory); Physics; Resistance distance; Topology (electrical circuits); Condensed matter physics; Mathematics; Discrete mathematics; Combinatorics; Quantum mechanics; Graph; Voltage","score_opus":0.09607725224610665,"score_gpt":0.40885191984920893,"score_spread":0.3127746676031023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978314202","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85285026,0.000673771,0.11222035,0.0004730444,0.00010849356,0.000031013453,0.00012839245,0.00023453077,0.03328012],"genre_scores_gemma":[0.9764015,0.0001761034,0.019815896,0.0000510058,0.000018647408,0.0000280581,0.000047241625,0.000020737854,0.0034408881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99983704,0.00005202443,0.000006447325,0.000033344757,0.000041477135,0.000029596102],"domain_scores_gemma":[0.9996666,0.00016116536,0.00006419971,0.000042523392,0.00003575683,0.000029740973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002476469,0.00022602045,0.00033070368,0.0004304914,0.0003866273,0.0008657579,0.0005503849,0.00072867447,0.0024571046],"category_scores_gemma":[0.0010672834,0.0002074819,0.00024741187,0.00047559675,0.00078085845,0.0012823122,0.00033902563,0.0004334703,0.00025667928],"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.00017916544,0.000089715955,0.001050735,0.00015448102,0.000037012844,0.00048776605,0.0001542202,0.5095372,0.023463057,0.45631713,0.0009650467,0.007564365],"study_design_scores_gemma":[0.000047586458,0.000077676275,0.000637399,0.000010199653,0.000011703844,0.00020750903,0.000087351866,0.8807058,0.0033185508,0.11287646,0.0019963526,0.000023445145],"about_ca_topic_score_codex":0.0008286245,"about_ca_topic_score_gemma":0.0007205877,"teacher_disagreement_score":0.0024571046,"about_ca_system_score_codex":0.0003937824,"about_ca_system_score_gemma":0.00019368224,"threshold_uncertainty_score":0.008219838},"labels":[],"label_agreement":null},{"id":"W1979958117","doi":"10.1016/j.laa.2008.04.013","title":"The inertia of unicyclic graphs and the implications for closed-shells","year":2008,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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 Victoria","funders":"","keywords":"Adjacency matrix; Mathematics; Combinatorics; Inertia; Eigenvalues and eigenvectors; Discrete mathematics; Graph; Line graph; Physics","score_opus":0.03739481592172517,"score_gpt":0.3006971972496577,"score_spread":0.26330238132793254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979958117","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51016694,0.0062660156,0.2049417,0.011488091,0.0012696643,0.00009578911,0.00066423864,0.0004385468,0.264669],"genre_scores_gemma":[0.96590847,0.0018863814,0.011162385,0.00082448026,0.0012499007,0.000070247,0.00024552867,0.00010752809,0.018545076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999297,0.00017577856,0.000042089763,0.0001757774,0.00017201512,0.00013728633],"domain_scores_gemma":[0.9946173,0.003047449,0.0007157187,0.0005053906,0.0004113362,0.0007029339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009447136,0.0005083135,0.0009766364,0.002459076,0.002412415,0.0033376524,0.0015401827,0.0016518828,0.011147693],"category_scores_gemma":[0.0057384977,0.00053233915,0.0008526743,0.0017770487,0.0072269766,0.006705597,0.002490893,0.003090413,0.00071200443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013322351,0.000007716771,0.00007873471,0.000023938579,0.0000018327888,0.000025948553,0.00013404482,0.00035433492,0.00017349534,0.99647313,0.00078242447,0.0019310437],"study_design_scores_gemma":[0.000009469529,0.000006726586,0.00013803644,0.000009442501,0.0000028707352,0.000038206774,0.000089030174,0.0018928413,0.00010495852,0.9961737,0.0015269045,0.000007753661],"about_ca_topic_score_codex":0.0016521536,"about_ca_topic_score_gemma":0.001395002,"teacher_disagreement_score":0.011147693,"about_ca_system_score_codex":0.0011936062,"about_ca_system_score_gemma":0.0005965553,"threshold_uncertainty_score":0.03729278},"labels":[],"label_agreement":null},{"id":"W1980134397","doi":"10.1016/j.jctb.2010.07.006","title":"Spectral radius of finite and infinite planar graphs and of graphs of bounded genus","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":31,"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":"Spectral radius; Combinatorics; Mathematics; Planar graph; Bounded function; Upper and lower bounds; Degree (music); Order (exchange); Discrete mathematics; Graph; Mathematical analysis; Physics; Eigenvalues and eigenvectors","score_opus":0.013347340318574308,"score_gpt":0.2566479518093279,"score_spread":0.2433006114907536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980134397","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9354604,0.0022164737,0.033683468,0.0011937679,0.00006604597,0.000024524184,0.0003915414,0.0003075252,0.026656324],"genre_scores_gemma":[0.993566,0.0006158686,0.0030150164,0.00006930501,0.00012823542,0.00003261922,0.00025239438,0.000111795714,0.0022087244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989581,0.00034620802,0.00004829189,0.00021031447,0.00024213556,0.00019485869],"domain_scores_gemma":[0.98669064,0.0083095115,0.002024347,0.00053787715,0.00059592136,0.0018416997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014699943,0.0009758064,0.001505983,0.006176676,0.0016937563,0.0039443444,0.002670376,0.0019133423,0.0050541013],"category_scores_gemma":[0.016478319,0.0008676928,0.0006838448,0.0019803613,0.0048207804,0.00530185,0.0027902857,0.0013553919,0.0007474754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031547382,0.000060563812,0.0029146955,0.00014635958,0.00002674991,0.00018208007,0.00086977077,0.016881961,0.003941829,0.9665776,0.0018632502,0.0062196036],"study_design_scores_gemma":[0.000044392924,0.00004457624,0.0046762014,0.00007667309,0.000037856516,0.00054152054,0.00085898326,0.0831829,0.0020637207,0.906639,0.0017830234,0.000051215862],"about_ca_topic_score_codex":0.0011895603,"about_ca_topic_score_gemma":0.0010728462,"teacher_disagreement_score":0.006176676,"about_ca_system_score_codex":0.0013459258,"about_ca_system_score_gemma":0.0005245966,"threshold_uncertainty_score":0.016907632},"labels":[],"label_agreement":null},{"id":"W1980573399","doi":"10.1016/j.ejc.2011.03.005","title":"Limits of kernel operators and the spectral regularity lemma","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","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 Toronto","funders":"","keywords":"Mathematics; Lemma (botany); Eigenvalues and eigenvectors; Invariant (physics); Combinatorics; Spectral theory; Spectral graph theory; Graph; Discrete mathematics; Pure mathematics; Hilbert space; Voltage graph; Line graph","score_opus":0.06104600602389194,"score_gpt":0.2611345016580148,"score_spread":0.20008849563412284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980573399","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53110546,0.0027293947,0.33058247,0.00490345,0.0004525154,0.00007363618,0.00032949183,0.0004349516,0.12938863],"genre_scores_gemma":[0.95947164,0.0011125538,0.018073063,0.0005397212,0.00054775993,0.00009705286,0.0001999081,0.000223197,0.019734988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989361,0.0003044641,0.00006885447,0.00020799252,0.00030331756,0.00017924585],"domain_scores_gemma":[0.9945738,0.0030701857,0.00042652222,0.0004189574,0.00083545956,0.00067512173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018909735,0.000543891,0.0011388307,0.002589128,0.0017935674,0.0027902832,0.0015601328,0.0013177138,0.005497874],"category_scores_gemma":[0.008370473,0.00062937575,0.0011438646,0.0011398346,0.004361643,0.009143427,0.005352354,0.003429889,0.0007053763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029071925,0.000025874719,0.0002362705,0.000027667229,0.000008089799,0.00009344826,0.00019560705,0.00037893103,0.0009084362,0.9953667,0.000453582,0.0022761882],"study_design_scores_gemma":[0.000013553445,0.000014293736,0.00026933907,0.000008706793,0.000008137206,0.00015042388,0.00009653496,0.00579183,0.0005893103,0.99171865,0.001326961,0.000012362484],"about_ca_topic_score_codex":0.000793565,"about_ca_topic_score_gemma":0.00047880432,"teacher_disagreement_score":0.005497874,"about_ca_system_score_codex":0.00086739974,"about_ca_system_score_gemma":0.0005972329,"threshold_uncertainty_score":0.018392205},"labels":[],"label_agreement":null},{"id":"W1981970597","doi":"10.1016/j.disc.2006.03.054","title":"Sums of powers of the degrees of a graph","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Combinatorics; Sums of powers; Graph; Discrete mathematics","score_opus":0.02136883443742171,"score_gpt":0.2740425652291751,"score_spread":0.25267373079175337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981970597","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4236047,0.0028705418,0.4185882,0.002183718,0.0015246421,0.0001075728,0.0010334759,0.0006432756,0.14944392],"genre_scores_gemma":[0.90994495,0.0019696173,0.04757557,0.00040947224,0.0015324859,0.00016228172,0.000592759,0.00046432615,0.037348397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826235,0.00045802185,0.0001276575,0.00035334387,0.0005774306,0.00022125796],"domain_scores_gemma":[0.9947286,0.002983747,0.00045569724,0.00064234633,0.000540354,0.0006492348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001224922,0.0009824792,0.0012256304,0.003428835,0.0011521489,0.0034047232,0.0015553338,0.00071530946,0.00962353],"category_scores_gemma":[0.0072597596,0.00066399976,0.000980457,0.0016134306,0.0028801758,0.0074874344,0.0022982135,0.0022075546,0.0016703383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008567225,0.00003066937,0.0004948265,0.00011186648,0.000049355192,0.00019613623,0.00032725383,0.0020090756,0.0028678542,0.97280234,0.0022728224,0.018752206],"study_design_scores_gemma":[0.00000574621,0.000014752584,0.00027785427,0.000022196851,0.000023943934,0.0002756549,0.00006800273,0.005367923,0.0010398887,0.98806494,0.004825727,0.000013408754],"about_ca_topic_score_codex":0.00019608953,"about_ca_topic_score_gemma":0.00035890492,"teacher_disagreement_score":0.00962353,"about_ca_system_score_codex":0.0005595987,"about_ca_system_score_gemma":0.00030839274,"threshold_uncertainty_score":0.0321939},"labels":[],"label_agreement":null},{"id":"W1982352654","doi":"10.1016/j.laa.2004.09.014","title":"On the difference between the maximum multiplicity and path cover number for tree-like graphs","year":2004,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":38,"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; Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Multiplicity (mathematics); Indifference graph; Disjoint sets; Induced path; Vertex cover; Discrete mathematics; Chordal graph; Longest path problem; Graph","score_opus":0.03281664505513261,"score_gpt":0.28845688718716583,"score_spread":0.25564024213203324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982352654","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68535095,0.009413497,0.22239283,0.009610647,0.0011625795,0.00006442464,0.0007033041,0.0004683585,0.07083343],"genre_scores_gemma":[0.9633545,0.0026075926,0.026326085,0.00059153105,0.0012416021,0.00009160702,0.00032034883,0.00019219455,0.00527454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746895,0.0010292681,0.00012855024,0.0005737374,0.0005208952,0.00027857564],"domain_scores_gemma":[0.951307,0.03993811,0.0032956742,0.0019087183,0.0013145723,0.002235953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043975567,0.0009739951,0.0018825575,0.0046352325,0.001894202,0.0037386385,0.0035683059,0.0031980264,0.0065525216],"category_scores_gemma":[0.032883238,0.0009492655,0.0009159894,0.0037581676,0.0060760765,0.013564823,0.0032267035,0.0044361483,0.00073547784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006133103,0.00012111306,0.003417068,0.00036506835,0.00007119258,0.00021929234,0.0005688426,0.019846385,0.004121549,0.9438955,0.0048276773,0.021932956],"study_design_scores_gemma":[0.000042824104,0.000077201104,0.0016165626,0.0000677476,0.000054267795,0.00038909906,0.00017219661,0.061500784,0.0013593505,0.93252873,0.0021292006,0.00006206526],"about_ca_topic_score_codex":0.0006447103,"about_ca_topic_score_gemma":0.0007762371,"teacher_disagreement_score":0.0065525216,"about_ca_system_score_codex":0.0020412605,"about_ca_system_score_gemma":0.0007976293,"threshold_uncertainty_score":0.023256779},"labels":[],"label_agreement":null},{"id":"W1983282841","doi":"10.7151/dmgt.1154","title":"Heavy cycles in weighted graphs","year":2002,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Graph theory and applications","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Social Sciences and Humanities Research Council; Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","funders":"University of Twente","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.041062757443521954,"score_gpt":0.2893674404735425,"score_spread":0.24830468303002057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983282841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2702697,0.0031752936,0.6633849,0.0012848276,0.00029064933,0.00030923984,0.00061217614,0.0005553113,0.0601179],"genre_scores_gemma":[0.78807414,0.0031822585,0.18020868,0.0009011326,0.00046554027,0.000547265,0.0008597166,0.0003268841,0.025434379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990301,0.00022302821,0.000060995724,0.0002711318,0.00023066376,0.00018405031],"domain_scores_gemma":[0.9979601,0.0009356374,0.00035269713,0.00030364146,0.00024275889,0.00020513436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008008769,0.0007696963,0.00058410654,0.002577875,0.0013432943,0.0021034079,0.0010415373,0.00094416115,0.005424097],"category_scores_gemma":[0.0047687953,0.00064792414,0.00079915894,0.0024992288,0.0022116126,0.0051123416,0.0022342466,0.0015123276,0.00080621464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004439616,0.000017280376,0.00042443647,0.000097860975,0.00001930591,0.00012150918,0.00031777183,0.0048017665,0.002040731,0.96917546,0.0019141582,0.021025164],"study_design_scores_gemma":[0.000011775232,0.000016669079,0.00019170163,0.000021505926,0.000014082843,0.000107353095,0.00006891059,0.012000021,0.00079548155,0.97607887,0.010683616,0.0000100200305],"about_ca_topic_score_codex":0.0016312134,"about_ca_topic_score_gemma":0.0016873403,"teacher_disagreement_score":0.005424097,"about_ca_system_score_codex":0.0013263437,"about_ca_system_score_gemma":0.0004209364,"threshold_uncertainty_score":0.018145442},"labels":[],"label_agreement":null},{"id":"W1983284696","doi":"10.1145/2667522.2667544","title":"On the impact of subgraph insertion or removal on Moore-Penrose Laplacian and resistance distance","year":2014,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Graph theory and applications","field":"Mathematics","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 Toronto","funders":"","keywords":"Laplacian matrix; Resistance distance; Mathematics; Robustness (evolution); Topology (electrical circuits); Inverse; Graph; Network topology; Induced subgraph isomorphism problem; Computer science; Combinatorics; Line graph; Voltage graph; Computer network; Graph power; Gene","score_opus":0.10104698285778564,"score_gpt":0.3870009095507249,"score_spread":0.2859539266929393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983284696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30141628,0.012039458,0.64375913,0.003465478,0.00034451613,0.00013761345,0.00029762258,0.0005163963,0.038023554],"genre_scores_gemma":[0.9430799,0.004253859,0.049161553,0.0002217913,0.00018971613,0.000062171566,0.00016947532,0.00011002568,0.0027514135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99665076,0.001514981,0.00011742226,0.00051511015,0.00089838525,0.000303368],"domain_scores_gemma":[0.94307446,0.04686937,0.0031530673,0.0029663465,0.003183978,0.00075286266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038362702,0.0010737021,0.00095485087,0.0018578582,0.0007323243,0.0014468437,0.0013611173,0.0013817422,0.0021381788],"category_scores_gemma":[0.042240035,0.0003973252,0.00063335896,0.0016972182,0.002452363,0.0057335347,0.0015876037,0.0016009193,0.000410931],"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.0002762003,0.00016990237,0.0052235764,0.00048837153,0.00016799456,0.0004144437,0.00034201212,0.7258453,0.012046982,0.1478163,0.0028055224,0.10440335],"study_design_scores_gemma":[0.000019014928,0.0005836276,0.003433014,0.000091620925,0.000089352354,0.00059550494,0.00026142102,0.87223285,0.009320529,0.11018813,0.0031001037,0.00008484734],"about_ca_topic_score_codex":0.0022957504,"about_ca_topic_score_gemma":0.0019072335,"teacher_disagreement_score":0.0038362702,"about_ca_system_score_codex":0.0014015784,"about_ca_system_score_gemma":0.0006930769,"threshold_uncertainty_score":0.020288408},"labels":[],"label_agreement":null},{"id":"W1983327435","doi":"10.4153/cmb-2008-007-9","title":"A Note on Integer Symmetric Matrices and Mahler's Measure","year":2008,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Graph theory and applications","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Discriminant; Integer (computer science); Conjecture; Measure (data warehouse); Combinatorics; Upper and lower bounds; Polynomial; Matrix (chemical analysis); Pure mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.03435182739881882,"score_gpt":0.25892287378931117,"score_spread":0.22457104639049236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983327435","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46664393,0.015289888,0.22140335,0.017445117,0.003013303,0.00004614132,0.00074435223,0.0010211465,0.27439272],"genre_scores_gemma":[0.9721513,0.0016419262,0.01631985,0.0007470782,0.0019153857,0.000029229215,0.00018390008,0.00014346103,0.006867841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986714,0.00021493205,0.000053317704,0.0002616053,0.00059003284,0.0002087367],"domain_scores_gemma":[0.99139845,0.0060988143,0.00056482863,0.0006841013,0.00067829614,0.0005756185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015544262,0.00078271714,0.0010590819,0.004461519,0.0012016578,0.0027506996,0.0019523435,0.0012637398,0.00749885],"category_scores_gemma":[0.011097952,0.0002759021,0.00053067645,0.0018992536,0.003599322,0.0039411667,0.0022216442,0.0037519436,0.001228236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006557577,0.000020611003,0.00069848495,0.00007209937,0.000011352536,0.00010711838,0.00013225651,0.0023551127,0.0025761276,0.9777194,0.003552377,0.012689357],"study_design_scores_gemma":[0.0000097549155,0.00004641316,0.0007720749,0.000033285494,0.0000083709365,0.00019469371,0.000048712944,0.010737943,0.0018915919,0.9804167,0.005809873,0.000030565232],"about_ca_topic_score_codex":0.00075309904,"about_ca_topic_score_gemma":0.0005872393,"teacher_disagreement_score":0.00749885,"about_ca_system_score_codex":0.0015755818,"about_ca_system_score_gemma":0.0003485087,"threshold_uncertainty_score":0.025086164},"labels":[],"label_agreement":null},{"id":"W1986045283","doi":"10.1142/s0129626409000031","title":"A short note on the surface area of star graphs","year":2009,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Graph theory and applications","field":"Mathematics","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":"Brock University","funders":"","keywords":"Star (game theory); Surface (topology); Mathematics; Computer science; Function (biology); Combinatorics; Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.048625659628929285,"score_gpt":0.3028729877952868,"score_spread":0.25424732816635753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986045283","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062394604,0.03286927,0.6469955,0.020653112,0.04717878,0.000083955936,0.00086866395,0.0020011324,0.18695499],"genre_scores_gemma":[0.6122507,0.03181632,0.17209274,0.007608309,0.06427248,0.0001989639,0.0010016811,0.003520649,0.10723817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995797,0.00008224215,0.000031571963,0.000103317805,0.00015881415,0.00004425205],"domain_scores_gemma":[0.99890983,0.00064387766,0.000059958675,0.00011275871,0.00018740473,0.00008605704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077150424,0.0010743252,0.00096181245,0.0018000758,0.0011705311,0.0017474339,0.0013213187,0.0011787994,0.0073049427],"category_scores_gemma":[0.002706014,0.0003986649,0.0011900681,0.0016437209,0.0015760642,0.0048956415,0.0015673678,0.0034234424,0.00284503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042495354,0.000031164003,0.00033898867,0.00026552202,0.00002984742,0.00056171336,0.00019904136,0.0035219858,0.0070027923,0.8846226,0.04096535,0.0624184],"study_design_scores_gemma":[0.000007379183,0.00006688242,0.00047386458,0.000042492422,0.00002196518,0.000507345,0.00005002106,0.0117727155,0.0025501316,0.9086248,0.07584305,0.000039372444],"about_ca_topic_score_codex":0.0005064539,"about_ca_topic_score_gemma":0.00045807794,"teacher_disagreement_score":0.0073049427,"about_ca_system_score_codex":0.0005937076,"about_ca_system_score_gemma":0.00024930786,"threshold_uncertainty_score":0.024437428},"labels":[],"label_agreement":null},{"id":"W1986224428","doi":"10.1016/j.jctb.2008.06.008","title":"Matchings in regular graphs from eigenvalues","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":112,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Toronto","funders":"American Institute of Mathematics","keywords":"Eigenvalues and eigenvectors; Combinatorics; Matching (statistics); Mathematics; Upper and lower bounds; Order (exchange); Graph; Discrete mathematics; Statistics; Mathematical analysis; Physics; Business","score_opus":0.025894199122439208,"score_gpt":0.27082854822885416,"score_spread":0.24493434910641496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986224428","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64342934,0.0011632723,0.24027659,0.0033701272,0.0009925042,0.00023519216,0.0008776558,0.0013569619,0.10829839],"genre_scores_gemma":[0.93962073,0.00058138114,0.034032043,0.00054387265,0.00067665713,0.00011920324,0.00047119046,0.0003996502,0.023555202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916744,0.00017743163,0.000055981855,0.00019606225,0.000273649,0.00012945768],"domain_scores_gemma":[0.9967693,0.0014930861,0.00052986876,0.00040329402,0.00038504385,0.000419552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083473907,0.00066160096,0.0012191533,0.0042548617,0.0018550334,0.003903618,0.0016017769,0.0022407402,0.010389824],"category_scores_gemma":[0.007033708,0.00079398404,0.0010467258,0.0020871488,0.0023383275,0.0057235234,0.0023878645,0.00249248,0.0015068272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056834113,0.000046704572,0.0003376839,0.00006006842,0.00000902548,0.00013866338,0.00038948082,0.0014587415,0.001478634,0.9859206,0.0021275885,0.007975969],"study_design_scores_gemma":[0.000011270482,0.000006893201,0.0001534537,0.000012531209,0.0000061143105,0.00010244296,0.00008854832,0.0056913896,0.00030465832,0.9926709,0.0009426622,0.000009242861],"about_ca_topic_score_codex":0.00070465775,"about_ca_topic_score_gemma":0.0008851135,"teacher_disagreement_score":0.010389824,"about_ca_system_score_codex":0.001000147,"about_ca_system_score_gemma":0.0005041341,"threshold_uncertainty_score":0.034757435},"labels":[],"label_agreement":null},{"id":"W1988353915","doi":"10.1016/j.laa.2004.06.019","title":"Computation of minimal rank and path cover number for certain graphs","year":2004,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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":"University of Regina","funders":"","keywords":"Combinatorics; Mathematics; Rank (graph theory); Cover (algebra); Disjoint sets; Vertex (graph theory); Path (computing); Vertex cover; Discrete mathematics; Graph; Computer science","score_opus":0.023970680203515036,"score_gpt":0.3067599322323091,"score_spread":0.282789252028794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988353915","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89013547,0.00019133562,0.095661975,0.00038480255,0.00002117354,0.000036861016,0.0011542289,0.0005511196,0.011862915],"genre_scores_gemma":[0.96751195,0.00008357806,0.02866595,0.00002440595,0.000046608966,0.000022704719,0.0010889949,0.00007833453,0.0024774869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996369,0.000057978643,0.000014904752,0.00010384282,0.0001069608,0.00007939234],"domain_scores_gemma":[0.9977308,0.0012685797,0.0003168928,0.00022220626,0.00020384666,0.00025774853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041975713,0.00041587517,0.0006576048,0.0020325417,0.0006976494,0.0016817285,0.00093916594,0.0005918626,0.0058663725],"category_scores_gemma":[0.003762571,0.00023162259,0.0004582738,0.00139627,0.0010774081,0.002654665,0.00061686896,0.0007453709,0.00044706714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012107859,0.0003908416,0.019621342,0.0006635844,0.000111462694,0.00067556725,0.000928421,0.08537611,0.035210125,0.7452415,0.009656864,0.10091343],"study_design_scores_gemma":[0.00007801652,0.00019721444,0.007940371,0.00003654877,0.00008069264,0.0007001331,0.00041222887,0.32034054,0.023601739,0.6424918,0.0040441994,0.00007648107],"about_ca_topic_score_codex":0.0008776627,"about_ca_topic_score_gemma":0.0016301972,"teacher_disagreement_score":0.0058663725,"about_ca_system_score_codex":0.00086613616,"about_ca_system_score_gemma":0.0006372526,"threshold_uncertainty_score":0.019625008},"labels":[],"label_agreement":null},{"id":"W1989633733","doi":"10.1016/j.ejc.2010.04.001","title":"On a conjecture about the Szeged index","year":2010,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":68,"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; Conjecture; Bipartite graph; Edge-transitive graph; Graph; Graph power; Discrete mathematics; Line graph","score_opus":0.020104109396715357,"score_gpt":0.2738195751573895,"score_spread":0.25371546576067416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989633733","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46881333,0.0039948495,0.108895645,0.07138227,0.0050372863,0.000103499005,0.0016961003,0.0010331193,0.33904392],"genre_scores_gemma":[0.951427,0.0015672762,0.0142263835,0.0047002058,0.0038607642,0.00014048336,0.001105509,0.00033170852,0.022640646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975261,0.0005474826,0.00015228335,0.00074571726,0.0005539462,0.0004744655],"domain_scores_gemma":[0.988091,0.007695714,0.00092474686,0.00143913,0.0008468584,0.001002539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036367571,0.0010185756,0.002802122,0.0033276174,0.004787707,0.007983197,0.003229719,0.0048055956,0.015889486],"category_scores_gemma":[0.017832913,0.0008325149,0.001966668,0.004279269,0.011920211,0.019161182,0.0062680785,0.008909581,0.0021173481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010860883,0.000027106618,0.00039316367,0.00005297878,0.0000099800745,0.00005948277,0.00030467886,0.00058475026,0.00027655423,0.9905759,0.0043212757,0.0032853861],"study_design_scores_gemma":[0.000024345805,0.000010198644,0.00016008138,0.000014779044,0.000007441618,0.000040469815,0.000057825393,0.0011164052,0.000112649366,0.9966857,0.0017588352,0.000011216497],"about_ca_topic_score_codex":0.0020047484,"about_ca_topic_score_gemma":0.0011192065,"teacher_disagreement_score":0.015889486,"about_ca_system_score_codex":0.003299741,"about_ca_system_score_gemma":0.0012925565,"threshold_uncertainty_score":0.05315566},"labels":[],"label_agreement":null},{"id":"W1989964473","doi":"10.1080/0308108031000119663","title":"On algebraic connectivity as a function of an edge weight","year":2004,"lang":"en","type":"article","venue":"Linear and Multilinear Algebra","topic":"Graph theory and applications","field":"Mathematics","cited_by":13,"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 Regina","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Algebraic connectivity; Mathematics; Laplacian matrix; Weight function; Upper and lower bounds; Algebraic number; Simple (philosophy); Enhanced Data Rates for GSM Evolution; Combinatorics; Differentiable function; Laplace operator; Discrete mathematics; Graph; Pure mathematics; Mathematical analysis; Computer science","score_opus":0.021345481155370105,"score_gpt":0.2999181330995479,"score_spread":0.2785726519441778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989964473","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7613194,0.0006021954,0.22284459,0.0008126274,0.00004114348,0.00001985766,0.0000795587,0.0002025655,0.014077995],"genre_scores_gemma":[0.98104596,0.00056271395,0.016691597,0.000063536485,0.000052913456,0.00002571686,0.00006740424,0.000065368695,0.0014248107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976844,0.00008403491,0.0000059705803,0.00003885859,0.00005527145,0.000047425558],"domain_scores_gemma":[0.99588877,0.0027121035,0.00062338443,0.00019479965,0.0003389468,0.00024195074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069221546,0.00059419556,0.00040224646,0.0015325163,0.0005404508,0.0010286111,0.0005107338,0.00065014634,0.0016838826],"category_scores_gemma":[0.008645155,0.00022761276,0.00019918295,0.0010370432,0.0017980515,0.002321863,0.0008490498,0.0006873859,0.00019045781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106439795,0.00007483285,0.003172753,0.0001108287,0.000024900492,0.0003570392,0.0002988297,0.33344376,0.017277617,0.623935,0.0009966159,0.020201553],"study_design_scores_gemma":[0.00001607422,0.000089250025,0.0026953125,0.00003311055,0.000019703639,0.00023571907,0.00011971138,0.706585,0.0033587404,0.28565496,0.0011473835,0.000045063684],"about_ca_topic_score_codex":0.0010128316,"about_ca_topic_score_gemma":0.0012201158,"teacher_disagreement_score":0.0016838826,"about_ca_system_score_codex":0.00060691184,"about_ca_system_score_gemma":0.0002256843,"threshold_uncertainty_score":0.0056331754},"labels":[],"label_agreement":null},{"id":"W1990816663","doi":"10.1142/s0218127408022445","title":"INFINITE ORDER PARAMETRIC NORMAL FORM OF HOPF SINGULARITY","year":2008,"lang":"en","type":"article","venue":"International Journal of Bifurcation and Chaos","topic":"Graph theory and applications","field":"Mathematics","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":"Western University","funders":"","keywords":"Mathematics; Parametric statistics; Singularity; Codimension; Pure mathematics; Mathematical analysis; Topology (electrical circuits); Combinatorics","score_opus":0.04563073653139292,"score_gpt":0.3181417546328762,"score_spread":0.27251101810148326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990816663","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46132106,0.00024008482,0.52459735,0.00016757616,0.00009391335,0.000068683126,0.00009636856,0.00025483273,0.01316013],"genre_scores_gemma":[0.9495351,0.00017016617,0.044822432,0.0000319613,0.00006408009,0.00002736951,0.00008723815,0.00005229277,0.005209407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999746,0.000031764328,0.000020103596,0.000059298203,0.00010335884,0.000039385413],"domain_scores_gemma":[0.9997416,0.000033346983,0.000044232125,0.000037629714,0.00007663368,0.000066576686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034557888,0.00032952192,0.00038974112,0.0014806716,0.0005982584,0.001058272,0.00052193296,0.0004181893,0.0025948144],"category_scores_gemma":[0.0012038195,0.0001815053,0.0005259484,0.00037348198,0.0011558374,0.0027739503,0.0012078861,0.0007320121,0.0003454758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025659818,0.000026558406,0.0012537481,0.000051549123,0.0000110716655,0.0004111109,0.00042385,0.0064626145,0.008653494,0.96633065,0.00036563128,0.015983947],"study_design_scores_gemma":[0.000009356644,0.00006986146,0.0007481415,0.00001482006,0.000008545881,0.00053447305,0.00015631378,0.09721017,0.0058463584,0.89188004,0.00348803,0.000033947636],"about_ca_topic_score_codex":0.0006036372,"about_ca_topic_score_gemma":0.00045305764,"teacher_disagreement_score":0.0025948144,"about_ca_system_score_codex":0.00055307645,"about_ca_system_score_gemma":0.0004290056,"threshold_uncertainty_score":0.008680582},"labels":[],"label_agreement":null},{"id":"W1991134730","doi":"10.1016/s0024-3795(99)00253-0","title":"A tree whose complement is not eigensharp","year":2000,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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":"Queen's University","funders":"","keywords":"Mathematics; Combinatorics; Complement (music); Bipartite graph; Adjacency matrix; Partition (number theory); Upper and lower bounds; Graph; Eigenvalues and eigenvectors; Tree (set theory); Discrete mathematics","score_opus":0.04929656059834209,"score_gpt":0.31907570512649375,"score_spread":0.26977914452815166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991134730","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6661287,0.0008001475,0.17035137,0.0032700936,0.0007039535,0.00008938812,0.001956487,0.0011217296,0.15557803],"genre_scores_gemma":[0.8816451,0.00052298116,0.072617985,0.0006234319,0.00022449634,0.000097459175,0.0020885516,0.00048773712,0.041692216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995402,0.000049191083,0.000022232354,0.0001373153,0.00011499743,0.00013605377],"domain_scores_gemma":[0.998145,0.00069213915,0.0001604294,0.00022479943,0.0004276457,0.0003500446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048156458,0.00046879728,0.0011204729,0.0018217067,0.0027789185,0.00333243,0.00080741895,0.0016036669,0.009562949],"category_scores_gemma":[0.0019621497,0.00058204395,0.0006813292,0.00181081,0.0021229046,0.0047325445,0.0016094453,0.0025923944,0.0020202547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016200887,0.00006812582,0.00069249904,0.000102932856,0.000023634899,0.00058296474,0.00044005326,0.00046284485,0.009628275,0.9664846,0.0059108245,0.0154412035],"study_design_scores_gemma":[0.000023907134,0.00003293843,0.0008191443,0.000046441597,0.00003283149,0.0014766938,0.0004702813,0.0051966733,0.005090546,0.9708883,0.015890535,0.000031648407],"about_ca_topic_score_codex":0.0011470655,"about_ca_topic_score_gemma":0.0016839684,"teacher_disagreement_score":0.009562949,"about_ca_system_score_codex":0.00074764737,"about_ca_system_score_gemma":0.000777072,"threshold_uncertainty_score":0.031991243},"labels":[],"label_agreement":null},{"id":"W1992780816","doi":"10.1016/j.laa.2006.06.006","title":"Inequalities for the spectra of symmetric doubly stochastic matrices","year":2006,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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":"University of Saskatchewan","funders":"","keywords":"Mathematics; Transitive relation; Diagonal; Combinatorics; Markov chain; Majorization; Mixing (physics); Discrete mathematics; Pure mathematics; Geometry","score_opus":0.034238946311262106,"score_gpt":0.29940456520372016,"score_spread":0.26516561889245804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992780816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06747862,0.0044741547,0.8401303,0.004834493,0.0007640934,0.00009454688,0.0016793953,0.00023295455,0.08031139],"genre_scores_gemma":[0.8530062,0.006383577,0.10354533,0.0019511903,0.002017133,0.00038774923,0.0016201843,0.00027612157,0.030812602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862826,0.0004435273,0.00007796676,0.00024746047,0.00043184508,0.00017092195],"domain_scores_gemma":[0.989813,0.007090505,0.0008499904,0.00033184898,0.0013030178,0.00061154383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022476697,0.0012660881,0.0008561858,0.0025010863,0.00093785056,0.002934391,0.0016113849,0.00135694,0.011989594],"category_scores_gemma":[0.01145347,0.00047795178,0.00095394114,0.0016087727,0.0024189441,0.005410499,0.0018352317,0.0039083916,0.0014311955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025909172,0.00002087885,0.00011949425,0.00006540162,0.000014981114,0.000055586526,0.00011748359,0.004305789,0.0014000623,0.9853753,0.0020875547,0.0064116097],"study_design_scores_gemma":[0.00000839707,0.0000114399945,0.00020334752,0.000031294312,0.000005710124,0.00004499231,0.000061323146,0.048040584,0.0003172515,0.949328,0.001931411,0.00001626055],"about_ca_topic_score_codex":0.0020626602,"about_ca_topic_score_gemma":0.0025577073,"teacher_disagreement_score":0.011989594,"about_ca_system_score_codex":0.0018380668,"about_ca_system_score_gemma":0.0011129477,"threshold_uncertainty_score":0.040109158},"labels":[],"label_agreement":null},{"id":"W1994037159","doi":"10.1016/j.laa.2014.02.016","title":"Large regular bipartite graphs with median eigenvalue 1","year":2014,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Eigenvalues and eigenvectors; Conjecture; Vertex (graph theory); Interval (graph theory); Transitive relation; Discrete mathematics; Graph","score_opus":0.01662350388804468,"score_gpt":0.2686673953385129,"score_spread":0.25204389145046824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994037159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44945592,0.0011501376,0.48030436,0.0049476335,0.0003613654,0.00017815879,0.0015350605,0.0021317804,0.059935607],"genre_scores_gemma":[0.93765086,0.00046151286,0.040513486,0.0009250089,0.0006575053,0.00029592367,0.0007514928,0.00047015023,0.018274102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856573,0.0005418366,0.000042698568,0.00037112497,0.00029076115,0.0001878076],"domain_scores_gemma":[0.9896745,0.0065215216,0.0012909462,0.0009250455,0.0007461614,0.00084180734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013044849,0.0008136821,0.0018883258,0.0020867505,0.0018776371,0.0029899122,0.0018329927,0.0021439397,0.009738228],"category_scores_gemma":[0.0120805595,0.001058755,0.00083495304,0.0018042412,0.0025056184,0.0040974496,0.002705317,0.0026828619,0.0014586694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002257322,0.000121244055,0.0013317661,0.00026191713,0.00006306829,0.00036090935,0.00035055974,0.016398001,0.005072172,0.95067966,0.012787814,0.012347055],"study_design_scores_gemma":[0.000030885956,0.000020627805,0.0005251371,0.000016728085,0.00001566317,0.00023067447,0.00010692959,0.050783772,0.0006718967,0.94606,0.0015202912,0.000017408196],"about_ca_topic_score_codex":0.00065863936,"about_ca_topic_score_gemma":0.0008952781,"teacher_disagreement_score":0.009738228,"about_ca_system_score_codex":0.0010976865,"about_ca_system_score_gemma":0.0005981763,"threshold_uncertainty_score":0.032577634},"labels":[],"label_agreement":null},{"id":"W1995413952","doi":"10.1016/j.laa.2005.09.020","title":"Spectral analysis of the affine graph over the finite ring","year":2005,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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; Cayley graph; Ramanujan's sum; Combinatorics; Adjacency matrix; Affine transformation; Discrete mathematics; Automorphism; Graph; Pure mathematics","score_opus":0.020137364385443886,"score_gpt":0.2833899325176417,"score_spread":0.26325256813219783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995413952","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6784313,0.0028011934,0.23014309,0.0041678795,0.00049668824,0.00004888029,0.00047773417,0.00039847154,0.083034866],"genre_scores_gemma":[0.9781643,0.0010169393,0.009067948,0.00024330243,0.00070982287,0.000021925513,0.00017284577,0.00008238397,0.01052059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995877,0.00013829794,0.0000124028165,0.000093820745,0.00009547241,0.00007234254],"domain_scores_gemma":[0.99886215,0.00035205134,0.0002450043,0.00008221461,0.00021508793,0.00024353882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006142925,0.000620569,0.0005901361,0.0034972345,0.0010618187,0.0019390925,0.0009567586,0.00060370704,0.00571553],"category_scores_gemma":[0.0016402003,0.00023209279,0.0005273113,0.001308524,0.0028197516,0.0028474675,0.0009222307,0.0012421168,0.0006886366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025012638,0.00001925387,0.00023135544,0.000028590019,0.000007470966,0.000034914527,0.0001292813,0.0021082968,0.0009810033,0.991277,0.0007273596,0.0044305297],"study_design_scores_gemma":[0.0000063115185,0.00001674899,0.00031885266,0.000013699962,0.000007858056,0.000059519913,0.000117721276,0.017545957,0.00073277036,0.9794982,0.0016688723,0.000013573361],"about_ca_topic_score_codex":0.0014331009,"about_ca_topic_score_gemma":0.0008354528,"teacher_disagreement_score":0.00571553,"about_ca_system_score_codex":0.0011392795,"about_ca_system_score_gemma":0.00057394255,"threshold_uncertainty_score":0.019120336},"labels":[],"label_agreement":null},{"id":"W1996070164","doi":"10.1016/s0012-365x(01)00355-7","title":"Minimizing algebraic connectivity over connected graphs with fixed girth","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":38,"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","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Discrete mathematics; Graph; Algebraic number; Connectivity; Girth (graph theory)","score_opus":0.03866746471566069,"score_gpt":0.27142935720184197,"score_spread":0.2327618924861813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996070164","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87955195,0.00045140932,0.09036449,0.0012291454,0.00007765867,0.000069889844,0.0002831211,0.00028644668,0.027685896],"genre_scores_gemma":[0.96513367,0.0005155885,0.02533933,0.00016211276,0.00014519907,0.000114730545,0.00033905328,0.0002057487,0.008044497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949145,0.00014802109,0.000018970439,0.00013146874,0.000114262126,0.00009581116],"domain_scores_gemma":[0.9963288,0.002121728,0.000568826,0.0002479657,0.00027457223,0.00045816385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054073986,0.0013013082,0.001162561,0.0018990347,0.0013575818,0.002441975,0.0024850115,0.0017850787,0.005001392],"category_scores_gemma":[0.005555828,0.0008888566,0.00056364684,0.0019879113,0.001931359,0.0046948614,0.002680231,0.0019615504,0.00036930045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001247481,0.00005756256,0.0011631395,0.00019449425,0.00003741897,0.00016212971,0.00035632143,0.035526942,0.00452585,0.94101715,0.0024536718,0.014380612],"study_design_scores_gemma":[0.00003101357,0.00005974528,0.00067076733,0.000024090403,0.00003419518,0.0002454785,0.00020820918,0.051194858,0.0017600326,0.9441937,0.0015617708,0.000016005682],"about_ca_topic_score_codex":0.00074614276,"about_ca_topic_score_gemma":0.0013452395,"teacher_disagreement_score":0.005001392,"about_ca_system_score_codex":0.0011365272,"about_ca_system_score_gemma":0.0003778945,"threshold_uncertainty_score":0.016731322},"labels":[],"label_agreement":null},{"id":"W1996653774","doi":"10.1016/j.ejor.2006.12.059","title":"Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph","year":2007,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Graph theory and applications","field":"Mathematics","cited_by":55,"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; Adjacency matrix; Eigenvalues and eigenvectors; Extremal graph theory; Vertex (graph theory); Upper and lower bounds; Discrete mathematics; Graph; Chordal graph; Line graph; Voltage graph","score_opus":0.10577459983019742,"score_gpt":0.3979588401396671,"score_spread":0.29218424030946966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996653774","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6522619,0.0037732883,0.26308525,0.014762397,0.0004585713,0.00013239343,0.0007482955,0.00040127753,0.06437658],"genre_scores_gemma":[0.95835173,0.0009034704,0.030853057,0.0006960928,0.00034780748,0.00013329448,0.00046574287,0.0001162624,0.008132447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999071,0.00040718162,0.000029748155,0.00022512347,0.00013158827,0.00013526891],"domain_scores_gemma":[0.9846986,0.012041564,0.0009556616,0.0007756577,0.0006971452,0.0008313818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002221049,0.00034815454,0.0012503826,0.001389442,0.0019386671,0.0025605224,0.0019619127,0.002112371,0.008630263],"category_scores_gemma":[0.02256016,0.00053711585,0.0008514857,0.00126813,0.0030423962,0.005475046,0.0018361142,0.0021593731,0.0005122733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029482757,0.0001310146,0.0030083398,0.00025964552,0.0000547659,0.00016908352,0.0004420006,0.043612186,0.0011119071,0.92287177,0.0129835345,0.0150609985],"study_design_scores_gemma":[0.00006146187,0.000037582824,0.0008370736,0.00004288141,0.00001801925,0.00008209047,0.0002125045,0.12930265,0.00042650182,0.86740065,0.0015592711,0.000019448127],"about_ca_topic_score_codex":0.0014612754,"about_ca_topic_score_gemma":0.002432628,"teacher_disagreement_score":0.008630263,"about_ca_system_score_codex":0.0012732793,"about_ca_system_score_gemma":0.00074884575,"threshold_uncertainty_score":0.028871119},"labels":[],"label_agreement":null},{"id":"W1997126628","doi":"10.1016/j.laa.2012.05.033","title":"The minimum rank of universal adjacency matrices","year":2012,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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":"University of Regina","funders":"Specialized Research Fund for the Doctoral Program of Higher Education of China; Natural Science Foundation of Anhui Province; Natural Sciences and Engineering Research Council of Canada; Anhui Provincial Department of Education; University of Regina; Anhui University; Ministry of Education of the People's Republic of China; National Natural Science Foundation of China","keywords":"Mathematics; Rank (graph theory); Combinatorics; Adjacency matrix; Adjacency list; Discrete mathematics; Graph","score_opus":0.023122365565114496,"score_gpt":0.28624433559443974,"score_spread":0.26312197002932525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997126628","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4763959,0.0027529255,0.45540988,0.0037729433,0.0005050398,0.00008257028,0.0020940886,0.0009417559,0.05804485],"genre_scores_gemma":[0.94125736,0.0010861607,0.045653537,0.0004225871,0.0007674039,0.000109998575,0.0008573085,0.00026152842,0.009584146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981681,0.0006669341,0.00009637988,0.00049289723,0.00033626187,0.00023940236],"domain_scores_gemma":[0.9894365,0.0058410047,0.0015102152,0.0012284276,0.0010311732,0.00095265167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013253298,0.0010897513,0.0015223939,0.0020403224,0.0013103967,0.0035953857,0.0018574055,0.001889731,0.007361678],"category_scores_gemma":[0.014890016,0.0008384866,0.0006654144,0.0017728431,0.0028195665,0.0064867386,0.0019771154,0.0021448957,0.0012449695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023167758,0.00007586276,0.0009126685,0.0002553801,0.00004131145,0.00010984254,0.00038683202,0.011130047,0.0042471713,0.94086295,0.0075719906,0.03417437],"study_design_scores_gemma":[0.000015007634,0.000029074223,0.00028930165,0.000024074798,0.000010996512,0.00010895834,0.0000882528,0.018237777,0.0012038979,0.97843605,0.0015339972,0.000022687967],"about_ca_topic_score_codex":0.00063487014,"about_ca_topic_score_gemma":0.0007229638,"teacher_disagreement_score":0.007361678,"about_ca_system_score_codex":0.00068798,"about_ca_system_score_gemma":0.0009299993,"threshold_uncertainty_score":0.024627268},"labels":[],"label_agreement":null},{"id":"W1997887073","doi":"10.1016/j.disc.2006.06.025","title":"On a conjecture about the Randić index","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":33,"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; Polytechnique Montréal","funders":"","keywords":"Conjecture; Mathematics; Graph; Combinatorics; Index (typography); Order (exchange); Discrete mathematics; Computer science","score_opus":0.018549852329118384,"score_gpt":0.2867706539220379,"score_spread":0.2682208015929195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997887073","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25144553,0.005216401,0.09569121,0.061104678,0.0043091555,0.00008211506,0.00086915446,0.0008271428,0.5804546],"genre_scores_gemma":[0.9197176,0.0023477825,0.023878941,0.00648046,0.005217284,0.00015325473,0.000713771,0.00043993114,0.041051075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982419,0.0004639761,0.00008055748,0.00055267516,0.00040372036,0.00025713863],"domain_scores_gemma":[0.99019086,0.006102366,0.0007928686,0.0014695893,0.0007648832,0.0006793443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025900246,0.00069302204,0.0018424331,0.0028687962,0.0036171044,0.0054656086,0.0022103123,0.003323167,0.015634503],"category_scores_gemma":[0.018218676,0.00056688214,0.0009973557,0.0026939334,0.008466605,0.01344426,0.003909903,0.006553111,0.0022939339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040350358,0.000010635379,0.00018812311,0.000022847858,0.0000034879233,0.000017001057,0.0000959825,0.0002641915,0.00012002184,0.99287874,0.0036212434,0.0027373175],"study_design_scores_gemma":[0.000014721428,0.0000069856687,0.00013740323,0.000013599561,0.000003858095,0.000036636127,0.00003505271,0.00078984414,0.00009042606,0.9955154,0.0033485964,0.0000075173775],"about_ca_topic_score_codex":0.0012086303,"about_ca_topic_score_gemma":0.0008958926,"teacher_disagreement_score":0.015634503,"about_ca_system_score_codex":0.002123534,"about_ca_system_score_gemma":0.00082435255,"threshold_uncertainty_score":0.05230266},"labels":[],"label_agreement":null},{"id":"W2001348807","doi":"10.1016/j.disc.2013.07.006","title":"On the determinant of bipartite graphs","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","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 Waterloo","funders":"","keywords":"Combinatorics; Bipartite graph; Mathematics; Edge-transitive graph; Discrete mathematics; Voltage graph; Factor-critical graph; Line graph; Graph; Vertex-transitive graph","score_opus":0.03599603487478095,"score_gpt":0.2908238086192669,"score_spread":0.25482777374448595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001348807","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48844492,0.005362589,0.31819212,0.009553277,0.001896168,0.00008667834,0.00072141463,0.0006375897,0.17510521],"genre_scores_gemma":[0.9541112,0.0024558564,0.013772356,0.0009039538,0.001509171,0.000080035854,0.0004279219,0.00036557726,0.026373785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893504,0.0004482221,0.000032847824,0.00016896611,0.0002512589,0.00016359634],"domain_scores_gemma":[0.9934615,0.0038479427,0.0005268673,0.0004651983,0.0007887048,0.00090972456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012663956,0.0009018591,0.0015573654,0.002777761,0.0012024054,0.0025241973,0.0014689071,0.0016458961,0.008933073],"category_scores_gemma":[0.008946842,0.0005883821,0.00063497334,0.001827775,0.004541248,0.0041645984,0.00222162,0.002629382,0.0011802679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031610693,0.00003101635,0.0003433395,0.00004997139,0.000008085259,0.000064035616,0.00015056906,0.0031595847,0.0005382537,0.98681414,0.004000065,0.0048093474],"study_design_scores_gemma":[0.000009114994,0.000009237967,0.0002706427,0.00001590061,0.0000045474876,0.00006750561,0.000048889866,0.018308591,0.00012544903,0.9795247,0.0016041053,0.000011478793],"about_ca_topic_score_codex":0.0020742577,"about_ca_topic_score_gemma":0.0020118686,"teacher_disagreement_score":0.008933073,"about_ca_system_score_codex":0.0014421977,"about_ca_system_score_gemma":0.0007757572,"threshold_uncertainty_score":0.0298841},"labels":[],"label_agreement":null},{"id":"W2005270743","doi":"10.1016/j.laa.2015.01.020","title":"Laplacian controllability classes for threshold graphs","year":2015,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Combinatorics; Controllability; Laplacian matrix; Eigenvalues and eigenvectors; Discrete mathematics; Laplace operator; Graph; Mathematical analysis","score_opus":0.0707617915444884,"score_gpt":0.3375349350839397,"score_spread":0.2667731435394513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005270743","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6401016,0.0006124559,0.27834266,0.0018058043,0.00016226839,0.00012077293,0.00060026173,0.00070590654,0.07754826],"genre_scores_gemma":[0.987665,0.00024551566,0.0035518145,0.00014858681,0.00019584692,0.000086656444,0.0003095731,0.00009247431,0.007704602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952424,0.000067397195,0.000020342848,0.00012469565,0.00015542588,0.000107885346],"domain_scores_gemma":[0.99702805,0.0016261108,0.00044119413,0.0001871825,0.0002378684,0.0004796055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006214816,0.0007392446,0.00068022497,0.0031376637,0.0013255967,0.0027102653,0.0011569962,0.0009868414,0.012015352],"category_scores_gemma":[0.0038495702,0.00036823264,0.00079273933,0.0012339226,0.0021054067,0.0032063504,0.0013762835,0.0017479206,0.00039489943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005169723,0.00006593066,0.0008023366,0.000038341106,0.000015631897,0.000081781334,0.00031492475,0.004207812,0.0026345202,0.984203,0.0018353839,0.0057486687],"study_design_scores_gemma":[0.000027431874,0.00001318217,0.0006408496,0.000009006182,0.000009218413,0.000070122995,0.00010822338,0.049015608,0.0007247874,0.948426,0.00093890354,0.000016675078],"about_ca_topic_score_codex":0.0024960106,"about_ca_topic_score_gemma":0.0020386192,"teacher_disagreement_score":0.012015352,"about_ca_system_score_codex":0.001426563,"about_ca_system_score_gemma":0.0004937045,"threshold_uncertainty_score":0.040195346},"labels":[],"label_agreement":null},{"id":"W2006666423","doi":"10.1016/j.laa.2006.05.020","title":"On the minimum rank of the join of graphs and decomposable graphs","year":2006,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":27,"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","funders":"","keywords":"Mathematics; Combinatorics; Join (topology); Cograph; Rank (graph theory); Graph product; Joins; Chordal graph; Tree-depth; Pathwidth; Indifference graph; Discrete mathematics; Graph; 1-planar graph; Line graph; Computer science","score_opus":0.01677410734487261,"score_gpt":0.25716388522501016,"score_spread":0.24038977788013755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006666423","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60473603,0.004218256,0.311059,0.0051924936,0.00056154653,0.00008417373,0.0016342108,0.00061845273,0.07189576],"genre_scores_gemma":[0.92930925,0.002407838,0.04752653,0.0004964264,0.0016158237,0.00010868962,0.00165232,0.0003217049,0.016561426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799913,0.00075696775,0.00009498355,0.00038932398,0.00048215978,0.0002774822],"domain_scores_gemma":[0.9825318,0.011090021,0.0020950371,0.0009930602,0.0013134761,0.0019766157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029021779,0.0011142992,0.0024270664,0.0038281223,0.0016923228,0.005295931,0.0020564378,0.0014978788,0.008947679],"category_scores_gemma":[0.013835604,0.0007945347,0.0009720271,0.0031329736,0.003822849,0.010463391,0.0024952758,0.0035959254,0.001236687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028379107,0.000104485065,0.0010314997,0.00020298798,0.00003738396,0.00010047081,0.0005782622,0.006824413,0.0021390228,0.9631091,0.0047079152,0.02088063],"study_design_scores_gemma":[0.000022663484,0.000055580982,0.00051618705,0.000023750696,0.000018392766,0.00010871637,0.00021081771,0.01612073,0.0007031055,0.9805012,0.001694245,0.00002472394],"about_ca_topic_score_codex":0.0009963001,"about_ca_topic_score_gemma":0.0012937746,"teacher_disagreement_score":0.008947679,"about_ca_system_score_codex":0.0011893751,"about_ca_system_score_gemma":0.0008107859,"threshold_uncertainty_score":0.029932916},"labels":[],"label_agreement":null},{"id":"W2006836809","doi":"10.1016/j.disc.2003.11.006","title":"The largest non-integer real zero of chromatic polynomials of graphs with fixed order","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Chromatic scale; Integer (computer science); Discrete mathematics; Graph; Vertex (graph theory); Chromatic polynomial; Windmill graph; Order (exchange); Voltage graph; Line graph","score_opus":0.01586986971397748,"score_gpt":0.28015439506926204,"score_spread":0.26428452535528457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006836809","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.931302,0.0007586338,0.04064411,0.002080251,0.00030017924,0.000037839447,0.0005213519,0.00030750214,0.02404803],"genre_scores_gemma":[0.9907197,0.00031369756,0.0041595055,0.00009806183,0.00018243838,0.000026963968,0.0001953733,0.00008962414,0.004214543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933064,0.00014804797,0.000023224839,0.00021259944,0.00011212278,0.00017344102],"domain_scores_gemma":[0.99262035,0.004359416,0.0010087764,0.0004963569,0.00050803175,0.0010071605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00115743,0.0012772084,0.000668437,0.003660902,0.0017632631,0.004695091,0.0020386076,0.0014868029,0.0054351855],"category_scores_gemma":[0.009738008,0.000631423,0.0005029433,0.0017265956,0.006873839,0.004671792,0.001301778,0.002661076,0.00062477775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006993873,0.00010387669,0.0030019316,0.00027924712,0.000035150802,0.00027858053,0.0008863011,0.008716804,0.016588956,0.94770616,0.003386318,0.018317351],"study_design_scores_gemma":[0.00008341673,0.000078115336,0.0027224752,0.000082893726,0.00004444308,0.00035324,0.00045914768,0.019930786,0.006203586,0.9674187,0.0025268793,0.00009636266],"about_ca_topic_score_codex":0.0017960808,"about_ca_topic_score_gemma":0.0019280683,"teacher_disagreement_score":0.0054351855,"about_ca_system_score_codex":0.0022810227,"about_ca_system_score_gemma":0.0011295505,"threshold_uncertainty_score":0.018182576},"labels":[],"label_agreement":null},{"id":"W2009210880","doi":"10.1016/s0012-365x(01)00280-1","title":"On centroid branches of trees from certain families","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"University of Alberta; York University","funders":"","keywords":"Mathematics; Centroid; Combinatorics; Tree (set theory); Discrete mathematics; Geometry","score_opus":0.039534289960439464,"score_gpt":0.2720989982179498,"score_spread":0.23256470825751036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009210880","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6560986,0.002213736,0.26024485,0.0020336772,0.00018336553,0.000097092394,0.0010226029,0.00037910012,0.07772694],"genre_scores_gemma":[0.8772429,0.0023356937,0.09185493,0.0005463257,0.00044620817,0.00017676012,0.0024207074,0.0005892055,0.024387188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990798,0.00025127112,0.000042804557,0.00018146011,0.00027763064,0.00016708155],"domain_scores_gemma":[0.992615,0.003994748,0.0010546753,0.00048316637,0.00082384615,0.0010286013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014197547,0.0005879312,0.0018656497,0.0035038765,0.0033201233,0.0038337437,0.0020558508,0.0022812192,0.010465401],"category_scores_gemma":[0.01140993,0.0008538549,0.0011828048,0.004635252,0.0028971515,0.006911355,0.0033367756,0.0042536114,0.0012924513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008127356,0.000017261073,0.0007118028,0.000061851904,0.000011185975,0.00017631531,0.00085968565,0.0019055088,0.0010426356,0.9865563,0.0017446829,0.0068315016],"study_design_scores_gemma":[0.000024594536,0.000015753656,0.0008268236,0.00003345938,0.00001098336,0.00020052667,0.00028427402,0.009971447,0.0003101464,0.985704,0.002606212,0.000011731668],"about_ca_topic_score_codex":0.0020579188,"about_ca_topic_score_gemma":0.0030070564,"teacher_disagreement_score":0.010465401,"about_ca_system_score_codex":0.0021267212,"about_ca_system_score_gemma":0.00062937674,"threshold_uncertainty_score":0.03501028},"labels":[],"label_agreement":null},{"id":"W2011612721","doi":"10.1016/j.laa.2009.06.015","title":"A survey of automated conjectures in spectral graph theory","year":2009,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":63,"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; Eigenvalues and eigenvectors; Spectral graph theory; Graph theory; Voltage graph; Combinatorics; Line graph","score_opus":0.028189673782032687,"score_gpt":0.31612778832033317,"score_spread":0.2879381145383005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011612721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04429018,0.21363026,0.52990264,0.051106315,0.004046966,0.00021776637,0.0014082673,0.0014891016,0.1539085],"genre_scores_gemma":[0.47641757,0.23344654,0.21982114,0.010441498,0.02867549,0.0005461091,0.0053521446,0.0009893677,0.024310179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99442625,0.002063114,0.00039725975,0.0012039174,0.0016279295,0.00028145147],"domain_scores_gemma":[0.97025037,0.023046283,0.00071615726,0.003334717,0.0022490886,0.0004034344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007400383,0.001594993,0.003072158,0.0075465734,0.003546406,0.00829074,0.0037000668,0.0040621953,0.013454149],"category_scores_gemma":[0.025628842,0.0017077649,0.001936222,0.011874653,0.01107731,0.027865581,0.004565056,0.007904177,0.0036161612],"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.000048899048,0.00016425407,0.0012044744,0.0012649277,0.000045545818,0.00008778265,0.0003730051,0.0027917137,0.00022195576,0.8968869,0.016700359,0.08021025],"study_design_scores_gemma":[0.000017330443,0.00002332206,0.00032747458,0.0002584294,0.00001639207,0.00012289481,0.000117450276,0.005317643,0.00022570902,0.97192425,0.021621745,0.000027328286],"about_ca_topic_score_codex":0.001562911,"about_ca_topic_score_gemma":0.0012587844,"teacher_disagreement_score":0.013454149,"about_ca_system_score_codex":0.0031944455,"about_ca_system_score_gemma":0.0028836,"threshold_uncertainty_score":0.0450086},"labels":[],"label_agreement":null},{"id":"W2012755367","doi":"10.1016/j.laa.2005.12.020","title":"Eigenvalues of graphs and a simple proof of a theorem of Greenberg","year":2006,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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":"Queen's University","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Simple (philosophy); Combinatorics; Pure mathematics","score_opus":0.018548139585350235,"score_gpt":0.2788888504103185,"score_spread":0.2603407108249683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012755367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104693085,0.0081032105,0.5584392,0.026280515,0.006450626,0.00013408579,0.0007218311,0.0013525386,0.29382497],"genre_scores_gemma":[0.81425935,0.0043882383,0.10109016,0.006560864,0.004889445,0.00028618413,0.00030658775,0.0006537745,0.06756533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954563,0.00013567241,0.00002036347,0.000072484305,0.00017871974,0.00004708577],"domain_scores_gemma":[0.99868315,0.00074369635,0.00008611763,0.00012937802,0.00023296574,0.00012466108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008064424,0.0010142964,0.0010942724,0.0025136527,0.001292711,0.0018385856,0.0014515242,0.0013193086,0.010621267],"category_scores_gemma":[0.0038269116,0.00056895404,0.00116323,0.0014723472,0.0029533037,0.004246335,0.0023617325,0.0035088114,0.0013315432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009387529,0.000014953407,0.00003932311,0.000040486633,0.000008038145,0.000045015684,0.00009534047,0.00054967246,0.00071562116,0.9910676,0.0039316174,0.0034829243],"study_design_scores_gemma":[0.0000072690095,0.000003993933,0.000061264436,0.00000775649,0.000003273932,0.000028919709,0.000017158169,0.001493261,0.00013109029,0.99540025,0.0028393557,0.0000063200223],"about_ca_topic_score_codex":0.001181512,"about_ca_topic_score_gemma":0.0009623739,"teacher_disagreement_score":0.010621267,"about_ca_system_score_codex":0.0011329768,"about_ca_system_score_gemma":0.0004679871,"threshold_uncertainty_score":0.0355317},"labels":[],"label_agreement":null},{"id":"W2012823284","doi":"10.4153/cmb-2015-013-3","title":"Cover Product and Betti Polynomial of Graphs","year":2015,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Betti number; Bipartite graph; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.04337318165014518,"score_gpt":0.26919199164023705,"score_spread":0.22581880999009188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012823284","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9089451,0.00058409706,0.037461482,0.00044108715,0.00012060273,0.000036302583,0.00028014247,0.00012572423,0.052005395],"genre_scores_gemma":[0.99075717,0.00018388375,0.0029885091,0.0000424543,0.00011733416,0.000019764335,0.0001528392,0.000027204249,0.005711026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994609,0.000057090238,0.000015768044,0.00010120823,0.00020905338,0.00015598221],"domain_scores_gemma":[0.99905914,0.00031060475,0.00015247261,0.00008535158,0.00011961503,0.00027286392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053467375,0.00041023115,0.00061998493,0.002831318,0.0009247106,0.0014855129,0.00091519643,0.00047694778,0.0068712677],"category_scores_gemma":[0.0023116353,0.00029663564,0.00050107396,0.0016552245,0.002014622,0.0023516414,0.0011073585,0.00096881646,0.00054154143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011054557,0.000028516792,0.0016195795,0.00006129251,0.000020717147,0.00012469101,0.00032231692,0.0039956053,0.0043877806,0.9787,0.00074954086,0.009879499],"study_design_scores_gemma":[0.000020345582,0.00006581152,0.0035960665,0.00002693455,0.000021648073,0.0002451094,0.000112955626,0.025130834,0.002737638,0.963987,0.004028944,0.000026728741],"about_ca_topic_score_codex":0.0017646034,"about_ca_topic_score_gemma":0.0017911488,"teacher_disagreement_score":0.0068712677,"about_ca_system_score_codex":0.0017327905,"about_ca_system_score_gemma":0.0003015665,"threshold_uncertainty_score":0.02298665},"labels":[],"label_agreement":null},{"id":"W2013073462","doi":"10.1016/j.laa.2008.06.016","title":"On the sum of two largest eigenvalues of a symmetric matrix","year":2008,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":21,"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; Eigenvalues and eigenvectors; Adjacency matrix; Combinatorics; Linear algebra; Conjecture; Upper and lower bounds; Graph energy; Symmetric matrix; Graph; Strongly regular graph; Discrete mathematics; Line graph; Graph power","score_opus":0.04210620500294925,"score_gpt":0.3174844005137344,"score_spread":0.27537819551078513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013073462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45212254,0.0025377707,0.4675231,0.003414188,0.0014819225,0.0000663015,0.00035013634,0.00033629345,0.072167784],"genre_scores_gemma":[0.93373144,0.0015739925,0.038845394,0.0005303804,0.0013382285,0.00010485445,0.0003282751,0.00029832302,0.02324893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988689,0.00042121334,0.00004325252,0.00020298213,0.0003477674,0.00011581776],"domain_scores_gemma":[0.9945745,0.003722041,0.00052267674,0.00021720868,0.0005635023,0.00040013628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012971677,0.0013132842,0.0010393482,0.002473371,0.0010634586,0.0019165595,0.0013963113,0.0015759869,0.007684458],"category_scores_gemma":[0.007296182,0.00047376644,0.0005280406,0.001456138,0.0033256114,0.0041792165,0.0019855534,0.0018504629,0.0010244264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029209693,0.00007400708,0.0007445403,0.00024537236,0.00005322068,0.00052170345,0.0006342344,0.01702103,0.009815761,0.93805146,0.0054629208,0.027083581],"study_design_scores_gemma":[0.000016178732,0.000038792925,0.0006118016,0.00004554797,0.000017586586,0.00025961624,0.00017015595,0.0761074,0.0016296392,0.9191193,0.0019314986,0.00005247547],"about_ca_topic_score_codex":0.0005098539,"about_ca_topic_score_gemma":0.00050324923,"teacher_disagreement_score":0.007684458,"about_ca_system_score_codex":0.0005707374,"about_ca_system_score_gemma":0.00041299473,"threshold_uncertainty_score":0.025707126},"labels":[],"label_agreement":null},{"id":"W2013162935","doi":"10.1016/s0012-365x(99)00282-4","title":"Nordhaus–Gaddum results for CO-irredundance in graphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"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","funders":"Luonnontieteiden ja Tekniikan Tutkimuksen Toimikunta; Natural Sciences and Engineering Research Council of Canada; University of South Africa","keywords":"Mathematics; Combinatorics; Graph; Complement (music); Bounded function; Vertex (graph theory); Discrete mathematics","score_opus":0.04400181210309842,"score_gpt":0.34426928153598696,"score_spread":0.3002674694328885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013162935","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3318035,0.0130082,0.25579137,0.014891349,0.0022080494,0.00014803495,0.00096203375,0.0007669918,0.38042048],"genre_scores_gemma":[0.9169248,0.005678711,0.031482622,0.00288266,0.002071001,0.00017310397,0.0005352535,0.00037747665,0.03987434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998793,0.00027172148,0.00007250099,0.0003750309,0.0002539386,0.00023373716],"domain_scores_gemma":[0.99194145,0.005112223,0.0005996863,0.00079252024,0.0006925378,0.000861588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018602951,0.001618193,0.0036234513,0.008412158,0.0064176586,0.003466837,0.0028480673,0.003079116,0.0088951755],"category_scores_gemma":[0.00945966,0.001224133,0.0030142127,0.0062179705,0.008790436,0.015636865,0.005672457,0.010126396,0.001051907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020923331,0.0000141259425,0.00014395318,0.000072482224,0.000011552988,0.00005792912,0.00025585646,0.0004177266,0.0002322357,0.99547666,0.0011422113,0.0021543715],"study_design_scores_gemma":[0.0000062446106,0.0000062073823,0.00012454978,0.000013695636,0.000012691713,0.00007398081,0.000056573997,0.00081496564,0.0001271868,0.99721694,0.0015382691,0.000008706771],"about_ca_topic_score_codex":0.0023723645,"about_ca_topic_score_gemma":0.0022217194,"teacher_disagreement_score":0.0088951755,"about_ca_system_score_codex":0.0025568414,"about_ca_system_score_gemma":0.00089448015,"threshold_uncertainty_score":0.02975738},"labels":[],"label_agreement":null},{"id":"W2015556425","doi":"10.1080/1536383x.2010.515760","title":"Computing the Wiener Index of a Phenylenic Pattern","year":2011,"lang":"en","type":"article","venue":"Fullerenes Nanotubes and Carbon Nanostructures","topic":"Graph theory and applications","field":"Mathematics","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":"Memorial University of Newfoundland; University of Tehran","keywords":"Wiener index; Vertex (graph theory); Combinatorics; Graph; Index (typography); Mathematics; Topological index; Connectivity; Computer science; World Wide Web","score_opus":0.0313999606220526,"score_gpt":0.25088779381553467,"score_spread":0.21948783319348206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015556425","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69455874,0.00027843975,0.29573992,0.00011204664,0.000032701602,0.000018866065,0.00038806885,0.00031790492,0.008553362],"genre_scores_gemma":[0.906657,0.00029112378,0.08901713,0.000045707326,0.00002421359,0.00003194171,0.000587596,0.00009009439,0.0032551643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99985456,0.000019611618,0.000009738072,0.000039117946,0.000045559125,0.000031344956],"domain_scores_gemma":[0.99954295,0.0001664746,0.00008831388,0.00007280078,0.000067047906,0.000062415296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021550656,0.00024111966,0.0003990109,0.0012963124,0.0002883567,0.0007698166,0.0003616854,0.0005528221,0.0022516693],"category_scores_gemma":[0.0016030816,0.00017079475,0.00025389457,0.0009052818,0.0005342726,0.0015534622,0.00054054975,0.0003209714,0.00057860167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010119546,0.00015912992,0.016083907,0.00040586822,0.00013832412,0.0010508603,0.0005662212,0.16460352,0.24045014,0.3653135,0.004362666,0.20585386],"study_design_scores_gemma":[0.000026233745,0.00020209819,0.009109644,0.00003731189,0.000039589755,0.00053113437,0.00020640779,0.6112195,0.05999019,0.31381148,0.00474379,0.000082631515],"about_ca_topic_score_codex":0.00050592725,"about_ca_topic_score_gemma":0.00068172807,"teacher_disagreement_score":0.0022516693,"about_ca_system_score_codex":0.00034105143,"about_ca_system_score_gemma":0.00023089912,"threshold_uncertainty_score":0.007532537},"labels":[],"label_agreement":null},{"id":"W2016399479","doi":"10.1016/s0024-3795(02)00413-5","title":"A note on limit points for algebraic connectivity","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":10,"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","funders":"","keywords":"Mathematics; Algebraic connectivity; Algebraic number; Limit (mathematics); Limit point; Singular point of an algebraic variety; Discrete mathematics; Combinatorics; Real algebraic geometry; Algebraic element; Graph; Point (geometry); Algebraic extension; Line graph; Mathematical analysis; Geometry","score_opus":0.05339538668089552,"score_gpt":0.3097912485997617,"score_spread":0.2563958619188662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016399479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047328368,0.031519786,0.54956996,0.06159568,0.0156089,0.0001347039,0.000713503,0.0010475009,0.29248157],"genre_scores_gemma":[0.5795325,0.031128904,0.25035858,0.012504149,0.033029493,0.0005235489,0.00068422494,0.00090295915,0.091335736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990798,0.0003129366,0.000068596746,0.00018806742,0.00027225766,0.000078255944],"domain_scores_gemma":[0.99487865,0.0036707162,0.0001589414,0.0004599168,0.00051243394,0.0003192918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025489512,0.0012189355,0.0023588524,0.0037185592,0.0032069783,0.0036734166,0.0028172776,0.003523847,0.010281583],"category_scores_gemma":[0.007489731,0.00068002276,0.0016709729,0.003270392,0.0072820974,0.01736331,0.0048210155,0.008908933,0.0014997049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009473428,0.000009434443,0.000050777508,0.000046721143,0.0000053170925,0.000056800473,0.00011242687,0.00032064013,0.00021901989,0.989518,0.0058723516,0.0037789887],"study_design_scores_gemma":[0.0000032149408,0.000006058675,0.000030715455,0.000010421207,0.0000036827153,0.00003517754,0.000029997722,0.00092757505,0.000071867384,0.99044025,0.00843468,0.0000064468804],"about_ca_topic_score_codex":0.00093353476,"about_ca_topic_score_gemma":0.0014026292,"teacher_disagreement_score":0.010281583,"about_ca_system_score_codex":0.0015280531,"about_ca_system_score_gemma":0.0005755731,"threshold_uncertainty_score":0.034395337},"labels":[],"label_agreement":null},{"id":"W2016625692","doi":"10.1016/j.laa.2006.12.005","title":"On the Laplacian coefficients of acyclic graphs","year":2007,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":46,"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; Wiener index; Combinatorics; Laplacian matrix; Characteristic polynomial; Graph; Laplace operator; Path (computing); Order (exchange); Polynomial; Discrete mathematics; Tree (set theory); Mathematical analysis","score_opus":0.02776321990860775,"score_gpt":0.30406273522454896,"score_spread":0.2762995153159412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016625692","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4426194,0.0066979453,0.3883634,0.0060380385,0.0015152082,0.000098846285,0.0008439349,0.0006544469,0.1531688],"genre_scores_gemma":[0.92762524,0.0058612977,0.031018445,0.000872944,0.0016020872,0.00012915944,0.0006340842,0.0003483406,0.03190825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994185,0.0002100509,0.000019685569,0.00007619346,0.00018263208,0.00009295289],"domain_scores_gemma":[0.9954306,0.0029581191,0.00039301088,0.00020490908,0.00062084245,0.00039250107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012048583,0.0011339508,0.00094201264,0.0048084655,0.00081451255,0.0016542414,0.0012593445,0.0010002104,0.008929287],"category_scores_gemma":[0.009433393,0.00046788788,0.00043246572,0.0036565096,0.0023281965,0.0039240406,0.0013912454,0.0023988239,0.0012883776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036326313,0.000042968903,0.00039038676,0.00007766941,0.000010563789,0.00009059498,0.0002779152,0.007546962,0.0014728772,0.97020143,0.0048799184,0.014972356],"study_design_scores_gemma":[0.000012957704,0.000008947952,0.00029178997,0.00003248182,0.0000082978195,0.000088794564,0.00009512631,0.03367577,0.0004013086,0.9627629,0.0025962212,0.000025402976],"about_ca_topic_score_codex":0.002480341,"about_ca_topic_score_gemma":0.0027148265,"teacher_disagreement_score":0.008929287,"about_ca_system_score_codex":0.0010652051,"about_ca_system_score_gemma":0.0006902477,"threshold_uncertainty_score":0.029871404},"labels":[],"label_agreement":null},{"id":"W2016746591","doi":"10.1080/0308108031000069182","title":"Maximizing Algebraic Connectivity Over Unicyclic Graphs","year":2003,"lang":"en","type":"article","venue":"Linear and Multilinear Algebra","topic":"Graph theory and applications","field":"Mathematics","cited_by":25,"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 Regina","funders":"Natural Sciences and Engineering Research Council of Canada; University of Regina","keywords":"Combinatorics; Mathematics; Algebraic connectivity; Vertex (graph theory); Discrete mathematics; Graph; Algebraic number; Upper and lower bounds; Line graph","score_opus":0.035912470047223186,"score_gpt":0.3132328064926379,"score_spread":0.2773203364454147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016746591","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87244403,0.0005001204,0.08868693,0.00042746143,0.000022472894,0.000043830547,0.00021487848,0.00013301188,0.037527237],"genre_scores_gemma":[0.9875566,0.00035258563,0.010456041,0.00004063187,0.00003308054,0.000026319105,0.00011436392,0.00002309405,0.0013973115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995648,0.000112420734,0.00001765018,0.00011422725,0.00008918003,0.000101708865],"domain_scores_gemma":[0.9981375,0.00088690023,0.00044543884,0.00012988946,0.00018493475,0.00021533812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040968304,0.00042994617,0.00048440747,0.0010292586,0.0008433283,0.0008475629,0.00054351625,0.00038084493,0.0026544023],"category_scores_gemma":[0.003111241,0.00020325209,0.00021841358,0.0014379587,0.0010582972,0.00155993,0.00093187694,0.00037903283,0.00015714455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101582984,0.000035782952,0.0029399523,0.00017230104,0.000027445369,0.00040558784,0.000370822,0.056202583,0.009129636,0.89352393,0.0021974707,0.034892943],"study_design_scores_gemma":[0.000030443096,0.00009499819,0.0025721102,0.000035384226,0.000029581295,0.0009266667,0.00038904021,0.13422807,0.0049941796,0.8491661,0.0075043016,0.000029236271],"about_ca_topic_score_codex":0.0008049188,"about_ca_topic_score_gemma":0.0012744963,"teacher_disagreement_score":0.0026544023,"about_ca_system_score_codex":0.0006038653,"about_ca_system_score_gemma":0.0002545427,"threshold_uncertainty_score":0.00887984},"labels":[],"label_agreement":null},{"id":"W2016808872","doi":"10.1016/j.jctb.2006.07.006","title":"Extreme eigenvalues of nonregular graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Combinatorics; Eigenvalues and eigenvectors; Mathematics; Adjacency matrix; Upper and lower bounds; Graph; Discrete mathematics; Physics; Mathematical analysis","score_opus":0.02581874398230166,"score_gpt":0.2677072303653798,"score_spread":0.24188848638307814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016808872","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9012108,0.00034888388,0.062888816,0.00092687213,0.00024723794,0.000033978085,0.00009284553,0.0003086551,0.033941943],"genre_scores_gemma":[0.98853415,0.00015895271,0.0056651803,0.00011542153,0.00017062426,0.000036982237,0.0000656412,0.00006926847,0.0051837945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999498,0.00014040855,0.000022089502,0.00007597139,0.00016618556,0.000097335265],"domain_scores_gemma":[0.9979353,0.0008639139,0.00031857876,0.00017917783,0.00023147586,0.00047149885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063954975,0.0006402654,0.0007342565,0.0026411405,0.0013861477,0.0024893237,0.0008602857,0.0012869653,0.004884525],"category_scores_gemma":[0.0037791047,0.0004964879,0.0003733627,0.00089356693,0.002076559,0.0018706528,0.001308149,0.0014208711,0.00057261996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013049302,0.0000882263,0.0011894195,0.000048576392,0.000019692181,0.00033504242,0.00048238953,0.0051755016,0.007658267,0.97585016,0.002327307,0.006695039],"study_design_scores_gemma":[0.000025502259,0.000019158724,0.0007756457,0.0000098199835,0.000005713248,0.0001957803,0.0001798712,0.018804668,0.0006792186,0.97862405,0.0006651403,0.000015418182],"about_ca_topic_score_codex":0.0003279762,"about_ca_topic_score_gemma":0.0005727584,"teacher_disagreement_score":0.004884525,"about_ca_system_score_codex":0.000600569,"about_ca_system_score_gemma":0.00026646798,"threshold_uncertainty_score":0.016340315},"labels":[],"label_agreement":null},{"id":"W2017826398","doi":"10.1016/j.laa.2011.03.051","title":"On the extremal values of the second largest Q-eigenvalue","year":2011,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":26,"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; Eigenvalues and eigenvectors; Combinatorics; Graph; Simple (philosophy); Algebraic connectivity; Laplace operator; Laplacian matrix; Simple graph; Connectivity; Discrete mathematics; Mathematical analysis","score_opus":0.05802043641645613,"score_gpt":0.2738958967890918,"score_spread":0.2158754603726357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017826398","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54458076,0.0048261485,0.30895495,0.008682814,0.0011253168,0.00007209445,0.00043239968,0.0005807827,0.13074477],"genre_scores_gemma":[0.96692765,0.0011965238,0.020992113,0.00049351313,0.00076391804,0.00008624309,0.00016796151,0.00020232955,0.00916984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991737,0.00034992868,0.000030497491,0.00016276182,0.00014898904,0.00013406052],"domain_scores_gemma":[0.99425185,0.0037630228,0.0005591634,0.00032306236,0.0005056527,0.00059724523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024324593,0.0011854147,0.0010959709,0.003602776,0.0015526519,0.00327283,0.0016666602,0.0017714316,0.008300245],"category_scores_gemma":[0.012822475,0.00060463126,0.0005858302,0.0017883828,0.004754491,0.004701533,0.0020969524,0.002655069,0.0008593344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014989621,0.000040223462,0.0004974911,0.00012817193,0.00002162848,0.00014941211,0.00018096769,0.0069280677,0.0020686467,0.9793941,0.002323574,0.008117776],"study_design_scores_gemma":[0.000020773172,0.000018627452,0.000578498,0.00004796482,0.000011374924,0.00012802919,0.000104121544,0.034277417,0.0006054172,0.96319854,0.00097573193,0.0000335778],"about_ca_topic_score_codex":0.0005494373,"about_ca_topic_score_gemma":0.0006419399,"teacher_disagreement_score":0.008300245,"about_ca_system_score_codex":0.0011247735,"about_ca_system_score_gemma":0.00075934303,"threshold_uncertainty_score":0.027767062},"labels":[],"label_agreement":null},{"id":"W2019579600","doi":"10.1016/j.disc.2012.02.004","title":"Lexicographic products with high reconstruction numbers","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"Université de Montréal; Université du Québec à Montréal; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada; Thompson Rivers University","keywords":"Mathematics; Combinatorics; Lexicographical order; Vertex (graph theory); Discrete mathematics; Transitive relation; Isomorphism (crystallography); Graph","score_opus":0.02913461457382612,"score_gpt":0.2732950647848496,"score_spread":0.24416045021102348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019579600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2682386,0.0017220646,0.5412582,0.0042668097,0.00068127486,0.00012566111,0.000725951,0.001468228,0.18151323],"genre_scores_gemma":[0.7749612,0.0014501697,0.16188549,0.0009794206,0.0005321708,0.00016945391,0.00080505584,0.00114198,0.058075126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985123,0.0005106444,0.00007571696,0.0002443276,0.00044750847,0.00020945937],"domain_scores_gemma":[0.9940621,0.0035170605,0.00042405358,0.001029573,0.00052908267,0.00043810738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013691235,0.0008440659,0.0010526548,0.0022818637,0.0018265698,0.004481674,0.001036693,0.001669553,0.021026881],"category_scores_gemma":[0.008454436,0.0010339598,0.00076486904,0.0021289922,0.003713124,0.007053462,0.0034022988,0.0039660544,0.0036334102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005977088,0.000016113123,0.00013737362,0.000044543045,0.000004288181,0.0000663802,0.000108867316,0.00067181606,0.00059465,0.9895398,0.0013374484,0.0074188937],"study_design_scores_gemma":[0.000012928126,0.00001586536,0.00008330052,0.000014642013,0.0000067456017,0.00018910093,0.00006112305,0.003235026,0.0012568835,0.991347,0.0037665735,0.000010807861],"about_ca_topic_score_codex":0.0003357769,"about_ca_topic_score_gemma":0.00048898126,"teacher_disagreement_score":0.021026881,"about_ca_system_score_codex":0.0009050239,"about_ca_system_score_gemma":0.00055988063,"threshold_uncertainty_score":0.070341945},"labels":[],"label_agreement":null},{"id":"W2020871539","doi":"10.1016/j.laa.2006.03.017","title":"Extremal rays and duals for cones of positive definite matrices with prescribed zeros","year":2006,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Dual polyhedron; Positive-definite matrix; Graph; Discrete mathematics; Eigenvalues and eigenvectors","score_opus":0.02087046276068757,"score_gpt":0.271801383474231,"score_spread":0.25093092071354345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020871539","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.484482,0.0012726341,0.4376419,0.0014965513,0.00037552984,0.0001471063,0.000737672,0.00034120458,0.07350538],"genre_scores_gemma":[0.9151109,0.0009859328,0.05558715,0.00032338005,0.0004359693,0.00019728011,0.0006636422,0.000277819,0.026418086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993518,0.00018675225,0.00002734682,0.000107473155,0.00020752635,0.00011909896],"domain_scores_gemma":[0.99818367,0.00061973976,0.00032442715,0.00007861926,0.00032274774,0.00047088318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010695593,0.0010861042,0.0008576146,0.0028617843,0.001471416,0.004183187,0.0014325706,0.0012387855,0.0059398077],"category_scores_gemma":[0.003573418,0.0007343612,0.0007899465,0.0009715863,0.0029944314,0.0031049424,0.0017898192,0.00311042,0.0007017366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050330455,0.00002137788,0.00017258637,0.000028300028,0.000005553248,0.000057575468,0.000101716956,0.0016996851,0.00093709,0.9935446,0.0008969101,0.00248449],"study_design_scores_gemma":[0.000024549878,0.000029314095,0.00029088283,0.000030892188,0.000006658527,0.00010976627,0.00018264072,0.028431285,0.0005938811,0.9687386,0.0015387189,0.000022820957],"about_ca_topic_score_codex":0.0009753652,"about_ca_topic_score_gemma":0.0010302853,"teacher_disagreement_score":0.0059398077,"about_ca_system_score_codex":0.0011957341,"about_ca_system_score_gemma":0.00068421045,"threshold_uncertainty_score":0.019870639},"labels":[],"label_agreement":null},{"id":"W2021533461","doi":"10.1016/j.dam.2009.06.023","title":"Bounds on the index of the signless Laplacian of a graph","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":50,"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); Adjacency matrix; Diagonal matrix; Distance matrix; Simple graph; Bound graph; Degree matrix; Graph; Diagonal; Connectivity; Upper and lower bounds; Laplacian matrix; Laplace operator; Discrete mathematics; Graph power; Line graph","score_opus":0.026193188572908404,"score_gpt":0.2752893651765035,"score_spread":0.2490961766035951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021533461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29153228,0.01018276,0.48038083,0.011547163,0.002072798,0.00009640238,0.0013016829,0.001493395,0.20139271],"genre_scores_gemma":[0.9119196,0.005788569,0.052241992,0.0012388568,0.0026775477,0.00026137807,0.0009899816,0.0010970824,0.02378502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982797,0.00039923948,0.00008304537,0.00031226015,0.00067455845,0.00025128236],"domain_scores_gemma":[0.9743395,0.01735566,0.0015057676,0.0019848477,0.002138548,0.0026756183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032940046,0.0020935496,0.0019410519,0.0050974456,0.001576047,0.004768852,0.004360334,0.0023465625,0.007350745],"category_scores_gemma":[0.02443576,0.0007706055,0.0011237314,0.0025317362,0.004756191,0.0095987255,0.004195202,0.0072720936,0.0017301101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043211615,0.0001475605,0.0016480058,0.0003534048,0.00006583222,0.00030799772,0.00045426437,0.017602352,0.010666504,0.93837047,0.009318514,0.020632962],"study_design_scores_gemma":[0.00003173397,0.000080196674,0.0011489431,0.00012226726,0.0000632619,0.00030533326,0.00011028243,0.11413782,0.0028280334,0.8773068,0.0038036122,0.00006162858],"about_ca_topic_score_codex":0.00073767005,"about_ca_topic_score_gemma":0.0011248951,"teacher_disagreement_score":0.007350745,"about_ca_system_score_codex":0.0031812477,"about_ca_system_score_gemma":0.0011616047,"threshold_uncertainty_score":0.024590671},"labels":[],"label_agreement":null},{"id":"W2022838882","doi":"10.1016/j.jcta.2004.11.004","title":"Sieve methods in combinatorics","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Graph theory and applications","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Queen's University","keywords":"Sieve (category theory); Combinatorics; Bipartite graph; Mathematics; Vertex (graph theory); Abelian group; Interpretation (philosophy); Context (archaeology); Simple (philosophy); Discrete mathematics; Computer science; Graph; Geography","score_opus":0.03187556135946576,"score_gpt":0.37317404036418095,"score_spread":0.3412984790047152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022838882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025983468,0.019555027,0.7879161,0.006486108,0.0024583545,0.000085006875,0.00030411998,0.0009661605,0.15624562],"genre_scores_gemma":[0.4174387,0.027713602,0.32467788,0.0027843204,0.006238319,0.0006021972,0.00074902247,0.0017594929,0.21803649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987808,0.0005252481,0.000050874838,0.00016402955,0.00039349395,0.000085624684],"domain_scores_gemma":[0.99677724,0.0020398996,0.00012915414,0.0005451342,0.0003329194,0.00017559838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019863946,0.0016504421,0.002321388,0.006474765,0.0021672556,0.004400255,0.0022207375,0.0020806289,0.016058534],"category_scores_gemma":[0.0067316564,0.0013895498,0.0014955257,0.00580489,0.005373012,0.008386939,0.0030820507,0.008030346,0.0041865315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010375603,0.000025859958,0.000081597296,0.00006904727,0.000014056906,0.000012140239,0.00009022622,0.00084844325,0.0001706995,0.9741149,0.0036515913,0.020910967],"study_design_scores_gemma":[0.0000070359442,0.0000043990153,0.000053307616,0.000029895878,0.0000067626534,0.000027663673,0.000021850525,0.0039432277,0.00012534061,0.98519856,0.010574868,0.0000071230857],"about_ca_topic_score_codex":0.0008614135,"about_ca_topic_score_gemma":0.0015430386,"teacher_disagreement_score":0.016058534,"about_ca_system_score_codex":0.0015756359,"about_ca_system_score_gemma":0.0008746944,"threshold_uncertainty_score":0.05372113},"labels":[],"label_agreement":null},{"id":"W2023058821","doi":"10.1016/j.disopt.2009.05.003","title":"Chip firing and all-terminal network reliability bounds","year":2009,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Graph theory and applications","field":"Mathematics","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":"Dalhousie University","funders":"","keywords":"Reliability (semiconductor); Bounding overwatch; Terminal (telecommunication); Computer science; Chip; Reliability theory; Graph; Mathematics; Graph theory; Reliability engineering; Algorithm; Combinatorics; Theoretical computer science; Failure rate; Engineering; Statistics; Computer network; Artificial intelligence","score_opus":0.02141643991881777,"score_gpt":0.3003653373785734,"score_spread":0.27894889745975565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023058821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097677425,0.0018411139,0.8602396,0.0011125539,0.0002365346,0.00004560087,0.00027483224,0.00045165923,0.03812062],"genre_scores_gemma":[0.91445863,0.0018105318,0.069293976,0.00032600752,0.00017339493,0.00012188646,0.00024297436,0.0004322392,0.013140322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988212,0.00034160702,0.00003898093,0.0002195411,0.00035824458,0.00022038566],"domain_scores_gemma":[0.9883084,0.007878407,0.0008062187,0.0013115546,0.0011257149,0.0005696989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031172761,0.0014874373,0.0015581249,0.0013801825,0.0009759853,0.0018659321,0.0033274624,0.0014110537,0.007827712],"category_scores_gemma":[0.016026516,0.00072139606,0.0012249757,0.0013856166,0.002030272,0.004179969,0.002267853,0.00391606,0.0007899089],"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.00023560105,0.0000718122,0.00063483807,0.00017987867,0.000059289636,0.00010828902,0.0001347716,0.6215197,0.0034833665,0.3490681,0.003242963,0.021261452],"study_design_scores_gemma":[0.00001336506,0.000051162224,0.00043494796,0.00006183118,0.000050522984,0.00007586872,0.000040114897,0.7364299,0.0030905604,0.25866482,0.0010638513,0.000023008888],"about_ca_topic_score_codex":0.0017711165,"about_ca_topic_score_gemma":0.0023657482,"teacher_disagreement_score":0.007827712,"about_ca_system_score_codex":0.0019452409,"about_ca_system_score_gemma":0.0011209623,"threshold_uncertainty_score":0.026186287},"labels":[],"label_agreement":null},{"id":"W2023708440","doi":"10.1090/s0002-9947-2014-06255-7","title":"The non-backtracking spectrum of the universal cover of a graph","year":2014,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Graph theory and applications","field":"Mathematics","cited_by":79,"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 British Columbia","funders":"","keywords":"Algorithm; Annotation; Computer science; Backtracking; Artificial intelligence; Mathematics","score_opus":0.011112377556586511,"score_gpt":0.25514914023637586,"score_spread":0.24403676267978935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023708440","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77946705,0.00044593503,0.16212879,0.000468773,0.00010190412,0.000052530937,0.00086323277,0.0010781363,0.05539363],"genre_scores_gemma":[0.96202755,0.00026276612,0.024627984,0.00015113063,0.00008063091,0.000099421755,0.00076736894,0.00034825248,0.01163495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908566,0.00012291774,0.00004466542,0.00028743176,0.0002256792,0.0002336202],"domain_scores_gemma":[0.99824643,0.00078454445,0.00018664409,0.0002494534,0.00022371589,0.00030931615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033974994,0.00044904783,0.00049231446,0.0024665827,0.0016048957,0.0019754064,0.00066905614,0.0007933714,0.009138422],"category_scores_gemma":[0.0026176425,0.00040646456,0.0005909458,0.0013663144,0.0016835427,0.0026403114,0.0012750578,0.00072317885,0.001344496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001583024,0.000043329543,0.0017377556,0.0001078481,0.000022007842,0.00057818694,0.0012807713,0.005785339,0.010365268,0.94307715,0.004038571,0.03280542],"study_design_scores_gemma":[0.000025429528,0.000059814167,0.0023244538,0.00008374792,0.000026105665,0.00060023676,0.0004863198,0.05761291,0.0057255365,0.9229139,0.010105073,0.00003639976],"about_ca_topic_score_codex":0.0024477374,"about_ca_topic_score_gemma":0.0018570086,"teacher_disagreement_score":0.009138422,"about_ca_system_score_codex":0.0010622512,"about_ca_system_score_gemma":0.00043887485,"threshold_uncertainty_score":0.030571103},"labels":[],"label_agreement":null},{"id":"W2024330321","doi":"10.1016/j.jctb.2004.06.001","title":"A lower bound on the spectral radius of the universal cover of a graph","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Upper and lower bounds; Spectral radius; Graph; Degree (music); Discrete mathematics; Eigenvalues and eigenvectors; Mathematical analysis; Physics; Quantum mechanics","score_opus":0.01405184898505722,"score_gpt":0.24715537593247017,"score_spread":0.23310352694741296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024330321","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39484793,0.024003495,0.41029993,0.010880277,0.0013475248,0.0001991203,0.0026206665,0.003449497,0.15235156],"genre_scores_gemma":[0.90876675,0.0074878465,0.06369838,0.0013749101,0.0023154195,0.0003213394,0.0016890672,0.0013233608,0.013022869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99546635,0.0012002353,0.00019397991,0.0011291022,0.0011868762,0.0008233495],"domain_scores_gemma":[0.9558459,0.035033125,0.0013572609,0.0035519549,0.0015743158,0.002637475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030773953,0.002765128,0.004286811,0.00521004,0.0027767469,0.005682581,0.0049773925,0.004255264,0.012411956],"category_scores_gemma":[0.031054683,0.0018345253,0.0020330623,0.0032864737,0.004514335,0.010778232,0.0065502436,0.0059090466,0.0032241005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016781661,0.0003656805,0.0050440067,0.00158375,0.00046540677,0.0008650742,0.0013235452,0.09056888,0.03990334,0.74971086,0.02958752,0.07890372],"study_design_scores_gemma":[0.00008356717,0.00028809207,0.0038366239,0.00037019476,0.00035251104,0.0016036872,0.0004264969,0.3453203,0.013987606,0.61467624,0.018864756,0.00018982097],"about_ca_topic_score_codex":0.0012070748,"about_ca_topic_score_gemma":0.0011622322,"teacher_disagreement_score":0.012411956,"about_ca_system_score_codex":0.0024875742,"about_ca_system_score_gemma":0.00078053924,"threshold_uncertainty_score":0.041522145},"labels":[],"label_agreement":null},{"id":"W2026427480","doi":"10.1016/s0024-3795(02)00324-5","title":"Some results on graph spectra","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":80,"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":"Eigenvalues and eigenvectors; Mathematics; Graph; Combinatorics; Spectrum of a matrix; Matrix differential equation; Complement (music); Discrete mathematics; Mathematical analysis; Chemistry","score_opus":0.042263211883094,"score_gpt":0.28462389173337843,"score_spread":0.24236067985028442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026427480","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11495928,0.03146987,0.27522328,0.020118164,0.005181443,0.00013247812,0.001966925,0.0013005056,0.5496481],"genre_scores_gemma":[0.7225776,0.03225862,0.07200035,0.009622599,0.012026053,0.00037741652,0.0024181004,0.0013290676,0.14739026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911743,0.00019939085,0.000044678087,0.0002470562,0.00027424662,0.000117172356],"domain_scores_gemma":[0.9981394,0.0009796651,0.00015283731,0.00021301699,0.0002359217,0.000279188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010234996,0.001748216,0.001957314,0.0070312144,0.0037060871,0.0036117071,0.0020593097,0.0016535423,0.020211726],"category_scores_gemma":[0.0030693205,0.0009245626,0.0020545167,0.010570474,0.0038065044,0.009353796,0.0033886638,0.005687449,0.0035589442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002465907,0.00003904298,0.00009113598,0.00016322051,0.000017762293,0.00006976612,0.00026366572,0.00054327794,0.0006278963,0.9782783,0.007832448,0.01204896],"study_design_scores_gemma":[0.0000070505953,0.00000755098,0.00014589619,0.000020350506,0.00001730005,0.000069153684,0.00006897861,0.00087133044,0.00021851853,0.9900163,0.008546429,0.000011181315],"about_ca_topic_score_codex":0.0012824031,"about_ca_topic_score_gemma":0.0013002179,"teacher_disagreement_score":0.020211726,"about_ca_system_score_codex":0.0016960058,"about_ca_system_score_gemma":0.0006548392,"threshold_uncertainty_score":0.06761497},"labels":[],"label_agreement":null},{"id":"W2028030466","doi":"10.1016/s0024-3795(01)00396-2","title":"Circulant graphs with det(−A(G))=−deg(G): codeterminants with Kn","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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 Manitoba","funders":"","keywords":"Circulant matrix; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.03400820253464061,"score_gpt":0.2623934349513705,"score_spread":0.22838523241672992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028030466","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.8271734,0.0005355275,0.0852281,0.0024402626,0.00040429688,0.00010727616,0.00064932107,0.0005485153,0.0829133],"genre_scores_gemma":[0.96358705,0.00031825202,0.015904121,0.00041623556,0.00019483747,0.000095321666,0.00029041414,0.00021412449,0.01897969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894315,0.00026539052,0.00004100283,0.0002012656,0.0002907801,0.00025843777],"domain_scores_gemma":[0.99313414,0.0037783904,0.00092888135,0.0006446208,0.0007275246,0.0007864241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008061946,0.0006559885,0.00068118796,0.0014429339,0.0023167469,0.0023894235,0.001130877,0.001615745,0.004865385],"category_scores_gemma":[0.006269858,0.0004921873,0.0004730645,0.0015428822,0.0021759535,0.0021687152,0.0015142217,0.002159661,0.0006760178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018992991,0.00008883712,0.0008219465,0.00007560302,0.000012390182,0.0006486632,0.0004472299,0.0036737674,0.005902106,0.971796,0.0065170466,0.009826516],"study_design_scores_gemma":[0.00005288248,0.00003818089,0.0010226865,0.000024979747,0.000016535485,0.00074651855,0.00015102678,0.035546437,0.004530777,0.95287573,0.004942975,0.00005124397],"about_ca_topic_score_codex":0.002335826,"about_ca_topic_score_gemma":0.0038915977,"teacher_disagreement_score":0.004865385,"about_ca_system_score_codex":0.0012124665,"about_ca_system_score_gemma":0.0011223209,"threshold_uncertainty_score":0.0162763},"labels":[],"label_agreement":null},{"id":"W2030421585","doi":"10.1016/s0024-3795(00)00305-0","title":"Optimizing quadratic forms of adjacency matrices of trees and related eigenvalue problems","year":2001,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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":"University of Victoria","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Combinatorics; Permutation matrix; Adjacency matrix; Diagonal; Matrix (chemical analysis); Diagonal matrix; Quadratic equation; Tree (set theory); Permutation (music); Discrete mathematics; Circulant matrix; Graph","score_opus":0.025068480786889346,"score_gpt":0.28083698183251354,"score_spread":0.2557685010456242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030421585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13865174,0.0006301068,0.84209454,0.0015309098,0.00014746735,0.000111835274,0.00023160744,0.00024378316,0.01635804],"genre_scores_gemma":[0.7938565,0.001005743,0.17060089,0.0005168289,0.00038613018,0.0003471859,0.00053171645,0.0006714533,0.032083582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871933,0.0006031278,0.00003720832,0.00026892812,0.00022860407,0.00014280583],"domain_scores_gemma":[0.9940924,0.0041521816,0.00048264023,0.00029998037,0.0005446176,0.00042812192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021786978,0.0011373,0.0013896709,0.0011506567,0.00090043934,0.0022629513,0.0021048947,0.0020084756,0.006156116],"category_scores_gemma":[0.013001961,0.0011779065,0.0006591185,0.0016270996,0.002209035,0.004852013,0.0020557784,0.002142765,0.0007390283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011273549,0.00022499789,0.0007331492,0.00021217926,0.00004301189,0.0000826977,0.00028860808,0.3944614,0.0027916527,0.5591841,0.0071793185,0.03468617],"study_design_scores_gemma":[0.000017025926,0.000033888755,0.00021309147,0.000010523667,0.000006334849,0.000028241517,0.000067331785,0.46711016,0.0004491732,0.53139836,0.00064863905,0.000017184504],"about_ca_topic_score_codex":0.0022307956,"about_ca_topic_score_gemma":0.0040382463,"teacher_disagreement_score":0.006156116,"about_ca_system_score_codex":0.0013866257,"about_ca_system_score_gemma":0.0013058151,"threshold_uncertainty_score":0.02059424},"labels":[],"label_agreement":null},{"id":"W2031324894","doi":"10.1016/j.laa.2013.02.030","title":"Two Laplacians for the distance matrix of a graph","year":2013,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":252,"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":"Algebraic connectivity; Resistance distance; Mathematics; Laplacian matrix; Distance matrix; Combinatorics; Laplace operator; Eigenvalues and eigenvectors; Connectivity; Graph; Discrete mathematics; Line graph; Mathematical analysis; Graph power; Physics","score_opus":0.022185233953270583,"score_gpt":0.31440368974241084,"score_spread":0.29221845578914024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031324894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092861,0.002758989,0.84321845,0.007369868,0.0022422906,0.00011110321,0.0010238788,0.0005354827,0.049878865],"genre_scores_gemma":[0.7005479,0.0027635987,0.2151362,0.0023556442,0.0022306058,0.00034380995,0.0011735811,0.0005733624,0.07487538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897337,0.00030807068,0.000056333516,0.00027835686,0.00028290218,0.00010095811],"domain_scores_gemma":[0.99765426,0.0009913616,0.000297955,0.00022464263,0.00046609002,0.00036576882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096660183,0.00094920944,0.0006570228,0.003520368,0.0009526409,0.0028536224,0.0017117343,0.0023728928,0.011472208],"category_scores_gemma":[0.004617556,0.00031319485,0.00092569576,0.0015223222,0.0026250065,0.003796356,0.0015460299,0.0030789769,0.001967136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027305588,0.000032019238,0.00015551604,0.00005165138,0.000011121763,0.00008422778,0.00027172628,0.0014699879,0.0023120434,0.9793601,0.0033239522,0.012900518],"study_design_scores_gemma":[0.0000102873155,0.000026279857,0.00034858493,0.00002060899,0.00000876629,0.00030337763,0.00017767507,0.020519048,0.0006594414,0.9699724,0.007901069,0.00005250638],"about_ca_topic_score_codex":0.00086609815,"about_ca_topic_score_gemma":0.0010122741,"teacher_disagreement_score":0.011472208,"about_ca_system_score_codex":0.0011549481,"about_ca_system_score_gemma":0.00064112793,"threshold_uncertainty_score":0.0383783},"labels":[],"label_agreement":null},{"id":"W2033906420","doi":"10.1016/j.laa.2006.10.017","title":"On unimodular graphs","year":2006,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":43,"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; Sharif University of Technology","keywords":"Unimodular matrix; Mathematics; Combinatorics; Adjacency matrix; Bipartite graph; Adjacency list; Discrete mathematics; Inverse; Matching (statistics); Indifference graph; Cograph; Chordal graph; Graph; 1-planar graph","score_opus":0.016878468431228116,"score_gpt":0.27322458552595175,"score_spread":0.25634611709472366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033906420","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33636814,0.0066264016,0.30668205,0.009444144,0.0011214651,0.000113687856,0.0015192877,0.0007110094,0.33741385],"genre_scores_gemma":[0.8333815,0.004791522,0.043283,0.0023846703,0.0018806051,0.00020537977,0.0012696083,0.0003629806,0.112440675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892056,0.00034270316,0.000036402453,0.0002723106,0.0002517729,0.00017626588],"domain_scores_gemma":[0.99703896,0.0014629526,0.00047246896,0.00029134145,0.0003307312,0.00040356896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008570738,0.0011094322,0.0014808401,0.0037837534,0.0027303514,0.0035119974,0.0020405613,0.0012039887,0.01645586],"category_scores_gemma":[0.0036356046,0.0006973642,0.0009500056,0.005106139,0.0030909935,0.008193767,0.0035414149,0.0036216031,0.0019661065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016045165,0.000022066544,0.00008079192,0.000038186266,0.000004428727,0.000028131475,0.00013889067,0.00053795957,0.0002274634,0.98917294,0.002253643,0.0074794176],"study_design_scores_gemma":[0.0000029423109,0.0000034128802,0.00006213414,0.000008147483,0.0000032573198,0.00003045809,0.000043919415,0.0017381263,0.00008798693,0.9963898,0.0016253527,0.000004396428],"about_ca_topic_score_codex":0.001685919,"about_ca_topic_score_gemma":0.0020382758,"teacher_disagreement_score":0.01645586,"about_ca_system_score_codex":0.0019132766,"about_ca_system_score_gemma":0.0006929738,"threshold_uncertainty_score":0.055050313},"labels":[],"label_agreement":null},{"id":"W2033916628","doi":"10.2298/aadm120127003f","title":"Edge bipartiteness and signless Laplacian spread of graphs","year":2012,"lang":"en","type":"article","venue":"Applicable Analysis and Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":15,"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":"Specialized Research Fund for the Doctoral Program of Higher Education of China; Program for New Century Excellent Talents in University; National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Conjecture; Graph; Connectivity; Eigenvalues and eigenvectors; Laplace operator; Discrete mathematics; Physics","score_opus":0.026743219940791204,"score_gpt":0.2952904471795929,"score_spread":0.2685472272388017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033916628","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93133396,0.0002845381,0.05834321,0.00041604938,0.000016050995,0.000014090985,0.00013446219,0.00009790863,0.009359585],"genre_scores_gemma":[0.99441177,0.00015234205,0.004067533,0.00004958763,0.000041449763,0.000017485561,0.000112379275,0.000018673289,0.0011287433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961686,0.00010355948,0.000014243496,0.00008208606,0.00012238498,0.00006082713],"domain_scores_gemma":[0.9965618,0.0019116529,0.00052868546,0.00024115285,0.0003275262,0.00042922347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000516121,0.00038067976,0.0003561869,0.0018587232,0.00054782536,0.0010067837,0.00068515365,0.00057427224,0.0023768602],"category_scores_gemma":[0.005108732,0.0002656603,0.00023351895,0.00093881745,0.0019301744,0.0017070294,0.0009849215,0.0008613257,0.00025864135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046963987,0.00017550249,0.012403514,0.00019683632,0.00007970674,0.0007594578,0.0010441872,0.039721727,0.055798363,0.8464584,0.0031729594,0.039719805],"study_design_scores_gemma":[0.000050438473,0.00009030352,0.008464244,0.0000330653,0.00002781816,0.000591421,0.0003069655,0.11151612,0.0063849078,0.8711332,0.0013674616,0.000034005017],"about_ca_topic_score_codex":0.0004600642,"about_ca_topic_score_gemma":0.00049336295,"teacher_disagreement_score":0.0023768602,"about_ca_system_score_codex":0.00039618713,"about_ca_system_score_gemma":0.00022449812,"threshold_uncertainty_score":0.007951379},"labels":[],"label_agreement":null},{"id":"W2035544447","doi":"10.1016/s0024-3795(02)00386-5","title":"Computers and discovery in algebraic graph theory","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":17,"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","funders":"","keywords":"Mathematics; Algebraic number; Graph; Graph theory; Discrete mathematics; Algebra over a field; Combinatorics; Pure mathematics","score_opus":0.026762848453671335,"score_gpt":0.26490616098542347,"score_spread":0.23814331253175214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035544447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14029454,0.17708167,0.42101705,0.063986994,0.002833851,0.00015880038,0.0008700523,0.0008778434,0.19287924],"genre_scores_gemma":[0.8513512,0.04544152,0.070594996,0.0026105072,0.005145581,0.0002790501,0.0005206396,0.00013963522,0.023916751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99862325,0.0006182862,0.00006775573,0.00028383438,0.0002995705,0.000107331536],"domain_scores_gemma":[0.9871775,0.011072655,0.00039548596,0.000620743,0.00045136377,0.0002822933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016802674,0.00077394635,0.0020725352,0.00506503,0.0029919911,0.0068297065,0.0017505409,0.0028341424,0.0054011233],"category_scores_gemma":[0.0080575235,0.00089675555,0.0011710314,0.008265405,0.013820208,0.015972434,0.0027072486,0.0054518157,0.00063619396],"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.00000501488,0.0000073626634,0.00007796844,0.00005653676,0.000004884091,0.000016405504,0.00013639082,0.000574132,0.000035686615,0.99485695,0.0009307617,0.003297982],"study_design_scores_gemma":[0.000002838177,0.0000013213698,0.000025406787,0.000007641921,0.0000023676027,0.000012914516,0.000026881327,0.00091077667,0.000028028127,0.9970193,0.001959575,0.000002954422],"about_ca_topic_score_codex":0.0035313312,"about_ca_topic_score_gemma":0.0023982113,"teacher_disagreement_score":0.0068297065,"about_ca_system_score_codex":0.003429164,"about_ca_system_score_gemma":0.0014900316,"threshold_uncertainty_score":0.02488041},"labels":[],"label_agreement":null},{"id":"W2036495097","doi":"10.1016/j.laa.2008.04.031","title":"On acyclic and unicyclic graphs whose minimum rank equals the diameter","year":2008,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":11,"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","funders":"","keywords":"Mathematics; Combinatorics; Rank (graph theory); Graph; Discrete mathematics","score_opus":0.04379135326752401,"score_gpt":0.2986209952555503,"score_spread":0.25482964198802627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036495097","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7777884,0.0038797637,0.13145481,0.0039252723,0.00029494596,0.000071706054,0.0016561568,0.00052275206,0.08040622],"genre_scores_gemma":[0.9575154,0.0029081837,0.020035302,0.00044153532,0.00090329547,0.00010263757,0.0010227442,0.00016603494,0.016904792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991359,0.00030110806,0.000043287364,0.00018913868,0.00016932162,0.00016121658],"domain_scores_gemma":[0.9905323,0.0057838974,0.001813824,0.00051453523,0.0005176177,0.0008377561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010430814,0.0009855918,0.0015924149,0.0036999525,0.0016093885,0.0027782314,0.0014283261,0.00136746,0.00609777],"category_scores_gemma":[0.007510279,0.00074951607,0.0006702907,0.0031102218,0.0031360325,0.005480709,0.0017011127,0.001667556,0.0006685258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023108165,0.00006493624,0.0009306163,0.0002050709,0.000025482901,0.00017695659,0.00055096933,0.01112336,0.003272981,0.9634995,0.0048492257,0.015069869],"study_design_scores_gemma":[0.000032865486,0.000034505527,0.00066251814,0.0000419603,0.000021471096,0.00022360405,0.00023927612,0.022697335,0.00078894367,0.97323674,0.0019913043,0.000029489609],"about_ca_topic_score_codex":0.0014710488,"about_ca_topic_score_gemma":0.0018799253,"teacher_disagreement_score":0.00609777,"about_ca_system_score_codex":0.0013020812,"about_ca_system_score_gemma":0.0006169751,"threshold_uncertainty_score":0.020399034},"labels":[],"label_agreement":null},{"id":"W2037123085","doi":"10.1016/j.disc.2004.02.024","title":"A characterization of pancyclic complements of line graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","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 Lethbridge","funders":"","keywords":"Mathematics; Combinatorics; Characterization (materials science); Line (geometry); Pancyclic graph; Discrete mathematics; Graph; Chordal graph; 1-planar graph; Physics; Geometry","score_opus":0.044991997299765475,"score_gpt":0.324081271733818,"score_spread":0.2790892744340525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037123085","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6871216,0.00087175105,0.15767471,0.0018139117,0.00021443663,0.0001950253,0.0026652568,0.00039550578,0.14904782],"genre_scores_gemma":[0.9466206,0.00089554244,0.031558137,0.00043589284,0.00031132257,0.00015263938,0.0025450066,0.00020192911,0.017278884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992914,0.000119364646,0.000036779893,0.00018761332,0.00023648767,0.00012833258],"domain_scores_gemma":[0.9951368,0.0021403434,0.0008939624,0.00037755552,0.0008301363,0.0006211945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046771174,0.00064854196,0.0008342238,0.0029840174,0.0016905586,0.0037648645,0.0013923807,0.0010589337,0.01378482],"category_scores_gemma":[0.0041169673,0.00065885,0.000644428,0.0035096032,0.002194646,0.0045937067,0.0019680227,0.0025374661,0.0012791357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001889767,0.00006972634,0.0015418822,0.0001398507,0.000022276867,0.00033810982,0.00055448397,0.0025924854,0.0049368795,0.9656038,0.006433602,0.01757794],"study_design_scores_gemma":[0.00004211678,0.00011650674,0.0024180536,0.00008901119,0.000056696757,0.0014618158,0.0008152701,0.029043762,0.004502931,0.9348831,0.02652391,0.00004679234],"about_ca_topic_score_codex":0.0011398646,"about_ca_topic_score_gemma":0.0010496721,"teacher_disagreement_score":0.01378482,"about_ca_system_score_codex":0.0010512397,"about_ca_system_score_gemma":0.0005368712,"threshold_uncertainty_score":0.046114862},"labels":[],"label_agreement":null},{"id":"W2037517065","doi":"10.4153/cmb-2009-015-8","title":"The Erdős–Rado Arrow for Singular Cardinals","year":2009,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arrow; Combinatorics; Discrete mathematics; Computer science","score_opus":0.029430906505137428,"score_gpt":0.2912048557937528,"score_spread":0.2617739492886154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037517065","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3295706,0.0035807746,0.2707591,0.0065458175,0.000824406,0.00009503073,0.0007054178,0.0010023739,0.38691646],"genre_scores_gemma":[0.93388844,0.0012806995,0.036182985,0.000659447,0.0004264667,0.000061118626,0.0001881199,0.00016583325,0.027146824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807054,0.00044592025,0.00014006035,0.0004930312,0.0005085672,0.0003419987],"domain_scores_gemma":[0.99646324,0.0016053726,0.00029201581,0.0005152957,0.0006591771,0.00046496122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028966488,0.00039842058,0.0009293601,0.003714433,0.0049031344,0.0041538286,0.0006462975,0.0011748044,0.006479104],"category_scores_gemma":[0.004162805,0.00053161965,0.0011041231,0.0017646371,0.0076779155,0.009866393,0.00426605,0.0030844794,0.0011323165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015887757,0.0000036350948,0.00011509174,0.000015975591,0.0000021941867,0.000032871885,0.0001624195,0.00011312871,0.0002919341,0.9973793,0.00033961036,0.0015279851],"study_design_scores_gemma":[0.000013116876,0.000009885173,0.0002845068,0.000028423521,0.000013656052,0.00008832323,0.00017914672,0.0009715644,0.0004706073,0.9875852,0.0103400005,0.00001558525],"about_ca_topic_score_codex":0.003707304,"about_ca_topic_score_gemma":0.0033993153,"teacher_disagreement_score":0.006479104,"about_ca_system_score_codex":0.0026674161,"about_ca_system_score_gemma":0.000924062,"threshold_uncertainty_score":0.021674812},"labels":[],"label_agreement":null},{"id":"W2038467436","doi":"10.1016/j.disc.2009.01.001","title":"Hamiltonian cycles in <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:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mi>c</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-circulant digraphs","year":2009,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"University of Lethbridge","funders":"","keywords":"Computer science; Mathematics; Algorithm","score_opus":0.01930495299547091,"score_gpt":0.2547848728405514,"score_spread":0.2354799198450805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038467436","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026370622,0.0022579792,0.2705834,0.003318641,0.002087941,0.00045146406,0.0378399,0.010335569,0.6467545],"genre_scores_gemma":[0.26131496,0.0034317654,0.11189988,0.0017933632,0.000490659,0.00054281484,0.050396513,0.0055133635,0.5646167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99981123,0.000030283047,0.000010578368,0.000049399543,0.000060913968,0.000037602917],"domain_scores_gemma":[0.9995665,0.00013056275,0.00004117576,0.00007132101,0.00014228179,0.00004807649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015792745,0.00051044935,0.00039830475,0.0012752868,0.0009773783,0.0020236261,0.0007308191,0.00059331243,0.15654945],"category_scores_gemma":[0.0012897847,0.00039251594,0.00041329148,0.0019396454,0.0003708763,0.0016361644,0.00062512053,0.0008936879,0.036607128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008320005,0.00006961111,0.00034319385,0.0003749289,0.00002186437,0.0002552073,0.00030158897,0.0020401168,0.003800357,0.5998314,0.31805024,0.074828245],"study_design_scores_gemma":[0.0000498025,0.000025018688,0.0007513355,0.00009602047,0.000022284978,0.00035561487,0.00015207264,0.0070288545,0.005707659,0.26891026,0.71685535,0.000045745124],"about_ca_topic_score_codex":0.006174092,"about_ca_topic_score_gemma":0.009431236,"teacher_disagreement_score":0.15654945,"about_ca_system_score_codex":0.0012280208,"about_ca_system_score_gemma":0.00089894567,"threshold_uncertainty_score":0.52371013},"labels":[],"label_agreement":null},{"id":"W2038617524","doi":"10.1016/j.jctb.2014.12.001","title":"Median eigenvalues and the HOMO–LUMO index of graphs","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":30,"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":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Eigenvalues and eigenvectors; Mathematics; Combinatorics; Degree (music); Value (mathematics); Graph; Upper and lower bounds; Index (typography); HOMO/LUMO; Discrete mathematics; Statistics; Computer science; Physics; Quantum mechanics; Mathematical analysis","score_opus":0.010615521027517765,"score_gpt":0.2549073723640302,"score_spread":0.24429185133651246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038617524","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8691614,0.0009299239,0.08357291,0.0011217002,0.00015998233,0.00002160569,0.00046692978,0.0002998026,0.04426577],"genre_scores_gemma":[0.9903122,0.00025331782,0.005971865,0.00007897406,0.000182049,0.000024035544,0.00013782519,0.000051320785,0.002988422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996724,0.00007957261,0.00001392085,0.00006947937,0.000098040124,0.00006655671],"domain_scores_gemma":[0.9973138,0.0013071183,0.00051682844,0.00018832262,0.00022194398,0.0004519247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062649325,0.00038292055,0.00064134615,0.003539845,0.0010549749,0.003018865,0.00071126013,0.0008234505,0.006039645],"category_scores_gemma":[0.0042312094,0.00033055965,0.00025345004,0.0012955712,0.00206434,0.0027788496,0.0009701239,0.0009341114,0.00064009946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024542896,0.000098328106,0.00456482,0.00008814402,0.000031928306,0.00018667565,0.0004806432,0.0119825695,0.008483772,0.9437457,0.004014041,0.026078029],"study_design_scores_gemma":[0.000018222594,0.000023719693,0.0032491859,0.000022968788,0.000008497981,0.00016859488,0.00024803425,0.037463732,0.0012478563,0.9561755,0.0013482677,0.0000254219],"about_ca_topic_score_codex":0.0004129339,"about_ca_topic_score_gemma":0.0005336079,"teacher_disagreement_score":0.006039645,"about_ca_system_score_codex":0.0007874802,"about_ca_system_score_gemma":0.0003127136,"threshold_uncertainty_score":0.020204663},"labels":[],"label_agreement":null},{"id":"W2040426893","doi":"10.1556/sscmath.42.2005.3.3","title":"Partitioning a graph into vertex-disjoint paths","year":2005,"lang":"en","type":"article","venue":"Studia Scientiarum Mathematicarum Hungarica","topic":"Graph theory and applications","field":"Mathematics","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":"McMaster University","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Vertex (graph theory); Graph; Discrete mathematics; Integer (computer science); Computer science","score_opus":0.027838790009534223,"score_gpt":0.304229183738962,"score_spread":0.2763903937294278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040426893","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52303386,0.00098473,0.46339846,0.0006990387,0.00006509459,0.00032910416,0.0006351192,0.00027618633,0.010578384],"genre_scores_gemma":[0.67807424,0.00085331214,0.31508136,0.00012805592,0.000052144467,0.00020552638,0.0009946965,0.00008942464,0.0045212833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891007,0.00030821512,0.000079991085,0.00034486342,0.00012875524,0.0002281476],"domain_scores_gemma":[0.9978005,0.0011397058,0.00030947503,0.00036000702,0.00012817497,0.00026200883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000872321,0.0006291826,0.0007608152,0.0010500721,0.0015487699,0.0011056494,0.0010708587,0.0009908128,0.002734521],"category_scores_gemma":[0.005012857,0.00054496125,0.00052302284,0.001242208,0.0012085595,0.0033927825,0.0021361215,0.00075699604,0.00039750175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013473975,0.00028158995,0.0085852435,0.0011913175,0.000222818,0.0013896793,0.0018093075,0.22437488,0.03843114,0.48451898,0.0058227107,0.23202498],"study_design_scores_gemma":[0.00013542415,0.0003841728,0.0023788372,0.00013444449,0.00010667565,0.0010576644,0.0014270818,0.23215516,0.012628393,0.7307064,0.018819591,0.000066179215],"about_ca_topic_score_codex":0.0010902975,"about_ca_topic_score_gemma":0.001415254,"teacher_disagreement_score":0.002734521,"about_ca_system_score_codex":0.00076352,"about_ca_system_score_gemma":0.00079445326,"threshold_uncertainty_score":0.009147882},"labels":[],"label_agreement":null},{"id":"W2040990647","doi":"10.1007/s10801-014-0558-x","title":"Median eigenvalues of bipartite graphs","year":2014,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":15,"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":"Natural Sciences and Engineering Research Council of Canada; Univerza v Ljubljani; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Combinatorics; Mathematics; Bipartite graph; Lambda; Eigenvalues and eigenvectors; Graph; Discrete mathematics","score_opus":0.024550911547216253,"score_gpt":0.290789159779188,"score_spread":0.26623824823197173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040990647","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78776443,0.00044054232,0.15964118,0.0016108535,0.0001875897,0.000045235724,0.00036238605,0.00063497346,0.049312785],"genre_scores_gemma":[0.981584,0.0001820534,0.009170494,0.00014778665,0.0001538634,0.000062007806,0.00018386521,0.00013229356,0.008383674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994191,0.00017310225,0.000020011532,0.000103235405,0.00016519878,0.00011935383],"domain_scores_gemma":[0.99619114,0.0019193094,0.00055414025,0.00025395575,0.00040294978,0.00067856815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007703773,0.0005450472,0.00086260744,0.0023125636,0.0013205437,0.002814186,0.0009325342,0.0011561303,0.010519747],"category_scores_gemma":[0.006501623,0.000575135,0.00037633156,0.00091453566,0.0019674487,0.00243942,0.0015642704,0.0013878847,0.0010353388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017605284,0.00008260366,0.0014707991,0.00006629161,0.000023676414,0.00017048759,0.00036083034,0.010837719,0.004803903,0.9666969,0.0048620105,0.010448767],"study_design_scores_gemma":[0.000027697237,0.000015099884,0.0008282008,0.000014221383,0.000005353856,0.00009737172,0.00018835701,0.037954185,0.000566418,0.9594947,0.00079175143,0.000016656366],"about_ca_topic_score_codex":0.0006869884,"about_ca_topic_score_gemma":0.00096787314,"teacher_disagreement_score":0.010519747,"about_ca_system_score_codex":0.0009164019,"about_ca_system_score_gemma":0.00045124543,"threshold_uncertainty_score":0.035192072},"labels":[],"label_agreement":null},{"id":"W2042026952","doi":"10.1109/infcomw.2010.5466694","title":"On Traffic-Aware Betweenness and Network Criticality","year":2010,"lang":"en","type":"article","venue":"","topic":"Graph theory and applications","field":"Mathematics","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":"University of Toronto","funders":"","keywords":"Betweenness centrality; Computer science; Traffic generation model; Graph theory; Network topology; Mathematical optimization; Graph; Theoretical computer science; Mathematics; Computer network; Combinatorics","score_opus":0.02720859901474,"score_gpt":0.31943711032146765,"score_spread":0.29222851130672767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042026952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09920279,0.0010966604,0.8902384,0.0005156765,0.00006724159,0.00005062392,0.0001199531,0.00010915833,0.008599614],"genre_scores_gemma":[0.9468499,0.0013425766,0.049225602,0.00011320728,0.00017633897,0.00011378136,0.0001481418,0.00013824318,0.0018923084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989575,0.00041694992,0.000040173276,0.00022138417,0.00025178774,0.0001122463],"domain_scores_gemma":[0.99132806,0.0064094793,0.0008690168,0.0003747706,0.000743759,0.00027487663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015309018,0.0012479834,0.0008259491,0.0018831714,0.00062377076,0.0013235877,0.00090240024,0.0007330809,0.001669689],"category_scores_gemma":[0.011257557,0.0003730107,0.00039989658,0.0014600591,0.002420681,0.0053408537,0.0011942954,0.0013592545,0.000150996],"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.000057025976,0.0000437911,0.0011165245,0.00011973242,0.00003596837,0.00013628462,0.00011668008,0.69894356,0.0059594247,0.27538866,0.00079874275,0.017283615],"study_design_scores_gemma":[0.000006414593,0.00006493919,0.00073839765,0.00002345589,0.000015194635,0.00015898234,0.000051179828,0.8012194,0.0020624213,0.19430631,0.0013292704,0.000023993955],"about_ca_topic_score_codex":0.00091162906,"about_ca_topic_score_gemma":0.000748749,"teacher_disagreement_score":0.0018831714,"about_ca_system_score_codex":0.001401064,"about_ca_system_score_gemma":0.00058971136,"threshold_uncertainty_score":0.010165513},"labels":[],"label_agreement":null},{"id":"W2042309759","doi":"10.1016/s0024-3795(01)00312-3","title":"On graphs with equal algebraic and vertex connectivity","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":76,"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","funders":"","keywords":"Combinatorics; Mathematics; Algebraic connectivity; Vertex (graph theory); Upper and lower bounds; Algebraic number; Connectivity; Inverse; Graph; Laplacian matrix; Laplace operator; Discrete mathematics","score_opus":0.032122774179221235,"score_gpt":0.2675024210694715,"score_spread":0.23537964689025023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042309759","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51983035,0.0027496044,0.31461507,0.00635011,0.0007111227,0.00015468715,0.0013326444,0.00051918795,0.15373728],"genre_scores_gemma":[0.9328319,0.0030889965,0.036748033,0.0009988596,0.0012116266,0.00020703475,0.001148769,0.00021400719,0.023550747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841344,0.00048640938,0.000072294504,0.0004232619,0.00032610013,0.00027854595],"domain_scores_gemma":[0.9911163,0.005395578,0.0012607023,0.0006140051,0.0007465767,0.0008669325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011143857,0.0014481554,0.0016874222,0.0056719226,0.00328176,0.0047490546,0.0021763886,0.0021219945,0.009126465],"category_scores_gemma":[0.009047129,0.0007580359,0.0011241377,0.005364421,0.0060598594,0.012086235,0.0035865118,0.003348424,0.0009016439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024321085,0.000015069971,0.00012618004,0.00003673211,0.0000044577605,0.000033848733,0.00015633489,0.0008713537,0.00022116056,0.9933462,0.0007447996,0.0044195177],"study_design_scores_gemma":[0.0000073893984,0.00000769815,0.00011052142,0.000013437109,0.000008529889,0.000067491805,0.000085130705,0.002610126,0.00013639806,0.99580115,0.0011443835,0.0000075709554],"about_ca_topic_score_codex":0.001952692,"about_ca_topic_score_gemma":0.00207393,"teacher_disagreement_score":0.009126465,"about_ca_system_score_codex":0.001654658,"about_ca_system_score_gemma":0.0007525338,"threshold_uncertainty_score":0.030531049},"labels":[],"label_agreement":null},{"id":"W2042696910","doi":"10.1016/j.ejc.2013.03.004","title":"Many large eigenvalues in sparse graphs","year":2013,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","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":"Mathematics; Eigenvalues and eigenvectors; Combinatorics; Degree (music); Bounded function; Equivalence (formal languages); Constant (computer programming); Discrete mathematics; Mathematical analysis","score_opus":0.03181502815291788,"score_gpt":0.271340035511531,"score_spread":0.23952500735861315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042696910","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.838251,0.0010252178,0.12080894,0.004016042,0.000352052,0.000058590707,0.00025820066,0.0008140284,0.034416005],"genre_scores_gemma":[0.98119557,0.00031450667,0.010778832,0.000320496,0.00030604965,0.00007358513,0.00014434787,0.00016338643,0.006703134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932516,0.00021330462,0.000022709113,0.00011139997,0.0002249841,0.000102314625],"domain_scores_gemma":[0.99391276,0.0039571286,0.0005484273,0.00040538269,0.0004288149,0.00074746896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007318914,0.0006435497,0.001010283,0.0025059818,0.001641611,0.0026105684,0.00092686375,0.0020081182,0.0070927674],"category_scores_gemma":[0.009287249,0.00072891853,0.0005210603,0.0012216344,0.0028357112,0.0034107994,0.0018818626,0.0020241144,0.0008070555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025789795,0.00013618317,0.002226042,0.00020813671,0.000048815113,0.00067615515,0.0007909583,0.014690583,0.007941676,0.9459133,0.008968854,0.018141376],"study_design_scores_gemma":[0.00004417927,0.000019515843,0.00075026904,0.000016272603,0.000012162074,0.00024994457,0.00023932496,0.03345209,0.00061320496,0.9637143,0.0008692684,0.000019381965],"about_ca_topic_score_codex":0.0005202715,"about_ca_topic_score_gemma":0.00095039356,"teacher_disagreement_score":0.0070927674,"about_ca_system_score_codex":0.00066530117,"about_ca_system_score_gemma":0.0003747949,"threshold_uncertainty_score":0.023727715},"labels":[],"label_agreement":null},{"id":"W2043876777","doi":"10.1080/03081080310001617759","title":"On operations in which graphs are appended to trees","year":2004,"lang":"en","type":"article","venue":"Linear and Multilinear Algebra","topic":"Graph theory and applications","field":"Mathematics","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 Regina","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Chordal graph; Indifference graph; Pathwidth; Algebraic number; Algebraic connectivity; Neighbourhood (mathematics); 1-planar graph; Discrete mathematics; Graph; Line graph","score_opus":0.029015822966041414,"score_gpt":0.3166264452213575,"score_spread":0.2876106222553161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043876777","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6691305,0.00041842193,0.29224083,0.0003103373,0.00020991814,0.00012004887,0.00019040384,0.00070461957,0.036674913],"genre_scores_gemma":[0.9171759,0.00071217126,0.075156644,0.00015167138,0.00015659865,0.00013903606,0.0003355211,0.00035501804,0.0058174944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888355,0.00034327156,0.00007968304,0.00021203185,0.00026179166,0.00021967503],"domain_scores_gemma":[0.99516064,0.0018290986,0.0010177977,0.001186226,0.00044458773,0.00036165793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008886348,0.0005248337,0.000579303,0.0010801274,0.0015664293,0.0012841106,0.00064579665,0.0005747109,0.0058351704],"category_scores_gemma":[0.006758683,0.00027071315,0.0009004359,0.0014066765,0.003237474,0.0061085676,0.0022516083,0.0009333676,0.0006264052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034818795,0.0001158718,0.0012678221,0.00026170275,0.000039428774,0.0014155736,0.0011726635,0.03678222,0.03504534,0.8802723,0.0011009752,0.042177908],"study_design_scores_gemma":[0.000034016663,0.00034131648,0.0016615293,0.00006910954,0.000071285496,0.000911436,0.00089164893,0.038671855,0.034720723,0.9040298,0.01853546,0.00006193031],"about_ca_topic_score_codex":0.00052384887,"about_ca_topic_score_gemma":0.0010677507,"teacher_disagreement_score":0.0058351704,"about_ca_system_score_codex":0.00035096385,"about_ca_system_score_gemma":0.0002713504,"threshold_uncertainty_score":0.01952058},"labels":[],"label_agreement":null},{"id":"W2043943381","doi":"10.4171/rmi/378","title":"Which values of the volume growth and escape time exponent are possible for a graph?","year":2004,"lang":"en","type":"article","venue":"Revista Matemática Iberoamericana","topic":"Graph theory and applications","field":"Mathematics","cited_by":73,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique","keywords":"Exponent; Volume (thermodynamics); Statistical physics; Graph; Mathematics; Combinatorics; Physics; Thermodynamics; Philosophy","score_opus":0.016660733562128303,"score_gpt":0.2614344763565729,"score_spread":0.2447737427944446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043943381","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89934415,0.002766307,0.055081777,0.0028428019,0.0001362378,0.00002736798,0.00042279853,0.00024692074,0.039131716],"genre_scores_gemma":[0.9885799,0.0007403432,0.0077017252,0.0001302471,0.00011125718,0.000022416549,0.000112658,0.00005911631,0.0025423635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995528,0.00007051024,0.000021084938,0.00014744012,0.000061744126,0.00014645299],"domain_scores_gemma":[0.9946262,0.0031449532,0.00089993543,0.000449257,0.00025195678,0.00062770967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095228286,0.0005773858,0.00048068748,0.0010788317,0.00070928904,0.002144553,0.0009261522,0.0013483886,0.0022251892],"category_scores_gemma":[0.009297069,0.00037565682,0.0005096292,0.00046517936,0.0020668898,0.0048501026,0.0009299186,0.0013476074,0.00033915575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004629567,0.0000763501,0.008048405,0.00018856776,0.000047586,0.0004798008,0.00057392864,0.013269614,0.012725721,0.935157,0.0027826084,0.02618742],"study_design_scores_gemma":[0.000054131346,0.000111698726,0.006306854,0.00010398308,0.00005143669,0.0013056681,0.0004700755,0.051910616,0.010369581,0.9229805,0.00626172,0.000073665535],"about_ca_topic_score_codex":0.00050824106,"about_ca_topic_score_gemma":0.0008186642,"teacher_disagreement_score":0.0022251892,"about_ca_system_score_codex":0.0009210966,"about_ca_system_score_gemma":0.0002618925,"threshold_uncertainty_score":0.007444024},"labels":[],"label_agreement":null},{"id":"W2043963103","doi":"10.1016/j.disc.2004.12.010","title":"Completion of Laplacian integral graphs via edge addition","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"University of Regina","funders":"","keywords":"Integrally closed; Mathematics; Combinatorics; Laplacian matrix; Algebraic connectivity; Resistance distance; Discrete mathematics; Integral graph; Laplace operator; Graph; Line graph; Graph power; Mathematical analysis","score_opus":0.03295297523356717,"score_gpt":0.3015378562735073,"score_spread":0.26858488103994016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043963103","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45522234,0.0005442587,0.39469776,0.0018436422,0.00045332668,0.00016232123,0.00064841704,0.0010877097,0.1453402],"genre_scores_gemma":[0.87661487,0.00090901187,0.058454186,0.00046983617,0.0005633447,0.0001123112,0.0007094254,0.00048653537,0.061680403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949646,0.00008437844,0.000018337243,0.00012617694,0.00017718851,0.00009741126],"domain_scores_gemma":[0.9985331,0.00038239552,0.00018455675,0.00015609371,0.00029628782,0.00044758097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050391257,0.0006144716,0.00075725757,0.0020168158,0.0011131751,0.0024597254,0.0012652146,0.0006452608,0.0104777645],"category_scores_gemma":[0.00236268,0.00042197635,0.0007423162,0.0012481182,0.0019473308,0.003774117,0.0020902886,0.0028120806,0.0011740291],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040063223,0.000049584272,0.00011237059,0.00003344804,0.0000049961077,0.00004531237,0.000223147,0.0012995993,0.0014122826,0.9843761,0.0019579164,0.010445174],"study_design_scores_gemma":[0.000016696984,0.000019363652,0.00021263496,0.0000066509633,0.0000072945604,0.00008308351,0.000093842886,0.0072293025,0.00079960894,0.98722583,0.0042941463,0.00001150721],"about_ca_topic_score_codex":0.0009566976,"about_ca_topic_score_gemma":0.0009321798,"teacher_disagreement_score":0.0104777645,"about_ca_system_score_codex":0.0008209011,"about_ca_system_score_gemma":0.0006123681,"threshold_uncertainty_score":0.035051584},"labels":[],"label_agreement":null},{"id":"W2044994579","doi":"10.1016/j.laa.2010.01.027","title":"Bounds and conjectures for the signless Laplacian index of graphs","year":2010,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Combinatorics; Independence number; Vertex (graph theory); Algebraic number; Clique number; Upper and lower bounds; Spectral radius; Graph; Laplace operator; Domination analysis; Discrete mathematics; Eigenvalues and eigenvectors","score_opus":0.01986102366113922,"score_gpt":0.3019934772289365,"score_spread":0.28213245356779726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044994579","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38773918,0.013784696,0.31893146,0.048030097,0.0033072087,0.00011464,0.0015156853,0.0017091095,0.22486794],"genre_scores_gemma":[0.9382489,0.003826474,0.03079775,0.0032211465,0.0053770887,0.00025987608,0.0010362943,0.00053768547,0.01669485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996316,0.0011134992,0.00017358483,0.0008253299,0.0010623098,0.0005092312],"domain_scores_gemma":[0.9606271,0.029139945,0.0019714253,0.0033068366,0.002228334,0.00272639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062473607,0.0018968469,0.003052189,0.007068141,0.0029975576,0.008271559,0.0063185785,0.004186478,0.013541548],"category_scores_gemma":[0.040854357,0.0012326356,0.0015861697,0.005490139,0.011632489,0.021690326,0.00542087,0.012096293,0.0018869881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012248065,0.00008411648,0.0005780373,0.00013497409,0.000018251034,0.00006343901,0.00031440504,0.002952821,0.0007775594,0.98373103,0.0052388674,0.0059840954],"study_design_scores_gemma":[0.000009966349,0.0000069219936,0.000110727924,0.000016981618,0.0000062615627,0.000021031585,0.000034917568,0.0060601966,0.00012679798,0.9930646,0.0005300519,0.000011579595],"about_ca_topic_score_codex":0.0012935842,"about_ca_topic_score_gemma":0.0013317632,"teacher_disagreement_score":0.013541548,"about_ca_system_score_codex":0.0036625774,"about_ca_system_score_gemma":0.001120299,"threshold_uncertainty_score":0.04530102},"labels":[],"label_agreement":null},{"id":"W2046073871","doi":"10.2298/petf0213089h","title":"Integral complete split graphs","year":2002,"lang":"en","type":"article","venue":"Publikacija Elektrotehnickog fakulteta - serija matematika","topic":"Graph theory and applications","field":"Mathematics","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Indifference graph; Chordal graph; Mathematics; 1-planar graph; Pathwidth; Clique-sum; Combinatorics; Modular decomposition; Discrete mathematics; Graph; Line graph","score_opus":0.10885060972334874,"score_gpt":0.29481598575982515,"score_spread":0.1859653760364764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046073871","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75504637,0.0013574117,0.12973271,0.00092860364,0.00010041129,0.00007882854,0.00080375053,0.0003357933,0.11161611],"genre_scores_gemma":[0.9747704,0.0007703163,0.013834495,0.0001709283,0.000095787844,0.00006509006,0.00077266694,0.000096901436,0.0094235195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961025,0.000043066557,0.0000135652635,0.00011340545,0.00013380036,0.0000859137],"domain_scores_gemma":[0.9990784,0.00024832867,0.00018480462,0.0001069355,0.00017457815,0.00020688928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004409172,0.00045845687,0.000510757,0.0021642486,0.0013012418,0.0017584624,0.0007488824,0.0007148287,0.0075199986],"category_scores_gemma":[0.0017109808,0.00032249707,0.0005630653,0.001446476,0.0014314498,0.0033924812,0.0014404195,0.0011774169,0.00049998425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006199161,0.000028744606,0.0014333471,0.00007219794,0.000015636728,0.00025551807,0.00037428678,0.002109922,0.0024119597,0.9804109,0.0018396205,0.010985977],"study_design_scores_gemma":[0.000020996096,0.000031998923,0.0023980706,0.00005544421,0.000038014954,0.001166391,0.00067981565,0.014579038,0.002476767,0.96571743,0.012820839,0.000015193799],"about_ca_topic_score_codex":0.00038863218,"about_ca_topic_score_gemma":0.00042161247,"teacher_disagreement_score":0.0075199986,"about_ca_system_score_codex":0.00095781026,"about_ca_system_score_gemma":0.00025468352,"threshold_uncertainty_score":0.025156856},"labels":[],"label_agreement":null},{"id":"W2046592997","doi":"10.1016/s0196-6774(02)00215-8","title":"A constructive enumeration of fusenes and benzenoids","year":2002,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Graph theory and applications","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Enumeration; Constructive; Mathematics; Computer science; Combinatorics; Programming language; Process (computing)","score_opus":0.05096497404794445,"score_gpt":0.2903613363710243,"score_spread":0.23939636232307984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046592997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1701051,0.0020043813,0.634979,0.0027192608,0.0007990869,0.00034223212,0.0013181628,0.0010418788,0.18669085],"genre_scores_gemma":[0.45468563,0.0015613143,0.47142133,0.00088294136,0.00026446997,0.0003180446,0.0019242516,0.0005811768,0.068360955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982973,0.0005133349,0.00011751288,0.00030407123,0.0005316333,0.0002363067],"domain_scores_gemma":[0.9970993,0.0017355628,0.00011985266,0.00045973255,0.0004085592,0.00017707028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010690087,0.00089681835,0.0014677081,0.0028053657,0.003473824,0.003547009,0.001568038,0.0017954748,0.019838486],"category_scores_gemma":[0.005483582,0.0009898051,0.001458882,0.0029284772,0.0022562945,0.0076713106,0.004470003,0.002835892,0.0029130522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086170985,0.000049634462,0.00038672966,0.000118979595,0.000015479603,0.000083477185,0.0004185758,0.0019501314,0.001619681,0.94416046,0.0044339476,0.046676707],"study_design_scores_gemma":[0.000018730128,0.000031099462,0.00016844309,0.000075788834,0.000027662018,0.0001401766,0.0003247395,0.007417379,0.0022255087,0.9637718,0.025774905,0.000023800096],"about_ca_topic_score_codex":0.001469685,"about_ca_topic_score_gemma":0.0040378687,"teacher_disagreement_score":0.019838486,"about_ca_system_score_codex":0.0012636008,"about_ca_system_score_gemma":0.00088809937,"threshold_uncertainty_score":0.066366315},"labels":[],"label_agreement":null},{"id":"W2051189409","doi":"10.1515/forum.2008.035","title":"Expander graphs and gaps between primes","year":2008,"lang":"en","type":"article","venue":"Forum Mathematicum","topic":"Graph theory and applications","field":"Mathematics","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":"Queen's University","funders":"","keywords":"Ramanujan's sum; Mathematics; Expander graph; Combinatorics; Prime power; Discrete mathematics; Chordal graph; Prime (order theory); Graph","score_opus":0.05040285597966428,"score_gpt":0.3005628081756454,"score_spread":0.25015995219598114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051189409","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8373697,0.00058871345,0.11413823,0.0007330026,0.00009436813,0.00002997533,0.00010575232,0.00035037711,0.046589904],"genre_scores_gemma":[0.98548746,0.00014420321,0.011067998,0.00012748543,0.00003276549,0.000034588382,0.00006620061,0.000032568783,0.0030067218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995747,0.00013240443,0.000013628904,0.00009872698,0.000114077826,0.000066545006],"domain_scores_gemma":[0.9982387,0.00093621196,0.00020431836,0.00028474888,0.00014945971,0.00018661577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064097886,0.00027732068,0.00033362687,0.0011727108,0.00090798514,0.0006722449,0.00057362125,0.00045678375,0.0035909535],"category_scores_gemma":[0.0030788921,0.00028688525,0.00032617198,0.00040876472,0.0018551657,0.0014553033,0.0012170352,0.0010790814,0.00027745368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006463929,0.000022069646,0.0004438092,0.000036714944,0.000009049128,0.00016684331,0.00028999036,0.004864915,0.0056273174,0.98133415,0.0006136459,0.006526893],"study_design_scores_gemma":[0.000016712009,0.000041940333,0.0005642902,0.000018385614,0.000011762406,0.000397245,0.00016043248,0.030749815,0.0033463286,0.96087027,0.0038076718,0.000015137908],"about_ca_topic_score_codex":0.0002709985,"about_ca_topic_score_gemma":0.0002518777,"teacher_disagreement_score":0.0035909535,"about_ca_system_score_codex":0.00059455814,"about_ca_system_score_gemma":0.00018976591,"threshold_uncertainty_score":0.012012899},"labels":[],"label_agreement":null},{"id":"W2053273128","doi":"10.1016/j.laa.2011.11.031","title":"Solution of the conjecture of Brualdi and Li","year":2011,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Tournament; Order (exchange); Mathematics; Combinatorics; Matrix (chemical analysis); Pure mathematics; Discrete mathematics; Economics","score_opus":0.04558731476392066,"score_gpt":0.27215000175244586,"score_spread":0.2265626869885252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053273128","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19498312,0.005631232,0.19730936,0.15296656,0.012783654,0.00018741608,0.0023777978,0.0011369268,0.43262386],"genre_scores_gemma":[0.77842975,0.002564637,0.06960735,0.016296811,0.009752839,0.00037265083,0.0030308568,0.00068327144,0.11926185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851197,0.0004919072,0.000051844512,0.0003528962,0.00031408438,0.00027719064],"domain_scores_gemma":[0.9960181,0.0022477068,0.0002169865,0.000654352,0.0005062438,0.0003566071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016759505,0.0010112725,0.0025435016,0.0018896044,0.0029612572,0.003615876,0.0025517656,0.00418747,0.029741306],"category_scores_gemma":[0.012195322,0.00064931996,0.0019497483,0.002234238,0.004884416,0.009125784,0.004492716,0.007446018,0.005009015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008624004,0.000047446978,0.00018076885,0.000115656105,0.000019511199,0.000052051055,0.00017312831,0.0010770757,0.00020639886,0.9648789,0.027842179,0.0053204875],"study_design_scores_gemma":[0.000032815962,0.000007527033,0.00007862956,0.000017096041,0.000005626107,0.000033340657,0.00006192086,0.0030716565,0.00008918287,0.99259275,0.003998918,0.000010448726],"about_ca_topic_score_codex":0.0018191567,"about_ca_topic_score_gemma":0.0013413893,"teacher_disagreement_score":0.029741306,"about_ca_system_score_codex":0.0018640972,"about_ca_system_score_gemma":0.0015224599,"threshold_uncertainty_score":0.099494636},"labels":[],"label_agreement":null},{"id":"W2053364672","doi":"10.1016/s0095-8956(02)00041-2","title":"Inertia and biclique decompositions of joins of graphs","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Redeemer University; Queen's University","funders":"","keywords":"Joins; Bipartite graph; Combinatorics; Inertia; Mathematics; Eigenvalues and eigenvectors; Partition (number theory); Hermitian matrix; Join (topology); Complete bipartite graph; Discrete mathematics; Graph; Computer science; Pure mathematics; Physics","score_opus":0.01612957538382822,"score_gpt":0.279951896022733,"score_spread":0.2638223206389048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053364672","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86209387,0.000490212,0.080740824,0.00053547835,0.00018533261,0.00008061878,0.00039215086,0.00022330874,0.05525821],"genre_scores_gemma":[0.96172494,0.0003316288,0.019752543,0.0001591479,0.00031556873,0.00006542694,0.0006072135,0.000150667,0.016892878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993044,0.00009106451,0.00004699331,0.00016522,0.0001885679,0.00020375114],"domain_scores_gemma":[0.9976271,0.0006982022,0.00047482905,0.00018743683,0.00027162518,0.0007408316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086019427,0.00055068533,0.00088981877,0.004551354,0.0020396642,0.004808055,0.0010458904,0.00080788694,0.007422328],"category_scores_gemma":[0.0022136318,0.0007742654,0.00077135314,0.0017223998,0.0028974793,0.0036472634,0.0020786824,0.0018109486,0.0008124893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118897085,0.000040428553,0.0008591067,0.000034629018,0.000008167209,0.00011216443,0.0011668897,0.00056656613,0.0026234593,0.98676014,0.0010695821,0.00663985],"study_design_scores_gemma":[0.000038012666,0.000050770224,0.0018343602,0.00002951893,0.000024431012,0.00022821198,0.0008962964,0.0065932474,0.0013427904,0.98326194,0.0056728963,0.00002750774],"about_ca_topic_score_codex":0.0015629587,"about_ca_topic_score_gemma":0.0025971762,"teacher_disagreement_score":0.007422328,"about_ca_system_score_codex":0.0009873097,"about_ca_system_score_gemma":0.00043844245,"threshold_uncertainty_score":0.024830163},"labels":[],"label_agreement":null},{"id":"W2053545243","doi":"10.1016/s0166-218x(01)00180-9","title":"Boundary uniqueness of fusenes","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Planar; Boundary (topology); Uniqueness; Enhanced Data Rates for GSM Evolution; Combinatorics; Code (set theory); Geometry; Mathematical analysis; Computer science","score_opus":0.04865502189627554,"score_gpt":0.2874226682189233,"score_spread":0.23876764632264777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053545243","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5460345,0.0017838444,0.21898691,0.002516929,0.00066233816,0.00008489251,0.0003958092,0.0002520923,0.22928268],"genre_scores_gemma":[0.9224776,0.0006095218,0.019563688,0.00031528377,0.00018343625,0.000060363498,0.00032790034,0.00018815667,0.056274146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952435,0.000087941175,0.000021061083,0.00014629179,0.00010446043,0.00011586669],"domain_scores_gemma":[0.9988367,0.00034639364,0.0001446283,0.000118865704,0.00035575795,0.00019759769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006637144,0.0006232909,0.0011890483,0.002062669,0.003001662,0.0029203824,0.0010229942,0.001960954,0.009796149],"category_scores_gemma":[0.004866618,0.0006145086,0.0010753989,0.0006086946,0.0032717134,0.0050428943,0.00461432,0.0032313555,0.0013068981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043063283,0.000010378489,0.00025844376,0.000023941324,0.000006822398,0.00005864649,0.0001866325,0.0013464331,0.00092337606,0.99203014,0.000828439,0.0042835963],"study_design_scores_gemma":[0.000014313654,0.000025556665,0.00035177503,0.000026184991,0.00000802878,0.00014681074,0.00035401387,0.008488165,0.0013925231,0.9848451,0.0043309545,0.000016587004],"about_ca_topic_score_codex":0.0014693395,"about_ca_topic_score_gemma":0.00093192264,"teacher_disagreement_score":0.009796149,"about_ca_system_score_codex":0.001325906,"about_ca_system_score_gemma":0.0007314738,"threshold_uncertainty_score":0.03277135},"labels":[],"label_agreement":null},{"id":"W2053989944","doi":"10.1016/s0024-3795(00)00114-2","title":"Graphs with the same determinant as a complete graph","year":2000,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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":"Queen's University; University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Adjacency matrix; Counterexample; Circulant matrix; Discrete mathematics; Two-graph; Regular graph; Degree matrix; Conjecture; Graph; Line graph; Voltage graph; Graph power","score_opus":0.022982038588038652,"score_gpt":0.2755013346665193,"score_spread":0.25251929607848067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053989944","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47247794,0.0013168487,0.27210963,0.006111814,0.0019185228,0.00012296165,0.0011054307,0.001140993,0.24369584],"genre_scores_gemma":[0.9287399,0.0007269067,0.024120118,0.0016017407,0.0008457639,0.00008171452,0.0006301616,0.00037587495,0.042877786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992532,0.0002109886,0.000023375042,0.00018975732,0.00019866,0.00012392503],"domain_scores_gemma":[0.99821293,0.00036451156,0.00017854477,0.00043268348,0.00044333053,0.00036799794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004724913,0.00050691655,0.0008915735,0.0018757766,0.0015249089,0.0029428897,0.00071154896,0.0013676182,0.008506299],"category_scores_gemma":[0.002080719,0.0003553417,0.0008259715,0.0013347714,0.002308647,0.0036086247,0.0013389622,0.0016927184,0.0016008797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026053905,0.000027307304,0.00016172032,0.000032468703,0.000012122027,0.000082167484,0.0001252932,0.0007817973,0.001491377,0.98760706,0.004300125,0.0053525716],"study_design_scores_gemma":[0.000011745109,0.000012598368,0.00031384412,0.000007176862,0.000010428976,0.00019239249,0.000082327126,0.003386313,0.0005138249,0.99072975,0.0047266395,0.000012866392],"about_ca_topic_score_codex":0.0008141622,"about_ca_topic_score_gemma":0.001312812,"teacher_disagreement_score":0.008506299,"about_ca_system_score_codex":0.00057870446,"about_ca_system_score_gemma":0.0006853127,"threshold_uncertainty_score":0.02845639},"labels":[],"label_agreement":null},{"id":"W2054087167","doi":"10.1016/s0012-365x(01)00042-5","title":"The Tutte polynomial for homeomorphism classes of graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","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 Waterloo","funders":"","keywords":"Tutte polynomial; Mathematics; Combinatorics; Chromatic polynomial; Homeomorphism (graph theory); Discrete mathematics; Polynomial; Class (philosophy); Graph; Line graph; Computer science; Voltage graph; Artificial intelligence","score_opus":0.05471248833812317,"score_gpt":0.30077858165186755,"score_spread":0.24606609331374438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054087167","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.706453,0.002107994,0.19418164,0.0045980792,0.00041082842,0.00009872391,0.0008111376,0.00054362766,0.09079503],"genre_scores_gemma":[0.97235495,0.0014674958,0.010116542,0.00025040304,0.00051445316,0.00011427904,0.0004908609,0.0001890731,0.014501964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990268,0.00025108366,0.000033852808,0.00022302534,0.0002136016,0.00025169092],"domain_scores_gemma":[0.99540555,0.003043809,0.0004303911,0.00038812688,0.00025638798,0.0004757258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011816527,0.00083716377,0.0017183243,0.0035904518,0.0026721582,0.006134236,0.0017294234,0.0016627532,0.010003138],"category_scores_gemma":[0.0083194515,0.0008052062,0.0013449435,0.004191154,0.0056247846,0.00907429,0.0027897684,0.004666179,0.0009079475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051996532,0.000020138597,0.0003763882,0.000040116898,0.000009058611,0.000028960032,0.00033892292,0.0021706908,0.0003066595,0.9895047,0.0015793663,0.005572908],"study_design_scores_gemma":[0.000012150301,0.0000093341005,0.00024053158,0.000010786541,0.000009623373,0.000046563804,0.00008131908,0.007826814,0.00018867229,0.9900191,0.0015446625,0.000010425332],"about_ca_topic_score_codex":0.0044467705,"about_ca_topic_score_gemma":0.003683498,"teacher_disagreement_score":0.010003138,"about_ca_system_score_codex":0.0032616851,"about_ca_system_score_gemma":0.001047678,"threshold_uncertainty_score":0.033463895},"labels":[],"label_agreement":null},{"id":"W2055243779","doi":"10.1016/j.jnt.2014.08.011","title":"Historical remark on a theorem of Zhang and Yue","year":2014,"lang":"en","type":"article","venue":"Journal of Number Theory","topic":"Graph theory and applications","field":"Mathematics","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":"Zhàng; Mathematics; Dirichlet distribution; Pure mathematics; Combinatorics; Mathematical analysis; China; Law; Political science","score_opus":0.025082680379908018,"score_gpt":0.29106587436224246,"score_spread":0.26598319398233444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055243779","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021896735,0.09736681,0.079602785,0.24677803,0.068595566,0.00008308573,0.001905072,0.0008826845,0.48288918],"genre_scores_gemma":[0.44916177,0.041563265,0.05215376,0.101223886,0.12422323,0.00039031624,0.0011872279,0.0010936308,0.22900283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998415,0.00043977995,0.00010444246,0.000535999,0.00034913898,0.00015564448],"domain_scores_gemma":[0.9965765,0.002023935,0.00020525084,0.00041074856,0.00061116606,0.00017246082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003024437,0.0009937458,0.001051095,0.0040538795,0.0037519294,0.0030168765,0.001625877,0.0026173636,0.009567796],"category_scores_gemma":[0.0066529764,0.0005794212,0.0012232693,0.0034307744,0.008175168,0.0086309,0.0037196884,0.006804792,0.002618595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007045658,0.000020113665,0.00016773771,0.00016797383,0.00002011098,0.000096418145,0.00024726702,0.00018691164,0.00031485606,0.9148228,0.07246873,0.011416705],"study_design_scores_gemma":[0.000041969386,0.000042611322,0.00072487764,0.00009399983,0.0000361378,0.00029939425,0.000063426836,0.0005672563,0.0006767736,0.5446347,0.45277664,0.00004220966],"about_ca_topic_score_codex":0.001469138,"about_ca_topic_score_gemma":0.0006146567,"teacher_disagreement_score":0.009567796,"about_ca_system_score_codex":0.0027863346,"about_ca_system_score_gemma":0.0006189484,"threshold_uncertainty_score":0.032007456},"labels":[],"label_agreement":null},{"id":"W2056219688","doi":"10.1016/j.jctb.2008.07.001","title":"On the sum of k largest eigenvalues of graphs and symmetric matrices","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":22,"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; Eigenvalues and eigenvectors; Generalization; Integer (computer science); Order (exchange); Graph; Discrete mathematics; Physics; Computer science; Mathematical analysis; Quantum mechanics","score_opus":0.025861457558032416,"score_gpt":0.26741940264988384,"score_spread":0.2415579450918514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056219688","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6581503,0.0029903925,0.26495227,0.0030832866,0.0010774286,0.000055204997,0.00040755354,0.0004085363,0.06887509],"genre_scores_gemma":[0.9650743,0.0012521049,0.018643988,0.00027089982,0.0007898241,0.000066023684,0.0002583793,0.0002947831,0.013349858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988423,0.00039831788,0.00005360794,0.00022591771,0.00034247834,0.00013748954],"domain_scores_gemma":[0.99055415,0.0070624,0.00068432034,0.00036958125,0.000703809,0.00062577776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013686162,0.0011842872,0.001052171,0.0027857106,0.0012718993,0.0027785683,0.0016885607,0.0014862069,0.008269029],"category_scores_gemma":[0.012047909,0.0006557673,0.0006145601,0.0014942032,0.0033749714,0.005286374,0.0021088629,0.0017491925,0.0010921854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003827999,0.00009944174,0.0019883532,0.0002929883,0.00007203869,0.00059901684,0.00074493804,0.026341252,0.008070953,0.9253447,0.007781285,0.02828234],"study_design_scores_gemma":[0.000015201269,0.000022685666,0.0011228886,0.000049007864,0.000018949613,0.00026941014,0.00022101535,0.064852685,0.0010224904,0.9310718,0.0012917938,0.000042128366],"about_ca_topic_score_codex":0.00061603385,"about_ca_topic_score_gemma":0.0008606977,"teacher_disagreement_score":0.008269029,"about_ca_system_score_codex":0.00069048157,"about_ca_system_score_gemma":0.00043669622,"threshold_uncertainty_score":0.027662694},"labels":[],"label_agreement":null},{"id":"W2056415888","doi":"10.1016/j.laa.2007.05.036","title":"The minimum rank of symmetric matrices described by a graph: A survey","year":2007,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":244,"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","funders":"","keywords":"Mathematics; Combinatorics; Rank (graph theory); Graph; Simple graph; Discrete mathematics","score_opus":0.03118969790938455,"score_gpt":0.3016897495124434,"score_spread":0.27050005160305884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056415888","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15156072,0.27187565,0.5042764,0.0086353365,0.0012118905,0.0001231652,0.0029753807,0.00074992556,0.058591545],"genre_scores_gemma":[0.6203633,0.18964869,0.1687053,0.0015007951,0.0074938782,0.00017963168,0.0037928154,0.000407042,0.007908598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976993,0.0006482405,0.00017954387,0.0007285479,0.0005741833,0.00017010306],"domain_scores_gemma":[0.99249494,0.0052220435,0.00068897323,0.0006837316,0.0006390793,0.00027118486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017505218,0.0013446106,0.002640265,0.0045174845,0.00093073945,0.004460299,0.0023804856,0.0021069963,0.003472058],"category_scores_gemma":[0.0078033335,0.0011582777,0.0011893904,0.0072672036,0.0025217468,0.008386716,0.0014636089,0.0023832812,0.0010875299],"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.00023689178,0.0002802469,0.004033891,0.0040523354,0.0002491498,0.00019983591,0.0004971267,0.026514012,0.0031170887,0.64396244,0.01848635,0.29837066],"study_design_scores_gemma":[0.000031248626,0.00013324579,0.0011945574,0.00022059128,0.000068431924,0.00062409765,0.00026841235,0.03346081,0.0013622247,0.942946,0.019619899,0.000070590926],"about_ca_topic_score_codex":0.0007733075,"about_ca_topic_score_gemma":0.00092331745,"teacher_disagreement_score":0.0045174845,"about_ca_system_score_codex":0.0010325693,"about_ca_system_score_gemma":0.0011434364,"threshold_uncertainty_score":0.011615217},"labels":[],"label_agreement":null},{"id":"W2058054978","doi":"10.1016/j.laa.2009.06.011","title":"Bounds on the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mrow><mml:mi>Q</mml:mi></mml:mrow></mml:math>-spread of a graph","year":2009,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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 Regina","funders":"","keywords":"Adjacency matrix; Mathematics; Combinatorics; Linear algebra; Laplacian matrix; Diagonal matrix; Graph; Hermitian matrix; Eigenvalues and eigenvectors; Matrix (chemical analysis); Laplace operator; Discrete mathematics; Diagonal; Geometry; Physics; Pure mathematics; Mathematical analysis","score_opus":0.021715243232497336,"score_gpt":0.2604747639200712,"score_spread":0.23875952068757383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058054978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022065673,0.00438145,0.49435797,0.009889393,0.0010982541,0.00020373243,0.013495307,0.0048762276,0.44963193],"genre_scores_gemma":[0.52063996,0.009251027,0.18434696,0.00466967,0.0028178748,0.0014123316,0.01975023,0.014617004,0.24249502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966307,0.00058025686,0.00020688373,0.00079734926,0.0012251805,0.0005596194],"domain_scores_gemma":[0.98220944,0.009722746,0.0006162553,0.003130889,0.0033688087,0.00095197395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003085767,0.0018710918,0.0016336878,0.0047904975,0.002787921,0.008996352,0.003439483,0.002168898,0.09543456],"category_scores_gemma":[0.023769759,0.0008985675,0.001892487,0.004684547,0.0027030318,0.017358536,0.0058707045,0.0071483473,0.04311145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012791494,0.000054899752,0.00046719072,0.00023806373,0.000031735202,0.00009953583,0.00041080586,0.0033988492,0.0011693136,0.9053876,0.059288647,0.02932539],"study_design_scores_gemma":[0.000019415473,0.000020555617,0.0005148097,0.00013464778,0.00003612271,0.00012738194,0.000120417426,0.008794867,0.0018218036,0.9305245,0.057849567,0.000035980098],"about_ca_topic_score_codex":0.0042282813,"about_ca_topic_score_gemma":0.00465883,"teacher_disagreement_score":0.09543456,"about_ca_system_score_codex":0.0035550317,"about_ca_system_score_gemma":0.0018747394,"threshold_uncertainty_score":0.31926042},"labels":[],"label_agreement":null},{"id":"W2058654435","doi":"10.1016/j.disc.2009.03.012","title":"The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"Dalhousie University","funders":"Johnson and Johnson","keywords":"Digraph; Mathematics; Closure (psychology); Strongly connected component; Combinatorics; Plane (geometry); Arc (geometry); Reliability (semiconductor); Complex plane; Set (abstract data type); Discrete mathematics; Mathematical analysis; Geometry; Computer science","score_opus":0.03803243306271469,"score_gpt":0.3106649010428753,"score_spread":0.2726324679801606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058654435","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72913337,0.0008290126,0.24542838,0.0010564085,0.00006844564,0.000081171136,0.0014247227,0.000244008,0.02173446],"genre_scores_gemma":[0.9822828,0.0008432513,0.011776588,0.000079394726,0.00014575015,0.000099863944,0.0005777508,0.00007067617,0.004123795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989697,0.00022581771,0.000043924254,0.0003001667,0.00030285373,0.00015751783],"domain_scores_gemma":[0.99237,0.004437833,0.0014654314,0.0003721151,0.0007422615,0.0006123865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009861233,0.0011028266,0.0015674998,0.0022733794,0.00083706446,0.0041378075,0.0013134211,0.0009708424,0.00491758],"category_scores_gemma":[0.0074462504,0.00064179156,0.00058983336,0.0012346132,0.0032777605,0.0044589676,0.0016096614,0.0024338446,0.00068885257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039074977,0.000080281665,0.00131166,0.00021406729,0.00008397142,0.00030875352,0.0005413256,0.010711994,0.007976653,0.9588961,0.001680747,0.017803736],"study_design_scores_gemma":[0.00008961825,0.00010968347,0.0026685474,0.000056919587,0.00004243007,0.0006641251,0.0003497406,0.05487024,0.0031187206,0.9345899,0.0033901255,0.000050001756],"about_ca_topic_score_codex":0.0006276383,"about_ca_topic_score_gemma":0.0002188261,"teacher_disagreement_score":0.00491758,"about_ca_system_score_codex":0.00089435186,"about_ca_system_score_gemma":0.0005188944,"threshold_uncertainty_score":0.016451001},"labels":[],"label_agreement":null},{"id":"W2059267359","doi":"10.1016/j.endm.2009.07.067","title":"Maximum values of Szeged index and edge-Szeged index of graphs","year":2009,"lang":"hu","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":14,"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":"China Scholarship Council","keywords":"Mathematics; Combinatorics; Bipartite graph; Conjecture; Wiener index; Index (typography); Generalization; Discrete mathematics; Graph; Mathematical analysis","score_opus":0.013622411942113097,"score_gpt":0.2814336909769344,"score_spread":0.26781127903482127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059267359","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85670274,0.0023924944,0.093287945,0.001318938,0.00020328462,0.00005168704,0.0016435902,0.00035160227,0.044047635],"genre_scores_gemma":[0.98064846,0.0009361388,0.013987624,0.00009266201,0.00024333855,0.000078057295,0.0006028252,0.00008581669,0.0033250938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990978,0.00020171609,0.000066785935,0.00020955321,0.00024872556,0.00017541063],"domain_scores_gemma":[0.99313337,0.003952001,0.0008437849,0.0005055489,0.00054579834,0.0010195135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001967945,0.0009912598,0.001360479,0.0067004827,0.0017100256,0.004322666,0.0023733308,0.001443899,0.005492868],"category_scores_gemma":[0.010750933,0.0006244221,0.0006720991,0.00464312,0.0033367786,0.0071713394,0.0017864777,0.0018345994,0.00058292586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039816272,0.00005308259,0.0020540706,0.00018493997,0.00004822506,0.000098992925,0.00044225686,0.0071989475,0.0038759906,0.971077,0.0019535688,0.012614662],"study_design_scores_gemma":[0.00003194115,0.000027754657,0.0014375648,0.000038297843,0.00003067678,0.00013605738,0.00012451496,0.015707567,0.0020706146,0.97898054,0.0013793221,0.00003511135],"about_ca_topic_score_codex":0.00039136998,"about_ca_topic_score_gemma":0.00044531818,"teacher_disagreement_score":0.0067004827,"about_ca_system_score_codex":0.0019159792,"about_ca_system_score_gemma":0.0007409726,"threshold_uncertainty_score":0.018375456},"labels":[],"label_agreement":null},{"id":"W2059864333","doi":"10.4153/cmb-2010-070-5","title":"Variations on a Paper of Erdős and Heilbronn","year":2010,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Argument (complex analysis); Inverse; Yield (engineering); Type (biology); Pure mathematics; Internal medicine; Biology; Geometry; Medicine","score_opus":0.014335241015104987,"score_gpt":0.2513772187829004,"score_spread":0.23704197776779543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059864333","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013565581,0.06417099,0.11222954,0.121287175,0.076637186,0.00011136411,0.0010894847,0.00069174235,0.610217],"genre_scores_gemma":[0.46586758,0.09084524,0.05843402,0.04917041,0.06590979,0.00031943087,0.0009999605,0.0017910181,0.26666266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828523,0.0005189583,0.000089457026,0.00033823552,0.0006283023,0.00013975849],"domain_scores_gemma":[0.9974273,0.0011415575,0.00015658872,0.0004137482,0.0006143092,0.00024652656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021079879,0.0013278067,0.0012444906,0.0024225924,0.0027773252,0.0031484908,0.0012936348,0.0015193202,0.012780419],"category_scores_gemma":[0.007395803,0.00032382619,0.0014110241,0.003416396,0.0038499592,0.0064537167,0.003888811,0.004234148,0.004465861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049457194,0.000022920203,0.00010682274,0.000105978004,0.000019353702,0.00016779729,0.00020733305,0.0004132601,0.00041533398,0.9134614,0.072072916,0.012957508],"study_design_scores_gemma":[0.000021113694,0.00002065546,0.00023817872,0.000079120684,0.000029750783,0.00019751323,0.000060640104,0.00055695674,0.0003776885,0.719382,0.27900994,0.000026475233],"about_ca_topic_score_codex":0.0027054455,"about_ca_topic_score_gemma":0.0015358237,"teacher_disagreement_score":0.012780419,"about_ca_system_score_codex":0.0027679473,"about_ca_system_score_gemma":0.0012524674,"threshold_uncertainty_score":0.04275477},"labels":[],"label_agreement":null},{"id":"W2059892291","doi":"10.1016/s0012-365x(01)00102-9","title":"The level of nonmultiplicativity of graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"University of Regina","funders":"","keywords":"Mathematics; Combinatorics; Multiplicative function; Discrete mathematics; Graph product; Cograph; Conjecture; Block graph; Graph; Split graph; 1-planar graph; Pathwidth; Indifference graph; Chordal graph; Line graph","score_opus":0.16044129254998377,"score_gpt":0.3319080170067017,"score_spread":0.17146672445671793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059892291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3433471,0.010046637,0.42484114,0.026325027,0.0015493626,0.000069268695,0.00052059686,0.00072243233,0.19257836],"genre_scores_gemma":[0.93127316,0.0022554912,0.047154807,0.001869644,0.0015572486,0.0001172851,0.0002566087,0.00021710062,0.015298629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950098,0.0018497992,0.00023242095,0.0010551238,0.0013098334,0.0005430204],"domain_scores_gemma":[0.97819865,0.013071605,0.0012243496,0.0047089923,0.0015173097,0.0012791818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004713629,0.0007128667,0.002065998,0.0029215447,0.004589248,0.010405035,0.003276273,0.0037972848,0.0078832675],"category_scores_gemma":[0.014088906,0.0014383642,0.0016135651,0.002733672,0.0133341225,0.019088151,0.004729184,0.008825371,0.0009806363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000079122865,0.000005572748,0.000075494856,0.000015291822,0.0000035328042,0.000018116589,0.00010015857,0.0002090528,0.00013656137,0.9980446,0.0003463123,0.0010374275],"study_design_scores_gemma":[0.0000020459165,0.0000027252172,0.00003718735,0.0000056257054,0.0000029347434,0.000025850568,0.000021332813,0.0008677584,0.000100626516,0.99801564,0.00091451127,0.0000037642408],"about_ca_topic_score_codex":0.0008659752,"about_ca_topic_score_gemma":0.00071188505,"teacher_disagreement_score":0.010405035,"about_ca_system_score_codex":0.0028327508,"about_ca_system_score_gemma":0.0012329639,"threshold_uncertainty_score":0.026372194},"labels":[],"label_agreement":null},{"id":"W2061413565","doi":"10.4310/joc.2012.v3.n2.a6","title":"Meyniel’s conjecture on the cop number: A survey","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":49,"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; Conjecture; Combinatorics","score_opus":0.09291930515307462,"score_gpt":0.3474541012453438,"score_spread":0.2545347960922692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061413565","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.09276263,0.42087772,0.11799537,0.04550217,0.003663455,0.00013255539,0.0011054702,0.00040373977,0.31755692],"genre_scores_gemma":[0.63846755,0.27464342,0.034966502,0.005920156,0.010593893,0.00027784167,0.0020201704,0.0003829373,0.03272751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982121,0.00023260263,0.00011162472,0.0007050736,0.0004790985,0.00025950282],"domain_scores_gemma":[0.99360126,0.004463285,0.00031294773,0.00047382075,0.00083203113,0.0003165557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030752644,0.0010064676,0.0019618631,0.0046249893,0.0023933437,0.0055576414,0.0019863758,0.0029741602,0.006963344],"category_scores_gemma":[0.010269931,0.001002374,0.0009014163,0.0067968527,0.0071637887,0.018439049,0.002922174,0.0045242743,0.0018066809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000687321,0.00006814391,0.0015007927,0.0007505763,0.000028699824,0.000113051836,0.00033562377,0.0031434407,0.00040757275,0.87806153,0.015968155,0.09955363],"study_design_scores_gemma":[0.000022055136,0.00006359956,0.0011760541,0.00039113316,0.00002267697,0.00037745998,0.00041251935,0.005766827,0.00086790544,0.8467316,0.14409465,0.0000734296],"about_ca_topic_score_codex":0.0034747813,"about_ca_topic_score_gemma":0.001409718,"teacher_disagreement_score":0.006963344,"about_ca_system_score_codex":0.0044924924,"about_ca_system_score_gemma":0.0020715452,"threshold_uncertainty_score":0.032595456},"labels":[],"label_agreement":null},{"id":"W2061475873","doi":"10.1007/bf02773960","title":"Forbidden paths and cycles in ordered graphs and matrices","year":2006,"lang":"en","type":"article","venue":"Israel Journal of Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":95,"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; Adjacency matrix; Conjecture; Bipartite graph; Vertex (graph theory); Adjacency list; Discrete mathematics; Graph","score_opus":0.021623830765542463,"score_gpt":0.2872560561172378,"score_spread":0.26563222535169534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061475873","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51977086,0.0029297646,0.41763374,0.0028258665,0.0004378038,0.00014032057,0.0007808985,0.00035527252,0.055125497],"genre_scores_gemma":[0.907597,0.0018192873,0.066154614,0.00042188642,0.0003252127,0.00026838557,0.0005084332,0.00013060373,0.02277453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934894,0.00023127337,0.000041971536,0.00014155023,0.00015024265,0.00008610768],"domain_scores_gemma":[0.996267,0.0024741427,0.00051448506,0.00022530409,0.0002911825,0.00022789142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005861578,0.0007087708,0.00058179296,0.0021823663,0.0016808618,0.0029156513,0.0010238796,0.0011557813,0.005051565],"category_scores_gemma":[0.004551358,0.00059125427,0.0006334423,0.0027918997,0.002605846,0.0038871346,0.0011370254,0.001743656,0.00050245767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048609545,0.000019348769,0.0002981398,0.00005940898,0.000007644457,0.00012395553,0.00045606258,0.0024851752,0.0007284552,0.9863898,0.0010314827,0.0083518755],"study_design_scores_gemma":[0.000007830962,0.000008135809,0.000060606115,0.000009576431,0.000005247396,0.00008878633,0.00008236978,0.0044280207,0.00024212663,0.99336,0.0017015928,0.0000056470612],"about_ca_topic_score_codex":0.0018897186,"about_ca_topic_score_gemma":0.0021720137,"teacher_disagreement_score":0.005051565,"about_ca_system_score_codex":0.0011556234,"about_ca_system_score_gemma":0.0009451714,"threshold_uncertainty_score":0.016899109},"labels":[],"label_agreement":null},{"id":"W2061590785","doi":"10.1016/s0024-3795(02)00538-4","title":"On graphs with algebraic connectivity equal to minimum edge density","year":2003,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":26,"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","funders":"","keywords":"Mathematics; Combinatorics; Algebraic number; Graph; Algebraic connectivity; Discrete mathematics; Enhanced Data Rates for GSM Evolution; Line graph; Mathematical analysis","score_opus":0.02552185312857678,"score_gpt":0.2836452748439916,"score_spread":0.2581234217154148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061590785","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6256104,0.0020568261,0.3073245,0.004884617,0.00030428448,0.00012167229,0.0007819178,0.00045433044,0.058461424],"genre_scores_gemma":[0.9532678,0.0016842525,0.03405903,0.0006410846,0.0006539287,0.0001684389,0.00058377517,0.00015788007,0.008783898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988526,0.00043724838,0.00004570507,0.00028796055,0.00022854128,0.0001480038],"domain_scores_gemma":[0.98763984,0.008190452,0.0018538017,0.00064333744,0.000776441,0.00089612365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011883995,0.0011291009,0.0019349322,0.004438063,0.0022398971,0.0035048407,0.0019796216,0.002308526,0.0059407763],"category_scores_gemma":[0.012095542,0.0008520144,0.0008550126,0.0037416716,0.004615205,0.009335332,0.0024717164,0.0024874725,0.0005906369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005139506,0.000030826497,0.00033871672,0.00009082142,0.0000133580415,0.00005518441,0.00021315261,0.004597215,0.0007319844,0.98617715,0.0012360332,0.006464269],"study_design_scores_gemma":[0.000013588422,0.000014811875,0.00024253881,0.000021905298,0.000012148366,0.00010697595,0.0000935885,0.011321294,0.00026492588,0.98712105,0.00077464414,0.000012609349],"about_ca_topic_score_codex":0.0010245513,"about_ca_topic_score_gemma":0.0011039644,"teacher_disagreement_score":0.0059407763,"about_ca_system_score_codex":0.0011387229,"about_ca_system_score_gemma":0.0005664968,"threshold_uncertainty_score":0.019873857},"labels":[],"label_agreement":null},{"id":"W2062017656","doi":"10.1002/jgt.20102","title":"On graphs whose Laplacian matrices have distinct integer eigenvalues","year":2005,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Graph theory and applications","field":"Mathematics","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":"University of Regina","funders":"","keywords":"Laplacian matrix; Mathematics; Combinatorics; Eigenvalues and eigenvectors; Conjecture; Laplace operator; Resistance distance; Algebraic connectivity; Graph; Discrete mathematics; Integer (computer science); Spectral graph theory; Matrix (chemical analysis); Line graph; Graph power; Mathematical analysis; Computer science; Physics","score_opus":0.02432364321713661,"score_gpt":0.3075562901536715,"score_spread":0.2832326469365349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062017656","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94902056,0.000154286,0.039589874,0.0003186823,0.00002101208,0.000021708329,0.00008714815,0.00008024055,0.010706446],"genre_scores_gemma":[0.99282515,0.00009696245,0.0055849813,0.000041746367,0.000021361482,0.000025297737,0.00008263834,0.000021311487,0.0013005332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995221,0.00012679948,0.000021254518,0.00009227005,0.00011389279,0.00012378731],"domain_scores_gemma":[0.9972856,0.001514561,0.00058692694,0.00023840003,0.00014068902,0.00023384558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000503558,0.00048358532,0.00046164083,0.0011876939,0.0013254313,0.0015880823,0.00052211306,0.00072412123,0.0025995392],"category_scores_gemma":[0.0030070893,0.00034610313,0.00051707035,0.0007149261,0.002131867,0.0025361534,0.0010989734,0.0007068035,0.00015029272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032553577,0.00013245693,0.0041022706,0.00011770317,0.000038043185,0.0012247899,0.0011952219,0.028204605,0.02378554,0.9283019,0.001410526,0.0111614205],"study_design_scores_gemma":[0.000052970263,0.00006725014,0.001408945,0.000029410332,0.00002067928,0.0003645396,0.0007365086,0.062471487,0.0049869516,0.9279743,0.0018537088,0.000033224755],"about_ca_topic_score_codex":0.000819886,"about_ca_topic_score_gemma":0.0011584625,"teacher_disagreement_score":0.0025995392,"about_ca_system_score_codex":0.00086951157,"about_ca_system_score_gemma":0.0003121054,"threshold_uncertainty_score":0.008696318},"labels":[],"label_agreement":null},{"id":"W2062331061","doi":"10.1016/j.laa.2014.06.010","title":"Distance spectra of graphs: A survey","year":2014,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":299,"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":"Distance matrix; Mathematics; Distance matrices in phylogeny; Eigenvalues and eigenvectors; Combinatorics; Resistance distance; Characteristic polynomial; Matrix (chemical analysis); Graph; Degree matrix; Adjacency matrix; Discrete mathematics; Polynomial; Line graph; Graph power; Mathematical analysis","score_opus":0.028851018573844693,"score_gpt":0.2921779012327856,"score_spread":0.2633268826589409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062331061","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.049050264,0.6081448,0.27047387,0.0065769856,0.0011970906,0.00008390876,0.0009019339,0.00043173524,0.06313941],"genre_scores_gemma":[0.3673087,0.48474425,0.12736014,0.0024668984,0.006705242,0.0001735856,0.0015818805,0.00031164347,0.009347705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986198,0.00030947404,0.00010551922,0.00043932686,0.00043243426,0.00009348386],"domain_scores_gemma":[0.9963014,0.0023943612,0.00025215617,0.00035609337,0.0004708629,0.00022500908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001397239,0.0010352707,0.0019372819,0.0070746364,0.0012852382,0.0042990674,0.0020165883,0.0015489152,0.0039354353],"category_scores_gemma":[0.0046420093,0.0008910971,0.0009685341,0.010905737,0.0030293625,0.009552639,0.0025830162,0.0030088194,0.0012221315],"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.000065186505,0.0002035343,0.0018260974,0.0021655806,0.00008208391,0.000097416654,0.00049488374,0.003799551,0.0012470479,0.71611404,0.0094803935,0.2644242],"study_design_scores_gemma":[0.00001561259,0.00007336511,0.0013023788,0.00035866757,0.000033449815,0.0007514995,0.00038990314,0.008855128,0.0007523249,0.9204647,0.06695273,0.00005019932],"about_ca_topic_score_codex":0.0008932772,"about_ca_topic_score_gemma":0.00069673645,"teacher_disagreement_score":0.0070746364,"about_ca_system_score_codex":0.0017221926,"about_ca_system_score_gemma":0.0011104653,"threshold_uncertainty_score":0.013165295},"labels":[],"label_agreement":null},{"id":"W2062663701","doi":"10.1016/j.laa.2005.10.017","title":"Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs","year":2005,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":14,"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; Eigenvalues and eigenvectors; Algebraic connectivity; Degree (music); Algebraic number; Combinatorics; Laplace operator; Upper and lower bounds; Simple (philosophy); Laplacian matrix; Graph; Discrete mathematics; Simple graph; Mathematical analysis","score_opus":0.02643588100475422,"score_gpt":0.32009460998956263,"score_spread":0.2936587289848084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062663701","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.21955878,0.004065811,0.5989416,0.03575282,0.0018546152,0.00019509881,0.0024584392,0.003154894,0.1340179],"genre_scores_gemma":[0.8884904,0.0022724934,0.07473273,0.004248542,0.0047166464,0.00059257395,0.0023591542,0.0015351141,0.021052325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99014306,0.002960327,0.00037480114,0.0028088342,0.0024732489,0.00123973],"domain_scores_gemma":[0.8735643,0.10259272,0.0035687108,0.012776725,0.0045656087,0.0029320791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008399242,0.0029583403,0.0036968323,0.0049607293,0.0040347595,0.010035333,0.008310047,0.00504812,0.02571956],"category_scores_gemma":[0.08409644,0.002612737,0.0033332536,0.004487177,0.011709724,0.0300775,0.008233983,0.016400862,0.004205452],"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.00039126095,0.00026022768,0.0013749512,0.00029660494,0.00006416208,0.00015137832,0.00070093886,0.015208971,0.0017235137,0.9473666,0.015759984,0.016701516],"study_design_scores_gemma":[0.000024948684,0.000012566432,0.00021062713,0.000022705595,0.000011558923,0.000029177147,0.00005533028,0.019806437,0.0004852627,0.9781668,0.0011528153,0.000021746126],"about_ca_topic_score_codex":0.0020697785,"about_ca_topic_score_gemma":0.002339736,"teacher_disagreement_score":0.02571956,"about_ca_system_score_codex":0.0039417804,"about_ca_system_score_gemma":0.0017827606,"threshold_uncertainty_score":0.0860405},"labels":[],"label_agreement":null},{"id":"W2069293045","doi":"10.1112/s1461157014000060","title":"A classification of all 1-Salem graphs","year":2014,"lang":"en","type":"preprint","venue":"LMS Journal of Computation and Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Cyclotomic polynomial; Cyclotomic field; Discrete mathematics; Graph; Polynomial","score_opus":0.07963013401251436,"score_gpt":0.35707462836893633,"score_spread":0.277444494356422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069293045","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85921,0.0012433017,0.0372322,0.0019059922,0.0002694117,0.00015853885,0.0013068573,0.00034535467,0.098328404],"genre_scores_gemma":[0.96844125,0.00043953198,0.01873612,0.0003021944,0.00021298604,0.00006265792,0.0022262346,0.000050244744,0.009528768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996227,0.000048109418,0.000018928722,0.00010033578,0.00013402183,0.00007580536],"domain_scores_gemma":[0.99947816,0.00014397218,0.00011290035,0.00006804845,0.00011373421,0.00008316617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019804611,0.00039940054,0.00034047724,0.002446662,0.0010276233,0.0015095738,0.0007012846,0.00077732006,0.007427807],"category_scores_gemma":[0.0010154088,0.0002337934,0.00038696357,0.0017144929,0.0014124836,0.0015166056,0.0005920812,0.0007605387,0.00062924233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012822247,0.000059482165,0.0061864913,0.00014933164,0.000018283754,0.0003032322,0.0005137451,0.0016653629,0.0074261012,0.9326615,0.008268377,0.042619977],"study_design_scores_gemma":[0.000056904428,0.0001166241,0.01603029,0.00008148774,0.000030917523,0.0018200069,0.000810262,0.022176402,0.0047273207,0.90425247,0.049853265,0.00004410985],"about_ca_topic_score_codex":0.0012117,"about_ca_topic_score_gemma":0.0017902777,"teacher_disagreement_score":0.007427807,"about_ca_system_score_codex":0.0010222154,"about_ca_system_score_gemma":0.00036022018,"threshold_uncertainty_score":0.02484852},"labels":[],"label_agreement":null},{"id":"W2072023487","doi":"10.1016/j.laa.2010.11.052","title":"The minimum semidefinite rank of a triangle-free graph","year":2011,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":23,"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":"American Institute of Mathematics","keywords":"Combinatorics; Mathematics; Graph; Circulant graph; Vertex (graph theory); Semidefinite programming; Unitary state; Conjecture; Discrete mathematics; Graph power; Line graph","score_opus":0.05425444331990612,"score_gpt":0.27800424016064945,"score_spread":0.22374979684074334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072023487","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7185466,0.0006758671,0.20527205,0.0030078625,0.0003737527,0.000093344446,0.0023208528,0.0008304994,0.06887911],"genre_scores_gemma":[0.9553956,0.0003725124,0.029147567,0.0003075249,0.000382887,0.00010134917,0.0009964453,0.00027163315,0.01302448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990049,0.00028051573,0.000044887867,0.0002513299,0.00027485326,0.00014350192],"domain_scores_gemma":[0.99478006,0.0024111436,0.0008055217,0.0004675749,0.0006228567,0.0009128322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009962992,0.0009909671,0.0012115736,0.001928049,0.001220922,0.003533424,0.0019535813,0.0013534687,0.011171329],"category_scores_gemma":[0.0055942102,0.0006083484,0.0004975219,0.0014026365,0.0022504174,0.0047101984,0.0012422156,0.0019707838,0.00142052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051899935,0.00016265197,0.0014379518,0.0003792097,0.00005198818,0.00020872163,0.000700765,0.011732853,0.013309646,0.92853254,0.010762195,0.032202482],"study_design_scores_gemma":[0.000060847593,0.00011805538,0.00077870366,0.00003150626,0.000023086044,0.0003529619,0.00026172682,0.03961012,0.0036700955,0.9518289,0.0032093446,0.00005467086],"about_ca_topic_score_codex":0.0006836212,"about_ca_topic_score_gemma":0.0009842395,"teacher_disagreement_score":0.011171329,"about_ca_system_score_codex":0.000608616,"about_ca_system_score_gemma":0.0006835086,"threshold_uncertainty_score":0.037371874},"labels":[],"label_agreement":null},{"id":"W2072522834","doi":"10.1016/j.laa.2014.12.001","title":"Some applications of a majorization inequality due to Bapat and Sunder","year":2014,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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 Victoria","funders":"Pacific Institute for the Mathematical Sciences","keywords":"Majorization; Mathematics; Inequality; Extension (predicate logic); Eigenvalues and eigenvectors; Rearrangement inequality; Combinatorics; Applied mathematics; Log sum inequality; Mathematical economics; Pure mathematics; Mathematical analysis; Computer science","score_opus":0.023972044753346956,"score_gpt":0.29663613407609274,"score_spread":0.2726640893227458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072522834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039695084,0.026018215,0.64540464,0.023003342,0.0037304093,0.00007824245,0.0005442514,0.0003880777,0.26113766],"genre_scores_gemma":[0.63064665,0.023652008,0.21633641,0.008967715,0.013336246,0.00042735718,0.0008258079,0.00096239406,0.10484542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886036,0.0005265664,0.000055769648,0.00022011156,0.00023515664,0.00010210078],"domain_scores_gemma":[0.99640864,0.0023749776,0.00023282498,0.000276214,0.00045491414,0.00025238612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002216086,0.0014590153,0.0016545218,0.0033648708,0.0019538603,0.0025066552,0.0021152545,0.0018823248,0.01314363],"category_scores_gemma":[0.00806528,0.00083186623,0.002218219,0.004411001,0.0034998115,0.0061328933,0.004282924,0.0058993744,0.001485057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023987142,0.000021953725,0.00009847651,0.000077044286,0.00001689004,0.00005330293,0.00012749789,0.0010564423,0.0005441313,0.98141265,0.0061514727,0.010416103],"study_design_scores_gemma":[0.000006718227,0.000010020186,0.00013166458,0.000017607437,0.000010388894,0.000043127762,0.000028045228,0.0060647344,0.00016727057,0.9866962,0.00681208,0.000012052086],"about_ca_topic_score_codex":0.0015981443,"about_ca_topic_score_gemma":0.0014473895,"teacher_disagreement_score":0.01314363,"about_ca_system_score_codex":0.0020254548,"about_ca_system_score_gemma":0.00076090044,"threshold_uncertainty_score":0.04396981},"labels":[],"label_agreement":null},{"id":"W2074508519","doi":"10.1016/j.aml.2009.11.003","title":"Component factors with large components in graphs","year":2009,"lang":"en","type":"article","venue":"Applied Mathematics Letters","topic":"Graph theory and applications","field":"Mathematics","cited_by":57,"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":"Mathematics; Component (thermodynamics); Combinatorics; Graph; Connected component; Discrete mathematics","score_opus":0.035078600397794396,"score_gpt":0.25831279086264475,"score_spread":0.22323419046485035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074508519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40904772,0.0049014944,0.48164862,0.0036084286,0.0010617034,0.00038125907,0.0006773713,0.002509992,0.09616353],"genre_scores_gemma":[0.89415383,0.0021073057,0.06649767,0.000666424,0.000630101,0.00030847505,0.0005870796,0.00091308623,0.034136172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991252,0.00024459555,0.000038545164,0.00023803298,0.00020289175,0.00015078182],"domain_scores_gemma":[0.99374723,0.0030674278,0.00058522256,0.00076292735,0.0008495896,0.0009875584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087824493,0.0012741662,0.0013800353,0.0034607272,0.0022169012,0.0034676178,0.0013227768,0.0017831068,0.0113542285],"category_scores_gemma":[0.008051218,0.0012837095,0.0010299045,0.0028417015,0.003305398,0.0048763454,0.0022751365,0.0027769133,0.0020915652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009899885,0.00004627653,0.00077158195,0.00016378284,0.00003299718,0.0002559766,0.0006342719,0.0031655258,0.001815816,0.96797466,0.0077008973,0.017339336],"study_design_scores_gemma":[0.000020931157,0.0000126239875,0.00036337084,0.00002339966,0.000028828663,0.00019610615,0.00019254617,0.007718513,0.0006383661,0.9856231,0.0051681995,0.000014026887],"about_ca_topic_score_codex":0.0025349774,"about_ca_topic_score_gemma":0.0026619253,"teacher_disagreement_score":0.0113542285,"about_ca_system_score_codex":0.00105063,"about_ca_system_score_gemma":0.000697789,"threshold_uncertainty_score":0.037983716},"labels":[],"label_agreement":null},{"id":"W2075048357","doi":"10.1016/j.disc.2013.04.013","title":"The inertia of distance matrices of some graphs","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":14,"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":"Government of Shandong Province; National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Eigenvalues and eigenvectors; Inertia; Distance matrix; Graph; Discrete mathematics; Distance matrices in phylogeny; Matrix (chemical analysis)","score_opus":0.018403199891204293,"score_gpt":0.2777834953767149,"score_spread":0.25938029548551056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075048357","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6810011,0.0014464984,0.25980327,0.0024249256,0.00052100775,0.00007225516,0.00051797426,0.00024932,0.05396358],"genre_scores_gemma":[0.9691537,0.0007039008,0.016349897,0.00038131603,0.00085647235,0.00006700076,0.00033208184,0.00012866728,0.012026841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904114,0.00021444805,0.000055532506,0.00024421207,0.00028269537,0.00016193965],"domain_scores_gemma":[0.9949051,0.002300572,0.00094049127,0.00038837726,0.00047129238,0.0009941105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009141986,0.00074086594,0.0007863767,0.003072827,0.0011247767,0.0025942456,0.0013818232,0.0010477169,0.006526177],"category_scores_gemma":[0.005270461,0.00048415264,0.0006726477,0.0014083687,0.0032912677,0.0036146545,0.0016734981,0.0020460451,0.00062478014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048574322,0.000022229637,0.00034159623,0.000032684737,0.000008522689,0.0000781329,0.00040427817,0.001561396,0.0018135051,0.9901125,0.0009879185,0.004588765],"study_design_scores_gemma":[0.000024633528,0.00004802485,0.00082342234,0.000015772133,0.000011501302,0.00019001498,0.00016211774,0.016472155,0.00076378894,0.9783402,0.0031162766,0.000032090145],"about_ca_topic_score_codex":0.0010017467,"about_ca_topic_score_gemma":0.0007656698,"teacher_disagreement_score":0.006526177,"about_ca_system_score_codex":0.0009304127,"about_ca_system_score_gemma":0.00043962183,"threshold_uncertainty_score":0.021832228},"labels":[],"label_agreement":null},{"id":"W2075293395","doi":"10.1016/j.laa.2009.03.028","title":"The case of equality in the Dobrushin–Deutsch–Zenger bound","year":2009,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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 Regina","funders":"","keywords":"Mathematics; Stochastic matrix; Markov chain; Combinatorics; Ergodicity; Eigenvalues and eigenvectors; Upper and lower bounds; Random walk; Stationary distribution; Chain (unit); Random matrix; Matrix (chemical analysis); Continuous-time Markov chain; Rate of convergence; Discrete mathematics; Mathematical analysis; Markov property; Markov model","score_opus":0.04209091367552172,"score_gpt":0.34450686815422743,"score_spread":0.30241595447870573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075293395","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23672596,0.008470407,0.29994828,0.020062638,0.0015203303,0.000039379196,0.0004896347,0.00024085236,0.43250254],"genre_scores_gemma":[0.96062213,0.0016116637,0.016027775,0.0014351107,0.0008497035,0.000048548238,0.0001630732,0.00010608047,0.019135982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998314,0.00047770224,0.00008689761,0.00035623772,0.00038759623,0.00037757438],"domain_scores_gemma":[0.9977842,0.0012013349,0.0002278292,0.00032993496,0.0002329477,0.00022389632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002038891,0.0005533071,0.0015100188,0.0020377492,0.0034129007,0.004458652,0.0016476914,0.0031323184,0.009258814],"category_scores_gemma":[0.007809173,0.00052173773,0.00078898284,0.0026747978,0.0058506955,0.009121232,0.004554038,0.0044141747,0.0014234722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065271356,0.000002484126,0.000024917912,0.000007582854,0.0000019943998,0.000020205733,0.00003477033,0.0001665454,0.000067173736,0.9984301,0.00039655773,0.0008410947],"study_design_scores_gemma":[0.0000027492704,0.0000011364559,0.000027543498,0.0000038775065,0.0000014329026,0.000019044102,0.0000145985705,0.0009591002,0.00005310267,0.998252,0.00066164497,0.0000036691963],"about_ca_topic_score_codex":0.001958297,"about_ca_topic_score_gemma":0.00099445,"teacher_disagreement_score":0.009258814,"about_ca_system_score_codex":0.0015398088,"about_ca_system_score_gemma":0.00081373437,"threshold_uncertainty_score":0.030973792},"labels":[],"label_agreement":null},{"id":"W2079314478","doi":"10.1016/j.laa.2012.01.033","title":"Eigenvalues of graphs with vertices of large degree at distance three apart","year":2012,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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":"Mathematics; Combinatorics; Degree (music); Eigenvalues and eigenvectors; Pairwise comparison; Discrete mathematics; Chordal graph; Graph; Statistics","score_opus":0.044561146935888536,"score_gpt":0.3027895719624634,"score_spread":0.2582284250265749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079314478","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8249529,0.00050581055,0.12956631,0.0018663375,0.00029531086,0.000053794265,0.00028733278,0.0006578825,0.041814238],"genre_scores_gemma":[0.9846572,0.00014741965,0.009108956,0.00013823842,0.000093132854,0.00005240767,0.00008867134,0.00009181471,0.0056221583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999405,0.00015834105,0.000021363427,0.000103916005,0.00018505767,0.0001263271],"domain_scores_gemma":[0.99736017,0.0012541012,0.00041425912,0.00023240632,0.00021685615,0.000522233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005602847,0.00074257475,0.0007624228,0.0024129315,0.0011895428,0.00185944,0.00116125,0.0014779465,0.0060909796],"category_scores_gemma":[0.0037610054,0.00049507164,0.0004663388,0.0011247537,0.002214776,0.0021883547,0.0015333003,0.0013826697,0.0009254735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026185878,0.000101377074,0.0010784697,0.00010125051,0.000026317199,0.0004565239,0.0007733403,0.010763222,0.013007382,0.9613966,0.0030204763,0.009013208],"study_design_scores_gemma":[0.000051220042,0.000032572843,0.0012656957,0.000020561074,0.000013156402,0.0003327088,0.00054118107,0.0393256,0.0024348772,0.95451945,0.0014140973,0.00004894008],"about_ca_topic_score_codex":0.00055265904,"about_ca_topic_score_gemma":0.0005765318,"teacher_disagreement_score":0.0060909796,"about_ca_system_score_codex":0.00066483364,"about_ca_system_score_gemma":0.0003254504,"threshold_uncertainty_score":0.020376325},"labels":[],"label_agreement":null},{"id":"W2081819660","doi":"10.1007/s00037-013-0078-4","title":"The NOF Multiparty Communication Complexity of Composed Functions","year":2014,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Graph theory and applications","field":"Mathematics","cited_by":14,"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é de Montréal; McGill University","funders":"","keywords":"Communication complexity; Computer science; Theoretical computer science; Mathematics; Discrete mathematics","score_opus":0.15298541159022244,"score_gpt":0.3443344110008818,"score_spread":0.19134899941065936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081819660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2472179,0.0042673605,0.5975139,0.02472742,0.0008679447,0.00022788912,0.0018773745,0.0005105616,0.12278973],"genre_scores_gemma":[0.93716586,0.0017533866,0.037672453,0.0010808619,0.0013611988,0.00048015628,0.00071402127,0.00032447634,0.019447595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99105436,0.0034878573,0.00033896588,0.001543455,0.0021872148,0.0013881704],"domain_scores_gemma":[0.9443374,0.04422655,0.0019294972,0.005974976,0.001878312,0.001653278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00657186,0.0015470335,0.0033770923,0.002203303,0.0032431243,0.007988448,0.0051640305,0.005143609,0.01155181],"category_scores_gemma":[0.04321137,0.0012052619,0.0023619672,0.002605587,0.006339183,0.027838022,0.005743122,0.008893932,0.0012292356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014006384,0.000055242406,0.00043701153,0.00010992888,0.000031357766,0.000055346394,0.00016490056,0.015154916,0.00034319918,0.97209734,0.0036859808,0.0077245855],"study_design_scores_gemma":[0.00001353011,0.000010616847,0.00019818536,0.000018957593,0.000014946488,0.000044687557,0.000028170598,0.04425041,0.00022987755,0.9542962,0.00087909464,0.000015361142],"about_ca_topic_score_codex":0.0013317531,"about_ca_topic_score_gemma":0.000978742,"teacher_disagreement_score":0.01155181,"about_ca_system_score_codex":0.005952928,"about_ca_system_score_gemma":0.002921571,"threshold_uncertainty_score":0.04319167},"labels":[],"label_agreement":null},{"id":"W2082281988","doi":"10.1016/j.disc.2007.11.065","title":"The chromatic number of 5-valent circulants","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"McMaster University","funders":"","keywords":"Circulant matrix; Mathematics; Combinatorics; Chromatic scale; Degree (music); Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.050005829680336726,"score_gpt":0.3275820930475847,"score_spread":0.27757626336724794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082281988","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9122396,0.0005499454,0.016814174,0.001384112,0.00028713827,0.000048327583,0.000639,0.00022466022,0.06781303],"genre_scores_gemma":[0.98377407,0.0003444328,0.005257107,0.00021042468,0.00018472008,0.000050064395,0.00038289712,0.00009216027,0.009704182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993438,0.00013364153,0.000024856372,0.00014627764,0.00016361817,0.00018778104],"domain_scores_gemma":[0.9962592,0.0017441798,0.00064731773,0.00027233674,0.00038199907,0.0006950821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078277313,0.0007959931,0.0006145355,0.004249231,0.0029314125,0.004157124,0.0015550014,0.0016250939,0.010571576],"category_scores_gemma":[0.00394756,0.0005524802,0.00046385278,0.0027206154,0.0036170993,0.0023987861,0.0012460521,0.0016268682,0.0010035206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037640467,0.00006521916,0.0023405056,0.00010509164,0.000030054518,0.00020629152,0.0006084932,0.008933267,0.00962846,0.95924234,0.005407864,0.013056004],"study_design_scores_gemma":[0.000105243256,0.00009764482,0.0051421924,0.00008177934,0.0000650043,0.0004122142,0.0004024856,0.038980618,0.0061695715,0.93872607,0.009708848,0.00010817556],"about_ca_topic_score_codex":0.004084474,"about_ca_topic_score_gemma":0.0055679786,"teacher_disagreement_score":0.010571576,"about_ca_system_score_codex":0.0023794838,"about_ca_system_score_gemma":0.0011323866,"threshold_uncertainty_score":0.035365403},"labels":[],"label_agreement":null},{"id":"W2082415350","doi":"10.1016/j.laa.2006.06.003","title":"Transition matrices for well-conditioned Markov chains","year":2006,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":15,"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","funders":"","keywords":"Mathematics; Markov chain; Combinatorics; Order (exchange); Matrix (chemical analysis); Conditioning; Block matrix; Stochastic matrix; Discrete mathematics; Eigenvalues and eigenvectors; Statistics","score_opus":0.014967978482743557,"score_gpt":0.27657112509591864,"score_spread":0.2616031466131751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082415350","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.02512585,0.00068591733,0.9679713,0.0007400426,0.00015971462,0.000055073335,0.0005675808,0.0003062495,0.0043882527],"genre_scores_gemma":[0.7714023,0.0038201038,0.19274208,0.0010837622,0.0011886425,0.00074730895,0.002031224,0.00053440424,0.026450176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99698776,0.0010776989,0.00018586504,0.0008087669,0.0006086119,0.00033130235],"domain_scores_gemma":[0.9730752,0.019821662,0.0025003818,0.0015558111,0.001986517,0.001060428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003546264,0.0016193822,0.0018162108,0.0029748713,0.001262909,0.0038132167,0.0021987192,0.0024404514,0.011739676],"category_scores_gemma":[0.02146006,0.0011182842,0.001377354,0.0027485117,0.003934196,0.006772063,0.0018274097,0.0045581297,0.0016411609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003137586,0.000037784772,0.0001819922,0.000056401677,0.000025764297,0.00006061616,0.00016659885,0.021625856,0.00057962124,0.9707456,0.00089506264,0.00559328],"study_design_scores_gemma":[0.00000633102,0.000008133673,0.00008036808,0.000011229661,0.000007086634,0.000024549647,0.000015169321,0.08326995,0.00013087271,0.9159692,0.0004586257,0.000018487057],"about_ca_topic_score_codex":0.0042154496,"about_ca_topic_score_gemma":0.0049684932,"teacher_disagreement_score":0.011739676,"about_ca_system_score_codex":0.0020853668,"about_ca_system_score_gemma":0.0021131067,"threshold_uncertainty_score":0.039273083},"labels":[],"label_agreement":null},{"id":"W2082950950","doi":"10.4171/qt/62","title":"Erratum to: Hecke algebras, finite general linear groups, and Heisenberg categorification","year":2015,"lang":"en","type":"erratum","venue":"Quantum Topology","topic":"Graph theory and applications","field":"Mathematics","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 Ottawa","funders":"","keywords":"Categorification; Mathematics; Pure mathematics; Algebra over a field","score_opus":0.05601482815729889,"score_gpt":0.33397952597787484,"score_spread":0.2779646978205759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082950950","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.0013698429,0.006473853,0.0020479592,0.09666362,0.8341515,0.00004185717,0.0020593011,0.0003448514,0.05684727],"genre_scores_gemma":[0.039782356,0.017666362,0.006174343,0.044542942,0.15607795,0.00012375192,0.0041763075,0.0007851731,0.7306708],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983991,0.0002452027,0.00029065582,0.00024391346,0.00071969436,0.00010139666],"domain_scores_gemma":[0.9948125,0.0016583542,0.00032289696,0.00045706343,0.0024477516,0.00030143384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019982194,0.0011980308,0.0013847551,0.0040910547,0.0029477584,0.004339602,0.0019132304,0.0032076002,0.06330692],"category_scores_gemma":[0.01585687,0.00054154295,0.00080698554,0.0030154684,0.002533413,0.0055135004,0.0014459636,0.0037844884,0.017721834],"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.00002963805,0.000012468015,0.000081742175,0.000113664755,0.0000063207185,0.0001122222,0.000062328305,0.00011006727,0.00003937,0.023611883,0.96737635,0.008443996],"study_design_scores_gemma":[0.000024026076,0.000024129959,0.00087792386,0.00029908365,0.000022217308,0.00034212545,0.0002582352,0.00039237054,0.00019896797,0.04111619,0.95640856,0.000036109195],"about_ca_topic_score_codex":0.0068518687,"about_ca_topic_score_gemma":0.010926418,"teacher_disagreement_score":0.06330692,"about_ca_system_score_codex":0.0043397294,"about_ca_system_score_gemma":0.0029020647,"threshold_uncertainty_score":0.21178275},"labels":[],"label_agreement":null},{"id":"W2083797191","doi":"10.1016/j.laa.2015.03.018","title":"On graphs with near minimal distance energy","year":2015,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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":"McGill University","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Mathematics; Distance matrix; Combinatorics; Connectivity; Eigenvalues and eigenvectors; Order (exchange); Graph; Discrete mathematics; Physics","score_opus":0.027487099275776715,"score_gpt":0.2742444157740797,"score_spread":0.246757316498303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083797191","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46265042,0.0034853774,0.3882307,0.008529161,0.0006666172,0.0000965202,0.0008317796,0.00048961124,0.13501993],"genre_scores_gemma":[0.8985952,0.0016387855,0.04763654,0.0017102361,0.0008869534,0.00016136254,0.00068253855,0.00036466823,0.048323624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993043,0.00027299597,0.000024146977,0.00015804058,0.00015514145,0.0000853919],"domain_scores_gemma":[0.9973224,0.0015128708,0.0003518333,0.0002560096,0.00022601905,0.0003309543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068413815,0.0008699989,0.0014670305,0.0036167882,0.0020979953,0.002395795,0.0018505264,0.002269079,0.010242296],"category_scores_gemma":[0.003953931,0.0006406649,0.0008188651,0.0024233528,0.0029650566,0.0056211744,0.002792837,0.0028102307,0.0012670229],"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.00001872348,0.000015917727,0.000097853794,0.00004683565,0.000006806438,0.000025483852,0.000099588135,0.0018388235,0.0005103604,0.9924475,0.0011478041,0.003744291],"study_design_scores_gemma":[0.0000037397137,0.0000047223716,0.00009958024,0.000008701549,0.0000032695975,0.00004065354,0.00004505369,0.005832405,0.00010247266,0.9930212,0.0008332935,0.0000049772275],"about_ca_topic_score_codex":0.00079560105,"about_ca_topic_score_gemma":0.0009703726,"teacher_disagreement_score":0.010242296,"about_ca_system_score_codex":0.0012794434,"about_ca_system_score_gemma":0.0003659684,"threshold_uncertainty_score":0.03426385},"labels":[],"label_agreement":null},{"id":"W2086492126","doi":"10.1016/s0012-365x(03)00041-4","title":"Weighted graphs with all Hamiltonian cycles of the same length","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","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 New Brunswick","funders":"","keywords":"Mathematics; Combinatorics; Hamiltonian (control theory); Undirected graph; Hamiltonian path; Discrete mathematics; Directed graph; Simple (philosophy); Characterization (materials science); Indifference graph; Pancyclic graph; Graph; Chordal graph; 1-planar graph","score_opus":0.02701261443584759,"score_gpt":0.2765974889872433,"score_spread":0.2495848745513957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086492126","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68699634,0.0011691628,0.22920877,0.0013942927,0.00045974617,0.000364611,0.0033222442,0.000444156,0.076640666],"genre_scores_gemma":[0.87666404,0.0013716167,0.07389058,0.00054660864,0.0002359726,0.00055931765,0.00307301,0.00029598808,0.04336288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992349,0.00015140243,0.00005751523,0.0002022911,0.00016761855,0.0001863019],"domain_scores_gemma":[0.9979201,0.00058961957,0.00039104157,0.000412796,0.00044271638,0.00024366463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041166536,0.0011047571,0.00079539296,0.002018183,0.001752451,0.0018152309,0.0015156117,0.0009833627,0.008193349],"category_scores_gemma":[0.0031417278,0.00062392355,0.000804652,0.0020945668,0.0011275397,0.003404484,0.0015005613,0.000995672,0.0012825185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064565404,0.00017737539,0.002891975,0.00073909166,0.00033149117,0.00083924114,0.00069769786,0.008928633,0.023654377,0.85538054,0.00972032,0.09599364],"study_design_scores_gemma":[0.000064407664,0.000086609165,0.001769676,0.00007906276,0.00017727308,0.00067603367,0.00037985088,0.011990609,0.008728105,0.9572237,0.018775644,0.00004900423],"about_ca_topic_score_codex":0.0008185117,"about_ca_topic_score_gemma":0.0014664389,"teacher_disagreement_score":0.008193349,"about_ca_system_score_codex":0.000551692,"about_ca_system_score_gemma":0.0005980805,"threshold_uncertainty_score":0.027409494},"labels":[],"label_agreement":null},{"id":"W2086987965","doi":"10.1007/s00373-014-1498-x","title":"Bounds and Relations Involving Adjusted Centrality of the Vertices of a Tree","year":2014,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Graph theory and applications","field":"Mathematics","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"European Commission","keywords":"Betweenness centrality; Combinatorics; Mathematics; Vertex (graph theory); Upper and lower bounds; Degree (music); Enhanced Data Rates for GSM Evolution; Neighbourhood (mathematics); Discrete mathematics; Graph; Centrality; Physics; Computer science","score_opus":0.02340104887465191,"score_gpt":0.2437281785376534,"score_spread":0.2203271296630015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086987965","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49612954,0.005571716,0.44289863,0.0030997861,0.00038658245,0.000063145024,0.00078700983,0.00043880584,0.05062479],"genre_scores_gemma":[0.9599195,0.0013108853,0.03266765,0.00035932992,0.0005914517,0.00008631833,0.00033438337,0.00029157673,0.0044388697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99599755,0.0014314922,0.00015343558,0.0010204694,0.00080927886,0.00058784836],"domain_scores_gemma":[0.88788706,0.090527415,0.007252944,0.005556843,0.004406763,0.0043689613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046881214,0.001065793,0.0015298525,0.0062776557,0.0020968795,0.006394695,0.0044726157,0.0022657865,0.0071679545],"category_scores_gemma":[0.06220528,0.0010675869,0.00087500026,0.0065600467,0.0058964547,0.0125483405,0.003219779,0.005414683,0.0007794697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014465429,0.00006611208,0.0033881355,0.00016036433,0.000075466574,0.00015667864,0.00068106403,0.02386464,0.0030009074,0.95717585,0.0020337675,0.009252389],"study_design_scores_gemma":[0.000016812155,0.000032166638,0.0021635112,0.000046634963,0.000070851514,0.0001716183,0.00019149767,0.060181163,0.00087495655,0.93440574,0.0017883601,0.000056558525],"about_ca_topic_score_codex":0.0028176457,"about_ca_topic_score_gemma":0.003583679,"teacher_disagreement_score":0.0071679545,"about_ca_system_score_codex":0.0026527164,"about_ca_system_score_gemma":0.00089441746,"threshold_uncertainty_score":0.024793506},"labels":[],"label_agreement":null},{"id":"W2087515793","doi":"10.5666/kmj.2014.54.3.425","title":"The Spectral Radii of Graphs with Prescribed Degree Sequence","year":2014,"lang":"en","type":"article","venue":"Kyungpook mathematical journal","topic":"Graph theory and applications","field":"Mathematics","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":"Mathematics; Degree (music); Sequence (biology); Spectral radius; Combinatorics; Discrete mathematics; Eigenvalues and eigenvectors; Physics","score_opus":0.06201155522019374,"score_gpt":0.3014321795731822,"score_spread":0.23942062435298844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087515793","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.799148,0.00078584155,0.17283095,0.00028188628,0.000034547855,0.000060993,0.00047390885,0.00035369614,0.026030062],"genre_scores_gemma":[0.98062336,0.00024594626,0.017953943,0.00003237609,0.00001654617,0.000044740445,0.00014140258,0.00006285398,0.00087882666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937963,0.00022657428,0.000030427538,0.00013326437,0.00014528727,0.00008477014],"domain_scores_gemma":[0.99607915,0.0020368241,0.000729323,0.00029841685,0.0005091675,0.0003471573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006188927,0.00039146887,0.00042065623,0.0020587523,0.0005267896,0.0007458317,0.00055957894,0.0004491253,0.0019531315],"category_scores_gemma":[0.007517501,0.0002647364,0.00021842694,0.0010696923,0.0012144002,0.0013725875,0.00071503955,0.00041834463,0.00034916753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054721656,0.00008487792,0.0054628514,0.0004416562,0.00005885964,0.00026103554,0.0007060429,0.17340732,0.081691876,0.68384546,0.004025483,0.049467392],"study_design_scores_gemma":[0.000055991375,0.00020873769,0.0074752765,0.00011958617,0.000055211432,0.0010467886,0.00059813797,0.4112303,0.0464244,0.5263055,0.0063925777,0.00008747101],"about_ca_topic_score_codex":0.00051827804,"about_ca_topic_score_gemma":0.0005643382,"teacher_disagreement_score":0.0020587523,"about_ca_system_score_codex":0.00059384113,"about_ca_system_score_gemma":0.00028708775,"threshold_uncertainty_score":0.006533861},"labels":[],"label_agreement":null},{"id":"W2087636390","doi":"10.1016/j.laa.2007.10.019","title":"Primitive digraphs with smallest large exponent","year":2008,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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":"Digraph; Exponent; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.03608021849039929,"score_gpt":0.2739166751039139,"score_spread":0.2378364566135146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087636390","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5942081,0.0013803166,0.25000298,0.0041295392,0.0006498737,0.00019495448,0.0022601027,0.0011759794,0.14599824],"genre_scores_gemma":[0.9295617,0.00078663335,0.035575528,0.0005465064,0.0003551601,0.00012112742,0.0006836833,0.0002272177,0.032142453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995932,0.00007635955,0.000026713593,0.000108521555,0.000108168075,0.00008699294],"domain_scores_gemma":[0.99555796,0.0025183023,0.00033972677,0.00059230055,0.00036790792,0.0006237348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048198798,0.00058980385,0.0014154346,0.0021776003,0.002083728,0.0027110905,0.00088107877,0.00096359226,0.009565017],"category_scores_gemma":[0.003892254,0.00066076545,0.00058622984,0.0021871512,0.002055791,0.005006682,0.001753807,0.0034785348,0.0013499884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070831404,0.000022087557,0.00020837695,0.00006312626,0.000007073814,0.00011537271,0.00019231363,0.00042679033,0.0015557496,0.9880322,0.0020379794,0.0072679636],"study_design_scores_gemma":[0.000026567921,0.000015418946,0.00019326407,0.000010513685,0.000011120031,0.00015560976,0.000053823213,0.0019953249,0.0007307903,0.9934002,0.0033959216,0.000011518736],"about_ca_topic_score_codex":0.00040455748,"about_ca_topic_score_gemma":0.00094699534,"teacher_disagreement_score":0.009565017,"about_ca_system_score_codex":0.0010800451,"about_ca_system_score_gemma":0.0006239533,"threshold_uncertainty_score":0.031998217},"labels":[],"label_agreement":null},{"id":"W2087638833","doi":"10.1016/j.laa.2011.11.015","title":"Bipartiteness and the least eigenvalue of signless Laplacian of graphs","year":2012,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":49,"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","funders":"","keywords":"Mathematics; Combinatorics; Algebraic connectivity; Social connectedness; Vertex (graph theory); Eigenvalues and eigenvectors; Simple graph; Graph; Discrete mathematics; Laplace operator; Laplacian matrix; Algebraic number; Mathematical analysis; Physics","score_opus":0.031197394822233614,"score_gpt":0.2938382310710607,"score_spread":0.2626408362488271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087638833","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7130401,0.0014113972,0.236618,0.0047661765,0.0004544273,0.000043925935,0.00032946287,0.0003472972,0.042989258],"genre_scores_gemma":[0.9776676,0.0005614812,0.012847305,0.00042518674,0.0006397685,0.000055348366,0.00021067589,0.00009627533,0.0074964087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991155,0.00035784076,0.000036615522,0.00017763626,0.00020141575,0.000110998044],"domain_scores_gemma":[0.9941553,0.0033450641,0.00081564335,0.0002821242,0.00063690124,0.00076499756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011923397,0.0007588324,0.00088547287,0.0023658674,0.0011390428,0.0025144073,0.0012275337,0.0017155128,0.005453605],"category_scores_gemma":[0.008150658,0.0005048364,0.00047270887,0.0013211324,0.0039025724,0.003609815,0.0013157976,0.0018958063,0.00064731744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009462634,0.00007602962,0.00087232795,0.00008486006,0.000020713984,0.00013584337,0.0004390867,0.0041403067,0.005323169,0.97831076,0.0025290924,0.007973122],"study_design_scores_gemma":[0.000013862678,0.00001624309,0.0004505539,0.000010492069,0.0000057329507,0.000092706374,0.00009974173,0.014913637,0.00047290875,0.9834366,0.0004667682,0.000020695179],"about_ca_topic_score_codex":0.000851005,"about_ca_topic_score_gemma":0.000979131,"teacher_disagreement_score":0.005453605,"about_ca_system_score_codex":0.0006607594,"about_ca_system_score_gemma":0.0006282931,"threshold_uncertainty_score":0.018244147},"labels":[],"label_agreement":null},{"id":"W2090624309","doi":"10.1016/s0024-3795(01)00504-3","title":"Maximal graphs and graphs with maximal spectral radius","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":15,"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; Combinatorics; Adjacency matrix; Spectral radius; Discrete mathematics; Pathwidth; Indifference graph; Chordal graph; 1-planar graph; Line graph; Graph; Eigenvalues and eigenvectors","score_opus":0.025548625859781446,"score_gpt":0.25199558423793,"score_spread":0.22644695837814854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090624309","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4638713,0.009882435,0.34627244,0.008409305,0.00056368037,0.00011773445,0.001068801,0.0014271564,0.16838714],"genre_scores_gemma":[0.93583,0.0030996222,0.045062196,0.000762194,0.00095789216,0.00016495102,0.0005020116,0.00023858539,0.013382617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987141,0.00053668395,0.00005354419,0.00033010074,0.00021652211,0.00014900604],"domain_scores_gemma":[0.99417555,0.0034101203,0.0009342731,0.0004633875,0.00037649702,0.00064012996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011267677,0.0011387933,0.001954622,0.004247619,0.0023360716,0.0041524423,0.001761681,0.0019669197,0.008137015],"category_scores_gemma":[0.006387546,0.0010927119,0.0009766322,0.003630634,0.0048852065,0.007699788,0.002875176,0.0024320092,0.0014820273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033247466,0.000008477874,0.000116596064,0.000055636516,0.000008793628,0.000023317165,0.000167964,0.00067508855,0.0005643702,0.9941731,0.0011211763,0.003052186],"study_design_scores_gemma":[0.000008754507,0.0000065594677,0.00013320803,0.000013438594,0.00001421673,0.00010203133,0.00010611896,0.0023323954,0.0004052933,0.9948879,0.0019816495,0.000008523715],"about_ca_topic_score_codex":0.0005239128,"about_ca_topic_score_gemma":0.00061332516,"teacher_disagreement_score":0.008137015,"about_ca_system_score_codex":0.001124781,"about_ca_system_score_gemma":0.00047636626,"threshold_uncertainty_score":0.027221024},"labels":[],"label_agreement":null},{"id":"W2092460080","doi":"10.1016/j.jfa.2011.12.010","title":"Sharp bounds for sums associated to graphs of matrices","year":2011,"lang":"en","type":"article","venue":"Journal of Functional Analysis","topic":"Graph theory and applications","field":"Mathematics","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Simple (philosophy); Graph; Matrix (chemical analysis); Simple graph; Discrete mathematics; Mathematical analysis","score_opus":0.10513221806157182,"score_gpt":0.312798234782991,"score_spread":0.2076660167214192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092460080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2468138,0.007216743,0.65449846,0.0067661973,0.0015590016,0.00010381442,0.0007182697,0.0010380872,0.081285655],"genre_scores_gemma":[0.86900413,0.0045213844,0.08508787,0.0021972952,0.0036730836,0.00035237113,0.001013051,0.0014186614,0.032732233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99656075,0.0011801152,0.00017717865,0.0005937932,0.0009470367,0.00054119027],"domain_scores_gemma":[0.96695685,0.024312168,0.0023838796,0.0015822806,0.0020722006,0.002692591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039562094,0.003450707,0.0025428701,0.0075366367,0.002616928,0.006997948,0.004375125,0.003293333,0.010521132],"category_scores_gemma":[0.033539437,0.0018073595,0.0021913354,0.0038893893,0.006070006,0.012485718,0.006281869,0.0075707175,0.0015548615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096971395,0.000061417784,0.0004496763,0.00019443882,0.000051456198,0.00012938307,0.0003259301,0.006073109,0.0018797957,0.98096704,0.0029309702,0.00683996],"study_design_scores_gemma":[0.0000068619293,0.000015048773,0.00021475129,0.000043749744,0.000028351807,0.00010425388,0.000063353116,0.02715797,0.00045708605,0.9708001,0.0010882246,0.00002022845],"about_ca_topic_score_codex":0.0008736685,"about_ca_topic_score_gemma":0.001305861,"teacher_disagreement_score":0.010521132,"about_ca_system_score_codex":0.0021906318,"about_ca_system_score_gemma":0.0008240808,"threshold_uncertainty_score":0.03519672},"labels":[],"label_agreement":null},{"id":"W2093473133","doi":"10.1016/j.laa.2006.07.012","title":"Constructably Laplacian integral graphs","year":2006,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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 Regina","funders":"","keywords":"Mathematics; Resistance distance; Laplacian matrix; Integral graph; Combinatorics; Algebraic connectivity; Laplace operator; Isospectral; Vertex (graph theory); Discrete mathematics; Indifference graph; 1-planar graph; Line graph; Graph; Voltage graph; Pure mathematics; Mathematical analysis; Graph power","score_opus":0.01591542347482309,"score_gpt":0.27142873288454866,"score_spread":0.25551330940972555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093473133","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41612098,0.0012190223,0.23125851,0.005314665,0.00050250255,0.0000864636,0.00046551184,0.0009970505,0.34403527],"genre_scores_gemma":[0.9131738,0.0008551374,0.02339475,0.0008493158,0.00056108437,0.000083442406,0.00040696902,0.0002705804,0.060404822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937385,0.00011970545,0.000022121625,0.00014024539,0.00021805213,0.00012605875],"domain_scores_gemma":[0.99895895,0.00038217715,0.00012820392,0.00012414707,0.00017348584,0.00023297674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067622325,0.0008777806,0.0009072471,0.0033007634,0.0022372536,0.0034962958,0.0011418561,0.0011946185,0.011132333],"category_scores_gemma":[0.0020615757,0.00050797104,0.00077434105,0.0024420866,0.00327527,0.0060426653,0.0031706141,0.0041313465,0.0010570035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007888287,0.000010427177,0.00004261599,0.000008318893,0.0000018738754,0.000017425818,0.00008341809,0.00015423418,0.00028307142,0.99706715,0.0005314309,0.0017921345],"study_design_scores_gemma":[0.000004471989,0.0000037729314,0.000069358546,0.0000036454576,0.000004882322,0.000050990322,0.00005617956,0.0012425754,0.00027401114,0.9964371,0.0018487067,0.0000044002395],"about_ca_topic_score_codex":0.00063844654,"about_ca_topic_score_gemma":0.00082478113,"teacher_disagreement_score":0.011132333,"about_ca_system_score_codex":0.0016324532,"about_ca_system_score_gemma":0.0005036948,"threshold_uncertainty_score":0.03724134},"labels":[],"label_agreement":null},{"id":"W2095635870","doi":"10.1016/j.jmaa.2016.08.020","title":"Adjacency matrices of random digraphs: Singularity and anti-concentration","year":2016,"lang":"en","type":"preprint","venue":"Journal of Mathematical Analysis and Applications","topic":"Graph theory and applications","field":"Mathematics","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 Alberta","funders":"Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Adjacency matrix; Invertible matrix; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.021621113742358228,"score_gpt":0.30433190159584805,"score_spread":0.2827107878534898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095635870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43357086,0.0022207554,0.5377,0.0051304772,0.00031440318,0.00011374501,0.00085713086,0.0005121067,0.01958051],"genre_scores_gemma":[0.968731,0.0010989859,0.021445509,0.00066795904,0.0004344694,0.0000966931,0.0004038587,0.000113863876,0.007007702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881184,0.00046610244,0.00005246509,0.00032824252,0.00021014235,0.0001311414],"domain_scores_gemma":[0.98510194,0.009457536,0.001965304,0.00083879585,0.0013135461,0.0013229655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017629922,0.00095431297,0.0014103358,0.0029846518,0.0011642948,0.0032105793,0.0022696478,0.0024957957,0.0038282005],"category_scores_gemma":[0.022776779,0.0011211679,0.00072458474,0.0017282441,0.0032761795,0.004718499,0.0020452957,0.0023646972,0.00053617364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057196496,0.000051869625,0.0014448629,0.000107943226,0.00003762969,0.00024464945,0.0002488928,0.021319699,0.0015790765,0.96581584,0.003226958,0.0058653164],"study_design_scores_gemma":[0.000018260196,0.000018690069,0.00055437564,0.000023505752,0.000015471784,0.00025813864,0.000080745296,0.1301677,0.0002866691,0.867731,0.00081666996,0.000028753335],"about_ca_topic_score_codex":0.001533187,"about_ca_topic_score_gemma":0.0016997351,"teacher_disagreement_score":0.0038282005,"about_ca_system_score_codex":0.0012893872,"about_ca_system_score_gemma":0.0007590211,"threshold_uncertainty_score":0.012806594},"labels":[],"label_agreement":null},{"id":"W2096188165","doi":"10.1016/j.jctb.2008.08.005","title":"Cayley sum graphs and eigenvalues of<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mo stretchy=\"false\">(</mml:mo><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mn>6</mml:mn><mml:mo stretchy=\"false\">)</mml:mo></mml:math>-fullerenes","year":2008,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":38,"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; Scroll; Eigenvalues and eigenvectors; Discrete mathematics; Combinatorics; Physics; Theology","score_opus":0.01973134371674429,"score_gpt":0.24777375698998824,"score_spread":0.22804241327324395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096188165","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5846018,0.0012215216,0.08420171,0.002241688,0.0005809126,0.00008006019,0.0010988952,0.0006599193,0.32531342],"genre_scores_gemma":[0.9364802,0.0007328653,0.0135507705,0.0004196742,0.00017595594,0.00008468311,0.00051980425,0.00019064569,0.047845427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998067,0.000029996168,0.0000066019143,0.00004035825,0.00006924023,0.000047123678],"domain_scores_gemma":[0.9994543,0.00017675642,0.00009211144,0.00004903632,0.00011887797,0.00010887768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001913366,0.0004517296,0.00029932542,0.0021019662,0.0012258347,0.0018071076,0.00050013466,0.00075215776,0.024715073],"category_scores_gemma":[0.0013312788,0.00026726536,0.00028427094,0.00082030095,0.00094503455,0.0016324478,0.00068328873,0.000967226,0.00230995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030315123,0.000023304849,0.00023162212,0.000038673108,0.0000066530833,0.0001336412,0.00011534168,0.001730911,0.002308175,0.9810213,0.006089283,0.008270767],"study_design_scores_gemma":[0.000014487269,0.0000127891535,0.0006074567,0.000022291983,0.0000048997576,0.00016987085,0.00018624592,0.010371651,0.0016744934,0.98148847,0.0054261247,0.000021289505],"about_ca_topic_score_codex":0.0012988274,"about_ca_topic_score_gemma":0.0020609049,"teacher_disagreement_score":0.024715073,"about_ca_system_score_codex":0.00058230973,"about_ca_system_score_gemma":0.00036136346,"threshold_uncertainty_score":0.082680106},"labels":[],"label_agreement":null},{"id":"W2096789153","doi":"10.1016/j.dam.2008.03.036","title":"The minimum degree distance of graphs of given order and size","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":57,"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","keywords":"Mathematics; Degree (music); Wiener index; Combinatorics; Graph; Connectivity; Order (exchange); Discrete mathematics","score_opus":0.03530198614291502,"score_gpt":0.2710003486580169,"score_spread":0.2356983625151019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096789153","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93228334,0.0010078462,0.049896028,0.002469486,0.00012668643,0.000045604982,0.0013988243,0.00020394207,0.012568258],"genre_scores_gemma":[0.96306366,0.0008159216,0.030677032,0.0002202251,0.0001914046,0.00009282984,0.0010258472,0.0001686368,0.0037443605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991278,0.0002429037,0.00005085511,0.0002621903,0.00018912237,0.00012706341],"domain_scores_gemma":[0.98638713,0.008869245,0.0013491655,0.0010898558,0.0007232894,0.0015813528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096783484,0.00078946643,0.0015404562,0.0019294213,0.0014889417,0.0027956872,0.0024557002,0.0019551942,0.003421042],"category_scores_gemma":[0.012645901,0.0006769139,0.0006824242,0.0015784227,0.002015511,0.0045054276,0.0015302132,0.0019251755,0.00048365773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002911401,0.00036529705,0.02272157,0.0015015161,0.00031573512,0.0005239775,0.0021874704,0.14153162,0.03227182,0.71045125,0.012767156,0.07245128],"study_design_scores_gemma":[0.00020579033,0.00031553025,0.009243074,0.00012656026,0.00013256398,0.0009778667,0.0008817666,0.12525283,0.01144943,0.8447803,0.006564786,0.00006941666],"about_ca_topic_score_codex":0.0008056904,"about_ca_topic_score_gemma":0.0013230294,"teacher_disagreement_score":0.003421042,"about_ca_system_score_codex":0.0017030588,"about_ca_system_score_gemma":0.0007955525,"threshold_uncertainty_score":0.012356579},"labels":[],"label_agreement":null},{"id":"W2097673542","doi":"10.1007/s13348-010-0035-3","title":"Erratum to: Classifying Hilbert functions of fat point subschemes in $${\\mathbb{P}^{2}}$$","year":2011,"lang":"en","type":"erratum","venue":"Collectanea mathematica","topic":"Graph theory and applications","field":"Mathematics","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":"Queen's University","funders":"","keywords":"Mathematics; Pure mathematics; Point (geometry); Discrete mathematics; Algebra over a field; Geometry","score_opus":0.0583499926461749,"score_gpt":0.2953490238392789,"score_spread":0.236999031193104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097673542","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.0025244744,0.0024837684,0.004591783,0.12004449,0.73238665,0.00006550529,0.0036383676,0.0010138941,0.13325109],"genre_scores_gemma":[0.031900555,0.0059896125,0.009742929,0.03469119,0.06950037,0.00016269239,0.0062820874,0.0023394427,0.83939105],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980868,0.0002870765,0.00026443548,0.00029134768,0.0008902732,0.0001802334],"domain_scores_gemma":[0.99621755,0.0012000568,0.00019418684,0.00040177818,0.0017444644,0.00024195793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015129066,0.0020413226,0.0017856123,0.004099308,0.0052188975,0.004890469,0.0027022813,0.004157868,0.08872993],"category_scores_gemma":[0.014200501,0.0008553304,0.0011321115,0.0033046629,0.0027169576,0.0054845703,0.0016530764,0.0065520965,0.029763563],"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.000028287373,0.000012246243,0.000053007323,0.00006260113,0.0000051526436,0.00007158709,0.00004486274,0.00007760752,0.000049635,0.014687885,0.97938436,0.005522803],"study_design_scores_gemma":[0.000032175205,0.000028591276,0.0012299526,0.0002834037,0.000042113275,0.00048921234,0.00027084694,0.00094611174,0.00057142926,0.03907873,0.95696086,0.00006652402],"about_ca_topic_score_codex":0.011462831,"about_ca_topic_score_gemma":0.018061874,"teacher_disagreement_score":0.08872993,"about_ca_system_score_codex":0.005905759,"about_ca_system_score_gemma":0.0034472176,"threshold_uncertainty_score":0.2968312},"labels":[],"label_agreement":null},{"id":"W2099528956","doi":"10.1007/s00493-006-0024-z","title":"Independent Sets In Association Schemes","year":2006,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Graph theory and applications","field":"Mathematics","cited_by":23,"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; Eigenvalues and eigenvectors; Adjacency matrix; Corollary; Graph; Upper and lower bounds; Discrete mathematics; Mathematical analysis","score_opus":0.017459315025400254,"score_gpt":0.28325560825745477,"score_spread":0.2657962932320545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099528956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2870855,0.0028388174,0.4859536,0.0051988093,0.00066288165,0.00021645906,0.0010668061,0.00059937785,0.21637774],"genre_scores_gemma":[0.86514646,0.002146714,0.0661015,0.00077042135,0.0008786225,0.0003650247,0.000943189,0.00024467506,0.063403405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99708325,0.0008904711,0.00018731106,0.00069017237,0.0007914427,0.0003572381],"domain_scores_gemma":[0.9917973,0.0048856135,0.0006990607,0.0012992066,0.0005924065,0.00072626816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022404438,0.0009988234,0.0018626224,0.004848312,0.005918861,0.009210949,0.0024722351,0.002472029,0.013346882],"category_scores_gemma":[0.0075175087,0.0020308963,0.0016798322,0.009120577,0.0068771276,0.0155267725,0.0064547323,0.008111654,0.0022596645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000098353285,0.000009081812,0.00009056786,0.000013004469,0.0000031159332,0.000017645274,0.00019844667,0.00020730024,0.000069504655,0.99662685,0.00039871395,0.002355879],"study_design_scores_gemma":[0.000006087976,0.000003273329,0.00008005444,0.0000088059505,0.00001002752,0.000053499727,0.0000644604,0.0008268994,0.000104387866,0.99593663,0.0028997613,0.000006003699],"about_ca_topic_score_codex":0.0012109078,"about_ca_topic_score_gemma":0.0010341116,"teacher_disagreement_score":0.013346882,"about_ca_system_score_codex":0.0025663967,"about_ca_system_score_gemma":0.0011376977,"threshold_uncertainty_score":0.04464978},"labels":[],"label_agreement":null},{"id":"W2099618798","doi":"10.1016/j.laa.2010.03.008","title":"Zero forcing parameters and minimum rank problems","year":2010,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":198,"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; University of Regina","funders":"","keywords":"Mathematics; Combinatorics; Positive-definite matrix; Vertex (graph theory); Rank (graph theory); Hermitian matrix; Zero (linguistics); Semidefinite programming; Graph; Discrete mathematics; Eigenvalues and eigenvectors; Pure mathematics; Physics; Mathematical optimization","score_opus":0.025797781773677333,"score_gpt":0.2811280914133138,"score_spread":0.2553303096396365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099618798","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38060057,0.0042416924,0.43842173,0.01447915,0.00081440405,0.00010002473,0.00083239033,0.000873633,0.15963636],"genre_scores_gemma":[0.9261565,0.0014639228,0.0385244,0.0010065741,0.001159476,0.00019135706,0.0006066678,0.00031714307,0.030573977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985499,0.00057226367,0.00005953771,0.00028359407,0.00033624325,0.00019841891],"domain_scores_gemma":[0.9911135,0.0059187245,0.00090211135,0.0008765922,0.00045602344,0.0007330452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001864509,0.0009880634,0.001742486,0.0021240725,0.002576011,0.0048373872,0.002202957,0.0027537267,0.013108873],"category_scores_gemma":[0.010318813,0.0008295217,0.00075828406,0.0018494742,0.0061357133,0.009340695,0.0037616594,0.006207178,0.0015087597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043707103,0.000018503399,0.0000839935,0.000037030008,0.0000054257407,0.000022024058,0.000084724714,0.0015580925,0.00037591488,0.993002,0.0013236325,0.0034449832],"study_design_scores_gemma":[0.000009822497,0.0000043288433,0.0000317764,0.0000056731324,0.0000019892075,0.000016514157,0.000027066857,0.0021344188,0.00012001818,0.9970975,0.00054429204,0.000006700642],"about_ca_topic_score_codex":0.00063854177,"about_ca_topic_score_gemma":0.00071646314,"teacher_disagreement_score":0.013108873,"about_ca_system_score_codex":0.0013021259,"about_ca_system_score_gemma":0.0010712536,"threshold_uncertainty_score":0.04385358},"labels":[],"label_agreement":null},{"id":"W2100348665","doi":"10.1080/15326340008807589","title":"Stochastic block–monotonicity in the approximation of the stationary distribution of infinite markov chains","year":2000,"lang":"en","type":"article","venue":"Communications in Statistics Stochastic Models","topic":"Graph theory and applications","field":"Mathematics","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":"University of Winnipeg","funders":"National Science Foundation","keywords":"Markov chain; Examples of Markov chains; Stochastic matrix; Mathematics; Monotonic function; Markov kernel; Markov property; Markov process; Block (permutation group theory); Continuous-time Markov chain; Markov renewal process; Stationary distribution; Markov model; Markov chain mixing time; Balance equation; Variable-order Markov model; Type (biology); State space; Combinatorics; Statistics; Mathematical analysis","score_opus":0.06425759925380616,"score_gpt":0.327932671502997,"score_spread":0.26367507224919084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100348665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058825888,0.00046939997,0.93738836,0.0002307146,0.000022547918,0.000026478527,0.000095105635,0.00013573337,0.0028057434],"genre_scores_gemma":[0.836872,0.0013696642,0.15661475,0.00012976764,0.00009818748,0.00018462919,0.00040835165,0.00015084163,0.004171828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923503,0.00043352327,0.000027602166,0.00006739993,0.00015255601,0.000083820596],"domain_scores_gemma":[0.9936627,0.004904458,0.0005089825,0.0003068359,0.00045147355,0.00016558776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030006918,0.00050202437,0.0007904393,0.0008958367,0.00035463306,0.0008325934,0.0011407455,0.0006445288,0.0019766414],"category_scores_gemma":[0.013028214,0.0005184302,0.0005405925,0.0006737916,0.0012187805,0.0020172019,0.00091647485,0.001227895,0.0003942859],"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.00009676428,0.00004207325,0.0022654238,0.00012157325,0.000039882543,0.0001370354,0.00016173208,0.6806141,0.0024705653,0.29529133,0.0010029827,0.01775647],"study_design_scores_gemma":[0.0000017093147,0.0000070002143,0.0000943588,0.0000054614306,0.0000015470894,0.000009567337,0.000004935356,0.97808605,0.00012849279,0.021447731,0.00021027117,0.0000028565555],"about_ca_topic_score_codex":0.00500491,"about_ca_topic_score_gemma":0.0035013317,"teacher_disagreement_score":0.00500491,"about_ca_system_score_codex":0.000854385,"about_ca_system_score_gemma":0.001040035,"threshold_uncertainty_score":0.015869379},"labels":[],"label_agreement":null},{"id":"W2113228236","doi":"10.37236/897","title":"A Note on Polynomials and $f$-Factors of Graphs","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","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":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Graph","score_opus":0.025599897312096373,"score_gpt":0.2815963136296713,"score_spread":0.2559964163175749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113228236","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25931853,0.029756667,0.23554878,0.029548656,0.003749235,0.00016293288,0.0012159854,0.0012899708,0.43940923],"genre_scores_gemma":[0.881683,0.019685052,0.05157978,0.0023260007,0.003852241,0.000082403974,0.0006074886,0.00033361933,0.03985047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914443,0.00019360312,0.000037438334,0.00022226742,0.00016785979,0.000234437],"domain_scores_gemma":[0.997095,0.0021216683,0.00017403628,0.00024062055,0.00016160586,0.00020703893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009995427,0.0011738837,0.0008075724,0.0021126724,0.002279684,0.0026645395,0.0009917656,0.0010068341,0.0072519872],"category_scores_gemma":[0.004463932,0.00063901907,0.0013634897,0.002538095,0.005527899,0.0070676226,0.0023183057,0.0042726262,0.0014255986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108026456,0.000045096895,0.0007505247,0.00011498632,0.0000113263295,0.00028028054,0.0005852246,0.0019591607,0.00088068075,0.9663707,0.010370738,0.018523281],"study_design_scores_gemma":[0.000019464058,0.000060910657,0.0005520436,0.00003759087,0.000015201546,0.00033132077,0.00020255127,0.003413279,0.000895535,0.95634216,0.038100436,0.000029613011],"about_ca_topic_score_codex":0.0083517255,"about_ca_topic_score_gemma":0.005372413,"teacher_disagreement_score":0.0083517255,"about_ca_system_score_codex":0.0027215262,"about_ca_system_score_gemma":0.00081872975,"threshold_uncertainty_score":0.024260283},"labels":[],"label_agreement":null},{"id":"W2115358815","doi":"10.1002/qua.24252","title":"The number of spanning trees in an (<i>r</i>, <i>s</i>)‐semiregular graph and its line graph","year":2012,"lang":"en","type":"article","venue":"International Journal of Quantum Chemistry","topic":"Graph theory and applications","field":"Mathematics","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 Waterloo","funders":"","keywords":"Spanning tree; Combinatorics; Line graph; Graph factorization; Cubic graph; Mathematics; Discrete mathematics; Factor-critical graph; Trémaux tree; Minimum spanning tree; Voltage graph; Mathematical proof; Minimum degree spanning tree; Graph; Pathwidth","score_opus":0.03599614359662989,"score_gpt":0.347741997947168,"score_spread":0.3117458543505381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115358815","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82948184,0.0005168316,0.15274407,0.0004284092,0.00007516747,0.000023352244,0.00042301771,0.00020492036,0.016102416],"genre_scores_gemma":[0.9743352,0.00026755285,0.022971906,0.00006901286,0.000059168022,0.000038888655,0.0002071971,0.00004134716,0.0020098467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997676,0.000054520882,0.000018817238,0.000066931934,0.000056885117,0.00003524957],"domain_scores_gemma":[0.99844307,0.00063240586,0.00036752506,0.00012564262,0.00021964853,0.00021179329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034575403,0.00021036432,0.00024453804,0.0011686784,0.00040795017,0.0006779152,0.0005318695,0.0003957289,0.0029060566],"category_scores_gemma":[0.0015120814,0.00014983711,0.00025583195,0.0006507954,0.0008463395,0.0015637588,0.00044933945,0.0004571052,0.0002603053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002010722,0.00007102323,0.007920793,0.00020091311,0.00004360293,0.00034988776,0.00043971982,0.016092574,0.032630324,0.9003972,0.004781512,0.036871273],"study_design_scores_gemma":[0.000032903426,0.00016334509,0.009037487,0.000052083305,0.000047077043,0.0012636934,0.00039212615,0.18458265,0.016977927,0.77950454,0.007890071,0.000056118453],"about_ca_topic_score_codex":0.00034873458,"about_ca_topic_score_gemma":0.00034111436,"teacher_disagreement_score":0.0029060566,"about_ca_system_score_codex":0.0004720924,"about_ca_system_score_gemma":0.00016563239,"threshold_uncertainty_score":0.009721696},"labels":[],"label_agreement":null},{"id":"W2115412864","doi":"10.37236/844","title":"Laplacian Integral Graphs with Maximum Degree $3$","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":9,"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 Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Laplacian matrix; Degree (music); Isomorphism (crystallography); Laplace operator; Graph isomorphism; Algebraic connectivity; Graph; Integral graph; Resistance distance; Discrete mathematics; Line graph; Graph power; Mathematical analysis","score_opus":0.03708730122675955,"score_gpt":0.2623539621124441,"score_spread":0.22526666088568456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115412864","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8234793,0.00051439874,0.110226795,0.0007989388,0.00011232656,0.0000636055,0.0004167069,0.00039842786,0.06398959],"genre_scores_gemma":[0.9703939,0.00045069004,0.022817153,0.00017392568,0.000068541965,0.000049547078,0.00035927555,0.00005294755,0.0056339004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997595,0.0000205977,0.000009781653,0.00005590045,0.00007398695,0.00008022053],"domain_scores_gemma":[0.9994842,0.00014572812,0.000111023226,0.000067685505,0.00008158312,0.00010970151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016125293,0.00036952939,0.00032495282,0.0011251116,0.0010152695,0.0010144602,0.00062315457,0.00045468396,0.0041004005],"category_scores_gemma":[0.0009982465,0.00019408172,0.00036447644,0.0010665893,0.0011234777,0.0012549758,0.001346978,0.00066688913,0.00043127104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002211602,0.000081112375,0.0022578237,0.00009158355,0.000022531698,0.00074628834,0.00071484456,0.006286488,0.022541286,0.9162253,0.0028574278,0.047954075],"study_design_scores_gemma":[0.000022931099,0.000042428084,0.0021504655,0.000023972736,0.000032303265,0.0008751882,0.00050391705,0.021036262,0.0084347585,0.9536894,0.013157391,0.000031074993],"about_ca_topic_score_codex":0.0004927677,"about_ca_topic_score_gemma":0.0007490573,"teacher_disagreement_score":0.0041004005,"about_ca_system_score_codex":0.00040285563,"about_ca_system_score_gemma":0.00031098624,"threshold_uncertainty_score":0.013717234},"labels":[],"label_agreement":null},{"id":"W2115554779","doi":"10.1007/s10910-009-9651-0","title":"Topographical distance matrices for porous arrays","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematical Chemistry","topic":"Graph theory and applications","field":"Mathematics","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":"Simon Fraser University","funders":"","keywords":"Mathematics; Wiener index; Distance matrix; Combinatorics; Matrix (chemical analysis); Geometry; Eigenvalues and eigenvectors; Convexity; Graph; Physics; Materials science","score_opus":0.02328394386711686,"score_gpt":0.308913479337736,"score_spread":0.28562953547061914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115554779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16288033,0.0010084783,0.80355275,0.0013231682,0.00020311188,0.00009315526,0.0007291462,0.00026689316,0.029942883],"genre_scores_gemma":[0.82509434,0.0012357513,0.14922674,0.00034176512,0.00023588167,0.00016612359,0.00071465253,0.00011814308,0.022866646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965394,0.00007552269,0.000019743644,0.000066775334,0.00014539759,0.000038603797],"domain_scores_gemma":[0.9983688,0.00076271803,0.00024742968,0.00014401002,0.00030204988,0.00017495715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003714982,0.0003432478,0.00036507976,0.0010292968,0.00051387324,0.0014615135,0.0008788204,0.00069017865,0.004761288],"category_scores_gemma":[0.003128427,0.00028335687,0.00027216916,0.0008499572,0.00085432694,0.0016493317,0.0010340366,0.0010496816,0.00073995296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050738763,0.000047781443,0.00033734628,0.00010098069,0.000011507148,0.00010964476,0.00012911034,0.028591271,0.007448385,0.92961717,0.0033165063,0.03023961],"study_design_scores_gemma":[0.00001908516,0.000042168278,0.00053546927,0.000013614754,0.0000076918295,0.00030099813,0.000098143995,0.22449926,0.0026256233,0.7663207,0.0055021355,0.000035040073],"about_ca_topic_score_codex":0.0010037066,"about_ca_topic_score_gemma":0.0015615321,"teacher_disagreement_score":0.004761288,"about_ca_system_score_codex":0.00051778,"about_ca_system_score_gemma":0.00037542733,"threshold_uncertainty_score":0.01592809},"labels":[],"label_agreement":null},{"id":"W2118876122","doi":"10.1016/j.disc.2009.09.005","title":"Minimal Euclidean representations of graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":18,"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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; University of Calgary","keywords":"Mathematics; Combinatorics; Euclidean geometry; Discrete mathematics; Geometry","score_opus":0.0383726678968565,"score_gpt":0.34198105174236,"score_spread":0.3036083838455035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118876122","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4695094,0.0021032258,0.22602515,0.0045858677,0.0007510272,0.000098963625,0.00082203926,0.00059724954,0.29550704],"genre_scores_gemma":[0.914725,0.0009590083,0.03234661,0.00066271354,0.00048715793,0.00008425337,0.0007161707,0.00019886451,0.0498201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994875,0.00014305722,0.000028333932,0.000100821635,0.00015303135,0.000087225904],"domain_scores_gemma":[0.999393,0.00014403599,0.00011596433,0.00008967551,0.000110514295,0.00014686031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000431121,0.00069280405,0.00059342216,0.001695256,0.0008686433,0.0027627898,0.0011780844,0.0010332888,0.008940337],"category_scores_gemma":[0.0015102891,0.0003326198,0.00047976483,0.00096589385,0.0014378869,0.0025964626,0.0018635731,0.0021962798,0.0012574106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012575034,0.0000072268563,0.00003435242,0.000013957204,0.0000024007313,0.000016845013,0.000074794116,0.0003717439,0.00048423203,0.9954074,0.00067766296,0.0028966926],"study_design_scores_gemma":[0.000010025542,0.000009888597,0.00011029912,0.0000070670612,0.000003724463,0.000050616312,0.0000769019,0.0022649055,0.00029953202,0.99366647,0.0034944129,0.0000062200993],"about_ca_topic_score_codex":0.0005781645,"about_ca_topic_score_gemma":0.0007960227,"teacher_disagreement_score":0.008940337,"about_ca_system_score_codex":0.0009069053,"about_ca_system_score_gemma":0.00033032778,"threshold_uncertainty_score":0.029908419},"labels":[],"label_agreement":null},{"id":"W2121129417","doi":"10.1016/j.disc.2004.06.006","title":"Addressing the Petersen graph","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Redeemer University","funders":"","keywords":"Combinatorics; Mathematics; Tuple; Graph; Petersen graph; Discrete mathematics; Eigenvalues and eigenvectors; Graph power; Line graph","score_opus":0.1290262573121771,"score_gpt":0.35734721239166956,"score_spread":0.22832095507949246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121129417","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18431497,0.0043494683,0.36763656,0.025552714,0.00289376,0.00010375313,0.0004671575,0.00053708046,0.41414458],"genre_scores_gemma":[0.8257818,0.0041750874,0.069724455,0.002813431,0.0023923595,0.000098629556,0.00053953513,0.00037312537,0.094101496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995951,0.00012638148,0.000011800406,0.00009445013,0.000087971566,0.00008435304],"domain_scores_gemma":[0.99936014,0.0002698488,0.000055571007,0.0001321506,0.00009071497,0.00009169899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040526481,0.00054773845,0.0006975051,0.0012879506,0.0026219273,0.0023133196,0.0009739603,0.0022099908,0.012053483],"category_scores_gemma":[0.0025153654,0.00036073,0.00075357466,0.0010751709,0.0023300292,0.0060308203,0.003493735,0.00365416,0.0016866432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006969337,0.000007594029,0.00004535884,0.00002573804,0.000003660854,0.000035433266,0.0000761147,0.00095617794,0.00018670375,0.99017113,0.00320762,0.0052776113],"study_design_scores_gemma":[0.0000019992183,0.0000023263863,0.00002033912,0.0000048515562,0.0000021985024,0.000027956157,0.00005854385,0.0024160317,0.00015064103,0.9910555,0.00625705,0.000002495091],"about_ca_topic_score_codex":0.001262657,"about_ca_topic_score_gemma":0.001655714,"teacher_disagreement_score":0.012053483,"about_ca_system_score_codex":0.00085461425,"about_ca_system_score_gemma":0.00074997405,"threshold_uncertainty_score":0.04032296},"labels":[],"label_agreement":null},{"id":"W2122542404","doi":"10.4153/cmb-2001-012-6","title":"On the Density of Cyclic Quartic Fields","year":2001,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Graph theory and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Quartic function; Mathematics; Discriminant; Pure mathematics; Quartic surface","score_opus":0.03194277512724036,"score_gpt":0.2603372611894392,"score_spread":0.2283944860621988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122542404","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9001123,0.0017029973,0.03935651,0.0016990195,0.00021007219,0.000031977375,0.00016796144,0.00031613515,0.056403082],"genre_scores_gemma":[0.9924901,0.00045001562,0.0029088447,0.0000832413,0.00019280658,0.000025802994,0.00008848645,0.000037605052,0.003722979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945205,0.00011880788,0.000019527834,0.00009325498,0.00022604808,0.0000902852],"domain_scores_gemma":[0.9964378,0.0019080227,0.00038724445,0.00029951273,0.00057029567,0.0003971376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013942935,0.00029863731,0.00073353585,0.0037875965,0.0010922826,0.00177866,0.0011259784,0.00078164606,0.0070169666],"category_scores_gemma":[0.011465921,0.00031357518,0.00023630518,0.0013790742,0.0029126282,0.0027342816,0.0013424826,0.0008566929,0.00047445248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011359816,0.000053142347,0.0059436746,0.0001395107,0.000010066268,0.00032825326,0.0004166124,0.004381176,0.0051815184,0.965063,0.002551014,0.015818436],"study_design_scores_gemma":[0.000038563852,0.00007116787,0.007910088,0.00014826987,0.000023356099,0.0016143834,0.00035390997,0.09466542,0.0044352342,0.8844107,0.0062872013,0.00004174537],"about_ca_topic_score_codex":0.0014365988,"about_ca_topic_score_gemma":0.0011778689,"teacher_disagreement_score":0.0070169666,"about_ca_system_score_codex":0.0014523525,"about_ca_system_score_gemma":0.00035725714,"threshold_uncertainty_score":0.023474038},"labels":[],"label_agreement":null},{"id":"W2123196525","doi":"10.1016/s0024-3795(00)00086-0","title":"The spread of the spectrum of a graph","year":2001,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":66,"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; Queen's University","funders":"","keywords":"Mathematics; Adjacency matrix; Graph energy; Combinatorics; Eigenvalues and eigenvectors; Graph; Spectrum (functional analysis); Adjacency list; Upper and lower bounds; Discrete mathematics; Line graph; Voltage graph; Mathematical analysis; Physics","score_opus":0.02039042805831651,"score_gpt":0.27795997078154744,"score_spread":0.2575695427232309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123196525","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5309796,0.0031614504,0.41603667,0.004072967,0.00031781843,0.000053439024,0.000503713,0.0006111437,0.044263255],"genre_scores_gemma":[0.9731684,0.0013105572,0.019052159,0.00029204052,0.0005720156,0.00006548039,0.000170147,0.00014427581,0.0052249525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876803,0.00040445584,0.00004146904,0.0003301324,0.00032334472,0.00013250655],"domain_scores_gemma":[0.9912649,0.0053544985,0.00074293325,0.00094102224,0.0008092172,0.00088741176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015115653,0.0005691967,0.0010646862,0.0046586287,0.0012263077,0.0032869016,0.0015637812,0.0015800656,0.005586507],"category_scores_gemma":[0.011393451,0.00057054486,0.0005849896,0.002307448,0.0049622897,0.0069341776,0.0023837392,0.0024020988,0.00069594407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006894663,0.000020980102,0.00038229552,0.000037393445,0.0000139133645,0.0000751808,0.00038032926,0.0039379513,0.0025461188,0.981673,0.0007863451,0.010077626],"study_design_scores_gemma":[0.000011581671,0.000017482347,0.00032247655,0.00001999115,0.000008239094,0.00010883891,0.00013823512,0.014965451,0.00046345222,0.9828137,0.0011157211,0.000014873358],"about_ca_topic_score_codex":0.00082916877,"about_ca_topic_score_gemma":0.0003773851,"teacher_disagreement_score":0.005586507,"about_ca_system_score_codex":0.0009452624,"about_ca_system_score_gemma":0.00050090346,"threshold_uncertainty_score":0.018688738},"labels":[],"label_agreement":null},{"id":"W2126719431","doi":"10.1016/j.laa.2006.10.020","title":"Large matchings from eigenvalues","year":2006,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":69,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Combinatorics; Spectral radius; Eigenvalues and eigenvectors; Upper and lower bounds; Vertex (graph theory); Graph; Degree (music); Order (exchange); Discrete mathematics; Mathematical analysis","score_opus":0.017132361396130762,"score_gpt":0.2810271631251643,"score_spread":0.2638948017290335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126719431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3929066,0.0026834742,0.42403844,0.007938071,0.0011710933,0.00019061237,0.001046364,0.0019782821,0.16804722],"genre_scores_gemma":[0.92246115,0.0008571125,0.030133137,0.0012382913,0.0012783075,0.00018144674,0.00057746173,0.0006893213,0.042583626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988105,0.00031193974,0.000049081395,0.0002932664,0.00038298246,0.00015213534],"domain_scores_gemma":[0.9928994,0.003919767,0.0009295231,0.0008546072,0.0006714708,0.00072523206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012540509,0.0007814394,0.0016392104,0.0040636794,0.0019815455,0.003915253,0.0015653789,0.0027787678,0.015243997],"category_scores_gemma":[0.013570433,0.0009244397,0.0008608199,0.0023821148,0.002969835,0.008375311,0.0034646366,0.003770085,0.0019827972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041042487,0.000022394039,0.00012633165,0.00003857968,0.0000082424,0.00004993668,0.00011486668,0.0012743996,0.000741361,0.9895209,0.0028499325,0.005211982],"study_design_scores_gemma":[0.000008542623,0.0000040262657,0.000083085826,0.000006683788,0.0000030975614,0.00003939122,0.00002981694,0.0061351764,0.00017182503,0.9926488,0.0008634259,0.000006101348],"about_ca_topic_score_codex":0.00064023456,"about_ca_topic_score_gemma":0.00067331694,"teacher_disagreement_score":0.015243997,"about_ca_system_score_codex":0.0013316871,"about_ca_system_score_gemma":0.00060285436,"threshold_uncertainty_score":0.050996304},"labels":[],"label_agreement":null},{"id":"W2127063109","doi":"10.1016/s0024-3795(03)00649-9","title":"On the number of different permanents of some sparse (0,1)-circulant matrices","year":2003,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":5,"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":"Circulant matrix; Mathematics; Combinatorics; Sparse matrix; Matrix (chemical analysis); Algebra over a field; Pure mathematics; Computational chemistry; Chemistry","score_opus":0.030295987332711122,"score_gpt":0.2941734661940543,"score_spread":0.2638774788613432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127063109","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70797735,0.0020323542,0.24830107,0.0025272346,0.0003761208,0.00012982858,0.0028538327,0.0005428221,0.03525935],"genre_scores_gemma":[0.96172315,0.00048365362,0.032165874,0.00018514691,0.00019356857,0.00009892929,0.0009167116,0.00008726376,0.0041457335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880064,0.0003085051,0.00008471722,0.00033560197,0.00024882093,0.00022163372],"domain_scores_gemma":[0.9841845,0.011567956,0.00123747,0.0011657305,0.0010138546,0.0008305786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013940784,0.0006466558,0.0005438443,0.001363702,0.0017149266,0.0017321662,0.0013974287,0.00095956365,0.009119585],"category_scores_gemma":[0.014017841,0.00042873266,0.0006639052,0.0009912523,0.0024761318,0.0023062692,0.0011343921,0.0013497035,0.00060356845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008855627,0.00022847502,0.007286216,0.00059560675,0.00013429087,0.00061780517,0.00073643425,0.063484326,0.014784435,0.8277163,0.015059132,0.06847145],"study_design_scores_gemma":[0.0001414224,0.0003258229,0.006577289,0.00012627612,0.00010086205,0.0011765807,0.00028601682,0.19455215,0.0054267086,0.7854352,0.005711204,0.0001404982],"about_ca_topic_score_codex":0.00134771,"about_ca_topic_score_gemma":0.002384162,"teacher_disagreement_score":0.009119585,"about_ca_system_score_codex":0.0010773424,"about_ca_system_score_gemma":0.0012327343,"threshold_uncertainty_score":0.030508101},"labels":[],"label_agreement":null},{"id":"W2129991373","doi":"10.1016/j.crma.2006.03.005","title":"Closed walks and eigenvalues of Abelian Cayley graphs","year":2006,"lang":"en","type":"article","venue":"Comptes Rendus Mathématique","topic":"Graph theory and applications","field":"Mathematics","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":"Queen's University","funders":"","keywords":"Cayley graph; Combinatorics; Mathematics; Abelian group; Cayley transform; Cayley's theorem; Eigenvalues and eigenvectors; Graph; Vertex-transitive graph; Discrete mathematics; Physics; Voltage graph; Line graph","score_opus":0.022204047474907496,"score_gpt":0.27830083221848717,"score_spread":0.25609678474357966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129991373","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8277517,0.0006712468,0.09023296,0.0007519712,0.00032570792,0.000052872423,0.000260848,0.00053125323,0.07942138],"genre_scores_gemma":[0.97840583,0.00027122474,0.008773049,0.00011870703,0.00009984692,0.000041067742,0.00017199776,0.00007192081,0.01204636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950945,0.00009513529,0.000025075387,0.00011327327,0.000109108725,0.00014792963],"domain_scores_gemma":[0.9985965,0.00055425905,0.00022657169,0.00012266554,0.00022703498,0.00027299803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022195136,0.0005085667,0.00027519435,0.0012285145,0.0011768026,0.0018890394,0.00042085414,0.0005940084,0.009088068],"category_scores_gemma":[0.0021444743,0.00027983883,0.0003251496,0.0007248393,0.001543423,0.0022997984,0.0013873476,0.0009256195,0.0012528187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013171152,0.00008157909,0.0024454785,0.00008586971,0.000019333189,0.0009169285,0.0010725042,0.002346954,0.010112884,0.95560104,0.0042430116,0.022942776],"study_design_scores_gemma":[0.000024446692,0.000052444117,0.00123501,0.00003138227,0.000012416055,0.0005871508,0.0006237585,0.01265832,0.0044364957,0.971132,0.009177601,0.000028876508],"about_ca_topic_score_codex":0.0012137844,"about_ca_topic_score_gemma":0.0013481338,"teacher_disagreement_score":0.009088068,"about_ca_system_score_codex":0.0005264914,"about_ca_system_score_gemma":0.00031432766,"threshold_uncertainty_score":0.0304026},"labels":[],"label_agreement":null},{"id":"W2132892743","doi":"10.1109/ccece.2004.1347731","title":"Alternative network element sets","year":2004,"lang":"en","type":"article","venue":"","topic":"Graph theory and applications","field":"Mathematics","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 New Brunswick","funders":"","keywords":"Element (criminal law); Network element; Set (abstract data type); Capacitor; Function (biology); Computer science; Capacitance; Mathematics; Algorithm; Mathematical optimization; Topology (electrical circuits); Combinatorics; Engineering; Physics; Voltage; Telecommunications","score_opus":0.040983224662711266,"score_gpt":0.3295062243041889,"score_spread":0.28852299964147765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132892743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036703844,0.0004953957,0.88099545,0.00066135393,0.0003152195,0.00019598127,0.000999732,0.00044125362,0.07919171],"genre_scores_gemma":[0.41908208,0.00092811894,0.5374821,0.0005464694,0.00018063362,0.0010204125,0.0026150702,0.00033546222,0.037809614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968641,0.0008926329,0.00024006522,0.00058101077,0.0011133268,0.00030885186],"domain_scores_gemma":[0.9955047,0.0018704798,0.00031459614,0.0008023093,0.0013137945,0.00019410155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022037148,0.0011664901,0.0010188057,0.002668705,0.0015392569,0.0034793497,0.0023322473,0.0019849336,0.021090766],"category_scores_gemma":[0.0111955535,0.0006707007,0.0010875693,0.002014926,0.0017384611,0.0053714956,0.0026259518,0.0018384814,0.0047330926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001660903,0.0000712283,0.0011360295,0.00017624197,0.000052821637,0.00035337338,0.00026982912,0.06020287,0.004107959,0.87751967,0.005935355,0.05000846],"study_design_scores_gemma":[0.000050931616,0.00008901891,0.00032391466,0.00013455717,0.0000489622,0.00054184976,0.00024294572,0.17953901,0.0044506253,0.75062895,0.063869275,0.00008002664],"about_ca_topic_score_codex":0.0005601216,"about_ca_topic_score_gemma":0.001023801,"teacher_disagreement_score":0.021090766,"about_ca_system_score_codex":0.00093909167,"about_ca_system_score_gemma":0.0006925354,"threshold_uncertainty_score":0.07055569},"labels":[],"label_agreement":null},{"id":"W2133449501","doi":"10.1016/j.laa.2013.03.024","title":"Extremal digraphs with given clique number","year":2013,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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":"McGill University","funders":"","keywords":"Mathematics; Clique; Combinatorics; Adjacency matrix; Clique number; Adjacency list; Discrete mathematics; Digraph; Graph","score_opus":0.019120689282234326,"score_gpt":0.2768362397758477,"score_spread":0.2577155504936134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133449501","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6409746,0.0008569938,0.2235773,0.0033061597,0.0002986956,0.00011322242,0.0020297125,0.0004501974,0.12839316],"genre_scores_gemma":[0.9417738,0.0004368662,0.03592951,0.00039720087,0.00023223227,0.0001035702,0.0010226517,0.00011522302,0.019988855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932766,0.00018291455,0.000028283617,0.0001988803,0.00013645671,0.00012590058],"domain_scores_gemma":[0.99648106,0.0017392051,0.00042253637,0.0003655628,0.00030566583,0.0006859142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070119015,0.0005609543,0.0010725117,0.0025230988,0.0023585653,0.0032206285,0.0015646956,0.0015831189,0.008326907],"category_scores_gemma":[0.004128428,0.0006380435,0.00067220867,0.0021511416,0.0016547242,0.0032461889,0.0016746856,0.0027364695,0.00053245964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005355953,0.00003982488,0.00042865833,0.000045254772,0.000017246124,0.000094727664,0.00012381427,0.002172544,0.00081102294,0.99034905,0.0018872105,0.003977179],"study_design_scores_gemma":[0.000023227987,0.000009816926,0.0005007711,0.000014349939,0.000016399026,0.00016594525,0.00009735064,0.016506862,0.00044637604,0.9798852,0.0023186659,0.000014972092],"about_ca_topic_score_codex":0.0007695459,"about_ca_topic_score_gemma":0.0018914768,"teacher_disagreement_score":0.008326907,"about_ca_system_score_codex":0.0013602724,"about_ca_system_score_gemma":0.000570079,"threshold_uncertainty_score":0.02785629},"labels":[],"label_agreement":null},{"id":"W2133707704","doi":"","title":"On the Chromatic Uniqueness of Edge-Gluing of Complete Bipartite Graphs and Cycles.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Uniqueness; Chromatic scale; Graph; Foster graph; Chromatic polynomial; Enhanced Data Rates for GSM Evolution; Complete bipartite graph; Friendship graph; Windmill graph; Discrete mathematics; Line graph; Voltage graph; Mathematical analysis; Computer science","score_opus":0.03988452569176727,"score_gpt":0.2837049346007079,"score_spread":0.24382040890894063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133707704","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7056333,0.001395647,0.2378316,0.0008174975,0.00021127559,0.00006235504,0.00034942818,0.00024025033,0.05345873],"genre_scores_gemma":[0.9756257,0.0003740019,0.01844668,0.00009524273,0.00006631611,0.000023575669,0.00018221696,0.00007715257,0.0051091583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994443,0.0001369749,0.000017773902,0.00017101679,0.000091446454,0.00013843008],"domain_scores_gemma":[0.99842787,0.0007527904,0.00023162081,0.00024730345,0.00015947921,0.00018097855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067427405,0.00029819747,0.00038248984,0.00076639943,0.001810081,0.0014709599,0.0007682633,0.0007195666,0.0038026767],"category_scores_gemma":[0.004622051,0.00030519234,0.0005128674,0.0010088466,0.0028285915,0.0030782337,0.0016029221,0.0011346451,0.00048376975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012366737,0.000021482054,0.0027155448,0.000077902885,0.000016633167,0.00015523352,0.00052468415,0.00738144,0.0031616234,0.96742266,0.0015511061,0.016848158],"study_design_scores_gemma":[0.000021537262,0.00007766124,0.0024384572,0.00003579058,0.000034872915,0.00067355385,0.0006070202,0.030868784,0.0049637854,0.9508526,0.009365059,0.000061004408],"about_ca_topic_score_codex":0.0021721905,"about_ca_topic_score_gemma":0.0022856046,"teacher_disagreement_score":0.0038026767,"about_ca_system_score_codex":0.0009213898,"about_ca_system_score_gemma":0.00076472876,"threshold_uncertainty_score":0.0127212405},"labels":[],"label_agreement":null},{"id":"W2136122855","doi":"10.1016/j.laa.2004.05.011","title":"On distance matrices and Laplacians","year":2004,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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":"University of Regina","funders":"","keywords":"Mathematics; Distance matrix; Combinatorics; Distance matrices in phylogeny; Matrix (chemical analysis); Resistance distance; Laplacian matrix; Inverse; Grid; Tree (set theory); Graph; Geometry; Line graph; Graph power","score_opus":0.01686434030436172,"score_gpt":0.283984919567014,"score_spread":0.26712057926265226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136122855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16124785,0.04425231,0.58096606,0.020286264,0.004097133,0.00006808841,0.0008493623,0.00036067923,0.18787226],"genre_scores_gemma":[0.79282725,0.026772765,0.07015085,0.003499297,0.0077882935,0.0001945323,0.0009254016,0.0003018627,0.0975398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929607,0.00026357634,0.000033763226,0.0001591174,0.00018858323,0.000058962338],"domain_scores_gemma":[0.9970415,0.0017722475,0.00030542095,0.00019671507,0.00044379407,0.00024025729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009864363,0.0010369571,0.0010920101,0.0037310042,0.0015098656,0.0026624722,0.0014404147,0.0016965865,0.008395565],"category_scores_gemma":[0.0056166374,0.00047586567,0.00064024865,0.004923947,0.0034822063,0.007091619,0.0023042315,0.002984541,0.0013561712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008272875,0.000013800076,0.00008913606,0.00004323397,0.000004909979,0.000025718677,0.0001688448,0.0011001553,0.00026873106,0.9862345,0.002402372,0.009640293],"study_design_scores_gemma":[0.0000018829254,0.000003836276,0.00006903214,0.000009313199,0.0000024012852,0.000033485932,0.000046329547,0.002405709,0.000048237078,0.9939948,0.0033794234,0.0000055047535],"about_ca_topic_score_codex":0.0015196414,"about_ca_topic_score_gemma":0.0013314988,"teacher_disagreement_score":0.008395565,"about_ca_system_score_codex":0.0012604696,"about_ca_system_score_gemma":0.0004478406,"threshold_uncertainty_score":0.028085947},"labels":[],"label_agreement":null},{"id":"W2137496495","doi":"10.1016/j.laa.2010.02.002","title":"On the normalized Laplacian energy and general Randić index <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mrow><mml:msub><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math> of graphs","year":2010,"lang":"lv","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":120,"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","funders":"","keywords":"Adjacency matrix; Combinatorics; Energy (signal processing); Laplacian matrix; Upper and lower bounds; Laplace operator; Mathematics; Edit distance; Algorithm; Eigenvalues and eigenvectors; Discrete mathematics; Graph; Physics; Statistics; Mathematical analysis","score_opus":0.014425480168669558,"score_gpt":0.23818277232230123,"score_spread":0.22375729215363166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137496495","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20169397,0.013086673,0.34297684,0.008780532,0.0019306599,0.000077007964,0.0011742514,0.0007913716,0.42948878],"genre_scores_gemma":[0.86958176,0.00575112,0.03908621,0.0013662166,0.0019708318,0.0001373765,0.00090181135,0.00093240757,0.0802723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995468,0.00013318019,0.000018163264,0.0001126169,0.00013103642,0.00005822158],"domain_scores_gemma":[0.99797744,0.0008452044,0.0002467724,0.00029047573,0.00038388604,0.00025620952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012303484,0.0006944977,0.0007203563,0.004324228,0.0013313029,0.0022966976,0.0016891236,0.0012799394,0.015342309],"category_scores_gemma":[0.0061944425,0.00030791768,0.0005230513,0.001986908,0.0027539427,0.0050416044,0.001657246,0.0016642293,0.0024397809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012459682,0.000008946779,0.0001519954,0.000032328622,0.000005014655,0.00002363323,0.00004135761,0.0026805154,0.00023187828,0.98666966,0.0042016776,0.0059406343],"study_design_scores_gemma":[0.0000025366953,0.0000054115803,0.00023765188,0.000019310615,0.000003470977,0.00006804842,0.000029740373,0.017837657,0.0001264128,0.9785573,0.0030995607,0.000013028117],"about_ca_topic_score_codex":0.0016230164,"about_ca_topic_score_gemma":0.0021395434,"teacher_disagreement_score":0.015342309,"about_ca_system_score_codex":0.0016786708,"about_ca_system_score_gemma":0.00059775426,"threshold_uncertainty_score":0.051325083},"labels":[],"label_agreement":null},{"id":"W2137858913","doi":"10.1109/iscas.2004.1329082","title":"Analysis of Internet topology data","year":2004,"lang":"en","type":"article","venue":"","topic":"Graph theory and applications","field":"Mathematics","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":"Simon Fraser University","funders":"","keywords":"Internet topology; The Internet; Robustness (evolution); Computer science; Laplace operator; Topology (electrical circuits); Network topology; Data mining; Computer network; World Wide Web; Mathematics","score_opus":0.0986984921867464,"score_gpt":0.37625587797686805,"score_spread":0.2775573857901217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137858913","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68571365,0.001152571,0.13443638,0.0014512307,0.00019013007,0.0006092662,0.16418739,0.004236731,0.008022715],"genre_scores_gemma":[0.77865994,0.0005398412,0.07155798,0.000102224905,0.00006770186,0.00043458454,0.14756125,0.00015375999,0.00092276576],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9976412,0.0006243855,0.00023609489,0.000406063,0.00094848813,0.00014389175],"domain_scores_gemma":[0.98922485,0.0038791124,0.0012363994,0.0030054937,0.0023845274,0.0002694981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018261645,0.00054142036,0.00051127817,0.0051878127,0.0004655471,0.0010582977,0.00072917977,0.00071775063,0.0008102479],"category_scores_gemma":[0.015941765,0.00020148426,0.00054584007,0.0049722353,0.00048157442,0.0014219283,0.00087984384,0.00082496426,0.0005987835],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074401003,0.0010221951,0.25395125,0.0015852533,0.00092927093,0.0015313571,0.0010316403,0.2669282,0.027722357,0.025302721,0.05925486,0.35999689],"study_design_scores_gemma":[0.00006156663,0.0003906077,0.23922727,0.0001612279,0.00017809766,0.0025186685,0.0014266325,0.61945456,0.021309502,0.03940502,0.075717166,0.00014966037],"about_ca_topic_score_codex":0.0021893168,"about_ca_topic_score_gemma":0.0028121541,"teacher_disagreement_score":0.0051878127,"about_ca_system_score_codex":0.0006027917,"about_ca_system_score_gemma":0.0005808851,"threshold_uncertainty_score":0.0096578},"labels":[],"label_agreement":null},{"id":"W2138350113","doi":"","title":"Spectral Reconstruction and Isomorphism of Graphs Using Variable Neighbourhood Search","year":2013,"lang":"en","type":"article","venue":"Stirling Online Research Repository (University of Stirling)","topic":"Graph theory and applications","field":"Mathematics","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":"Graph isomorphism; Mathematics; Combinatorics; Neighbourhood (mathematics); Discrete mathematics; Heuristic; Graph; Algorithm; Line graph; Mathematical optimization","score_opus":0.08371474321521845,"score_gpt":0.31976207071532714,"score_spread":0.2360473275001087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138350113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28290772,0.00016442098,0.71069723,0.00022916807,0.000030768915,0.00017329077,0.000111095986,0.0010390299,0.0046473616],"genre_scores_gemma":[0.5122332,0.00005116677,0.48575604,0.00004963824,0.000010702047,0.00013803385,0.00029336184,0.00016763697,0.0013002647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883324,0.00052981894,0.00004476858,0.00027388326,0.00022564006,0.00009263915],"domain_scores_gemma":[0.99607205,0.0027776677,0.00030584272,0.0005230518,0.0002114869,0.00010986937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015641103,0.00066758384,0.0009556254,0.0017539707,0.0008173998,0.00090351177,0.00125972,0.0011407036,0.0025632812],"category_scores_gemma":[0.0074885543,0.0004966266,0.00084958074,0.0010601297,0.0012903049,0.0018531228,0.0014163232,0.0006790497,0.0003221839],"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.0006309876,0.00040789417,0.0038266806,0.00025278804,0.00012703829,0.00021928888,0.0007145329,0.6695152,0.02087638,0.056528307,0.0019878407,0.24491304],"study_design_scores_gemma":[0.000053053125,0.0001009498,0.00029895752,0.000012031498,0.000016624906,0.000066438646,0.00012560686,0.96775323,0.004749132,0.02621414,0.00059866876,0.000011139868],"about_ca_topic_score_codex":0.0023140812,"about_ca_topic_score_gemma":0.003487981,"teacher_disagreement_score":0.0025632812,"about_ca_system_score_codex":0.0010339741,"about_ca_system_score_gemma":0.0008249654,"threshold_uncertainty_score":0.008574963},"labels":[],"label_agreement":null},{"id":"W2139284584","doi":"10.1016/j.jctb.2005.09.002","title":"On the extreme eigenvalues of regular graphs","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","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":"Queen's University","funders":"","keywords":"Eigenvalues and eigenvectors; Mathematics; Combinatorics; Integer (computer science); Strongly regular graph; Graph; Discrete mathematics; Constant (computer programming); Pure mathematics; Pathwidth; Physics; Quantum mechanics; Line graph; Computer science","score_opus":0.03740442633194699,"score_gpt":0.2765691128428439,"score_spread":0.23916468651089692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139284584","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74393535,0.0020899614,0.1346864,0.004253764,0.00087242544,0.000054515254,0.00020115158,0.00040430302,0.11350218],"genre_scores_gemma":[0.97483677,0.0009843839,0.010033488,0.0003509825,0.0006980613,0.000039357594,0.00012087597,0.0001375427,0.012798469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949896,0.00016704186,0.000017627417,0.00007296202,0.00015015762,0.000093243165],"domain_scores_gemma":[0.99770373,0.0012021943,0.00028124632,0.00017563559,0.00027349684,0.00036358164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007543011,0.0007262525,0.00093525613,0.0025860427,0.0014786286,0.0022179952,0.0010901231,0.001393878,0.0068103755],"category_scores_gemma":[0.0051052454,0.00048109936,0.00048105896,0.001104996,0.0029942465,0.0030871462,0.0015793022,0.0019599183,0.00077105954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079273006,0.000044141267,0.0003985529,0.000054010332,0.000012648711,0.0001865187,0.00035973184,0.005431227,0.001983096,0.9805562,0.0032956572,0.0075988374],"study_design_scores_gemma":[0.000011737281,0.000009677926,0.00027124496,0.000016017797,0.0000035912844,0.000099821715,0.00012624473,0.011556906,0.0002115813,0.9868663,0.00081553735,0.000011321625],"about_ca_topic_score_codex":0.00058085105,"about_ca_topic_score_gemma":0.0006925519,"teacher_disagreement_score":0.0068103755,"about_ca_system_score_codex":0.0006636891,"about_ca_system_score_gemma":0.00027283555,"threshold_uncertainty_score":0.022782922},"labels":[],"label_agreement":null},{"id":"W2140047776","doi":"10.48550/arxiv.1505.03664","title":"The Genus Distribution of Doubly Hexagonal Chains","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph theory and applications","field":"Mathematics","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":"Simon Fraser University","funders":"","keywords":"Genus; Hexagonal crystal system; Distribution (mathematics); Combinatorics; Mathematics; Crystallography; Zoology; Biology; Chemistry; Mathematical analysis","score_opus":0.13761459813119933,"score_gpt":0.23194561682707696,"score_spread":0.09433101869587762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140047776","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9053652,0.00031167414,0.06842591,0.00034850233,0.0000676906,0.000017091392,0.00019835733,0.00024970766,0.025015885],"genre_scores_gemma":[0.99300164,0.00015734078,0.0035903372,0.000033814442,0.000029673476,0.000015417729,0.00010740367,0.00006909734,0.0029951024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99987185,0.000031577216,0.0000032626237,0.000019043688,0.000038214737,0.000036010828],"domain_scores_gemma":[0.9993531,0.00026626445,0.000092754126,0.00007712244,0.00009991423,0.00011073111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031346758,0.00032516077,0.00023295854,0.0017167135,0.0005566722,0.0008935525,0.00057201716,0.0005711104,0.0050449255],"category_scores_gemma":[0.002485003,0.00022395914,0.00016504704,0.0005089726,0.0009909217,0.0013510707,0.00083589833,0.00058946555,0.0005194863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024128522,0.00008201303,0.004866998,0.00012334707,0.000018279068,0.00048565498,0.00051068433,0.076396495,0.02392613,0.86145884,0.0044949357,0.027395317],"study_design_scores_gemma":[0.000019095147,0.000036910875,0.0029071067,0.000039838906,0.000007779275,0.0001825459,0.0002610856,0.63064533,0.0060596787,0.35823542,0.0015647571,0.00004043422],"about_ca_topic_score_codex":0.0008807426,"about_ca_topic_score_gemma":0.0011595616,"teacher_disagreement_score":0.0050449255,"about_ca_system_score_codex":0.0005239936,"about_ca_system_score_gemma":0.00020946667,"threshold_uncertainty_score":0.016876996},"labels":[],"label_agreement":null},{"id":"W2143176167","doi":"10.1016/j.laa.2015.10.018","title":"Hermitian adjacency spectrum and switching equivalence of mixed graphs","year":2015,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":60,"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":"Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Hermitian matrix; Combinatorics; Mixed graph; Adjacency matrix; Two-graph; Rank (graph theory); Spectrum (functional analysis); Discrete mathematics; Graph; Pure mathematics; Line graph; Physics; Voltage graph","score_opus":0.05578229098441052,"score_gpt":0.31012169229151926,"score_spread":0.25433940130710875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143176167","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6698411,0.0006477145,0.24078245,0.001650048,0.0003473484,0.00007742878,0.00038201184,0.00028578122,0.08598613],"genre_scores_gemma":[0.97627115,0.0002906967,0.012975247,0.00036566146,0.00031417934,0.00006711809,0.00023034634,0.000073899006,0.009411679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991227,0.000261734,0.000041411746,0.00021508905,0.00021218014,0.00014689665],"domain_scores_gemma":[0.99767834,0.000992181,0.00035993205,0.00022660528,0.00030881423,0.00043417455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009647199,0.00055537245,0.00063084625,0.002602289,0.0014834125,0.0026851196,0.0012202883,0.001123885,0.009775786],"category_scores_gemma":[0.0030023528,0.00046436593,0.00065639033,0.0012122049,0.0031142563,0.004554944,0.001553562,0.0019863728,0.00059930905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015664205,0.000020342333,0.00011380265,0.000010508671,0.0000040491473,0.000032280695,0.00013273105,0.00045215167,0.00073058286,0.9956422,0.00032251448,0.0025232045],"study_design_scores_gemma":[0.000006845213,0.000008668011,0.0001421989,0.000003943439,0.0000021840572,0.000034991604,0.00005874679,0.0045907884,0.00020170065,0.9945478,0.0003959972,0.0000062029417],"about_ca_topic_score_codex":0.0007467844,"about_ca_topic_score_gemma":0.00067385583,"teacher_disagreement_score":0.009775786,"about_ca_system_score_codex":0.0008206075,"about_ca_system_score_gemma":0.000519595,"threshold_uncertainty_score":0.03270328},"labels":[],"label_agreement":null},{"id":"W2144008971","doi":"10.1016/j.laa.2014.12.023","title":"Maximizing algebraic connectivity for certain families of graphs","year":2015,"lang":"en","type":"preprint","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Algebraic connectivity; Mathematics; Bounded function; Algebraic number; Upper and lower bounds; Graph; Girth (graph theory); Discrete mathematics; Line graph","score_opus":0.06927525957269225,"score_gpt":0.3334229529567652,"score_spread":0.26414769338407296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144008971","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7915526,0.0010700092,0.14439054,0.003675417,0.00007074187,0.00006500758,0.000582901,0.0002391084,0.058353648],"genre_scores_gemma":[0.97503656,0.0008272182,0.017419508,0.0002987549,0.00017839947,0.00011053753,0.00044097943,0.00008626061,0.00560174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917537,0.00032191386,0.000026258953,0.00019482784,0.00018757097,0.00009409882],"domain_scores_gemma":[0.99340385,0.004159254,0.00095020904,0.00027754036,0.0004345179,0.00077463995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014069249,0.0007698554,0.0008853632,0.0029885224,0.0019431777,0.0031547348,0.001241969,0.0015802928,0.0052980287],"category_scores_gemma":[0.008666886,0.0007151824,0.0006338626,0.0025676847,0.0028934868,0.005606691,0.0018207141,0.0018673447,0.00024734676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021098287,0.00001883324,0.0005801301,0.0000371404,0.000009542893,0.00006310148,0.00020299654,0.0024999282,0.0005284246,0.9921589,0.0012199682,0.0026599586],"study_design_scores_gemma":[0.000014845198,0.000010127563,0.00048582774,0.0000142719955,0.000010164971,0.00017422471,0.00014209043,0.021293458,0.00022188739,0.9764998,0.0011249543,0.000008276034],"about_ca_topic_score_codex":0.0009656823,"about_ca_topic_score_gemma":0.001517559,"teacher_disagreement_score":0.0052980287,"about_ca_system_score_codex":0.0015915516,"about_ca_system_score_gemma":0.00048065104,"threshold_uncertainty_score":0.01772362},"labels":[],"label_agreement":null},{"id":"W214563378","doi":"","title":"Mutually Independent Hamiltonian Cycles in Some Graphs","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hamiltonian path; Hamiltonian (control theory); Combinatorics; Pure mathematics; Graph; Mathematical optimization","score_opus":0.026747679570385416,"score_gpt":0.29026433268558555,"score_spread":0.2635166531152001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W214563378","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.802093,0.00091805344,0.08115539,0.0019147184,0.00019082807,0.00020488253,0.0006471595,0.00021397916,0.11266193],"genre_scores_gemma":[0.95174325,0.00047880018,0.024766382,0.000417356,0.00012362741,0.00024214447,0.00044375588,0.0001036864,0.021680886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992945,0.00019793407,0.000044704335,0.0001465656,0.00016076938,0.00015549705],"domain_scores_gemma":[0.9982799,0.0007626152,0.0003129298,0.00013663096,0.00019141422,0.00031644374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005154654,0.0007399191,0.00071893085,0.0024135537,0.0037111118,0.0024421401,0.0011838925,0.0012876071,0.007716726],"category_scores_gemma":[0.0021799328,0.00094204175,0.0009884816,0.002676733,0.0020698346,0.0025301015,0.0020823781,0.0016119604,0.0006096488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049245107,0.000041436353,0.0006790007,0.00008312851,0.000036469068,0.0004784502,0.0007032243,0.0014310664,0.0020347645,0.9874364,0.0017469674,0.005279823],"study_design_scores_gemma":[0.000034632325,0.00001789301,0.0005886496,0.000022458147,0.000049093396,0.00034036275,0.000369953,0.0060917563,0.0011286793,0.98734576,0.0039919675,0.0000188035],"about_ca_topic_score_codex":0.0012871014,"about_ca_topic_score_gemma":0.0026017644,"teacher_disagreement_score":0.007716726,"about_ca_system_score_codex":0.0009685096,"about_ca_system_score_gemma":0.00070897647,"threshold_uncertainty_score":0.02581501},"labels":[],"label_agreement":null},{"id":"W2147535338","doi":"10.1016/j.laa.2012.01.019","title":"Skew-adjacency matrices of graphs","year":2012,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Regina; University of Calgary","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Consejo Nacional de Ciencia y Tecnología, Paraguay; National Science Foundation","keywords":"Adjacency list; Skew; Adjacency matrix; Mathematics; Combinatorics; Graph energy; Discrete mathematics; Graph; Line graph; Voltage graph; Computer science","score_opus":0.03238476641123778,"score_gpt":0.3083849609204666,"score_spread":0.2760001945092288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147535338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34550261,0.0027138407,0.5894633,0.0017898689,0.0007489129,0.00010980269,0.0012976987,0.00070607563,0.057667922],"genre_scores_gemma":[0.90456164,0.0025363562,0.07024318,0.00062129024,0.0011008963,0.00018817616,0.00087459106,0.00022789478,0.01964603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992749,0.00025314305,0.000046720055,0.000152401,0.00018306318,0.000089740104],"domain_scores_gemma":[0.99734986,0.0010302318,0.00055383507,0.00023527959,0.0005117724,0.0003191242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081566826,0.0007978589,0.0006208529,0.0026881963,0.0009557792,0.0021780264,0.0009596911,0.0008114951,0.008034343],"category_scores_gemma":[0.0039934576,0.00046009992,0.00047324446,0.00245501,0.001632137,0.0033251385,0.0009800027,0.0011684102,0.0011757722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002394523,0.000029850695,0.0002868085,0.00004092159,0.000008345922,0.000058614736,0.00031059844,0.0035778226,0.0016840074,0.97743386,0.0018984774,0.014646845],"study_design_scores_gemma":[0.0000031166594,0.000008524581,0.00014692181,0.0000065443373,0.000002602269,0.00005293152,0.000055852044,0.00808823,0.00034768734,0.9894119,0.0018652431,0.000010393453],"about_ca_topic_score_codex":0.00076354033,"about_ca_topic_score_gemma":0.0010677832,"teacher_disagreement_score":0.008034343,"about_ca_system_score_codex":0.0006141154,"about_ca_system_score_gemma":0.000705695,"threshold_uncertainty_score":0.026877582},"labels":[],"label_agreement":null},{"id":"W2148619081","doi":"10.1016/j.laa.2015.05.001","title":"Relating p-adic eigenvalues and the local Smith normal form","year":2015,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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","keywords":"Mathematics; Eigenvalues and eigenvectors; Invariant (physics); Pure mathematics; Diagonal; Integer (computer science); Diagonal matrix; Matrix (chemical analysis); Property (philosophy); Normal matrix; Combinatorics; Geometry; Mathematical physics","score_opus":0.03729050791920778,"score_gpt":0.2898781102470609,"score_spread":0.2525876023278531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148619081","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4611503,0.0016958703,0.26402655,0.0054672407,0.001094815,0.00010352553,0.00034609067,0.00046067964,0.26565492],"genre_scores_gemma":[0.95410144,0.0010092201,0.01588775,0.000541657,0.0010196528,0.00006276357,0.00014611808,0.00012929738,0.027102113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994748,0.00014752652,0.000022385651,0.00014195227,0.00013515928,0.000078189885],"domain_scores_gemma":[0.99872535,0.0004582955,0.00028035836,0.00012872259,0.00020824313,0.00019895766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007204696,0.00090087793,0.00075772754,0.0035583866,0.0018567072,0.0031234035,0.0009825624,0.0012367088,0.01050897],"category_scores_gemma":[0.0032732936,0.0004358748,0.00048039775,0.0022776925,0.004347985,0.0045749806,0.0019500748,0.0027161916,0.0011696891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015244049,0.000013431175,0.00013024852,0.000018853712,0.000004104786,0.00004964379,0.00018421278,0.0005950876,0.0004963099,0.99380106,0.00080041704,0.0038914909],"study_design_scores_gemma":[0.000004113292,0.000005131049,0.000085991654,0.0000041515186,0.0000021970093,0.000049326212,0.000061273764,0.0014182605,0.0001441602,0.99737537,0.00084378314,0.0000062809518],"about_ca_topic_score_codex":0.0008336803,"about_ca_topic_score_gemma":0.00068969466,"teacher_disagreement_score":0.01050897,"about_ca_system_score_codex":0.0009994888,"about_ca_system_score_gemma":0.00056576834,"threshold_uncertainty_score":0.03515607},"labels":[],"label_agreement":null},{"id":"W2151986794","doi":"10.1016/j.ejc.2009.07.007","title":"A lower bound for the spectral radius of graphs with fixed diameter","year":2009,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":14,"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; University of Toronto; Connaught Fund; Pohang University of Science and Technology; University of Delaware","keywords":"Mathematics; Spectral radius; Combinatorics; Upper and lower bounds; Graph; RADIUS; Order (exchange); Discrete mathematics; Mathematical analysis; Eigenvalues and eigenvectors; Physics","score_opus":0.02701508009018262,"score_gpt":0.264474852411065,"score_spread":0.2374597723208824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151986794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24287613,0.031307295,0.59129226,0.012669821,0.001473653,0.00025744262,0.0032243321,0.003817396,0.113081716],"genre_scores_gemma":[0.8147514,0.012436987,0.14830504,0.0025296542,0.0029396096,0.0006038579,0.0020556913,0.002391808,0.013985975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99507,0.0014032191,0.00020073817,0.00140091,0.0010370003,0.0008882597],"domain_scores_gemma":[0.94026613,0.046674903,0.00207397,0.0052366783,0.0023510954,0.003397279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004965978,0.0036883557,0.005056989,0.0065021906,0.0034199401,0.007004054,0.008924706,0.0054516895,0.011130675],"category_scores_gemma":[0.042001016,0.0023484787,0.0026799594,0.0047787474,0.0052584,0.013029612,0.006609341,0.0071961517,0.0037240486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017191161,0.0003827674,0.0034090905,0.0021342475,0.0004494355,0.0005327735,0.0014183569,0.11579267,0.035320494,0.7383924,0.036140732,0.06430795],"study_design_scores_gemma":[0.0001241691,0.00028351488,0.002770475,0.00045743806,0.00041379168,0.0011526914,0.000379404,0.29798102,0.010218994,0.6665935,0.019420626,0.00020433619],"about_ca_topic_score_codex":0.0013462488,"about_ca_topic_score_gemma":0.0013360757,"teacher_disagreement_score":0.011130675,"about_ca_system_score_codex":0.0038648979,"about_ca_system_score_gemma":0.0011170949,"threshold_uncertainty_score":0.037235796},"labels":[],"label_agreement":null},{"id":"W2152162758","doi":"10.1016/s0024-3795(02)00323-3","title":"The complement of the path is determined by its spectrum","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":60,"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":"","keywords":"Mathematics; Adjacency matrix; Complement (music); Spectrum (functional analysis); Combinatorics; Path (computing); Graph; Adjacency list; Discrete mathematics; Computer science; Physics","score_opus":0.031180454488733612,"score_gpt":0.27555840697157197,"score_spread":0.24437795248283836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152162758","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54148626,0.0006095247,0.29905432,0.0017328507,0.001247785,0.00013051266,0.0012742741,0.0011308235,0.15333366],"genre_scores_gemma":[0.9097914,0.0007483061,0.050660092,0.0003913947,0.00053908204,0.00021422231,0.00086843653,0.0006430839,0.036143932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985959,0.00016091185,0.000044840097,0.0005177428,0.00037229364,0.00030827365],"domain_scores_gemma":[0.9973928,0.0010017696,0.0002793791,0.00021676876,0.0006733437,0.00043594613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006788481,0.0010581088,0.0011859987,0.0039002986,0.002767783,0.0056884447,0.0015015834,0.0017145649,0.012538578],"category_scores_gemma":[0.0028462044,0.0005223717,0.0010339894,0.0013890669,0.0048503624,0.007393143,0.0025669523,0.0027234657,0.0025222579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001239312,0.000059865393,0.00040707245,0.000046115736,0.000017380717,0.00017269448,0.00023883212,0.00043303592,0.0052384315,0.9814626,0.0011563422,0.0106436005],"study_design_scores_gemma":[0.000023593628,0.00004324033,0.0006485746,0.000040628427,0.000021820664,0.00040668962,0.00028384905,0.0048713987,0.0036878097,0.9856403,0.0042924294,0.000039665934],"about_ca_topic_score_codex":0.0016034418,"about_ca_topic_score_gemma":0.000816267,"teacher_disagreement_score":0.012538578,"about_ca_system_score_codex":0.0012742971,"about_ca_system_score_gemma":0.0012584272,"threshold_uncertainty_score":0.041945755},"labels":[],"label_agreement":null},{"id":"W2152436292","doi":"10.48550/arxiv.1210.5322","title":"A relation between Clar covering polynomial and cube polynomial","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph theory and applications","field":"Mathematics","cited_by":15,"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":"Polynomial; Cube (algebra); Tutte polynomial; Combinatorics; Hexagonal crystal system; Zhàng; Hypercube; Graph; Mathematics; Chemistry; Crystallography; Geography; Mathematical analysis","score_opus":0.1300775615184964,"score_gpt":0.22757855563076995,"score_spread":0.09750099411227356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152436292","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7548031,0.0009671502,0.15164496,0.0017064933,0.00022138585,0.0000499457,0.00040022744,0.00032931013,0.089877404],"genre_scores_gemma":[0.9860924,0.0003871189,0.0081744455,0.0001609086,0.0001850853,0.000024567134,0.00013650366,0.00005634951,0.004782558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994134,0.00010253553,0.000014879876,0.00014797522,0.00016888074,0.00015231138],"domain_scores_gemma":[0.998173,0.0009014055,0.00026735247,0.00023235561,0.00021132789,0.00021450009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045462264,0.00030207468,0.00040921566,0.0012528975,0.0008196368,0.0011352337,0.0005089139,0.00037351865,0.0061152442],"category_scores_gemma":[0.0026563762,0.00016423399,0.00045896453,0.0012252657,0.0022604493,0.0030207871,0.0010872356,0.0016279643,0.00070227217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013484151,0.000037091388,0.0020848387,0.00009548045,0.000010449165,0.00014473379,0.00037635906,0.0062024198,0.0055927555,0.9566349,0.0029486958,0.025737453],"study_design_scores_gemma":[0.000020467764,0.000143811,0.0055446406,0.000029024379,0.000024257371,0.0008242898,0.00028658935,0.04090989,0.007257317,0.93202615,0.0128610935,0.00007247351],"about_ca_topic_score_codex":0.0009974369,"about_ca_topic_score_gemma":0.0006267262,"teacher_disagreement_score":0.0061152442,"about_ca_system_score_codex":0.0008363246,"about_ca_system_score_gemma":0.00038804093,"threshold_uncertainty_score":0.020457566},"labels":[],"label_agreement":null},{"id":"W2153291291","doi":"10.3217/jucs-013-11-1501","title":"Spectral Densest Subgraph and Independence Number of a Graph","year":2020,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Graph theory and applications","field":"Mathematics","cited_by":8,"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":"Spectral radius; Independence number; Computer science; Induced subgraph isomorphism problem; Bounded function; Graph; Upper and lower bounds; Induced subgraph; Independence (probability theory); Combinatorics; RADIUS; Mathematics; Theoretical computer science; Physics; Line graph; Eigenvalues and eigenvectors; Statistics; Computer security","score_opus":0.05640157519939652,"score_gpt":0.2837543949453483,"score_spread":0.22735281974595178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153291291","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6102534,0.00034992516,0.37254518,0.00094887405,0.000040468978,0.000114786766,0.0009116587,0.0005538012,0.014281969],"genre_scores_gemma":[0.9401769,0.00015243092,0.056187615,0.00011921431,0.00007478848,0.00008131284,0.0008817735,0.00012145309,0.0022046154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989537,0.00033014218,0.000045788795,0.0002888107,0.00026819334,0.0001133235],"domain_scores_gemma":[0.99079317,0.0065601934,0.0008742604,0.0006436388,0.00055196526,0.00057682674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009802866,0.00048190623,0.0006077897,0.0015013167,0.0007492186,0.0012539463,0.0009873515,0.00070570246,0.0052145026],"category_scores_gemma":[0.0063621383,0.00044678917,0.00048480704,0.0010663047,0.0016475094,0.0023456863,0.0012789066,0.001295386,0.00053651235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015241978,0.0007506976,0.022392878,0.0010391597,0.00028000204,0.0007391821,0.0008763852,0.21124123,0.07813481,0.5770983,0.013457914,0.09246519],"study_design_scores_gemma":[0.00009560596,0.0001550292,0.0064916364,0.00003734633,0.000056009827,0.00085667573,0.00020346863,0.48384815,0.024390584,0.48114708,0.0026801748,0.00003825911],"about_ca_topic_score_codex":0.00065595825,"about_ca_topic_score_gemma":0.0006922418,"teacher_disagreement_score":0.0052145026,"about_ca_system_score_codex":0.0008145533,"about_ca_system_score_gemma":0.00041995503,"threshold_uncertainty_score":0.017444253},"labels":[],"label_agreement":null},{"id":"W2154857537","doi":"10.1051/ro:2007028","title":"A note on tree realizations of matrices","year":2007,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Graph theory and applications","field":"Mathematics","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","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Realization (probability); Diagonal; Tree (set theory); Mathematics; Combinatorics; Metric (unit); Class (philosophy); Zero (linguistics); Discrete mathematics; Computer science; Geometry; Statistics; Artificial intelligence; Engineering","score_opus":0.15364821961147487,"score_gpt":0.48619410998093193,"score_spread":0.33254589036945703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154857537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14706208,0.0034696048,0.7510854,0.0021323645,0.0005409875,0.000060782168,0.00052669476,0.00047670957,0.09464548],"genre_scores_gemma":[0.7763849,0.0046611526,0.19327633,0.00083344814,0.0012152898,0.0001978058,0.0008987027,0.00054387026,0.021988494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991912,0.00025085927,0.000039293493,0.00015588169,0.00023850365,0.00012421195],"domain_scores_gemma":[0.99822074,0.00085621205,0.00021825671,0.00020367776,0.00021268296,0.00028843316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006801841,0.0005320842,0.0007327767,0.00071061176,0.001144644,0.0014809684,0.0005871385,0.0011145503,0.0071618394],"category_scores_gemma":[0.0034957926,0.00041545535,0.0006870332,0.001145845,0.0012134146,0.0026701016,0.001453658,0.0021956468,0.0014661631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025803773,0.000010435853,0.00019871451,0.000034195982,0.0000072007347,0.000103804414,0.000106335305,0.009632851,0.0022936196,0.974445,0.0027170847,0.010424918],"study_design_scores_gemma":[0.000009255194,0.000082116,0.0003190944,0.000023622202,0.000007708404,0.0001467457,0.0000662719,0.047810458,0.0009097062,0.9347683,0.015834495,0.000022181483],"about_ca_topic_score_codex":0.0011963106,"about_ca_topic_score_gemma":0.0016901394,"teacher_disagreement_score":0.0071618394,"about_ca_system_score_codex":0.0005841823,"about_ca_system_score_gemma":0.0004686876,"threshold_uncertainty_score":0.023958683},"labels":[],"label_agreement":null},{"id":"W2158093499","doi":"10.1186/1748-7188-7-14","title":"Ubiquity of synonymity: almost all large binary trees are not uniquely identified by their spectra or their immanantal polynomials","year":2012,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Graph theory and applications","field":"Mathematics","cited_by":14,"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; Pacific Institute for the Mathematical Sciences; National Science Foundation","keywords":"Adjacency matrix; Combinatorics; Mathematics; Eigenvalues and eigenvectors; Laplacian matrix; Adjacency list; Binary tree; Binary number; Characteristic polynomial; Weight-balanced tree; Invariant (physics); Tree (set theory); Spectrum (functional analysis); Discrete mathematics; Polynomial; Binary search tree; Graph; Arithmetic","score_opus":0.06327891369287991,"score_gpt":0.3557059889395285,"score_spread":0.29242707524664857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158093499","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78845453,0.0010132643,0.19758545,0.0018788086,0.0001337785,0.0000504631,0.00065373175,0.00048139028,0.009748627],"genre_scores_gemma":[0.97942495,0.00019409522,0.018771082,0.0001938002,0.00007425165,0.000038795097,0.0004139614,0.00009537011,0.0007936735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99623895,0.0008604466,0.0002861624,0.0014906112,0.0007641178,0.00035960219],"domain_scores_gemma":[0.9552104,0.026488261,0.006439702,0.0083715385,0.0021038598,0.0013862492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037417463,0.0003410794,0.001478297,0.0028860853,0.0026419982,0.003489768,0.0013061253,0.0017846548,0.0052516027],"category_scores_gemma":[0.0509974,0.0005373827,0.0006710469,0.0034711622,0.0039904416,0.010218174,0.0033956023,0.0018118728,0.00092352455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009913462,0.00019527783,0.09165532,0.0009905295,0.0002644544,0.0014912952,0.00500681,0.012930324,0.021027938,0.7026323,0.009894415,0.15292007],"study_design_scores_gemma":[0.000047386835,0.00008336341,0.015663471,0.00013683189,0.000089608344,0.004138531,0.0016520618,0.061500844,0.0062614875,0.9004328,0.009904448,0.0000890873],"about_ca_topic_score_codex":0.00048672562,"about_ca_topic_score_gemma":0.00044237575,"teacher_disagreement_score":0.0052516027,"about_ca_system_score_codex":0.0008742698,"about_ca_system_score_gemma":0.0006819769,"threshold_uncertainty_score":0.019788444},"labels":[],"label_agreement":null},{"id":"W2159543556","doi":"10.1515/gcc.2010.004","title":"The diameter of a random Cayley graph of ℤ q","year":2010,"lang":"en","type":"article","venue":"journal of Groups complexity cryptology","topic":"Graph theory and applications","field":"Mathematics","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 Toronto","funders":"","keywords":"Cayley graph; Combinatorics; Mathematics; Graph; Vertex-transitive graph; Cyclic group; Prime (order theory); Discrete mathematics; Order (exchange); Random graph; Voltage graph; Line graph; Abelian group","score_opus":0.051414020622385634,"score_gpt":0.3215825098806511,"score_spread":0.2701684892582655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159543556","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9597853,0.0005571551,0.03135786,0.0021892448,0.00008180162,0.000033304696,0.0006913623,0.00021500472,0.005089016],"genre_scores_gemma":[0.9943001,0.00023588861,0.003952303,0.000118745906,0.00006664626,0.00003472684,0.0002535259,0.00004004116,0.000997995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994012,0.00020092897,0.000019204259,0.00019572921,0.00007452474,0.0001084008],"domain_scores_gemma":[0.9881164,0.008043646,0.0011330704,0.0011025887,0.00060553354,0.000998816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016112278,0.0003006407,0.00059102156,0.0012151997,0.00084546005,0.0017284392,0.0010648613,0.000971703,0.0018337588],"category_scores_gemma":[0.011512984,0.00050408003,0.0002714099,0.0006249356,0.0022499184,0.0028158699,0.00095879723,0.0008758841,0.00025034376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024878369,0.00020283493,0.049620535,0.0004868728,0.00033866309,0.0012019023,0.0017656595,0.18443766,0.06811792,0.6407112,0.020064544,0.030564344],"study_design_scores_gemma":[0.00025302722,0.00038199974,0.02041857,0.00009507166,0.000113419264,0.0011189544,0.0007340763,0.5871973,0.016500028,0.36638334,0.006643972,0.00016027997],"about_ca_topic_score_codex":0.0014484242,"about_ca_topic_score_gemma":0.001339526,"teacher_disagreement_score":0.0018337588,"about_ca_system_score_codex":0.0016489954,"about_ca_system_score_gemma":0.00050768326,"threshold_uncertainty_score":0.011964321},"labels":[],"label_agreement":null},{"id":"W2161040448","doi":"10.1016/j.jctb.2010.09.001","title":"The edge-density for <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math> minors","year":2010,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":44,"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":"Conjecture; Combinatorics; Bipartite graph; Mathematics; Graph; Vertex (graph theory); Discrete mathematics","score_opus":0.015482498417395539,"score_gpt":0.2446875353190324,"score_spread":0.22920503690163685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161040448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08757368,0.0028364577,0.5347022,0.004629516,0.0011569082,0.00026840597,0.015949698,0.0034512742,0.34943193],"genre_scores_gemma":[0.6612852,0.0038562894,0.17424117,0.001162667,0.0013871234,0.00066592306,0.014825697,0.004215797,0.13836014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992405,0.0001593953,0.000038177644,0.00019389889,0.00026133712,0.00010657857],"domain_scores_gemma":[0.99591225,0.002125199,0.00027517584,0.000529299,0.0008544527,0.00030359457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000983505,0.00072351494,0.00065554766,0.0029678985,0.00138426,0.0030322298,0.0019660795,0.0011281854,0.06797997],"category_scores_gemma":[0.011289154,0.00048093035,0.0006792552,0.0021740154,0.0013802107,0.0049229776,0.0015008543,0.0021308174,0.014267496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001005938,0.00006581919,0.0016186982,0.00026230665,0.000022257866,0.00010708666,0.00030642387,0.003867791,0.001581754,0.8362569,0.10698389,0.048826516],"study_design_scores_gemma":[0.00002270606,0.000031379786,0.0032710154,0.00014600229,0.000029314997,0.0006832201,0.00021729562,0.030872483,0.0030461429,0.8782838,0.08335227,0.00004433906],"about_ca_topic_score_codex":0.0021026945,"about_ca_topic_score_gemma":0.0024355345,"teacher_disagreement_score":0.06797997,"about_ca_system_score_codex":0.0015254521,"about_ca_system_score_gemma":0.0007818137,"threshold_uncertainty_score":0.22741562},"labels":[],"label_agreement":null},{"id":"W2161640119","doi":"10.13001/1081-3810.1063","title":"An upper bound on algebraic connectivity of graphs with many cutpoints","year":2001,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Graph theory and applications","field":"Mathematics","cited_by":13,"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; Algebraic number; Upper and lower bounds; Combinatorics; Algebraic connectivity; Discrete mathematics; Algebra over a field; Graph; Pure mathematics; Mathematical analysis; Laplacian matrix","score_opus":0.01586762715091431,"score_gpt":0.2926576746754576,"score_spread":0.2767900475245433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161640119","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4596415,0.008225297,0.3921179,0.006438585,0.00028536216,0.00018368472,0.0028391725,0.0013218742,0.12894663],"genre_scores_gemma":[0.9441288,0.0035915175,0.045585524,0.00047697977,0.00053578924,0.00019083293,0.0015151346,0.00028321438,0.0036920162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968303,0.0005523264,0.00013180565,0.0009254199,0.00093437143,0.00062577164],"domain_scores_gemma":[0.95641303,0.034528807,0.0025577038,0.0027472216,0.001968699,0.0017845929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018449216,0.0014914285,0.0017160805,0.0043042446,0.0023237525,0.0046883216,0.0028811798,0.0018450982,0.010751908],"category_scores_gemma":[0.028144091,0.0011957352,0.001005537,0.00554732,0.003942955,0.010873411,0.00434653,0.0045753126,0.0012376168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071339455,0.00022755537,0.011105277,0.0010685194,0.00019095387,0.0011589347,0.0014580601,0.091287576,0.020287188,0.7734154,0.014233242,0.08485397],"study_design_scores_gemma":[0.000063708765,0.00022194424,0.008794468,0.000262888,0.00015764116,0.0017756125,0.0004745891,0.1200063,0.00772742,0.8460277,0.014346624,0.00014103868],"about_ca_topic_score_codex":0.0019081334,"about_ca_topic_score_gemma":0.0026862936,"teacher_disagreement_score":0.010751908,"about_ca_system_score_codex":0.0014994435,"about_ca_system_score_gemma":0.0005494928,"threshold_uncertainty_score":0.03596872},"labels":[],"label_agreement":null},{"id":"W2161642992","doi":"10.1016/j.laa.2009.12.031","title":"A sharp upper bound on algebraic connectivity using domination number","year":2010,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":10,"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; Algebraic connectivity; Domination analysis; Combinatorics; Vertex (graph theory); Dominating set; Upper and lower bounds; Connectivity; Algebraic number; Laplacian matrix; Eigenvalues and eigenvectors; Graph; Discrete mathematics","score_opus":0.031450741263081304,"score_gpt":0.3307727244216653,"score_spread":0.299321983158584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161642992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13750143,0.020747306,0.55775136,0.021556063,0.0024624798,0.00025702256,0.0019700862,0.0018671221,0.25588712],"genre_scores_gemma":[0.84979117,0.012769965,0.08236098,0.004998368,0.005657774,0.00073460815,0.0012321945,0.0012018115,0.04125316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950546,0.0012434024,0.00018219097,0.0012961202,0.0014290906,0.0007945327],"domain_scores_gemma":[0.9422859,0.04684001,0.0018139525,0.003493877,0.0020952306,0.0034709712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044430974,0.0034663954,0.004717243,0.008767464,0.0040190485,0.007641895,0.008190582,0.0047290917,0.019938761],"category_scores_gemma":[0.038999636,0.0026104578,0.0026022878,0.008721779,0.010570104,0.028563362,0.01219423,0.014088967,0.003063778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022969076,0.00009955589,0.0009308822,0.00047766184,0.0000618173,0.00015094089,0.00039789022,0.0079804305,0.0028163444,0.95515805,0.010875194,0.02082155],"study_design_scores_gemma":[0.000026580765,0.000042880914,0.00048987963,0.00010000117,0.000071559756,0.00023776283,0.00006589967,0.024276907,0.0010898866,0.96707225,0.0064665442,0.000059996608],"about_ca_topic_score_codex":0.0011986352,"about_ca_topic_score_gemma":0.0014902786,"teacher_disagreement_score":0.019938761,"about_ca_system_score_codex":0.003641633,"about_ca_system_score_gemma":0.0013057241,"threshold_uncertainty_score":0.06670183},"labels":[],"label_agreement":null},{"id":"W2161956647","doi":"10.1002/jgt.20117","title":"Chromatic numbers of products of graphs: The directed and undirected versions of the Poljak‐Rödl function","year":2005,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Graph theory and applications","field":"Mathematics","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":"Royal Military College of Canada","funders":"","keywords":"Chromatic scale; Combinatorics; Mathematics; Bounded function; Graph; Undirected graph; Discrete mathematics; Function (biology)","score_opus":0.015383154562191668,"score_gpt":0.2502909535043486,"score_spread":0.23490779894215694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161956647","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7142399,0.0020107382,0.22156824,0.0013287303,0.0001418137,0.000061113606,0.0007230357,0.00029576407,0.059630617],"genre_scores_gemma":[0.9692984,0.0005915995,0.022776881,0.00012227467,0.00007331098,0.00008507362,0.0002843828,0.00012375801,0.0066443807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994758,0.00012606282,0.000027936923,0.00015102558,0.00011799972,0.00010130563],"domain_scores_gemma":[0.9939148,0.003624609,0.00083904545,0.00047029371,0.00057051255,0.00058075984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015748177,0.0004998925,0.0004082546,0.002323934,0.0009073366,0.0038097515,0.0012062099,0.0006532827,0.0037044943],"category_scores_gemma":[0.0073763058,0.00043624893,0.00046184746,0.0015297796,0.002861149,0.0047644996,0.0014515906,0.0012657824,0.0005064626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016328272,0.00001892005,0.0026955258,0.00006355492,0.000017017159,0.000102823025,0.0003129975,0.013417841,0.0020836769,0.96541923,0.0018337793,0.0138713755],"study_design_scores_gemma":[0.00003146954,0.000046742232,0.003238895,0.000069223584,0.000042570126,0.0003954363,0.00021782322,0.08678574,0.0031291717,0.89591134,0.010069394,0.000062106854],"about_ca_topic_score_codex":0.0020940336,"about_ca_topic_score_gemma":0.0016882063,"teacher_disagreement_score":0.0038097515,"about_ca_system_score_codex":0.002471266,"about_ca_system_score_gemma":0.00066465343,"threshold_uncertainty_score":0.017930388},"labels":[],"label_agreement":null},{"id":"W2165370261","doi":"10.1016/j.laa.2004.09.004","title":"The exponent and circumdiameter of primitive digraphs","year":2004,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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":"Digraph; Mathematics; Combinatorics; Exponent; Upper and lower bounds; Discrete mathematics; Mathematical analysis","score_opus":0.023914266897901403,"score_gpt":0.284330383333721,"score_spread":0.26041611643581963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165370261","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7378226,0.0026113822,0.18633449,0.0025841421,0.0004100294,0.00006043927,0.0011171518,0.00028181958,0.06877803],"genre_scores_gemma":[0.95874506,0.0017742661,0.02511159,0.00033023223,0.0006682546,0.00006858202,0.00046832275,0.00017244328,0.012661343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929845,0.00015333878,0.000058636066,0.00020768058,0.00015341544,0.00012843535],"domain_scores_gemma":[0.9892091,0.007056749,0.0010403104,0.0006172143,0.0006717428,0.0014048832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012415213,0.00066443847,0.0013781381,0.0030708644,0.0018296855,0.0039176787,0.0011278539,0.00096264307,0.0052803517],"category_scores_gemma":[0.008177515,0.0010234392,0.000541505,0.0020346572,0.0036055897,0.008968329,0.0021207219,0.0025767917,0.00071827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007407531,0.000019010982,0.0009478041,0.000054356668,0.000006644796,0.00010246255,0.0003741655,0.00093528087,0.0012887173,0.9889325,0.0010466123,0.006218347],"study_design_scores_gemma":[0.00002619899,0.000026571217,0.0010626799,0.00003121618,0.00001908973,0.00032523728,0.00018130186,0.006605747,0.0007710857,0.9872454,0.0036876535,0.000017745051],"about_ca_topic_score_codex":0.00059465226,"about_ca_topic_score_gemma":0.00083021354,"teacher_disagreement_score":0.0052803517,"about_ca_system_score_codex":0.0011808252,"about_ca_system_score_gemma":0.00045220248,"threshold_uncertainty_score":0.017664492},"labels":[],"label_agreement":null},{"id":"W2167521379","doi":"10.2478/s11533-013-0283-z","title":"Tricyclic graphs with exactly two main eigenvalues","year":2013,"lang":"en","type":"article","venue":"Open Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":9,"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; National Natural Science Foundation of China","keywords":"Eigenvalues and eigenvectors; Mathematics; Combinatorics; Algebraic connectivity; Graph; Connectivity; Discrete mathematics; Line graph; Physics; Quantum mechanics","score_opus":0.059538929305590856,"score_gpt":0.3405654881236767,"score_spread":0.28102655881808586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167521379","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93692434,0.00046873357,0.024315242,0.0002082256,0.00010200463,0.000053863296,0.0006498164,0.0002392921,0.037038386],"genre_scores_gemma":[0.9888902,0.00015142177,0.0065820306,0.00008033602,0.000035631863,0.00003829177,0.00029096263,0.000023210654,0.003907941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996805,0.000052901825,0.00002308682,0.0000739378,0.000072018556,0.00009752115],"domain_scores_gemma":[0.9988825,0.00022129028,0.00026303696,0.00017095193,0.0002671789,0.00019508137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012095571,0.00048561962,0.0004937968,0.0016092476,0.0007226859,0.0009171514,0.00037874802,0.00053486135,0.003804626],"category_scores_gemma":[0.00100174,0.00029122757,0.0002961626,0.0008588683,0.00077476946,0.00066784985,0.00092224864,0.0004888123,0.0005179708],"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.0012188312,0.00027659844,0.009037545,0.000817889,0.00015016756,0.004197103,0.0012816803,0.030495506,0.12237124,0.7290948,0.019670825,0.08138794],"study_design_scores_gemma":[0.00024925912,0.0003476256,0.014881133,0.00020493136,0.00012021081,0.005370257,0.0011437399,0.08272118,0.035456594,0.83885956,0.020498546,0.00014697104],"about_ca_topic_score_codex":0.00041969548,"about_ca_topic_score_gemma":0.00082693226,"teacher_disagreement_score":0.003804626,"about_ca_system_score_codex":0.00036481014,"about_ca_system_score_gemma":0.00024251337,"threshold_uncertainty_score":0.012727737},"labels":[],"label_agreement":null},{"id":"W2174316934","doi":"10.37236/5725","title":"Generalizations of the Strong Arnold Property and the Minimum Number of Distinct Eigenvalues of a Graph","year":2017,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","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":"University of Regina","funders":"","keywords":"Eigenvalues and eigenvectors; Diagonal; Multiplicity (mathematics); Combinatorics; Mathematics; Property (philosophy); Graph; Graph theory; Discrete mathematics; Physics; Mathematical analysis; Quantum mechanics; Geometry","score_opus":0.03057293810492978,"score_gpt":0.3075423517524653,"score_spread":0.2769694136475355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174316934","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59389454,0.0012667784,0.36397737,0.0013328764,0.0002250792,0.000078915684,0.00060456025,0.00029700188,0.03832288],"genre_scores_gemma":[0.9553538,0.00059947587,0.038325537,0.0001563783,0.0003086585,0.000107380314,0.00023532612,0.000087717934,0.0048257224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990877,0.00019008321,0.000059893107,0.00033087144,0.00018755146,0.00014391387],"domain_scores_gemma":[0.9950488,0.002533051,0.0008042461,0.0006753745,0.00041882085,0.00051960506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009908788,0.0006965731,0.00068411074,0.002197486,0.0012357668,0.0016974129,0.0012054449,0.0009404388,0.004282633],"category_scores_gemma":[0.0056425105,0.00044769084,0.00077148876,0.0009484808,0.0027193362,0.0036466904,0.0017157666,0.0012627298,0.00054925325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014665973,0.000044824257,0.0021458862,0.00016910724,0.000039489234,0.00030634628,0.00036505293,0.014370627,0.010380559,0.95149606,0.0019678064,0.018567616],"study_design_scores_gemma":[0.000017246299,0.000045079785,0.0009912774,0.000022226144,0.000015769505,0.0004171949,0.00016135535,0.032635197,0.0023024054,0.9606271,0.0027394919,0.000025534531],"about_ca_topic_score_codex":0.0003892146,"about_ca_topic_score_gemma":0.0004146911,"teacher_disagreement_score":0.004282633,"about_ca_system_score_codex":0.00066509354,"about_ca_system_score_gemma":0.00045811696,"threshold_uncertainty_score":0.014326811},"labels":[],"label_agreement":null},{"id":"W2176943562","doi":"10.1016/s1571-0653(04)00071-x","title":"Addressing the Petersen graph","year":2002,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"Queen's University; Redeemer University College","funders":"","keywords":"Combinatorics; Graph; Tuple; Mathematics; Graph power; Eigenvalues and eigenvectors; Wheel graph; Petersen graph; Discrete mathematics; Shader; Distance-regular graph; Butterfly graph; Voltage graph; Computer science; Line graph; Graphics","score_opus":0.1028449178796152,"score_gpt":0.33586503391173866,"score_spread":0.23302011603212347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2176943562","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19962424,0.0034549572,0.30703634,0.02064838,0.0035666714,0.0001325617,0.00054297113,0.00071204896,0.4642818],"genre_scores_gemma":[0.8165289,0.0032707455,0.06726275,0.0024330954,0.0021391115,0.000117929834,0.0007517102,0.00045994748,0.10703592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996216,0.00010405706,0.000012455155,0.000092640155,0.0000831012,0.00008612445],"domain_scores_gemma":[0.9994399,0.00021046387,0.00004898233,0.00012795249,0.00008332811,0.00008943374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036116716,0.00054740807,0.00071236625,0.0012986121,0.0027192002,0.0021353574,0.0009974616,0.0020721802,0.015020038],"category_scores_gemma":[0.002398631,0.00038656924,0.0008247187,0.0010161564,0.0018152888,0.005316505,0.0036436217,0.003294349,0.0021107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010834702,0.00001130429,0.000064978594,0.000035648653,0.0000054317306,0.000057801535,0.000092382004,0.0013337957,0.0002674799,0.984522,0.0054726074,0.008125757],"study_design_scores_gemma":[0.000003158332,0.0000036134493,0.000029841765,0.000007229432,0.0000037917664,0.000043932538,0.00008127141,0.004489523,0.00026098083,0.985493,0.009579721,0.0000038687394],"about_ca_topic_score_codex":0.0012876384,"about_ca_topic_score_gemma":0.0017793035,"teacher_disagreement_score":0.015020038,"about_ca_system_score_codex":0.00074895873,"about_ca_system_score_gemma":0.00067829096,"threshold_uncertainty_score":0.050247073},"labels":[],"label_agreement":null},{"id":"W2177700890","doi":"","title":"Extremal bipartite graphs with high girth","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Girth (graph theory); Complete bipartite graph; Graph; Degree (music); Odd graph; Pancyclic graph; Discrete mathematics; Triangle-free graph; Foster graph; 1-planar graph; Graph power; Line graph; Physics","score_opus":0.02002632650413408,"score_gpt":0.26915747818237873,"score_spread":0.24913115167824465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177700890","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9525862,0.0006337133,0.03504121,0.0004844838,0.000024260948,0.000012583173,0.00025736456,0.00018536409,0.010774889],"genre_scores_gemma":[0.9904935,0.00020706096,0.0080186445,0.000065688626,0.000045771147,0.000017532735,0.00020261596,0.000025169436,0.0009239798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942577,0.0001683122,0.000017228149,0.00014878281,0.00010054598,0.00013939073],"domain_scores_gemma":[0.9977768,0.0011129427,0.0003675542,0.00032406644,0.00015674252,0.00026185074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041590925,0.0002645512,0.00052701484,0.0011550697,0.0008621008,0.0010644773,0.00052955444,0.00068688986,0.0015975495],"category_scores_gemma":[0.0033889168,0.00034057006,0.00025471897,0.00075916253,0.0009280316,0.0011570895,0.0013307711,0.00064560183,0.00022675129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013464474,0.00016192206,0.03668822,0.00041281793,0.00017273932,0.003332966,0.0014845864,0.06546629,0.06758707,0.7412598,0.009336433,0.07275085],"study_design_scores_gemma":[0.000075777054,0.00018139665,0.026856562,0.00007106149,0.00008471344,0.006048219,0.0007392211,0.1571451,0.015860122,0.77964264,0.013226483,0.00006867982],"about_ca_topic_score_codex":0.0002048371,"about_ca_topic_score_gemma":0.00034435745,"teacher_disagreement_score":0.0015975495,"about_ca_system_score_codex":0.0005457599,"about_ca_system_score_gemma":0.00016282675,"threshold_uncertainty_score":0.0053443313},"labels":[],"label_agreement":null},{"id":"W2180596940","doi":"10.1139/cjc-2015-0185","title":"On topological properties of dominating David derived networks","year":2015,"lang":"en","type":"article","venue":"Canadian Journal of Chemistry","topic":"Graph theory and applications","field":"Mathematics","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Higher Education Commision, Pakistan","keywords":"Topological index; Quantitative structure–activity relationship; Topology (electrical circuits); Invariant (physics); Graph theory; Interconnection; Network topology; Graph; Mathematical chemistry; Chemistry; Mathematics; Computational chemistry; Discrete mathematics; Computer science; Combinatorics; Stereochemistry","score_opus":0.06710359904325879,"score_gpt":0.26571568938982704,"score_spread":0.19861209034656824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2180596940","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5320591,0.0015671412,0.39368147,0.0007874289,0.000103544626,0.00013260038,0.0008674383,0.00013917423,0.07066208],"genre_scores_gemma":[0.956479,0.0012015356,0.033971604,0.0001641501,0.000102111866,0.000105094645,0.000752851,0.00004330894,0.0071802544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999496,0.00017815917,0.00002802555,0.0000982302,0.00013727309,0.000062311796],"domain_scores_gemma":[0.99693835,0.0017208775,0.0004197785,0.00015437935,0.0004937304,0.00027302705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083841383,0.0004119704,0.00033457798,0.0030573572,0.00091912836,0.0017935205,0.00076986605,0.0005029157,0.0029287683],"category_scores_gemma":[0.0053803353,0.0002604602,0.00040535425,0.0012859985,0.001305881,0.0021482776,0.0008661044,0.0007334054,0.00030789274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045215154,0.000025059784,0.0027429834,0.00009516853,0.000020824646,0.00019410157,0.00027896726,0.03980883,0.0027200596,0.9370239,0.0019011991,0.015143746],"study_design_scores_gemma":[0.00001693339,0.000072483606,0.002553838,0.000051679912,0.000034214416,0.0005792338,0.0003395899,0.27829757,0.002012638,0.7053321,0.010678214,0.00003149011],"about_ca_topic_score_codex":0.0008181499,"about_ca_topic_score_gemma":0.0009932356,"teacher_disagreement_score":0.0030573572,"about_ca_system_score_codex":0.0014761398,"about_ca_system_score_gemma":0.0003447871,"threshold_uncertainty_score":0.01071018},"labels":[],"label_agreement":null},{"id":"W2181133991","doi":"","title":"Independent Cycles in a Bipartite Graph.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Graph; Complete bipartite graph; Combinatorics","score_opus":0.025259145208541306,"score_gpt":0.29056747833971486,"score_spread":0.2653083331311735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2181133991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34424347,0.0043098647,0.45033902,0.004287659,0.00074720825,0.00034201954,0.0028204643,0.0008578271,0.19205247],"genre_scores_gemma":[0.80808884,0.0032041082,0.11075084,0.0013089939,0.00064908195,0.0006412422,0.0025060412,0.00042566983,0.072425164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989569,0.00038740443,0.000059462087,0.00025246566,0.00019369068,0.00015015608],"domain_scores_gemma":[0.9958062,0.0023338515,0.0006256453,0.00035374134,0.00041415222,0.00046640585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064923335,0.00065663026,0.0006747671,0.0029306572,0.001864335,0.0023667736,0.0011066234,0.0017203882,0.0105681745],"category_scores_gemma":[0.0052002748,0.0006900182,0.00076280837,0.002909149,0.0016837872,0.003614045,0.0016711545,0.0017290612,0.002436494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071339615,0.000049405706,0.0007906342,0.00017472084,0.000043349133,0.00030912156,0.0003330034,0.0033269504,0.0017352243,0.960509,0.0104990285,0.022158274],"study_design_scores_gemma":[0.000018883298,0.000013681475,0.0003881399,0.00005400889,0.000029266052,0.00028148794,0.00012837544,0.013759114,0.00063313957,0.97337836,0.011301028,0.000014455231],"about_ca_topic_score_codex":0.0016469549,"about_ca_topic_score_gemma":0.0026869373,"teacher_disagreement_score":0.0105681745,"about_ca_system_score_codex":0.001084406,"about_ca_system_score_gemma":0.00072192185,"threshold_uncertainty_score":0.035354078},"labels":[],"label_agreement":null},{"id":"W2187800665","doi":"10.4153/cmb-2016-063-5","title":"Degree Kirchhoff Index of Bicyclic Graphs","year":2016,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Graph theory and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Degree (music); Graph; Resistance distance; Discrete mathematics; Line graph; Graph power; Physics","score_opus":0.04740859757095069,"score_gpt":0.2711248911916235,"score_spread":0.22371629362067277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2187800665","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97657645,0.00019829786,0.010719273,0.00008445536,0.000015322019,0.000016465397,0.00024998706,0.00004624278,0.012093456],"genre_scores_gemma":[0.9976586,0.00007186954,0.0013343266,0.000014707548,0.00000946932,0.000008828448,0.00007942096,0.0000070668543,0.0008156341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977416,0.000028730235,0.000014160796,0.000044786913,0.00005258053,0.000085647174],"domain_scores_gemma":[0.9990852,0.00028264904,0.00021227193,0.00008692511,0.00011763883,0.00021529154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016530721,0.00019294623,0.00035883771,0.0020075152,0.0007704466,0.00090305903,0.00039078898,0.0002632077,0.0017858528],"category_scores_gemma":[0.0011105139,0.00014877264,0.0001548605,0.0012018988,0.0007047172,0.0009225159,0.00052011356,0.00023584825,0.0001455776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009926321,0.00021982964,0.034025863,0.00028604319,0.000089235735,0.00088283076,0.0014198188,0.08501089,0.057950698,0.7623398,0.0038415734,0.05294088],"study_design_scores_gemma":[0.0000715976,0.00021235285,0.026990244,0.000072371266,0.00006801233,0.0012227616,0.000990013,0.19695558,0.02037769,0.74518496,0.0077326843,0.00012177942],"about_ca_topic_score_codex":0.001259167,"about_ca_topic_score_gemma":0.0016300062,"teacher_disagreement_score":0.0020075152,"about_ca_system_score_codex":0.00054037693,"about_ca_system_score_gemma":0.00029030305,"threshold_uncertainty_score":0.005974233},"labels":[],"label_agreement":null},{"id":"W2187967931","doi":"","title":"Note on the Laplacian Estrada index of a graph","year":2011,"lang":"en","type":"article","venue":"HKBU Institutional Repository (Hong Kong Baptist University)","topic":"Graph theory and applications","field":"Mathematics","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":"Index (typography); Mathematics; Graph; Combinatorics; Computer science; World Wide Web","score_opus":0.041787894891474,"score_gpt":0.2249073355767807,"score_spread":0.1831194406853067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2187967931","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32124665,0.017657418,0.2825712,0.005277824,0.0031139595,0.00007192603,0.0014993062,0.0010477834,0.36751404],"genre_scores_gemma":[0.9432781,0.0048778052,0.027788287,0.0006971602,0.0016159605,0.00005743684,0.00050865236,0.00020503117,0.020971496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996394,0.00006024995,0.000022547023,0.0001031622,0.0001274757,0.00004712406],"domain_scores_gemma":[0.99819934,0.00096246356,0.00015200411,0.00019530245,0.00024176112,0.00024909482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005726718,0.0005497217,0.000646907,0.0036749335,0.0006816747,0.0010151027,0.0007213572,0.0005180239,0.006323454],"category_scores_gemma":[0.0033438476,0.00019084883,0.00038276688,0.0022327937,0.0015661608,0.0025318868,0.0012620396,0.0015568319,0.0010005335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000957218,0.000046518242,0.0014475038,0.00013519783,0.0000229623,0.00026554114,0.00029673698,0.005340349,0.0061405054,0.9440042,0.009368592,0.03283624],"study_design_scores_gemma":[0.000014861557,0.00009118892,0.0031109985,0.000055177905,0.000024244162,0.0005587158,0.00020499554,0.021137789,0.0018672935,0.9470835,0.025787378,0.00006382268],"about_ca_topic_score_codex":0.00093312305,"about_ca_topic_score_gemma":0.0011595462,"teacher_disagreement_score":0.006323454,"about_ca_system_score_codex":0.0005070555,"about_ca_system_score_gemma":0.00025064277,"threshold_uncertainty_score":0.021154046},"labels":[],"label_agreement":null},{"id":"W2189028915","doi":"10.1080/09728600.2007.12088828","title":"Energy of a set of vertices in a Graph","year":2007,"lang":"en","type":"article","venue":"AKCE International Journal of Graphs and Combinatorics","topic":"Graph theory and applications","field":"Mathematics","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":"Women's College Hospital","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Incidence matrix; Eigenvalues and eigenvectors; Diagonal; Graph energy; Graph; Diagonal matrix; Discrete mathematics; Graph power; Physics; Geometry; Line graph; Quantum mechanics","score_opus":0.02262815510995592,"score_gpt":0.3114747062233684,"score_spread":0.2888465511134125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189028915","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71967816,0.0006751597,0.256508,0.0009504875,0.000081625214,0.00005050218,0.0009198069,0.0001285853,0.021007674],"genre_scores_gemma":[0.96555096,0.00043273292,0.026488876,0.000102903374,0.00007722792,0.00009054504,0.00039044066,0.00006210435,0.006804132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952984,0.0000854881,0.000033837765,0.0001256511,0.00014566514,0.00007945648],"domain_scores_gemma":[0.999079,0.0004718162,0.000119905686,0.000121825644,0.00008871494,0.000118672506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005071104,0.00040902378,0.00063762954,0.0016470004,0.0006088736,0.0016361978,0.000891365,0.0007970534,0.0034864878],"category_scores_gemma":[0.0021522483,0.0002603651,0.0004097063,0.001410908,0.0014272314,0.002227728,0.0011021848,0.00049074256,0.00029736533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020185986,0.00005919543,0.008194965,0.00030463716,0.00015379569,0.00044841325,0.00072155934,0.09435811,0.025117548,0.8401526,0.0015797653,0.02870759],"study_design_scores_gemma":[0.000017260018,0.00009142887,0.006459043,0.000065894325,0.000056293055,0.0007512859,0.00060182484,0.18231735,0.005918839,0.79627824,0.007403257,0.00003927985],"about_ca_topic_score_codex":0.0003648943,"about_ca_topic_score_gemma":0.0004179978,"teacher_disagreement_score":0.0034864878,"about_ca_system_score_codex":0.0006368992,"about_ca_system_score_gemma":0.00024362857,"threshold_uncertainty_score":0.011663437},"labels":[],"label_agreement":null},{"id":"W2196944838","doi":"10.1142/s1793830916500099","title":"On the graph of nilpotent matrix group of length one","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Graph theory and applications","field":"Mathematics","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 Manitoba","funders":"","keywords":"Combinatorics; Mathematics; Cayley graph; Adjacency matrix; Laplacian matrix; Multiplicative function; Graph; Nilpotent; Degree matrix; Nilpotent group; Discrete mathematics; Graph power; Line graph","score_opus":0.05179355761883672,"score_gpt":0.30713388040848066,"score_spread":0.2553403227896439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2196944838","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80834395,0.0011063358,0.14034484,0.0008991659,0.0003142388,0.000057772537,0.0003893695,0.00045305266,0.048091207],"genre_scores_gemma":[0.9594806,0.00073804666,0.026244687,0.00032471961,0.00020659674,0.000054241824,0.00045305424,0.00012177856,0.012376263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999793,0.00004947889,0.000005785355,0.00006649914,0.000051710616,0.000033527656],"domain_scores_gemma":[0.99960977,0.000102441016,0.00008800265,0.0000380042,0.00007789668,0.00008381342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001098707,0.00039697462,0.00035582544,0.0011099846,0.0008681576,0.0006906896,0.0005494928,0.0003915878,0.004426249],"category_scores_gemma":[0.00052843406,0.0001403932,0.000290395,0.0005274747,0.0008348115,0.0012552459,0.00065330666,0.00059796334,0.00063863304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079670994,0.00003454523,0.0007872783,0.00012856108,0.00001655268,0.00050267647,0.00040143036,0.0040636244,0.011757578,0.9684092,0.002264823,0.011554179],"study_design_scores_gemma":[0.000025142115,0.000102921076,0.0011313455,0.000027922324,0.000018792556,0.00075657316,0.0002786403,0.03178082,0.004877179,0.9515986,0.009365741,0.00003642251],"about_ca_topic_score_codex":0.00064892776,"about_ca_topic_score_gemma":0.0006820952,"teacher_disagreement_score":0.004426249,"about_ca_system_score_codex":0.000345485,"about_ca_system_score_gemma":0.00022755635,"threshold_uncertainty_score":0.014807224},"labels":[],"label_agreement":null},{"id":"W2216111877","doi":"10.1016/j.disc.2015.12.005","title":"The difference and ratio of the fractional matching number and the matching number of graphs","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Matching (statistics); Vertex (graph theory); Graph; Alpha (finance); Discrete mathematics; Bipartite graph; Statistics","score_opus":0.029488448416568232,"score_gpt":0.3089172482565552,"score_spread":0.279428799839987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2216111877","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6591188,0.005024945,0.25592777,0.0052324682,0.0010729945,0.00006176148,0.0005835106,0.00042043807,0.07255735],"genre_scores_gemma":[0.9654037,0.0013995639,0.025035981,0.00037648983,0.0007770352,0.00008881135,0.0002030982,0.00012377644,0.0065915403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985318,0.0005360494,0.00006430756,0.00037558613,0.00031023484,0.00018201154],"domain_scores_gemma":[0.98802865,0.008525407,0.0012191508,0.0007348621,0.0006689752,0.00082296843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028066305,0.0006449404,0.0012172027,0.0041147997,0.0009812354,0.0027319163,0.0025973246,0.0018645115,0.006120155],"category_scores_gemma":[0.025057115,0.00048076833,0.000735062,0.002335528,0.0041775615,0.0075120456,0.0018081728,0.0022957744,0.0005665867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023643921,0.00003734122,0.0008546638,0.00009407369,0.0000212309,0.00005413518,0.00013847322,0.0075227777,0.0021183072,0.9753483,0.0012633653,0.012310927],"study_design_scores_gemma":[0.000025867465,0.000034813787,0.00074180117,0.000025286854,0.000020001375,0.00019857734,0.000059043625,0.042109184,0.0012950074,0.9531155,0.0023504733,0.000024408466],"about_ca_topic_score_codex":0.00057539245,"about_ca_topic_score_gemma":0.00028840016,"teacher_disagreement_score":0.006120155,"about_ca_system_score_codex":0.001975023,"about_ca_system_score_gemma":0.0006688952,"threshold_uncertainty_score":0.020473897},"labels":[],"label_agreement":null},{"id":"W2216780118","doi":"10.1007/s00454-017-9899-2","title":"Universal Completability, Least Eigenvalue Frameworks, and Vector Colorings","year":2017,"lang":"en","type":"preprint","venue":"Discrete & Computational Geometry","topic":"Graph theory and applications","field":"Mathematics","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 Waterloo","funders":"Engineering and Physical Sciences Research Council; National Research Foundation Singapore; Grantová Agentura České Republiky; Ministerstvo Školství, Mládeže a Tělovýchovy; National Research Foundation","keywords":"Eigenvalues and eigenvectors; Combinatorics; Mathematics; Adjacency matrix; Embedding; Discrete mathematics; Positive-definite matrix; Graph; Computer science","score_opus":0.050012090198601866,"score_gpt":0.3387573476827348,"score_spread":0.28874525748413293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2216780118","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5885562,0.00057687826,0.3913024,0.00058315805,0.000048789938,0.000054265533,0.00052962796,0.0011092093,0.017239464],"genre_scores_gemma":[0.95974785,0.00015893951,0.0371753,0.00007585802,0.000027813747,0.000045106743,0.00040174724,0.00011138003,0.0022559224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988882,0.00022365613,0.0000378325,0.0003064986,0.00017834941,0.0003654101],"domain_scores_gemma":[0.99806076,0.0007609092,0.00036510077,0.00032597873,0.00022559761,0.00026165764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007881517,0.0005960311,0.00039985526,0.001364809,0.001433217,0.0014806752,0.0009840966,0.00062445214,0.004382811],"category_scores_gemma":[0.0030667942,0.00039552822,0.00086314185,0.0012910849,0.0024887945,0.0028625233,0.0014435359,0.0014186206,0.00032463664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082622784,0.00005563004,0.0017047095,0.00006865993,0.000024399782,0.00014484358,0.0003605729,0.0350577,0.0045791147,0.9407014,0.0017896033,0.015430619],"study_design_scores_gemma":[0.000016209293,0.000062489264,0.0014708602,0.00002705673,0.000019431165,0.00023193347,0.00035174293,0.091572285,0.0038558377,0.89848304,0.0038479252,0.00006121304],"about_ca_topic_score_codex":0.004185542,"about_ca_topic_score_gemma":0.006138712,"teacher_disagreement_score":0.004382811,"about_ca_system_score_codex":0.0014840722,"about_ca_system_score_gemma":0.00079242245,"threshold_uncertainty_score":0.014661968},"labels":[],"label_agreement":null},{"id":"W2221292057","doi":"10.1139/cjc-2015-0466","title":"On molecular topological properties of dendrimers","year":2015,"lang":"en","type":"article","venue":"Canadian Journal of Chemistry","topic":"Graph theory and applications","field":"Mathematics","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Higher Education Commision, Pakistan; Bahauddin Zakariya University","keywords":"Topological index; Quantitative structure–activity relationship; Dendrimer; Topology (electrical circuits); Molecular graph; Chemistry; Graph; Invariant (physics); Topological graph; Graph theory; Computational chemistry; Mathematics; Discrete mathematics; Stereochemistry; Combinatorics; Organic chemistry","score_opus":0.06268695571562002,"score_gpt":0.2663046454415323,"score_spread":0.2036176897259123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2221292057","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7106185,0.0047978135,0.21279213,0.0011638036,0.00019933813,0.000081232516,0.00034517268,0.00018301525,0.06981907],"genre_scores_gemma":[0.9800862,0.001972627,0.012669239,0.00010175821,0.00012682771,0.000046910372,0.00015300064,0.000070009395,0.004773393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998797,0.000028712067,0.000006344402,0.000022701377,0.000043429285,0.000019144445],"domain_scores_gemma":[0.99903786,0.0004994614,0.00017995699,0.000059135164,0.00015247779,0.000071205155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003324179,0.00034460786,0.00023826554,0.0020573852,0.00040478777,0.0009629949,0.000314295,0.0003799814,0.0017576105],"category_scores_gemma":[0.0024608055,0.00015007333,0.00026346731,0.0007496246,0.0012007006,0.0014696094,0.0005208299,0.00051025866,0.00026095586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055292767,0.000038812603,0.0010026708,0.00016856227,0.000011223876,0.00018364654,0.00020599965,0.07310049,0.018299203,0.8899644,0.00095202716,0.016017677],"study_design_scores_gemma":[0.000014687517,0.00015537815,0.002521612,0.00008769878,0.000021655198,0.00048414114,0.00017857192,0.40033644,0.0075800917,0.5814836,0.007082399,0.000053652002],"about_ca_topic_score_codex":0.00034624402,"about_ca_topic_score_gemma":0.00032644917,"teacher_disagreement_score":0.0020573852,"about_ca_system_score_codex":0.00066441786,"about_ca_system_score_gemma":0.00021672086,"threshold_uncertainty_score":0.0058798194},"labels":[],"label_agreement":null},{"id":"W2225143678","doi":"10.1017/fms.2017.13","title":"HYPERELLIPTIC GRAPHS AND METRIZED COMPLEXES","year":2017,"lang":"en","type":"article","venue":"Forum of Mathematics Sigma","topic":"Graph theory and applications","field":"Mathematics","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":"Yale University","keywords":"Mathematics; Combinatorics","score_opus":0.06014406230934535,"score_gpt":0.32396810341726107,"score_spread":0.2638240411079157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2225143678","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82913226,0.0011925534,0.099659815,0.0011125146,0.00013356542,0.00005334484,0.0003375442,0.00013419923,0.06824414],"genre_scores_gemma":[0.98434746,0.00039029607,0.007581613,0.0001107856,0.000091751775,0.000017156166,0.00019975632,0.0000266949,0.007234419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996903,0.000033350807,0.000012451748,0.00007612926,0.00012014978,0.00006778073],"domain_scores_gemma":[0.99931073,0.00014619832,0.00015501466,0.000090544374,0.00011758573,0.00017993525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031783376,0.00043194927,0.000308061,0.0017296359,0.0010770696,0.0018849515,0.0005640018,0.00055975385,0.005373042],"category_scores_gemma":[0.0013410712,0.00024136348,0.0003413878,0.0009497078,0.0022119198,0.0024443516,0.0020709755,0.0011674021,0.00045920914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025868434,0.000012223031,0.0012517434,0.00004744788,0.000007912778,0.00020446928,0.00046412865,0.0022772823,0.0030557306,0.9840577,0.0009459682,0.007649543],"study_design_scores_gemma":[0.000024461135,0.00006663254,0.0035739923,0.00006141744,0.000019773744,0.00096518727,0.0008550098,0.017521542,0.005620628,0.9479685,0.023288371,0.000034423032],"about_ca_topic_score_codex":0.0010588514,"about_ca_topic_score_gemma":0.0009436916,"teacher_disagreement_score":0.005373042,"about_ca_system_score_codex":0.0009970892,"about_ca_system_score_gemma":0.00023275916,"threshold_uncertainty_score":0.017974555},"labels":[],"label_agreement":null},{"id":"W2230043562","doi":"10.1007/978-3-540-44928-7_29","title":"Digraph-based Conditioning for Markov Chains","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in control and information sciences","topic":"Graph theory and applications","field":"Mathematics","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 Regina","funders":"","keywords":"Markov chain; Stochastic matrix; Mathematics; Iterated function; Chain (unit); Digraph; Continuous-time Markov chain; Combinatorics; Matrix (chemical analysis); Discrete mathematics; Markov model; Balance equation; Mathematical analysis; Statistics; Physics","score_opus":0.021309635340955018,"score_gpt":0.2789166965147734,"score_spread":0.2576070611738184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2230043562","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.009128175,0.0006300065,0.97905916,0.00037016274,0.00010690507,0.000039373546,0.00024335647,0.00026493322,0.010157905],"genre_scores_gemma":[0.723149,0.0034830072,0.23409392,0.0007203443,0.0005858729,0.00043646301,0.0013817158,0.00053131254,0.035618406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991177,0.00032664373,0.000042149524,0.00022083698,0.00018056724,0.00011208436],"domain_scores_gemma":[0.99286836,0.0052006547,0.00037903702,0.0005702282,0.0005665996,0.0004152152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017615041,0.0008777287,0.0015496601,0.0013884129,0.00094749936,0.0019310556,0.0017811158,0.0013257035,0.01025283],"category_scores_gemma":[0.009675506,0.0007767196,0.0013049695,0.0018744878,0.002622996,0.0030534444,0.002144311,0.0034462563,0.00088682375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004382288,0.00004069504,0.00031112606,0.00009025584,0.000026739359,0.000046361074,0.00007719087,0.08923208,0.00046459842,0.8921652,0.0024750063,0.015026941],"study_design_scores_gemma":[0.000011239076,0.000011640651,0.000109118926,0.000023414063,0.0000135677265,0.00002112756,0.000009211947,0.31849808,0.00021806134,0.67958313,0.0014890813,0.000012286267],"about_ca_topic_score_codex":0.007247862,"about_ca_topic_score_gemma":0.008555879,"teacher_disagreement_score":0.01025283,"about_ca_system_score_codex":0.0028196564,"about_ca_system_score_gemma":0.0018106926,"threshold_uncertainty_score":0.034299135},"labels":[],"label_agreement":null},{"id":"W2236526535","doi":"","title":"Hamiltonicity of the Inner Power of a Cycle","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Power (physics)","score_opus":0.01242643194636564,"score_gpt":0.2568757387617923,"score_spread":0.24444930681542668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2236526535","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6964589,0.0005908878,0.09555689,0.0015010162,0.00024143768,0.00008570707,0.00040970684,0.00018367941,0.20497179],"genre_scores_gemma":[0.9737399,0.00027466234,0.0056791804,0.00021068491,0.00015925492,0.000050071416,0.0001392351,0.00006400403,0.019682892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995623,0.00011635322,0.00001859932,0.00008003295,0.000108021755,0.00011457129],"domain_scores_gemma":[0.99857545,0.00064937863,0.00021073513,0.00013926762,0.00019809727,0.00022708952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039945045,0.00037616782,0.0005198975,0.0015417807,0.0012497534,0.0020778042,0.0007114446,0.0006906037,0.008520805],"category_scores_gemma":[0.0019243382,0.00036165712,0.0004635133,0.0010500462,0.0020855714,0.0017468992,0.0013228732,0.0011728873,0.0007977609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027780217,0.000011516629,0.00026848854,0.000023896759,0.000006576681,0.00009962587,0.00026185688,0.00085714966,0.0014289418,0.99271566,0.00086381676,0.00343474],"study_design_scores_gemma":[0.000014198336,0.000011929046,0.00022537712,0.000009134706,0.000007389859,0.00005541306,0.000091493224,0.0038282976,0.00061230327,0.99302095,0.0021151416,0.000008404682],"about_ca_topic_score_codex":0.002260372,"about_ca_topic_score_gemma":0.002258898,"teacher_disagreement_score":0.008520805,"about_ca_system_score_codex":0.000875303,"about_ca_system_score_gemma":0.00053930253,"threshold_uncertainty_score":0.028504968},"labels":[],"label_agreement":null},{"id":"W2239442459","doi":"10.48550/arxiv.1511.03317","title":"Spectral bound for separations in Eulerian digraphs","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph theory and applications","field":"Mathematics","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":"Digraph; Eulerian path; Combinatorics; Eigenvalues and eigenvectors; Upper and lower bounds; Mathematics; Subclass; Laplace operator; Laplacian matrix; Separation (statistics); Graph; Physics; Pure mathematics; Mathematical analysis; Biology; Genetics","score_opus":0.1859530118652655,"score_gpt":0.2629555979517161,"score_spread":0.07700258608645058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2239442459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39703688,0.0041222908,0.5183435,0.0052022724,0.0003535761,0.000102986734,0.0017293782,0.0012199846,0.07188924],"genre_scores_gemma":[0.954433,0.0015976039,0.032371465,0.00066095334,0.0005502597,0.00015043771,0.0009728069,0.0002707208,0.008992789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886227,0.00020714299,0.000052141415,0.0002970094,0.0003249683,0.0002565399],"domain_scores_gemma":[0.98417896,0.011346431,0.0009713273,0.00093381887,0.0009105048,0.0016589394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010195334,0.0011755538,0.0011625455,0.002798113,0.001501321,0.0030187326,0.001597767,0.0014945029,0.009673085],"category_scores_gemma":[0.012962647,0.0006667709,0.00063191366,0.0017247784,0.0026770388,0.0061993795,0.0028952498,0.0029710692,0.0015190872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026606317,0.00012431634,0.0017791309,0.000287574,0.000055477743,0.00023436459,0.0005761235,0.031736583,0.0076049026,0.92738056,0.009243333,0.020711549],"study_design_scores_gemma":[0.000018600438,0.000029466155,0.0005279025,0.000045040222,0.000016923588,0.00015189785,0.00012835293,0.082193546,0.0011580912,0.91285354,0.0028529975,0.000023633633],"about_ca_topic_score_codex":0.00084673427,"about_ca_topic_score_gemma":0.0011815458,"teacher_disagreement_score":0.009673085,"about_ca_system_score_codex":0.0020435348,"about_ca_system_score_gemma":0.00061972614,"threshold_uncertainty_score":0.03235972},"labels":[],"label_agreement":null},{"id":"W2239631536","doi":"","title":"Maximum Wiener Index of Unicyclic Graphs with Fixed Maximum Degree","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Wiener index; Degree (music); Statistics; Combinatorics; Discrete mathematics; Graph; Computer science; Physics","score_opus":0.03673490465704366,"score_gpt":0.2754255899989676,"score_spread":0.23869068534192395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2239631536","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88003445,0.0014410198,0.07696102,0.0006731816,0.00008592368,0.000028390803,0.0004889494,0.00025122208,0.040035803],"genre_scores_gemma":[0.9828316,0.000757622,0.009317231,0.00008100866,0.0001142146,0.000049349786,0.00029189204,0.00010657938,0.006450476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994299,0.00012938317,0.000036340418,0.000114108196,0.00015426653,0.00013591607],"domain_scores_gemma":[0.9964729,0.0018762107,0.00063344947,0.0002834126,0.00026429657,0.0004696612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009406974,0.0006574296,0.0012122905,0.0038448279,0.0015934835,0.0030520994,0.00161183,0.0010419656,0.0039900625],"category_scores_gemma":[0.005441592,0.00070043444,0.0006268707,0.0027810852,0.0018533998,0.0042091073,0.0019209345,0.0012277231,0.0005780421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029941511,0.000039142087,0.001689543,0.00015720435,0.000042678264,0.00017864167,0.00056825427,0.011985957,0.0088205775,0.96274346,0.0015258793,0.011949212],"study_design_scores_gemma":[0.000031063446,0.00003821394,0.0011448396,0.000038986007,0.00003818851,0.0001958582,0.00014747497,0.034079075,0.0035059412,0.9589173,0.0018291614,0.000033922643],"about_ca_topic_score_codex":0.0006700375,"about_ca_topic_score_gemma":0.0012429162,"teacher_disagreement_score":0.0039900625,"about_ca_system_score_codex":0.0015156247,"about_ca_system_score_gemma":0.0005074537,"threshold_uncertainty_score":0.013348043},"labels":[],"label_agreement":null},{"id":"W2240982577","doi":"10.1002/jgt.22063","title":"On Lower Bounds for the Matching Number of Subcubic Graphs","year":2016,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Graph theory and applications","field":"Mathematics","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Matching (statistics); Graph; Upper and lower bounds; Constant (computer programming); Discrete mathematics; Computer science","score_opus":0.03198053856046755,"score_gpt":0.3363031753190469,"score_spread":0.30432263675857935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2240982577","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5120608,0.009694366,0.358491,0.0038541486,0.00052914175,0.00023459448,0.0022415784,0.0013466361,0.111547716],"genre_scores_gemma":[0.9222323,0.002233484,0.063136615,0.0007111789,0.00046009038,0.0003618185,0.001442538,0.0004954499,0.008926611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970515,0.0005701383,0.00015142067,0.0008040538,0.0009257383,0.00049712294],"domain_scores_gemma":[0.9893332,0.00717226,0.0009662268,0.0010753708,0.00067521265,0.00077767065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028019315,0.0015636032,0.0020904746,0.0041332673,0.0017591362,0.0042379834,0.0032789926,0.0017842072,0.00970491],"category_scores_gemma":[0.015366547,0.0006335435,0.0011233744,0.0032606435,0.0022149065,0.0063837636,0.0029828036,0.0034400763,0.001716069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011422853,0.00020216465,0.0031953433,0.000776501,0.00014869585,0.0003868724,0.00048038346,0.030859489,0.017614277,0.88972354,0.009287072,0.046183255],"study_design_scores_gemma":[0.000040190233,0.00008789622,0.0012879237,0.00012345768,0.000069323396,0.0004671591,0.00012642096,0.113050476,0.0066863457,0.86734545,0.010666464,0.00004897959],"about_ca_topic_score_codex":0.00054106954,"about_ca_topic_score_gemma":0.00039143735,"teacher_disagreement_score":0.00970491,"about_ca_system_score_codex":0.0022491363,"about_ca_system_score_gemma":0.0006516348,"threshold_uncertainty_score":0.032466173},"labels":[],"label_agreement":null},{"id":"W2243117353","doi":"","title":"Bounds on differences between some graph theoretic invariants","year":2015,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Bounding overwatch; Chromatic scale; Graph; Mathematics; Combinatorics; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.04183734379273993,"score_gpt":0.2778317885821681,"score_spread":0.2359944447894282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2243117353","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5819668,0.0038393198,0.36478102,0.0017299872,0.00031791386,0.00009542373,0.0009456906,0.000842279,0.045481592],"genre_scores_gemma":[0.9666023,0.0006441099,0.02909309,0.0002073615,0.00028834355,0.000098235214,0.0005022843,0.00023713743,0.002327153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954462,0.0010717107,0.00018006763,0.0012969222,0.0014227463,0.00058252126],"domain_scores_gemma":[0.9402461,0.04602897,0.0058737304,0.0033762434,0.0021713672,0.002303539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042216615,0.0012684303,0.0011930418,0.005889566,0.0009241985,0.0021967127,0.0031307512,0.0013569581,0.004029604],"category_scores_gemma":[0.036046386,0.0005013401,0.0008078164,0.0029291695,0.0043111923,0.008102651,0.0031422728,0.0043439777,0.00053860876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013464697,0.0003049762,0.020294026,0.0006461825,0.00019365242,0.0005515871,0.0007199481,0.12490109,0.0178009,0.75938594,0.0029279068,0.070927285],"study_design_scores_gemma":[0.000030422207,0.00048058276,0.012567828,0.0001355148,0.00009265433,0.00060199655,0.00022768251,0.25810185,0.008936001,0.7135479,0.0051758215,0.000101813675],"about_ca_topic_score_codex":0.0003122664,"about_ca_topic_score_gemma":0.00030352213,"teacher_disagreement_score":0.005889566,"about_ca_system_score_codex":0.0026787298,"about_ca_system_score_gemma":0.00048077866,"threshold_uncertainty_score":0.022326529},"labels":[],"label_agreement":null},{"id":"W2248242758","doi":"10.1007/s00373-016-1749-0","title":"A Refinement of Theorems on Vertex-Disjoint Chorded Cycles","year":2016,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Graph theory and applications","field":"Mathematics","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":"University of British Columbia","funders":"National Science Foundation","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Disjoint sets; Discrete mathematics; Graph","score_opus":0.032110673911330226,"score_gpt":0.28072310640791387,"score_spread":0.24861243249658366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2248242758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04920254,0.0037397027,0.7679801,0.005697066,0.0038184475,0.00027515914,0.0013381762,0.0011830308,0.16676576],"genre_scores_gemma":[0.5617711,0.007571107,0.3398171,0.007051434,0.005973994,0.0006310272,0.002913,0.0020231567,0.07224818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948256,0.0014253376,0.00032341928,0.0016318565,0.0013355234,0.00045838865],"domain_scores_gemma":[0.9777728,0.01336908,0.0007629286,0.0042443573,0.0029059255,0.00094493764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004409565,0.0020908944,0.002587183,0.0055738064,0.0038548508,0.004412488,0.0052237744,0.0024411087,0.015897416],"category_scores_gemma":[0.029272992,0.0012751245,0.0046108873,0.00555212,0.0062511507,0.016498307,0.00926694,0.010255056,0.0032522406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008535845,0.000045552864,0.0004406947,0.00025912147,0.00004513251,0.00016056492,0.00043839464,0.0022490276,0.0013537378,0.9681805,0.0075774183,0.019164493],"study_design_scores_gemma":[0.000029342085,0.00003284707,0.00027129476,0.000056301433,0.00005438764,0.00014853978,0.000117203024,0.006542854,0.0008653271,0.97275907,0.019099977,0.000022964017],"about_ca_topic_score_codex":0.0055165756,"about_ca_topic_score_gemma":0.003669696,"teacher_disagreement_score":0.015897416,"about_ca_system_score_codex":0.0030445606,"about_ca_system_score_gemma":0.0016082964,"threshold_uncertainty_score":0.053182185},"labels":[],"label_agreement":null},{"id":"W2274512402","doi":"","title":"A Note on Eigenvalues of the Derangement Graph","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Derangement; Mathematics; Eigenvalues and eigenvectors; Combinatorics; Graph; Pure mathematics; Physics; Quantum mechanics","score_opus":0.0482777693190106,"score_gpt":0.2858767769068373,"score_spread":0.23759900758782673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274512402","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20536175,0.009796343,0.3025976,0.014537286,0.011109566,0.000077932884,0.00046454417,0.0011381919,0.45491683],"genre_scores_gemma":[0.83816963,0.007094847,0.060064852,0.0022539739,0.0051356764,0.00010123636,0.00019841675,0.0006740179,0.086307295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960655,0.000113195405,0.00001750312,0.00007891581,0.00014074639,0.000043115382],"domain_scores_gemma":[0.99898964,0.00056485075,0.000082350045,0.00015814413,0.000095990734,0.000108952394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051066396,0.000770396,0.0007361615,0.001712701,0.0014086873,0.00208816,0.0010233407,0.0012855387,0.008101462],"category_scores_gemma":[0.0022118336,0.0003382265,0.00060701714,0.0011445176,0.0021956416,0.0027674183,0.0013284936,0.0025591175,0.0014349888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001864411,0.000011133172,0.00008718702,0.000044075277,0.000005770715,0.00014709479,0.00017638283,0.0016474708,0.0016985664,0.9834221,0.004518974,0.008222599],"study_design_scores_gemma":[0.0000034943348,0.00000896768,0.000119102566,0.000010850975,0.0000032794164,0.00008417341,0.00006247832,0.0040096254,0.00035059094,0.98721343,0.008120115,0.000014043063],"about_ca_topic_score_codex":0.0008030598,"about_ca_topic_score_gemma":0.00094413763,"teacher_disagreement_score":0.008101462,"about_ca_system_score_codex":0.00065025606,"about_ca_system_score_gemma":0.00028616108,"threshold_uncertainty_score":0.027102113},"labels":[],"label_agreement":null},{"id":"W2279781878","doi":"","title":"The Laplacian spectral radius of graphs with given matching number","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Matching (statistics); Combinatorics; Laplace operator; RADIUS; Mathematical analysis; Statistics; Computer science; Eigenvalues and eigenvectors; Physics; Computer network","score_opus":0.009841915676796955,"score_gpt":0.2601583011360572,"score_spread":0.25031638545926027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2279781878","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88132143,0.0008315516,0.07924849,0.0017937482,0.00010390931,0.0000323826,0.0005172238,0.00059321406,0.035557978],"genre_scores_gemma":[0.9878754,0.0003470327,0.0074693183,0.00012473296,0.00012595174,0.000037868096,0.00020657059,0.00011494227,0.0036981679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994591,0.00018453403,0.00002189498,0.0001328216,0.00011224495,0.000089393936],"domain_scores_gemma":[0.9955966,0.0025730843,0.00060142955,0.0002751332,0.00031980846,0.0006340233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008697258,0.00058854424,0.00076257833,0.003029724,0.001064418,0.0025684482,0.0014780669,0.00141539,0.004982551],"category_scores_gemma":[0.008102566,0.0004322776,0.00030874988,0.0014601739,0.0017992149,0.0030266189,0.0013007815,0.0007308111,0.0008075398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053973135,0.00012622423,0.003856924,0.00023661584,0.000059271926,0.0002814364,0.0006623448,0.048367377,0.017829293,0.90114003,0.007234664,0.019666025],"study_design_scores_gemma":[0.000052313542,0.00005595194,0.0028324712,0.00004372728,0.000044754037,0.00041186344,0.00045353698,0.25149763,0.004918524,0.7367782,0.0028586057,0.000052455372],"about_ca_topic_score_codex":0.00085865846,"about_ca_topic_score_gemma":0.0007319326,"teacher_disagreement_score":0.004982551,"about_ca_system_score_codex":0.0012297613,"about_ca_system_score_gemma":0.00040591322,"threshold_uncertainty_score":0.01666832},"labels":[],"label_agreement":null},{"id":"W2279987266","doi":"10.1016/j.dam.2016.04.031","title":"Proximity, remoteness and distance eigenvalues of a graph","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Spectral radius; Distance matrix; Mathematics; Combinatorics; Eigenvalues and eigenvectors; Vertex (graph theory); Graph; Connectivity; Resistance distance; Upper and lower bounds; Discrete mathematics; Graph power; Line graph; Mathematical analysis; Physics","score_opus":0.028530359253895236,"score_gpt":0.2831999804923835,"score_spread":0.25466962123848824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2279987266","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82606816,0.0005063884,0.1582005,0.00089229044,0.000078189216,0.000038822553,0.0001937741,0.00013493403,0.013886963],"genre_scores_gemma":[0.98199815,0.00021388325,0.014351926,0.000067694076,0.00013343572,0.000050352617,0.0001032047,0.000027177219,0.0030541238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902356,0.00029544244,0.000040681156,0.00027548822,0.0002902754,0.00007455372],"domain_scores_gemma":[0.99316734,0.0045782295,0.0009190131,0.0003497249,0.00035169016,0.0006341233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091170636,0.0004247884,0.00073528057,0.002947177,0.0012607313,0.002128563,0.00095929665,0.0011363042,0.003713029],"category_scores_gemma":[0.0077274353,0.00031522466,0.00035810278,0.0012551042,0.0028001706,0.0034314364,0.0019011943,0.0013029731,0.0003867001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033861047,0.00016597478,0.0038638094,0.00016661453,0.00005708932,0.00047102215,0.0015263876,0.02728816,0.012568369,0.93096507,0.0013041601,0.021284744],"study_design_scores_gemma":[0.00003378816,0.000097891134,0.0027945908,0.0000178764,0.000021897778,0.0004630853,0.0004604514,0.079179086,0.0010791121,0.9143065,0.0015099334,0.000035747875],"about_ca_topic_score_codex":0.00046361206,"about_ca_topic_score_gemma":0.0003795544,"teacher_disagreement_score":0.003713029,"about_ca_system_score_codex":0.0005177591,"about_ca_system_score_gemma":0.00028204618,"threshold_uncertainty_score":0.01242137},"labels":[],"label_agreement":null},{"id":"W2285909053","doi":"10.1016/j.laa.2018.12.004","title":"Interlacing families and the Hermitian spectral norm of digraphs","year":2018,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; National Research Foundation of Korea; Natural Sciences and Engineering Research Council of Canada; Univerza v Ljubljani; Japan Society for the Promotion of Science; Canada Research Chairs; Ministry of Education - Singapore","keywords":"Interlacing; Mathematics; Hermitian matrix; Ramanujan's sum; Spectral radius; Combinatorics; Adjacency matrix; Matrix norm; Norm (philosophy); Graph; Discrete mathematics; Pure mathematics; Eigenvalues and eigenvectors","score_opus":0.016673295828995138,"score_gpt":0.2808475565833797,"score_spread":0.26417426075438455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2285909053","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5510587,0.0015131965,0.38377863,0.0018278634,0.00046135345,0.000049820945,0.00045587856,0.00028071617,0.06057382],"genre_scores_gemma":[0.9485888,0.000989665,0.030515118,0.00042272464,0.00045107485,0.00010417453,0.00030536533,0.00013485711,0.018488266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989484,0.0003637498,0.00006553274,0.0002405777,0.00023664109,0.00014524523],"domain_scores_gemma":[0.9947403,0.0022610815,0.00083162135,0.0003673646,0.0008636441,0.00093599927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001443136,0.0005999697,0.0007197922,0.0029764783,0.0021219573,0.002579239,0.0011652252,0.00109633,0.005404188],"category_scores_gemma":[0.0047446145,0.0005038763,0.0005502213,0.0017264467,0.0034967412,0.0052102576,0.0018773021,0.0016585712,0.0005741097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001569124,0.000012975612,0.0001286448,0.000014731141,0.000004404746,0.000028246197,0.00018555527,0.0006174935,0.0003973253,0.99528533,0.00039333987,0.0029163044],"study_design_scores_gemma":[0.000005190724,0.000008873446,0.00009797513,0.0000068676723,0.0000025077445,0.00004057238,0.00008660312,0.003509451,0.00017059568,0.99486816,0.0011952092,0.000007960587],"about_ca_topic_score_codex":0.0008658977,"about_ca_topic_score_gemma":0.000883085,"teacher_disagreement_score":0.005404188,"about_ca_system_score_codex":0.0011197318,"about_ca_system_score_gemma":0.0006018833,"threshold_uncertainty_score":0.018078744},"labels":[],"label_agreement":null},{"id":"W2286603664","doi":"","title":"Two Laplacians for the Distance Matrix of a Graph","year":2011,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Algebraic connectivity; Resistance distance; Laplacian matrix; Distance matrix; Mathematics; Combinatorics; Laplace operator; Connectivity; Eigenvalues and eigenvectors; Discrete mathematics; Distance matrices in phylogeny; Graph; Line graph; Physics; Mathematical analysis; Graph power","score_opus":0.029908141759601454,"score_gpt":0.2775805357248767,"score_spread":0.2476723939652752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2286603664","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.111572266,0.0017878329,0.8026971,0.0034203392,0.0013467032,0.00010913941,0.000554226,0.00033754832,0.078174874],"genre_scores_gemma":[0.7906772,0.0016675515,0.167683,0.001308385,0.0009648609,0.0002638784,0.00046070744,0.00023825768,0.03673619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992385,0.00019566133,0.000038562073,0.00017214536,0.00028793776,0.000067273664],"domain_scores_gemma":[0.9987645,0.00041936434,0.00015407504,0.00013580253,0.00037831042,0.00014803493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006159049,0.0004666523,0.00030969564,0.0014343534,0.00058948627,0.0015157654,0.00061248016,0.001004235,0.00955725],"category_scores_gemma":[0.0031002495,0.00013180372,0.00048768814,0.0007046561,0.0016817942,0.002228553,0.0010667411,0.0013267897,0.0012818793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018059025,0.000016541167,0.00015849617,0.000038324117,0.0000057911775,0.00010175505,0.00018481069,0.0022909434,0.004449769,0.9798007,0.0021638316,0.010770989],"study_design_scores_gemma":[0.000011648371,0.000045171106,0.00059128855,0.000024874562,0.0000067699525,0.0005583174,0.00016758854,0.03654387,0.0013550015,0.94549674,0.015163918,0.000034832134],"about_ca_topic_score_codex":0.0004389696,"about_ca_topic_score_gemma":0.0003520692,"teacher_disagreement_score":0.00955725,"about_ca_system_score_codex":0.0005869164,"about_ca_system_score_gemma":0.00037326184,"threshold_uncertainty_score":0.03197217},"labels":[],"label_agreement":null},{"id":"W2287453773","doi":"10.1007/s00373-017-1768-5","title":"Burning Graphs: A Probabilistic Perspective","year":2017,"lang":"en","type":"preprint","venue":"Graphs and Combinatorics","topic":"Graph theory and applications","field":"Mathematics","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":"Dalhousie University; Toronto Metropolitan University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Cartesian product; Probabilistic logic; Random graph; Combinatorics; Binomial (polynomial); Graph; Mathematics; Perspective (graphical); Discrete mathematics; Random regular graph; Sequence (biology); Computer science; Chordal graph; 1-planar graph; Statistics; Geometry","score_opus":0.0512860620082349,"score_gpt":0.3244218014708142,"score_spread":0.2731357394625793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2287453773","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030084534,0.01318306,0.86527985,0.020114107,0.0008314964,0.00006739151,0.0006896529,0.00024939087,0.06950056],"genre_scores_gemma":[0.7586446,0.018048903,0.16825512,0.0058369422,0.006882483,0.00028887892,0.00096655794,0.000769587,0.040306967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957123,0.0019020578,0.0001817517,0.00087011076,0.0010829809,0.00025078052],"domain_scores_gemma":[0.9851505,0.010317964,0.001101003,0.0018059531,0.00096473406,0.0006598271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005088549,0.0014679786,0.0019931383,0.0049720914,0.0025936672,0.0088420715,0.0046841516,0.006452399,0.0110652605],"category_scores_gemma":[0.018784866,0.0016338627,0.001645676,0.0044619404,0.01183766,0.02402645,0.0047572223,0.00749863,0.0012813323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005527589,0.0000062375943,0.00008881246,0.000031133233,0.0000056395625,0.000013603438,0.000036812777,0.0016230505,0.000066068904,0.9956767,0.00058513467,0.001861188],"study_design_scores_gemma":[0.0000020880088,0.0000020528967,0.000029207262,0.000012344568,0.0000031453544,0.000029344992,0.000016457438,0.004063029,0.00003548026,0.9944208,0.0013818059,0.0000041732847],"about_ca_topic_score_codex":0.0011977485,"about_ca_topic_score_gemma":0.0010725902,"teacher_disagreement_score":0.0110652605,"about_ca_system_score_codex":0.0026237099,"about_ca_system_score_gemma":0.0010723977,"threshold_uncertainty_score":0.037017047},"labels":[],"label_agreement":null},{"id":"W2294555104","doi":"10.1016/j.ejc.2016.02.004","title":"Spectral radius and fractional matchings in graphs","year":2016,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":34,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Spectral radius; Vertex (graph theory); Graph; Matching (statistics); Integer (computer science); Eigenvalues and eigenvectors; Upper and lower bounds; Discrete mathematics; Mathematical analysis; Physics","score_opus":0.021374349242671245,"score_gpt":0.26041471782898346,"score_spread":0.23904036858631222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294555104","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76419824,0.004436542,0.1594469,0.0035622155,0.00026216515,0.00006665517,0.00043280402,0.0006063686,0.0669881],"genre_scores_gemma":[0.9803304,0.0009737857,0.011974972,0.00022029511,0.00029817497,0.000052949847,0.00018768753,0.00010247079,0.0058592902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843305,0.0005992906,0.000077622884,0.0003305818,0.00030545893,0.00025406847],"domain_scores_gemma":[0.99304223,0.0041398993,0.0012248694,0.00040959488,0.00039290372,0.0007905455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015840085,0.00077379,0.0017068994,0.005338815,0.0024124747,0.004530124,0.002226122,0.002569879,0.008597947],"category_scores_gemma":[0.012347597,0.00084809976,0.00070775195,0.0031780954,0.0044398354,0.00701911,0.0029558884,0.0017223532,0.0011110323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013028832,0.00002903803,0.0005509063,0.00007648758,0.000012562662,0.000063430154,0.00037764641,0.0038518056,0.001141199,0.98658586,0.0011578886,0.0060229655],"study_design_scores_gemma":[0.000022812957,0.000016907925,0.0004030947,0.000030185272,0.000020597136,0.00018800741,0.0002327472,0.01982175,0.00060283503,0.9766758,0.0019693465,0.00001589627],"about_ca_topic_score_codex":0.0012342352,"about_ca_topic_score_gemma":0.00082065706,"teacher_disagreement_score":0.008597947,"about_ca_system_score_codex":0.0018768606,"about_ca_system_score_gemma":0.0004705431,"threshold_uncertainty_score":0.028762996},"labels":[],"label_agreement":null},{"id":"W2300426713","doi":"10.1139/cjc-2015-0551","title":"Variants of the Szeged index in certain chemical nanosheets","year":2016,"lang":"en","type":"article","venue":"Canadian Journal of Chemistry","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Nanosheet; Molecular graph; Vertex (graph theory); Wiener index; Topological index; Molecule; Chemistry; Graph; Index (typography); Combinatorics; Mathematics; Computational chemistry; Organic chemistry; Computer science","score_opus":0.015100080510430628,"score_gpt":0.23471243630477415,"score_spread":0.21961235579434352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2300426713","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7064561,0.0010124472,0.24357635,0.00034020553,0.00022679752,0.000072742165,0.000581724,0.00026715852,0.047466364],"genre_scores_gemma":[0.9638919,0.00042156887,0.030899404,0.00005189907,0.000064028456,0.000050063685,0.00026495563,0.00008682512,0.004269311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99981004,0.000033788583,0.000015559826,0.00003092432,0.00007438223,0.000035264246],"domain_scores_gemma":[0.9995677,0.00016742846,0.00007169986,0.000060347294,0.00007404299,0.000058826692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005050532,0.00033386424,0.0002949287,0.0021129206,0.00046509178,0.0012186059,0.00054967013,0.00039107408,0.0027299125],"category_scores_gemma":[0.0015576124,0.00014605686,0.00044262482,0.0010930992,0.0013750107,0.0022704925,0.0006833119,0.0006818326,0.0002998807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050406536,0.000016948443,0.0009452321,0.000046537225,0.00001395197,0.00013518942,0.00008373379,0.030837491,0.004549515,0.9554851,0.0006050564,0.007230816],"study_design_scores_gemma":[0.000017366661,0.00004571484,0.0019056,0.000020573601,0.000013884162,0.00018109044,0.00011435879,0.19980219,0.0063588764,0.78776187,0.003740218,0.000038321254],"about_ca_topic_score_codex":0.0006494806,"about_ca_topic_score_gemma":0.00071226916,"teacher_disagreement_score":0.0027299125,"about_ca_system_score_codex":0.00060090167,"about_ca_system_score_gemma":0.00029502405,"threshold_uncertainty_score":0.009132504},"labels":[],"label_agreement":null},{"id":"W2303499397","doi":"","title":"On the Extremal Values of the Second Largest Q–Eigenvalue","year":2010,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Graph theory and applications","field":"Mathematics","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Eigenvalues and eigenvectors; Mathematics; Combinatorics; Graph; Simple (philosophy); Simple graph; Discrete mathematics; Laplace operator; Mathematical analysis; Physics","score_opus":0.016713533978247888,"score_gpt":0.24418107915876008,"score_spread":0.2274675451805122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2303499397","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.878336,0.0007557646,0.08216694,0.001507267,0.000057665326,0.000026104728,0.00014597324,0.00016075827,0.03684341],"genre_scores_gemma":[0.99163824,0.00026100632,0.005977224,0.0000964824,0.000050652598,0.00003526153,0.000057789905,0.00004899554,0.0018344143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996499,0.00012875306,0.000008299706,0.00007247569,0.000063251086,0.000077310324],"domain_scores_gemma":[0.9968053,0.0020215502,0.00048408107,0.00013865544,0.00024129552,0.00030906318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083925395,0.0006623369,0.00052682747,0.0022614712,0.0013391777,0.0012693736,0.0007481966,0.0009398906,0.004533856],"category_scores_gemma":[0.0046576494,0.00038074184,0.0004199208,0.0009262746,0.0023740432,0.0017788368,0.00082877226,0.00093250495,0.00031735597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012172167,0.000062141364,0.0027938946,0.00014095446,0.000037687838,0.0004241055,0.00034565397,0.024531795,0.011072584,0.9506166,0.0027294224,0.007123551],"study_design_scores_gemma":[0.00003233377,0.000055548182,0.0038016762,0.00005854917,0.00002282691,0.0004485597,0.00036991868,0.09942509,0.0028315748,0.891069,0.0018397366,0.00004522138],"about_ca_topic_score_codex":0.0004474969,"about_ca_topic_score_gemma":0.000502956,"teacher_disagreement_score":0.004533856,"about_ca_system_score_codex":0.0008411999,"about_ca_system_score_gemma":0.00027472407,"threshold_uncertainty_score":0.015167236},"labels":[],"label_agreement":null},{"id":"W2310089532","doi":"","title":"Open Problems on Graph Eigenvalues Studied with AutoGraphiX","year":2012,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Adjacency matrix; Graph energy; Mathematics; Combinatorics; Spectral graph theory; Eigenvalues and eigenvectors; Mathematical proof; Graph theory; Discrete mathematics; Line graph; Strength of a graph; Graph; Voltage graph","score_opus":0.054811962674564285,"score_gpt":0.30161053066050675,"score_spread":0.24679856798594246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2310089532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35843197,0.0059373653,0.56714857,0.0067212526,0.00035477706,0.00009525235,0.0003013374,0.0005663642,0.060443144],"genre_scores_gemma":[0.8966864,0.0036173125,0.08544143,0.00066520215,0.0010125426,0.00021653512,0.00033329724,0.0003674375,0.011659842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983333,0.00070058234,0.000046391433,0.0003382397,0.00042309772,0.0001584214],"domain_scores_gemma":[0.9848053,0.012573304,0.000836166,0.00077576056,0.00062406296,0.00038539583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026326342,0.0009261046,0.001323289,0.0029658787,0.0016410914,0.0022818637,0.0015695199,0.0017908921,0.0066107446],"category_scores_gemma":[0.016481472,0.00069507246,0.0012162513,0.0020742281,0.004958484,0.0060293227,0.002675574,0.0036114857,0.0007399268],"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.000059201437,0.0000641885,0.0008720595,0.00014760885,0.000027191021,0.00010754411,0.0004268072,0.022315368,0.0009394314,0.95980144,0.002348367,0.012890756],"study_design_scores_gemma":[0.000019789137,0.00002626159,0.00033897045,0.00003460459,0.000009054357,0.00008263406,0.00014023697,0.08832089,0.0006584748,0.90797514,0.0023770088,0.000016890152],"about_ca_topic_score_codex":0.0011227197,"about_ca_topic_score_gemma":0.00049942575,"teacher_disagreement_score":0.0066107446,"about_ca_system_score_codex":0.0014603783,"about_ca_system_score_gemma":0.00073684345,"threshold_uncertainty_score":0.022115171},"labels":[],"label_agreement":null},{"id":"W2315309157","doi":"10.1139/cjc-2016-0032","title":"On molecular topological properties of benzenoid structures","year":2016,"lang":"en","type":"article","venue":"Canadian Journal of Chemistry","topic":"Graph theory and applications","field":"Mathematics","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Higher Education Commision, Pakistan","keywords":"Topological index; Parallelogram; Zigzag; Combinatorics; Subdivision; Molecular graph; Boiling point; Hexagonal crystal system; Degree (music); Topology (electrical circuits); Chemistry; Mathematics; Graph; Physics; Geometry; Crystallography","score_opus":0.024749733614944616,"score_gpt":0.23975238659415432,"score_spread":0.2150026529792097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2315309157","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9732416,0.00024650674,0.01476927,0.000047664347,0.000013167673,0.000013218793,0.00029761257,0.000094040835,0.011277031],"genre_scores_gemma":[0.99488837,0.00014148386,0.0040935026,0.0000071928284,0.000008991619,0.000010797261,0.00029899477,0.000016437376,0.0005343228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99992883,0.000011343644,0.0000037866657,0.000010455159,0.000028404951,0.000017137883],"domain_scores_gemma":[0.9996797,0.00011412235,0.000087381064,0.00003286504,0.00005775987,0.000028191822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012818066,0.00020413111,0.00014882981,0.0022915548,0.00023666077,0.0004951499,0.00020389864,0.00017611445,0.002289981],"category_scores_gemma":[0.0007466136,0.00007403288,0.0001620265,0.0011315467,0.0004434029,0.0007332482,0.0002646695,0.00017853276,0.0002151842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040652728,0.00011627913,0.028433159,0.00039120714,0.000051233594,0.0005041994,0.0005257429,0.25657552,0.09086043,0.51289433,0.002106664,0.107134745],"study_design_scores_gemma":[0.000032474512,0.00031708254,0.041508075,0.00006536894,0.000047094793,0.0006009275,0.00045823905,0.75262094,0.03430011,0.1620695,0.007882823,0.0000973724],"about_ca_topic_score_codex":0.0007504013,"about_ca_topic_score_gemma":0.00094641215,"teacher_disagreement_score":0.0022915548,"about_ca_system_score_codex":0.0003094675,"about_ca_system_score_gemma":0.0001568308,"threshold_uncertainty_score":0.0076607466},"labels":[],"label_agreement":null},{"id":"W2324654759","doi":"10.4153/cjm-2002-029-7","title":"Strongly Projective Graphs","year":2002,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"Champlain Regional College; Concordia University","funders":"","keywords":"Mathematics; Combinatorics; Homomorphism; Discrete mathematics; Graph; Symmetric graph; Projective test; Graph homomorphism; Comparability graph; Line graph; Pathwidth; Voltage graph; Pure mathematics","score_opus":0.06421055094626305,"score_gpt":0.2722978929191789,"score_spread":0.20808734197291584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2324654759","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56325716,0.0004827695,0.26387408,0.0012491143,0.00016813472,0.00017392445,0.0012546252,0.00069951155,0.16884066],"genre_scores_gemma":[0.9728325,0.00019578778,0.011467659,0.00013034084,0.00006669537,0.00007227842,0.0004845697,0.00005341225,0.014696722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993981,0.00015222265,0.00002463365,0.00018413918,0.00012553227,0.00011534725],"domain_scores_gemma":[0.9986829,0.00039071456,0.00018344812,0.0002106047,0.0002993582,0.00023282245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040604535,0.0003822394,0.00027662222,0.0006649062,0.00084922864,0.0014005583,0.0005451506,0.00041804538,0.0107335625],"category_scores_gemma":[0.0015499515,0.00024849246,0.00035311677,0.0005370997,0.0019940443,0.003332129,0.0019606703,0.0009165713,0.00070565206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041369996,0.000018740335,0.0012582327,0.000047056616,0.000009617001,0.00029651404,0.00032236645,0.0019700644,0.0030889239,0.9835618,0.0014606337,0.007924608],"study_design_scores_gemma":[0.00002097961,0.000071594724,0.0020303058,0.000020479201,0.000017454404,0.0007033005,0.0004303417,0.010732003,0.003365052,0.9577859,0.024803786,0.00001871149],"about_ca_topic_score_codex":0.00069662853,"about_ca_topic_score_gemma":0.0007510268,"teacher_disagreement_score":0.0107335625,"about_ca_system_score_codex":0.0005358316,"about_ca_system_score_gemma":0.00024489735,"threshold_uncertainty_score":0.035907388},"labels":[],"label_agreement":null},{"id":"W2331878294","doi":"10.1166/jctn.2008.037","title":"Relationship Between PI and Szeged Indices of a Triangulane and Its Associated Dendrimer","year":2008,"lang":"en","type":"article","venue":"Journal of Computational and Theoretical Nanoscience","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"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","keywords":"Dendrimer; Mathematics; Polymer science; Chemistry; Polymer chemistry","score_opus":0.059732975494610076,"score_gpt":0.31717470815917226,"score_spread":0.25744173266456216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2331878294","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9626627,0.00018861647,0.021887194,0.00022335556,0.000074227784,0.000025301933,0.00019860388,0.00012282487,0.014617169],"genre_scores_gemma":[0.99420375,0.000085477885,0.0033028082,0.000019706653,0.00002347893,0.000026167796,0.00009762095,0.000034922068,0.002206103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99986625,0.000027591406,0.000009456575,0.000029556546,0.000036585494,0.000030611143],"domain_scores_gemma":[0.9977241,0.0009109204,0.000470837,0.0001437682,0.0003233637,0.00042690092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005086428,0.0002889517,0.00037844392,0.0028604132,0.0012252709,0.0018009456,0.00076453056,0.0006396683,0.0071483473],"category_scores_gemma":[0.0027098157,0.00022631977,0.0001417498,0.0010509433,0.0013859147,0.0018125181,0.0006658695,0.0009078831,0.0006305986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000353148,0.00013086767,0.008693681,0.0000917924,0.000023124312,0.00031365422,0.00049561565,0.011177944,0.019733166,0.9402183,0.0020104724,0.016758261],"study_design_scores_gemma":[0.000055599263,0.00023618186,0.010698066,0.00005003392,0.00005349734,0.000709455,0.0009318231,0.21628208,0.022147864,0.7450585,0.0036511659,0.00012581046],"about_ca_topic_score_codex":0.00039162455,"about_ca_topic_score_gemma":0.0006458077,"teacher_disagreement_score":0.0071483473,"about_ca_system_score_codex":0.00053893815,"about_ca_system_score_gemma":0.00043059463,"threshold_uncertainty_score":0.023913622},"labels":[],"label_agreement":null},{"id":"W2377198836","doi":"","title":"Wiener index and subtrees of extended two stars trees","year":2007,"lang":"en","type":"article","venue":"Journal of Dalian Maritime University","topic":"Graph theory and applications","field":"Mathematics","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":"Wiener index; Index (typography); Combinatorics; Tree (set theory); Mathematics; Stars; Topological index; Enhanced Data Rates for GSM Evolution; Physics; Computer science; Astrophysics; Artificial intelligence","score_opus":0.01599451012699983,"score_gpt":0.2625785381644155,"score_spread":0.2465840280374157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2377198836","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79551923,0.00063029,0.17767122,0.0002295746,0.000066422224,0.000032134703,0.00025712975,0.000111692745,0.025482254],"genre_scores_gemma":[0.9377939,0.0004712882,0.052010197,0.000058082685,0.000068320354,0.000042713316,0.00034811447,0.00008148035,0.009125901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965656,0.00006029927,0.000032653898,0.00007685037,0.000098906676,0.0000747714],"domain_scores_gemma":[0.99901056,0.00034271867,0.00019896381,0.00011608434,0.0001343795,0.00019727561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037099866,0.00025486058,0.00045620068,0.0013783487,0.00081121555,0.0011369019,0.00044243372,0.0003441579,0.0033207387],"category_scores_gemma":[0.0018722079,0.00020464792,0.00048198015,0.0011234548,0.0008060087,0.0023694378,0.0010160693,0.0006799443,0.0003991041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025708295,0.00004142138,0.0040698764,0.00014231318,0.00004316279,0.000407914,0.0005995707,0.019425467,0.040001985,0.8834507,0.0012965556,0.050264005],"study_design_scores_gemma":[0.000029031184,0.00014651848,0.006370129,0.000038460577,0.00004276857,0.00071278575,0.00031344677,0.0975252,0.010288419,0.87558895,0.008904191,0.000040147825],"about_ca_topic_score_codex":0.0004801338,"about_ca_topic_score_gemma":0.00079761486,"teacher_disagreement_score":0.0033207387,"about_ca_system_score_codex":0.0006572774,"about_ca_system_score_gemma":0.00029643663,"threshold_uncertainty_score":0.011108935},"labels":[],"label_agreement":null},{"id":"W2394743037","doi":"","title":"Schultz and Zagreb indices in corona of two graphs","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Corona (planetary geology); Combinatorics; Physics; Astrobiology","score_opus":0.019386026211507246,"score_gpt":0.28585721840116823,"score_spread":0.266471192189661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394743037","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84644604,0.0009731682,0.03549755,0.0015030049,0.0003406762,0.00006373017,0.00040956849,0.0002107076,0.11455552],"genre_scores_gemma":[0.97461843,0.00044695233,0.0108142,0.00024695485,0.00022551509,0.000065687236,0.00034256832,0.00010312945,0.013136516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993388,0.0001616077,0.00003883515,0.00015269603,0.00012418814,0.00018384629],"domain_scores_gemma":[0.9985543,0.00048070378,0.00029661274,0.0001336287,0.0001997309,0.00033493384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009058106,0.00064865476,0.0013854766,0.0033748255,0.0029809307,0.005039187,0.0013123875,0.0016265088,0.0075980304],"category_scores_gemma":[0.0033309022,0.0005571375,0.0009173904,0.0022355365,0.0033883417,0.0051726927,0.0023495227,0.0020654977,0.00081860216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045480887,0.000015992524,0.00059557974,0.00002381734,0.0000073247743,0.00007966964,0.0004140908,0.0003374997,0.00050628383,0.995191,0.0006046929,0.0021785945],"study_design_scores_gemma":[0.00002374514,0.0000141200635,0.000863869,0.000023100427,0.00002405723,0.00013591902,0.00028801095,0.0026292286,0.00029112847,0.992159,0.0035338595,0.000014031589],"about_ca_topic_score_codex":0.002638958,"about_ca_topic_score_gemma":0.0028291526,"teacher_disagreement_score":0.0075980304,"about_ca_system_score_codex":0.002223611,"about_ca_system_score_gemma":0.00082210434,"threshold_uncertainty_score":0.025417984},"labels":[],"label_agreement":null},{"id":"W2394758262","doi":"","title":"Extremal Wiener-Hosoya Index Of Acyclic Graphs With Short Diameter.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Combinatorics; Index (typography); Statistics; Graph; Computer science","score_opus":0.021298899970551743,"score_gpt":0.2618156374354236,"score_spread":0.24051673746487184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394758262","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8123218,0.0030461657,0.07808357,0.0012087823,0.0003287571,0.00003208763,0.0009851132,0.0003668948,0.103626885],"genre_scores_gemma":[0.9839215,0.00070446124,0.007703776,0.00011054415,0.00023279502,0.000033459608,0.0003076768,0.00008032323,0.0069053834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965227,0.000076633194,0.000017946035,0.00007233301,0.000087576795,0.000093211325],"domain_scores_gemma":[0.9975827,0.0011671372,0.0003887353,0.00018473344,0.00020764217,0.00046901137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062148285,0.0003579685,0.0007079098,0.0027557085,0.0011710358,0.0021231086,0.0009020048,0.00095635443,0.005834584],"category_scores_gemma":[0.004995622,0.00030271237,0.00031067804,0.0012986636,0.00134116,0.0036404084,0.0013139979,0.0010122147,0.0007017784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114221344,0.000021033731,0.0011783763,0.000067980516,0.000013517908,0.00010118312,0.00019909977,0.002646032,0.0021578814,0.9817168,0.0029534725,0.008830333],"study_design_scores_gemma":[0.000015703274,0.000021959384,0.0015526635,0.000028526765,0.000017909812,0.0002324279,0.00015397675,0.018638182,0.0010164521,0.97456145,0.0037411642,0.000019534136],"about_ca_topic_score_codex":0.0006983598,"about_ca_topic_score_gemma":0.001091148,"teacher_disagreement_score":0.005834584,"about_ca_system_score_codex":0.0010752713,"about_ca_system_score_gemma":0.00034309126,"threshold_uncertainty_score":0.019518614},"labels":[],"label_agreement":null},{"id":"W2394775218","doi":"","title":"The Hamiltonian Numbers in Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.037516865956538636,"score_gpt":0.29962870786811097,"score_spread":0.26211184191157233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394775218","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13366054,0.038073026,0.24541946,0.017402839,0.006927512,0.00010959207,0.0014277003,0.00069032656,0.55628896],"genre_scores_gemma":[0.85254437,0.012753185,0.04873286,0.0025009275,0.0042399233,0.00023043051,0.00059756817,0.00027314085,0.07812748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994598,0.0001960065,0.000026293344,0.000096569136,0.00015383685,0.00006751682],"domain_scores_gemma":[0.99854493,0.00074649806,0.00018752055,0.00016723339,0.00017714784,0.00017674419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066019036,0.0006898669,0.00060130644,0.003920562,0.0013036397,0.0026056687,0.0008315385,0.0012065473,0.011402181],"category_scores_gemma":[0.00457644,0.00044493526,0.00048625722,0.0021322994,0.0043370747,0.005972132,0.0017213877,0.002493476,0.0021202576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006224104,0.0000048342354,0.00007231495,0.00003727513,0.000003414003,0.000018401199,0.000093830306,0.00028272948,0.00017196704,0.98959327,0.0034619258,0.0062538367],"study_design_scores_gemma":[0.0000029748003,0.00000352257,0.00010899454,0.000014134358,0.000002634723,0.000042183754,0.000042220625,0.000749931,0.000082091494,0.9927429,0.006204101,0.000004315112],"about_ca_topic_score_codex":0.00087176304,"about_ca_topic_score_gemma":0.0012274313,"teacher_disagreement_score":0.011402181,"about_ca_system_score_codex":0.0011903554,"about_ca_system_score_gemma":0.00052266504,"threshold_uncertainty_score":0.03814411},"labels":[],"label_agreement":null},{"id":"W2394955060","doi":"","title":"On the normalized Laplacian eigenvalues of graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Laplace operator; Pure mathematics; Combinatorics; Mathematical analysis; Physics; Quantum mechanics","score_opus":0.054764152892298634,"score_gpt":0.30030683028246385,"score_spread":0.24554267739016522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394955060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29859278,0.012122623,0.3969498,0.008226581,0.0028913857,0.00007353893,0.0009557807,0.0009398318,0.27924767],"genre_scores_gemma":[0.9257839,0.005729981,0.03099224,0.00102171,0.0018632389,0.000137843,0.00046947697,0.00039409366,0.033607554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941194,0.00020585739,0.000020338079,0.00010625957,0.00017375132,0.00008184748],"domain_scores_gemma":[0.99763346,0.0012054469,0.000300131,0.00021729634,0.00034732503,0.00029637283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085864495,0.00088061043,0.00065950933,0.003555978,0.00095203664,0.0017411286,0.0010632272,0.001055293,0.010360155],"category_scores_gemma":[0.007372648,0.0003216137,0.00040708136,0.0016010655,0.0028616062,0.003993367,0.0016259699,0.0017483068,0.001935613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027135819,0.000020774805,0.00028452216,0.0000713442,0.000010514181,0.00006113898,0.00015357457,0.004153285,0.0012103774,0.97889245,0.005221934,0.009892951],"study_design_scores_gemma":[0.0000050042595,0.000007584094,0.00026875018,0.00002456033,0.000003658325,0.00008877303,0.00007205731,0.014119956,0.00024664841,0.9829336,0.0022173328,0.000011992076],"about_ca_topic_score_codex":0.00088920526,"about_ca_topic_score_gemma":0.0010428354,"teacher_disagreement_score":0.010360155,"about_ca_system_score_codex":0.0009858533,"about_ca_system_score_gemma":0.00037508315,"threshold_uncertainty_score":0.034658134},"labels":[],"label_agreement":null},{"id":"W2395139503","doi":"","title":"The scrambling indices of primitive digraphs with exactly two cycles.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Scrambling; Mathematics; Combinatorics; Algorithm","score_opus":0.02042772827843531,"score_gpt":0.2831502540776327,"score_spread":0.2627225257991974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395139503","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38930905,0.001823183,0.26916367,0.0010563589,0.0011881217,0.00019630442,0.0011971524,0.0014857173,0.33458048],"genre_scores_gemma":[0.8856288,0.00071572844,0.06712277,0.00058739807,0.00023572886,0.00019933487,0.00073404214,0.0005286722,0.044247504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995529,0.00011022524,0.00003282598,0.00008610801,0.0001075914,0.000110359455],"domain_scores_gemma":[0.9984257,0.00049840315,0.00017828896,0.00044439794,0.00022684164,0.0002264068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036939114,0.00050721964,0.00049230084,0.0013923753,0.001483625,0.001916792,0.00085114007,0.0010358795,0.009279544],"category_scores_gemma":[0.0032901058,0.00042921564,0.00047682147,0.0008351249,0.0014727617,0.0023332639,0.0017318446,0.0016709412,0.0027541223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091480644,0.000031123207,0.00019093406,0.000078909914,0.00000782619,0.0002158231,0.00023421411,0.0011031947,0.0047989856,0.96808136,0.004452392,0.020713737],"study_design_scores_gemma":[0.000028219562,0.000043863987,0.0002850371,0.000064476306,0.000016445387,0.00040771667,0.0001448548,0.008903478,0.005539769,0.9665078,0.018025808,0.000032565502],"about_ca_topic_score_codex":0.0006841169,"about_ca_topic_score_gemma":0.0012182182,"teacher_disagreement_score":0.009279544,"about_ca_system_score_codex":0.00066232996,"about_ca_system_score_gemma":0.0006847917,"threshold_uncertainty_score":0.031043172},"labels":[],"label_agreement":null},{"id":"W2395214934","doi":"","title":"PI Index of Some Simple Pericondensed Hexagonal Systems.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hexagonal crystal system; Simple (philosophy); Index (typography); Combinatorics; Pure mathematics; Crystallography; Chemistry; Computer science","score_opus":0.022692968910457936,"score_gpt":0.28351152684656555,"score_spread":0.26081855793610764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395214934","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76033044,0.00054222427,0.022113765,0.00063497655,0.0002363601,0.00007901571,0.00085059006,0.00020688825,0.21500571],"genre_scores_gemma":[0.9821936,0.00014438863,0.0061273417,0.00011246554,0.000038857488,0.000036802336,0.00034303698,0.000028679215,0.010974918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998041,0.00004621735,0.000010607428,0.0000250017,0.000055042863,0.0000590406],"domain_scores_gemma":[0.9996283,0.00008466744,0.00009057219,0.000045347315,0.0000626681,0.000088442204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001577559,0.00021610307,0.00025665652,0.0013264997,0.0011010284,0.0013192018,0.00046305027,0.00057916384,0.013667323],"category_scores_gemma":[0.0008454533,0.00016945938,0.0001480313,0.0007661084,0.0007630574,0.0007944082,0.0008024437,0.00057580415,0.0011866479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000178548,0.000051263327,0.0013788394,0.00012214063,0.000015234177,0.00032198496,0.0002903678,0.0032514287,0.0056994194,0.9651797,0.006586791,0.01692429],"study_design_scores_gemma":[0.000116408155,0.00011294108,0.0038140253,0.00004530887,0.000025815332,0.00070772,0.0007374724,0.045419097,0.007124607,0.9158216,0.026022848,0.000052160336],"about_ca_topic_score_codex":0.0011480494,"about_ca_topic_score_gemma":0.0015889185,"teacher_disagreement_score":0.013667323,"about_ca_system_score_codex":0.00057027984,"about_ca_system_score_gemma":0.00035478405,"threshold_uncertainty_score":0.04572171},"labels":[],"label_agreement":null},{"id":"W2395452549","doi":"","title":"The Wiener Polarity Index of Graph Products.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Polarity (international relations); Index (typography); Graph; Statistics; Combinatorics; Chemistry; Computer science","score_opus":0.01753218901229056,"score_gpt":0.26449621598101075,"score_spread":0.2469640269687202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395452549","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38374087,0.005752184,0.13543625,0.003716628,0.0015703647,0.00005646012,0.0012774154,0.00038564546,0.46806425],"genre_scores_gemma":[0.9479287,0.0029189263,0.012801828,0.00046686182,0.0011421607,0.000066393215,0.00053154025,0.00022603667,0.03391761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994473,0.00011130907,0.000032195094,0.00010164164,0.00019951242,0.0001080562],"domain_scores_gemma":[0.99873644,0.0004425741,0.00022172305,0.00014263377,0.00024456828,0.00021213372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061763346,0.00053970335,0.0005707886,0.004478958,0.0012172306,0.00380787,0.0006101659,0.000815366,0.008098797],"category_scores_gemma":[0.0036591615,0.00030968085,0.0003528797,0.0018689425,0.0021689867,0.007619707,0.0018041802,0.0015122513,0.002321502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026250109,0.000006779664,0.00027972972,0.000029144196,0.0000049817304,0.00003953301,0.00008937715,0.00023564998,0.0010547868,0.98737156,0.0019538016,0.008908387],"study_design_scores_gemma":[0.0000045139814,0.000009140398,0.0005011982,0.000020262196,0.000006537066,0.00014287874,0.00007870567,0.0021961688,0.00092028634,0.9899132,0.006195551,0.000011504956],"about_ca_topic_score_codex":0.000493724,"about_ca_topic_score_gemma":0.00054971175,"teacher_disagreement_score":0.008098797,"about_ca_system_score_codex":0.0009684731,"about_ca_system_score_gemma":0.00034434546,"threshold_uncertainty_score":0.027093232},"labels":[],"label_agreement":null},{"id":"W2395566361","doi":"","title":"Calculation of the Wiener, Szeged, and PI indices of a certain nanostar dendrimer.","year":2011,"lang":"hu","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Dendrimer; Mathematics; Pi; Pure mathematics; Chemistry; Polymer chemistry; Geometry","score_opus":0.029903053051812418,"score_gpt":0.25670870922202754,"score_spread":0.22680565617021511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395566361","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86521465,0.0006690768,0.07251631,0.00028748516,0.00016052682,0.000038500944,0.00026341176,0.00021735314,0.06063274],"genre_scores_gemma":[0.9683515,0.00031793074,0.020089425,0.000047732854,0.000017512624,0.000040392224,0.00021492051,0.00008760714,0.010833076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999473,0.000004975828,0.0000031349757,0.000007980706,0.000024772764,0.000011852575],"domain_scores_gemma":[0.9999137,0.000017712853,0.000013523391,0.000018038781,0.00001800312,0.000019084846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001490403,0.00024587297,0.000248776,0.0009999841,0.00052033126,0.00046362003,0.00049913075,0.00041608536,0.004399969],"category_scores_gemma":[0.00036343344,0.000113012386,0.00021743121,0.00043012798,0.00043835593,0.0010451453,0.00054280314,0.00050761935,0.00065235316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009787338,0.000053808166,0.0007379396,0.00013249432,0.000017600843,0.00030019428,0.00021897952,0.008056126,0.04841597,0.9242876,0.001873459,0.01580811],"study_design_scores_gemma":[0.000059065052,0.00017747226,0.0033129728,0.000065306136,0.000037016005,0.0009490935,0.00038301374,0.18746203,0.10554304,0.68401766,0.017904023,0.00008942907],"about_ca_topic_score_codex":0.0002769806,"about_ca_topic_score_gemma":0.0006157532,"teacher_disagreement_score":0.004399969,"about_ca_system_score_codex":0.00042055416,"about_ca_system_score_gemma":0.00027473114,"threshold_uncertainty_score":0.014719307},"labels":[],"label_agreement":null},{"id":"W2395698093","doi":"","title":"The hyper-Wiener index of trees with given parameters.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Index (typography); Statistics; Combinatorics; Computer science; Graph","score_opus":0.015507102631195598,"score_gpt":0.2561871999893441,"score_spread":0.2406800973581485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395698093","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5590819,0.004290449,0.23859605,0.002148612,0.000644674,0.000056942783,0.0011973799,0.0005897919,0.19339411],"genre_scores_gemma":[0.94335693,0.0016003414,0.025483985,0.00028902278,0.0005043248,0.00008600156,0.00051590946,0.0003080395,0.027855394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993643,0.00016577097,0.000037698974,0.00011900973,0.00019031999,0.00012293877],"domain_scores_gemma":[0.9979803,0.00076708954,0.00039543217,0.00023651075,0.00027711017,0.00034355873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087786716,0.00051620166,0.00073290453,0.004134893,0.0012476399,0.0039020032,0.00097497925,0.0013805322,0.007251084],"category_scores_gemma":[0.005295672,0.0004026969,0.0004121513,0.0023924788,0.0021771207,0.0066574183,0.0020466968,0.0017053101,0.0021646246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040935138,0.000010331602,0.00040251162,0.00003791171,0.000010546824,0.000058298585,0.00016664821,0.0010352067,0.0017182436,0.98749197,0.0012757711,0.0077516222],"study_design_scores_gemma":[0.0000059882536,0.000009895829,0.0005275242,0.000026146787,0.000009082577,0.00013828576,0.00008653298,0.008283809,0.00094987283,0.98646104,0.0034872394,0.000014612164],"about_ca_topic_score_codex":0.0005610379,"about_ca_topic_score_gemma":0.00081750855,"teacher_disagreement_score":0.007251084,"about_ca_system_score_codex":0.0011872131,"about_ca_system_score_gemma":0.0004094008,"threshold_uncertainty_score":0.024257302},"labels":[],"label_agreement":null},{"id":"W2395713685","doi":"","title":"On Szeged polynomial of graphs with even number of vertices.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.012713214060469302,"score_gpt":0.27015730312837455,"score_spread":0.2574440890679052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395713685","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6049342,0.0064410255,0.1493345,0.006973162,0.0013386236,0.00009017894,0.0018907328,0.0005112094,0.22848628],"genre_scores_gemma":[0.953901,0.0024579687,0.014494329,0.0005592686,0.00076134945,0.00006336394,0.00081174873,0.00017144263,0.026779583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931014,0.0001621853,0.000024366907,0.00013328702,0.00016026734,0.00020971609],"domain_scores_gemma":[0.9983028,0.0008555747,0.0002983307,0.00015286614,0.00017026099,0.00022006089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007016975,0.0008542134,0.001021437,0.003266156,0.0014294118,0.0022684215,0.0013281456,0.000950855,0.010616779],"category_scores_gemma":[0.0037728802,0.00042930685,0.0010894337,0.0024764072,0.0033339064,0.0052133203,0.0019982213,0.0030733105,0.002019997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007870688,0.000027869664,0.00035731017,0.00011486292,0.000012915894,0.00009772109,0.00023782952,0.0021915368,0.0008661111,0.98352575,0.0035498666,0.008939525],"study_design_scores_gemma":[0.000021877326,0.000016850501,0.0004246148,0.00003241156,0.000013864917,0.00015347496,0.00008833428,0.007418345,0.0004600753,0.98714846,0.0042049373,0.000016795088],"about_ca_topic_score_codex":0.0024678714,"about_ca_topic_score_gemma":0.0024226073,"teacher_disagreement_score":0.010616779,"about_ca_system_score_codex":0.0021618549,"about_ca_system_score_gemma":0.00079649204,"threshold_uncertainty_score":0.03551668},"labels":[],"label_agreement":null},{"id":"W2395905535","doi":"","title":"A Unified Approach to the Extremal Trees without Perfect Matching for Different Indices.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Matching (statistics); Statistics; Combinatorics","score_opus":0.048556711760604915,"score_gpt":0.3000654741873985,"score_spread":0.25150876242679354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395905535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025944883,0.003424577,0.780938,0.0024705548,0.0010876404,0.00013097507,0.00042886706,0.00055882457,0.18501571],"genre_scores_gemma":[0.47627956,0.0042557158,0.45472795,0.0022926284,0.0019052686,0.00043263275,0.000718768,0.0010243718,0.05836318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988998,0.00035402854,0.00007142627,0.00022378271,0.0003053777,0.00014552654],"domain_scores_gemma":[0.998516,0.000424601,0.00012514906,0.00051250804,0.00026609396,0.0001556975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001379854,0.00080273696,0.0011252182,0.0034025689,0.0023607744,0.003680535,0.003251867,0.003019221,0.009601187],"category_scores_gemma":[0.0049059456,0.0007487116,0.0013568152,0.0019370513,0.0034350778,0.009824576,0.004328544,0.005114127,0.0029442583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037962175,0.0000053716385,0.00002196754,0.000015303018,0.0000020851826,0.000020333386,0.000029210067,0.00044595732,0.00014726714,0.9964349,0.00086545665,0.002008342],"study_design_scores_gemma":[0.0000028862999,0.000003967909,0.000023140694,0.000011972695,0.0000036845431,0.000059041475,0.000022594813,0.004869754,0.00010084852,0.9918698,0.0030271641,0.000005182439],"about_ca_topic_score_codex":0.00062033633,"about_ca_topic_score_gemma":0.0011960486,"teacher_disagreement_score":0.009601187,"about_ca_system_score_codex":0.0013595859,"about_ca_system_score_gemma":0.000767522,"threshold_uncertainty_score":0.032119155},"labels":[],"label_agreement":null},{"id":"W2396029996","doi":"","title":"Clique number and distance spectral radii of graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Clique; Clique number; Combinatorics; Graph","score_opus":0.017840797435686263,"score_gpt":0.28660204694632035,"score_spread":0.26876124951063407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396029996","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.582962,0.0069161262,0.22850929,0.0057761404,0.00054836133,0.0000965522,0.0018733329,0.000642064,0.1726761],"genre_scores_gemma":[0.96513134,0.0015048288,0.023736306,0.00027949267,0.0005315141,0.00010420291,0.00061214255,0.00012688502,0.007973217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986475,0.00050932006,0.000049130183,0.00034145333,0.00030008017,0.00015240003],"domain_scores_gemma":[0.9911404,0.005679941,0.0011771759,0.0006488422,0.00048123568,0.00087241514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010986709,0.0006321239,0.00080099975,0.002951876,0.0012668686,0.002497709,0.0017016311,0.0013148065,0.007855197],"category_scores_gemma":[0.013301565,0.0004405252,0.00043174857,0.0018141676,0.0025157447,0.004896422,0.0019148369,0.001637493,0.0016146909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018372017,0.00005787526,0.0020648462,0.00015941878,0.00004039462,0.00007315051,0.0003200243,0.0070369937,0.002837943,0.9632251,0.006889428,0.017111052],"study_design_scores_gemma":[0.000025998874,0.000025273097,0.0017862656,0.000035828558,0.000026290341,0.00033299733,0.00019782418,0.029545395,0.001411698,0.9598468,0.0067441803,0.000021426387],"about_ca_topic_score_codex":0.0006406964,"about_ca_topic_score_gemma":0.0006959308,"teacher_disagreement_score":0.007855197,"about_ca_system_score_codex":0.001001312,"about_ca_system_score_gemma":0.00029370925,"threshold_uncertainty_score":0.026278257},"labels":[],"label_agreement":null},{"id":"W2396061165","doi":"","title":"On the Domination Number of the Circulant Graphs C(n;{1, 2}), C(n;{1, 3}) and C(n;{1, 4}).","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Circulant matrix; Mathematics; Combinatorics","score_opus":0.03301400109676463,"score_gpt":0.26581661696177394,"score_spread":0.2328026158650093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396061165","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82185966,0.0029830472,0.03853165,0.004653745,0.00032263168,0.000052203814,0.0012699078,0.00021089481,0.13011627],"genre_scores_gemma":[0.9850846,0.0008576509,0.0062077683,0.00025429306,0.0002666153,0.00006568337,0.00038472176,0.00006984495,0.0068088514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992706,0.00026306688,0.000024511914,0.00012980175,0.00014710067,0.00016487428],"domain_scores_gemma":[0.98717993,0.009344991,0.0012568645,0.0005147493,0.0005889232,0.0011146251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013267909,0.0005965758,0.00062393694,0.0033931262,0.0015962457,0.002043779,0.0013987581,0.0010017663,0.007088131],"category_scores_gemma":[0.010859808,0.0003741204,0.00035333954,0.0014947648,0.0023885781,0.0029686887,0.0011490324,0.0018231934,0.0005755079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048384507,0.00010895962,0.004496775,0.00018576453,0.000049073744,0.00020386098,0.00053868827,0.023280237,0.0051808236,0.9227956,0.014400286,0.028276103],"study_design_scores_gemma":[0.00008704073,0.000055377444,0.0053487183,0.000117827665,0.000045672256,0.0003925692,0.00024067577,0.111603536,0.0026883695,0.87332094,0.0060431003,0.000056156252],"about_ca_topic_score_codex":0.002324874,"about_ca_topic_score_gemma":0.0036780878,"teacher_disagreement_score":0.007088131,"about_ca_system_score_codex":0.0018657892,"about_ca_system_score_gemma":0.0007035868,"threshold_uncertainty_score":0.023712158},"labels":[],"label_agreement":null},{"id":"W2396228699","doi":"","title":"Extremal Values for the Maximum Degree in a Twin-Free Graph.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Graph; Combinatorics; Physics","score_opus":0.06866065517937235,"score_gpt":0.3091354455956739,"score_spread":0.24047479041630154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396228699","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7670706,0.001538301,0.15240702,0.0020961983,0.00030305143,0.000046745325,0.0008566271,0.00034706236,0.07533442],"genre_scores_gemma":[0.9829161,0.00031136474,0.012594991,0.00007618542,0.00009467261,0.0000372553,0.00016221224,0.000059540613,0.0037477093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961144,0.00010457998,0.000019341089,0.00008716494,0.000089296955,0.00008825215],"domain_scores_gemma":[0.9978998,0.0011188993,0.00025834667,0.00021335737,0.00017171662,0.0003379813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074706593,0.00046501574,0.00048037578,0.002583562,0.0011479302,0.0019390049,0.0011090693,0.001106566,0.0055084117],"category_scores_gemma":[0.0057540834,0.00035505238,0.0003614572,0.0011144361,0.001913244,0.0031907626,0.0013812411,0.0014056774,0.00057463197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014909387,0.000036719088,0.0010933082,0.00009830605,0.000020854734,0.0001651287,0.0002283107,0.007068771,0.0031657547,0.9746908,0.0031212398,0.010161732],"study_design_scores_gemma":[0.000018070134,0.000017965249,0.0008368851,0.00003636716,0.000015603331,0.0002754934,0.00018007301,0.029685397,0.001619703,0.9652883,0.0020016192,0.00002449038],"about_ca_topic_score_codex":0.00037135038,"about_ca_topic_score_gemma":0.0008112951,"teacher_disagreement_score":0.0055084117,"about_ca_system_score_codex":0.0007419208,"about_ca_system_score_gemma":0.00026163945,"threshold_uncertainty_score":0.018427491},"labels":[],"label_agreement":null},{"id":"W2396269925","doi":"","title":"Atom-bond connectivity index of unicyclic graphs with perfect matchings.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Atom (system on chip); Index (typography); Topological index; Computer science; World Wide Web","score_opus":0.013613071246342158,"score_gpt":0.2545618158380783,"score_spread":0.24094874459173615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396269925","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.874518,0.0016733003,0.02288502,0.0011229443,0.00014166831,0.000051727064,0.0018890422,0.0002809372,0.097437456],"genre_scores_gemma":[0.99254507,0.0004111519,0.0032357478,0.00006150803,0.00005612153,0.000036170328,0.0005271363,0.000033511536,0.0030936543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974483,0.000061382605,0.00001359268,0.000051721636,0.00007316862,0.000055240896],"domain_scores_gemma":[0.998128,0.0007928513,0.00045324728,0.00016505101,0.00018671755,0.00027423698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033588847,0.00028083628,0.00046657622,0.0022566488,0.0009541388,0.001593372,0.0010036175,0.00081871374,0.008277307],"category_scores_gemma":[0.0033459472,0.00021875289,0.00015661366,0.0017226607,0.0008102387,0.002024336,0.0009076768,0.00060752645,0.0006129698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003953631,0.00009388037,0.0053486987,0.00029069823,0.000048771195,0.00025304253,0.00044509838,0.011966404,0.006627192,0.92358565,0.016461693,0.034483556],"study_design_scores_gemma":[0.000062831146,0.000084486725,0.006224441,0.000091961796,0.00006462834,0.0006083421,0.00053245993,0.071627416,0.0043458343,0.9045823,0.011742031,0.000033340995],"about_ca_topic_score_codex":0.0010042833,"about_ca_topic_score_gemma":0.00140407,"teacher_disagreement_score":0.008277307,"about_ca_system_score_codex":0.0007600014,"about_ca_system_score_gemma":0.0003296316,"threshold_uncertainty_score":0.027690291},"labels":[],"label_agreement":null},{"id":"W2396433490","doi":"","title":"Asymptotic behavior of Laplacian-energy-like invariant of some graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Invariant (physics); Laplace operator; Pure mathematics; Mathematical analysis; Mathematical physics","score_opus":0.01712936372317403,"score_gpt":0.25606075154094093,"score_spread":0.2389313878177669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396433490","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8365012,0.0015475935,0.09352054,0.0025209403,0.00037363273,0.00004369186,0.00050289,0.0009838267,0.06400574],"genre_scores_gemma":[0.9887982,0.00030508227,0.004322347,0.00017588004,0.0002059492,0.00003713811,0.00031773438,0.00014288559,0.005694757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969363,0.000095153366,0.000009495614,0.00005326641,0.00007742202,0.000070997536],"domain_scores_gemma":[0.99727637,0.001090842,0.0003910484,0.00022618995,0.0004471609,0.0005685016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006180875,0.0005343502,0.0004965395,0.0025264637,0.0009242385,0.0009802277,0.0013439078,0.0009129764,0.007138343],"category_scores_gemma":[0.006903341,0.00022293632,0.0005150857,0.00071476464,0.0014620577,0.002196464,0.0010136743,0.0010907623,0.0006606577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013617113,0.000115572686,0.0031553402,0.00015060471,0.00004978822,0.00047119148,0.0003371374,0.012671176,0.009839665,0.9570337,0.0077458206,0.008293881],"study_design_scores_gemma":[0.0000314073,0.000062908264,0.0055262963,0.000053462416,0.000028667202,0.0006199623,0.00028646897,0.27912903,0.001900014,0.7101572,0.0021525228,0.000052055886],"about_ca_topic_score_codex":0.0011396799,"about_ca_topic_score_gemma":0.001258938,"teacher_disagreement_score":0.007138343,"about_ca_system_score_codex":0.0008877128,"about_ca_system_score_gemma":0.00041466896,"threshold_uncertainty_score":0.023880124},"labels":[],"label_agreement":null},{"id":"W2396457618","doi":"","title":"Maximum Randic Index on Unicyclic Graphs with k Pendant Vertices.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Index (typography); Topological index; Computer science; World Wide Web","score_opus":0.016064164616172733,"score_gpt":0.25934707514566663,"score_spread":0.24328291052949388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396457618","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7662483,0.0036047408,0.03847609,0.0014553634,0.00021643724,0.00007587221,0.0022601013,0.0005199586,0.18714324],"genre_scores_gemma":[0.97702855,0.0009126141,0.010676957,0.00013452859,0.00008972293,0.00004631354,0.0006767094,0.000082371225,0.010352296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949837,0.00012520852,0.000032514097,0.00010159082,0.00010948348,0.00013274503],"domain_scores_gemma":[0.9976895,0.0010521366,0.0004424069,0.0002902958,0.00019745452,0.00032823722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004081779,0.00038527587,0.0007331305,0.0020577398,0.0012695965,0.002201667,0.0009693889,0.00077844126,0.0076426365],"category_scores_gemma":[0.0041077225,0.00030845922,0.00024595903,0.0015479097,0.0010780385,0.002014667,0.0013168794,0.0006867596,0.0013464135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013957166,0.00010947403,0.005097593,0.0007827043,0.000067921865,0.0006502088,0.00085887284,0.017652975,0.02117798,0.8484788,0.021973772,0.08175408],"study_design_scores_gemma":[0.00015355089,0.00016983975,0.0055558668,0.00021212161,0.000092151575,0.0019498939,0.0006500201,0.044433277,0.013765552,0.9083971,0.024551526,0.00006922163],"about_ca_topic_score_codex":0.0006495338,"about_ca_topic_score_gemma":0.0014379778,"teacher_disagreement_score":0.0076426365,"about_ca_system_score_codex":0.0008717938,"about_ca_system_score_gemma":0.00036734974,"threshold_uncertainty_score":0.025567114},"labels":[],"label_agreement":null},{"id":"W2396468862","doi":"","title":"On the Laplacian-Energy-Like of graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Laplace operator; Mathematical analysis","score_opus":0.018393152521764877,"score_gpt":0.24685145570362318,"score_spread":0.2284583031818583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396468862","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28006172,0.012051413,0.23672521,0.016986907,0.002246501,0.0000785635,0.0010005217,0.0005023338,0.4503467],"genre_scores_gemma":[0.912957,0.0043262616,0.023578549,0.002772148,0.0018996567,0.000091223104,0.0005354665,0.00022810225,0.05361153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996371,0.00013200633,0.000013605301,0.00006463565,0.000100106314,0.000052503226],"domain_scores_gemma":[0.9987784,0.0005453495,0.00014285868,0.00013849005,0.00017212288,0.00022275311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058532675,0.0005769589,0.00044058758,0.0023595777,0.0011231359,0.0017636855,0.0009917842,0.0015158043,0.00762345],"category_scores_gemma":[0.0037895706,0.00028001922,0.0004754648,0.0011277362,0.0028400645,0.0044316608,0.0016153866,0.0018846886,0.0010401857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053641306,0.0000062424,0.00009955545,0.00002044157,0.0000025897318,0.00002817702,0.00006333575,0.00055947196,0.00021553435,0.99423015,0.002379343,0.002389732],"study_design_scores_gemma":[0.0000020165157,0.0000038698518,0.00011266358,0.0000075070707,0.0000014559575,0.00005545266,0.000039780058,0.0027390765,0.00004481597,0.99527174,0.0017184889,0.0000031525315],"about_ca_topic_score_codex":0.0009086714,"about_ca_topic_score_gemma":0.0011281611,"teacher_disagreement_score":0.00762345,"about_ca_system_score_codex":0.0007926448,"about_ca_system_score_gemma":0.000269142,"threshold_uncertainty_score":0.02550304},"labels":[],"label_agreement":null},{"id":"W2396610418","doi":"","title":"On the Laplacian spectral radii of tricyclic graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tricyclic; Mathematics; Laplace operator; Combinatorics; Chemistry; Mathematical analysis; Stereochemistry","score_opus":0.01987101167511251,"score_gpt":0.2626211146724926,"score_spread":0.2427501029973801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396610418","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5389965,0.012438882,0.15232298,0.007138786,0.0010516779,0.00008801631,0.0013083181,0.00093343365,0.28572133],"genre_scores_gemma":[0.9706224,0.0038286902,0.012203973,0.0005824034,0.00078229874,0.00010354217,0.00040468713,0.00026056176,0.011211413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991998,0.00030187576,0.00003166249,0.00013480637,0.00019815195,0.0001336739],"domain_scores_gemma":[0.9938257,0.004025786,0.00071010774,0.00036933494,0.00047148304,0.0005975597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009436691,0.00076387695,0.0007305792,0.003777607,0.0009499902,0.0019990364,0.0014775286,0.0012414013,0.00862192],"category_scores_gemma":[0.01186608,0.00043889383,0.00031301068,0.0018263889,0.0024226084,0.0035488987,0.002097576,0.0018058014,0.0022965206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010832571,0.000038001428,0.00091914105,0.00014920518,0.000018479415,0.000115963434,0.0003776438,0.007661744,0.0029162213,0.95139825,0.012692248,0.023604797],"study_design_scores_gemma":[0.000024239369,0.000026943306,0.0011413428,0.00007119864,0.000018508807,0.00034166223,0.0003794555,0.030954024,0.0012856085,0.95840067,0.0073240655,0.000032398944],"about_ca_topic_score_codex":0.000879096,"about_ca_topic_score_gemma":0.0008262533,"teacher_disagreement_score":0.00862192,"about_ca_system_score_codex":0.0009920885,"about_ca_system_score_gemma":0.00028086625,"threshold_uncertainty_score":0.028843224},"labels":[],"label_agreement":null},{"id":"W2396799827","doi":"","title":"On minimal energy of bipartite unicyclic graphs of a given bipartition.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Complete bipartite graph; Graph","score_opus":0.027103618686472843,"score_gpt":0.28228496899505096,"score_spread":0.25518135030857814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396799827","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6807008,0.003277581,0.13080975,0.0027877614,0.00041923134,0.00006272308,0.0013945436,0.00026239405,0.18028526],"genre_scores_gemma":[0.96678203,0.0009087693,0.012131655,0.00028543765,0.00017819203,0.00007314807,0.0007225831,0.00013416613,0.018784095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969053,0.000088364235,0.000013302586,0.000058734917,0.00007975085,0.000069334346],"domain_scores_gemma":[0.99900573,0.00053909526,0.00013140461,0.00008941578,0.00009740504,0.00013696808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002693751,0.00043631444,0.00062629086,0.0019757403,0.0010601645,0.0012798017,0.0010987227,0.0013164744,0.01392897],"category_scores_gemma":[0.0023438102,0.00029965062,0.00037431074,0.0012815514,0.0012046278,0.0018339141,0.0014296032,0.0010618845,0.0010767509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096431715,0.000036131903,0.00083864346,0.00021024453,0.000026392547,0.0001431904,0.00018852741,0.00812109,0.003516284,0.9648859,0.0061037433,0.015833424],"study_design_scores_gemma":[0.000013880872,0.0000208573,0.0011251327,0.000057245907,0.000013955894,0.00026158185,0.00020910207,0.024755787,0.0011018522,0.96852434,0.0039021103,0.000014088254],"about_ca_topic_score_codex":0.0004934335,"about_ca_topic_score_gemma":0.0008176854,"teacher_disagreement_score":0.01392897,"about_ca_system_score_codex":0.0006800393,"about_ca_system_score_gemma":0.00018434234,"threshold_uncertainty_score":0.046597064},"labels":[],"label_agreement":null},{"id":"W2397005811","doi":"","title":"The Signless Laplacian specttral radius of bicyclic graphs with order n and girth g.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Girth (graph theory); Combinatorics; Discrete mathematics","score_opus":0.026843991954859456,"score_gpt":0.2695828428488755,"score_spread":0.24273885089401606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397005811","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85891956,0.0016928253,0.031690557,0.0014923547,0.00023419123,0.000052492273,0.00072622846,0.0004446517,0.10474718],"genre_scores_gemma":[0.99174494,0.00038561682,0.0029574756,0.0001246469,0.000058416816,0.000033214917,0.00016466044,0.00004310176,0.0044879327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996947,0.00010370631,0.000012584615,0.00005183098,0.00007135097,0.00006574891],"domain_scores_gemma":[0.9984092,0.00067902554,0.0003352335,0.000113048816,0.00015384641,0.00030957407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030014582,0.00036087428,0.00039795975,0.0015223694,0.0006303173,0.0011840888,0.0008173695,0.0007380859,0.0047577843],"category_scores_gemma":[0.0039868914,0.00021504452,0.00015807345,0.00060295063,0.0013056913,0.001120862,0.0011138831,0.0005820894,0.0008629843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006736251,0.000069155525,0.0029222763,0.00031532306,0.00003947314,0.0005211155,0.0005476246,0.021946691,0.021338273,0.89911395,0.01827192,0.03424062],"study_design_scores_gemma":[0.00010852491,0.00016794408,0.0056688753,0.000109807945,0.000049973165,0.0012200371,0.0007191049,0.11784452,0.008179307,0.8542479,0.01158871,0.000095228264],"about_ca_topic_score_codex":0.0010639264,"about_ca_topic_score_gemma":0.0009924718,"teacher_disagreement_score":0.0047577843,"about_ca_system_score_codex":0.0005781055,"about_ca_system_score_gemma":0.00033784797,"threshold_uncertainty_score":0.015916407},"labels":[],"label_agreement":null},{"id":"W2397010240","doi":"","title":"On the signless Laplacian spectra of bicyclic and tricyclic graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tricyclic; Combinatorics; Mathematics; Bicyclic molecule; Stereochemistry; Chemistry","score_opus":0.045852315010755845,"score_gpt":0.28717936069790356,"score_spread":0.24132704568714772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397010240","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6181733,0.0057609854,0.08515714,0.0056568286,0.0012288293,0.0000691336,0.00088743743,0.0004794768,0.28258696],"genre_scores_gemma":[0.9720043,0.001944123,0.0071751205,0.00067630934,0.0006087419,0.000045774403,0.00031418563,0.00011277295,0.017118698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996363,0.000092431656,0.000014176773,0.00006126069,0.00011418576,0.0000816206],"domain_scores_gemma":[0.9986557,0.00058166153,0.00021299651,0.00009820417,0.00016388878,0.00028756325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040344615,0.00067094207,0.000590805,0.003215749,0.001288118,0.0021329385,0.000961647,0.0011210536,0.01040525],"category_scores_gemma":[0.0032639648,0.00034025576,0.00037184174,0.0014612735,0.0025267822,0.0028567798,0.0017126634,0.0016234012,0.0013778796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004133064,0.000028712348,0.00030010458,0.000054039203,0.000005404633,0.00013864174,0.00024247762,0.0014991041,0.0015464849,0.983108,0.004596432,0.008439278],"study_design_scores_gemma":[0.000013296024,0.000011397622,0.0003488306,0.00002893423,0.0000041644057,0.00020455362,0.00018258208,0.006709643,0.0002912777,0.99004024,0.0021522355,0.000012914938],"about_ca_topic_score_codex":0.0009896023,"about_ca_topic_score_gemma":0.0012310933,"teacher_disagreement_score":0.01040525,"about_ca_system_score_codex":0.00079938513,"about_ca_system_score_gemma":0.0003678374,"threshold_uncertainty_score":0.034808993},"labels":[],"label_agreement":null},{"id":"W2397111251","doi":"","title":"On the spectral radius of quasi-unicycle graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; RADIUS; Pure mathematics; Combinatorics; Computer science; Physics; Eigenvalues and eigenvectors; Computer security; Quantum mechanics","score_opus":0.02091164492999859,"score_gpt":0.2614589640855233,"score_spread":0.24054731915552474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397111251","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5821225,0.0106295785,0.21554334,0.00527646,0.00089110003,0.00008448645,0.0008297249,0.00066227245,0.18396047],"genre_scores_gemma":[0.9729546,0.0025140957,0.014882525,0.00049322756,0.0005533498,0.00011771289,0.0003154796,0.00024695706,0.007922029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987888,0.0005593073,0.000046103316,0.00020471659,0.0002150102,0.00018612409],"domain_scores_gemma":[0.98902994,0.007443287,0.0011314692,0.00060382724,0.00068054645,0.0011109138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015940305,0.0007113388,0.000994767,0.004015336,0.0015620756,0.0022756886,0.0018149914,0.0015471256,0.008541681],"category_scores_gemma":[0.014249332,0.00051966956,0.00040860754,0.0016967964,0.0033967448,0.0053098197,0.0025882833,0.001817662,0.0018114264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009541582,0.000026067302,0.000698066,0.000098459284,0.000014890882,0.00006994571,0.00026506238,0.004242149,0.0013562079,0.98073673,0.0044118944,0.007985138],"study_design_scores_gemma":[0.000015508249,0.000022772227,0.0007465832,0.00005503319,0.000014656278,0.00018059683,0.0002842694,0.022744302,0.0006361739,0.97152483,0.0037561818,0.000019082423],"about_ca_topic_score_codex":0.0008867739,"about_ca_topic_score_gemma":0.0007578206,"teacher_disagreement_score":0.008541681,"about_ca_system_score_codex":0.001259933,"about_ca_system_score_gemma":0.00035207978,"threshold_uncertainty_score":0.028574765},"labels":[],"label_agreement":null},{"id":"W2397155156","doi":"","title":"PI Index of Extremal Simple Pericondensed Hexagonal Systems.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Simple (philosophy); Hexagonal crystal system; Index (typography); Combinatorics; Pure mathematics; Discrete mathematics; Crystallography; Computer science; Chemistry","score_opus":0.03641791523662894,"score_gpt":0.29244438985618293,"score_spread":0.25602647461955397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397155156","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7489941,0.00059924286,0.020892391,0.00071195216,0.0002638613,0.00005037464,0.0006335698,0.0002592309,0.22759531],"genre_scores_gemma":[0.98844576,0.00015297697,0.0035221297,0.00010275366,0.00005832669,0.000028074037,0.00023878708,0.000032279047,0.0074189436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973935,0.000060405968,0.000012215993,0.000031530875,0.00008098474,0.00007536976],"domain_scores_gemma":[0.99948186,0.00012948632,0.00012149517,0.000069581554,0.000071327086,0.00012620735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023290656,0.0002754033,0.00033009765,0.0017479123,0.0010918754,0.0019821508,0.00064448727,0.00076555525,0.012707325],"category_scores_gemma":[0.0013644717,0.00019492797,0.00014115538,0.0007492658,0.0011074725,0.0012593325,0.001189139,0.0007740957,0.0011207456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014622012,0.000037298985,0.00095185183,0.000073543655,0.000011415856,0.00018921874,0.00015923029,0.0024014118,0.0033278053,0.975906,0.00409558,0.012700457],"study_design_scores_gemma":[0.000058151025,0.00006660445,0.002501357,0.00003369936,0.000015102148,0.0004852331,0.00038676395,0.029588176,0.003516725,0.9548522,0.008464661,0.000031227388],"about_ca_topic_score_codex":0.00071476906,"about_ca_topic_score_gemma":0.0009891584,"teacher_disagreement_score":0.012707325,"about_ca_system_score_codex":0.00058267615,"about_ca_system_score_gemma":0.0003222045,"threshold_uncertainty_score":0.04251021},"labels":[],"label_agreement":null},{"id":"W2397175735","doi":"","title":"Distance in the non-commuting graph of groups.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.037561555992187724,"score_gpt":0.2741475088030474,"score_spread":0.23658595281085967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397175735","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5253145,0.006426639,0.27187842,0.0068059685,0.001253603,0.00007861027,0.0005889808,0.000388073,0.18726519],"genre_scores_gemma":[0.93593293,0.0017708639,0.03325352,0.0007194646,0.0007005993,0.000080913844,0.00032474613,0.0001353493,0.027081603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991424,0.00029626934,0.000047106652,0.00021667323,0.00020298854,0.000094565126],"domain_scores_gemma":[0.99725,0.0014170514,0.0003942225,0.00027450264,0.00028629825,0.00037793315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007603691,0.00040428643,0.0006860505,0.0018786311,0.0018685458,0.0021857074,0.0010502372,0.0011378656,0.006866086],"category_scores_gemma":[0.0038117408,0.0003131489,0.00050096173,0.0012875925,0.0028185719,0.006337363,0.0019000754,0.0021615482,0.0009551534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013155782,0.000009184925,0.00017138217,0.000028035947,0.000003893792,0.00002914232,0.00016326006,0.00024232946,0.00024986066,0.9942092,0.0008496717,0.0040309266],"study_design_scores_gemma":[0.0000057591506,0.000006991091,0.00017401755,0.000006548478,0.0000032037046,0.00005834564,0.000072476796,0.0013651319,0.00012606083,0.99589866,0.0022785466,0.000004324843],"about_ca_topic_score_codex":0.0011654644,"about_ca_topic_score_gemma":0.0013807137,"teacher_disagreement_score":0.006866086,"about_ca_system_score_codex":0.0010453679,"about_ca_system_score_gemma":0.00045539552,"threshold_uncertainty_score":0.022969365},"labels":[],"label_agreement":null},{"id":"W2397289802","doi":"","title":"The hyper-Wiener index of unicyclic graphs with given matching number.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Matching (statistics); Index (typography); Combinatorics; Statistics; Graph; Computer science; World Wide Web","score_opus":0.02673195540462121,"score_gpt":0.26354293707610066,"score_spread":0.23681098167147946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397289802","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82659024,0.0021583734,0.06694103,0.0010156082,0.00028876952,0.00004027395,0.00077807327,0.00028347832,0.101904064],"genre_scores_gemma":[0.9829444,0.00073250016,0.0064261425,0.00008683392,0.00012997664,0.000039710823,0.00024989486,0.000068597925,0.009321892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996275,0.00008541773,0.000023099183,0.0000679472,0.000103318496,0.00009272608],"domain_scores_gemma":[0.99838936,0.00058930274,0.00038556763,0.00013583699,0.00018497788,0.00031492877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058282807,0.00035570542,0.0005590938,0.0032914882,0.000938538,0.0024259745,0.00083095714,0.00073790725,0.0054957992],"category_scores_gemma":[0.0040856963,0.00027478483,0.00025572904,0.0018323726,0.0014314422,0.0032583494,0.0014095274,0.0007726781,0.00104525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017130452,0.000024571831,0.0015091146,0.00008581599,0.000022478516,0.00012923716,0.00024055803,0.0034577185,0.0047780243,0.9732782,0.0024674733,0.013835385],"study_design_scores_gemma":[0.00002132853,0.00003076981,0.001929674,0.000052956326,0.000023891856,0.00030573964,0.00021616249,0.025077296,0.0032512157,0.96423876,0.004822982,0.000029211924],"about_ca_topic_score_codex":0.0005132403,"about_ca_topic_score_gemma":0.0007581074,"teacher_disagreement_score":0.0054957992,"about_ca_system_score_codex":0.00095025904,"about_ca_system_score_gemma":0.00035093186,"threshold_uncertainty_score":0.018385231},"labels":[],"label_agreement":null},{"id":"W2397655904","doi":"","title":"Tree with minimal Laplacian spectral radius and diameter n-4.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tree (set theory); Spectral radius; RADIUS; Laplace operator; Combinatorics; Mathematical analysis; Physics; Computer science; Eigenvalues and eigenvectors","score_opus":0.014148617903686848,"score_gpt":0.2384438058623373,"score_spread":0.22429518795865044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397655904","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72803116,0.0021217484,0.103237756,0.00557338,0.00037584093,0.000116061754,0.0046175118,0.0011563001,0.15477023],"genre_scores_gemma":[0.9294391,0.0008960172,0.039532322,0.0005000774,0.00015902305,0.00008426398,0.0023251467,0.00020425936,0.026859868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973625,0.00006082459,0.000012454493,0.000071096365,0.000063389605,0.000055945493],"domain_scores_gemma":[0.9982191,0.00081804657,0.00023998263,0.0001726693,0.00021471138,0.00033554368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024953665,0.000322901,0.0006899294,0.0009829435,0.0012757939,0.0017383115,0.0010388908,0.0011518202,0.009347824],"category_scores_gemma":[0.002820371,0.00032804778,0.00034668745,0.0009990899,0.0008356328,0.001492877,0.001218816,0.00085311924,0.002398486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010140454,0.00021345721,0.004949888,0.0007611578,0.00013885502,0.0019327824,0.0010832614,0.011247708,0.049793232,0.8167493,0.06183453,0.050281834],"study_design_scores_gemma":[0.00017896731,0.00017737994,0.007136396,0.00014409065,0.00016369566,0.004346211,0.0013462058,0.058276653,0.014851613,0.8574452,0.05586306,0.000070644055],"about_ca_topic_score_codex":0.0009897627,"about_ca_topic_score_gemma":0.0017053863,"teacher_disagreement_score":0.009347824,"about_ca_system_score_codex":0.00076841447,"about_ca_system_score_gemma":0.00041418854,"threshold_uncertainty_score":0.031271577},"labels":[],"label_agreement":null},{"id":"W2397803124","doi":"","title":"Flexibility of Circular Graphs C(2n, 2) on the Projective Plane.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Projective plane; Projective test; Flexibility (engineering); Plane (geometry); Real projective plane; Combinatorics; Pure mathematics; Geometry; Projective space; Collineation; Statistics","score_opus":0.08205620202908284,"score_gpt":0.29191591265374855,"score_spread":0.2098597106246657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397803124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80120176,0.00054601027,0.044638842,0.0012268652,0.0001382906,0.000050811672,0.00086146576,0.0002825385,0.1510534],"genre_scores_gemma":[0.98564494,0.00019553324,0.004308015,0.00013127267,0.00005047853,0.00003004963,0.00032810643,0.00007952938,0.009232092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993525,0.0001580134,0.00002458791,0.00013353492,0.0001468695,0.00018445539],"domain_scores_gemma":[0.9986229,0.0005182523,0.00026182624,0.0002340674,0.00008494005,0.00027803693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041539277,0.0005328031,0.0003746047,0.0016487169,0.0017682542,0.0024224701,0.00092982646,0.0008522284,0.012254289],"category_scores_gemma":[0.0018195006,0.0003939395,0.00046596932,0.0014545607,0.0026465734,0.0025484143,0.002613049,0.0011441463,0.001078071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020804802,0.000021845755,0.000670086,0.00005075988,0.000011312491,0.0004274425,0.00044782987,0.008379284,0.003179759,0.9725811,0.0027397922,0.011282744],"study_design_scores_gemma":[0.00005736939,0.000043815904,0.0018968298,0.000040712348,0.000018310147,0.0006106745,0.00053212495,0.015673686,0.00212202,0.96503776,0.013920192,0.00004650436],"about_ca_topic_score_codex":0.0022207387,"about_ca_topic_score_gemma":0.0023812887,"teacher_disagreement_score":0.012254289,"about_ca_system_score_codex":0.0008618597,"about_ca_system_score_gemma":0.00034847384,"threshold_uncertainty_score":0.040994704},"labels":[],"label_agreement":null},{"id":"W2398008903","doi":"","title":"Subtrees, BC-Subtrees of Generalized Bethe Trees and Related Questions","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.03613497431998955,"score_gpt":0.29382354678114747,"score_spread":0.25768857246115795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398008903","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6932841,0.008568269,0.13192837,0.012127076,0.00079468533,0.00009163802,0.0010762315,0.000311725,0.15181784],"genre_scores_gemma":[0.9443369,0.003148259,0.024087636,0.0016053502,0.0013400455,0.00011281371,0.0010117963,0.00015671656,0.024200473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991429,0.00025606167,0.0000464434,0.00019116396,0.00019844758,0.00016493026],"domain_scores_gemma":[0.9966883,0.001821864,0.00042478036,0.000316719,0.00030286663,0.00044552062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010661549,0.00073891145,0.001212429,0.0023291493,0.0026370485,0.00393497,0.0017922958,0.0029384536,0.007817338],"category_scores_gemma":[0.0069618737,0.00084531796,0.00096619996,0.0037122103,0.0043188506,0.009502825,0.0023576084,0.0037295935,0.0007828634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023945264,0.000016667156,0.000269365,0.00004622438,0.000004578968,0.000042528496,0.0002240873,0.00058905256,0.0002717776,0.9943778,0.0011102619,0.0030237222],"study_design_scores_gemma":[0.0000057671573,0.0000029775954,0.00016344097,0.000010723305,0.000003119883,0.00004172849,0.00007395666,0.0013834699,0.00004204847,0.9972319,0.0010368526,0.000004088392],"about_ca_topic_score_codex":0.003033598,"about_ca_topic_score_gemma":0.0028861938,"teacher_disagreement_score":0.007817338,"about_ca_system_score_codex":0.002002666,"about_ca_system_score_gemma":0.0007512942,"threshold_uncertainty_score":0.026151538},"labels":[],"label_agreement":null},{"id":"W2398184112","doi":"","title":"Estimates of the choice numbers and the Ohba numbers of some complete multipartite graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multipartite; Mathematics; Combinatorics; Graph; Integer (computer science); Discrete mathematics; Computer science; Physics","score_opus":0.042139634510755676,"score_gpt":0.2935929708367545,"score_spread":0.2514533363259988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398184112","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.563642,0.004607253,0.27623984,0.0026365041,0.0004887304,0.00013003257,0.0011581875,0.000551966,0.15054546],"genre_scores_gemma":[0.95811814,0.00099695,0.030362152,0.00016558077,0.00015562665,0.00015616827,0.00032143106,0.0001319117,0.009591882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992361,0.00019089667,0.000028414848,0.00012730692,0.0002743679,0.00014284607],"domain_scores_gemma":[0.9917848,0.0053990344,0.0007122995,0.0007002419,0.00058025797,0.000823329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015117682,0.0009045057,0.00044499798,0.0036954046,0.0012167385,0.0015118618,0.0010425071,0.0007641055,0.007039826],"category_scores_gemma":[0.00932131,0.00049777445,0.0006421167,0.001146357,0.0028063676,0.0046779974,0.001719148,0.0025643716,0.00068542507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023309565,0.00005523328,0.002033522,0.00022710547,0.000037195987,0.0001272903,0.00042068443,0.015742406,0.009662119,0.9533769,0.0036698119,0.014414593],"study_design_scores_gemma":[0.000020200983,0.000045595134,0.0026849373,0.00005754242,0.000027510227,0.00023728522,0.0002173895,0.037071772,0.0053619505,0.9479094,0.006313907,0.00005257135],"about_ca_topic_score_codex":0.00058581907,"about_ca_topic_score_gemma":0.0010118922,"teacher_disagreement_score":0.007039826,"about_ca_system_score_codex":0.001328748,"about_ca_system_score_gemma":0.00048987835,"threshold_uncertainty_score":0.02355051},"labels":[],"label_agreement":null},{"id":"W2398226296","doi":"","title":"Semi-regular harmonic graph and equi-bipartite harmonic graph.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Complete bipartite graph; Edge-transitive graph; Graph; Combinatorics; Voltage graph; Discrete mathematics; Line graph","score_opus":0.02500176969467907,"score_gpt":0.27860292816519927,"score_spread":0.2536011584705202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398226296","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4329575,0.0014892844,0.27822348,0.0033237718,0.00055579003,0.00013151113,0.0016823265,0.0004372123,0.28119913],"genre_scores_gemma":[0.91527194,0.0008797345,0.033157676,0.00059391366,0.00035803832,0.000118436146,0.0011909938,0.000128956,0.04830032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962795,0.00009343992,0.000015778112,0.00010992068,0.0000911437,0.000061784114],"domain_scores_gemma":[0.99867296,0.0005021218,0.00024078149,0.00016205019,0.00020413376,0.00021785035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034485583,0.00031309246,0.0004607552,0.0013074428,0.0011353921,0.0013406159,0.00092190213,0.0008261852,0.013140328],"category_scores_gemma":[0.0025687292,0.0002542587,0.00037574276,0.0009795121,0.0015036574,0.0027914643,0.0014168695,0.0011240302,0.0016877789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027910231,0.000017429835,0.00026498173,0.000049161255,0.000007414634,0.000094439805,0.00014537605,0.000921898,0.0007327556,0.9838524,0.0035521886,0.01033394],"study_design_scores_gemma":[0.000008421726,0.000011772914,0.00046784605,0.0000141907185,0.000009720479,0.00031828717,0.00019119652,0.00952868,0.00046089088,0.98127717,0.0077017453,0.000009950901],"about_ca_topic_score_codex":0.000823352,"about_ca_topic_score_gemma":0.0009294545,"teacher_disagreement_score":0.013140328,"about_ca_system_score_codex":0.0006250633,"about_ca_system_score_gemma":0.00030980844,"threshold_uncertainty_score":0.043958724},"labels":[],"label_agreement":null},{"id":"W2398284551","doi":"","title":"On The Energy Of 3-Circulant Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Circulant matrix; Mathematics; Energy (signal processing); Combinatorics; Statistics","score_opus":0.020081729769971135,"score_gpt":0.2460463901696723,"score_spread":0.22596466039970117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398284551","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38636708,0.014446283,0.20053692,0.009915121,0.0025864027,0.000051036106,0.0008724898,0.00037949334,0.38484517],"genre_scores_gemma":[0.9410121,0.003598648,0.015073424,0.0012517055,0.0010176449,0.00007668612,0.00037920248,0.00027113614,0.037319448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996511,0.00009969993,0.000011433449,0.000048269845,0.00011500107,0.00007456378],"domain_scores_gemma":[0.99890304,0.00058273267,0.00012280131,0.00011813472,0.00012736587,0.0001459448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005253672,0.000640977,0.00067295413,0.0024755723,0.0011276819,0.0015535569,0.0011079282,0.0018196651,0.010262396],"category_scores_gemma":[0.0031748775,0.0003365122,0.00039393312,0.0011677626,0.002320484,0.0028916674,0.0015087388,0.0018601958,0.0017253762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013793986,0.00001102038,0.00012061525,0.000036824746,0.000005745699,0.000042205207,0.000055689994,0.002314659,0.0005891015,0.98895746,0.0030895676,0.0047633904],"study_design_scores_gemma":[0.0000034443024,0.000003865434,0.00016283423,0.00001704248,0.0000020552457,0.000054132328,0.00003576864,0.007993452,0.00012500053,0.989817,0.0017794144,0.0000059371787],"about_ca_topic_score_codex":0.0009977225,"about_ca_topic_score_gemma":0.0014980236,"teacher_disagreement_score":0.010262396,"about_ca_system_score_codex":0.00086611963,"about_ca_system_score_gemma":0.0003242086,"threshold_uncertainty_score":0.034331143},"labels":[],"label_agreement":null},{"id":"W2398376000","doi":"","title":"A note on the LEL-equienergetic graphs","year":2014,"lang":"es","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics; Eigenvalues and eigenvectors","score_opus":0.016671470542905343,"score_gpt":0.2666490869492172,"score_spread":0.24997761640631183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398376000","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47003862,0.01936614,0.18952638,0.010946276,0.0025147453,0.00009323073,0.00062878255,0.0004467794,0.3064391],"genre_scores_gemma":[0.90818155,0.008000458,0.057170406,0.0017440425,0.0021659902,0.000077683086,0.00053469505,0.00013871348,0.021986397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959666,0.000097251344,0.000026137926,0.00011654413,0.0001073793,0.00005615774],"domain_scores_gemma":[0.99866843,0.0007419307,0.00014750523,0.00015160623,0.00016257142,0.0001279557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055114616,0.0004230941,0.00044248748,0.0015518182,0.0012538466,0.0010085573,0.0007139144,0.00076834013,0.0036350607],"category_scores_gemma":[0.0021730382,0.00024805905,0.00026278695,0.0012501492,0.0018423926,0.002468118,0.001104674,0.0021560686,0.0005438482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009527764,0.00005244017,0.0014352945,0.00023938795,0.000012833955,0.0006216527,0.00047099442,0.0023767946,0.0033182488,0.9277297,0.008064971,0.055582467],"study_design_scores_gemma":[0.000014005813,0.00009768765,0.0019579683,0.00005925016,0.00002481665,0.0015798127,0.0002956082,0.009272921,0.0028833982,0.9196085,0.06417381,0.000032165186],"about_ca_topic_score_codex":0.00049781386,"about_ca_topic_score_gemma":0.0006066883,"teacher_disagreement_score":0.0036350607,"about_ca_system_score_codex":0.0005802098,"about_ca_system_score_gemma":0.00019516284,"threshold_uncertainty_score":0.01216042},"labels":[],"label_agreement":null},{"id":"W2398394717","doi":"","title":"On Maximum Merrifield-Simmons Index of Unicyclic Graphs with Prescribed Pendent Vertices.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Discrete mathematics; Computer science; World Wide Web","score_opus":0.03815823998358468,"score_gpt":0.26338456369090923,"score_spread":0.22522632370732454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398394717","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7498806,0.0039853095,0.06536681,0.0022579606,0.00040001786,0.00008742244,0.0013383474,0.0003806762,0.17630282],"genre_scores_gemma":[0.98118824,0.0011151145,0.009833051,0.00016876752,0.00019305681,0.00006107274,0.00038521382,0.00007555139,0.0069798897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948835,0.00014740798,0.00002697999,0.000088937355,0.00013602647,0.000112323396],"domain_scores_gemma":[0.9955531,0.0025624593,0.00061890675,0.00032500003,0.0003569468,0.00058356073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095741526,0.0004977785,0.0008600967,0.0028827225,0.0012825455,0.0018594672,0.0013187238,0.0010429785,0.00753187],"category_scores_gemma":[0.007782606,0.0003089404,0.00033680283,0.0018737476,0.0014234057,0.0033437635,0.0012519391,0.0011586689,0.00094280636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000531349,0.00007618339,0.0027044902,0.00026548302,0.00003319698,0.00020033213,0.0005733914,0.010234433,0.0065223356,0.9352765,0.010164856,0.033417452],"study_design_scores_gemma":[0.000073995325,0.000099863355,0.0021862194,0.00009426242,0.00003857043,0.0004900415,0.00030915122,0.03640234,0.004958969,0.9461765,0.009126666,0.000043390184],"about_ca_topic_score_codex":0.0006972794,"about_ca_topic_score_gemma":0.001315978,"teacher_disagreement_score":0.00753187,"about_ca_system_score_codex":0.0016468014,"about_ca_system_score_gemma":0.00058078516,"threshold_uncertainty_score":0.025196671},"labels":[],"label_agreement":null},{"id":"W2398402683","doi":"","title":"The γ-spectrum of a graph","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectrum (functional analysis); Graph; Combinatorics; Physics","score_opus":0.03627350356025675,"score_gpt":0.2660037752074153,"score_spread":0.22973027164715856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398402683","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6025614,0.0023043256,0.15111995,0.0061322227,0.0007972134,0.00007632933,0.00086768455,0.0004426153,0.23569827],"genre_scores_gemma":[0.95908594,0.0011727303,0.015361949,0.00077960367,0.00048801053,0.00012008883,0.00035155914,0.00013844672,0.022501636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993185,0.00017836773,0.000033478525,0.00020135408,0.00014281004,0.00012545823],"domain_scores_gemma":[0.99898726,0.0004273118,0.00013852325,0.00009178207,0.00013890967,0.00021630536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006652216,0.000983843,0.000725015,0.005121056,0.0021325955,0.0037381682,0.0009966267,0.0014617069,0.007982714],"category_scores_gemma":[0.0015577541,0.00055102294,0.0006716349,0.002206002,0.004401571,0.0043598874,0.0019036878,0.0019685323,0.0010831924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011636318,0.00000521766,0.00007505822,0.00001271469,0.0000033918595,0.00004747738,0.00019142365,0.00022104642,0.00061976415,0.99650455,0.00057244685,0.0017351795],"study_design_scores_gemma":[0.000006889352,0.0000060623875,0.00012050168,0.000016377548,0.000004344289,0.0000949095,0.00011773541,0.0013036411,0.00017384425,0.9959502,0.0021987276,0.000006701644],"about_ca_topic_score_codex":0.0012045709,"about_ca_topic_score_gemma":0.00065154233,"teacher_disagreement_score":0.007982714,"about_ca_system_score_codex":0.0010853455,"about_ca_system_score_gemma":0.00045411263,"threshold_uncertainty_score":0.026704788},"labels":[],"label_agreement":null},{"id":"W2398599938","doi":"","title":"PI Indices For Some Classes Of Bicyclic Graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Bicyclic molecule; Stereochemistry; Chemistry","score_opus":0.02429378601142765,"score_gpt":0.30401232204167267,"score_spread":0.279718536030245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398599938","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28933513,0.001750837,0.05689872,0.0026924787,0.0007645444,0.00018018401,0.0023710327,0.00090357976,0.64510363],"genre_scores_gemma":[0.92451835,0.0011580345,0.0177075,0.0009543982,0.000374731,0.00023370163,0.001853489,0.00021877345,0.052981038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950945,0.000065817825,0.00002380697,0.00010626274,0.00015710246,0.00013742427],"domain_scores_gemma":[0.99895155,0.00028039268,0.00021744944,0.00016617043,0.0001804076,0.00020398654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032013404,0.0005027784,0.00042309714,0.0030145727,0.0016946162,0.0026360569,0.0009614565,0.00086366385,0.016610818],"category_scores_gemma":[0.0020464153,0.00030582614,0.00031130304,0.00216903,0.0011732633,0.0021379306,0.0012789244,0.0020197558,0.002305418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005452905,0.000029324343,0.0006712999,0.00006260634,0.000006425334,0.00013639576,0.0002101265,0.00039709924,0.0010468104,0.9714443,0.010280094,0.015660971],"study_design_scores_gemma":[0.000022597522,0.00001987325,0.0011641985,0.000039189166,0.000012809115,0.0006110319,0.00022320125,0.004649466,0.00092564744,0.96246475,0.029849214,0.000017970344],"about_ca_topic_score_codex":0.00095570687,"about_ca_topic_score_gemma":0.0012758656,"teacher_disagreement_score":0.016610818,"about_ca_system_score_codex":0.0011119128,"about_ca_system_score_gemma":0.0004953343,"threshold_uncertainty_score":0.055568755},"labels":[],"label_agreement":null},{"id":"W2398676038","doi":"","title":"Spectral Invariants and Some Stable Properties of a Graph.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral properties; Pure mathematics; Graph; Discrete mathematics; Computational chemistry; Chemistry","score_opus":0.05804052671812582,"score_gpt":0.26579291548942047,"score_spread":0.20775238877129465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398676038","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5052664,0.0034358043,0.22922546,0.0044083106,0.00094200624,0.00009453735,0.001024043,0.0006136086,0.2549898],"genre_scores_gemma":[0.97530395,0.0008036222,0.009738389,0.00026962173,0.0005148371,0.00005324607,0.0003637803,0.00009630048,0.012856269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996101,0.00009599834,0.000020500562,0.00008880376,0.00011016566,0.000074497184],"domain_scores_gemma":[0.998458,0.00066557125,0.00028215206,0.00015731843,0.00022797023,0.00020895337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000540062,0.00051819306,0.00042381202,0.0033469289,0.0013082542,0.002150159,0.00069914357,0.00071696413,0.008456871],"category_scores_gemma":[0.0026450295,0.00026481942,0.0006063975,0.001635208,0.00302756,0.0034354778,0.0011885314,0.0014922261,0.0011031454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014299068,0.000013260938,0.00023526073,0.000021385164,0.000005168231,0.00005351936,0.00015231466,0.00036496425,0.00073493045,0.99214447,0.0014051483,0.004855225],"study_design_scores_gemma":[0.0000054379866,0.000011680324,0.00034348085,0.000010272149,0.000008242049,0.000121698184,0.00015127454,0.002681091,0.00044769942,0.9932719,0.002941254,0.0000059195427],"about_ca_topic_score_codex":0.00068125356,"about_ca_topic_score_gemma":0.000700083,"teacher_disagreement_score":0.008456871,"about_ca_system_score_codex":0.0007640561,"about_ca_system_score_gemma":0.00029123842,"threshold_uncertainty_score":0.028290987},"labels":[],"label_agreement":null},{"id":"W2398764523","doi":"","title":"On Schwenk-like formulas for Q-characteristic polynomials of graphs","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics; Pure mathematics","score_opus":0.05451344267431975,"score_gpt":0.3164697697947031,"score_spread":0.26195632712038336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398764523","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56034577,0.0031605836,0.26283136,0.0061314744,0.0010442038,0.00014568481,0.0009041606,0.0007451245,0.16469164],"genre_scores_gemma":[0.9557883,0.0016131427,0.024293981,0.0010180353,0.000699903,0.00010388665,0.0004430031,0.00018274036,0.015856925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990951,0.00028811264,0.000055673587,0.00014523165,0.00022675832,0.0001891618],"domain_scores_gemma":[0.9968624,0.0018783578,0.0003220001,0.00019611165,0.000380064,0.00036102254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021404314,0.001365331,0.0012977683,0.0045837816,0.002609929,0.0048349225,0.0020336215,0.0017981585,0.008327946],"category_scores_gemma":[0.007623251,0.0008811975,0.0013271727,0.004793968,0.0055720224,0.008626339,0.0031279204,0.005145356,0.0011345332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035730685,0.000026719277,0.0003468435,0.000043128377,0.0000063827965,0.00008143081,0.00041407486,0.00066835724,0.0003405715,0.9915344,0.0010155435,0.0054868045],"study_design_scores_gemma":[0.000011632451,0.000009428245,0.00015858463,0.000014438076,0.000008194089,0.000054270655,0.00010658328,0.0021987804,0.00013830085,0.99636143,0.0009260818,0.000012261713],"about_ca_topic_score_codex":0.003147134,"about_ca_topic_score_gemma":0.0035623212,"teacher_disagreement_score":0.008327946,"about_ca_system_score_codex":0.0036043858,"about_ca_system_score_gemma":0.0009245079,"threshold_uncertainty_score":0.027859688},"labels":[],"label_agreement":null},{"id":"W2398841770","doi":"","title":"A note on circumferences in k-connected graphs with given independence number.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Independence (probability theory); Independence number; Combinatorics; Statistics; Graph","score_opus":0.018288032115619066,"score_gpt":0.27367901067847084,"score_spread":0.25539097856285176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398841770","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10928421,0.016442277,0.38252205,0.011687028,0.008773961,0.00012011961,0.0014892862,0.0016592646,0.46802184],"genre_scores_gemma":[0.7651828,0.011954799,0.1610489,0.0024001542,0.0065617226,0.0002379191,0.00091433804,0.00091159024,0.050787766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904007,0.00028140607,0.000063123414,0.0002937061,0.00022552111,0.00009605263],"domain_scores_gemma":[0.9955199,0.0027570315,0.00034873153,0.00060347095,0.00036375425,0.00040712932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008836346,0.00086250756,0.0010176755,0.002328642,0.0020267495,0.0023558247,0.0018841174,0.0012804345,0.010667658],"category_scores_gemma":[0.007882067,0.00065938174,0.0010971836,0.0030435913,0.0039969,0.0057056667,0.0028970963,0.0045530805,0.002004534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001183281,0.000027252367,0.0008910319,0.0002586138,0.00002865455,0.00039252747,0.0003926162,0.004616256,0.002373967,0.94332474,0.020357126,0.02721885],"study_design_scores_gemma":[0.000014216325,0.000054227112,0.0018941864,0.0000670214,0.000042720767,0.00073811377,0.0002553925,0.008972288,0.0010055384,0.94166446,0.045239333,0.000052565883],"about_ca_topic_score_codex":0.00186469,"about_ca_topic_score_gemma":0.0025916696,"teacher_disagreement_score":0.010667658,"about_ca_system_score_codex":0.00133751,"about_ca_system_score_gemma":0.00048652777,"threshold_uncertainty_score":0.03568685},"labels":[],"label_agreement":null},{"id":"W2398858628","doi":"","title":"The Randic index and girth of triangle-free graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Girth (graph theory); Combinatorics; Index (typography); Discrete mathematics; Computer science; World Wide Web","score_opus":0.014485845876847715,"score_gpt":0.2531955796723751,"score_spread":0.2387097337955274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398858628","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63687736,0.007322496,0.06954638,0.002553211,0.0007860211,0.00004746611,0.001121996,0.00032904616,0.28141597],"genre_scores_gemma":[0.9781858,0.0018870987,0.0074432553,0.0001759616,0.00040676384,0.000036008434,0.00032491738,0.00008739697,0.011452928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952066,0.00012184544,0.000022820403,0.00010558611,0.00013893042,0.00009008979],"domain_scores_gemma":[0.9977443,0.0011068109,0.0004243922,0.0002582547,0.00018632777,0.00027982745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005274025,0.0004442567,0.00059676316,0.0032320023,0.00092075864,0.0021009983,0.0009632444,0.00066834205,0.0076828473],"category_scores_gemma":[0.0057345955,0.00032064444,0.00031056756,0.0017351363,0.0021122252,0.0031954434,0.0015993272,0.0015625309,0.0012362435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001326293,0.00002727931,0.0019084036,0.00007805304,0.000020042466,0.00009479656,0.00035028215,0.0032113486,0.0020617854,0.96383023,0.005315529,0.022969628],"study_design_scores_gemma":[0.000015714224,0.000021420496,0.0016452189,0.000040396455,0.000018890907,0.00030026722,0.0001842324,0.007109884,0.0010269105,0.9825561,0.0070615993,0.00001939996],"about_ca_topic_score_codex":0.00086983806,"about_ca_topic_score_gemma":0.0011102019,"teacher_disagreement_score":0.0076828473,"about_ca_system_score_codex":0.0007133459,"about_ca_system_score_gemma":0.00032126773,"threshold_uncertainty_score":0.025701702},"labels":[],"label_agreement":null},{"id":"W2398865451","doi":"","title":"A note on the eigenvalues of graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Combinatorics; Physics","score_opus":0.024036333562208394,"score_gpt":0.29163706322232924,"score_spread":0.26760072966012083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398865451","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022586862,0.09279006,0.22507504,0.072191104,0.057428125,0.00005363193,0.00072345615,0.0012619647,0.5278898],"genre_scores_gemma":[0.4736598,0.09073806,0.14503576,0.02948738,0.05796887,0.00019235173,0.0006230146,0.001854109,0.20044059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941766,0.00017858406,0.00002403392,0.00011034157,0.00021773002,0.000051538314],"domain_scores_gemma":[0.99694073,0.002178611,0.00011544855,0.00034840676,0.00023840554,0.0001784991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008950598,0.0010269289,0.0008451319,0.001944061,0.0017670407,0.0021074554,0.0014638647,0.0015568496,0.013680596],"category_scores_gemma":[0.0045530396,0.00037658942,0.0007630992,0.0015047365,0.0041992837,0.0049539264,0.0017280468,0.0050232774,0.004440225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028889302,0.000022323306,0.00019135342,0.0001743295,0.000020474079,0.00033957354,0.0002463178,0.0009250323,0.001390901,0.8907644,0.087338164,0.01855829],"study_design_scores_gemma":[0.0000043617697,0.00001175167,0.0002653294,0.0000520585,0.0000075411203,0.00020681853,0.00009570679,0.001147362,0.0002985834,0.9108696,0.08702366,0.000017230072],"about_ca_topic_score_codex":0.00090637576,"about_ca_topic_score_gemma":0.0018270488,"teacher_disagreement_score":0.013680596,"about_ca_system_score_codex":0.00070285494,"about_ca_system_score_gemma":0.0003580381,"threshold_uncertainty_score":0.045766175},"labels":[],"label_agreement":null},{"id":"W2399040079","doi":"","title":"An implicit σ3 type condition for heavy cycles in weighted graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Combinatorics; Discrete mathematics","score_opus":0.02015552652005673,"score_gpt":0.31311620029136245,"score_spread":0.2929606737713057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399040079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2610964,0.0010744298,0.40821135,0.0055214106,0.0031345526,0.00030731643,0.0023299027,0.001969991,0.31635466],"genre_scores_gemma":[0.8734734,0.0005884752,0.071297966,0.0024580345,0.0008983827,0.0004393752,0.0016528089,0.0009827361,0.048208803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842924,0.00035157707,0.0001411393,0.00033947962,0.0003743047,0.0003641338],"domain_scores_gemma":[0.9937324,0.0027714646,0.00045880282,0.0010648381,0.0012243432,0.000748157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016064148,0.0005364696,0.0007680656,0.0014493832,0.0027096444,0.0033143503,0.0020150975,0.002992008,0.02792932],"category_scores_gemma":[0.013289412,0.00072240114,0.0012643075,0.0016337398,0.00263538,0.008427581,0.003265515,0.004132304,0.0043776287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011167963,0.00003336741,0.0005682068,0.000090932845,0.000008274489,0.00020115929,0.00022491955,0.00041461358,0.0018996628,0.9817963,0.0057558515,0.008895012],"study_design_scores_gemma":[0.000032413864,0.000019325158,0.00027785305,0.000047892663,0.000014017111,0.00021370253,0.00018312201,0.0036636684,0.0017661997,0.9846827,0.009075717,0.000023296321],"about_ca_topic_score_codex":0.0015615625,"about_ca_topic_score_gemma":0.0021073723,"teacher_disagreement_score":0.02792932,"about_ca_system_score_codex":0.0012764254,"about_ca_system_score_gemma":0.0013888294,"threshold_uncertainty_score":0.09343284},"labels":[],"label_agreement":null},{"id":"W2399054797","doi":"","title":"Isolated toughness and fractional (g, f)-factors of graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Toughness; Combinatorics; Composite material; Materials science","score_opus":0.019546276796687002,"score_gpt":0.2792752380993891,"score_spread":0.25972896130270207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399054797","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76748013,0.0020131809,0.10305549,0.0022686776,0.00040278825,0.00006167069,0.00042503985,0.00044574856,0.1238472],"genre_scores_gemma":[0.97849256,0.00035745063,0.008415567,0.00021035114,0.00016288536,0.00003403369,0.00016998661,0.000071555136,0.012085632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992514,0.00013647664,0.000031072304,0.00020973258,0.00016612539,0.00020504321],"domain_scores_gemma":[0.9969983,0.0012422543,0.000502358,0.00027062837,0.00024145182,0.00074491545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006057956,0.0006356491,0.0007130502,0.002451648,0.0031458044,0.00289311,0.0008215002,0.0011057995,0.011076751],"category_scores_gemma":[0.00504885,0.0005085623,0.0007335498,0.0012669904,0.0041980715,0.00417952,0.0021717947,0.0017223926,0.0008496135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086438544,0.000024194975,0.0008213917,0.00005165105,0.000015113719,0.000186309,0.0005999432,0.0011947076,0.0015263982,0.9868581,0.0021211372,0.0065145176],"study_design_scores_gemma":[0.000015617992,0.0000151366985,0.0006258251,0.00002649297,0.000015135023,0.00022174235,0.0003240492,0.0033841575,0.0005933482,0.99017274,0.00459029,0.000015339565],"about_ca_topic_score_codex":0.0031864734,"about_ca_topic_score_gemma":0.003210564,"teacher_disagreement_score":0.011076751,"about_ca_system_score_codex":0.0012940654,"about_ca_system_score_gemma":0.00048796574,"threshold_uncertainty_score":0.037055433},"labels":[],"label_agreement":null},{"id":"W2399073212","doi":"","title":"Small Randic Index Ordering of Trees with k Pendant Vertices","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Index (typography); Topological index; Computer science","score_opus":0.03309090112862159,"score_gpt":0.26681670660905,"score_spread":0.2337258054804284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399073212","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84138066,0.00066767295,0.064778134,0.00054394134,0.00018486423,0.00016982871,0.0013248057,0.0005415051,0.090408556],"genre_scores_gemma":[0.9431953,0.0002598517,0.036136743,0.00019916776,0.000070564216,0.00007983066,0.0014685163,0.00022908267,0.018360963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994597,0.000098448145,0.000038923426,0.00011832111,0.00012618673,0.00015841571],"domain_scores_gemma":[0.9980001,0.0005482131,0.00030889906,0.0003246169,0.00027843993,0.00053981727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031370408,0.00034002098,0.0006888591,0.0015804215,0.0021028286,0.0022844982,0.0008595269,0.00075927033,0.0073086596],"category_scores_gemma":[0.0019856724,0.00045879066,0.00043983478,0.0013652296,0.0009987287,0.0015498601,0.00080907595,0.0011284213,0.0010087813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014847241,0.00026098258,0.0065587326,0.00041388828,0.000043298187,0.0016400476,0.0012184544,0.014616791,0.05032347,0.8615704,0.011569342,0.05029981],"study_design_scores_gemma":[0.00025383016,0.0002788683,0.007475265,0.00009807971,0.00012324555,0.0014481867,0.0011457858,0.07720884,0.014503789,0.865492,0.031877145,0.00009498798],"about_ca_topic_score_codex":0.0017188091,"about_ca_topic_score_gemma":0.0045279157,"teacher_disagreement_score":0.0073086596,"about_ca_system_score_codex":0.00087795214,"about_ca_system_score_gemma":0.00086250546,"threshold_uncertainty_score":0.024449885},"labels":[],"label_agreement":null},{"id":"W2399076206","doi":"","title":"The harmonic index on bicyclic graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Bicyclic molecule; Harmonic; Combinatorics; Discrete mathematics; Computer science; Chemistry; Physics; Stereochemistry; Acoustics; World Wide Web","score_opus":0.022356351551239044,"score_gpt":0.272689249318243,"score_spread":0.25033289776700396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399076206","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4658087,0.0075397333,0.066526085,0.0036506096,0.0014602416,0.0000720026,0.0013973092,0.00032561462,0.45321974],"genre_scores_gemma":[0.95907575,0.0025160993,0.0058404785,0.00038326744,0.0006374622,0.00005466123,0.00047092914,0.00011712721,0.030904174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961877,0.00006923535,0.000016181115,0.00006737954,0.00013751956,0.000090888105],"domain_scores_gemma":[0.9988526,0.00045189826,0.00020440135,0.000121563746,0.00014890735,0.00022052588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003317157,0.0004128105,0.0005784533,0.003244253,0.0010466439,0.0022197436,0.00089847465,0.0008896175,0.0106093995],"category_scores_gemma":[0.0028999352,0.00025665088,0.00020437571,0.0020874667,0.0017206135,0.0031643242,0.0019366192,0.0013203708,0.0017172669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045406698,0.000011840098,0.00038852874,0.00006408491,0.0000061800033,0.000049151487,0.00016715641,0.001004395,0.0010113755,0.9766044,0.005297081,0.01535041],"study_design_scores_gemma":[0.000008379846,0.000011101111,0.00062722724,0.000031016007,0.000006548301,0.00013741454,0.00012826509,0.0049404833,0.00049186184,0.9865578,0.0070475806,0.00001250171],"about_ca_topic_score_codex":0.0013467554,"about_ca_topic_score_gemma":0.0015552167,"teacher_disagreement_score":0.0106093995,"about_ca_system_score_codex":0.0011987186,"about_ca_system_score_gemma":0.00034180577,"threshold_uncertainty_score":0.035491943},"labels":[],"label_agreement":null},{"id":"W2399130979","doi":"","title":"Erratum to: A note on the eigenvalues of graphs.","year":2011,"lang":"en","type":"erratum","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Pure mathematics; Physics; Quantum mechanics","score_opus":0.04054091030955258,"score_gpt":0.2947746094875079,"score_spread":0.2542336991779553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399130979","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023176195,0.0037064608,0.0015445192,0.057226367,0.9209559,0.000026870439,0.00060450623,0.00023673073,0.015466823],"genre_scores_gemma":[0.015719056,0.02836071,0.012738769,0.12030638,0.40615568,0.00025102973,0.003252595,0.0021648116,0.41105092],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964563,0.0006718556,0.00054606365,0.00047892632,0.0016005072,0.0002462457],"domain_scores_gemma":[0.98641425,0.005493065,0.00068914145,0.00095548877,0.0058572777,0.00059067784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025980386,0.0027645272,0.0016323669,0.0048212446,0.004308555,0.0039597023,0.0043082745,0.0052292706,0.04160201],"category_scores_gemma":[0.034687024,0.0009843347,0.0015368111,0.003984164,0.0035103108,0.00613505,0.0020341538,0.00936039,0.033317577],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026225925,0.000006836524,0.000033293512,0.000103334176,0.0000059994745,0.0001211179,0.000024961553,0.00005544626,0.00005275458,0.003938837,0.9900962,0.005535043],"study_design_scores_gemma":[0.000014320081,0.000020612502,0.00047423903,0.00025768933,0.000023085588,0.00048182343,0.000088497116,0.0002927671,0.00026673733,0.010112179,0.98792565,0.00004241925],"about_ca_topic_score_codex":0.008531502,"about_ca_topic_score_gemma":0.012438384,"teacher_disagreement_score":0.04160201,"about_ca_system_score_codex":0.0042862375,"about_ca_system_score_gemma":0.0028162946,"threshold_uncertainty_score":0.13917261},"labels":[],"label_agreement":null},{"id":"W2399152850","doi":"","title":"On the diameter of integral circulant graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Circulant matrix; Combinatorics; Pure mathematics","score_opus":0.03791610771237618,"score_gpt":0.28301306312267793,"score_spread":0.24509695541030174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399152850","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4909139,0.035505123,0.1988377,0.013204364,0.0025116298,0.00009152054,0.0017444679,0.00072690216,0.25646433],"genre_scores_gemma":[0.9468895,0.011211738,0.022885459,0.001024759,0.0033565918,0.00014558519,0.0006634867,0.00043813084,0.013384792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900454,0.00028162697,0.000037787104,0.00023933168,0.00022432991,0.00021236172],"domain_scores_gemma":[0.9857759,0.010318794,0.001119062,0.00058292394,0.00073935505,0.0014638895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001475688,0.00090535945,0.0014246921,0.0044311727,0.0017173103,0.0030855527,0.0019727938,0.0016988615,0.005935513],"category_scores_gemma":[0.015324778,0.00070461043,0.00056992256,0.0024139672,0.0040522185,0.0069304686,0.002499432,0.0033676194,0.0013487726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011423957,0.00003945861,0.0012723214,0.00017513502,0.000023302326,0.00011354356,0.0003535863,0.005510322,0.0021648325,0.96583265,0.011371939,0.013028726],"study_design_scores_gemma":[0.000022128033,0.000029870327,0.0013287372,0.00008725414,0.000031829168,0.00032804837,0.00020766252,0.022861795,0.0008748132,0.965124,0.009078423,0.000025396881],"about_ca_topic_score_codex":0.0015168822,"about_ca_topic_score_gemma":0.0013233898,"teacher_disagreement_score":0.005935513,"about_ca_system_score_codex":0.002548739,"about_ca_system_score_gemma":0.0005480933,"threshold_uncertainty_score":0.019856274},"labels":[],"label_agreement":null},{"id":"W2399212034","doi":"","title":"The distance spectral radius of graphs with given independence number.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Independence number; Spectral radius; Independence (probability theory); RADIUS; Combinatorics; Statistics; Graph; Computer science; Computer security; Physics; Eigenvalues and eigenvectors; Quantum mechanics","score_opus":0.021968393292283225,"score_gpt":0.27668511697224774,"score_spread":0.2547167236799645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399212034","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70491034,0.0024231984,0.17206234,0.0027626764,0.00028671237,0.000052021445,0.0017506387,0.0006358138,0.115116246],"genre_scores_gemma":[0.97957796,0.0006936327,0.012956282,0.000177702,0.0002197619,0.000061072955,0.0005614177,0.00011999897,0.005632191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894255,0.00038995722,0.00004085799,0.00023032614,0.00025239412,0.0001439362],"domain_scores_gemma":[0.9915093,0.005239481,0.0010472358,0.0006279237,0.0006079577,0.00096807774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009773872,0.00057623704,0.00075470837,0.0025851696,0.0011094587,0.0022436269,0.0014705699,0.0010184204,0.0058263973],"category_scores_gemma":[0.0108826775,0.000385324,0.00037197044,0.0015605994,0.00219537,0.0033836304,0.0017377548,0.0014117655,0.0013533102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027940696,0.00005543621,0.0019138757,0.00016463723,0.000044540164,0.000108778,0.00033979738,0.013274216,0.0040296046,0.9568696,0.00751005,0.015410069],"study_design_scores_gemma":[0.00003217388,0.000046763635,0.003031716,0.000045373916,0.000038269347,0.000529646,0.00029199498,0.07142737,0.003231817,0.91453004,0.006760387,0.000034484267],"about_ca_topic_score_codex":0.00075753906,"about_ca_topic_score_gemma":0.00059869786,"teacher_disagreement_score":0.0058263973,"about_ca_system_score_codex":0.001231472,"about_ca_system_score_gemma":0.00037292822,"threshold_uncertainty_score":0.019491196},"labels":[],"label_agreement":null},{"id":"W2399231126","doi":"","title":"The extremal generalized θ-graphs with respect to Hosoya index.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Discrete mathematics; Computer science","score_opus":0.041818750121829305,"score_gpt":0.29623188556539204,"score_spread":0.25441313544356275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399231126","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6915611,0.0010690803,0.05631521,0.0018527333,0.0003550234,0.000059392638,0.000637811,0.00045463452,0.24769495],"genre_scores_gemma":[0.9803508,0.00038708223,0.0059420066,0.000244534,0.00017306964,0.000042239775,0.00025815354,0.00007736714,0.012524738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961615,0.00009122297,0.000013121264,0.00007557185,0.00009346654,0.00011054224],"domain_scores_gemma":[0.9990538,0.00026234423,0.00020351655,0.00014422239,0.00013783139,0.00019836082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041512342,0.00042296265,0.0005280242,0.0019508796,0.0015817779,0.0023198063,0.000755981,0.0010278764,0.010477699],"category_scores_gemma":[0.0024328332,0.00027583397,0.000358598,0.0010379921,0.0019050463,0.0026486143,0.0013407883,0.0014078008,0.0010398498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055738226,0.000010680837,0.0003488538,0.000026887417,0.000006940343,0.00008580734,0.00008383393,0.00096836983,0.0009304196,0.9909388,0.0015875337,0.004956198],"study_design_scores_gemma":[0.00001968351,0.00001587567,0.00094066514,0.000021383941,0.0000114432705,0.00019858986,0.00020121688,0.0053229704,0.0005864779,0.98891187,0.0037563576,0.000013338408],"about_ca_topic_score_codex":0.0012720205,"about_ca_topic_score_gemma":0.0015468068,"teacher_disagreement_score":0.010477699,"about_ca_system_score_codex":0.00087637367,"about_ca_system_score_gemma":0.00047605598,"threshold_uncertainty_score":0.035051346},"labels":[],"label_agreement":null},{"id":"W2399302252","doi":"","title":"The Minimal Limit Point of the Third Largest Laplacian Eigenvalues of Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Limit (mathematics); Laplace operator; Point (geometry); Pure mathematics; Combinatorics; Mathematical analysis; Geometry; Physics; Quantum mechanics","score_opus":0.024939416277588812,"score_gpt":0.2732886954738027,"score_spread":0.24834927919621388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399302252","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6446857,0.0026722748,0.19580688,0.0057910616,0.00086155045,0.000082367405,0.0006697416,0.0012473771,0.14818312],"genre_scores_gemma":[0.9688975,0.00059920544,0.015308267,0.000366382,0.00030798014,0.00012413131,0.00021330801,0.00022676654,0.0139565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971014,0.00007450534,0.000010856474,0.0000543022,0.000084944426,0.00006519895],"domain_scores_gemma":[0.99816173,0.0006657257,0.0002712772,0.00014328075,0.0002933248,0.00046469737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057607563,0.00060074904,0.00060094206,0.002627112,0.0011964315,0.00259383,0.0012481065,0.001578262,0.009012189],"category_scores_gemma":[0.0057211095,0.00035573356,0.0005214675,0.0007320386,0.0023368173,0.0021829035,0.0014976114,0.0016812074,0.001989954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014861254,0.00006316894,0.0009163786,0.00012186936,0.000025381993,0.00032988953,0.00031054497,0.0029398443,0.0070956307,0.9709383,0.0068425434,0.010267764],"study_design_scores_gemma":[0.000044045402,0.000039789502,0.0013002586,0.00006125079,0.000014468971,0.0005130256,0.00027936912,0.031361103,0.0029000975,0.95990855,0.0035468123,0.00003125164],"about_ca_topic_score_codex":0.00071391335,"about_ca_topic_score_gemma":0.00079344056,"teacher_disagreement_score":0.009012189,"about_ca_system_score_codex":0.0011040664,"about_ca_system_score_gemma":0.0005764977,"threshold_uncertainty_score":0.030148804},"labels":[],"label_agreement":null},{"id":"W2399542805","doi":"","title":"The minimal positive index of inertia of signed unicyclic graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Inertia; Index (typography); Combinatorics; Discrete mathematics; Computer science; Physics; World Wide Web","score_opus":0.0122693109654104,"score_gpt":0.26219302744891565,"score_spread":0.24992371648350525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399542805","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6733587,0.0019034022,0.061562154,0.0019037841,0.0010987121,0.00007688932,0.00096502464,0.0004111764,0.25872013],"genre_scores_gemma":[0.9829726,0.00053416454,0.0045624245,0.00018837421,0.0004801811,0.000055710294,0.00032808926,0.000086337815,0.010792073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993925,0.0001026555,0.00003878527,0.000117100826,0.00020130526,0.00014753758],"domain_scores_gemma":[0.9973609,0.0009444375,0.000586713,0.00019883276,0.000293448,0.0006156477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052466587,0.0005537682,0.0007185401,0.0032885706,0.0011133432,0.00341136,0.0009786759,0.0009735623,0.008757914],"category_scores_gemma":[0.0041705593,0.00034987828,0.00040016393,0.0012492654,0.0029791726,0.0031708041,0.0018232188,0.0013301698,0.0012506464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013020066,0.00003586304,0.0006779015,0.000094590476,0.000010504742,0.00013328523,0.0002938323,0.0006691748,0.0039487365,0.97678876,0.0042820307,0.012935072],"study_design_scores_gemma":[0.0000344939,0.00005096409,0.0014186447,0.00005283813,0.000021516098,0.00043171912,0.0002147943,0.0053711156,0.0022119896,0.9838157,0.0063467044,0.000029488187],"about_ca_topic_score_codex":0.00049888244,"about_ca_topic_score_gemma":0.0005887339,"teacher_disagreement_score":0.008757914,"about_ca_system_score_codex":0.0010744552,"about_ca_system_score_gemma":0.00049613265,"threshold_uncertainty_score":0.029298186},"labels":[],"label_agreement":null},{"id":"W2399973576","doi":"","title":"Extremal Tricyclic Graphs With Respect To Schultz Index.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tricyclic; Mathematics; Index (typography); Combinatorics; Computer science; Chemistry; Stereochemistry; World Wide Web","score_opus":0.0485138608039807,"score_gpt":0.30325052075040443,"score_spread":0.25473665994642375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399973576","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6548159,0.0010940493,0.037461746,0.0016213849,0.00029295497,0.00007015828,0.0012259433,0.0004695059,0.30294833],"genre_scores_gemma":[0.9784534,0.00046708647,0.0045545804,0.00018006533,0.00017134991,0.000038509246,0.00039432605,0.00008150403,0.015659098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951696,0.00009851532,0.000023959,0.000087082095,0.0001613576,0.00011216369],"domain_scores_gemma":[0.9983316,0.00054729567,0.0004302072,0.00023646114,0.00021651681,0.00023789337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003902153,0.0003462138,0.0005746432,0.0023640932,0.0013115016,0.0031993736,0.00074983935,0.0008312002,0.012492364],"category_scores_gemma":[0.0032698493,0.0002658858,0.00029289632,0.0014296168,0.0014303494,0.002379391,0.0018052574,0.0012898552,0.0015827442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007849535,0.000015933936,0.00049381517,0.000031266052,0.0000086261225,0.00010122389,0.00011299699,0.0013662406,0.001060611,0.9870072,0.0026756017,0.0070480383],"study_design_scores_gemma":[0.0000281982,0.000027024125,0.0011944716,0.000029969658,0.000020392421,0.00042899945,0.00021363137,0.008339984,0.0011736797,0.98221684,0.0063043265,0.000022398637],"about_ca_topic_score_codex":0.000806427,"about_ca_topic_score_gemma":0.0011011763,"teacher_disagreement_score":0.012492364,"about_ca_system_score_codex":0.00091349194,"about_ca_system_score_gemma":0.00041619744,"threshold_uncertainty_score":0.04179108},"labels":[],"label_agreement":null},{"id":"W2400049355","doi":"","title":"On the spectral radius of unicyclic graphs with fixed maximum degree.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Degree (music); Combinatorics; RADIUS; Eigenvalues and eigenvectors; Physics; Computer science; Quantum mechanics; Computer network","score_opus":0.057575284925403335,"score_gpt":0.25557179738454866,"score_spread":0.19799651245914532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400049355","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6587057,0.02005911,0.17146848,0.005742068,0.00069729507,0.00010585135,0.0013480213,0.0007536024,0.14111982],"genre_scores_gemma":[0.9797672,0.003942875,0.010465873,0.00030037249,0.0005243052,0.00010544579,0.00034005806,0.00021404527,0.004339842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986959,0.00060729345,0.000047062345,0.00021157517,0.00023141559,0.00020673632],"domain_scores_gemma":[0.9834003,0.012138571,0.0016364489,0.0008063399,0.00081318046,0.0012052106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001820047,0.0008232787,0.0014256564,0.004586482,0.0012798547,0.0022317932,0.0025018086,0.0015323076,0.00574154],"category_scores_gemma":[0.021159327,0.0006329034,0.00043342856,0.0023090579,0.0033790008,0.0048825415,0.0026417798,0.0017631776,0.0014522439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044252013,0.000076318385,0.001962661,0.0003675316,0.00006391739,0.00021613901,0.0005619243,0.0374318,0.0045033693,0.91719824,0.013375453,0.023800146],"study_design_scores_gemma":[0.000051948366,0.00006392025,0.0016767619,0.00015635311,0.000047606896,0.0004392599,0.00044960048,0.08591065,0.001863528,0.9035513,0.005733314,0.000055802506],"about_ca_topic_score_codex":0.0011025734,"about_ca_topic_score_gemma":0.00092719716,"teacher_disagreement_score":0.00574154,"about_ca_system_score_codex":0.0015904965,"about_ca_system_score_gemma":0.00042874168,"threshold_uncertainty_score":0.019207358},"labels":[],"label_agreement":null},{"id":"W2400107404","doi":"","title":"Chromaticity of Turán Graphs with Certain Matching or Star Deleted.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chromaticity; Mathematics; Star (game theory); Matching (statistics); Combinatorics; Computer science; Artificial intelligence; Statistics; Mathematical analysis","score_opus":0.01853201430150369,"score_gpt":0.27499117706498644,"score_spread":0.25645916276348274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400107404","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8761088,0.00022627389,0.024699189,0.0007699319,0.000067398105,0.00003736178,0.00085743394,0.00028474283,0.09694884],"genre_scores_gemma":[0.9845836,0.00012411001,0.0054856404,0.00012360353,0.000029895371,0.000023856614,0.00051450863,0.00006358173,0.0090512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999734,0.00006843531,0.000010589279,0.00006656869,0.000041038144,0.00007936425],"domain_scores_gemma":[0.9988073,0.00041076625,0.00026902676,0.0001632902,0.00014905534,0.00020062791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030118637,0.00024635918,0.00022795136,0.0011269393,0.0015273788,0.0016357164,0.000813284,0.00066537946,0.010192569],"category_scores_gemma":[0.001674189,0.00029435538,0.00032356294,0.00092796964,0.0012582415,0.0014750487,0.00075303053,0.00075718254,0.0008200239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026105568,0.00004275706,0.0030660576,0.00009397807,0.000025700947,0.00023625948,0.00057638146,0.0068731173,0.0076427865,0.966155,0.0064171636,0.00860986],"study_design_scores_gemma":[0.000064667904,0.00006855559,0.008309322,0.00005022671,0.00008069854,0.00076248404,0.0009775658,0.057290144,0.008102946,0.90508944,0.01914911,0.00005487592],"about_ca_topic_score_codex":0.003286533,"about_ca_topic_score_gemma":0.004802607,"teacher_disagreement_score":0.010192569,"about_ca_system_score_codex":0.0010273884,"about_ca_system_score_gemma":0.00044460665,"threshold_uncertainty_score":0.034097552},"labels":[],"label_agreement":null},{"id":"W2400134062","doi":"","title":"Double hexagonal chains with the extremal third order Randic index.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hexagonal crystal system; Index (typography); Order (exchange); Combinatorics; Pure mathematics; Crystallography; Chemistry; Computer science; Business","score_opus":0.019736589355187253,"score_gpt":0.26059800711887743,"score_spread":0.2408614177636902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400134062","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58543116,0.0013840953,0.08152802,0.0011201516,0.00059525593,0.00009082201,0.0006288376,0.00043454414,0.32878712],"genre_scores_gemma":[0.9629783,0.00035553516,0.01420882,0.00023768158,0.00011889218,0.00005490579,0.00022676814,0.000083854226,0.02173529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997423,0.000055403314,0.000010369309,0.000040803363,0.00008266911,0.00006835174],"domain_scores_gemma":[0.99936265,0.00014496136,0.00010647841,0.00014898894,0.000086690336,0.00015021003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019659124,0.0002515554,0.0003887724,0.0010651919,0.0011395682,0.0020191772,0.00048077313,0.0009052904,0.012086838],"category_scores_gemma":[0.0012600626,0.00025910093,0.00021558776,0.00045721175,0.0010986531,0.0012240462,0.0010613453,0.0008673994,0.0012992425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010178863,0.000022976768,0.00054616114,0.00004666507,0.00000797725,0.00024596337,0.00009913529,0.0014241644,0.0046666055,0.98060554,0.0026390848,0.009593862],"study_design_scores_gemma":[0.0000543244,0.00005719182,0.0012723815,0.000057015157,0.000015229067,0.0008547912,0.0002936436,0.021033648,0.0066131996,0.9519731,0.017740123,0.000035405195],"about_ca_topic_score_codex":0.00073531386,"about_ca_topic_score_gemma":0.0016028923,"teacher_disagreement_score":0.012086838,"about_ca_system_score_codex":0.00046958664,"about_ca_system_score_gemma":0.00035452694,"threshold_uncertainty_score":0.04043448},"labels":[],"label_agreement":null},{"id":"W2400149291","doi":"","title":"Vertex PI indices of some sums of graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Pi; Combinatorics; Discrete mathematics; Graph; Geometry","score_opus":0.04150821381278157,"score_gpt":0.27329420567182866,"score_spread":0.23178599185904708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400149291","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53847617,0.0012855585,0.14129628,0.0018146023,0.0010256874,0.000105687104,0.0018336003,0.0007135748,0.31344882],"genre_scores_gemma":[0.89279824,0.00063170213,0.05450381,0.00040373934,0.00037947446,0.00014439506,0.0011680725,0.00037369528,0.049597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943644,0.00011969274,0.00003978752,0.00010362792,0.00018804075,0.0001124214],"domain_scores_gemma":[0.99911696,0.00030626458,0.00016036279,0.00010547685,0.00016057811,0.00015046426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042767098,0.0005908903,0.0005325777,0.003101728,0.0020660746,0.002569245,0.00097414776,0.0008550293,0.009933482],"category_scores_gemma":[0.0024166855,0.00042133042,0.0005860343,0.001960745,0.0014741549,0.0026859152,0.0013266836,0.0017656385,0.0018380833],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009348568,0.000038945294,0.0009875017,0.00008423076,0.00002815942,0.00040797662,0.00037217437,0.0011836924,0.004141633,0.971686,0.0057098176,0.01526644],"study_design_scores_gemma":[0.0000112915795,0.000015996036,0.0011773948,0.000030652103,0.000027751772,0.0006110144,0.00021680846,0.00821547,0.002376979,0.9749435,0.012355337,0.000017758814],"about_ca_topic_score_codex":0.0006628478,"about_ca_topic_score_gemma":0.0011999073,"teacher_disagreement_score":0.009933482,"about_ca_system_score_codex":0.0007042808,"about_ca_system_score_gemma":0.00037437584,"threshold_uncertainty_score":0.03323078},"labels":[],"label_agreement":null},{"id":"W2400212675","doi":"","title":"Some Results On Q-Integral Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Cograph; Spectrum (functional analysis); Integral graph; Discrete mathematics; 1-planar graph; Laplace operator; Graph; Chordal graph; Line graph; Mathematical analysis; Voltage graph; Physics","score_opus":0.026300480505964258,"score_gpt":0.29257539447563224,"score_spread":0.26627491396966796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400212675","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17473227,0.015914857,0.3454576,0.0076618656,0.0015749804,0.00013838279,0.0013328003,0.0007952994,0.45239195],"genre_scores_gemma":[0.8408577,0.018797101,0.09124407,0.004626051,0.003534758,0.0001775047,0.0025423174,0.00048016556,0.037740305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951303,0.00011194375,0.000027983724,0.00010386016,0.0001472485,0.0000959009],"domain_scores_gemma":[0.99860376,0.0006561242,0.00018601687,0.00013663096,0.00020183892,0.0002155906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010995032,0.0010701765,0.00058962876,0.003995941,0.0016087735,0.0015885185,0.0011884691,0.0012572064,0.014829746],"category_scores_gemma":[0.0029916253,0.00041293722,0.0010293787,0.0032344423,0.0021077923,0.0034115906,0.001642532,0.0021908206,0.0021771374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041827996,0.00008348261,0.00067028403,0.00051261537,0.00002515391,0.0003119736,0.00038086696,0.0037257625,0.0026985821,0.95693773,0.008653831,0.025957853],"study_design_scores_gemma":[0.000008992937,0.000026660875,0.0005102122,0.00006209839,0.000022392887,0.0003588785,0.00016059885,0.004729439,0.00095799146,0.9783855,0.014762572,0.000014499621],"about_ca_topic_score_codex":0.0007922367,"about_ca_topic_score_gemma":0.0008597837,"teacher_disagreement_score":0.014829746,"about_ca_system_score_codex":0.001077047,"about_ca_system_score_gemma":0.0004000928,"threshold_uncertainty_score":0.049610496},"labels":[],"label_agreement":null},{"id":"W2400380025","doi":"","title":"Harmonic index of dense graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Harmonic; Acoustics; Physics; Computer science; World Wide Web","score_opus":0.04523533579060618,"score_gpt":0.2955165771363827,"score_spread":0.2502812413457765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400380025","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53315306,0.0027559255,0.111318015,0.0024692873,0.00069343584,0.00007771131,0.0015172401,0.00032814898,0.3476872],"genre_scores_gemma":[0.9568369,0.0011343359,0.010348063,0.0002642581,0.0004926801,0.000058937585,0.0006968408,0.0001337287,0.030034294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971646,0.000045699857,0.000011095666,0.000054640568,0.00010667195,0.000065432316],"domain_scores_gemma":[0.99896526,0.00043173053,0.00015539126,0.00010778544,0.00015259557,0.00018723629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035377705,0.00034542358,0.000540466,0.0029863408,0.0009093228,0.0020822939,0.0008635737,0.00063398766,0.010311001],"category_scores_gemma":[0.0025947934,0.0002606955,0.00025663816,0.0015787835,0.0014531403,0.0032865645,0.0017716257,0.001225687,0.0012973828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025686559,0.000014220235,0.00041534635,0.000038161845,0.0000057617526,0.000033902346,0.00014121465,0.0005628685,0.0009841103,0.9828925,0.003318996,0.011567278],"study_design_scores_gemma":[0.000009962105,0.000011461272,0.00097250845,0.000017626748,0.000009123852,0.00015301399,0.00015020977,0.006576394,0.00066403236,0.98492426,0.0065028304,0.000008480505],"about_ca_topic_score_codex":0.0011378201,"about_ca_topic_score_gemma":0.0013309537,"teacher_disagreement_score":0.010311001,"about_ca_system_score_codex":0.0011266759,"about_ca_system_score_gemma":0.00030780907,"threshold_uncertainty_score":0.034493744},"labels":[],"label_agreement":null},{"id":"W2400448798","doi":"","title":"The Laplacian spectral radius of graphs with given connectivity.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Laplace operator; RADIUS; Mathematical analysis; Computer science; Physics; Eigenvalues and eigenvectors; Computer network; Quantum mechanics","score_opus":0.017640763127289433,"score_gpt":0.2621161787030781,"score_spread":0.24447541557578864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400448798","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69345975,0.004492761,0.15595892,0.0046615303,0.00046620012,0.00005767285,0.0014601942,0.0008143417,0.13862856],"genre_scores_gemma":[0.9839019,0.0011316095,0.008868499,0.00018535381,0.00027310645,0.000053130538,0.00035266427,0.00010088301,0.005132926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956924,0.00017045763,0.00001592835,0.00008524153,0.00009924128,0.000059827868],"domain_scores_gemma":[0.99726045,0.0016204261,0.00036240707,0.00018679025,0.0002606467,0.00030938923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051882595,0.00046042172,0.00046056684,0.0025561082,0.00067471334,0.0016774478,0.0008514743,0.0009986507,0.004796708],"category_scores_gemma":[0.006911538,0.00022928166,0.00022026313,0.0011603682,0.0015477254,0.0024545232,0.0011576931,0.0008254282,0.0009518004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015798959,0.000041954077,0.0015955836,0.00017808247,0.000034881836,0.00016897709,0.00039901724,0.014597826,0.0051575084,0.94250435,0.012790319,0.022373546],"study_design_scores_gemma":[0.000025486821,0.000030178155,0.0022291844,0.000054653916,0.000027359618,0.0005132177,0.00041311435,0.08118265,0.002151418,0.90607166,0.007273036,0.000028131495],"about_ca_topic_score_codex":0.0006820896,"about_ca_topic_score_gemma":0.0005750062,"teacher_disagreement_score":0.004796708,"about_ca_system_score_codex":0.00079692283,"about_ca_system_score_gemma":0.00021926052,"threshold_uncertainty_score":0.016046584},"labels":[],"label_agreement":null},{"id":"W2400630495","doi":"","title":"Ordering graphs with maximum degree 3 by their indices.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Statistics; Discrete mathematics; Physics","score_opus":0.02415026922201394,"score_gpt":0.2552164991330755,"score_spread":0.23106622991106154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400630495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27878153,0.002254801,0.38113984,0.0023600461,0.0013511947,0.00041000152,0.0044829864,0.0021726945,0.32704693],"genre_scores_gemma":[0.62424946,0.0020796012,0.29642266,0.0011738216,0.00037413798,0.0003126863,0.0034205357,0.0008751399,0.071091905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919206,0.00021502092,0.000059965205,0.0001388829,0.00018717168,0.00020697479],"domain_scores_gemma":[0.9976591,0.0007262076,0.0003859238,0.00057170686,0.00035526158,0.00030184895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064721756,0.00071107823,0.0006854221,0.0017902682,0.0017854697,0.0019920971,0.0010021175,0.0011115045,0.011285074],"category_scores_gemma":[0.0034266133,0.00048721652,0.000831382,0.0020368795,0.00151789,0.0031786738,0.0017888279,0.002359921,0.004372727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003599998,0.00013408162,0.0015683229,0.00018386691,0.000039239025,0.00038971278,0.0009645042,0.0027002997,0.02226797,0.8813405,0.017345123,0.07270642],"study_design_scores_gemma":[0.000044425637,0.00006423831,0.0010763383,0.000072661496,0.000036262365,0.00049303577,0.0003957619,0.00531065,0.0075305053,0.9360045,0.04893037,0.000041200354],"about_ca_topic_score_codex":0.0015615039,"about_ca_topic_score_gemma":0.0040218746,"teacher_disagreement_score":0.011285074,"about_ca_system_score_codex":0.00089930714,"about_ca_system_score_gemma":0.0010320486,"threshold_uncertainty_score":0.03775233},"labels":[],"label_agreement":null},{"id":"W2400831820","doi":"","title":"New Classes of Integral Trees of Diameter 4.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.0210714781534549,"score_gpt":0.2901142003455186,"score_spread":0.2690427221920637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400831820","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6725677,0.0038798386,0.099689305,0.0028285505,0.0007228894,0.00013219357,0.0012423359,0.0009341502,0.21800311],"genre_scores_gemma":[0.93746567,0.0014964727,0.027999615,0.0005093191,0.00070588465,0.00011295209,0.0013647225,0.00025374748,0.030091764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993057,0.00006997012,0.000035863977,0.00017624842,0.00022741345,0.00018472684],"domain_scores_gemma":[0.9970656,0.0013211383,0.00041835028,0.00027953525,0.00027373253,0.00064155814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053808995,0.0005028213,0.0007468972,0.0032766294,0.0015955279,0.0042263707,0.0013969976,0.0015911554,0.011420519],"category_scores_gemma":[0.0038842533,0.0006921976,0.0008384866,0.0015485715,0.002206431,0.0049214973,0.002809289,0.002868705,0.0010819146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112123256,0.0000565688,0.0020735073,0.00009370214,0.000013947996,0.0003264764,0.00059083314,0.0008569596,0.0021801337,0.9724583,0.005144811,0.016092632],"study_design_scores_gemma":[0.000065412554,0.0000516797,0.0038485467,0.00008355644,0.00005608982,0.0025434983,0.00048532733,0.008717665,0.0020953498,0.935979,0.0460421,0.00003182273],"about_ca_topic_score_codex":0.0003915301,"about_ca_topic_score_gemma":0.00062605634,"teacher_disagreement_score":0.011420519,"about_ca_system_score_codex":0.0015895588,"about_ca_system_score_gemma":0.0003770381,"threshold_uncertainty_score":0.038205445},"labels":[],"label_agreement":null},{"id":"W2400834481","doi":"","title":"Wiener index of a type of composite graph.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Composite number; Type (biology); Index (typography); Graph; Statistics; Combinatorics; Algorithm; Computer science; Geology; Programming language","score_opus":0.033276809688583646,"score_gpt":0.3019251897283568,"score_spread":0.26864838003977315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400834481","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5269454,0.000981188,0.17996566,0.0012201549,0.00083097897,0.00008111525,0.0009814904,0.0005924908,0.2884015],"genre_scores_gemma":[0.9276309,0.00059490243,0.029821744,0.00024826007,0.00035017217,0.00006592387,0.0005431997,0.0002506995,0.040494144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964714,0.000056734374,0.000019312472,0.00008146876,0.00011978615,0.000075532545],"domain_scores_gemma":[0.9987305,0.00034952487,0.00022978299,0.00016943346,0.00022139886,0.0002992694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041519408,0.00036810013,0.00052721275,0.0039051736,0.0014181486,0.0025370244,0.00072867685,0.0010141429,0.008535796],"category_scores_gemma":[0.0018586718,0.00030398433,0.0005688312,0.0015380848,0.0015168482,0.003294659,0.0013440141,0.0012236078,0.0011848898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004412541,0.00001273244,0.0005118095,0.000032573203,0.000010527105,0.0001296793,0.000112249705,0.0004535108,0.0025625033,0.9901508,0.0016008638,0.004378566],"study_design_scores_gemma":[0.000012991004,0.000028488219,0.0014930234,0.00002976184,0.000025142803,0.0006063786,0.00016773182,0.009348008,0.0022554777,0.9762872,0.009721415,0.000024453468],"about_ca_topic_score_codex":0.00072809553,"about_ca_topic_score_gemma":0.0013075897,"teacher_disagreement_score":0.008535796,"about_ca_system_score_codex":0.0009479175,"about_ca_system_score_gemma":0.00035684934,"threshold_uncertainty_score":0.028555095},"labels":[],"label_agreement":null},{"id":"W2401099273","doi":"","title":"The sum numbers and the integral sum numbers of the graph K n \\E(C n-1 ).","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.02287627913084229,"score_gpt":0.25440049601957365,"score_spread":0.23152421688873137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401099273","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3486868,0.004311166,0.15356606,0.0056678015,0.0022037094,0.000090290574,0.0013568894,0.00054855505,0.48356873],"genre_scores_gemma":[0.89147615,0.002499317,0.04169136,0.00071450043,0.0010746062,0.00018059165,0.0009077731,0.00041290282,0.061042726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920744,0.00017043023,0.00004290538,0.00018624864,0.00024265793,0.00015039295],"domain_scores_gemma":[0.9980204,0.00083431735,0.00024819115,0.000203213,0.000338559,0.00035527063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008378126,0.0008455125,0.0007488143,0.003995922,0.0024285447,0.004167554,0.0014986186,0.0011518388,0.01270779],"category_scores_gemma":[0.006094465,0.00040688133,0.00061934796,0.002079633,0.004468541,0.007975177,0.0021805512,0.002898994,0.002260885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051555347,0.000013350096,0.0002148707,0.000055731864,0.00000680736,0.000044907076,0.000110579385,0.00053582044,0.00074350415,0.98563194,0.0028687841,0.009722115],"study_design_scores_gemma":[0.0000056443523,0.000009227681,0.00037707007,0.000024355888,0.000011238171,0.00017658144,0.00007004485,0.00277316,0.0009428033,0.98931444,0.006281319,0.000014230312],"about_ca_topic_score_codex":0.00077098527,"about_ca_topic_score_gemma":0.0009545083,"teacher_disagreement_score":0.01270779,"about_ca_system_score_codex":0.0012451872,"about_ca_system_score_gemma":0.00066643674,"threshold_uncertainty_score":0.04251182},"labels":[],"label_agreement":null},{"id":"W2401120393","doi":"","title":"Enumeration of Highly Irregular Trees by Automorphism Group.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enumeration; Mathematics; Combinatorics; Automorphism; Automorphism group; Group (periodic table); Physics","score_opus":0.010890429732252231,"score_gpt":0.252166731711059,"score_spread":0.24127630197880678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401120393","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57158214,0.0009486106,0.32309476,0.001237586,0.0003017028,0.00013368721,0.0012412886,0.0010362878,0.10042388],"genre_scores_gemma":[0.89459455,0.0005362995,0.075266875,0.00021356833,0.00012462607,0.00008262969,0.0017032918,0.0002802552,0.0271978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963415,0.00009980298,0.00002277529,0.000068736925,0.00010977323,0.00006480402],"domain_scores_gemma":[0.99886835,0.0004341058,0.00015108501,0.00031379942,0.00012595006,0.00010670868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024374963,0.00028056547,0.00044160595,0.0011077273,0.0007429467,0.0013240675,0.00058902823,0.0005873308,0.006018137],"category_scores_gemma":[0.0018796669,0.0002469989,0.00037770616,0.0011978237,0.00089500955,0.0017672832,0.001399839,0.00084545807,0.0013408189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015266125,0.000077028366,0.003084217,0.00015288708,0.0000249737,0.00030985422,0.00066853105,0.0063780067,0.012289838,0.9006406,0.010242518,0.065978944],"study_design_scores_gemma":[0.000013944853,0.00002866988,0.0008974418,0.000027991055,0.0000155667,0.00041133576,0.00020562796,0.019964118,0.0034058974,0.960401,0.014618815,0.000009689737],"about_ca_topic_score_codex":0.00043455986,"about_ca_topic_score_gemma":0.0009263195,"teacher_disagreement_score":0.006018137,"about_ca_system_score_codex":0.00045314681,"about_ca_system_score_gemma":0.00029829415,"threshold_uncertainty_score":0.02013266},"labels":[],"label_agreement":null},{"id":"W2401120511","doi":"","title":"On the least signless Laplacian eigenvalue of non-bipartite unicyclic graphs with both given order and diameter","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Order (exchange); Eigenvalues and eigenvectors; Laplacian matrix; Discrete mathematics; Graph; Physics; Quantum mechanics","score_opus":0.015044048639272542,"score_gpt":0.2484579200891741,"score_spread":0.23341387144990156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401120511","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.852148,0.0010926794,0.08207241,0.0037784923,0.00044265488,0.00006458036,0.00038737833,0.0003736078,0.059640113],"genre_scores_gemma":[0.97904575,0.00069801783,0.009105153,0.0003624568,0.0005766019,0.00007179058,0.0002616673,0.0001411744,0.009737409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994319,0.00021170545,0.000019443298,0.00012354263,0.00011628979,0.00009710002],"domain_scores_gemma":[0.9928899,0.0048146234,0.0007678009,0.00023362758,0.00045591305,0.0008381635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009246719,0.001120294,0.0011937375,0.002366027,0.0014545545,0.0025609233,0.0016786796,0.0017269432,0.0065572322],"category_scores_gemma":[0.007762989,0.0005748398,0.00047255817,0.0014077117,0.00315697,0.003266072,0.0014681163,0.0016441521,0.0007857438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005934084,0.00019824538,0.0023184207,0.0003904638,0.000047087044,0.00057831703,0.0009627221,0.039335273,0.01328167,0.91426915,0.0107371975,0.017287968],"study_design_scores_gemma":[0.00008010163,0.00008505252,0.0012463882,0.000063333224,0.000022866963,0.000266346,0.00049465144,0.099762514,0.0015733368,0.8950757,0.0012754211,0.000054436518],"about_ca_topic_score_codex":0.0012768486,"about_ca_topic_score_gemma":0.0017240347,"teacher_disagreement_score":0.0065572322,"about_ca_system_score_codex":0.0013118052,"about_ca_system_score_gemma":0.00066449447,"threshold_uncertainty_score":0.021936119},"labels":[],"label_agreement":null},{"id":"W2401132194","doi":"","title":"The Extremal Matching Energy of Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Matching (statistics); Combinatorics; Statistics","score_opus":0.01598578697707676,"score_gpt":0.25710696701035235,"score_spread":0.2411211800332756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401132194","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4158281,0.009638693,0.19674285,0.007942206,0.0015169557,0.000059326674,0.0011090086,0.00053828623,0.3666246],"genre_scores_gemma":[0.96597767,0.0016650562,0.0094384905,0.0005741697,0.00057476637,0.0000662919,0.00032099694,0.00017362308,0.021208957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994937,0.00014222407,0.000018328732,0.00008763592,0.0001623451,0.00009568573],"domain_scores_gemma":[0.99878246,0.00057434855,0.0001590473,0.00018631524,0.00012027202,0.00017751692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070668163,0.00053931255,0.0006741963,0.0029194148,0.0010752077,0.0021983478,0.0012968656,0.0021173258,0.011142217],"category_scores_gemma":[0.0051152534,0.00038215582,0.00039334566,0.0012932848,0.0020274913,0.004026385,0.0020851663,0.0017419369,0.0016150883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029193883,0.000013309255,0.0002739102,0.0000623717,0.000012263142,0.000044548993,0.000056388613,0.002597167,0.00061445346,0.98462784,0.0032793016,0.008389245],"study_design_scores_gemma":[0.0000046857367,0.00000565739,0.00033749102,0.000019433568,0.0000049761343,0.0000950058,0.000051090694,0.010332668,0.00022019177,0.98679405,0.0021284176,0.000006252122],"about_ca_topic_score_codex":0.0003895255,"about_ca_topic_score_gemma":0.00048796102,"teacher_disagreement_score":0.011142217,"about_ca_system_score_codex":0.0009236078,"about_ca_system_score_gemma":0.00025760577,"threshold_uncertainty_score":0.03727448},"labels":[],"label_agreement":null},{"id":"W2401182739","doi":"","title":"Sharp upper bounds for the largest Laplacian eigenvalue of mixed graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Laplace operator; Combinatorics; Mathematical analysis; Physics","score_opus":0.026181749821378244,"score_gpt":0.2799468822940065,"score_spread":0.2537651324726283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401182739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123893164,0.020242693,0.5888955,0.013534054,0.0025987856,0.00019650412,0.0019380626,0.0022261664,0.24647507],"genre_scores_gemma":[0.8695444,0.007441767,0.08671487,0.0030452914,0.0030721102,0.0006421938,0.0011996672,0.00096212287,0.02737753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977943,0.000593374,0.00007793063,0.00039257348,0.000719259,0.000422654],"domain_scores_gemma":[0.976719,0.017388517,0.0011280805,0.0014485407,0.0014874297,0.0018283847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030276638,0.0032126247,0.0015768544,0.0060106334,0.002015134,0.004729222,0.004019171,0.0027599498,0.016527463],"category_scores_gemma":[0.03133944,0.0012799456,0.0013226815,0.002821495,0.004276314,0.00840571,0.0054346495,0.007931534,0.003733045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025709538,0.00015453131,0.0010082821,0.000617774,0.00010246384,0.0003367561,0.0004193276,0.012412116,0.00954819,0.9297129,0.023240702,0.022189893],"study_design_scores_gemma":[0.00003184623,0.000047173526,0.00078978314,0.0001492514,0.00007258908,0.0003892928,0.00016311437,0.06268454,0.002827765,0.9260429,0.006744986,0.000056861663],"about_ca_topic_score_codex":0.0007601405,"about_ca_topic_score_gemma":0.0016481291,"teacher_disagreement_score":0.016527463,"about_ca_system_score_codex":0.0020077676,"about_ca_system_score_gemma":0.0006912075,"threshold_uncertainty_score":0.055289924},"labels":[],"label_agreement":null},{"id":"W2401274613","doi":"","title":"Note on the nullity of bicyclic graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.027926279225377024,"score_gpt":0.2971773291335698,"score_spread":0.26925104990819276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401274613","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11428187,0.022223711,0.08900622,0.054372843,0.010034506,0.00008038636,0.0018024142,0.0006299073,0.7075681],"genre_scores_gemma":[0.9076725,0.0126869045,0.026864799,0.009599836,0.0042538606,0.00008023682,0.0010051306,0.0002706875,0.037565935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885905,0.00030177456,0.00004941259,0.00024608662,0.0003934137,0.0001502068],"domain_scores_gemma":[0.9889677,0.007596788,0.0005045134,0.0012104074,0.0009711038,0.00074949546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015100813,0.0006564307,0.0010429785,0.0021046104,0.0023511292,0.002805064,0.0017064363,0.0014359505,0.015329599],"category_scores_gemma":[0.009702426,0.00038028363,0.0005765191,0.002115342,0.0067923926,0.0052674618,0.0034792079,0.0040555317,0.0016182415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056881316,0.000018426605,0.00041689325,0.00013773887,0.000014894989,0.0002376542,0.00021164188,0.00032610397,0.00076749,0.9732367,0.017635513,0.0069400957],"study_design_scores_gemma":[0.000010842869,0.000021069343,0.0004230918,0.000046981382,0.000015696323,0.00041120447,0.0001409082,0.0006146866,0.0004588144,0.96938133,0.028456775,0.000018749204],"about_ca_topic_score_codex":0.0015267587,"about_ca_topic_score_gemma":0.0017357087,"teacher_disagreement_score":0.015329599,"about_ca_system_score_codex":0.0008915077,"about_ca_system_score_gemma":0.0006165575,"threshold_uncertainty_score":0.051282644},"labels":[],"label_agreement":null},{"id":"W2401418612","doi":"","title":"The Spectral Radius of Maximum Weighted Unicyclic Graph.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Graph; Combinatorics; Eigenvalues and eigenvectors; Physics; Quantum mechanics","score_opus":0.01432290461623151,"score_gpt":0.2584619999347652,"score_spread":0.2441390953185337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401418612","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63146305,0.0064981184,0.1813809,0.0030536077,0.00066281564,0.00009109418,0.0018616905,0.0006168524,0.17437184],"genre_scores_gemma":[0.97676814,0.0019830074,0.013193142,0.00022339386,0.00030042732,0.00010756166,0.00041931955,0.00012624449,0.006878719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935764,0.00024159152,0.000027485188,0.00013560886,0.0001371816,0.00010039541],"domain_scores_gemma":[0.9961494,0.00210349,0.00061808707,0.0002649463,0.00039932627,0.00046466893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058904145,0.0005645706,0.000751663,0.002829533,0.0008216998,0.0016452811,0.0011729398,0.00088126183,0.0054005138],"category_scores_gemma":[0.008639125,0.0003189061,0.0002866485,0.0016142128,0.0014871301,0.0027845826,0.0017045537,0.0008975048,0.001409755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021671336,0.00003288346,0.0012453486,0.00023959062,0.000040150266,0.00015368011,0.00030866457,0.010606607,0.0058330228,0.94439083,0.011245999,0.025686525],"study_design_scores_gemma":[0.000026469956,0.000043051605,0.0015095719,0.00008597755,0.00003601916,0.00054715347,0.00033238955,0.06140015,0.0031795606,0.921376,0.011432547,0.000031007254],"about_ca_topic_score_codex":0.0007094746,"about_ca_topic_score_gemma":0.00054743234,"teacher_disagreement_score":0.0054005138,"about_ca_system_score_codex":0.0007822817,"about_ca_system_score_gemma":0.00030528664,"threshold_uncertainty_score":0.018066525},"labels":[],"label_agreement":null},{"id":"W2401547246","doi":"","title":"On the spectra of tricyclic graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tricyclic; Mathematics; Spectral line; Combinatorics; Stereochemistry; Chemistry; Physics; Astronomy","score_opus":0.05034851632161588,"score_gpt":0.2708962132307848,"score_spread":0.2205476969091689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401547246","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30381364,0.014513197,0.18567155,0.0062555643,0.0021797207,0.00008354846,0.0013565285,0.00064773,0.4854785],"genre_scores_gemma":[0.9261466,0.007542684,0.019786857,0.0013044297,0.0015123079,0.00009054751,0.0006786468,0.0002623172,0.042675566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999458,0.00013783707,0.0000245921,0.000110085355,0.00015927135,0.000110249886],"domain_scores_gemma":[0.99831486,0.0007758447,0.00024993342,0.00016643791,0.00020222168,0.0002907799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044941824,0.0007418228,0.00066922064,0.0034741473,0.0012871161,0.002125323,0.00096288475,0.0009620874,0.012258734],"category_scores_gemma":[0.0031615037,0.00037776845,0.00048343925,0.0020181984,0.0024906264,0.004132288,0.0021365383,0.0020122766,0.0023919414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022574874,0.000015001409,0.00016076682,0.000056128898,0.000006333861,0.0000875874,0.00018645455,0.00075664977,0.00074545207,0.9845793,0.0046016607,0.008782026],"study_design_scores_gemma":[0.000006853696,0.000008443997,0.00023026118,0.00003469452,0.000004815463,0.00017485568,0.00013296572,0.0027291542,0.00022271839,0.9916237,0.0048233895,0.0000081548615],"about_ca_topic_score_codex":0.0009100031,"about_ca_topic_score_gemma":0.00093064364,"teacher_disagreement_score":0.012258734,"about_ca_system_score_codex":0.0009343949,"about_ca_system_score_gemma":0.00033576423,"threshold_uncertainty_score":0.041009545},"labels":[],"label_agreement":null},{"id":"W2401615126","doi":"","title":"Uniformly pair-bonded trees.","year":2010,"lang":"en","type":"article","venue":"HKBU Institutional Repository (Hong Kong Baptist University)","topic":"Graph theory and applications","field":"Mathematics","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":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Tree (set theory); Combinatorics","score_opus":0.016849123276269765,"score_gpt":0.22642803292897676,"score_spread":0.20957890965270698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401615126","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36223415,0.0029267992,0.32910138,0.0032443958,0.0008465336,0.00048493312,0.021259865,0.0025173482,0.27738455],"genre_scores_gemma":[0.8209468,0.0010901217,0.05028516,0.00082032144,0.0002445468,0.00034966329,0.010973927,0.00057592575,0.11471352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995658,0.00011837611,0.0000151338145,0.0001201889,0.000074081625,0.00010635673],"domain_scores_gemma":[0.9984309,0.00043774207,0.00014419352,0.0003950211,0.00029336024,0.00029877477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040425808,0.00046701677,0.0009292818,0.0010685786,0.001830175,0.0012536311,0.0016901016,0.0011080845,0.0382087],"category_scores_gemma":[0.003609544,0.00042209425,0.00030494452,0.0009865824,0.00065026816,0.0020697215,0.0012627183,0.0015685352,0.010924717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032148283,0.00018307743,0.0014446992,0.00034981934,0.000052169504,0.00041412414,0.00032631293,0.008008586,0.0061137513,0.8540795,0.07708278,0.051623806],"study_design_scores_gemma":[0.000078220095,0.000053701162,0.001659941,0.000069960486,0.00003837677,0.00052833045,0.00030410523,0.046499245,0.003503072,0.90868026,0.038558755,0.000026121412],"about_ca_topic_score_codex":0.0015688206,"about_ca_topic_score_gemma":0.0033664638,"teacher_disagreement_score":0.0382087,"about_ca_system_score_codex":0.00063178845,"about_ca_system_score_gemma":0.000670824,"threshold_uncertainty_score":0.12782079},"labels":[],"label_agreement":null},{"id":"W2401673825","doi":"","title":"The m-competition indices of symmetric primitive digraphs with loop.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Competition (biology); Loop (graph theory); Combinatorics; Biology; Ecology","score_opus":0.012258816917804234,"score_gpt":0.24319798529310113,"score_spread":0.2309391683752969,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401673825","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45885086,0.0008271394,0.12631756,0.0014528839,0.000518318,0.00016050159,0.0018349242,0.0007416219,0.40929615],"genre_scores_gemma":[0.9478762,0.00025746832,0.022815216,0.00040002444,0.0001360493,0.00015510106,0.00059942465,0.00016048345,0.02759995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995016,0.00012510734,0.000030680694,0.00008950198,0.00011166632,0.00014155186],"domain_scores_gemma":[0.99809486,0.00064811605,0.00027727574,0.00024011027,0.0003016884,0.000437978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000555697,0.00043663668,0.000539512,0.0019686953,0.0018411452,0.002553521,0.0010303785,0.001206888,0.016923018],"category_scores_gemma":[0.003717344,0.0003997205,0.0004420417,0.0011195847,0.0016620117,0.0037977016,0.0014696339,0.0014343304,0.0023720078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006352632,0.000028004533,0.00038849752,0.000045080385,0.0000059679132,0.0000896368,0.00013008427,0.00063942646,0.0016337915,0.9847525,0.0033238702,0.008899594],"study_design_scores_gemma":[0.00002721888,0.00003024131,0.00054651813,0.00003509181,0.0000103690045,0.00022341573,0.00013401767,0.007477212,0.0014269402,0.981797,0.008272262,0.000019725067],"about_ca_topic_score_codex":0.0011574731,"about_ca_topic_score_gemma":0.0018911841,"teacher_disagreement_score":0.016923018,"about_ca_system_score_codex":0.0013304277,"about_ca_system_score_gemma":0.00094848615,"threshold_uncertainty_score":0.056613088},"labels":[],"label_agreement":null},{"id":"W2401709832","doi":"","title":"The characterization of graphs with the largest Laplacian eigenvalue at most 5+sqrt(13)/2.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Characterization (materials science); Eigenvalues and eigenvectors; Combinatorics; Laplace operator; Mathematical analysis; Physics; Nanotechnology; Materials science","score_opus":0.009557073857486125,"score_gpt":0.23715632355056915,"score_spread":0.227599249693083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401709832","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68033636,0.0016029681,0.10518628,0.007277264,0.00033491987,0.00009099704,0.0026563446,0.0009120638,0.20160276],"genre_scores_gemma":[0.9669434,0.0004529258,0.012217014,0.00074917765,0.00029172405,0.00008841088,0.0016211183,0.0002219015,0.017414285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968493,0.000066323104,0.000012537988,0.000092651324,0.000074368596,0.0000692604],"domain_scores_gemma":[0.9984491,0.0006401503,0.00027601782,0.0001882059,0.00021256633,0.00023396149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029456284,0.0004790757,0.00033754102,0.0016668997,0.0010747305,0.0014736686,0.0007737097,0.00086737756,0.008426027],"category_scores_gemma":[0.0028705904,0.00024992903,0.00035858448,0.0010347038,0.0012417069,0.0021000106,0.0010199021,0.0014272382,0.0017345176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044051048,0.00010784035,0.0029573322,0.00031718495,0.000034450924,0.00053124636,0.00068028044,0.008346372,0.025868442,0.85924566,0.053283963,0.048186757],"study_design_scores_gemma":[0.000054892633,0.00006966942,0.0043450943,0.000069082955,0.000035186073,0.0013056241,0.00050449546,0.051976543,0.009642248,0.90992504,0.022014268,0.000057756653],"about_ca_topic_score_codex":0.00075555465,"about_ca_topic_score_gemma":0.0009891292,"teacher_disagreement_score":0.008426027,"about_ca_system_score_codex":0.000630521,"about_ca_system_score_gemma":0.00043198798,"threshold_uncertainty_score":0.02818793},"labels":[],"label_agreement":null},{"id":"W2401911466","doi":"","title":"On the matching polynomial of theta graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Matching (statistics); Polynomial; Discrete mathematics; Statistics; Mathematical analysis","score_opus":0.029502958017314864,"score_gpt":0.2819413303422619,"score_spread":0.25243837232494704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401911466","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32045606,0.009456234,0.262911,0.016853958,0.0021547796,0.000102413724,0.0013751314,0.00078293314,0.38590747],"genre_scores_gemma":[0.9209623,0.0041267243,0.021621611,0.0013888851,0.0014067008,0.000093475704,0.0007360287,0.000359531,0.049304828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993142,0.0001954997,0.000024475232,0.00013204249,0.00015743771,0.00017632707],"domain_scores_gemma":[0.99674267,0.002163989,0.00030560384,0.00027770989,0.00024886915,0.00026122935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011116449,0.00065618614,0.00086242735,0.0023757177,0.0011930452,0.002050445,0.001295346,0.0012154515,0.016825372],"category_scores_gemma":[0.009898699,0.00037279367,0.00068526535,0.0028243838,0.002946,0.007725754,0.0023585777,0.0039556758,0.0035725913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060528633,0.000041217423,0.00057165656,0.00010282891,0.000011253805,0.000061196646,0.0002150019,0.002322789,0.0005010406,0.9699598,0.00804007,0.018112786],"study_design_scores_gemma":[0.0000127890125,0.000010220219,0.0002937285,0.000021114936,0.000008445125,0.000075903044,0.000076462326,0.0059863464,0.00019634538,0.98896044,0.0043502282,0.000007931108],"about_ca_topic_score_codex":0.0024523665,"about_ca_topic_score_gemma":0.00238593,"teacher_disagreement_score":0.016825372,"about_ca_system_score_codex":0.0017798532,"about_ca_system_score_gemma":0.0007051072,"threshold_uncertainty_score":0.056286514},"labels":[],"label_agreement":null},{"id":"W2402033281","doi":"","title":"On the Wiener index of unicyclic graphs with given girth.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Girth (graph theory); Wiener index; Index (typography); Combinatorics; Discrete mathematics; Graph; Computer science; World Wide Web","score_opus":0.014489646453789804,"score_gpt":0.2546082013446283,"score_spread":0.2401185548908385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402033281","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80543506,0.0035741946,0.087835506,0.0014046029,0.0004760503,0.00003580359,0.0005438861,0.0002782727,0.100416586],"genre_scores_gemma":[0.98052603,0.0015728367,0.00783116,0.0001479844,0.000322342,0.000044687735,0.00023847341,0.00012830296,0.009188198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995092,0.000121681594,0.000025672745,0.00007853777,0.00014464137,0.000120343466],"domain_scores_gemma":[0.99716324,0.0014846568,0.0004778645,0.00022642003,0.00022632288,0.00042148173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000807766,0.00052831694,0.00094787456,0.003967072,0.0010082782,0.0020983815,0.0010808418,0.00084937393,0.005039976],"category_scores_gemma":[0.006641257,0.0003617859,0.00036138913,0.0022113675,0.0021606465,0.0041164085,0.0022250917,0.0013815311,0.0010708204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012981411,0.000026885786,0.0012233238,0.00007892772,0.000018698875,0.00010920847,0.00033498838,0.005225981,0.0027677584,0.97406626,0.0026372774,0.013380821],"study_design_scores_gemma":[0.000013746213,0.000027995298,0.0010145155,0.000045992372,0.0000145927725,0.00018447549,0.00014629427,0.01728781,0.0012003968,0.97739124,0.0026497191,0.000023349538],"about_ca_topic_score_codex":0.0005162403,"about_ca_topic_score_gemma":0.00074920896,"teacher_disagreement_score":0.005039976,"about_ca_system_score_codex":0.0010586658,"about_ca_system_score_gemma":0.0003161188,"threshold_uncertainty_score":0.016860425},"labels":[],"label_agreement":null},{"id":"W2402045463","doi":"","title":"On α - Incidence Energy and α - Distance Energy of a Graph.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Energy (signal processing); Incidence (geometry); Graph; Combinatorics; Statistics; Geometry","score_opus":0.022492839148709625,"score_gpt":0.2670354058054746,"score_spread":0.24454256665676496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402045463","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47277507,0.008098408,0.24678053,0.0070126555,0.0010852742,0.00006320488,0.0009561463,0.00022613416,0.26300266],"genre_scores_gemma":[0.94247425,0.0027688108,0.023281453,0.001000732,0.00081622263,0.000109726025,0.0004896362,0.00019466986,0.028864553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993709,0.00018030424,0.000029601408,0.0001208192,0.00018957851,0.00010893661],"domain_scores_gemma":[0.9969674,0.0017416634,0.0003063971,0.0002961097,0.00031394832,0.0003744286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009154075,0.00055755686,0.00065739895,0.0031286029,0.0012464201,0.0017597015,0.0013682239,0.001389229,0.010085897],"category_scores_gemma":[0.0049301796,0.00031129265,0.0005085912,0.0020091543,0.002944267,0.005123909,0.002048817,0.0024058656,0.0013924834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001703463,0.000016911885,0.00054803054,0.000045547145,0.000008926023,0.00004465012,0.000110280605,0.0019368071,0.00048632387,0.98851997,0.0019984632,0.006266945],"study_design_scores_gemma":[0.0000033558435,0.000009231929,0.00053741084,0.000023389892,0.000005253827,0.000120602475,0.00011151427,0.007860008,0.00019476294,0.9888659,0.002260293,0.000008359305],"about_ca_topic_score_codex":0.0006554258,"about_ca_topic_score_gemma":0.00063809793,"teacher_disagreement_score":0.010085897,"about_ca_system_score_codex":0.0011103172,"about_ca_system_score_gemma":0.0002795748,"threshold_uncertainty_score":0.03374076},"labels":[],"label_agreement":null},{"id":"W2402096899","doi":"","title":"Bounds of eigenvalues of a nontrivial bipartite graph.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Eigenvalues and eigenvectors; Combinatorics; Complete bipartite graph; Graph; Discrete mathematics","score_opus":0.020848365783589142,"score_gpt":0.2834701295530812,"score_spread":0.2626217637694921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402096899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32907984,0.0038610806,0.36837775,0.007376588,0.001314117,0.00011392111,0.0018071558,0.0014640454,0.2866056],"genre_scores_gemma":[0.9474205,0.0011671431,0.032484736,0.0004827539,0.0007165646,0.0002035691,0.00068077655,0.00041387737,0.016430076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998672,0.00034644472,0.000053135453,0.00026396345,0.000407325,0.00025723645],"domain_scores_gemma":[0.9834947,0.011893512,0.0010711175,0.0009903704,0.0011811685,0.0013690423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012606154,0.0015401953,0.000913659,0.0037640363,0.0013649857,0.0028098966,0.001873109,0.0015510226,0.019001106],"category_scores_gemma":[0.016149849,0.0004875498,0.000617879,0.0015768096,0.0029511955,0.004201147,0.0027885402,0.003084324,0.002893096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017717881,0.00008429187,0.0008892757,0.00024634856,0.000044673583,0.00018705567,0.00031806077,0.009272451,0.005042142,0.9588411,0.01161381,0.013283743],"study_design_scores_gemma":[0.00002034244,0.00002373066,0.0007318203,0.00006486472,0.000016447344,0.00016652119,0.00011515175,0.041826382,0.0013399047,0.9529081,0.0027599127,0.000026898719],"about_ca_topic_score_codex":0.0007146567,"about_ca_topic_score_gemma":0.0011832736,"teacher_disagreement_score":0.019001106,"about_ca_system_score_codex":0.0012858816,"about_ca_system_score_gemma":0.00053000357,"threshold_uncertainty_score":0.063565016},"labels":[],"label_agreement":null},{"id":"W2402245199","doi":"","title":"Super connectivity of Kronecker products of some graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Kronecker product; Kronecker delta; Combinatorics","score_opus":0.04984769336719136,"score_gpt":0.2914925227622639,"score_spread":0.24164482939507254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402245199","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64998657,0.0017525826,0.15192874,0.001912064,0.0004546928,0.00005109802,0.00069564587,0.0003003398,0.19291838],"genre_scores_gemma":[0.9670547,0.000703428,0.015600489,0.00035391573,0.00023193078,0.00004940814,0.00033752585,0.000089783345,0.015578732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949944,0.0001560845,0.000028739547,0.00010301494,0.00013265254,0.00008011611],"domain_scores_gemma":[0.99788254,0.00087860774,0.0003476484,0.00022099371,0.00035943693,0.0003108028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058638497,0.00033364407,0.00037265295,0.0020197826,0.0011105674,0.0017465051,0.0005769295,0.00063673925,0.0074074017],"category_scores_gemma":[0.0025206795,0.00037781385,0.00046270763,0.0011196907,0.0017118157,0.0040852656,0.001189778,0.0014600835,0.00068432686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016471651,0.000009952771,0.00030586528,0.000024697889,0.000004801503,0.00010164623,0.00017029214,0.00037528653,0.0006610863,0.9945471,0.0009919553,0.0027909044],"study_design_scores_gemma":[0.0000069432454,0.00002013103,0.00060127705,0.000017654338,0.000011002958,0.00033605646,0.00015102407,0.004737827,0.00045317225,0.98949045,0.00416435,0.000010104172],"about_ca_topic_score_codex":0.00074626895,"about_ca_topic_score_gemma":0.0011756215,"teacher_disagreement_score":0.0074074017,"about_ca_system_score_codex":0.00055735046,"about_ca_system_score_gemma":0.00029198767,"threshold_uncertainty_score":0.024780214},"labels":[],"label_agreement":null},{"id":"W2402571638","doi":"","title":"On the spectral radius of unicyclic graphs with fixed girth","year":2013,"lang":"en","type":"article","venue":"HKBU Institutional Repository (Hong Kong Baptist University)","topic":"Graph theory and applications","field":"Mathematics","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":"","keywords":"Mathematics; Spectral radius; Combinatorics; Adjacency matrix; Eigenvalues and eigenvectors; Graph; Girth (graph theory); RADIUS; Discrete mathematics; Physics; Computer science","score_opus":0.01528567018729003,"score_gpt":0.19491720177484984,"score_spread":0.17963153158755982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402571638","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88113195,0.003765242,0.080723315,0.00063349196,0.000098073375,0.000043891167,0.0006405927,0.00045743678,0.032505903],"genre_scores_gemma":[0.9860982,0.0011616033,0.010571698,0.00007901689,0.00008648176,0.000051180534,0.0003619869,0.00012063917,0.0014692263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927646,0.00024532204,0.000029974342,0.000153517,0.00012494241,0.00016977152],"domain_scores_gemma":[0.9919769,0.0054172305,0.00090292643,0.0005356123,0.00059240666,0.0005748569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088083616,0.00066659966,0.00067577744,0.003582215,0.0007690302,0.0011406204,0.0012308846,0.0005624225,0.002508133],"category_scores_gemma":[0.009384035,0.0004059482,0.00034843065,0.0015475457,0.0024556161,0.00197018,0.0014657583,0.0008489496,0.0006660152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013695426,0.00018160672,0.012246174,0.000561366,0.00014033465,0.0006568912,0.0019092604,0.2079772,0.038773153,0.6454106,0.014162287,0.076611586],"study_design_scores_gemma":[0.000076813594,0.00019036364,0.010422696,0.00023395219,0.00008472677,0.00092714274,0.00097512436,0.31079823,0.015661228,0.65264326,0.007807802,0.00017859967],"about_ca_topic_score_codex":0.0014217361,"about_ca_topic_score_gemma":0.00092190644,"teacher_disagreement_score":0.003582215,"about_ca_system_score_codex":0.00082570117,"about_ca_system_score_gemma":0.0003702911,"threshold_uncertainty_score":0.008390546},"labels":[],"label_agreement":null},{"id":"W2402992720","doi":"","title":"The Sharp Lower Bound of the Least Eigenvalue of a Bicyclic Graph.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Bicyclic molecule; Graph; Combinatorics; Upper and lower bounds; Mathematical analysis; Medicinal chemistry; Chemistry; Physics","score_opus":0.016761976517218325,"score_gpt":0.2709001636376991,"score_spread":0.25413818712048075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402992720","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3114349,0.011543731,0.30584925,0.01687475,0.002587749,0.00012881616,0.0028208618,0.0011289577,0.34763095],"genre_scores_gemma":[0.9435657,0.0028931745,0.026167823,0.0017655793,0.0011730087,0.00019244441,0.00081901933,0.00029326085,0.023129923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988733,0.00025368767,0.00003794261,0.0002702784,0.0003031542,0.0002615921],"domain_scores_gemma":[0.9937309,0.00405176,0.000437589,0.00051241956,0.00055182655,0.0007155581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009208307,0.0012560035,0.0010923799,0.0026560137,0.0013576399,0.0031792421,0.0019784821,0.0020110302,0.015536397],"category_scores_gemma":[0.0131629845,0.00062287314,0.00056325697,0.0015431606,0.0026716932,0.0040243813,0.0027117324,0.00409376,0.0036975911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034029334,0.000067486224,0.00082582654,0.00046521242,0.000053263237,0.00028123552,0.0003210538,0.011240949,0.009988886,0.92717063,0.028533924,0.020711143],"study_design_scores_gemma":[0.000045336616,0.000055252665,0.0008275082,0.00011257953,0.00003975664,0.00039020096,0.00014819301,0.032474514,0.0035439911,0.9539053,0.008408275,0.00004917335],"about_ca_topic_score_codex":0.0009252685,"about_ca_topic_score_gemma":0.001158951,"teacher_disagreement_score":0.015536397,"about_ca_system_score_codex":0.0010302215,"about_ca_system_score_gemma":0.0005843669,"threshold_uncertainty_score":0.051974416},"labels":[],"label_agreement":null},{"id":"W2403011525","doi":"","title":"A note on the Kirchhoff index of bicyclic graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Resistance distance; Combinatorics; Generalization; Graph; Index (typography); Topological index; Discrete mathematics; Mathematical analysis; Graph power; Line graph; Computer science","score_opus":0.021453317542698594,"score_gpt":0.2789878806951229,"score_spread":0.25753456315242435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403011525","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23115219,0.02944772,0.28131053,0.0065831295,0.0043588765,0.0001356076,0.0010992504,0.00066976895,0.445243],"genre_scores_gemma":[0.8977612,0.010424734,0.07278454,0.0017121714,0.0018301482,0.00005223999,0.0004214229,0.00019189274,0.014821657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993175,0.00012266284,0.000045694695,0.0001653825,0.0002519186,0.00009678568],"domain_scores_gemma":[0.99828786,0.0009272819,0.00015893747,0.0002479581,0.00017943165,0.00019846865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006046719,0.0006391293,0.0007456054,0.0023023435,0.0010775251,0.0012361564,0.001200253,0.00077523105,0.005428205],"category_scores_gemma":[0.0031129257,0.00031811203,0.0004939639,0.0020750624,0.0025640994,0.003726988,0.0019227508,0.0025561738,0.00078009424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012456559,0.00004686694,0.0010907594,0.00033007117,0.00003086925,0.00039025012,0.000553339,0.003582482,0.008144785,0.93894,0.009266726,0.03749922],"study_design_scores_gemma":[0.000019928828,0.00011357297,0.0018228581,0.000083431696,0.000030980944,0.0008619264,0.00020866429,0.009240052,0.004311957,0.9370528,0.046145774,0.00010801405],"about_ca_topic_score_codex":0.0011819089,"about_ca_topic_score_gemma":0.0012612771,"teacher_disagreement_score":0.005428205,"about_ca_system_score_codex":0.000789788,"about_ca_system_score_gemma":0.0003731078,"threshold_uncertainty_score":0.018159151},"labels":[],"label_agreement":null},{"id":"W2403014172","doi":"","title":"The Modified Zagreb Indices About Disjunction And Symmetric Difference Of Graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Statistics","score_opus":0.017133518864651084,"score_gpt":0.2640155511588824,"score_spread":0.24688203229423134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403014172","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20720454,0.0044925814,0.2476156,0.003462872,0.0021143083,0.00009514255,0.0014242036,0.0004925353,0.53309816],"genre_scores_gemma":[0.89908403,0.0017599137,0.057203423,0.0010251275,0.0010670223,0.00011698139,0.00071528764,0.00035419234,0.038674023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897003,0.00026015597,0.00006700322,0.00022540576,0.00033194586,0.0001454742],"domain_scores_gemma":[0.99854773,0.00052465824,0.00019941917,0.00029401333,0.00026944486,0.00016469954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011002545,0.0004901149,0.0007714163,0.0025488797,0.0016039518,0.0032197088,0.0013842415,0.0010590471,0.010019869],"category_scores_gemma":[0.004388266,0.00036628547,0.00065848784,0.0020911372,0.0030465443,0.008031888,0.0019317038,0.0035752195,0.0018104988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021617101,0.000005558427,0.000080553305,0.000017436616,0.0000027902652,0.000017896935,0.00008120313,0.00015886842,0.0003073164,0.9919299,0.0010571466,0.006319799],"study_design_scores_gemma":[0.000007920643,0.000009492867,0.00016139467,0.000012162654,0.0000054997845,0.000086329615,0.000049249025,0.0010538768,0.0004111533,0.9921822,0.0060124355,0.000008323925],"about_ca_topic_score_codex":0.001086822,"about_ca_topic_score_gemma":0.0013464174,"teacher_disagreement_score":0.010019869,"about_ca_system_score_codex":0.001430876,"about_ca_system_score_gemma":0.000571891,"threshold_uncertainty_score":0.033519804},"labels":[],"label_agreement":null},{"id":"W2403023109","doi":"","title":"Tricyclic Graphs With Minimum Modified Schultz Index And Maximum Zagreb Indices.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Tricyclic; Statistics; Combinatorics; Chemistry; Computer science; Stereochemistry; World Wide Web","score_opus":0.0348977643886674,"score_gpt":0.27573520183857586,"score_spread":0.24083743744990846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403023109","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61717415,0.0021561396,0.077051595,0.0015881888,0.00035172745,0.00013912914,0.003384587,0.00069734285,0.2974571],"genre_scores_gemma":[0.9591072,0.0007087098,0.017849933,0.00022278712,0.00010491561,0.00007397719,0.0012295153,0.0001074939,0.0205954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958485,0.00008310265,0.000030092133,0.00008615939,0.000116518524,0.00009914928],"domain_scores_gemma":[0.9985512,0.0004148141,0.00038414577,0.00028244435,0.00020416961,0.00016327074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002593901,0.0003196866,0.00053269643,0.0013288821,0.0009726347,0.0021749288,0.00084993005,0.0007705615,0.011017483],"category_scores_gemma":[0.0028897128,0.00033663734,0.00034400518,0.0015537338,0.00081871066,0.0021516094,0.0012411311,0.0010418652,0.0016969807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026734496,0.000047212954,0.0013892073,0.00017854894,0.00004020523,0.00025062409,0.00025742356,0.0046105245,0.006810408,0.940722,0.009791377,0.035635103],"study_design_scores_gemma":[0.00008571183,0.0000782187,0.0030474563,0.000081133,0.000087589426,0.001037837,0.00040718864,0.018031113,0.0063005085,0.94869846,0.022092722,0.000051999894],"about_ca_topic_score_codex":0.00084815227,"about_ca_topic_score_gemma":0.0016969694,"teacher_disagreement_score":0.011017483,"about_ca_system_score_codex":0.0007551206,"about_ca_system_score_gemma":0.0005383973,"threshold_uncertainty_score":0.03685713},"labels":[],"label_agreement":null},{"id":"W2403094376","doi":"","title":"On the Balaban Index of Trees.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Tree (set theory); Combinatorics; Computer science; World Wide Web","score_opus":0.04439641874231101,"score_gpt":0.2655193361685936,"score_spread":0.22112291742628257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403094376","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2613952,0.011199764,0.17302641,0.0064100684,0.0029220488,0.00007764442,0.00085806753,0.00064226834,0.5434685],"genre_scores_gemma":[0.9146421,0.0036208096,0.030058345,0.001901424,0.00137597,0.00011812766,0.00055721524,0.00035821187,0.047367662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990282,0.00030817662,0.00005730253,0.0001342388,0.00028352058,0.00018855426],"domain_scores_gemma":[0.9972983,0.0011087296,0.00036571067,0.00035112695,0.0004436206,0.00043262605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013042588,0.0005402283,0.001185469,0.004090371,0.002674466,0.0039714132,0.0011577152,0.0016008415,0.010564136],"category_scores_gemma":[0.007374903,0.00039854384,0.00055700896,0.0030236132,0.0033670943,0.008552624,0.003990873,0.003513269,0.0029285594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022305037,0.000009122848,0.00015513744,0.000020558635,0.0000031791903,0.000028834596,0.00009416302,0.00025309494,0.00021526832,0.9927898,0.0015489351,0.0048596244],"study_design_scores_gemma":[0.0000055220917,0.000006667562,0.000117304226,0.000017767858,0.0000034392801,0.00005889248,0.00006462291,0.0014880203,0.00012778117,0.9946306,0.0034726162,0.000006756388],"about_ca_topic_score_codex":0.0013022065,"about_ca_topic_score_gemma":0.0016824772,"teacher_disagreement_score":0.010564136,"about_ca_system_score_codex":0.0013597193,"about_ca_system_score_gemma":0.0007083339,"threshold_uncertainty_score":0.035340607},"labels":[],"label_agreement":null},{"id":"W2403172418","doi":"","title":"On Sum-Balaban Index","year":2012,"lang":"fr","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Connectivity; Graph; Cyclomatic complexity; Discrete mathematics; Computer science","score_opus":0.022360903716578572,"score_gpt":0.2815170547368369,"score_spread":0.25915615102025835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403172418","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36872503,0.0054006046,0.48099253,0.001515019,0.0005194238,0.00009822094,0.0007360995,0.0009250595,0.14108795],"genre_scores_gemma":[0.93444294,0.0015885512,0.05317263,0.00053965295,0.00040986913,0.00013508808,0.0005019552,0.000416498,0.008792881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804604,0.00041999988,0.00011966434,0.00040800462,0.00060987653,0.00039636553],"domain_scores_gemma":[0.9911724,0.0047739637,0.00071650476,0.0013729498,0.001005159,0.00095902797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022779417,0.00077484845,0.0013591918,0.004130212,0.0024990398,0.003459453,0.001906534,0.0012595964,0.006324113],"category_scores_gemma":[0.0147259915,0.00044838613,0.00085770944,0.0035272078,0.0039205733,0.008582012,0.003792596,0.0035239626,0.0019256896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019844522,0.00006141868,0.0019334415,0.00010802902,0.000017489774,0.00012073411,0.0003025787,0.009420675,0.0029194998,0.95850736,0.0032282618,0.023182083],"study_design_scores_gemma":[0.000010943461,0.00004198171,0.0006054255,0.000051560834,0.000019399033,0.00023448926,0.000111229594,0.042626884,0.0025359462,0.9495998,0.0041262913,0.000036115438],"about_ca_topic_score_codex":0.0006969589,"about_ca_topic_score_gemma":0.00074857316,"teacher_disagreement_score":0.006324113,"about_ca_system_score_codex":0.0015944715,"about_ca_system_score_gemma":0.0008425296,"threshold_uncertainty_score":0.021156251},"labels":[],"label_agreement":null},{"id":"W2403255421","doi":"","title":"Some new results on the sum of squares of eccentricity in graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eccentricity (behavior); Explained sum of squares; Combinatorics; Statistics; Political science; Law","score_opus":0.028747296946464208,"score_gpt":0.2705013273307387,"score_spread":0.24175403038427445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403255421","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11461866,0.022137104,0.6076169,0.0065892995,0.0032950488,0.00011184814,0.0015161091,0.00089412875,0.2432209],"genre_scores_gemma":[0.7250993,0.015888968,0.17135127,0.0034467825,0.008346063,0.00023960324,0.0013896051,0.00136827,0.07287016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986952,0.00028547636,0.00009492589,0.00032007406,0.0004809066,0.00012348877],"domain_scores_gemma":[0.993761,0.003689955,0.000633405,0.0006386407,0.0007240469,0.00055284565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014206918,0.0014605862,0.0011007881,0.0040932796,0.0012204,0.0027965633,0.0020615826,0.0014502661,0.013753856],"category_scores_gemma":[0.009840824,0.00075604045,0.001130578,0.004022488,0.0033722331,0.007916042,0.0028957992,0.0039278725,0.0025805961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086507906,0.000070725255,0.0013758028,0.00047878086,0.00006586525,0.00039128755,0.00042749118,0.007249688,0.0037039134,0.9221623,0.015074384,0.048913397],"study_design_scores_gemma":[0.000012242825,0.000034231325,0.0009080577,0.000055146305,0.000039581202,0.00076542696,0.00012930205,0.011671022,0.0011043838,0.9689211,0.016332667,0.000026845371],"about_ca_topic_score_codex":0.00056091737,"about_ca_topic_score_gemma":0.0008985702,"teacher_disagreement_score":0.013753856,"about_ca_system_score_codex":0.0009935645,"about_ca_system_score_gemma":0.00034626448,"threshold_uncertainty_score":0.04601127},"labels":[],"label_agreement":null},{"id":"W2403306657","doi":"","title":"Perfect state transfer between non-antipodal vertices in integral circulant graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Antipodal point; Circulant matrix; Mathematics; Combinatorics; Transfer (computing); Discrete mathematics; Geometry; Computer science","score_opus":0.047146575354170626,"score_gpt":0.3005098139403286,"score_spread":0.253363238586158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403306657","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6600638,0.00054972793,0.14551745,0.0013987795,0.0008444392,0.0001445346,0.00036702145,0.0012071453,0.1899071],"genre_scores_gemma":[0.9838395,0.00011636566,0.008054624,0.000233861,0.000065870685,0.00006464778,0.00011346493,0.0001004,0.0074113426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942064,0.000114853465,0.000022194467,0.000097507414,0.0001453854,0.00019956114],"domain_scores_gemma":[0.99876094,0.00045458673,0.0001241735,0.00034551902,0.00011052237,0.00020427872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005624828,0.00034532152,0.00063151633,0.0012341036,0.0020285095,0.0022079234,0.0012351043,0.0016509292,0.012450432],"category_scores_gemma":[0.0034099696,0.0003729883,0.00051557296,0.0006525758,0.002031629,0.0031617847,0.0019436901,0.0015600199,0.0011084055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006026859,0.00004543922,0.00015148806,0.000033223663,0.0000052796822,0.000105642604,0.000105201645,0.0018202681,0.0023763457,0.989474,0.0015348885,0.0042879493],"study_design_scores_gemma":[0.00002942721,0.0000443088,0.00022982336,0.000024765879,0.00001024163,0.00013009488,0.00012401423,0.026875017,0.0031324462,0.967452,0.0019284218,0.000019417615],"about_ca_topic_score_codex":0.0006704144,"about_ca_topic_score_gemma":0.000871467,"teacher_disagreement_score":0.012450432,"about_ca_system_score_codex":0.0009196418,"about_ca_system_score_gemma":0.00072840677,"threshold_uncertainty_score":0.04165083},"labels":[],"label_agreement":null},{"id":"W2403442490","doi":"","title":"On the signless Laplacian spectral radius of digraphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Combinatorics; Physics; Eigenvalues and eigenvectors; Quantum mechanics","score_opus":0.019904453225804947,"score_gpt":0.25328674069135465,"score_spread":0.2333822874655497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403442490","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5087982,0.009051115,0.2792707,0.006609505,0.0009127695,0.00007925217,0.0009220588,0.0007957829,0.1935606],"genre_scores_gemma":[0.9682552,0.0023800281,0.017639862,0.000677224,0.0006115849,0.000088963316,0.00029082008,0.00018850766,0.009867681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991103,0.00038243667,0.000037293306,0.00014398468,0.00020049975,0.00012554183],"domain_scores_gemma":[0.99346113,0.0041317157,0.00071461103,0.00042084762,0.0005011019,0.0007706392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011962815,0.0006851671,0.0008297351,0.00335078,0.0012042576,0.0023163348,0.0013552267,0.001427663,0.0059402417],"category_scores_gemma":[0.012676617,0.00040914954,0.00032911848,0.0014897621,0.0029782576,0.0047666775,0.002058198,0.0017645302,0.0013268467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004342916,0.000022217988,0.0004385203,0.000068560534,0.000010255066,0.00006087192,0.00015615596,0.0031160284,0.0009893788,0.98301125,0.004263879,0.007819494],"study_design_scores_gemma":[0.000012198175,0.000016915053,0.0004503256,0.00003211891,0.000009273105,0.000153463,0.00011464881,0.01831698,0.00034717715,0.977991,0.0025402,0.000015819129],"about_ca_topic_score_codex":0.00076881,"about_ca_topic_score_gemma":0.00079498795,"teacher_disagreement_score":0.0059402417,"about_ca_system_score_codex":0.0011566888,"about_ca_system_score_gemma":0.00039918153,"threshold_uncertainty_score":0.01987207},"labels":[],"label_agreement":null},{"id":"W2403450736","doi":"","title":"An Inequality on Laplacian Eigenvalues of Connected Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Inequality; Laplace operator; Laplacian matrix; Pure mathematics; Combinatorics; Mathematical analysis","score_opus":0.04934705980718329,"score_gpt":0.3339834472392321,"score_spread":0.28463638743204883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403450736","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2159769,0.0067922,0.33585623,0.012708035,0.0020655387,0.000068884285,0.0012816429,0.0006112403,0.4246393],"genre_scores_gemma":[0.9455058,0.0021774822,0.022962766,0.0015792451,0.001168037,0.00011611522,0.00046892485,0.00024422762,0.025777403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914587,0.00025681398,0.000027597649,0.00015185369,0.0002965757,0.00012122059],"domain_scores_gemma":[0.995407,0.003125607,0.00026502923,0.00027913094,0.0005563838,0.00036689354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008530961,0.00061840593,0.0005756244,0.002170748,0.00094918365,0.0015150829,0.0010443466,0.0012261822,0.013238473],"category_scores_gemma":[0.008083963,0.00024779548,0.00041590078,0.0013361598,0.0020129948,0.003446117,0.001992211,0.0023410388,0.001744991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057934358,0.000032016273,0.0006527824,0.00012013428,0.000017082642,0.00023132341,0.00026506593,0.0019214172,0.004820581,0.9646529,0.01182039,0.015408345],"study_design_scores_gemma":[0.00001519945,0.000020729489,0.0014396611,0.000055175507,0.000013320969,0.00025937092,0.00015845413,0.025213012,0.0008627964,0.9667467,0.005197518,0.00001801406],"about_ca_topic_score_codex":0.0009632518,"about_ca_topic_score_gemma":0.0013009723,"teacher_disagreement_score":0.013238473,"about_ca_system_score_codex":0.0008202424,"about_ca_system_score_gemma":0.00028127947,"threshold_uncertainty_score":0.044287086},"labels":[],"label_agreement":null},{"id":"W2403512408","doi":"","title":"The extremal fully loaded graphs with respect to Merrifield-Simmons index.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Discrete mathematics; Computer science","score_opus":0.041253746329207336,"score_gpt":0.2898768608766027,"score_spread":0.24862311454739536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403512408","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5900436,0.0008135129,0.06342735,0.0028186375,0.0004622572,0.00010087655,0.001245313,0.00097470754,0.3401137],"genre_scores_gemma":[0.9615891,0.00036461808,0.010049635,0.0004289964,0.0003268858,0.00008189418,0.00059191143,0.0002645226,0.026302341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927694,0.0001673322,0.000028222204,0.00014162617,0.00020801547,0.0001779096],"domain_scores_gemma":[0.9978356,0.0005861579,0.00042315264,0.000344549,0.0003269406,0.0004835925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007833548,0.0006219966,0.0006511246,0.0034323495,0.0024453506,0.0036545887,0.0013581611,0.0016394882,0.017775526],"category_scores_gemma":[0.0047129043,0.0004332433,0.00046459088,0.0012082821,0.0022709083,0.004526719,0.002244449,0.001916345,0.0026197946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010349876,0.000023160324,0.00033076043,0.000033279157,0.000008631952,0.00012653136,0.00014668966,0.00086564943,0.0014543032,0.9865643,0.0036601736,0.006683042],"study_design_scores_gemma":[0.000027560563,0.000023226808,0.00070685527,0.000029079898,0.0000100346215,0.00030160477,0.0001675646,0.00618367,0.0012016108,0.986852,0.0044745174,0.000022247055],"about_ca_topic_score_codex":0.0007659358,"about_ca_topic_score_gemma":0.0010682325,"teacher_disagreement_score":0.017775526,"about_ca_system_score_codex":0.0010742239,"about_ca_system_score_gemma":0.0005919924,"threshold_uncertainty_score":0.05946511},"labels":[],"label_agreement":null},{"id":"W2403887512","doi":"","title":"The Harmonic Index on Unicyclic Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Harmonic; Combinatorics; Statistics; Computer science; Acoustics; Physics; World Wide Web","score_opus":0.0319056874760969,"score_gpt":0.29515694169507284,"score_spread":0.26325125421897594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403887512","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4409902,0.010466784,0.088977836,0.0044001653,0.0018482548,0.000075139906,0.0013261162,0.00038176193,0.45153382],"genre_scores_gemma":[0.9543715,0.0035373154,0.007431684,0.00036054506,0.0009356583,0.00006345586,0.0004474659,0.00013750276,0.032714922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995584,0.00008768857,0.000020587782,0.00008356704,0.00015903781,0.00009066238],"domain_scores_gemma":[0.998348,0.00073104625,0.00028825458,0.00018160997,0.0001859366,0.00026520307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039817416,0.00041125724,0.000618829,0.003541625,0.0010583814,0.0023764297,0.0010866045,0.00091500854,0.01037684],"category_scores_gemma":[0.004100023,0.00026969428,0.00024086806,0.0024097485,0.0019551401,0.0038115594,0.002123724,0.0014206384,0.0016908282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004133098,0.000012959608,0.00038806777,0.00006890885,0.000007864269,0.000057068686,0.00017559191,0.0010479649,0.0008782493,0.9737235,0.005322992,0.01827553],"study_design_scores_gemma":[0.000007583456,0.000010052034,0.00051109015,0.000026814654,0.0000067233896,0.00014426606,0.00011005682,0.0046606464,0.00043283572,0.9877577,0.006321847,0.000010519091],"about_ca_topic_score_codex":0.0009787398,"about_ca_topic_score_gemma":0.0010629983,"teacher_disagreement_score":0.01037684,"about_ca_system_score_codex":0.0012465513,"about_ca_system_score_gemma":0.00033841952,"threshold_uncertainty_score":0.034713984},"labels":[],"label_agreement":null},{"id":"W2403935035","doi":"","title":"On the second maximal and minimal Wiener index of unicyclic graphs with given girth.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Girth (graph theory); Wiener index; Index (typography); Combinatorics; Discrete mathematics; Graph; Computer science","score_opus":0.018829465834408907,"score_gpt":0.25018057202563876,"score_spread":0.23135110619122984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403935035","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81072176,0.0028649599,0.064059794,0.0015054906,0.0003512635,0.00003808148,0.00058486324,0.0002644627,0.11960927],"genre_scores_gemma":[0.98282284,0.0008368341,0.006615668,0.00012470743,0.0002531678,0.00003997377,0.00025400554,0.00009711519,0.008955703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995388,0.00010031148,0.000021166315,0.00008270629,0.00012627944,0.00013070065],"domain_scores_gemma":[0.9971124,0.0014004199,0.00045744888,0.00021734861,0.00023035143,0.00058210286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006642121,0.0005098381,0.0008671639,0.0032362617,0.0011579512,0.002493418,0.0011244634,0.0009224812,0.0052443063],"category_scores_gemma":[0.005574488,0.0003676372,0.00046403875,0.001535951,0.0025079455,0.0036684233,0.0019970785,0.0015909064,0.00089781824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019471596,0.000039950508,0.0016624082,0.00009762607,0.000020278474,0.00014455731,0.00046808837,0.004266489,0.003653009,0.9743542,0.0030699056,0.012028666],"study_design_scores_gemma":[0.000020699617,0.000041491232,0.001812566,0.000058398906,0.00002186084,0.00028842597,0.0002513976,0.014852038,0.002088776,0.97710377,0.0034283195,0.000032314023],"about_ca_topic_score_codex":0.0008073143,"about_ca_topic_score_gemma":0.00118948,"teacher_disagreement_score":0.0052443063,"about_ca_system_score_codex":0.0012933797,"about_ca_system_score_gemma":0.0005047512,"threshold_uncertainty_score":0.017543972},"labels":[],"label_agreement":null},{"id":"W2404017857","doi":"","title":"The Modified Zagreb Indices About Join And Composition Of Graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Join (topology); Mathematics; Composition (language); Combinatorics; Linguistics","score_opus":0.015590429664716224,"score_gpt":0.27046048959017605,"score_spread":0.2548700599254598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404017857","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11823095,0.005682913,0.41946098,0.002481424,0.0026005558,0.00012140218,0.0011346332,0.00074958924,0.4495375],"genre_scores_gemma":[0.76241183,0.0035999287,0.16211429,0.001233352,0.0019108067,0.0002608369,0.0009704979,0.000758144,0.066740274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846005,0.00037632853,0.00011223459,0.00034576576,0.00051706354,0.00018859355],"domain_scores_gemma":[0.99844533,0.00045701384,0.00023431296,0.0003721903,0.00029280767,0.00019829524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015402876,0.0006721747,0.0009084404,0.003312262,0.0022300347,0.0042607104,0.0013006025,0.0012086625,0.008161844],"category_scores_gemma":[0.004872138,0.00048577454,0.000811192,0.0026791187,0.0035810904,0.009926769,0.0026747622,0.0041941446,0.002317285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022792372,0.0000058305222,0.00008773146,0.000020913183,0.0000034762388,0.000024392672,0.00014983892,0.00017738306,0.0003733533,0.9894856,0.0011071983,0.008541489],"study_design_scores_gemma":[0.0000074030113,0.000012975229,0.00019534297,0.000021835654,0.000010392386,0.00012016108,0.00009984729,0.0013450134,0.00070393586,0.9827533,0.014717642,0.000012195239],"about_ca_topic_score_codex":0.0013032461,"about_ca_topic_score_gemma":0.0018451184,"teacher_disagreement_score":0.008161844,"about_ca_system_score_codex":0.0014291424,"about_ca_system_score_gemma":0.00069885585,"threshold_uncertainty_score":0.027304113},"labels":[],"label_agreement":null},{"id":"W2404057724","doi":"","title":"On Vertex Matching Polynomial of Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Matching (statistics); Graph; Statistics","score_opus":0.023183009138926524,"score_gpt":0.2858983258116701,"score_spread":0.26271531667274356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404057724","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26950425,0.013602822,0.32338062,0.017155265,0.0024008288,0.00014036694,0.0024686167,0.001086629,0.3702606],"genre_scores_gemma":[0.8911186,0.0075082653,0.039785918,0.0017012273,0.002332925,0.00014831698,0.0015289079,0.00044804125,0.055427812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921346,0.00021405183,0.00002723846,0.00016102471,0.00021363009,0.00017058052],"domain_scores_gemma":[0.9967242,0.0021805475,0.00029071915,0.0002918951,0.00027809961,0.00023447187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010648658,0.00073699234,0.0010139564,0.0029999427,0.0010435326,0.002270664,0.0014848596,0.0011894136,0.014108778],"category_scores_gemma":[0.009336928,0.00033718353,0.0007112585,0.0040308293,0.0025203596,0.0072853104,0.002044165,0.0038211353,0.0033720215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085944,0.000063054824,0.00087202026,0.00022269844,0.000019535111,0.000081161896,0.000291226,0.0038056308,0.0007992414,0.93894994,0.014883763,0.039925847],"study_design_scores_gemma":[0.000014255843,0.000016037144,0.00047101523,0.00003147112,0.000013311118,0.000094882605,0.000063394815,0.010772726,0.00029436755,0.9815197,0.006698101,0.000010856564],"about_ca_topic_score_codex":0.002542343,"about_ca_topic_score_gemma":0.0023945293,"teacher_disagreement_score":0.014108778,"about_ca_system_score_codex":0.0021692798,"about_ca_system_score_gemma":0.0007403007,"threshold_uncertainty_score":0.047198534},"labels":[],"label_agreement":null},{"id":"W2404108205","doi":"","title":"On the spectrum of unitary Euclidean graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Unitary state; Mathematics; Spectrum (functional analysis); Euclidean geometry; Euclidean distance; Pure mathematics; Political science; Geometry; Quantum mechanics; Physics","score_opus":0.021164296380712818,"score_gpt":0.25253617238281845,"score_spread":0.23137187600210563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404108205","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38303855,0.012631184,0.21863389,0.0077001876,0.0017023023,0.000057354384,0.000786113,0.0004639248,0.3749865],"genre_scores_gemma":[0.9497202,0.003348418,0.015993912,0.0010460878,0.0010236382,0.00006429915,0.00033043083,0.00017759798,0.028295409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994498,0.00018082737,0.000021310134,0.00009268634,0.00015240411,0.00010294855],"domain_scores_gemma":[0.9987871,0.00050283194,0.00017123192,0.00014461987,0.00015583217,0.00023834854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005732507,0.000744002,0.0006415164,0.0024901622,0.001245791,0.0018654534,0.0008735092,0.001252514,0.008210656],"category_scores_gemma":[0.0031826154,0.00028582054,0.0004849938,0.0010822862,0.0028490154,0.00414007,0.0020697282,0.0018740266,0.001418495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010882714,0.0000066228254,0.000058493042,0.000018238748,0.0000023821922,0.00003121343,0.00006719576,0.0003983933,0.0003042074,0.99529463,0.0012609581,0.002546784],"study_design_scores_gemma":[0.0000043493797,0.0000048126394,0.00010334358,0.000012453203,0.000001537508,0.00005242615,0.00004421314,0.0023567528,0.00007172826,0.9959416,0.0014027362,0.0000038418116],"about_ca_topic_score_codex":0.0009367244,"about_ca_topic_score_gemma":0.00082172756,"teacher_disagreement_score":0.008210656,"about_ca_system_score_codex":0.00089088565,"about_ca_system_score_gemma":0.0003188453,"threshold_uncertainty_score":0.02746737},"labels":[],"label_agreement":null},{"id":"W2404118109","doi":"","title":"Hamiltonian graphs involving neighborhood conditions.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Graph; Hamiltonian (control theory); Independence number; Connectivity; Quartic graph; Graph power; Hamiltonian path; Discrete mathematics; Line graph","score_opus":0.029270861985529723,"score_gpt":0.2944553543768425,"score_spread":0.2651844923913128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404118109","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52668566,0.0014368604,0.31387296,0.0016178838,0.00044885042,0.00020655636,0.0013551407,0.00051613513,0.15385993],"genre_scores_gemma":[0.9355198,0.0006385256,0.049401518,0.00032324388,0.00013765563,0.00014347391,0.0008544217,0.00009362551,0.0128877945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996588,0.000098735574,0.00001464172,0.00007493562,0.000081437705,0.000071500785],"domain_scores_gemma":[0.99811435,0.0010912578,0.00026416752,0.00019183932,0.00015621762,0.00018225308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036595808,0.00029174588,0.0003045172,0.0006885739,0.0010629162,0.0006787646,0.0006326067,0.0005853544,0.008615987],"category_scores_gemma":[0.0025870157,0.00032989946,0.0004232609,0.0005618762,0.00095974194,0.0018816136,0.0012275741,0.0007614847,0.000581615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010261648,0.000053937107,0.0019787054,0.00025892773,0.00003942031,0.0008171841,0.00034901066,0.010687083,0.0065188925,0.94318,0.0069132033,0.029101051],"study_design_scores_gemma":[0.00005491139,0.000038063437,0.0013683408,0.000055338685,0.000044754284,0.00087025575,0.00034650878,0.046566717,0.0032448557,0.9279746,0.019410236,0.000025363384],"about_ca_topic_score_codex":0.00095540326,"about_ca_topic_score_gemma":0.0019725582,"teacher_disagreement_score":0.008615987,"about_ca_system_score_codex":0.0005771564,"about_ca_system_score_gemma":0.000334824,"threshold_uncertainty_score":0.028823376},"labels":[],"label_agreement":null},{"id":"W2404135439","doi":"","title":"A Note on Wiener Indices of Unicyclic Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Combinatorics; Statistics; Graph","score_opus":0.021139481878837577,"score_gpt":0.299635073351355,"score_spread":0.2784955914725174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404135439","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09504889,0.035310872,0.21812925,0.009281263,0.012411562,0.00005900677,0.0006577087,0.00077563786,0.6283258],"genre_scores_gemma":[0.75428337,0.027771855,0.09859374,0.0035861472,0.006978928,0.0001283959,0.00052753737,0.00083429506,0.107295685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958116,0.00010170781,0.000024984949,0.00007970669,0.00015327179,0.000059182898],"domain_scores_gemma":[0.9986432,0.000715331,0.00012273144,0.00023209957,0.00014365463,0.00014295545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000670285,0.00068005506,0.0007671447,0.0021742026,0.0013739052,0.0019373106,0.0011828042,0.00092036795,0.008068858],"category_scores_gemma":[0.003466598,0.00037977376,0.00050575344,0.0022925907,0.0019147097,0.004567716,0.0021363248,0.0028631997,0.0023901684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020389498,0.000013088088,0.00019711631,0.000070937036,0.000008713011,0.00013993272,0.0001786898,0.00056314527,0.0014385954,0.9691213,0.010393831,0.01785439],"study_design_scores_gemma":[0.0000034146044,0.000015554968,0.00028773939,0.00003057053,0.0000070563983,0.0001847902,0.000071402195,0.0016606016,0.00057857326,0.9668812,0.030265432,0.000013643643],"about_ca_topic_score_codex":0.00055978214,"about_ca_topic_score_gemma":0.0013796863,"teacher_disagreement_score":0.008068858,"about_ca_system_score_codex":0.00064485596,"about_ca_system_score_gemma":0.00032373573,"threshold_uncertainty_score":0.026993036},"labels":[],"label_agreement":null},{"id":"W2404318628","doi":"","title":"On Regular Graphs with Complete Tripartite Star Complements.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Star (game theory); Combinatorics; Mathematical analysis","score_opus":0.06989763830698675,"score_gpt":0.3015556413172234,"score_spread":0.23165800301023665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404318628","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31151655,0.0042598085,0.31986624,0.0055956007,0.0011080785,0.00021642358,0.0020467439,0.0007644294,0.3546261],"genre_scores_gemma":[0.83957535,0.0038337253,0.07597036,0.0016250069,0.0011274648,0.00029343177,0.0022884603,0.00046645442,0.074819736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868864,0.0004365862,0.000067889596,0.0002755929,0.00029798728,0.00023329764],"domain_scores_gemma":[0.99554366,0.0022833792,0.00074349775,0.0004433087,0.00047579952,0.00051037566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079882203,0.0008127015,0.001077226,0.0031101923,0.0024193919,0.0036747954,0.0016807441,0.0018054345,0.012538425],"category_scores_gemma":[0.005134423,0.00082679914,0.0011259838,0.0026274333,0.0032939797,0.0071118497,0.0032835917,0.0029185961,0.0025102391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036114678,0.00002338725,0.00020388815,0.00009693644,0.000016301417,0.00015003662,0.00019510102,0.0015143771,0.00047302857,0.98650694,0.004664374,0.00611941],"study_design_scores_gemma":[0.000010968013,0.000009392127,0.00017150676,0.00003699287,0.000012885844,0.00023217592,0.00014713591,0.0052778684,0.00022748794,0.98818016,0.005682195,0.000011195746],"about_ca_topic_score_codex":0.001698834,"about_ca_topic_score_gemma":0.0022812376,"teacher_disagreement_score":0.012538425,"about_ca_system_score_codex":0.0015728936,"about_ca_system_score_gemma":0.00065952726,"threshold_uncertainty_score":0.04194522},"labels":[],"label_agreement":null},{"id":"W2404741992","doi":"","title":"The Maximal Total Irregularity of Unicyclic Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01675135721819802,"score_gpt":0.2652470835438106,"score_spread":0.2484957263256126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404741992","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7406144,0.0019506717,0.05845506,0.002417955,0.00023292875,0.000052558902,0.0013004782,0.00028827836,0.19468762],"genre_scores_gemma":[0.9868504,0.00066232914,0.0041666487,0.00013961538,0.00015386718,0.000034521785,0.0004035238,0.000055066786,0.0075341845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993445,0.00015777287,0.00003560697,0.00016451595,0.00017605536,0.00012146192],"domain_scores_gemma":[0.99609333,0.001840248,0.0006224977,0.0006914956,0.0003605741,0.0003918585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060776883,0.0003645044,0.0005544942,0.001892323,0.0013152362,0.0025897757,0.000877727,0.0006041497,0.0055989306],"category_scores_gemma":[0.0060408185,0.00042340215,0.00046544016,0.0017741558,0.0028032411,0.0027635426,0.0018744023,0.0012347784,0.0005591015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112833935,0.00001759457,0.0019791862,0.00013295162,0.000022870781,0.00012480422,0.0003813444,0.004513876,0.0016361995,0.97270715,0.004019418,0.014351856],"study_design_scores_gemma":[0.00001574364,0.000017736638,0.0011307893,0.00003333183,0.000024957008,0.00031033042,0.00018787054,0.008997827,0.0009774414,0.9825571,0.00573688,0.000010091595],"about_ca_topic_score_codex":0.0011182842,"about_ca_topic_score_gemma":0.0014523378,"teacher_disagreement_score":0.0055989306,"about_ca_system_score_codex":0.0010633112,"about_ca_system_score_gemma":0.00036704505,"threshold_uncertainty_score":0.018730283},"labels":[],"label_agreement":null},{"id":"W2404800073","doi":"","title":"Extremal Zeroth-Order General Randic Index Of Thorn Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Order (exchange); Topological index; Combinatorics; Discrete mathematics; Statistics; Computer science; Business","score_opus":0.04256496288708617,"score_gpt":0.27728302598257365,"score_spread":0.23471806309548748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404800073","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7115719,0.0008637199,0.03050703,0.0009872381,0.0003066123,0.000046690857,0.00040357886,0.00037606157,0.25493717],"genre_scores_gemma":[0.973631,0.00027439964,0.006247121,0.00016420957,0.00012990383,0.000026119738,0.00020344488,0.00009808367,0.019225687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975306,0.000046285117,0.00000891205,0.000048102524,0.000073913274,0.000069748945],"domain_scores_gemma":[0.99939835,0.00017069608,0.00010631134,0.00008971799,0.000083654835,0.00015127247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002881146,0.00033276188,0.0005256595,0.0022228623,0.0013740336,0.0020950404,0.00076457975,0.0008802434,0.009590751],"category_scores_gemma":[0.0017766993,0.00025822865,0.00029827707,0.00062925764,0.0017826206,0.0018971366,0.0011315693,0.0012742426,0.0011416373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053729036,0.000015581723,0.00043396268,0.0000353982,0.000005624993,0.00012286259,0.00012725906,0.0009050888,0.0016690686,0.9899593,0.0020843563,0.0045878496],"study_design_scores_gemma":[0.000022583472,0.00001972576,0.0009706763,0.000024658846,0.00000922591,0.00035586557,0.00018061137,0.008501848,0.0009912712,0.98433465,0.004570649,0.000018182674],"about_ca_topic_score_codex":0.0009091652,"about_ca_topic_score_gemma":0.0019653882,"teacher_disagreement_score":0.009590751,"about_ca_system_score_codex":0.0009941497,"about_ca_system_score_gemma":0.0004165876,"threshold_uncertainty_score":0.032084227},"labels":[],"label_agreement":null},{"id":"W2404828447","doi":"","title":"On Transitive Cayley Graphs of Strong Semilatttices of Rectangular Groups.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cayley graph; Mathematics; Transitive relation; Combinatorics; Vertex-transitive graph; Pure mathematics; Graph; Voltage graph; Line graph","score_opus":0.023982158909415057,"score_gpt":0.28700531360345893,"score_spread":0.26302315469404386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404828447","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6790747,0.0012190276,0.13860819,0.0009936981,0.00044603553,0.00013737203,0.0007878289,0.000532042,0.17820105],"genre_scores_gemma":[0.9512388,0.0006204192,0.018428907,0.00035012557,0.00019423357,0.000090961665,0.000772186,0.00012499419,0.02817938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999483,0.0001520735,0.00003097145,0.0001196756,0.0001034546,0.00011086047],"domain_scores_gemma":[0.9983583,0.0006284115,0.00037605825,0.00020975206,0.00016361669,0.00026381013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038258103,0.0005147608,0.00051256415,0.0014526042,0.0014804708,0.0022326228,0.0007957781,0.0007173417,0.011800903],"category_scores_gemma":[0.0019117749,0.00047816895,0.0006868234,0.00095922995,0.0019465291,0.0032590788,0.0018104342,0.0014076439,0.0015093503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045946137,0.000024836056,0.00048397147,0.00006460137,0.000013342453,0.00018939494,0.00038548838,0.0011219636,0.0016006,0.9877845,0.0018756852,0.0064097275],"study_design_scores_gemma":[0.000023862718,0.000033562246,0.0006915243,0.00004463903,0.000018458699,0.00025414562,0.0004221756,0.0059627905,0.0013018256,0.9844721,0.006759208,0.00001566157],"about_ca_topic_score_codex":0.0012840587,"about_ca_topic_score_gemma":0.0023372942,"teacher_disagreement_score":0.011800903,"about_ca_system_score_codex":0.00075435103,"about_ca_system_score_gemma":0.00033437484,"threshold_uncertainty_score":0.039478004},"labels":[],"label_agreement":null},{"id":"W2405072688","doi":"","title":"On the Szeged Index of some Benzenoid Graphs Applicable in Nanostructures.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Computer science; World Wide Web","score_opus":0.014286796395551563,"score_gpt":0.2590999318885012,"score_spread":0.24481313549294967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405072688","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64253473,0.0032589876,0.054544132,0.0026536474,0.00084297557,0.000093147115,0.0010112562,0.00034312904,0.294718],"genre_scores_gemma":[0.9691973,0.0012002608,0.011298938,0.00049146224,0.00036174257,0.000116862226,0.00036149946,0.00012171628,0.01685021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967575,0.000065498134,0.000020151128,0.000053273077,0.000108756285,0.000076548735],"domain_scores_gemma":[0.9992893,0.00025668062,0.00013227122,0.00007342076,0.0000982156,0.00015025488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051882124,0.00043681488,0.000697323,0.0035330195,0.0018114228,0.0021032318,0.0008691715,0.001250802,0.0089860745],"category_scores_gemma":[0.0018628484,0.00028453665,0.00043342277,0.0013059232,0.0016905658,0.0031059699,0.0013206607,0.0015811793,0.0011803894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028109675,0.0000140275,0.00013084343,0.000034856672,0.0000036794625,0.000043312863,0.00009603249,0.0006730096,0.0010448664,0.9927718,0.0015070545,0.003652318],"study_design_scores_gemma":[0.000012207311,0.000013717406,0.0003265779,0.000020260757,0.000005171869,0.00010830988,0.000087677894,0.0055242255,0.0006624201,0.99026406,0.0029619369,0.000013390317],"about_ca_topic_score_codex":0.00076637056,"about_ca_topic_score_gemma":0.0010576728,"teacher_disagreement_score":0.0089860745,"about_ca_system_score_codex":0.0013017724,"about_ca_system_score_gemma":0.00046004995,"threshold_uncertainty_score":0.030061424},"labels":[],"label_agreement":null},{"id":"W2405125483","doi":"","title":"On the Laplacian Spectral Radius of Unicyclic Graphs with Fixed Diameter.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Combinatorics; RADIUS; Laplace operator; Mathematical analysis; Eigenvalues and eigenvectors; Physics; Computer science; Computer network; Quantum mechanics","score_opus":0.02509817658149875,"score_gpt":0.26372755145711074,"score_spread":0.238629374875612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405125483","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70633405,0.016572466,0.15028411,0.0065442375,0.00073803193,0.00008430957,0.0011022673,0.00076509954,0.11757549],"genre_scores_gemma":[0.9820134,0.003415651,0.008798606,0.00032257923,0.0006082408,0.00008451979,0.00025864755,0.00018454975,0.0043138587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914646,0.00035927593,0.000029934594,0.00016273023,0.00016045992,0.00014113473],"domain_scores_gemma":[0.9892231,0.0076742717,0.0010470072,0.00051493954,0.00061533443,0.00092535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013546983,0.0007638144,0.0010880854,0.004356469,0.001219184,0.00204279,0.0022903548,0.0014417644,0.0047857715],"category_scores_gemma":[0.017155953,0.0005499958,0.0003655036,0.002160369,0.0029350147,0.0040402184,0.0022738858,0.0015425354,0.0010711893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003015791,0.00007733906,0.0022236095,0.00029253165,0.00005432927,0.0002649802,0.00062935456,0.034681983,0.005006954,0.91855216,0.015213998,0.022701172],"study_design_scores_gemma":[0.000052587486,0.000060101596,0.0019997645,0.00012704726,0.000048503138,0.00047823836,0.00050646055,0.11663218,0.0016040533,0.8726388,0.005787891,0.00006441003],"about_ca_topic_score_codex":0.001319526,"about_ca_topic_score_gemma":0.0010634201,"teacher_disagreement_score":0.0047857715,"about_ca_system_score_codex":0.001696542,"about_ca_system_score_gemma":0.0003771578,"threshold_uncertainty_score":0.016009986},"labels":[],"label_agreement":null},{"id":"W2405149775","doi":"","title":"On the Laplacian integral (k-1)-cyclic graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.05150404660088367,"score_gpt":0.2963380189424615,"score_spread":0.2448339723415778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405149775","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5469804,0.004402569,0.09709339,0.007070099,0.001282947,0.00007895197,0.00069299556,0.00043042106,0.34196824],"genre_scores_gemma":[0.95030075,0.002360792,0.011711464,0.0011103381,0.0008758575,0.00005588868,0.0003647738,0.00015231971,0.03306775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963355,0.000094758805,0.000011978469,0.000065982065,0.00009522371,0.00009839318],"domain_scores_gemma":[0.9989667,0.00043480948,0.00018366237,0.00008370519,0.00013260813,0.00019846729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037491284,0.00062675244,0.0004983304,0.0022029486,0.0012323403,0.0014700874,0.00089672994,0.0011775711,0.010514521],"category_scores_gemma":[0.002650986,0.00029601666,0.0004681364,0.0014846256,0.0023108074,0.002498032,0.0017350245,0.0016537193,0.0013575385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002609027,0.000015972942,0.00025014376,0.000048207476,0.000005090814,0.00010432735,0.00020380286,0.0013827597,0.0010751836,0.98500305,0.0038724423,0.008013036],"study_design_scores_gemma":[0.00000695875,0.000009243372,0.00026832058,0.000020639165,0.000005509604,0.00018228692,0.000108553155,0.0057167173,0.00030858512,0.9897537,0.0036088426,0.000010635819],"about_ca_topic_score_codex":0.0019122354,"about_ca_topic_score_gemma":0.0022780567,"teacher_disagreement_score":0.010514521,"about_ca_system_score_codex":0.0011465925,"about_ca_system_score_gemma":0.00045831574,"threshold_uncertainty_score":0.03517461},"labels":[],"label_agreement":null},{"id":"W2405162587","doi":"","title":"Double hexagonal chains with the extremal PI indices.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pi; Hexagonal crystal system; Combinatorics; Geometry; Crystallography; Chemistry","score_opus":0.02565695033797098,"score_gpt":0.26077115085330893,"score_spread":0.23511420051533796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405162587","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38708314,0.0012483769,0.1230454,0.0017156036,0.0012246579,0.00012556957,0.00083676295,0.0005267718,0.4841938],"genre_scores_gemma":[0.9358547,0.00047304,0.027722511,0.00045130172,0.00018482495,0.00010913464,0.00038562293,0.00011312053,0.034705825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996989,0.000060034654,0.000013384561,0.000054439413,0.00009477909,0.000078561294],"domain_scores_gemma":[0.9995553,0.000073858355,0.000071998955,0.0001229556,0.00007289604,0.000102939186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001818138,0.00036275308,0.00032864252,0.0010004949,0.001338472,0.0021883547,0.00058302836,0.0009908174,0.017161502],"category_scores_gemma":[0.0012806497,0.00032916965,0.00023432095,0.0006605699,0.0010807253,0.0016329762,0.0014241555,0.0012361164,0.0020093312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010348896,0.000030250167,0.00047780303,0.000059603753,0.0000100717925,0.00027636669,0.00010365885,0.0010853243,0.005194084,0.9733932,0.0038417056,0.015424372],"study_design_scores_gemma":[0.00004814217,0.000047158013,0.0008344302,0.000060457045,0.000015604126,0.0007676033,0.00035459714,0.013672458,0.0075628306,0.9554332,0.02117768,0.000025903646],"about_ca_topic_score_codex":0.00056790246,"about_ca_topic_score_gemma":0.0012376227,"teacher_disagreement_score":0.017161502,"about_ca_system_score_codex":0.00042094925,"about_ca_system_score_gemma":0.00039639452,"threshold_uncertainty_score":0.057410896},"labels":[],"label_agreement":null},{"id":"W2405171052","doi":"","title":"A Zeta Function Of A Semiregular Weighted Bipartite Graph.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Graph; Complete bipartite graph; Riemann zeta function; Combinatorics; Function (biology); Prime zeta function; Discrete mathematics; Arithmetic zeta function; Pure mathematics","score_opus":0.034916556048798,"score_gpt":0.2531361223333386,"score_spread":0.2182195662845406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405171052","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78767574,0.00077521463,0.110041805,0.002056443,0.00049782626,0.000049943428,0.000543987,0.00028211917,0.09807691],"genre_scores_gemma":[0.97578365,0.0003423903,0.0047132894,0.00018450203,0.00023725482,0.000056236142,0.00020303315,0.000100590776,0.018379001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966216,0.00009391152,0.000010597166,0.000062306346,0.00008973868,0.00008134522],"domain_scores_gemma":[0.9983358,0.0006814721,0.00022550146,0.0001015502,0.00020845511,0.00044717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006920607,0.0006870951,0.00058273866,0.0027964758,0.0010281032,0.0020813786,0.0009045718,0.0010333542,0.010238083],"category_scores_gemma":[0.0030969235,0.00027345144,0.00042732296,0.0010285778,0.001967722,0.0028631003,0.0013379138,0.0013609282,0.001714777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090217734,0.000028965962,0.00054082315,0.00005786161,0.000014147611,0.00012203654,0.00016060733,0.0019940203,0.0025126918,0.98485273,0.0034621514,0.006163817],"study_design_scores_gemma":[0.000026455022,0.000024248911,0.00070811156,0.000030780426,0.000011998358,0.00024909558,0.00014629294,0.02564052,0.0009154787,0.9690607,0.003164789,0.000021549828],"about_ca_topic_score_codex":0.0005518858,"about_ca_topic_score_gemma":0.0004612597,"teacher_disagreement_score":0.010238083,"about_ca_system_score_codex":0.0010056094,"about_ca_system_score_gemma":0.00035052464,"threshold_uncertainty_score":0.034249783},"labels":[],"label_agreement":null},{"id":"W2405294156","doi":"","title":"On the zeroth-order general Randic index of unicycle graphs with k pendant vertices.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Topological index; Combinatorics; Order (exchange); Index (typography); Computer science","score_opus":0.015121232968081134,"score_gpt":0.24849435882436374,"score_spread":0.23337312585628261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405294156","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81551677,0.0018796672,0.035373174,0.0009520567,0.00037105012,0.000048328817,0.00037728762,0.00024529244,0.14523631],"genre_scores_gemma":[0.9832077,0.00061645935,0.0053858967,0.00015021836,0.00015667592,0.000033247477,0.00021629524,0.00008807701,0.010145519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995813,0.00010151885,0.000021341617,0.00008277474,0.00009458303,0.00011851191],"domain_scores_gemma":[0.9982212,0.0007176383,0.00035410025,0.00018891346,0.00019288689,0.00032521007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005222691,0.0004744975,0.0006884978,0.0030027253,0.0016207556,0.002417526,0.0012684206,0.0010125027,0.0067695235],"category_scores_gemma":[0.003502588,0.0003601007,0.00034090792,0.0012045772,0.0024061403,0.0028045427,0.0012924998,0.0012671008,0.001161744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017731069,0.00003695104,0.0012367108,0.00009384465,0.000011357665,0.00020271585,0.00036034366,0.0031011943,0.0030089929,0.9771991,0.0028918497,0.011679763],"study_design_scores_gemma":[0.000029018925,0.000045626974,0.0012858799,0.000059536607,0.000017028886,0.00034769002,0.0002848688,0.015013107,0.0014826577,0.976184,0.0052184425,0.000032072196],"about_ca_topic_score_codex":0.0013391069,"about_ca_topic_score_gemma":0.002224244,"teacher_disagreement_score":0.0067695235,"about_ca_system_score_codex":0.0011857557,"about_ca_system_score_gemma":0.00047694647,"threshold_uncertainty_score":0.022646368},"labels":[],"label_agreement":null},{"id":"W2405309804","doi":"","title":"On the harmonic index and the matching number of a tree.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Matching (statistics); Harmonic; Index (typography); Tree (set theory); Graph; Discrete mathematics; Mathematical analysis; Statistics; Physics; Quantum mechanics","score_opus":0.016207131169212588,"score_gpt":0.2697401001770398,"score_spread":0.25353296900782724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405309804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20384774,0.020327913,0.5377077,0.007504734,0.0019639747,0.00020788738,0.0018636478,0.0006499177,0.22592655],"genre_scores_gemma":[0.8443769,0.010880513,0.10646099,0.0016905203,0.0036298374,0.00052924803,0.0016386312,0.0006486183,0.030144747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977519,0.0003867364,0.000106586565,0.0005637359,0.0006571309,0.0005339391],"domain_scores_gemma":[0.98941094,0.0075544645,0.00073122716,0.000880317,0.00048241578,0.0009406194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002124471,0.0016010321,0.0020121634,0.0042829583,0.0017445593,0.0031731215,0.003346854,0.0020555202,0.010609029],"category_scores_gemma":[0.015309467,0.0006265001,0.0011717639,0.0031042888,0.0046745446,0.010628155,0.0047852537,0.0054954733,0.0029063702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033376133,0.000117032614,0.0019945155,0.00033613376,0.00007005726,0.00028102522,0.00038273353,0.01678301,0.009161262,0.91242856,0.008772735,0.049339153],"study_design_scores_gemma":[0.000029509287,0.00012988086,0.0021578341,0.00012029372,0.0000700135,0.00056049245,0.00011424427,0.053967066,0.0043862103,0.92259336,0.015793113,0.000077923876],"about_ca_topic_score_codex":0.0009168015,"about_ca_topic_score_gemma":0.0008589399,"teacher_disagreement_score":0.010609029,"about_ca_system_score_codex":0.0026587078,"about_ca_system_score_gemma":0.00071259635,"threshold_uncertainty_score":0.03549075},"labels":[],"label_agreement":null},{"id":"W2405476814","doi":"","title":"Strict lower bounds on the multiplicative Zagreb indices of graph operations.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Multiplicative function; Graph; Combinatorics; Mathematical analysis","score_opus":0.024062053785271917,"score_gpt":0.28137397878235254,"score_spread":0.2573119249970806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405476814","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16873303,0.0116642155,0.35095072,0.007946759,0.002155788,0.0001350759,0.001826222,0.0010158677,0.45557243],"genre_scores_gemma":[0.88101935,0.00508329,0.067169055,0.0016718383,0.00204641,0.00031681926,0.001186856,0.0005734405,0.040933035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964354,0.0007451281,0.00023277393,0.00058216666,0.0013611681,0.0006433319],"domain_scores_gemma":[0.9811708,0.012588236,0.0009943049,0.002554547,0.0015191298,0.0011729515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035494333,0.0017343228,0.0014232309,0.0044615846,0.0024393757,0.0062294938,0.0032044004,0.0016878702,0.013833107],"category_scores_gemma":[0.023710854,0.0010154451,0.0010778675,0.0034479583,0.0038983854,0.012749107,0.004859799,0.008125839,0.0042732125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011299169,0.000049592396,0.0005986288,0.00011868313,0.000017032145,0.000056433248,0.00018289883,0.0012210559,0.0012769559,0.9755332,0.0040973136,0.016735328],"study_design_scores_gemma":[0.000014146767,0.000030250221,0.00048529584,0.000049643797,0.000028839484,0.00013089656,0.000055036526,0.0046077766,0.0012594131,0.98643327,0.00688725,0.000018154105],"about_ca_topic_score_codex":0.00084411376,"about_ca_topic_score_gemma":0.0018521688,"teacher_disagreement_score":0.013833107,"about_ca_system_score_codex":0.0021820809,"about_ca_system_score_gemma":0.0011079515,"threshold_uncertainty_score":0.04627633},"labels":[],"label_agreement":null},{"id":"W2405660549","doi":"","title":"Graphs with fourth largest signless-Laplacian eigenvalue less than two.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Combinatorics; Physics","score_opus":0.024470155320361172,"score_gpt":0.26557758174876084,"score_spread":0.24110742642839966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405660549","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75057495,0.000945532,0.07073426,0.0040074354,0.0009199349,0.00010329393,0.0030105952,0.0020028532,0.16770126],"genre_scores_gemma":[0.9593321,0.0002606404,0.015457141,0.0005284076,0.00014198087,0.00006742466,0.0012339747,0.00017731993,0.022800881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968576,0.00007356977,0.000014988914,0.000060013717,0.00006828527,0.000097313365],"domain_scores_gemma":[0.9982327,0.0005551475,0.0003118333,0.0003107373,0.00030877194,0.0002807307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002621486,0.0005573813,0.00055139075,0.0015339624,0.0010848591,0.0013464919,0.0008633573,0.0010573725,0.015059629],"category_scores_gemma":[0.0029342666,0.00024418064,0.00033909822,0.0008124104,0.0010198142,0.0013406714,0.0011344586,0.0008642314,0.0024426186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077674136,0.00023258125,0.008063591,0.0006170515,0.00011753823,0.004015539,0.0005674827,0.0050079767,0.064338006,0.78299147,0.074837215,0.0584348],"study_design_scores_gemma":[0.000114073075,0.00009500616,0.00599966,0.00008020442,0.00007075937,0.0031526294,0.000588962,0.020539481,0.017249418,0.92576414,0.026272513,0.00007304472],"about_ca_topic_score_codex":0.00041520552,"about_ca_topic_score_gemma":0.0010097736,"teacher_disagreement_score":0.015059629,"about_ca_system_score_codex":0.00039066214,"about_ca_system_score_gemma":0.000481971,"threshold_uncertainty_score":0.050379455},"labels":[],"label_agreement":null},{"id":"W2405688950","doi":"","title":"The Harary index of digraphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Computer science; World Wide Web","score_opus":0.03885242831579169,"score_gpt":0.2925452513961638,"score_spread":0.2536928230803721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405688950","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2643071,0.007992576,0.13289808,0.005148958,0.0017975853,0.000095090116,0.0029331176,0.00060089637,0.58422655],"genre_scores_gemma":[0.9299222,0.0031483392,0.02153371,0.0007859999,0.0010136771,0.0001056654,0.0009553054,0.00022707117,0.042308092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892753,0.00025452542,0.00008218864,0.00024098554,0.00029307348,0.00020169864],"domain_scores_gemma":[0.9964378,0.0015146161,0.0005404984,0.0004424877,0.00046942258,0.0005952694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087561127,0.0005980623,0.0010714128,0.0063186833,0.0027569483,0.0058844094,0.0011637111,0.0012966255,0.014207592],"category_scores_gemma":[0.006418477,0.00044980974,0.00061315775,0.003958168,0.0027663538,0.010358229,0.00308561,0.0025810343,0.0025369846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002761167,0.000012274147,0.00042102914,0.00004759399,0.000011425804,0.0000390785,0.00016290988,0.000316793,0.00036627118,0.98594207,0.0032999795,0.009353028],"study_design_scores_gemma":[0.000008091375,0.000011625165,0.0005350456,0.000037560578,0.000013432006,0.00015703765,0.00013437061,0.0018884736,0.00034281355,0.9859666,0.010892431,0.000012518443],"about_ca_topic_score_codex":0.0011088981,"about_ca_topic_score_gemma":0.0015399107,"teacher_disagreement_score":0.014207592,"about_ca_system_score_codex":0.0022442995,"about_ca_system_score_gemma":0.0006605419,"threshold_uncertainty_score":0.04752916},"labels":[],"label_agreement":null},{"id":"W2405742734","doi":"","title":"A kind of conditional vertex connectivity of recursive circulants.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.057658729856271594,"score_gpt":0.31222086328666004,"score_spread":0.25456213343038847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405742734","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.357013,0.0013649131,0.3525034,0.0018445975,0.0007546605,0.00013811384,0.0017367831,0.001380636,0.2832639],"genre_scores_gemma":[0.9538141,0.00043076594,0.029528666,0.0005503139,0.0003598134,0.000078375124,0.0006939233,0.00026052416,0.0142835025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993992,0.00013597918,0.000021025859,0.00017451134,0.00015079323,0.00011848162],"domain_scores_gemma":[0.99672925,0.0013816436,0.0004190779,0.00055954244,0.0005031002,0.00040737208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037601189,0.00030316296,0.00042112864,0.0016102078,0.00151947,0.002208621,0.00087021734,0.0011924664,0.010079233],"category_scores_gemma":[0.006057364,0.00036568672,0.0004548845,0.0012586921,0.0021248672,0.0025241335,0.0012161464,0.0016879564,0.0010922664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011869687,0.0000063572047,0.00022955229,0.000024713889,0.000003570574,0.00008626488,0.00009187579,0.0003918559,0.0009846269,0.9927533,0.0018655797,0.003550327],"study_design_scores_gemma":[0.000015474432,0.000017860306,0.0007813358,0.000032170974,0.000015109266,0.00051781797,0.00009785787,0.009315685,0.001027117,0.9775939,0.010566882,0.000018869066],"about_ca_topic_score_codex":0.0014416223,"about_ca_topic_score_gemma":0.002062087,"teacher_disagreement_score":0.010079233,"about_ca_system_score_codex":0.00082063634,"about_ca_system_score_gemma":0.0004480375,"threshold_uncertainty_score":0.033718407},"labels":[],"label_agreement":null},{"id":"W2405767764","doi":"","title":"On the lexicographical ordering by spectral moments of bicyclic graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Lexicographical order; Mathematics; Combinatorics","score_opus":0.017958184928951345,"score_gpt":0.2663089914562024,"score_spread":0.24835080652725106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405767764","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51379126,0.005689998,0.24637574,0.004093028,0.0009697695,0.000090425565,0.0011216989,0.0007404158,0.22712766],"genre_scores_gemma":[0.95008755,0.0019753615,0.027783714,0.0008158198,0.0006740451,0.00007607907,0.00052432215,0.00025916996,0.017804043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994104,0.00019047948,0.000025380772,0.000089149326,0.00014041098,0.00014415215],"domain_scores_gemma":[0.996986,0.0016544444,0.0003985768,0.00031290174,0.0002981487,0.00034988803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057100074,0.00051164866,0.0007420315,0.0025172206,0.0012689172,0.002319345,0.0009173908,0.001027568,0.009686756],"category_scores_gemma":[0.0053318664,0.00049766724,0.00043480084,0.0020675852,0.002459337,0.0034324,0.0014839513,0.0017092549,0.0015717474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053932843,0.00002194617,0.00031658215,0.000052273357,0.0000056194112,0.00007303602,0.00016730314,0.0017667009,0.0011274534,0.98317105,0.00360324,0.009640921],"study_design_scores_gemma":[0.000010892972,0.000014675749,0.00029987431,0.000027424077,0.000005454561,0.0001219588,0.00009380819,0.0077243224,0.0004514301,0.98802954,0.0032064444,0.000014205367],"about_ca_topic_score_codex":0.0012651242,"about_ca_topic_score_gemma":0.0022660529,"teacher_disagreement_score":0.009686756,"about_ca_system_score_codex":0.0010696959,"about_ca_system_score_gemma":0.00053461106,"threshold_uncertainty_score":0.032405496},"labels":[],"label_agreement":null},{"id":"W2405828630","doi":"","title":"On the Hosoya index of unicyclic graphs with a new given diameter.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Index (typography); Computer science; World Wide Web","score_opus":0.018651515790496523,"score_gpt":0.2531056592473146,"score_spread":0.2344541434568181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405828630","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74389106,0.0048539806,0.078924,0.0022112005,0.0008365047,0.00006092225,0.00084734766,0.00037911744,0.16799593],"genre_scores_gemma":[0.9818232,0.0010583231,0.010000765,0.00016634943,0.0005008785,0.000050382456,0.00020314511,0.00010395873,0.0060930606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939036,0.0001309928,0.000032907206,0.00013756864,0.00016453667,0.00014369933],"domain_scores_gemma":[0.9965055,0.0017476534,0.0005207396,0.00027314964,0.00030918335,0.0006437119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081714714,0.00045379283,0.0009600473,0.0030312166,0.0014553734,0.002717548,0.0013628919,0.0011850118,0.004924856],"category_scores_gemma":[0.006409169,0.00030585064,0.00036740315,0.002182648,0.002558109,0.004666179,0.0018628228,0.0016833183,0.0005921718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020352185,0.000035561745,0.0015253939,0.00010868213,0.000015859452,0.00010318472,0.00038947002,0.0036370556,0.0031227332,0.97526723,0.0040096515,0.011581632],"study_design_scores_gemma":[0.000044261567,0.00006221212,0.002704417,0.000072968585,0.000047249297,0.00041071165,0.00048560454,0.030253265,0.00230998,0.95363605,0.009923973,0.000049345574],"about_ca_topic_score_codex":0.0011500272,"about_ca_topic_score_gemma":0.0015319926,"teacher_disagreement_score":0.004924856,"about_ca_system_score_codex":0.0019491081,"about_ca_system_score_gemma":0.0005235935,"threshold_uncertainty_score":0.01647532},"labels":[],"label_agreement":null},{"id":"W2405999666","doi":"","title":"On the average eccentricity of unicyclic graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eccentricity (behavior); Combinatorics; Psychology","score_opus":0.030527434356021697,"score_gpt":0.2790060066540664,"score_spread":0.24847857229804468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405999666","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7628306,0.010770368,0.15350758,0.0040537794,0.00057103374,0.000058025005,0.0018999745,0.00054903136,0.06575963],"genre_scores_gemma":[0.98237777,0.002758096,0.009700723,0.00021785585,0.00044424794,0.00004870083,0.00040133632,0.00017848886,0.0038729208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988526,0.000322807,0.000047382386,0.00033963556,0.0002318345,0.0002056988],"domain_scores_gemma":[0.9770808,0.015758744,0.0025959339,0.0018947724,0.0012432722,0.0014265053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018196808,0.0005970406,0.0012709801,0.0033132886,0.0010955558,0.002220745,0.0019133423,0.0013548454,0.00676669],"category_scores_gemma":[0.028932715,0.0005651994,0.00032584596,0.002447756,0.0023248706,0.005828903,0.0019287356,0.0014847027,0.0012498088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008052367,0.00014898137,0.0138095915,0.0006677725,0.0001859314,0.00044656105,0.00072016305,0.09496408,0.0097655505,0.77669144,0.02228334,0.07951132],"study_design_scores_gemma":[0.00006090395,0.00009862023,0.005352468,0.00014749802,0.000078638004,0.0010040603,0.00033168134,0.100002065,0.0029043572,0.8820691,0.007896209,0.000054365497],"about_ca_topic_score_codex":0.0007724992,"about_ca_topic_score_gemma":0.0009807238,"teacher_disagreement_score":0.00676669,"about_ca_system_score_codex":0.0012600044,"about_ca_system_score_gemma":0.00042552382,"threshold_uncertainty_score":0.022636771},"labels":[],"label_agreement":null},{"id":"W2406155186","doi":"","title":"On the Merrifield-Simmons index and Hosoya index of bicyclic graphs with a given girth.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Girth (graph theory); Mathematics; Combinatorics; Index (typography); Discrete mathematics; Computer science","score_opus":0.019514727435922315,"score_gpt":0.25834961748710167,"score_spread":0.23883489005117936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406155186","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78550977,0.0052595064,0.042899147,0.002091559,0.00048381364,0.00006204507,0.00095823465,0.00023758347,0.1624984],"genre_scores_gemma":[0.98565173,0.0014926767,0.0059000403,0.00017713038,0.0003483707,0.000039158902,0.00030405808,0.00005056165,0.006036293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995419,0.00011924697,0.000020819873,0.0000731182,0.00014101068,0.000104017],"domain_scores_gemma":[0.997472,0.0012476706,0.00039155563,0.00018862933,0.00028665186,0.00041348708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008564077,0.0005227074,0.00080167403,0.0042792954,0.0011235003,0.0017124702,0.000995357,0.0008007593,0.006202808],"category_scores_gemma":[0.005402489,0.0002282863,0.00027879863,0.0027288094,0.0020455876,0.0036229107,0.0014891522,0.0013141361,0.00076854636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026044264,0.00004657369,0.003059065,0.00010585964,0.000023714103,0.0001185106,0.0005193127,0.0058744377,0.0023009698,0.95430154,0.006658731,0.026730968],"study_design_scores_gemma":[0.000042883006,0.000072913965,0.0039638407,0.000075331605,0.000032001182,0.0003832587,0.00041276068,0.018536504,0.0015635986,0.9668455,0.008020361,0.00005099588],"about_ca_topic_score_codex":0.0015640105,"about_ca_topic_score_gemma":0.0018910095,"teacher_disagreement_score":0.006202808,"about_ca_system_score_codex":0.0011647164,"about_ca_system_score_gemma":0.00050567585,"threshold_uncertainty_score":0.020750463},"labels":[],"label_agreement":null},{"id":"W2406159111","doi":"","title":"Extremal Trees of the Eccentric Connectivity Index","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eccentric; Index (typography); Statistics; Topological index; Combinatorics; Computer science; World Wide Web; Structural engineering","score_opus":0.043572902612251094,"score_gpt":0.28565826364942415,"score_spread":0.24208536103717304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406159111","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7901748,0.0013430823,0.10965984,0.0016475809,0.0001399457,0.0000410243,0.0008061318,0.00030187608,0.095885545],"genre_scores_gemma":[0.9779309,0.0006287433,0.012872464,0.00020176786,0.00024107262,0.000050362032,0.00034421094,0.00012191012,0.0076085315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999569,0.0001000472,0.000017975097,0.00009788528,0.00012470398,0.00009030179],"domain_scores_gemma":[0.99613994,0.002141952,0.00062913913,0.00025829326,0.00037569512,0.00045500492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007242103,0.00040356384,0.00090109167,0.003244432,0.0015033896,0.0032147083,0.0010450856,0.0014519949,0.008097291],"category_scores_gemma":[0.006292248,0.0005142878,0.00033740752,0.0019057846,0.0018515015,0.003599113,0.0015832983,0.0019495765,0.0006748404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061953564,0.000020204601,0.0010811219,0.00005455758,0.000010242622,0.00014475848,0.00019216139,0.003225915,0.0014388388,0.9853416,0.0018404238,0.006588342],"study_design_scores_gemma":[0.00001420674,0.000009151032,0.0010427323,0.000022443766,0.000012783282,0.00027211208,0.0000903975,0.01571199,0.00047943386,0.9802719,0.0020607298,0.000012111881],"about_ca_topic_score_codex":0.00048169954,"about_ca_topic_score_gemma":0.0007351769,"teacher_disagreement_score":0.008097291,"about_ca_system_score_codex":0.000997057,"about_ca_system_score_gemma":0.00028388904,"threshold_uncertainty_score":0.027088165},"labels":[],"label_agreement":null},{"id":"W2406187070","doi":"","title":"The spectral characterization of graphs of index less than 2 with no Z n as a component.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Characterization (materials science); Index (typography); Component (thermodynamics); Combinatorics; Physics; Computer science; Materials science; Nanotechnology; World Wide Web; Thermodynamics","score_opus":0.011045731583445876,"score_gpt":0.24482581669248316,"score_spread":0.23378008510903728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406187070","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69659156,0.0018706187,0.089672156,0.00295823,0.00046457743,0.0000595666,0.0012094686,0.0004531988,0.20672046],"genre_scores_gemma":[0.9742312,0.0005681146,0.00981484,0.00042789543,0.00028641726,0.00004719361,0.0006693101,0.00012833337,0.013826669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974054,0.000061186154,0.000011056828,0.00006604944,0.000063692794,0.00005748954],"domain_scores_gemma":[0.9985808,0.0005433436,0.0002685216,0.00015373732,0.00020750887,0.00024607746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002980593,0.00043134074,0.00036525837,0.0022583853,0.0010142477,0.0016145279,0.00072414643,0.0006472508,0.005215841],"category_scores_gemma":[0.0023950236,0.0002612984,0.0003241227,0.0009382738,0.0016422331,0.0027238491,0.0009970798,0.0011115618,0.0011374332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020668902,0.00004211876,0.0014632097,0.0001031925,0.000012319205,0.00018973979,0.00055409095,0.0017063364,0.009933111,0.9609414,0.007832468,0.01701537],"study_design_scores_gemma":[0.000020166128,0.000027830129,0.0019170522,0.000044835713,0.000018622377,0.0006004123,0.00041101407,0.009790785,0.003291821,0.97375643,0.010102189,0.000018835693],"about_ca_topic_score_codex":0.00078293425,"about_ca_topic_score_gemma":0.0006790455,"teacher_disagreement_score":0.005215841,"about_ca_system_score_codex":0.0006116171,"about_ca_system_score_gemma":0.00032269637,"threshold_uncertainty_score":0.017448783},"labels":[],"label_agreement":null},{"id":"W2406243916","doi":"","title":"Defensive alliances in circulant graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Circulant matrix; Mathematics; Combinatorics","score_opus":0.02530739306303901,"score_gpt":0.27995575678977586,"score_spread":0.2546483637267368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406243916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33028892,0.0020519048,0.33135563,0.004900657,0.00063551136,0.00024470498,0.00078826596,0.0008526792,0.3288817],"genre_scores_gemma":[0.92401284,0.00096409017,0.034372203,0.0007122765,0.0002553822,0.00017984721,0.0004378942,0.000109584274,0.038955975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986816,0.00047596288,0.000056742745,0.00025372897,0.00027392525,0.0002579516],"domain_scores_gemma":[0.99407864,0.0023664308,0.001066553,0.00067712885,0.0005758143,0.0012355188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009966413,0.000490972,0.0007216446,0.0019676716,0.0030687966,0.0034563588,0.0011517243,0.0017794288,0.014243306],"category_scores_gemma":[0.0069083907,0.0004376639,0.00067340967,0.0017402164,0.0024757253,0.004905611,0.0026967162,0.0023590478,0.002576169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016463167,0.000017131413,0.00020516168,0.000029100112,0.000007726013,0.00008182042,0.00018476907,0.00071146776,0.00044697468,0.99105704,0.0022081698,0.005034202],"study_design_scores_gemma":[0.000018080516,0.00001764796,0.00027476304,0.000032930664,0.000016050839,0.00028324738,0.00026889698,0.008946968,0.00032381757,0.9801942,0.009610154,0.000013190398],"about_ca_topic_score_codex":0.0011352559,"about_ca_topic_score_gemma":0.0017554417,"teacher_disagreement_score":0.014243306,"about_ca_system_score_codex":0.0013278062,"about_ca_system_score_gemma":0.0008055864,"threshold_uncertainty_score":0.04764861},"labels":[],"label_agreement":null},{"id":"W2406309141","doi":"","title":"On the (Laplacian) spectral radius of bipartite graphs with given number of blocks.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Spectral radius; Combinatorics; RADIUS; Laplace operator; Graph; Mathematical analysis; Eigenvalues and eigenvectors; Computer science; Physics; Computer network","score_opus":0.02758121325164764,"score_gpt":0.25775508451875734,"score_spread":0.2301738712671097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406309141","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47359818,0.00766061,0.41059247,0.0061713373,0.000620787,0.000098476805,0.0012204486,0.0009504148,0.09908738],"genre_scores_gemma":[0.94901574,0.002346651,0.038403008,0.0006441426,0.0007303444,0.00016667262,0.00049809605,0.0003875698,0.0078077293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984547,0.00080426136,0.00004970697,0.00024040378,0.00026017602,0.00019068681],"domain_scores_gemma":[0.98610014,0.010262572,0.0011012628,0.0007702063,0.00075038854,0.0010155395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020212452,0.00079451536,0.0010309137,0.0029214185,0.0010291444,0.0019114463,0.0021960814,0.0018739491,0.006586704],"category_scores_gemma":[0.020558847,0.0005440499,0.00041462743,0.0016272322,0.0033106806,0.0046352413,0.0020805786,0.0018932419,0.00141821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024314808,0.00007129354,0.0015677987,0.00022874128,0.000043740092,0.00012818663,0.00034133875,0.03593011,0.0037100818,0.9270312,0.012647271,0.018057022],"study_design_scores_gemma":[0.000034652887,0.00003800739,0.0010991502,0.0000655857,0.000021330341,0.00025529214,0.00018734962,0.123961315,0.0010193266,0.87025696,0.003023303,0.00003779648],"about_ca_topic_score_codex":0.0011801303,"about_ca_topic_score_gemma":0.0011666691,"teacher_disagreement_score":0.006586704,"about_ca_system_score_codex":0.0015068853,"about_ca_system_score_gemma":0.0004390761,"threshold_uncertainty_score":0.022034705},"labels":[],"label_agreement":null},{"id":"W2406396761","doi":"","title":"Computation of the edge Wiener indices of the sum of graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Computation; Enhanced Data Rates for GSM Evolution; Wiener index; Combinatorics; Graph; Algorithm; Computer science; Artificial intelligence","score_opus":0.03589183753706476,"score_gpt":0.26737686522212983,"score_spread":0.23148502768506507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406396761","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49132505,0.0013092374,0.43354338,0.00065056066,0.00043886513,0.000045171768,0.00058429607,0.0006148216,0.07148859],"genre_scores_gemma":[0.8982811,0.0004937842,0.08240631,0.00010339288,0.00012194131,0.000060980685,0.0006227271,0.00042136386,0.017488344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996904,0.00007326666,0.000018145356,0.000047374393,0.000119696895,0.000051184135],"domain_scores_gemma":[0.9990526,0.00040319026,0.00009978621,0.00013414238,0.0001605402,0.00014970388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006762285,0.00058159337,0.0006592347,0.0022599804,0.00068836,0.0015712634,0.0011795133,0.0007008026,0.006109361],"category_scores_gemma":[0.0049185976,0.00037364705,0.0005244966,0.00095343584,0.0010706664,0.003479596,0.0015965117,0.0012776138,0.0014645925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011607426,0.000044373915,0.0011199857,0.00012070851,0.000039829283,0.0001645598,0.00019865116,0.0103906905,0.00645192,0.95469,0.003458434,0.023204817],"study_design_scores_gemma":[0.0000136913495,0.000023775794,0.00092163624,0.00003383714,0.000019894484,0.00018968961,0.00007842096,0.107174724,0.0054681436,0.8828652,0.0031863232,0.000024718458],"about_ca_topic_score_codex":0.00045568324,"about_ca_topic_score_gemma":0.0014023087,"teacher_disagreement_score":0.006109361,"about_ca_system_score_codex":0.00056636805,"about_ca_system_score_gemma":0.00039918363,"threshold_uncertainty_score":0.020437837},"labels":[],"label_agreement":null},{"id":"W2406417745","doi":"","title":"On the Wiener index of rooted product of graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Index (typography); Combinatorics; Product (mathematics); Statistics; Discrete mathematics; Graph; Computer science; Geometry; World Wide Web","score_opus":0.019957228077385876,"score_gpt":0.2559265809331849,"score_spread":0.235969352855799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406417745","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46879876,0.00783544,0.28574535,0.00275964,0.0013557439,0.000056687702,0.0006735907,0.00039297013,0.23238184],"genre_scores_gemma":[0.93208444,0.003393547,0.029438637,0.00044587173,0.0011228456,0.000081026614,0.00040703267,0.0003224472,0.03270421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914455,0.00023059428,0.000052335017,0.00015332615,0.00025389646,0.00016526463],"domain_scores_gemma":[0.99660707,0.0015218724,0.00055864506,0.0002971275,0.00039841773,0.00061681436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013300318,0.00077806145,0.0010548729,0.005043684,0.0014741087,0.0033431454,0.0012698548,0.0013890583,0.0065395134],"category_scores_gemma":[0.0076404484,0.0005040507,0.00065316254,0.002346395,0.0032431167,0.008590191,0.002890322,0.0022423922,0.001740799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019256697,0.000008615371,0.00023206124,0.000024642119,0.000006044873,0.00003973372,0.00012002494,0.00061568356,0.000543683,0.9936195,0.0008728733,0.0038979363],"study_design_scores_gemma":[0.0000040946748,0.000011224328,0.00027746547,0.000020432784,0.0000067992887,0.00009469809,0.000062895466,0.0054706708,0.000302942,0.99161595,0.0021215696,0.000011158826],"about_ca_topic_score_codex":0.0008748181,"about_ca_topic_score_gemma":0.0011961801,"teacher_disagreement_score":0.0065395134,"about_ca_system_score_codex":0.0014327051,"about_ca_system_score_gemma":0.00045139,"threshold_uncertainty_score":0.021876872},"labels":[],"label_agreement":null},{"id":"W2406440815","doi":"","title":"Minimizing the least eigenvalue of bicyclic graphs with k pendant vertices.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Combinatorics; Bicyclic molecule; Chemistry; Medicinal chemistry; Physics","score_opus":0.03411369322353293,"score_gpt":0.2815135971341634,"score_spread":0.2473999039106305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406440815","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7413009,0.00088681094,0.19305137,0.0015631417,0.0002468367,0.000109600616,0.00087736244,0.00055526604,0.061408788],"genre_scores_gemma":[0.9374988,0.00043498163,0.044445395,0.00018618764,0.000079255115,0.00013453941,0.00056538056,0.00022138328,0.01643413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996959,0.00008498609,0.000011845368,0.00006238188,0.000065128785,0.00007976299],"domain_scores_gemma":[0.99899834,0.00048522517,0.00014287556,0.000079483936,0.000117286276,0.00017678077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027473402,0.00073143473,0.0005849946,0.000743508,0.0006483096,0.0010143844,0.00088212756,0.0010541747,0.0064243027],"category_scores_gemma":[0.0030595977,0.0003205185,0.00020894823,0.00066209707,0.0006445057,0.0009813776,0.00091976445,0.00063860137,0.0012274677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008905415,0.00027775558,0.0038493467,0.0011894996,0.0001183757,0.00076359854,0.0006719013,0.1981163,0.06439185,0.5789267,0.042311177,0.108493],"study_design_scores_gemma":[0.000097047465,0.0001492926,0.002290363,0.00008586654,0.00003448678,0.00043093826,0.00054477697,0.3699376,0.010520959,0.610179,0.0056773266,0.00005238085],"about_ca_topic_score_codex":0.0009734162,"about_ca_topic_score_gemma":0.0020151255,"teacher_disagreement_score":0.0064243027,"about_ca_system_score_codex":0.0005153905,"about_ca_system_score_gemma":0.00037554043,"threshold_uncertainty_score":0.021491468},"labels":[],"label_agreement":null},{"id":"W2406468902","doi":"","title":"A function on bounds of the spectral radius of graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; RADIUS; Function (biology); Combinatorics; Computer science; Physics; Eigenvalues and eigenvectors; Computer network","score_opus":0.014209811686800767,"score_gpt":0.2554356070726158,"score_spread":0.24122579538581504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406468902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24690859,0.018778361,0.49352667,0.01094911,0.0014247391,0.00011437188,0.0016126743,0.0019281122,0.22475745],"genre_scores_gemma":[0.90302914,0.0058793733,0.062409285,0.0012995714,0.002268441,0.00036245023,0.0007859735,0.0011344488,0.022831377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974003,0.001093976,0.00009528001,0.0005500324,0.0005340671,0.00032636317],"domain_scores_gemma":[0.9629434,0.02860833,0.002145759,0.002154409,0.0017404626,0.0024075625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039257295,0.00175406,0.0014947825,0.0056728525,0.0015574842,0.0040486986,0.0029226923,0.0027214163,0.011449934],"category_scores_gemma":[0.042169254,0.0007625246,0.0009957341,0.0027114386,0.004877366,0.009958599,0.0036206483,0.0047242623,0.0031111934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022910192,0.00005467777,0.0013468805,0.00020104328,0.000042549033,0.0001053392,0.00039891092,0.008340917,0.0025358945,0.95409596,0.010559599,0.022089103],"study_design_scores_gemma":[0.000025809913,0.00007207916,0.002552695,0.00019278917,0.000056318637,0.00046463765,0.0002279563,0.0678796,0.0020125597,0.9140338,0.012423745,0.00005791596],"about_ca_topic_score_codex":0.0009245661,"about_ca_topic_score_gemma":0.0005932607,"teacher_disagreement_score":0.011449934,"about_ca_system_score_codex":0.002588053,"about_ca_system_score_gemma":0.00061307003,"threshold_uncertainty_score":0.038303852},"labels":[],"label_agreement":null},{"id":"W2406485966","doi":"","title":"On Randic index and the matching number.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Matching (statistics); Index (typography); Statistics; Combinatorics; Computer science; World Wide Web","score_opus":0.010943963129212479,"score_gpt":0.2666375419769148,"score_spread":0.25569357884770233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406485966","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.202916,0.025816465,0.114679284,0.012934944,0.003428266,0.00008665522,0.0009720019,0.00046289852,0.63870347],"genre_scores_gemma":[0.89148194,0.010852256,0.0316033,0.0019026613,0.00371356,0.00016696262,0.00059669133,0.0002927481,0.059389908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991035,0.000267555,0.000048559872,0.0001944658,0.0002309574,0.0001549766],"domain_scores_gemma":[0.99597615,0.0021650856,0.0006519417,0.00040456495,0.00041807312,0.00038417726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014718658,0.0006671123,0.0012168474,0.0050424733,0.0018578115,0.003203491,0.0015595878,0.0015296282,0.011403332],"category_scores_gemma":[0.010280424,0.00040582055,0.00048748104,0.0030570682,0.0037999316,0.008593082,0.0027068856,0.0032301687,0.0027763706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026613261,0.000010710911,0.00023702369,0.000037621845,0.000004870358,0.000027389144,0.00006873092,0.0005377873,0.00020527739,0.98777175,0.0035427967,0.007529448],"study_design_scores_gemma":[0.0000063901757,0.000008094658,0.00029836633,0.000028099486,0.0000064781543,0.00008903899,0.000050683906,0.0018999017,0.00015477891,0.9908393,0.006609202,0.0000096448575],"about_ca_topic_score_codex":0.001119099,"about_ca_topic_score_gemma":0.0012370092,"teacher_disagreement_score":0.011403332,"about_ca_system_score_codex":0.001809632,"about_ca_system_score_gemma":0.00055696437,"threshold_uncertainty_score":0.038147926},"labels":[],"label_agreement":null},{"id":"W2406672015","doi":"","title":"The Generalized Pell p-Sequences in Groups.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.05178874408818458,"score_gpt":0.3084652999284593,"score_spread":0.2566765558402747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406672015","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1891564,0.00533223,0.23725958,0.006434652,0.0017377861,0.0001544849,0.0009309837,0.0008774973,0.5581164],"genre_scores_gemma":[0.8383078,0.0039763846,0.05288266,0.0015925688,0.0011696939,0.00022329962,0.00064144447,0.00033081486,0.10087538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999506,0.00016999085,0.00002564237,0.00010381457,0.000113979295,0.000080565085],"domain_scores_gemma":[0.9993243,0.00022172244,0.00009578838,0.00010106392,0.000121064884,0.00013606226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041601178,0.0007904582,0.00047780148,0.0021954118,0.001591751,0.002951159,0.00069445436,0.0011529877,0.01471234],"category_scores_gemma":[0.0031619938,0.0003744758,0.00053557754,0.0019191807,0.0030233916,0.004929048,0.0026946268,0.002190017,0.003940987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013261867,0.0000035255453,0.000072877,0.000025278816,0.0000027355798,0.000045449782,0.00010999095,0.0002658165,0.00033526553,0.988655,0.0019402903,0.008530536],"study_design_scores_gemma":[0.0000042128513,0.0000064788837,0.00007858399,0.000010366505,0.000002641736,0.00010270674,0.00006925483,0.00069403555,0.00022889658,0.9915937,0.0072036874,0.000005476729],"about_ca_topic_score_codex":0.00090834516,"about_ca_topic_score_gemma":0.0009454965,"teacher_disagreement_score":0.01471234,"about_ca_system_score_codex":0.0009148599,"about_ca_system_score_gemma":0.00065235066,"threshold_uncertainty_score":0.04921764},"labels":[],"label_agreement":null},{"id":"W2406793730","doi":"","title":"The minimal Kirchhoff index of graphs with k edge-disjoint cycles.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Disjoint sets; Enhanced Data Rates for GSM Evolution; Index (typography); Combinatorics; Computer science; Telecommunications","score_opus":0.014301038652346413,"score_gpt":0.25554152942606795,"score_spread":0.24124049077372153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406793730","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7279444,0.0016826033,0.060817122,0.0013711546,0.0005870368,0.00007868267,0.0014538093,0.000483229,0.20558204],"genre_scores_gemma":[0.98007065,0.0004612314,0.007640859,0.00012874432,0.0001498695,0.000049595656,0.00043417758,0.000094222436,0.01097055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960285,0.00006558211,0.00002901988,0.000085110376,0.000102401034,0.00011500375],"domain_scores_gemma":[0.9986707,0.00040124168,0.00024500804,0.00015374442,0.00019088892,0.00033844146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003649592,0.00043337344,0.00064807176,0.002934119,0.002011744,0.0028362817,0.0014844934,0.00091875636,0.010302557],"category_scores_gemma":[0.0033548945,0.00030520285,0.00036450196,0.0013938926,0.0016503525,0.0039084195,0.0015111652,0.001019195,0.0017330387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019017584,0.000047543504,0.0011520418,0.00009854137,0.000018072518,0.00012742013,0.00023287191,0.0021357334,0.0038682912,0.9735797,0.004316693,0.014232867],"study_design_scores_gemma":[0.000019599553,0.000022593116,0.0011054929,0.000034450615,0.000018009367,0.00028074943,0.0002293789,0.012381707,0.0023251176,0.9784762,0.0050800373,0.000026579768],"about_ca_topic_score_codex":0.0014707,"about_ca_topic_score_gemma":0.0016507627,"teacher_disagreement_score":0.010302557,"about_ca_system_score_codex":0.0011572338,"about_ca_system_score_gemma":0.00069829426,"threshold_uncertainty_score":0.034465432},"labels":[],"label_agreement":null},{"id":"W2406858909","doi":"","title":"The maximum Sum-Balaban index of trees with given diameter.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Statistics; Computer science","score_opus":0.014088627495174292,"score_gpt":0.24614539956981885,"score_spread":0.23205677207464456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406858909","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6624225,0.005507781,0.16283436,0.0031241984,0.00070825935,0.000072452356,0.0025905296,0.00088522834,0.16185474],"genre_scores_gemma":[0.957905,0.0011604304,0.027814547,0.00031014695,0.00036608422,0.000085351356,0.00083165267,0.0002469321,0.011279819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919754,0.00022569868,0.000054476597,0.00017100765,0.00020047674,0.00015082206],"domain_scores_gemma":[0.99481934,0.0028403143,0.00056562154,0.00054117665,0.00050578936,0.0007277763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014179433,0.0005080289,0.0012550128,0.0027471285,0.001986507,0.004884931,0.0016694361,0.0013495845,0.006184394],"category_scores_gemma":[0.011710353,0.0004180219,0.00047434447,0.0023998602,0.0019373188,0.0069088684,0.0022755328,0.0018279708,0.0016521041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035876207,0.00004722637,0.001803614,0.00020207773,0.000029811612,0.00008901751,0.000400359,0.0056651817,0.0037146045,0.9565919,0.0074069817,0.02369039],"study_design_scores_gemma":[0.000026127056,0.000040587463,0.00078145537,0.000055556644,0.000030063167,0.00032807584,0.0002184781,0.020348093,0.002124908,0.9687571,0.007267209,0.000022405955],"about_ca_topic_score_codex":0.00053919764,"about_ca_topic_score_gemma":0.0007879925,"teacher_disagreement_score":0.006184394,"about_ca_system_score_codex":0.0016104861,"about_ca_system_score_gemma":0.0007468509,"threshold_uncertainty_score":0.020688891},"labels":[],"label_agreement":null},{"id":"W2406975124","doi":"","title":"The exponents of double vertex graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.027384973600296222,"score_gpt":0.29142627137063637,"score_spread":0.26404129777034013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406975124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49552092,0.0082439585,0.10069031,0.0065216566,0.003349998,0.000099053854,0.0008987458,0.0005415277,0.38413382],"genre_scores_gemma":[0.95199895,0.0023962685,0.0092979865,0.00045133985,0.0009877809,0.000055305616,0.00023128199,0.00017934166,0.034401737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996209,0.0001047176,0.000020171481,0.00005648638,0.00011128733,0.00008647383],"domain_scores_gemma":[0.9978296,0.0009228295,0.0003977137,0.00020998114,0.00027996858,0.0003597268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052408304,0.00078530813,0.0005274244,0.0029838162,0.001185945,0.0026627963,0.00060706603,0.0007620084,0.010558247],"category_scores_gemma":[0.0058219796,0.00036233058,0.00039463976,0.0008950245,0.0021866653,0.0043813256,0.0018441405,0.0020057352,0.0019644613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047968475,0.000011595238,0.00041339287,0.000064967535,0.0000067463834,0.00019783516,0.00021021478,0.00055605225,0.0011573005,0.9858511,0.003573331,0.007909533],"study_design_scores_gemma":[0.00001828745,0.000014524542,0.00044406374,0.000063299776,0.000009861747,0.0003156907,0.00019454243,0.0031060218,0.00074417307,0.9841591,0.010918193,0.000012233305],"about_ca_topic_score_codex":0.0004690279,"about_ca_topic_score_gemma":0.0006711006,"teacher_disagreement_score":0.010558247,"about_ca_system_score_codex":0.00084713905,"about_ca_system_score_gemma":0.0003203676,"threshold_uncertainty_score":0.035320878},"labels":[],"label_agreement":null},{"id":"W2407019363","doi":"","title":"The Wiener-type indices of the corona of two graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Corona (planetary geology); Combinatorics; Physics; Geology; Astrobiology","score_opus":0.02840760911434877,"score_gpt":0.3027431880251227,"score_spread":0.2743355789107739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407019363","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5709826,0.0026056583,0.13165836,0.0017223106,0.0013634957,0.000065136024,0.00079507317,0.00028721645,0.2905201],"genre_scores_gemma":[0.95945364,0.0008004009,0.018588569,0.00030636817,0.0004958218,0.00005845076,0.00034172754,0.00013733552,0.0198177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943846,0.0001567703,0.000036138343,0.00011125726,0.00014014094,0.000117242984],"domain_scores_gemma":[0.99857426,0.00041680367,0.00025144903,0.0001784126,0.0002484888,0.0003306667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008072639,0.0005995324,0.00066951,0.0031923493,0.0016647887,0.0034722148,0.00089398294,0.0014937886,0.006412702],"category_scores_gemma":[0.0041575446,0.00043467464,0.0006794248,0.0013355929,0.0028029908,0.005744734,0.0018752624,0.0016301777,0.0013014779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026553515,0.000009206883,0.00031631312,0.000017040435,0.0000058419796,0.00005838022,0.0001208012,0.00025378278,0.00093632314,0.9942431,0.0008709905,0.0031415657],"study_design_scores_gemma":[0.000011292705,0.000017251305,0.0008217522,0.000027938679,0.000010567316,0.00026288934,0.00015532468,0.0032803214,0.00069131976,0.9907391,0.003964829,0.000017406499],"about_ca_topic_score_codex":0.0005511879,"about_ca_topic_score_gemma":0.00074673776,"teacher_disagreement_score":0.006412702,"about_ca_system_score_codex":0.0011149712,"about_ca_system_score_gemma":0.00044223873,"threshold_uncertainty_score":0.021452665},"labels":[],"label_agreement":null},{"id":"W2407122695","doi":"","title":"Unit distance representations of the Petersen graph in the plane.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Unit (ring theory); Combinatorics; Graph; Plane (geometry); Geometry; Mathematics education","score_opus":0.036970490430902496,"score_gpt":0.30514793856466876,"score_spread":0.26817744813376626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407122695","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47419778,0.0019493301,0.1632692,0.0016412014,0.00046076457,0.000062521314,0.0009408718,0.00052056246,0.3569577],"genre_scores_gemma":[0.9504246,0.00084415,0.018323576,0.00018780556,0.00019705744,0.000033529024,0.00042683716,0.00015363412,0.029408928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997795,0.000045926798,0.00000856012,0.000040297044,0.00008109836,0.000044594766],"domain_scores_gemma":[0.99965453,0.00008343468,0.00008203006,0.000059594022,0.000056594832,0.00006379741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017731331,0.00039001484,0.00032580277,0.0017396401,0.000841042,0.0021826343,0.000758391,0.00080421043,0.011663346],"category_scores_gemma":[0.001194548,0.00019800704,0.00026639886,0.0013378673,0.0009922746,0.0026757405,0.0013627043,0.0014047553,0.0017628077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023588138,0.000012416628,0.000089090514,0.000019409717,0.000003327874,0.00004127099,0.000114531045,0.0011318161,0.00048832764,0.987087,0.0016990808,0.009290003],"study_design_scores_gemma":[0.000011468331,0.00001614366,0.00032742927,0.000015806101,0.0000067795954,0.00013873288,0.00025659613,0.0097798435,0.0006676774,0.98050505,0.008263201,0.000011243381],"about_ca_topic_score_codex":0.001029982,"about_ca_topic_score_gemma":0.0010375363,"teacher_disagreement_score":0.011663346,"about_ca_system_score_codex":0.0005040649,"about_ca_system_score_gemma":0.00024228643,"threshold_uncertainty_score":0.039017797},"labels":[],"label_agreement":null},{"id":"W2407188313","doi":"","title":"On the number of 5-matchings in boron-nitrogen fullerene graphs","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Boron; Fullerene; Combinatorics; Mathematics; Nitrogen; Chemistry; Organic chemistry","score_opus":0.03511994836403767,"score_gpt":0.2989461793533954,"score_spread":0.26382623098935776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407188313","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88452864,0.001342469,0.02966653,0.004824075,0.00037325727,0.000078174235,0.0013656211,0.00043386832,0.07738732],"genre_scores_gemma":[0.9758807,0.00064803363,0.011308149,0.00046076937,0.00017773164,0.000096245014,0.00077073224,0.0001361818,0.010521502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986702,0.00028253274,0.00008392835,0.00033928527,0.00032300767,0.00030104924],"domain_scores_gemma":[0.993453,0.0036447803,0.0012354356,0.0005243661,0.00040458512,0.0007378769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012801772,0.0006401473,0.0011957313,0.0029186571,0.0027326348,0.0040029464,0.0022978396,0.0026319781,0.015285555],"category_scores_gemma":[0.006281056,0.0006186745,0.0009425733,0.0022950526,0.0024920923,0.0059443964,0.0016219867,0.0019642904,0.0009128381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074714015,0.00018504851,0.003590701,0.0004842849,0.00008793531,0.0002117442,0.0005382711,0.01669032,0.009922396,0.9328007,0.008627698,0.026113762],"study_design_scores_gemma":[0.00011674616,0.000083123545,0.0027729739,0.00013757058,0.00011090303,0.00036567388,0.0004800316,0.05252065,0.0052624154,0.9321071,0.0059825103,0.000060223658],"about_ca_topic_score_codex":0.0018901773,"about_ca_topic_score_gemma":0.003311357,"teacher_disagreement_score":0.015285555,"about_ca_system_score_codex":0.0025002859,"about_ca_system_score_gemma":0.0010626834,"threshold_uncertainty_score":0.051135242},"labels":[],"label_agreement":null},{"id":"W2407434981","doi":"","title":"A note on the Merrifield-Simmons index of connected graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Discrete mathematics; Computer science; World Wide Web","score_opus":0.031073673351009412,"score_gpt":0.289381530602243,"score_spread":0.25830785725123356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407434981","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099516355,0.023719778,0.12283999,0.016091537,0.0083234,0.00009193994,0.0010269361,0.00081118266,0.727579],"genre_scores_gemma":[0.8714577,0.012271369,0.05489505,0.0038104414,0.006285919,0.00014036425,0.0005157872,0.00056289334,0.0500605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991258,0.00023556147,0.00004505843,0.00018701295,0.00031684476,0.00008982784],"domain_scores_gemma":[0.99617165,0.0022369134,0.0003478373,0.0004267734,0.0003645267,0.00045232786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013987701,0.00075171347,0.0011166678,0.0056404374,0.001932088,0.0033277217,0.0017781291,0.0018510064,0.012921725],"category_scores_gemma":[0.009934331,0.0004242031,0.00063148927,0.0051008393,0.0038143548,0.008958785,0.0030615022,0.003814273,0.0017973515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023824225,0.000008420816,0.00021781996,0.000052379444,0.0000063899524,0.00006754456,0.00014132485,0.00037581148,0.00036200872,0.98123944,0.0075650006,0.009939995],"study_design_scores_gemma":[0.00000688512,0.000010287994,0.00034833179,0.00002928637,0.0000070555516,0.00014720458,0.000058280457,0.0014140795,0.00025258504,0.98019123,0.017521337,0.000013402907],"about_ca_topic_score_codex":0.0013284195,"about_ca_topic_score_gemma":0.001792865,"teacher_disagreement_score":0.012921725,"about_ca_system_score_codex":0.0018028008,"about_ca_system_score_gemma":0.0005664714,"threshold_uncertainty_score":0.043227434},"labels":[],"label_agreement":null},{"id":"W2407758378","doi":"","title":"On Optimal Orientations Of Tensor Product Of Graphs And Circulant Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Circulant matrix; Tensor product; Combinatorics; Product (mathematics); Indifference graph; Discrete mathematics; Pure mathematics; Graph; Geometry","score_opus":0.02012450017543241,"score_gpt":0.28443272586301593,"score_spread":0.2643082256875835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407758378","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46095538,0.005021013,0.29919955,0.0035904476,0.0011197022,0.00013776697,0.0010024734,0.0005812039,0.22839248],"genre_scores_gemma":[0.8789948,0.0033332377,0.08149156,0.0005947385,0.00073456485,0.00013631115,0.0012036687,0.00059732766,0.03291373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992248,0.00023306564,0.000034745877,0.00013446125,0.00016830595,0.00020458225],"domain_scores_gemma":[0.99733907,0.0009994092,0.00039484302,0.00033174254,0.00033863194,0.0005963063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008850313,0.0007803778,0.0007420792,0.0017242318,0.0016428985,0.0031508536,0.0010548985,0.0012259142,0.0105700055],"category_scores_gemma":[0.0045524347,0.00069054315,0.0006317596,0.0015349801,0.0025696177,0.0057037086,0.0018908638,0.0024280297,0.0017424586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050721304,0.000039672246,0.0003915742,0.000052017254,0.0000058108103,0.000046655765,0.00013856168,0.0021929364,0.0009149137,0.9797641,0.0048420005,0.011560978],"study_design_scores_gemma":[0.0000106984,0.000015922185,0.00030656077,0.000027707123,0.000008069401,0.00007975448,0.00016251938,0.008508081,0.00048660772,0.9857997,0.004582933,0.000011494763],"about_ca_topic_score_codex":0.0019910727,"about_ca_topic_score_gemma":0.003570075,"teacher_disagreement_score":0.0105700055,"about_ca_system_score_codex":0.0015188934,"about_ca_system_score_gemma":0.0007203518,"threshold_uncertainty_score":0.035360217},"labels":[],"label_agreement":null},{"id":"W2407866540","doi":"","title":"The Second-minimum Gutman Index of The Unicyclic Graphs With Given Girth","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Girth (graph theory); Combinatorics","score_opus":0.023401138733837396,"score_gpt":0.2644847689060365,"score_spread":0.2410836301721991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407866540","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90781724,0.0008968767,0.026441777,0.0009541336,0.00021021238,0.000028501563,0.00073273544,0.00025454702,0.062663965],"genre_scores_gemma":[0.98695314,0.00030631304,0.0070985802,0.00011147799,0.00012277148,0.00004510342,0.0003851961,0.000085114254,0.0048924536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996092,0.00008758288,0.000017888942,0.0000890503,0.0000881126,0.0001083011],"domain_scores_gemma":[0.9984359,0.00059953297,0.00032161,0.00017737193,0.00016539093,0.00030018197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004608422,0.0006490768,0.0009509478,0.002691137,0.001643429,0.0029325748,0.0013391955,0.0012592701,0.005647328],"category_scores_gemma":[0.0031521267,0.00038421882,0.00048386565,0.0016400691,0.0013728451,0.0023231737,0.0011486745,0.0014322904,0.0006330808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057076185,0.00007193597,0.0035266974,0.0002845975,0.00005656484,0.00029870137,0.00065728504,0.00943336,0.014008555,0.945047,0.006501583,0.019542918],"study_design_scores_gemma":[0.00007188846,0.00013667595,0.005451365,0.00010863782,0.000065392174,0.0007407421,0.0004373153,0.043667126,0.00689149,0.9350906,0.0072655585,0.00007319715],"about_ca_topic_score_codex":0.0006634425,"about_ca_topic_score_gemma":0.0010679668,"teacher_disagreement_score":0.005647328,"about_ca_system_score_codex":0.0013502294,"about_ca_system_score_gemma":0.0006913507,"threshold_uncertainty_score":0.018892229},"labels":[],"label_agreement":null},{"id":"W2408410163","doi":"","title":"The extremal primitive digraph with both Lewin index n-2 and girth 2 or 3.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Mathematics; Index (typography); Girth (graph theory); Combinatorics; Discrete mathematics; Computer science","score_opus":0.017387574524466425,"score_gpt":0.2572090345658944,"score_spread":0.23982146004142796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408410163","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6636783,0.00066311413,0.024653526,0.0016829341,0.00031175272,0.0000653162,0.001578428,0.00037643054,0.3069902],"genre_scores_gemma":[0.9710136,0.00023921407,0.008324046,0.00027443477,0.00004528241,0.000022562046,0.00062970986,0.000043971628,0.019407213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998839,0.000020958101,0.0000038592043,0.00003022892,0.000021832542,0.000039308507],"domain_scores_gemma":[0.99969125,0.0000877542,0.000041063486,0.00005203937,0.000029222916,0.00009863412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000093453855,0.00023327526,0.00028157464,0.0006064585,0.0010591188,0.0010564352,0.00048023037,0.0007447564,0.008830679],"category_scores_gemma":[0.00069070404,0.00020853902,0.00020552713,0.00043297803,0.0007903343,0.000887358,0.0008406542,0.00091601827,0.0010493706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031522516,0.000053107364,0.0013057461,0.00014813528,0.000022295042,0.0013463626,0.0002632459,0.0026894095,0.008689476,0.9497872,0.012331841,0.023047986],"study_design_scores_gemma":[0.000060527887,0.000056597,0.0032897932,0.00006334792,0.00002863501,0.0014048999,0.00036021712,0.010855894,0.0044514593,0.9561742,0.023218993,0.000035343066],"about_ca_topic_score_codex":0.0011205502,"about_ca_topic_score_gemma":0.0029659476,"teacher_disagreement_score":0.008830679,"about_ca_system_score_codex":0.0005842371,"about_ca_system_score_gemma":0.0004773774,"threshold_uncertainty_score":0.029541552},"labels":[],"label_agreement":null},{"id":"W2408455752","doi":"","title":"Spectral radius of graph with given diameter.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Graph; Combinatorics; Physics; Eigenvalues and eigenvectors; Quantum mechanics","score_opus":0.03305815472178219,"score_gpt":0.2529730904398955,"score_spread":0.21991493571811332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408455752","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7183241,0.004122687,0.16766587,0.0034414819,0.00051545945,0.0000664132,0.00210792,0.0010357744,0.10272015],"genre_scores_gemma":[0.9754843,0.0012393306,0.015913738,0.00023058648,0.00032929107,0.0000851615,0.00057692186,0.00017767656,0.005962904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915886,0.0002770379,0.00003387337,0.00022865168,0.00015840263,0.00014326679],"domain_scores_gemma":[0.9951382,0.0024745304,0.00069239835,0.00036080854,0.0005243361,0.00080965325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074529316,0.00053539843,0.0009680438,0.002638849,0.0011437365,0.002000942,0.0013633332,0.0011771141,0.005255525],"category_scores_gemma":[0.0075982395,0.00033239063,0.00034923878,0.0013451884,0.0016478577,0.0030905954,0.0016531786,0.00083463045,0.0014430074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000503551,0.00006699098,0.0032991967,0.00043993338,0.000054558623,0.00029152582,0.0008064842,0.01708812,0.012836626,0.92370546,0.01917979,0.021727882],"study_design_scores_gemma":[0.000064115724,0.00012487243,0.0054001412,0.00012252109,0.00007827101,0.0016665178,0.00091088633,0.11262409,0.0071727284,0.8514506,0.020329265,0.000056057448],"about_ca_topic_score_codex":0.0007108444,"about_ca_topic_score_gemma":0.0004483391,"teacher_disagreement_score":0.005255525,"about_ca_system_score_codex":0.0011015361,"about_ca_system_score_gemma":0.00031789648,"threshold_uncertainty_score":0.017581463},"labels":[],"label_agreement":null},{"id":"W2408639442","doi":"","title":"Extremal Zagreb indices of unicyclic graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Statistics","score_opus":0.021593084862577064,"score_gpt":0.2880633975609883,"score_spread":0.26647031269841126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408639442","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63981414,0.0028897235,0.03462211,0.0011995255,0.0005732792,0.000040303486,0.00064631284,0.00026991937,0.31994468],"genre_scores_gemma":[0.98053956,0.00072630605,0.0055976273,0.00013462361,0.00017217768,0.000027826016,0.00025285126,0.000058467653,0.012490572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964523,0.000074348194,0.000017558083,0.000058540787,0.000104081635,0.00010026755],"domain_scores_gemma":[0.9993048,0.00020230236,0.00017534227,0.00009226452,0.00009021716,0.00013517779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034631352,0.00037024627,0.00053432706,0.0022424818,0.0012217421,0.0022527077,0.0007876408,0.00062456436,0.0063461126],"category_scores_gemma":[0.002405409,0.00027549572,0.00022264954,0.0011638913,0.001333542,0.0018473099,0.0013464188,0.0014291743,0.0008995591],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006455065,0.000015847943,0.0006544392,0.000049896673,0.0000070843757,0.000097239616,0.00014797354,0.0009772159,0.0009709539,0.98284966,0.0023645076,0.011800641],"study_design_scores_gemma":[0.00001797341,0.000016133756,0.0013685904,0.00004286363,0.000015144398,0.00034593715,0.00015943125,0.0061365305,0.0008337749,0.9841122,0.0069389828,0.000012416772],"about_ca_topic_score_codex":0.0009816758,"about_ca_topic_score_gemma":0.0017987817,"teacher_disagreement_score":0.0063461126,"about_ca_system_score_codex":0.00096437533,"about_ca_system_score_gemma":0.00033674823,"threshold_uncertainty_score":0.021229863},"labels":[],"label_agreement":null},{"id":"W241438246","doi":"10.1090/tran/6899","title":"Generalisation of the Hammersley-Clifford theorem on bipartite graphs","year":2016,"lang":"en","type":"preprint","venue":"Transactions of the American Mathematical Society","topic":"Graph theory and applications","field":"Mathematics","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 British Columbia Graduate School; University of British Columbia","keywords":"Bipartite graph; Markov chain; Mathematics; Combinatorics; Nearest neighbour; Discrete mathematics; Robertson–Seymour theorem; Random field; Embedding; Graph; Computer science; 1-planar graph; Artificial intelligence; Chordal graph","score_opus":0.03998581841665647,"score_gpt":0.30387632977182555,"score_spread":0.26389051135516906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W241438246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08063176,0.000692592,0.86147016,0.0014134063,0.00022409472,0.000099235374,0.0004985599,0.00072818674,0.054242026],"genre_scores_gemma":[0.898507,0.0010970676,0.077987045,0.0016644784,0.00048545777,0.00028496893,0.0009505445,0.00056508026,0.01845846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983316,0.0004724298,0.000090940295,0.0004814202,0.00040297132,0.000220626],"domain_scores_gemma":[0.9958918,0.0018952118,0.0002886207,0.0011156948,0.00046801596,0.00034062334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018936141,0.00073361374,0.0008171183,0.0020142368,0.0012417666,0.0017617138,0.001666611,0.0016921745,0.0076103406],"category_scores_gemma":[0.0072214934,0.00054483896,0.001833264,0.0014602601,0.0031253267,0.004663885,0.0034730695,0.00255802,0.0014137763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017768227,0.000012816026,0.00031204842,0.000031336433,0.000014419728,0.000099184916,0.00011557294,0.0070874663,0.00073351985,0.98534214,0.0011420127,0.0050917077],"study_design_scores_gemma":[0.0000044008543,0.000007520095,0.00018735517,0.000009362015,0.0000045334523,0.000053334636,0.000019051686,0.01685638,0.00022529473,0.9808957,0.0017294262,0.000007814949],"about_ca_topic_score_codex":0.0033391265,"about_ca_topic_score_gemma":0.0022466902,"teacher_disagreement_score":0.0076103406,"about_ca_system_score_codex":0.0015304245,"about_ca_system_score_gemma":0.0007289821,"threshold_uncertainty_score":0.02545917},"labels":[],"label_agreement":null},{"id":"W242749661","doi":"10.13001/1081-3810.2990","title":"Normalized rational semiregular graphs","year":2015,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Graph theory and applications","field":"Mathematics","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":"Royal Military College of Canada","funders":"","keywords":"Combinatorics; Mathematics; Adjacency matrix; Vertex (graph theory); Eigenvalues and eigenvectors; Bipartite graph; Incidence matrix; Discrete mathematics; Diagonal; Adjacency list; Graph energy; Graph; Line graph; Graph power","score_opus":0.033567273929795464,"score_gpt":0.3073047502799164,"score_spread":0.2737374763501209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W242749661","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73662335,0.00031862265,0.17767453,0.0003228857,0.00008019827,0.000096897034,0.00086761866,0.00056974264,0.08344616],"genre_scores_gemma":[0.9771115,0.00018854081,0.016348569,0.000074171054,0.00004211924,0.0000359368,0.0005476416,0.00005132405,0.00560009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999585,0.00007408417,0.000023079308,0.000122272,0.0000951091,0.00010043396],"domain_scores_gemma":[0.9991953,0.00018073356,0.00017846347,0.00013887208,0.00015505988,0.00015158136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027201712,0.00030396637,0.00032822078,0.000896264,0.00053277187,0.0008816272,0.0004506553,0.00031136657,0.0059360955],"category_scores_gemma":[0.0015324018,0.00020533183,0.0003302484,0.00049958646,0.0012042881,0.001064813,0.00064891536,0.00045688107,0.0006731495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014889854,0.00002487789,0.001314492,0.000061294726,0.000016952245,0.00028063907,0.00023112676,0.009814175,0.010105924,0.95839006,0.0015523821,0.018059222],"study_design_scores_gemma":[0.000031028227,0.00006789252,0.0021622127,0.000018221463,0.000015553036,0.0005467333,0.00033982086,0.04320471,0.0048526227,0.9377627,0.010969929,0.00002865097],"about_ca_topic_score_codex":0.00080039963,"about_ca_topic_score_gemma":0.0011602599,"teacher_disagreement_score":0.0059360955,"about_ca_system_score_codex":0.0006250321,"about_ca_system_score_gemma":0.0003214473,"threshold_uncertainty_score":0.019858181},"labels":[],"label_agreement":null},{"id":"W2461609678","doi":"10.13001/1081-3810.3222","title":"Kemeny's Constant And An Analogue Of Braess' Paradox For Trees","year":2016,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Graph theory and applications","field":"Mathematics","cited_by":33,"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":"Mathematics; Combinatorics; Random walk; Constant (computer programming); Markov chain; Stochastic matrix; Discrete mathematics; Tree (set theory); Graph; Directed graph; State (computer science); Statistics; Algorithm","score_opus":0.026274736854813296,"score_gpt":0.3229007666529536,"score_spread":0.2966260297981403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2461609678","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58455735,0.0034706863,0.29043162,0.006895734,0.00042192466,0.00008656053,0.00032880125,0.00040985062,0.11339736],"genre_scores_gemma":[0.9765132,0.00056622113,0.015653627,0.0003830166,0.0001157426,0.000052782118,0.000042110878,0.000050736737,0.0066224793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988972,0.00039543214,0.0000468074,0.00022663234,0.00025168396,0.00018224092],"domain_scores_gemma":[0.9929838,0.0046362723,0.00068869756,0.0008205525,0.00031397401,0.00055675075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025910719,0.00033090205,0.00080912764,0.0009971524,0.0016422418,0.0024161106,0.0012103538,0.001632513,0.0053933803],"category_scores_gemma":[0.013179911,0.0003232241,0.0007725496,0.0010421294,0.0036909254,0.004978385,0.0016962942,0.002622174,0.0005006257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003333645,0.0000109518405,0.00016618229,0.000024144849,0.000005515598,0.00008093835,0.00010236006,0.0032471288,0.0008032151,0.9929997,0.00049181585,0.0020346607],"study_design_scores_gemma":[0.000009862486,0.00001100857,0.00013946714,0.0000067725914,0.0000035527746,0.000078438,0.000034478362,0.014228355,0.00029129107,0.9842461,0.0009396654,0.000011031586],"about_ca_topic_score_codex":0.00090241444,"about_ca_topic_score_gemma":0.0007474878,"teacher_disagreement_score":0.0053933803,"about_ca_system_score_codex":0.0014444271,"about_ca_system_score_gemma":0.000911894,"threshold_uncertainty_score":0.018042684},"labels":[],"label_agreement":null},{"id":"W2473951698","doi":"","title":"Fully angular hexagonal chains extremal with regard to the largest eigenvalue","year":2003,"lang":"en","type":"article","venue":"HKBU Institutional Repository (Hong Kong Baptist University)","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Eigenvalues and eigenvectors; Hexagonal crystal system; Combinatorics; Mathematics; Chain (unit); Graph; Molecule; Polynomial; Physics; Crystallography; Chemistry; Mathematical analysis; Quantum mechanics","score_opus":0.02076997308453776,"score_gpt":0.21734730158798513,"score_spread":0.19657732850344736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2473951698","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9800555,0.00007687526,0.010735031,0.00006272766,0.0000090946605,0.000008061511,0.000094434174,0.00005874242,0.008899437],"genre_scores_gemma":[0.9961914,0.00005003091,0.00268721,0.000011608492,0.000005738772,0.000008654113,0.000072288836,0.000010010343,0.00096308894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999143,0.000012160218,0.0000033663014,0.000013960171,0.000017163347,0.000039054194],"domain_scores_gemma":[0.99974614,0.00006871802,0.000060684513,0.000030038951,0.000031252017,0.000063263156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008862787,0.0001365049,0.00019407432,0.00065017544,0.00044513523,0.0006731485,0.00018354657,0.00025926626,0.003950672],"category_scores_gemma":[0.0005378815,0.00011800559,0.00014169952,0.00025260088,0.0005855994,0.00048469013,0.00039679868,0.0001889882,0.00022932953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011848806,0.00013301018,0.019173548,0.00037269277,0.00006306921,0.0014943809,0.0008140078,0.06976517,0.2678804,0.5857762,0.0033914796,0.049951106],"study_design_scores_gemma":[0.00009868475,0.0005245778,0.034169577,0.000081546365,0.000049790706,0.0013689233,0.0016425889,0.36071935,0.07139182,0.52348644,0.006322948,0.00014387316],"about_ca_topic_score_codex":0.00040336984,"about_ca_topic_score_gemma":0.00077166304,"teacher_disagreement_score":0.003950672,"about_ca_system_score_codex":0.00020093135,"about_ca_system_score_gemma":0.00023028944,"threshold_uncertainty_score":0.013216376},"labels":[],"label_agreement":null},{"id":"W2478779766","doi":"10.1016/j.dam.2017.02.009","title":"Graphs with integer matching polynomial zeros","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":8,"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":"Nemzeti Kutatási Fejlesztési és Innovációs Hivatal; Mount Allison University; Iran National Science Foundation; National Research Foundation; European Research Council; National Science Foundation","keywords":"Mathematics; Combinatorics; Matching (statistics); Discrete mathematics; 3-dimensional matching; Indifference graph; Integral graph; Chordal graph; Integer (computer science); Pathwidth; Graph; Line graph; Bipartite graph; Voltage graph; Computer science","score_opus":0.03134065194744486,"score_gpt":0.30155869251625317,"score_spread":0.2702180405688083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2478779766","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67618686,0.00074572425,0.19272113,0.0049170977,0.00046183862,0.00018855672,0.0017620099,0.0010187001,0.12199803],"genre_scores_gemma":[0.95098215,0.00041021715,0.01826739,0.0004077922,0.00019131675,0.000081234815,0.0005854794,0.00021461757,0.02885977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994118,0.000107017106,0.000024488832,0.00016222965,0.00011013718,0.00018434993],"domain_scores_gemma":[0.99767405,0.0009587342,0.0004879403,0.00033241813,0.00025019547,0.00029655002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004640956,0.00076124637,0.0009147292,0.001757612,0.0014819716,0.0028845556,0.0012518442,0.0011687819,0.014157663],"category_scores_gemma":[0.0053489916,0.00054296694,0.00053347135,0.0019108107,0.0018512214,0.0042813113,0.0021796809,0.0021452173,0.0020890862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038384603,0.00006701103,0.0005828661,0.00018099691,0.000022465114,0.00029256265,0.00029228852,0.0037048925,0.0047679157,0.9677856,0.0056256517,0.016293894],"study_design_scores_gemma":[0.00008459963,0.00004002783,0.00045962172,0.00003503875,0.000033652534,0.00030809038,0.00020167406,0.011676124,0.0035889652,0.97579974,0.0077455314,0.00002690116],"about_ca_topic_score_codex":0.00086399843,"about_ca_topic_score_gemma":0.0010249428,"teacher_disagreement_score":0.014157663,"about_ca_system_score_codex":0.0012968546,"about_ca_system_score_gemma":0.0006432088,"threshold_uncertainty_score":0.04736209},"labels":[],"label_agreement":null},{"id":"W2479921134","doi":"10.1142/9789812795427_0010","title":"CONTINUOUS GROUPS AND MOLECULAR ELECTRONIC STRUCTURE","year":2004,"lang":"en","type":"book-chapter","venue":"WORLD SCIENTIFIC eBooks","topic":"Graph theory and applications","field":"Mathematics","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":"","keywords":"Materials science","score_opus":0.013284425152833915,"score_gpt":0.23958675099672005,"score_spread":0.22630232584388615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2479921134","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.009198876,0.03654261,0.04298691,0.0048511364,0.003142092,0.00005183122,0.00020707175,0.0004079682,0.90261143],"genre_scores_gemma":[0.14410141,0.040140197,0.031521708,0.0018726907,0.0030277139,0.0001973651,0.000481315,0.00043636706,0.77822125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99990976,0.00001890291,0.0000022683157,0.000014503941,0.000045737954,0.000008798705],"domain_scores_gemma":[0.99991167,0.00003340123,0.000005782881,0.000019338635,0.00001604078,0.000013632198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014131915,0.0007602481,0.0006101182,0.001202988,0.0007467328,0.0015858692,0.0007991011,0.0008384674,0.022604493],"category_scores_gemma":[0.00031959426,0.00026210785,0.00023427918,0.0017376645,0.0019587183,0.0021870534,0.00075488526,0.0017689992,0.0045337076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041347585,0.000019704208,0.000017396498,0.00011257573,0.0000034298755,0.000016483433,0.00011271722,0.00080930634,0.0004694169,0.9217655,0.035671037,0.040998355],"study_design_scores_gemma":[0.0000063304283,0.0000115557605,0.0000707045,0.000053976808,0.0000030349258,0.00005157492,0.000066108034,0.0011685189,0.00030599168,0.799113,0.19914308,0.0000062013237],"about_ca_topic_score_codex":0.00051914155,"about_ca_topic_score_gemma":0.0009577186,"teacher_disagreement_score":0.022604493,"about_ca_system_score_codex":0.0008730432,"about_ca_system_score_gemma":0.00048773343,"threshold_uncertainty_score":0.07561958},"labels":[],"label_agreement":null},{"id":"W2500268508","doi":"10.1090/fic/056","title":"Motives and Algebraic Cycles","year":2009,"lang":"en","type":"book","venue":"American Mathematical Society eBooks","topic":"Graph theory and applications","field":"Mathematics","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 Alberta","funders":"","keywords":"Algebraic number; Mathematics; Algebra over a field; Mathematics education; Computer science; Pure mathematics; Mathematical analysis","score_opus":0.021305216649537235,"score_gpt":0.2862259550855749,"score_spread":0.2649207384360377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2500268508","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.010329388,0.0471618,0.00519088,0.0068994886,0.0020097035,0.000020993532,0.00011496197,0.00014831527,0.92812455],"genre_scores_gemma":[0.15417252,0.032915697,0.0051298197,0.0023706758,0.002080201,0.00003771074,0.00018598094,0.00020808111,0.80289936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99986935,0.000035788376,0.0000030794229,0.000023587678,0.000048694004,0.000019425781],"domain_scores_gemma":[0.99988616,0.000042678847,0.0000080488835,0.000009829971,0.000030190758,0.000023064475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001456055,0.00036994304,0.00023102158,0.00092350435,0.0011271376,0.0017458743,0.00018604632,0.00035854717,0.011266913],"category_scores_gemma":[0.0006525637,0.00018683332,0.00017712846,0.0009887575,0.001467701,0.0021861275,0.0009679013,0.0011444455,0.0029793736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071636655,0.000007362481,0.0000787637,0.000051241226,0.000003003282,0.000025915315,0.0003738914,0.0002443608,0.00028745763,0.8875765,0.08224294,0.029101433],"study_design_scores_gemma":[0.0000029545076,0.00000995253,0.00034169128,0.000079805686,0.0000028776897,0.00012172862,0.0001687097,0.0003092892,0.00015121324,0.32149875,0.6773061,0.000006871192],"about_ca_topic_score_codex":0.0018180021,"about_ca_topic_score_gemma":0.003061738,"teacher_disagreement_score":0.011266913,"about_ca_system_score_codex":0.0012881573,"about_ca_system_score_gemma":0.00066684757,"threshold_uncertainty_score":0.037691593},"labels":[],"label_agreement":null},{"id":"W2500700727","doi":"10.1090/gsm/134/14","title":"Characters and the Dirichlet theorem","year":2012,"lang":"en","type":"book-chapter","venue":"Graduate studies in mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"Université Laval","funders":"","keywords":"Mathematics; Dirichlet distribution; Pure mathematics; Mathematical analysis","score_opus":0.21265593071689504,"score_gpt":0.35666286468171254,"score_spread":0.1440069339648175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2500700727","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.0071589784,0.012911477,0.010875033,0.0039606304,0.0013283425,0.000010228767,0.00006582479,0.000095413314,0.9635941],"genre_scores_gemma":[0.2922693,0.01387726,0.0115962,0.0019743566,0.004009321,0.000076058546,0.00021074149,0.00032283968,0.6756639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996543,0.00015719852,0.000010530571,0.000045355417,0.00009693546,0.000035776447],"domain_scores_gemma":[0.9997621,0.00012302466,0.000014043367,0.000036249607,0.00003257405,0.000031952633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003953537,0.0005308128,0.00044750865,0.0009785962,0.0012577125,0.0028169733,0.00043470282,0.00083348603,0.011523924],"category_scores_gemma":[0.0012270929,0.00025973906,0.00022532072,0.0009969618,0.0035906946,0.0035166778,0.00109987,0.0024735196,0.0032640873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004338006,0.0000053221984,0.000019609835,0.000013734307,9.2805953e-7,0.000007707841,0.00013283915,0.00007530069,0.0000833804,0.9832122,0.008236679,0.008208011],"study_design_scores_gemma":[0.000002616157,0.0000032708701,0.00006317452,0.000018368168,0.0000012191766,0.000041546158,0.000049865233,0.0001788398,0.00008880949,0.90996057,0.0895887,0.000003029732],"about_ca_topic_score_codex":0.0005463458,"about_ca_topic_score_gemma":0.0007069026,"teacher_disagreement_score":0.011523924,"about_ca_system_score_codex":0.0010922769,"about_ca_system_score_gemma":0.0005451735,"threshold_uncertainty_score":0.03855139},"labels":[],"label_agreement":null},{"id":"W2502708233","doi":"10.1090/cbms/109/09","title":"Stationary measures and projective quotients","year":2008,"lang":"en","type":"book-chapter","venue":"Regional conference series in mathematics","topic":"Graph theory and applications","field":"Mathematics","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 Lethbridge","funders":"","keywords":"Projective test; Quotient; Pure mathematics; Mathematics","score_opus":0.13161645916766362,"score_gpt":0.3075932377286357,"score_spread":0.1759767785609721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2502708233","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022239601,0.036375243,0.03582525,0.0053181495,0.0025783882,0.000028329105,0.00017569578,0.0002777538,0.89718163],"genre_scores_gemma":[0.48473495,0.03845931,0.018754326,0.0014679903,0.007458671,0.00014772466,0.00050030305,0.00042964975,0.44804707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998098,0.000047830323,0.00001018576,0.000040386556,0.00007356977,0.00001833472],"domain_scores_gemma":[0.9996785,0.00013847456,0.00002594367,0.000055393328,0.00006829811,0.000033347933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035045797,0.0007786308,0.00062664074,0.0018219617,0.0011941487,0.0029525345,0.0006382658,0.00085533113,0.010274914],"category_scores_gemma":[0.0009359804,0.00033792094,0.00035651305,0.001961219,0.0030221876,0.0035873214,0.0009467278,0.0024132552,0.0022421414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023291448,0.0000034158038,0.00001561363,0.000016791735,0.0000014612841,0.000010299196,0.00009379819,0.000079748264,0.00012416478,0.98719805,0.00529036,0.0071639717],"study_design_scores_gemma":[0.0000027237588,0.000004198572,0.000088135945,0.000014794188,0.0000025538395,0.000067919515,0.000050208775,0.00030055217,0.000110587316,0.94841295,0.05094156,0.0000037920595],"about_ca_topic_score_codex":0.00062997796,"about_ca_topic_score_gemma":0.00077803334,"teacher_disagreement_score":0.010274914,"about_ca_system_score_codex":0.0011774332,"about_ca_system_score_gemma":0.00046655332,"threshold_uncertainty_score":0.034373045},"labels":[],"label_agreement":null},{"id":"W2503583255","doi":"10.1002/net.21697","title":"On the roots of the node reliability polynomial","year":2016,"lang":"en","type":"article","venue":"Networks","topic":"Graph theory and applications","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Node (physics); Robustness (evolution); Reliability (semiconductor); Mathematics; Graph; Polynomial; Discrete mathematics; Time complexity; Computer science; Combinatorics; Mathematical analysis","score_opus":0.02047053038089776,"score_gpt":0.2588936726890206,"score_spread":0.23842314230812284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2503583255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24491727,0.002042159,0.72343135,0.002248516,0.00014726797,0.00005188109,0.0005155949,0.00025733246,0.026388643],"genre_scores_gemma":[0.9575593,0.0031052635,0.030562116,0.00019452814,0.00047500993,0.00011112255,0.00034745428,0.00021382615,0.0074315607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988966,0.00037863426,0.000029138931,0.00023086663,0.00028806337,0.00017670497],"domain_scores_gemma":[0.9825482,0.013927331,0.0012093853,0.00087802263,0.0009752407,0.00046196565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018693792,0.0008126031,0.0009829464,0.0017257459,0.0005971,0.0013815811,0.0009049364,0.0007195896,0.0034720283],"category_scores_gemma":[0.023210645,0.0003553068,0.00057632575,0.0011836952,0.0036615753,0.0046407073,0.0018234217,0.0031124344,0.00083017396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009694912,0.000024078268,0.00094188505,0.000118424294,0.000017131953,0.00014223931,0.00032773247,0.06343544,0.0017227996,0.9180186,0.0023278354,0.012826866],"study_design_scores_gemma":[0.000018810404,0.000039846662,0.00068881206,0.000047910253,0.000013992469,0.00014279495,0.00010401173,0.20633318,0.0007471011,0.7890785,0.002753555,0.00003149585],"about_ca_topic_score_codex":0.0012294931,"about_ca_topic_score_gemma":0.0005501101,"teacher_disagreement_score":0.0034720283,"about_ca_system_score_codex":0.0012036638,"about_ca_system_score_gemma":0.00074829994,"threshold_uncertainty_score":0.0116150975},"labels":[],"label_agreement":null},{"id":"W2505679283","doi":"10.1007/978-3-540-93952-8_3","title":"Factors and Graphic Parameters","year":2009,"lang":"en","type":"book-chapter","venue":"","topic":"Graph theory and applications","field":"Mathematics","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":"Thompson Rivers University","funders":"","keywords":"Graph; Computer science; Graph theory; Theoretical computer science; Toughness; Degree (music); Mathematics; Combinatorics; Materials science; Physics","score_opus":0.08847759397186512,"score_gpt":0.28474309034768164,"score_spread":0.19626549637581653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2505679283","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.0045292443,0.0045668874,0.024778266,0.0011456507,0.00070898636,0.00002488051,0.00014898299,0.0003302299,0.96376693],"genre_scores_gemma":[0.13619588,0.008104211,0.020270644,0.0006172563,0.00078344694,0.000077038465,0.00042043833,0.00090551033,0.8326256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974316,0.000056522284,0.000008483579,0.000063248495,0.00009666038,0.000031991574],"domain_scores_gemma":[0.99979943,0.00005595586,0.000013042917,0.000052287232,0.000055479493,0.000023925304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018944519,0.00090839405,0.0005567781,0.0019139872,0.001050633,0.003379589,0.0005956137,0.0006473168,0.04662002],"category_scores_gemma":[0.00088522065,0.0003919336,0.0002941335,0.0019291947,0.0023730518,0.0034996567,0.0009963481,0.0022842502,0.014072403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058788955,0.0000063638936,0.000027657943,0.00003225438,0.000001578091,0.000014552655,0.00015662509,0.00024628884,0.00024226363,0.9441016,0.023654578,0.031510267],"study_design_scores_gemma":[0.0000032000692,0.0000043433242,0.00007576471,0.00003476955,0.000003825995,0.00008061559,0.00009187871,0.00043330723,0.00031132007,0.64427257,0.3546819,0.0000064953333],"about_ca_topic_score_codex":0.0014238349,"about_ca_topic_score_gemma":0.0021792909,"teacher_disagreement_score":0.04662002,"about_ca_system_score_codex":0.0014219797,"about_ca_system_score_gemma":0.00055604434,"threshold_uncertainty_score":0.15595949},"labels":[],"label_agreement":null},{"id":"W2509297719","doi":"10.1109/isit.2016.7541772","title":"Orbit-entropy cones and extremal pairwise orbit-entropy inequalities","year":2016,"lang":"en","type":"article","venue":"","topic":"Graph theory and applications","field":"Mathematics","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":"McMaster University","funders":"National Science Foundation","keywords":"Pairwise comparison; Mathematics; Entropy (arrow of time); Maximum entropy probability distribution; Orbit (dynamics); Combinatorics; Pure mathematics; Physics; Principle of maximum entropy; Statistics; Quantum mechanics","score_opus":0.054136123984012685,"score_gpt":0.2965637011597157,"score_spread":0.242427577175703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2509297719","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46330196,0.0020702712,0.47012895,0.0016062529,0.00018580449,0.00012573313,0.0014650163,0.00015810553,0.060957927],"genre_scores_gemma":[0.9700304,0.00082686124,0.023971187,0.00018615923,0.00022105289,0.00014002073,0.00061334786,0.000052577972,0.0039582723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986029,0.00040434272,0.000074949116,0.00023677187,0.00041150374,0.00026946777],"domain_scores_gemma":[0.9937118,0.0038511704,0.0009606181,0.0002674369,0.0005515934,0.00065745506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018113358,0.0008460226,0.00073554553,0.0021586376,0.0012092665,0.0020969831,0.0011738798,0.00068425096,0.005033452],"category_scores_gemma":[0.008900251,0.00035276872,0.00093180954,0.0014085968,0.0022840558,0.0039921817,0.0018439858,0.0020384786,0.00029495516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006031048,0.000034834866,0.0011527134,0.00007768156,0.000026433298,0.0001626527,0.00011801702,0.010626786,0.0016243871,0.9804216,0.0009319703,0.0047626384],"study_design_scores_gemma":[0.000012126798,0.000048927097,0.001372112,0.000030007586,0.00001386884,0.00016977482,0.00007010261,0.0981777,0.0009098816,0.8982464,0.00091850146,0.00003055581],"about_ca_topic_score_codex":0.0008238872,"about_ca_topic_score_gemma":0.0006882768,"teacher_disagreement_score":0.005033452,"about_ca_system_score_codex":0.0013226961,"about_ca_system_score_gemma":0.0008903061,"threshold_uncertainty_score":0.01683861},"labels":[],"label_agreement":null},{"id":"W2511169898","doi":"10.1139/cjc-2016-0539","title":"On the irregularity of some molecular structures","year":2016,"lang":"en","type":"article","venue":"Canadian Journal of Chemistry","topic":"Graph theory and applications","field":"Mathematics","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Topological index; Vertex (graph theory); Zigzag; Chemistry; Quantitative structure–activity relationship; Mathematical chemistry; Series (stratigraphy); Molecular descriptor; Graph; Combinatorics; Computational chemistry; Mathematics; Stereochemistry; Geometry","score_opus":0.015472562530458393,"score_gpt":0.23804022348695109,"score_spread":0.2225676609564927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2511169898","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83986896,0.0008621574,0.14614104,0.00041286406,0.00004555283,0.0000468701,0.00036054166,0.00015632354,0.01210572],"genre_scores_gemma":[0.98616356,0.0003808852,0.0120814135,0.000043858876,0.000056769833,0.000039089104,0.00024067074,0.000044315813,0.00094949175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999433,0.000167907,0.00003648217,0.00013975405,0.000155713,0.000067166606],"domain_scores_gemma":[0.9927174,0.003907722,0.0016490397,0.000855194,0.0005402146,0.00033038354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008928286,0.0003919773,0.00041709244,0.003396283,0.0006858266,0.0010028095,0.00045848987,0.0005341852,0.0012865891],"category_scores_gemma":[0.0064539523,0.00020440729,0.0004278021,0.0013841355,0.002105649,0.0019883097,0.0006793031,0.00084348745,0.00011807459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018684275,0.000083712235,0.01627243,0.0002137569,0.000079183184,0.00036389648,0.00065779313,0.1665602,0.014230306,0.7681004,0.0011468057,0.032104738],"study_design_scores_gemma":[0.00001488016,0.0001329666,0.008477967,0.000047847574,0.000035722278,0.00039022064,0.00027757147,0.37024343,0.004653575,0.61130095,0.004383523,0.000041339536],"about_ca_topic_score_codex":0.00049922254,"about_ca_topic_score_gemma":0.00040177983,"teacher_disagreement_score":0.003396283,"about_ca_system_score_codex":0.00092810893,"about_ca_system_score_gemma":0.000275646,"threshold_uncertainty_score":0.0067338943},"labels":[],"label_agreement":null},{"id":"W2512269750","doi":"10.1139/cjc-2016-0308","title":"Extremal pentagonal chains with respect to bond incident degree indices","year":2016,"lang":"en","type":"article","venue":"Canadian Journal of Chemistry","topic":"Graph theory and applications","field":"Mathematics","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chemistry; Degree (music); Chain (unit); Bond length; Pentagonal bipyramidal molecular geometry; Crystallography; Combinatorics; Mathematics; Physics; Crystal structure; Quantum mechanics","score_opus":0.038860816130110394,"score_gpt":0.26704091616464326,"score_spread":0.22818010003453287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2512269750","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8716242,0.00044132912,0.089305595,0.00017492707,0.00004184663,0.000032519463,0.00034317817,0.00013090155,0.037905417],"genre_scores_gemma":[0.9790619,0.00030882156,0.01777487,0.000032119086,0.000024649442,0.000033054315,0.0002687634,0.00004722474,0.0024486454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976534,0.000050523675,0.00001379316,0.00004328209,0.00007210583,0.00005497033],"domain_scores_gemma":[0.9991547,0.00029506645,0.00017314954,0.0001150033,0.00012653742,0.0001355543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039832792,0.0002593258,0.00029732933,0.0016413211,0.0007140345,0.0013617689,0.00041291458,0.00027029176,0.0032840334],"category_scores_gemma":[0.0017834115,0.00024240148,0.0002088323,0.0009048704,0.0010949001,0.0010094316,0.0006911831,0.0006685561,0.00023596588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027035756,0.0000643111,0.0072616786,0.00011017278,0.00002947911,0.00025152197,0.00026108144,0.048580535,0.019305294,0.8990216,0.0014227617,0.023421198],"study_design_scores_gemma":[0.000024900246,0.000079777514,0.007988928,0.00007628004,0.00003166649,0.00044417044,0.00035211944,0.21288395,0.012416102,0.76070255,0.0049349163,0.000064554806],"about_ca_topic_score_codex":0.00047779418,"about_ca_topic_score_gemma":0.00096356805,"teacher_disagreement_score":0.0032840334,"about_ca_system_score_codex":0.00041339864,"about_ca_system_score_gemma":0.0002535351,"threshold_uncertainty_score":0.010986209},"labels":[],"label_agreement":null},{"id":"W2514208647","doi":"10.1017/cbo9780511819681.006","title":"Electrostatic Inequalities","year":2009,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Inequality; Computer science; Content (measure theory); Multimedia; Mathematics; Mathematical analysis","score_opus":0.044818538244573734,"score_gpt":0.24320770052709909,"score_spread":0.19838916228252534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2514208647","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036889834,0.008491736,0.027065977,0.003665199,0.0017544089,0.000019799021,0.0010918387,0.00012664903,0.9540955],"genre_scores_gemma":[0.22731267,0.026857441,0.018770602,0.004397201,0.003877172,0.00015594218,0.002458389,0.0005382042,0.7156324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995826,0.000046641737,0.000018146166,0.00008793498,0.00019547854,0.00006933592],"domain_scores_gemma":[0.9997155,0.00008494521,0.00002166928,0.000041009298,0.00010443837,0.000032463435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004016104,0.0007112836,0.00053005514,0.0015234142,0.0008611464,0.0013926174,0.000723081,0.00072294043,0.06049793],"category_scores_gemma":[0.000995229,0.00018981584,0.00064693135,0.0010704028,0.0010125586,0.0020992034,0.0013441567,0.0020444589,0.013907779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015497122,0.00001047774,0.00010461231,0.00016640904,0.000011850798,0.00006443122,0.000053940104,0.00077427214,0.001108445,0.8904586,0.071432434,0.03579899],"study_design_scores_gemma":[0.00000901809,0.000016330898,0.0006277878,0.00009165371,0.000011106159,0.0003223793,0.000048566646,0.0024065461,0.0009778022,0.71055746,0.28491566,0.00001567965],"about_ca_topic_score_codex":0.0014329514,"about_ca_topic_score_gemma":0.0018592001,"teacher_disagreement_score":0.06049793,"about_ca_system_score_codex":0.0013750226,"about_ca_system_score_gemma":0.00054663874,"threshold_uncertainty_score":0.20238572},"labels":[],"label_agreement":null},{"id":"W2517287121","doi":"10.1109/isit.2016.7541709","title":"Cyclically symmetric entropy inequalities","year":2016,"lang":"en","type":"article","venue":"","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Science Foundation","keywords":"Bounding overwatch; Entropy (arrow of time); Combinatorics; Mathematics; Computer science; Algorithm; Artificial intelligence; Physics; Thermodynamics","score_opus":0.051885861871612635,"score_gpt":0.31158826459760364,"score_spread":0.259702402725991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2517287121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1444379,0.0027017444,0.54551613,0.0058939895,0.0008810751,0.0002719846,0.0025633352,0.00036162802,0.29737234],"genre_scores_gemma":[0.90422904,0.001865875,0.057155654,0.0016188788,0.0012542792,0.0004503419,0.0017941755,0.00025709902,0.031374734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972046,0.00076558534,0.00012976088,0.00045421353,0.00082891766,0.00061685],"domain_scores_gemma":[0.9907589,0.0056854864,0.00095325004,0.0007437436,0.0012454989,0.00061316916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026586521,0.0014139297,0.00090561213,0.002155935,0.0014859543,0.0025982216,0.0016469784,0.0013284404,0.015936635],"category_scores_gemma":[0.013642314,0.00036090508,0.0013941035,0.0016623614,0.0032359187,0.0037492176,0.0031784142,0.0036177489,0.0013016725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007692528,0.00002288843,0.00065123744,0.000109122964,0.000024042842,0.00010296724,0.00007929943,0.015521716,0.0016535195,0.9679699,0.0042538918,0.009534509],"study_design_scores_gemma":[0.000014494812,0.000045815046,0.00079233426,0.00004749404,0.000015975618,0.000078896526,0.00005313027,0.12824269,0.0015237167,0.864289,0.0048647067,0.000031753832],"about_ca_topic_score_codex":0.0028500247,"about_ca_topic_score_gemma":0.0023684213,"teacher_disagreement_score":0.015936635,"about_ca_system_score_codex":0.0030293667,"about_ca_system_score_gemma":0.0022506518,"threshold_uncertainty_score":0.053313375},"labels":[],"label_agreement":null},{"id":"W2519800085","doi":"10.1007/s10801-017-0768-0","title":"A graph for which the inertia bound is not tight","year":2017,"lang":"en","type":"preprint","venue":"Journal of Algebraic Combinatorics","topic":"Graph theory and applications","field":"Mathematics","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 Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Upper and lower bounds; Vertex (graph theory); Independence number; Graph; Discrete mathematics","score_opus":0.06945843814273166,"score_gpt":0.3474304814415874,"score_spread":0.2779720432988557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519800085","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5904057,0.0014482171,0.16585214,0.013062475,0.00088801404,0.00014307594,0.0023615279,0.0025177777,0.22332111],"genre_scores_gemma":[0.9381925,0.00058960455,0.034988135,0.0014208393,0.0002908332,0.00007453219,0.0018449542,0.0006476151,0.021950962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990901,0.00010491302,0.000040643732,0.0003504078,0.00015813741,0.00025584336],"domain_scores_gemma":[0.99273574,0.0038080567,0.0006959683,0.0011760773,0.00043328005,0.0011508826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000806791,0.00080637215,0.0016632956,0.002468193,0.005058743,0.005019818,0.0018904416,0.0043749926,0.022603692],"category_scores_gemma":[0.006713278,0.0010727401,0.0013553746,0.0026077789,0.0036113292,0.009581885,0.002897471,0.0051698517,0.0026967712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037590542,0.00012738904,0.00096066785,0.0003338502,0.000039702314,0.0006956261,0.0008079692,0.0023973696,0.0076907566,0.95892745,0.014543424,0.01309996],"study_design_scores_gemma":[0.00006203109,0.000035606077,0.00089942676,0.000058437494,0.000054679273,0.00060435117,0.0003724687,0.0073244674,0.0022049085,0.98104376,0.0073074712,0.00003244952],"about_ca_topic_score_codex":0.0020530508,"about_ca_topic_score_gemma":0.0026346208,"teacher_disagreement_score":0.022603692,"about_ca_system_score_codex":0.0011604152,"about_ca_system_score_gemma":0.0009176684,"threshold_uncertainty_score":0.075616896},"labels":[],"label_agreement":null},{"id":"W2521901064","doi":"10.1016/j.dam.2017.05.018","title":"Addressing graph products and distance-regular graphs","year":2017,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"Redeemer University; Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Hamming graph; Tuple; Mathematics; Graph; Discrete mathematics; Hamming distance; Hamming code; Algorithm","score_opus":0.09198053675506222,"score_gpt":0.3373618848032605,"score_spread":0.24538134804819828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2521901064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21100825,0.009499044,0.6692438,0.013211664,0.0014161796,0.000080507234,0.00057972426,0.0003705645,0.094590224],"genre_scores_gemma":[0.8251431,0.0064544366,0.119145304,0.0016422028,0.0027399352,0.00012444075,0.00092070963,0.00033532514,0.0434944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989784,0.0003616843,0.00004475579,0.00030537293,0.00021912527,0.00009066596],"domain_scores_gemma":[0.99714017,0.0015315857,0.000347294,0.00036568983,0.0003219851,0.00029317357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010420687,0.001059749,0.0011966976,0.0017407393,0.0018356956,0.003734283,0.0017604504,0.0025365672,0.0084008295],"category_scores_gemma":[0.0063924687,0.00052192697,0.00072465243,0.0027978083,0.0031917868,0.008836231,0.004610909,0.0040339297,0.0013158502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014962455,0.000018505543,0.00013439498,0.000071277595,0.000005945453,0.000038540555,0.0001818855,0.0013247698,0.0003217785,0.9889058,0.0018639253,0.007118155],"study_design_scores_gemma":[0.0000025680927,0.0000034263858,0.000027265773,0.0000065373606,0.0000027243589,0.00003777591,0.000055340948,0.0025063062,0.00009722694,0.9946555,0.002602458,0.0000028110537],"about_ca_topic_score_codex":0.00082561694,"about_ca_topic_score_gemma":0.0008235148,"teacher_disagreement_score":0.0084008295,"about_ca_system_score_codex":0.0012892633,"about_ca_system_score_gemma":0.000641664,"threshold_uncertainty_score":0.02810359},"labels":[],"label_agreement":null},{"id":"W2522135789","doi":"","title":"A Methodology for Topological Design of Computer Communication Networks under Link Reliability Constraints","year":2015,"lang":"en","type":"article","venue":"Hrčak Portal of scientific journals of Croatia (University Computing Centre)","topic":"Graph theory and applications","field":"Mathematics","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":"PricewaterhouseCoopers (Canada)","funders":"","keywords":"Subgradient method; Computer science; Network topology; Mathematical optimization; Reliability (semiconductor); Network planning and design; Constraint (computer-aided design); Relaxation (psychology); Set (abstract data type); Telecommunications network; Topology (electrical circuits); Distributed computing; Mathematics; Computer network","score_opus":0.2131360559887287,"score_gpt":0.35138868960623815,"score_spread":0.13825263361750945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2522135789","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.00053220603,0.00006277704,0.9973803,0.000038872757,0.000017166938,0.000055827022,0.000025806336,0.00006311796,0.0018239716],"genre_scores_gemma":[0.03247375,0.00042458234,0.96423185,0.00005418866,0.000033926695,0.00050056056,0.00011088611,0.00011812684,0.0020520086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920255,0.00033630873,0.000038689537,0.00008313348,0.00029520073,0.000044128075],"domain_scores_gemma":[0.9991387,0.00045077474,0.0001153547,0.00011157223,0.00015373097,0.000029875497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013385135,0.0010738868,0.0006060702,0.0014977704,0.0007566563,0.0008625416,0.0012867588,0.0006877076,0.0044837208],"category_scores_gemma":[0.0027320604,0.0007267271,0.0012672342,0.0013132753,0.0010610578,0.0011387093,0.0010445059,0.0013162337,0.0009487243],"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.000020668364,0.000050584043,0.0002323305,0.00048117232,0.000055880533,0.00012743354,0.00013763407,0.5793128,0.0075451816,0.30345324,0.003743,0.1048401],"study_design_scores_gemma":[0.000036065092,0.00011838603,0.00015973908,0.00012953434,0.000041724234,0.00022892306,0.000067473884,0.78199166,0.003353564,0.16530848,0.048536673,0.000027752825],"about_ca_topic_score_codex":0.0010664206,"about_ca_topic_score_gemma":0.0016034447,"teacher_disagreement_score":0.0044837208,"about_ca_system_score_codex":0.0008821494,"about_ca_system_score_gemma":0.0014067575,"threshold_uncertainty_score":0.014999568},"labels":[],"label_agreement":null},{"id":"W2533883187","doi":"","title":"Vertex-Disjoint Cycles Containing Specified Vertices in a Graph","year":2006,"lang":"en","type":"article","venue":"AKCE International Journal of Graphs and Combinatorics","topic":"Graph theory and applications","field":"Mathematics","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":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Graph; Neighbourhood (mathematics); Discrete mathematics","score_opus":0.023078572775187288,"score_gpt":0.2918039444927991,"score_spread":0.26872537171761185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2533883187","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81355625,0.00047302383,0.13997485,0.0006789828,0.00019331735,0.00069370767,0.0021408873,0.0008381585,0.041450705],"genre_scores_gemma":[0.86708814,0.00039442943,0.110154435,0.000328816,0.000035543468,0.00073020277,0.0027109839,0.000254315,0.018303037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992347,0.00013520582,0.000083996616,0.0001978524,0.00015714034,0.00019119775],"domain_scores_gemma":[0.99672985,0.0012932889,0.0005530059,0.00039203858,0.00052594533,0.00050594314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041182278,0.0008548993,0.0007571872,0.002186059,0.003266041,0.0030122602,0.0018812383,0.002092001,0.006521934],"category_scores_gemma":[0.0035591521,0.00090525026,0.0007790672,0.0029072075,0.0012848605,0.0025634435,0.002108011,0.00088425406,0.0011883236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016737527,0.0005101691,0.012119606,0.0008558587,0.00024387772,0.00604458,0.0039542345,0.026000211,0.058160774,0.81375545,0.009025688,0.06765575],"study_design_scores_gemma":[0.00032382383,0.0003112087,0.004633659,0.00039521157,0.00047778068,0.0020834967,0.0028031124,0.08990858,0.07471003,0.778468,0.045721825,0.00016328602],"about_ca_topic_score_codex":0.003898515,"about_ca_topic_score_gemma":0.0064827544,"teacher_disagreement_score":0.006521934,"about_ca_system_score_codex":0.0010586714,"about_ca_system_score_gemma":0.0016457333,"threshold_uncertainty_score":0.021818042},"labels":[],"label_agreement":null},{"id":"W2539312954","doi":"10.1139/cjc-2016-0458","title":"On the Wiener index and variants of the Szeged index of single-walled titania nanotubes TiO<sub>2</sub>(<i>m</i>, <i>n</i>)","year":2016,"lang":"en","type":"article","venue":"Canadian Journal of Chemistry","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Higher Education Commision, Pakistan","keywords":"Wiener index; Topological index; Molecular graph; Topology (electrical circuits); Vertex (graph theory); Boiling point; Graph; Index (typography); Mathematics; Chemistry; Combinatorics; Organic chemistry; Computer science","score_opus":0.014241242281394331,"score_gpt":0.20315020865336636,"score_spread":0.18890896637197202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2539312954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44055533,0.0020896802,0.52765864,0.00022176284,0.0001734067,0.00005642904,0.0002483645,0.00030875372,0.02868775],"genre_scores_gemma":[0.9212221,0.0013627034,0.07192524,0.00006426567,0.00009060699,0.00006759797,0.00027144034,0.00013783725,0.004858143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999068,0.000020395903,0.000004396552,0.0000145253125,0.000040631323,0.000013232967],"domain_scores_gemma":[0.99956053,0.00021243817,0.00006151198,0.00004633003,0.00007902379,0.00004014007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003143777,0.0004148987,0.00027479007,0.001258465,0.00022219445,0.00057100126,0.00050705357,0.00040121246,0.0019850773],"category_scores_gemma":[0.0016864833,0.00013150908,0.00031655276,0.0008043139,0.0009581129,0.0018835292,0.0004189081,0.0005932262,0.00036213253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010042168,0.000043397933,0.0025251438,0.00016753371,0.000031495827,0.00036432446,0.00018373133,0.12074929,0.027070295,0.8070065,0.0015341961,0.040223703],"study_design_scores_gemma":[0.0000117248155,0.000049276863,0.0030079458,0.000032660624,0.000016477938,0.00033432967,0.000078571,0.69670564,0.007836054,0.28969234,0.0021882728,0.000046763973],"about_ca_topic_score_codex":0.00050010416,"about_ca_topic_score_gemma":0.0009839818,"teacher_disagreement_score":0.0019850773,"about_ca_system_score_codex":0.00033615227,"about_ca_system_score_gemma":0.00027657632,"threshold_uncertainty_score":0.0066407323},"labels":[],"label_agreement":null},{"id":"W2569852761","doi":"10.1139/cjc-2016-0636","title":"Extended energy and its dependence on molecular structure","year":2017,"lang":"en","type":"article","venue":"Canadian Journal of Chemistry","topic":"Graph theory and applications","field":"Mathematics","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":"Chemistry; Vertex (graph theory); Energy (signal processing); Computational chemistry; Statistical physics; Combinatorics; Quantum mechanics; Physics; Mathematics; Graph","score_opus":0.014755569132039766,"score_gpt":0.2565679338023049,"score_spread":0.24181236467026515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2569852761","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9506183,0.001084679,0.030855075,0.00023432497,0.00005577789,0.000014858189,0.0002221716,0.0001103317,0.016804524],"genre_scores_gemma":[0.99657464,0.00021821143,0.0018963141,0.000022010847,0.00002347556,0.000010997318,0.00010698527,0.000023591974,0.001123719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99985564,0.000032378128,0.000005612541,0.00003344583,0.00004714549,0.000025668129],"domain_scores_gemma":[0.9984383,0.0008735936,0.0002458575,0.00018240928,0.00015223752,0.00010759223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030019504,0.00029866578,0.00022502102,0.0010198175,0.0002046376,0.00085150474,0.0003997032,0.0002868866,0.0026050506],"category_scores_gemma":[0.002333599,0.00010950483,0.00017507155,0.00069084595,0.00091519335,0.0014155026,0.0006647846,0.00044824317,0.00022338635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000593337,0.00034347308,0.013549907,0.0004365753,0.0001088865,0.00084293366,0.00042435885,0.20474987,0.081359774,0.6210892,0.0020789949,0.0744227],"study_design_scores_gemma":[0.000020058495,0.0003617933,0.022863925,0.00005966675,0.00005709122,0.0007113806,0.00018613605,0.5362069,0.017502628,0.4178772,0.0040280246,0.00012517338],"about_ca_topic_score_codex":0.00025011424,"about_ca_topic_score_gemma":0.00024872192,"teacher_disagreement_score":0.0026050506,"about_ca_system_score_codex":0.00030278688,"about_ca_system_score_gemma":0.00011334252,"threshold_uncertainty_score":0.0087147355},"labels":[],"label_agreement":null},{"id":"W2571762197","doi":"","title":"The smallest Merrifield-Simmons index of trees with exactly six leaves.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Tree (set theory); Discrete mathematics; Arithmetic; Computer science","score_opus":0.020273262348202488,"score_gpt":0.25779202593832057,"score_spread":0.2375187635901181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571762197","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6598456,0.003999933,0.06414117,0.0030946678,0.0010466485,0.00008887256,0.0044271233,0.0007649966,0.26259094],"genre_scores_gemma":[0.9543292,0.00087022805,0.021882314,0.0004401773,0.00037359004,0.000059090515,0.0016161677,0.00023295717,0.020196222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996132,0.00006894965,0.000030817962,0.00009283625,0.00009868672,0.000095517826],"domain_scores_gemma":[0.99821633,0.0006949111,0.00028529484,0.00020151831,0.00023372365,0.0003681893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048353212,0.0003934906,0.00074620254,0.0023159876,0.0015185124,0.0026996275,0.0010001004,0.0010262668,0.007943095],"category_scores_gemma":[0.0033566232,0.0002900043,0.00036636333,0.001481139,0.0013801989,0.0035302576,0.0012407794,0.0014938726,0.0023950955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005134062,0.00007000395,0.0027888492,0.00023500627,0.00003600015,0.00036191597,0.00081704726,0.0016889386,0.010093994,0.91462654,0.02022602,0.048542276],"study_design_scores_gemma":[0.000046053035,0.00006057415,0.0019072923,0.0000710323,0.000031913092,0.0007640378,0.00033418028,0.0043540043,0.004223063,0.95666325,0.03150882,0.000035787318],"about_ca_topic_score_codex":0.00067041954,"about_ca_topic_score_gemma":0.0010694233,"teacher_disagreement_score":0.007943095,"about_ca_system_score_codex":0.0009019218,"about_ca_system_score_gemma":0.0006606543,"threshold_uncertainty_score":0.026572287},"labels":[],"label_agreement":null},{"id":"W2572097019","doi":"","title":"A list for vertex-primitive symmetric graphs of order 6p.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Order (exchange); Discrete mathematics; Graph","score_opus":0.028408068193046202,"score_gpt":0.29263988191171486,"score_spread":0.26423181371866866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572097019","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06395476,0.0070490954,0.22241293,0.0043601845,0.0053016506,0.0010694604,0.101062596,0.019960392,0.5748289],"genre_scores_gemma":[0.25759056,0.008025234,0.26970586,0.0026110436,0.0012469969,0.001067108,0.12502597,0.0042245975,0.33050266],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999699,0.000050654635,0.00003120926,0.00006059682,0.000086461456,0.00007206372],"domain_scores_gemma":[0.9987771,0.00031531017,0.000115742645,0.00016091496,0.00046279267,0.00016818402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002736191,0.0013041707,0.0007670255,0.0038112083,0.0026851424,0.0017614085,0.0012741061,0.00085299613,0.10527877],"category_scores_gemma":[0.0015055994,0.0004899533,0.00079626543,0.003576224,0.0005080795,0.0032567438,0.0012624022,0.0015079661,0.048667938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005735023,0.00026711123,0.0015050464,0.0019936152,0.00007585569,0.0012779706,0.00054537196,0.0010106495,0.015633397,0.3382008,0.3688249,0.27009183],"study_design_scores_gemma":[0.000045385477,0.00017071924,0.0015613398,0.00034430105,0.00006616396,0.0014694114,0.0003587631,0.0016144116,0.007501843,0.24336478,0.74341637,0.00008652042],"about_ca_topic_score_codex":0.0010911033,"about_ca_topic_score_gemma":0.0021215614,"teacher_disagreement_score":0.10527877,"about_ca_system_score_codex":0.00078192883,"about_ca_system_score_gemma":0.0012456421,"threshold_uncertainty_score":0.35219252},"labels":[],"label_agreement":null},{"id":"W2572358194","doi":"","title":"The maximal (signless Laplacian) spectral radius of connected graphs with given matching number.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Combinatorics; Matching (statistics); Discrete mathematics; Statistics; Physics; Eigenvalues and eigenvectors","score_opus":0.013732656318069084,"score_gpt":0.255352390205756,"score_spread":0.24161973388768693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572358194","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8010826,0.0013817111,0.10974722,0.002206259,0.00028419791,0.000051754236,0.0011338007,0.00084411976,0.08326826],"genre_scores_gemma":[0.9861624,0.0003341433,0.009072311,0.00012550714,0.00013062682,0.00004097518,0.00026611047,0.00008763149,0.003780265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999537,0.00016427904,0.000020538788,0.00011461046,0.00008987286,0.00007386313],"domain_scores_gemma":[0.99712855,0.0013803468,0.00049532496,0.00019779477,0.00027637742,0.0005216906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006464216,0.00047587877,0.0005177739,0.0020539137,0.0007583151,0.0019154031,0.0012039124,0.0010735594,0.0057302658],"category_scores_gemma":[0.0071288096,0.00024944622,0.00021151455,0.0008931651,0.001647169,0.0025242032,0.0012048859,0.0006006406,0.0011947738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036982977,0.000061363135,0.0020138547,0.0002691181,0.00003761255,0.0001877821,0.0003299745,0.012163495,0.012171942,0.9423028,0.009833601,0.020258604],"study_design_scores_gemma":[0.000042680924,0.00005444665,0.0022767782,0.0000633322,0.000036288246,0.00067767024,0.0003600513,0.0818261,0.0059598344,0.9034571,0.005210686,0.00003500867],"about_ca_topic_score_codex":0.0003717705,"about_ca_topic_score_gemma":0.00037986352,"teacher_disagreement_score":0.0057302658,"about_ca_system_score_codex":0.00066306384,"about_ca_system_score_gemma":0.00033370606,"threshold_uncertainty_score":0.019169688},"labels":[],"label_agreement":null},{"id":"W2572372762","doi":"","title":"Some indices of graphs with more than one cut-edge.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Artificial intelligence; Computer science","score_opus":0.022409743689004853,"score_gpt":0.26996969887154476,"score_spread":0.2475599551825399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572372762","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19918844,0.0035603072,0.32974696,0.0030679023,0.0021611063,0.00022191912,0.004971061,0.001554073,0.45552817],"genre_scores_gemma":[0.6993497,0.002544187,0.21561794,0.0020181339,0.0009372939,0.0004596919,0.004794985,0.0012090645,0.073069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926037,0.00017845877,0.00005844831,0.00018087364,0.00016901921,0.0001528188],"domain_scores_gemma":[0.99749374,0.0007832882,0.00045398032,0.00039593884,0.0005220963,0.00035087572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008471173,0.0009124867,0.00074127805,0.0031566385,0.0023684946,0.003325597,0.0016907759,0.0012154978,0.009811864],"category_scores_gemma":[0.0032195447,0.0005459881,0.0009092383,0.0022254547,0.00198493,0.0043926598,0.001686872,0.0029921276,0.0032249452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066638604,0.000026243797,0.0005480637,0.00007573665,0.000014849892,0.0002009964,0.00024922917,0.00041754774,0.0020251225,0.9754532,0.009495131,0.0114271175],"study_design_scores_gemma":[0.000015921429,0.000017560686,0.00067026255,0.0000633061,0.00002814992,0.00044273754,0.00019693018,0.004849771,0.0016237178,0.9615625,0.03050949,0.000019689254],"about_ca_topic_score_codex":0.0013032808,"about_ca_topic_score_gemma":0.0019186245,"teacher_disagreement_score":0.009811864,"about_ca_system_score_codex":0.0012983313,"about_ca_system_score_gemma":0.0008305835,"threshold_uncertainty_score":0.03282398},"labels":[],"label_agreement":null},{"id":"W2572611632","doi":"","title":"Two-parameters generalization of Pell numbers in graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Generalization; Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.02380493085105344,"score_gpt":0.2857457099138408,"score_spread":0.26194077906278734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572611632","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09465413,0.0031244238,0.260633,0.004227291,0.0023259514,0.0001313888,0.0007975015,0.0012916784,0.6328145],"genre_scores_gemma":[0.84951437,0.0023907574,0.05682209,0.0012243316,0.0010767725,0.00020543947,0.0005253185,0.0005439139,0.08769695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992964,0.00018376154,0.00003752081,0.00017614261,0.00019612702,0.000110027046],"domain_scores_gemma":[0.9990459,0.0003190121,0.00012291121,0.00021078436,0.00015730497,0.00014403377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005658778,0.00085318147,0.0005561297,0.0022284184,0.0013025898,0.0033903327,0.001096509,0.0013200728,0.016009718],"category_scores_gemma":[0.0036169568,0.00037444296,0.0006793096,0.0017616333,0.0033421174,0.0070282025,0.0026607583,0.0030543385,0.003238028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008438133,0.000004655338,0.00004589609,0.00002051328,0.0000019623972,0.000035981022,0.000057229183,0.0002698026,0.00025272454,0.9931518,0.0015689869,0.004582019],"study_design_scores_gemma":[0.0000045333604,0.0000045224833,0.00005788966,0.0000109806515,0.0000030653782,0.00009853639,0.000033509332,0.0011283018,0.0002925512,0.98889714,0.009460422,0.000008515687],"about_ca_topic_score_codex":0.0010182807,"about_ca_topic_score_gemma":0.000948902,"teacher_disagreement_score":0.016009718,"about_ca_system_score_codex":0.0014546902,"about_ca_system_score_gemma":0.0006425073,"threshold_uncertainty_score":0.053557813},"labels":[],"label_agreement":null},{"id":"W2572795963","doi":"","title":"Total Embedding distributions for two graph families obtained from the dipole D 3 .","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Embedding; Combinatorics; Graph; Dipole; Discrete mathematics; Artificial intelligence; Computer science; Physics; Quantum mechanics","score_opus":0.02090109328123276,"score_gpt":0.2972660110128225,"score_spread":0.2763649177315898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572795963","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7863673,0.0002580327,0.14309967,0.0009712992,0.00011391361,0.000038090475,0.001028156,0.00050589273,0.0676176],"genre_scores_gemma":[0.9685242,0.00016902365,0.014221136,0.00014606978,0.00003956853,0.000052623,0.00085665757,0.00025797938,0.015732786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997416,0.00007225976,0.00000898416,0.000052383875,0.00006332082,0.000061455976],"domain_scores_gemma":[0.99856585,0.0006389738,0.00012322387,0.00018575437,0.00018274618,0.00030357033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051888975,0.00031711825,0.0002503354,0.0016850213,0.001207904,0.0014651618,0.0007692571,0.0009361076,0.011391436],"category_scores_gemma":[0.0022130231,0.00028824017,0.0005184779,0.0006239429,0.0012074325,0.0012307568,0.00097029307,0.00083638873,0.0009581179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020138666,0.00005575462,0.0014859345,0.00006589284,0.000016060943,0.00025654855,0.00036735236,0.00975569,0.0056643486,0.9648054,0.005876727,0.011448778],"study_design_scores_gemma":[0.000059412858,0.000057209574,0.0030932706,0.00004537755,0.000024988794,0.00058667024,0.0006326312,0.12565745,0.005245727,0.85659355,0.007962073,0.00004165516],"about_ca_topic_score_codex":0.0010461684,"about_ca_topic_score_gemma":0.0017085756,"teacher_disagreement_score":0.011391436,"about_ca_system_score_codex":0.00078692846,"about_ca_system_score_gemma":0.00030173475,"threshold_uncertainty_score":0.03810811},"labels":[],"label_agreement":null},{"id":"W2573057482","doi":"","title":"On the sum-connectivity spectral radius and sum-connectivity Estrada index of graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Spectral radius; Combinatorics; RADIUS; Eigenvalues and eigenvectors; Computer science; Computer network; World Wide Web; Physics","score_opus":0.020144723359750545,"score_gpt":0.25683203031813007,"score_spread":0.23668730695837953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573057482","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6007552,0.010998201,0.20231868,0.004305027,0.0005894316,0.000077854485,0.0013057428,0.00064993615,0.17899992],"genre_scores_gemma":[0.9738776,0.0023668383,0.015609438,0.0004043059,0.0006154842,0.0000930387,0.00049555354,0.0001788715,0.006358742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907,0.00038921184,0.000042639982,0.0001755485,0.00020460732,0.000117973745],"domain_scores_gemma":[0.9894756,0.007202975,0.0010096702,0.000625842,0.00067329645,0.0010125678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001426821,0.00078623137,0.0011399183,0.0042791716,0.0013836403,0.0023610191,0.0020413266,0.0012259217,0.0069555244],"category_scores_gemma":[0.01592845,0.00037924462,0.0004429002,0.0023043652,0.002843506,0.0068843025,0.002763347,0.0018606314,0.001463804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017169809,0.00005894759,0.0021082945,0.00015823061,0.0000317001,0.00011677267,0.00031387442,0.009306007,0.0018558042,0.9608649,0.0074651632,0.017548634],"study_design_scores_gemma":[0.000018680214,0.000036031717,0.0016664799,0.000056273846,0.000036171707,0.00041039017,0.0002452768,0.043284073,0.0011580997,0.9483829,0.004677894,0.000027697599],"about_ca_topic_score_codex":0.00058869657,"about_ca_topic_score_gemma":0.0005629253,"teacher_disagreement_score":0.0069555244,"about_ca_system_score_codex":0.0008913437,"about_ca_system_score_gemma":0.00027309294,"threshold_uncertainty_score":0.02326858},"labels":[],"label_agreement":null},{"id":"W2573265953","doi":"10.1090/dimacs/069/12","title":"What forms do interesting conjectures have in graph theory?","year":2007,"lang":"en","type":"book-chapter","venue":"DIMACS series in discrete mathematics and theoretical computer science","topic":"Graph theory and applications","field":"Mathematics","cited_by":15,"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; Mathematics","score_opus":0.029044962895474716,"score_gpt":0.30605441954386103,"score_spread":0.27700945664838633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573265953","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.034572322,0.043898605,0.032903846,0.3747556,0.018044682,0.00008978985,0.00086850376,0.00047367217,0.49439305],"genre_scores_gemma":[0.646107,0.04622046,0.021366993,0.02379237,0.04809885,0.00030851428,0.002023985,0.0007446641,0.21133721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961175,0.0014475463,0.00011586258,0.0006117332,0.0014833974,0.00022401015],"domain_scores_gemma":[0.95461154,0.0317582,0.0020018788,0.004436424,0.005823822,0.0013681474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006098935,0.00054034754,0.0011507488,0.0023241176,0.002988926,0.007737347,0.0020978954,0.0041843196,0.038879983],"category_scores_gemma":[0.050419666,0.00052666076,0.00055275834,0.0028347757,0.0074716047,0.022159385,0.0025078144,0.0046296413,0.0074397484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000520399,0.00006128694,0.0007972106,0.00042251023,0.000030072286,0.00014558612,0.00063045137,0.0009446719,0.00013390703,0.7977828,0.13086826,0.068131186],"study_design_scores_gemma":[0.0000091894,0.0000073665465,0.0001736239,0.00011389673,0.000006387202,0.00007384021,0.00025124985,0.00057620317,0.000067572575,0.9558333,0.04287849,0.00000889026],"about_ca_topic_score_codex":0.0006431708,"about_ca_topic_score_gemma":0.00094038283,"teacher_disagreement_score":0.038879983,"about_ca_system_score_codex":0.0022019949,"about_ca_system_score_gemma":0.0016869331,"threshold_uncertainty_score":0.13006651},"labels":[],"label_agreement":null},{"id":"W2573432259","doi":"","title":"On the distance and distance Laplacian spectral radius of graphs with cut edges.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; RADIUS; Combinatorics; Laplace operator; Resistance distance; Mathematical analysis; Graph; Eigenvalues and eigenvectors; Physics; Line graph; Computer science","score_opus":0.014132119586703318,"score_gpt":0.23720389303816228,"score_spread":0.22307177345145895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573432259","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5324786,0.015191453,0.32139057,0.008127497,0.0009034984,0.000091130954,0.0010280106,0.00055346615,0.120235786],"genre_scores_gemma":[0.94792295,0.0030629162,0.036630403,0.00071110687,0.0010140333,0.00012537665,0.00049039774,0.00023344698,0.009809424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985013,0.0006538034,0.00006147763,0.00026895947,0.00033773153,0.00017682886],"domain_scores_gemma":[0.98258394,0.012535574,0.0014916497,0.00088530965,0.0010875438,0.0014158803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018301831,0.0008215506,0.001051095,0.0034713089,0.001215891,0.002252068,0.002438967,0.0018928762,0.0058238595],"category_scores_gemma":[0.022154097,0.00050054,0.00050077745,0.0020875758,0.0033792946,0.006204034,0.0030488523,0.0023458013,0.0013215704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017981918,0.00008170859,0.0019856193,0.00018229349,0.00004493126,0.00012654068,0.00045953,0.014006502,0.002420852,0.94904125,0.00868237,0.022788709],"study_design_scores_gemma":[0.000022191241,0.000045504472,0.0016139301,0.000050296956,0.000026172473,0.00030510267,0.00030964974,0.049304295,0.0006810648,0.9433236,0.0042816796,0.00003648647],"about_ca_topic_score_codex":0.0010395675,"about_ca_topic_score_gemma":0.00089117466,"teacher_disagreement_score":0.0058238595,"about_ca_system_score_codex":0.0013994663,"about_ca_system_score_gemma":0.0003974428,"threshold_uncertainty_score":0.019482732},"labels":[],"label_agreement":null},{"id":"W2573967999","doi":"","title":"A sharp upper bound on the spectral radius of generalized weighted digraphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Upper and lower bounds; RADIUS; Combinatorics; Mathematical analysis; Eigenvalues and eigenvectors; Physics; Quantum mechanics; Computer science","score_opus":0.02471284038092588,"score_gpt":0.26853317870645754,"score_spread":0.24382033832553165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573967999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22150847,0.012678828,0.585747,0.0054375194,0.0011856128,0.00019012927,0.0020464882,0.0017614915,0.16944444],"genre_scores_gemma":[0.88545763,0.005385648,0.08764899,0.0016678518,0.000947045,0.00035395607,0.0010302385,0.0006205509,0.016888175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805486,0.00059001474,0.00008135746,0.00045123452,0.0004914087,0.0003311285],"domain_scores_gemma":[0.9844396,0.0106659625,0.00093770685,0.0013512936,0.0010848324,0.0015206338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016801633,0.00181191,0.0017972413,0.0032384743,0.0018604128,0.0036250406,0.0028772014,0.0021989546,0.010433953],"category_scores_gemma":[0.021294959,0.0010250991,0.0010756631,0.0024064449,0.0029623965,0.0068646073,0.0044404445,0.0043116286,0.0033722522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019447476,0.000079188154,0.0010264547,0.00044252476,0.00009597396,0.00027238653,0.00045059656,0.014584689,0.007554663,0.9330077,0.0152324485,0.027058868],"study_design_scores_gemma":[0.000029067125,0.00006441546,0.0009369835,0.00013896992,0.0000849651,0.0005805719,0.0002187989,0.05883132,0.0025436352,0.9240899,0.0124263745,0.00005507839],"about_ca_topic_score_codex":0.00091346714,"about_ca_topic_score_gemma":0.0013168305,"teacher_disagreement_score":0.010433953,"about_ca_system_score_codex":0.0016731595,"about_ca_system_score_gemma":0.00055182975,"threshold_uncertainty_score":0.034905016},"labels":[],"label_agreement":null},{"id":"W2574114580","doi":"","title":"On the extremal Merrifield-Simmons index of quasi-unicyclic graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Index (typography); Discrete mathematics; Computer science; World Wide Web","score_opus":0.031197686055073615,"score_gpt":0.2782636524007888,"score_spread":0.2470659663457152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574114580","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7007045,0.0039980942,0.05039536,0.0040115956,0.0008597971,0.000070225506,0.000745379,0.00036941006,0.23884568],"genre_scores_gemma":[0.98392856,0.0010374348,0.005378644,0.00030275638,0.00041069413,0.000045514764,0.00020761383,0.00006596377,0.00862298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995499,0.00013171502,0.000018977122,0.00007685515,0.00012285038,0.00009968776],"domain_scores_gemma":[0.9975721,0.0011747848,0.00041169784,0.0001771524,0.00023070724,0.00043355243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009966774,0.00048945175,0.00070027617,0.0039393306,0.0014440735,0.0024426465,0.0012653255,0.0012274571,0.008326398],"category_scores_gemma":[0.005913877,0.0002998907,0.0002938641,0.0016659818,0.0022957854,0.003751067,0.0016732982,0.0015956849,0.00092043425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010202217,0.000019037061,0.00064217806,0.0000656412,0.000008444689,0.00009612536,0.00017095,0.0014966892,0.0011524621,0.9857701,0.003166973,0.0073092557],"study_design_scores_gemma":[0.00002757955,0.0000277718,0.0009433861,0.000050505572,0.00001340928,0.00028629348,0.00014875435,0.012359979,0.00082270254,0.9811204,0.004177395,0.000021824502],"about_ca_topic_score_codex":0.00078403106,"about_ca_topic_score_gemma":0.0010560533,"teacher_disagreement_score":0.008326398,"about_ca_system_score_codex":0.0015280189,"about_ca_system_score_gemma":0.0004375029,"threshold_uncertainty_score":0.027854621},"labels":[],"label_agreement":null},{"id":"W2574323604","doi":"","title":"Minimizing the least eigenvalue of bicyclic graphs with fixed diameter.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Bicyclic molecule; Combinatorics; Chemistry; Medicinal chemistry; Physics","score_opus":0.028359972070274707,"score_gpt":0.2663913660209277,"score_spread":0.238031393950653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574323604","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6990513,0.0014951762,0.23159371,0.0021782317,0.00027976904,0.00008966669,0.00095647614,0.0006484522,0.06370722],"genre_scores_gemma":[0.932185,0.0007791995,0.051071722,0.00024359612,0.00015808002,0.00013667774,0.000525432,0.00031729834,0.014582895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965334,0.00010608442,0.000012032897,0.00008164676,0.000071534436,0.00007534776],"domain_scores_gemma":[0.9978586,0.0012317407,0.00025580206,0.00016663622,0.00020880901,0.00027851836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004265007,0.00075371616,0.000724155,0.00096022745,0.0007413091,0.0012411275,0.0012263398,0.0011327082,0.004803268],"category_scores_gemma":[0.0055357,0.00042405835,0.00024413178,0.00079344545,0.00089706155,0.0015898403,0.0010647998,0.0008623452,0.0009809858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005323824,0.00014345752,0.00221216,0.0007013733,0.000085657986,0.00035579852,0.0005618051,0.11596847,0.035940684,0.7578652,0.029432852,0.056200195],"study_design_scores_gemma":[0.00007519796,0.00008839486,0.0012598814,0.00007583474,0.000036023233,0.00032506156,0.00034955426,0.22393776,0.0064027715,0.76214087,0.0052710697,0.000037600035],"about_ca_topic_score_codex":0.00091672415,"about_ca_topic_score_gemma":0.0017917764,"teacher_disagreement_score":0.004803268,"about_ca_system_score_codex":0.00078539154,"about_ca_system_score_gemma":0.00038179365,"threshold_uncertainty_score":0.016068518},"labels":[],"label_agreement":null},{"id":"W2574479152","doi":"","title":"Tricyclic graphs with minimum Kirchhoff Index.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tricyclic; Index (typography); Combinatorics; Computer science; Chemistry; Stereochemistry","score_opus":0.01987593969212487,"score_gpt":0.26699556923841367,"score_spread":0.2471196295462888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574479152","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52969295,0.0015056635,0.06687289,0.002149724,0.0005752122,0.00013852848,0.003422646,0.0007728208,0.3948696],"genre_scores_gemma":[0.95909166,0.00070360047,0.012704378,0.0003163021,0.00010810435,0.000058235226,0.001165289,0.000100708814,0.025751611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997106,0.000050923074,0.000019415602,0.00005392128,0.000087253444,0.000077819815],"domain_scores_gemma":[0.99894994,0.0002829236,0.00022634644,0.00020489027,0.0001747974,0.00016102324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016895616,0.00026322578,0.0005688857,0.0011196812,0.0010493926,0.0018649048,0.0008387151,0.0008033824,0.014082046],"category_scores_gemma":[0.001969013,0.00025236688,0.0002457033,0.0013711264,0.0006634093,0.0017625256,0.0011125872,0.00089165964,0.0021131148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017799932,0.000049059403,0.00064932404,0.00015789669,0.000020115593,0.00029792136,0.0001749091,0.0033572956,0.00699471,0.9479945,0.014175957,0.025950396],"study_design_scores_gemma":[0.00005308648,0.000050810977,0.0013140095,0.000053707943,0.00003446933,0.0008176588,0.00029152047,0.015384475,0.0044877813,0.96170497,0.0157752,0.000032406457],"about_ca_topic_score_codex":0.00093248405,"about_ca_topic_score_gemma":0.0015894035,"teacher_disagreement_score":0.014082046,"about_ca_system_score_codex":0.0006114475,"about_ca_system_score_gemma":0.00047588264,"threshold_uncertainty_score":0.047109127},"labels":[],"label_agreement":null},{"id":"W2574613064","doi":"","title":"On the Laplacian coefficients and Laplacian-like energy of unicyclic graphs with fixed diameter.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Laplace operator; Laplacian matrix; Combinatorics; Pure mathematics; Mathematical analysis","score_opus":0.01578594659760281,"score_gpt":0.24070237171787448,"score_spread":0.22491642512027166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574613064","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73039,0.0074503887,0.08625995,0.0061486783,0.0010473897,0.00004832649,0.0007335829,0.00026095772,0.16766076],"genre_scores_gemma":[0.97851735,0.0021953264,0.005248313,0.00034280054,0.00046890636,0.00004360286,0.00025558093,0.00010581544,0.012822213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975437,0.0000785115,0.000007597598,0.000038561087,0.00006748836,0.00005344291],"domain_scores_gemma":[0.99802953,0.001117702,0.00023850187,0.00013092613,0.00019813346,0.00028524038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005150921,0.0005384738,0.0006264192,0.0026484292,0.0008218486,0.0012107458,0.0014175896,0.0010893184,0.0067792446],"category_scores_gemma":[0.005935153,0.00033794637,0.00028595925,0.0013548881,0.001851194,0.0026885378,0.0014612137,0.0014475866,0.00086597155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003987986,0.000026509226,0.00055606273,0.00007760282,0.0000099064055,0.000103190905,0.00014558899,0.0068837353,0.0015046949,0.97921115,0.004960547,0.0064811828],"study_design_scores_gemma":[0.000016460923,0.000013319544,0.0008121047,0.00004418698,0.000009003692,0.00019578866,0.00016444581,0.03134099,0.0004075003,0.96461,0.0023665375,0.000019651585],"about_ca_topic_score_codex":0.00086350704,"about_ca_topic_score_gemma":0.001155516,"teacher_disagreement_score":0.0067792446,"about_ca_system_score_codex":0.0007299039,"about_ca_system_score_gemma":0.00027007022,"threshold_uncertainty_score":0.022678852},"labels":[],"label_agreement":null},{"id":"W2574688825","doi":"","title":"The Co-PI index of some compound graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Pi; Combinatorics; Geometry; Computer science; Programming language","score_opus":0.023316806246669375,"score_gpt":0.2892115971260703,"score_spread":0.26589479087940093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574688825","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51056975,0.0014465918,0.10949088,0.002466546,0.0005638509,0.00011551073,0.0019515092,0.00058057223,0.37281474],"genre_scores_gemma":[0.94572383,0.00067561335,0.02518111,0.00038397263,0.00028034602,0.00010955207,0.0008389969,0.00018633586,0.02662026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995939,0.00007819413,0.000019719693,0.000112065194,0.0001042743,0.00009194061],"domain_scores_gemma":[0.9981931,0.0006213883,0.00036456532,0.00023236651,0.00030869403,0.00027995865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046006354,0.00045000896,0.00056841417,0.0033505668,0.002426134,0.002929962,0.0007894818,0.0010073655,0.01073249],"category_scores_gemma":[0.0024445937,0.00028725996,0.00044194245,0.0024329848,0.0019436299,0.0037180365,0.001240428,0.0017682019,0.001742394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007227851,0.000028053726,0.00090511394,0.00005557282,0.000016213568,0.00019385686,0.00020062491,0.0006768925,0.0022712934,0.9814488,0.004024421,0.010106756],"study_design_scores_gemma":[0.000015006973,0.000019306084,0.001312986,0.000026154084,0.000026444293,0.000510022,0.00020521443,0.0076979753,0.0021474797,0.97542566,0.012597027,0.000016737928],"about_ca_topic_score_codex":0.0010661569,"about_ca_topic_score_gemma":0.0016746394,"teacher_disagreement_score":0.01073249,"about_ca_system_score_codex":0.0013847993,"about_ca_system_score_gemma":0.0006830286,"threshold_uncertainty_score":0.03590381},"labels":[],"label_agreement":null},{"id":"W2575667298","doi":"","title":"Some sharp bounds for the spectral radius and energy of digraphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; RADIUS; Energy (signal processing); Combinatorics; Physics; Quantum mechanics; Eigenvalues and eigenvectors; Statistics; Computer science","score_opus":0.01940909777052949,"score_gpt":0.26244325084206804,"score_spread":0.24303415307153856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575667298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14147802,0.027892336,0.60086,0.011274563,0.0012868827,0.00016145581,0.0023965538,0.0010849347,0.21356522],"genre_scores_gemma":[0.85168886,0.013324166,0.09992219,0.0029446855,0.002234461,0.00059568667,0.0014905956,0.00074006687,0.027059373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799985,0.0006210932,0.0001096703,0.00041077466,0.0005645723,0.0002940841],"domain_scores_gemma":[0.97767526,0.016840717,0.0011947118,0.0014491503,0.0012529861,0.0015871307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028873042,0.0022486795,0.001820716,0.0065264404,0.0019440156,0.0043746494,0.0034442178,0.0031577656,0.015027581],"category_scores_gemma":[0.030050414,0.0012972195,0.001700699,0.004153028,0.004960183,0.009495584,0.004740797,0.007060629,0.0029783866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007159184,0.000051623578,0.00065192295,0.00023944669,0.000051994688,0.00013706826,0.00026376944,0.006736681,0.0016072365,0.966685,0.007936058,0.015567727],"study_design_scores_gemma":[0.00001173336,0.000023322402,0.0006143923,0.00008847885,0.000037031932,0.00024824828,0.000114052884,0.017623967,0.000722101,0.9760543,0.0044333907,0.000028961713],"about_ca_topic_score_codex":0.0007870803,"about_ca_topic_score_gemma":0.0011897223,"teacher_disagreement_score":0.015027581,"about_ca_system_score_codex":0.002540416,"about_ca_system_score_gemma":0.00051723595,"threshold_uncertainty_score":0.050272286},"labels":[],"label_agreement":null},{"id":"W2575764447","doi":"","title":"Zagreb Eccentricity Indices Of Cycles Related Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eccentricity (behavior); Combinatorics; Political science","score_opus":0.019348562338452426,"score_gpt":0.27305533675254573,"score_spread":0.2537067744140933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575764447","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7566614,0.002190294,0.033851553,0.00060126616,0.00028546323,0.000044144414,0.0009114361,0.0002069861,0.20524752],"genre_scores_gemma":[0.9806786,0.0007601645,0.006592908,0.00008430001,0.00009552114,0.000032797023,0.00043403156,0.000071274466,0.011250382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997482,0.000048676917,0.000014723433,0.00006427142,0.000062351595,0.00006178312],"domain_scores_gemma":[0.9992217,0.00020610163,0.0002048952,0.00009204505,0.00015424231,0.0001210521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003359892,0.00035926796,0.00043424705,0.0028288015,0.0009349296,0.0015222628,0.0005952972,0.00048258033,0.0072445585],"category_scores_gemma":[0.0021268518,0.0001928675,0.00016991273,0.0013244565,0.00088880496,0.0017065746,0.0008790361,0.00078313716,0.0012464563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023355262,0.00004041364,0.004711205,0.00013998298,0.000024019215,0.00024412581,0.00046132965,0.0032396133,0.005505945,0.9407493,0.0045887274,0.04006176],"study_design_scores_gemma":[0.000038587525,0.00006048364,0.010207218,0.00011776821,0.00005918145,0.0010983011,0.00048962113,0.01640285,0.004294392,0.9426843,0.024517905,0.000029429395],"about_ca_topic_score_codex":0.0010330555,"about_ca_topic_score_gemma":0.001303106,"teacher_disagreement_score":0.0072445585,"about_ca_system_score_codex":0.00075574475,"about_ca_system_score_gemma":0.0002486854,"threshold_uncertainty_score":0.024235487},"labels":[],"label_agreement":null},{"id":"W2576293399","doi":"","title":"The Randic Indices of Trees, Unicyclic Graphs and Bicyclic Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.01795614051698622,"score_gpt":0.2702494665088186,"score_spread":0.25229332599183235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576293399","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34142348,0.022030765,0.103195235,0.003687618,0.001623956,0.00008766014,0.0014639732,0.00045540585,0.5260319],"genre_scores_gemma":[0.931118,0.005339332,0.022978673,0.0005776496,0.00068422646,0.00008991723,0.0005146259,0.00014138035,0.038556274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995604,0.00012778584,0.000027450262,0.00008698935,0.000120663266,0.00007673892],"domain_scores_gemma":[0.99871933,0.0004878817,0.00028373557,0.00015797367,0.00017469241,0.00017643653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000493617,0.00054575107,0.00055593066,0.0030808335,0.001031479,0.0024422887,0.00075812225,0.0007423925,0.006716977],"category_scores_gemma":[0.004194031,0.00039419098,0.00026498106,0.0018864213,0.0020428086,0.0031329244,0.001420326,0.001576242,0.0014498382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003471905,0.000008446978,0.00030704934,0.000042284824,0.0000052466485,0.000039262148,0.0001501581,0.00070459256,0.00055801275,0.9810463,0.0036446513,0.013459303],"study_design_scores_gemma":[0.000012870743,0.000015496398,0.00056928315,0.000042628777,0.000009781513,0.00022125401,0.00018217241,0.0031883512,0.0004356316,0.978542,0.01676541,0.000015057919],"about_ca_topic_score_codex":0.0010965478,"about_ca_topic_score_gemma":0.0018012801,"teacher_disagreement_score":0.006716977,"about_ca_system_score_codex":0.00071592804,"about_ca_system_score_gemma":0.0004082937,"threshold_uncertainty_score":0.022470474},"labels":[],"label_agreement":null},{"id":"W2576372907","doi":"","title":"The expected values of Wiener indices in random polygonal chains.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Statistics; Statistical physics; Combinatorics; Physics","score_opus":0.017863348482778093,"score_gpt":0.2776032679613792,"score_spread":0.2597399194786011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576372907","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6286707,0.0018381649,0.33042797,0.0021267945,0.00039973634,0.00013742589,0.0012285073,0.00062622793,0.03454451],"genre_scores_gemma":[0.96854454,0.0010284926,0.019807262,0.00018538299,0.00025336893,0.00019442853,0.0005800674,0.00023474735,0.009171655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984181,0.00051319116,0.00008364838,0.0002846613,0.00040403777,0.00029632263],"domain_scores_gemma":[0.9781934,0.014271603,0.002308503,0.0017855876,0.0014192731,0.0020216685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003787618,0.0009783356,0.0014188071,0.0040113046,0.0010550327,0.0040560253,0.003027557,0.002572479,0.00923587],"category_scores_gemma":[0.037982855,0.0011170715,0.0008806747,0.0017171542,0.004726166,0.008306539,0.0026313434,0.0025311897,0.001297161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016065908,0.00006080538,0.0023288743,0.0001502229,0.0000602913,0.00029253127,0.00016599956,0.023494871,0.0022833105,0.9627828,0.0019145778,0.006305099],"study_design_scores_gemma":[0.000037081485,0.000054059034,0.0016640481,0.00009880911,0.000036488877,0.00032082616,0.00012692642,0.1524771,0.0020309205,0.8418611,0.0012282958,0.00006429908],"about_ca_topic_score_codex":0.0006116999,"about_ca_topic_score_gemma":0.0007549875,"teacher_disagreement_score":0.00923587,"about_ca_system_score_codex":0.0017490658,"about_ca_system_score_gemma":0.0007034959,"threshold_uncertainty_score":0.030897021},"labels":[],"label_agreement":null},{"id":"W2576592240","doi":"","title":"The least eigenvalues of unicyclic graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Combinatorics; Physics","score_opus":0.026438428088549515,"score_gpt":0.2854146394425249,"score_spread":0.25897621135397536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576592240","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59707564,0.0036359583,0.14876823,0.0047884765,0.0010155867,0.00009327313,0.0016056987,0.0008997191,0.24211748],"genre_scores_gemma":[0.9646391,0.0010970241,0.012035934,0.0003198724,0.00034074113,0.00009112789,0.00037746548,0.00014362323,0.020955095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962544,0.000095837444,0.000016243966,0.00007970452,0.000107663254,0.00007523523],"domain_scores_gemma":[0.99811053,0.00087275024,0.0003360995,0.00015661129,0.00023904977,0.0002849905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002740196,0.00053069816,0.00046614217,0.0023361803,0.0009582133,0.002217282,0.0006589257,0.000939566,0.011825802],"category_scores_gemma":[0.0046872227,0.0003661926,0.00025460243,0.0010143544,0.0016703956,0.0019617071,0.0014102121,0.0013161803,0.0021433136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015267584,0.000040436444,0.00085779035,0.0001994952,0.000020593536,0.00022648278,0.00042137146,0.0030354126,0.0063877837,0.9447316,0.013920856,0.030005591],"study_design_scores_gemma":[0.000030068908,0.000020180916,0.0006767101,0.00005112874,0.000010295801,0.00031794052,0.00028075682,0.008384374,0.0016930132,0.9828237,0.0056947083,0.000017111435],"about_ca_topic_score_codex":0.00051682594,"about_ca_topic_score_gemma":0.00079857465,"teacher_disagreement_score":0.011825802,"about_ca_system_score_codex":0.00059249956,"about_ca_system_score_gemma":0.00030453317,"threshold_uncertainty_score":0.03956127},"labels":[],"label_agreement":null},{"id":"W2576978445","doi":"","title":"Some graft transformations and its applications on Q-spectral radius of a graph.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Graph; Combinatorics; Discrete mathematics; Physics; Eigenvalues and eigenvectors; Quantum mechanics","score_opus":0.018500576086869135,"score_gpt":0.26643793374277375,"score_spread":0.2479373576559046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576978445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24510816,0.0121602295,0.56936085,0.0036077227,0.0012617565,0.0001160496,0.0004543469,0.0008250338,0.16710584],"genre_scores_gemma":[0.897944,0.0056062676,0.06844098,0.00070580404,0.0013414222,0.00015359465,0.00030024233,0.0003346348,0.025172982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994325,0.0002100238,0.000025353489,0.0001470946,0.00011462177,0.00007039318],"domain_scores_gemma":[0.99854904,0.0006642733,0.00018053091,0.00016572137,0.00019937911,0.00024097787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094606285,0.00056904106,0.00068237574,0.0027785404,0.0012172798,0.0014204592,0.0010119085,0.0010862594,0.005842434],"category_scores_gemma":[0.0042426526,0.00026902067,0.0009011088,0.0019431305,0.002486293,0.002799521,0.0019194429,0.0023671102,0.0013860745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035504258,0.000035807912,0.00045439863,0.00007511035,0.000011619819,0.000086062886,0.00026246987,0.0031790943,0.0021941713,0.97224885,0.0028627627,0.01855409],"study_design_scores_gemma":[0.000010603147,0.000046465,0.00059015845,0.00002865775,0.000019887726,0.00022850708,0.00020671515,0.028117262,0.0012011982,0.96043795,0.009085762,0.000026838126],"about_ca_topic_score_codex":0.0010331706,"about_ca_topic_score_gemma":0.0006950526,"teacher_disagreement_score":0.005842434,"about_ca_system_score_codex":0.00096213835,"about_ca_system_score_gemma":0.0003680098,"threshold_uncertainty_score":0.019544959},"labels":[],"label_agreement":null},{"id":"W2577370094","doi":"","title":"The extremal unicyclic graphs with perfect matching with respect to Hosoya index and Merrifield-Simmons index.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Matching (statistics); Discrete mathematics; Statistics; Computer science","score_opus":0.015420698856087477,"score_gpt":0.2593853055955942,"score_spread":0.2439646067395067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577370094","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7755178,0.0016602215,0.038968146,0.0013390821,0.0002054677,0.000078646764,0.0010159921,0.00036694086,0.18084772],"genre_scores_gemma":[0.9893528,0.0003187702,0.004324829,0.000095086514,0.00007952394,0.000024424427,0.00024833877,0.00002305135,0.005533108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995983,0.00009002309,0.000019739009,0.00007876478,0.00010577159,0.000107322354],"domain_scores_gemma":[0.99879336,0.00036473363,0.00028804786,0.00017171966,0.00015738838,0.0002247756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039237173,0.00027317784,0.00046528445,0.0019949735,0.0013606973,0.0017819428,0.00077003776,0.0009094948,0.006501885],"category_scores_gemma":[0.0033751687,0.00026193098,0.0002641585,0.0013353111,0.0011593308,0.0021544562,0.0012098138,0.0009014794,0.0005934414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001934531,0.000026823654,0.0012512119,0.00007817471,0.000017231716,0.00023779756,0.00023650413,0.002714316,0.0022459128,0.9720025,0.0040841885,0.016911993],"study_design_scores_gemma":[0.00005529849,0.000048086516,0.0026796462,0.000050252467,0.00003308495,0.0007413523,0.00035348092,0.016395304,0.0023642418,0.9685883,0.0086560855,0.000034888628],"about_ca_topic_score_codex":0.0011252756,"about_ca_topic_score_gemma":0.0015092511,"teacher_disagreement_score":0.006501885,"about_ca_system_score_codex":0.00077462586,"about_ca_system_score_gemma":0.00050445687,"threshold_uncertainty_score":0.021750987},"labels":[],"label_agreement":null},{"id":"W2577482927","doi":"","title":"On a vertex-degree-based graph invariant and the multiplicatively weighted Harary index.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Invariant (physics); Combinatorics; Graph; Degree (music); Discrete mathematics","score_opus":0.027440102128969506,"score_gpt":0.25850233515611726,"score_spread":0.23106223302714776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577482927","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5023936,0.0018566434,0.26366812,0.0019278364,0.001170891,0.00007841795,0.0005988216,0.00045250639,0.22785312],"genre_scores_gemma":[0.95551974,0.000731417,0.017870134,0.00043267853,0.00079126033,0.000060041115,0.00027600164,0.00019965453,0.024118947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924964,0.00017357373,0.000034451492,0.00018189,0.00022282547,0.00013757696],"domain_scores_gemma":[0.9979735,0.0006018222,0.00045973057,0.0003389524,0.00027101766,0.00035497794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072812155,0.0004236111,0.0005755454,0.0026242377,0.0013860606,0.0017997529,0.0013234572,0.0008170459,0.008498058],"category_scores_gemma":[0.003329522,0.00020906143,0.0005650648,0.0013654754,0.0023576017,0.004867094,0.001974199,0.0016708068,0.0012704664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002173711,0.000016821983,0.00017096828,0.000016862301,0.0000055309574,0.00003539413,0.00006561754,0.00086051173,0.0012530263,0.9909496,0.0011360034,0.0054680505],"study_design_scores_gemma":[0.000007716028,0.000025506486,0.00045868984,0.000011212001,0.000009250991,0.000110290785,0.000047398305,0.006744224,0.0006244705,0.9884179,0.0035291049,0.000014256384],"about_ca_topic_score_codex":0.00063058623,"about_ca_topic_score_gemma":0.0007491901,"teacher_disagreement_score":0.008498058,"about_ca_system_score_codex":0.00075354206,"about_ca_system_score_gemma":0.00031732116,"threshold_uncertainty_score":0.028428793},"labels":[],"label_agreement":null},{"id":"W2578737464","doi":"","title":"The Rainbow Connection Problem: Mathematical Formulations.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Rainbow; Connection (principal bundle); Mathematics; Calculus (dental); Mathematical optimization; Geometry; Physics; Medicine; Optics","score_opus":0.02506789175033619,"score_gpt":0.28385561505290524,"score_spread":0.25878772330256905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578737464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07175632,0.010208121,0.562755,0.022177286,0.0016424306,0.00016689322,0.0012345649,0.0003812323,0.3296782],"genre_scores_gemma":[0.73963964,0.011369853,0.13125378,0.002769814,0.002647954,0.0004948712,0.001305829,0.00038522744,0.11013305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992693,0.00026246888,0.00003697659,0.00015358356,0.00018727328,0.00009040136],"domain_scores_gemma":[0.9980433,0.0011050912,0.00024698622,0.00020560097,0.00020395835,0.00019510923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001417817,0.00079170463,0.00078010134,0.0017332812,0.0020593002,0.0036012237,0.0021022963,0.0034078946,0.019466428],"category_scores_gemma":[0.006349301,0.00059778616,0.00086794334,0.002663004,0.003182075,0.011630033,0.0035072563,0.005318223,0.002765403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006399745,0.000012487182,0.00005365518,0.0000366478,0.000004792881,0.00002734872,0.000038189028,0.00080621394,0.00007049902,0.9910944,0.004465476,0.0033839173],"study_design_scores_gemma":[0.000004679942,0.0000027137914,0.000033997156,0.000012502777,0.000003490384,0.00004908035,0.000042486725,0.003291035,0.000034730798,0.9933159,0.003205768,0.0000037254574],"about_ca_topic_score_codex":0.0010812351,"about_ca_topic_score_gemma":0.0014403398,"teacher_disagreement_score":0.019466428,"about_ca_system_score_codex":0.0017241135,"about_ca_system_score_gemma":0.0011138571,"threshold_uncertainty_score":0.06512171},"labels":[],"label_agreement":null},{"id":"W2578879722","doi":"","title":"The eccentric distance sum, the Harary index and the degree powers of graphs with given diameter.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Index (typography); Combinatorics; Physics; Computer science","score_opus":0.018055641405798177,"score_gpt":0.23797838800744714,"score_spread":0.21992274660164896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578879722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74117714,0.0051010745,0.11549073,0.0031411885,0.0005184632,0.000036956164,0.0007937697,0.00024217302,0.13349856],"genre_scores_gemma":[0.97960585,0.0010987539,0.009108733,0.00013414085,0.0003703228,0.0000277072,0.00019940434,0.00010547247,0.009349554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936646,0.00019145798,0.000035824723,0.0001481924,0.00016258856,0.00009541096],"domain_scores_gemma":[0.99515027,0.002773392,0.0007430442,0.00042296763,0.0002871401,0.00062337087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010199089,0.0005138911,0.0007505693,0.0021728086,0.0012210115,0.0027276091,0.0012891613,0.0009827927,0.004426766],"category_scores_gemma":[0.010350734,0.00035352755,0.0003078076,0.0015908063,0.0021899275,0.005761907,0.0017731391,0.0013553817,0.00080900086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022837151,0.00004046642,0.0030076639,0.00011451526,0.000031362997,0.00018405163,0.00035854153,0.012046688,0.0030975018,0.9558898,0.0053652315,0.019635806],"study_design_scores_gemma":[0.000018234396,0.000031376916,0.0018621597,0.00004414334,0.00003394932,0.0005015373,0.00020639678,0.028817728,0.0017203745,0.96090966,0.0058310824,0.000023371442],"about_ca_topic_score_codex":0.0004640772,"about_ca_topic_score_gemma":0.0005977084,"teacher_disagreement_score":0.004426766,"about_ca_system_score_codex":0.0011203084,"about_ca_system_score_gemma":0.0002812859,"threshold_uncertainty_score":0.014809072},"labels":[],"label_agreement":null},{"id":"W2579755476","doi":"","title":"On the Hosoya index and the Merrifield-Simmons index of bicyclic graphs with given matching number.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Index (typography); Matching (statistics); Discrete mathematics; Statistics; Computer science","score_opus":0.012962276215817291,"score_gpt":0.2520460377340407,"score_spread":0.23908376151822341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579755476","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6799352,0.0056872284,0.059206486,0.0030798116,0.00058226415,0.000073135714,0.0010196605,0.00028124597,0.250135],"genre_scores_gemma":[0.98286545,0.0015393422,0.0065128775,0.00023845812,0.00038457397,0.000044413056,0.00029422154,0.00005726412,0.008063447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942386,0.00015689932,0.000026782014,0.000095083604,0.00015619182,0.00014113488],"domain_scores_gemma":[0.9969627,0.001560577,0.00049337104,0.00022528345,0.0003193169,0.0004387744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009917666,0.00052768056,0.00084710104,0.0038668646,0.0013593542,0.0021446378,0.0012313483,0.0010504833,0.007931298],"category_scores_gemma":[0.006990321,0.00025845403,0.0003193911,0.002818761,0.0023096686,0.0047906977,0.0016896358,0.001552552,0.0009283778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016255437,0.000028385653,0.0013159616,0.00006596413,0.000013217914,0.00007324496,0.00028833555,0.0034743045,0.0010928438,0.97602004,0.0037757808,0.013689312],"study_design_scores_gemma":[0.000027721073,0.00003506545,0.001605177,0.000051421655,0.000018524122,0.00020255859,0.00023570441,0.013272391,0.00079298124,0.978323,0.0054051387,0.000030268842],"about_ca_topic_score_codex":0.001825957,"about_ca_topic_score_gemma":0.0023385098,"teacher_disagreement_score":0.007931298,"about_ca_system_score_codex":0.0015546017,"about_ca_system_score_gemma":0.000604207,"threshold_uncertainty_score":0.026532829},"labels":[],"label_agreement":null},{"id":"W2582814303","doi":"10.1016/j.laa.2017.01.034","title":"Minimising the largest mean first passage time of a Markov chain: The influence of directed graphs","year":2017,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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 Manitoba","funders":"","keywords":"Markov chain; Mathematics; Upper and lower bounds; Combinatorics; Continuous-time Markov chain; Stationary distribution; Matrix (chemical analysis); Markov chain mixing time; Term (time); Directed graph; Markov model; Balance equation; Discrete mathematics; Statistics; Mathematical analysis","score_opus":0.01839238917672945,"score_gpt":0.2725671525234428,"score_spread":0.25417476334671335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582814303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088096984,0.0019555453,0.9022087,0.0012318052,0.0001562088,0.000039263003,0.00012180552,0.00025598396,0.0059336615],"genre_scores_gemma":[0.91400576,0.0021125833,0.0762797,0.0002895044,0.00039320544,0.00012224379,0.00017129614,0.00034269737,0.006282929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847764,0.000729702,0.000052136,0.00033626883,0.00026524533,0.0001390154],"domain_scores_gemma":[0.9704706,0.025845138,0.0011349996,0.00072265574,0.0010469721,0.0007796342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031337226,0.0010760849,0.0018252548,0.0017703831,0.0007032061,0.001997111,0.0022885925,0.0018250654,0.0017849879],"category_scores_gemma":[0.02504576,0.0008940814,0.0010409674,0.0012346403,0.0024892078,0.003306694,0.0019021066,0.0020516983,0.0002440829],"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.00014542852,0.00006654687,0.001026577,0.0003442313,0.00014847856,0.00014106014,0.00016995639,0.77276313,0.005298515,0.1981094,0.0014376735,0.02034897],"study_design_scores_gemma":[0.000007214384,0.000020688163,0.00014751396,0.000014346952,0.000020099938,0.000020799163,0.000010966578,0.93084455,0.0007081146,0.06774395,0.00044859573,0.000013193143],"about_ca_topic_score_codex":0.004317452,"about_ca_topic_score_gemma":0.0037326121,"teacher_disagreement_score":0.004317452,"about_ca_system_score_codex":0.0017288135,"about_ca_system_score_gemma":0.0018441755,"threshold_uncertainty_score":0.016572952},"labels":[],"label_agreement":null},{"id":"W2585241149","doi":"10.37236/7958","title":"A Note on Counting Flows in Signed Graphs","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky","keywords":"Mathematics; Combinatorics; Abelian group; Signed graph; Zero (linguistics); Graph; Polynomial; Order (exchange); Discrete mathematics; Integer (computer science); Mathematical analysis; Computer science; Linguistics","score_opus":0.019125018630733386,"score_gpt":0.2942883673323062,"score_spread":0.2751633487015728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585241149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3231592,0.015190432,0.43196598,0.021939816,0.0067714234,0.00018653872,0.0009840654,0.0009783041,0.19882424],"genre_scores_gemma":[0.84586185,0.010086816,0.095022835,0.004654132,0.0059756655,0.00019586668,0.0007043972,0.0004737527,0.037024785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977791,0.00071959797,0.00014460059,0.00043528064,0.000563121,0.00035836617],"domain_scores_gemma":[0.99108595,0.0066371197,0.00047087795,0.00062937336,0.0005638434,0.00061282096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002675294,0.0012163445,0.0013832717,0.0042752298,0.0025389486,0.0039824797,0.001553622,0.0021473926,0.0048781736],"category_scores_gemma":[0.014117642,0.0006156358,0.0012966978,0.003999619,0.004763767,0.012843128,0.002710678,0.004490618,0.00074696407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005673677,0.00004294843,0.001052424,0.00009024251,0.000011950327,0.00009425486,0.00030620495,0.0018018233,0.0012930229,0.9744505,0.0050495784,0.015750298],"study_design_scores_gemma":[0.000017000224,0.000041625044,0.00060628983,0.00007119213,0.000022786162,0.00017362504,0.00010237148,0.013376382,0.0015503695,0.96572965,0.018265415,0.00004322363],"about_ca_topic_score_codex":0.00246989,"about_ca_topic_score_gemma":0.0017094372,"teacher_disagreement_score":0.0048781736,"about_ca_system_score_codex":0.0025902796,"about_ca_system_score_gemma":0.0010543343,"threshold_uncertainty_score":0.01879394},"labels":[],"label_agreement":null},{"id":"W2588224742","doi":"10.37236/8747","title":"The Maximum Number of Cycles in a Graph with Fixed Number of Edges","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Multigraph; Combinatorics; Multiple edges; Mathematics; Graph; Complement graph; Upper and lower bounds; Graph power; Strength of a graph; Discrete mathematics; Line graph","score_opus":0.016726757068476514,"score_gpt":0.29760050254431675,"score_spread":0.2808737454758402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2588224742","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.574773,0.008104206,0.3737851,0.0032903913,0.00020774265,0.00024358118,0.0022048422,0.00082683,0.036564313],"genre_scores_gemma":[0.8302429,0.003882338,0.15515791,0.0003717967,0.00019396358,0.0003606298,0.0009545547,0.00048119412,0.008354639],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892163,0.00027485922,0.00005454368,0.0004204331,0.00015596185,0.0001725091],"domain_scores_gemma":[0.99426806,0.0037685933,0.0007122955,0.00046898596,0.00035410575,0.00042778408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008558652,0.0013991406,0.0012797951,0.0023422253,0.0014256748,0.0025259266,0.0020404933,0.0017602284,0.0035869943],"category_scores_gemma":[0.009544552,0.0009058983,0.0006998639,0.002503787,0.0014788095,0.0050291363,0.0015175606,0.0010912191,0.0005419928],"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.001073422,0.00017837757,0.0051012686,0.0017125936,0.00035389294,0.0005767023,0.0005930521,0.4139913,0.04094726,0.3925445,0.013748556,0.12917908],"study_design_scores_gemma":[0.00006798615,0.00021481774,0.001979949,0.00021172846,0.00014781719,0.00059539493,0.0002326102,0.44972548,0.012621567,0.52134454,0.012776248,0.00008185607],"about_ca_topic_score_codex":0.0015412553,"about_ca_topic_score_gemma":0.002552727,"teacher_disagreement_score":0.0035869943,"about_ca_system_score_codex":0.0022146346,"about_ca_system_score_gemma":0.0010629572,"threshold_uncertainty_score":0.016068399},"labels":[],"label_agreement":null},{"id":"W2590494643","doi":"","title":"On zeta elements for Gm","year":2016,"lang":"en","type":"article","venue":"","topic":"Graph theory and applications","field":"Mathematics","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":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Mathematics education; Pure mathematics","score_opus":0.06564727443267517,"score_gpt":0.35681431216683607,"score_spread":0.2911670377341609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2590494643","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4121973,0.0024664025,0.13657878,0.00971768,0.0019959481,0.00015706186,0.00059042586,0.00095293776,0.43534347],"genre_scores_gemma":[0.84189236,0.0013163452,0.013282089,0.0017613074,0.001551416,0.00015574503,0.0004496796,0.0005398147,0.13905133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947125,0.0001419178,0.000020267566,0.00010116113,0.00012633124,0.0001391146],"domain_scores_gemma":[0.9990202,0.0003551375,0.00012709094,0.00008111525,0.0001286705,0.00028779582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085849024,0.0016926185,0.0011572206,0.0049613034,0.0029688186,0.0035512552,0.0014157561,0.001604235,0.021578116],"category_scores_gemma":[0.0025114862,0.0005873574,0.0010132669,0.0021781197,0.004217568,0.00588495,0.0054657306,0.0046886643,0.003757332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030771647,0.000013433667,0.0000885174,0.000023349034,0.00000470874,0.00004340976,0.00022745521,0.00023266625,0.00036051986,0.9934889,0.0015025622,0.0039836233],"study_design_scores_gemma":[0.000011002241,0.000007923241,0.00011274076,0.000016424683,0.000004919662,0.000057376288,0.00009728356,0.0008912075,0.00018701731,0.9954939,0.003111974,0.00000825266],"about_ca_topic_score_codex":0.0010145545,"about_ca_topic_score_gemma":0.001021782,"teacher_disagreement_score":0.021578116,"about_ca_system_score_codex":0.001982267,"about_ca_system_score_gemma":0.00053421984,"threshold_uncertainty_score":0.07218593},"labels":[],"label_agreement":null},{"id":"W2590589653","doi":"10.1016/j.disc.2017.01.018","title":"Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":22,"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; University of Waterloo","funders":"","keywords":"Mathematics; Hermitian matrix; Spectral radius; Combinatorics; RADIUS; Discrete mathematics; Hypergraph; Eigenvalues and eigenvectors; Pure mathematics; Physics; Quantum mechanics; Computer science","score_opus":0.02441696141792542,"score_gpt":0.27759628618214044,"score_spread":0.253179324764215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2590589653","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73660725,0.000718389,0.13672625,0.0016754438,0.00036525846,0.00010486925,0.0007993328,0.0004910583,0.122512065],"genre_scores_gemma":[0.9477021,0.0004979626,0.021515492,0.0005253414,0.00020082318,0.00012469786,0.00048155774,0.00017451798,0.028777529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940825,0.00014780607,0.000029155886,0.00015440168,0.00012638245,0.00013392691],"domain_scores_gemma":[0.9973022,0.0011075898,0.0004396217,0.00019950197,0.00026599996,0.00068516866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047114768,0.00079415506,0.0007746801,0.0024219907,0.0021439255,0.002569615,0.000807374,0.0013389316,0.009142896],"category_scores_gemma":[0.002914059,0.00065147434,0.00048320935,0.0015603565,0.0021001596,0.002881917,0.0018808327,0.0019333581,0.0013670758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039676506,0.000022400855,0.00019396227,0.000019949553,0.000005800626,0.00008242524,0.00015250663,0.00087417656,0.0009420779,0.99395967,0.0010069365,0.002700341],"study_design_scores_gemma":[0.000025578473,0.00001831347,0.00031524125,0.000012830839,0.000008459745,0.00020139989,0.00011479776,0.0067725843,0.0006627042,0.98831916,0.0035321391,0.000016814074],"about_ca_topic_score_codex":0.00069993595,"about_ca_topic_score_gemma":0.0008085862,"teacher_disagreement_score":0.009142896,"about_ca_system_score_codex":0.00080456457,"about_ca_system_score_gemma":0.00054428616,"threshold_uncertainty_score":0.030586064},"labels":[],"label_agreement":null},{"id":"W2591823665","doi":"10.2298/fil1709545a","title":"Distance Laplacian eigenvalues and chromatic number in graphs","year":2017,"lang":"en","type":"article","venue":"Filomat","topic":"Graph theory and applications","field":"Mathematics","cited_by":15,"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":"Mathematics; Spectral radius; Chromatic scale; Eigenvalues and eigenvectors; Laplace operator; Combinatorics; Laplacian matrix; Resistance distance; Graph; Order (exchange); Discrete mathematics; Mathematical analysis; Line graph; Physics; Graph power","score_opus":0.04012708329099127,"score_gpt":0.3434498341379221,"score_spread":0.30332275084693083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591823665","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7581961,0.0016873812,0.21427688,0.0010391749,0.0000734155,0.000029606073,0.00021320522,0.00030504027,0.024179237],"genre_scores_gemma":[0.9879865,0.00047040338,0.00838955,0.000067785804,0.00008803856,0.00002408551,0.00007881663,0.000056843488,0.0028377871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995851,0.00010382318,0.000014061221,0.00011765953,0.00010679767,0.00007264503],"domain_scores_gemma":[0.99585426,0.0026325171,0.0005930254,0.000252328,0.00033935637,0.00032849886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005603675,0.00048665603,0.00042345564,0.0024535507,0.0008084344,0.0014933627,0.0010573575,0.000733273,0.0037084154],"category_scores_gemma":[0.0059002745,0.0003143013,0.0002549041,0.001322378,0.0026370713,0.0022676145,0.001156202,0.00091633294,0.0003639887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018986607,0.00006871171,0.00515545,0.00019748711,0.000038032653,0.0002363264,0.00046886082,0.07144174,0.01556564,0.8892127,0.0019097566,0.015515428],"study_design_scores_gemma":[0.000018040613,0.000049368693,0.004391343,0.000036849702,0.000014905303,0.00033217305,0.00025653688,0.18847737,0.0032778787,0.8012766,0.0018251461,0.00004374608],"about_ca_topic_score_codex":0.00093408144,"about_ca_topic_score_gemma":0.000876714,"teacher_disagreement_score":0.0037084154,"about_ca_system_score_codex":0.0012523297,"about_ca_system_score_gemma":0.0002925185,"threshold_uncertainty_score":0.012405932},"labels":[],"label_agreement":null},{"id":"W2591848420","doi":"","title":"On Harmonic Indices of Trees, Unicyclic graphs and Bicyclic graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.03238055584523256,"score_gpt":0.30340022209151707,"score_spread":0.2710196662462845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591848420","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3290364,0.018862942,0.14617375,0.005123962,0.0023854764,0.00011981248,0.0010992227,0.0003480986,0.49685037],"genre_scores_gemma":[0.89026564,0.009602364,0.0287743,0.0011616806,0.0018879364,0.00016371661,0.0009518225,0.000279736,0.0669128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957544,0.00010515635,0.000020898553,0.000077043136,0.00012887787,0.00009257582],"domain_scores_gemma":[0.9983405,0.0008367735,0.00024725706,0.00014157187,0.00019627211,0.00023762816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005182958,0.0006322972,0.0008111348,0.0032521808,0.0014147473,0.0025049888,0.0012373857,0.0011151832,0.00907255],"category_scores_gemma":[0.004079988,0.00042723052,0.000377637,0.0027085247,0.0024114982,0.00448582,0.0022673674,0.0023078772,0.0017990094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021066195,0.000017400398,0.0002853864,0.000052640906,0.0000054861557,0.000050418726,0.00021636311,0.00093820685,0.00046448217,0.9810085,0.0046186172,0.012321335],"study_design_scores_gemma":[0.000006577433,0.0000099697,0.00035185518,0.000035669178,0.000005860426,0.00010677425,0.00016602039,0.0037750264,0.00015515601,0.9881826,0.0071948664,0.000009586725],"about_ca_topic_score_codex":0.0016181136,"about_ca_topic_score_gemma":0.0024746952,"teacher_disagreement_score":0.00907255,"about_ca_system_score_codex":0.0012343962,"about_ca_system_score_gemma":0.00046750205,"threshold_uncertainty_score":0.030350685},"labels":[],"label_agreement":null},{"id":"W2592374713","doi":"","title":"Computing Wiener Index of C 12n Fullerenes.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Index (typography); Fullerene; Mathematics; Wiener index; Computer science; Combinatorics; Physics; World Wide Web; Quantum mechanics","score_opus":0.036914196792453835,"score_gpt":0.31519262087534294,"score_spread":0.2782784240828891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592374713","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7982673,0.0011859527,0.06820782,0.00056271936,0.00025874906,0.00003824266,0.0017445328,0.00047375463,0.12926088],"genre_scores_gemma":[0.9618806,0.00047982007,0.020672774,0.00012236852,0.00006418514,0.00003321375,0.001251303,0.0002620246,0.015233615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997365,0.000024108078,0.000013186837,0.000057930807,0.00010161715,0.00006658543],"domain_scores_gemma":[0.99964917,0.00010266159,0.000052152987,0.00006657536,0.0000681138,0.00006126884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028730102,0.00042653404,0.00054225215,0.0022547569,0.0009271177,0.0018104409,0.0005405966,0.00055626384,0.013755511],"category_scores_gemma":[0.0015560426,0.00019805555,0.00030480503,0.0013610467,0.00083056884,0.0030929542,0.0012568628,0.0008281525,0.0020481201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034364706,0.00009454278,0.0029315655,0.0002703786,0.00003998539,0.0002698163,0.00052166963,0.009945541,0.01727604,0.88131654,0.010995673,0.07599462],"study_design_scores_gemma":[0.00002108649,0.000058683116,0.0026285243,0.0000704317,0.000019248158,0.00021028121,0.00031415376,0.0318576,0.011343546,0.9378646,0.015568182,0.0000435563],"about_ca_topic_score_codex":0.00092078856,"about_ca_topic_score_gemma":0.0025550104,"teacher_disagreement_score":0.013755511,"about_ca_system_score_codex":0.0007560415,"about_ca_system_score_gemma":0.00032902154,"threshold_uncertainty_score":0.046016753},"labels":[],"label_agreement":null},{"id":"W2592557224","doi":"","title":"The Laplacian spectral radius for bicyclic graphs with given independence number.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Independence number; Spectral radius; Independence (probability theory); Laplace operator; Combinatorics; RADIUS; Statistics; Graph; Mathematical analysis; Physics; Eigenvalues and eigenvectors; Computer science; Quantum mechanics; Computer security","score_opus":0.02427209226619297,"score_gpt":0.30515635858914275,"score_spread":0.28088426632294977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592557224","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77283776,0.0025042985,0.10169592,0.0030364827,0.00029702473,0.000060559047,0.0014495178,0.0007508261,0.11736769],"genre_scores_gemma":[0.98911333,0.0005977268,0.00539168,0.00015023617,0.0001444577,0.00004910311,0.00029414953,0.00008718177,0.004172181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949205,0.00017379194,0.000018106044,0.000092897164,0.00012253718,0.00010060665],"domain_scores_gemma":[0.99619687,0.0021523912,0.00052523846,0.0002429001,0.0003352837,0.0005473953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005776511,0.00045510632,0.00055019924,0.0024368358,0.00090378907,0.0017628563,0.0010346072,0.000937028,0.005833024],"category_scores_gemma":[0.0074042054,0.00028617884,0.00021661138,0.0012966408,0.0015654885,0.0019494708,0.0012429997,0.00096047967,0.0010972589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029479584,0.000069122274,0.0018800066,0.00018460525,0.000035769208,0.0002088668,0.0004339835,0.021651426,0.006660595,0.9329467,0.01580161,0.019832497],"study_design_scores_gemma":[0.000037670074,0.00003791747,0.0023163923,0.000061164625,0.000027300406,0.00044811712,0.00036636705,0.121942006,0.0026879462,0.86696684,0.0050634267,0.000044922766],"about_ca_topic_score_codex":0.0010567226,"about_ca_topic_score_gemma":0.0010596763,"teacher_disagreement_score":0.005833024,"about_ca_system_score_codex":0.0010571964,"about_ca_system_score_gemma":0.00036720466,"threshold_uncertainty_score":0.019513428},"labels":[],"label_agreement":null},{"id":"W2592627363","doi":"","title":"Spectral determination of a class of tricyclic graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tricyclic; Mathematics; Class (philosophy); Combinatorics; Chemistry; Stereochemistry; Computer science; Artificial intelligence","score_opus":0.03159058847447061,"score_gpt":0.31093711473108354,"score_spread":0.27934652625661294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592627363","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5953723,0.0017010865,0.14446202,0.0020925975,0.0005804653,0.00013714816,0.0012241955,0.00062903686,0.25380108],"genre_scores_gemma":[0.9651509,0.00057537877,0.014478552,0.0002635001,0.00022579919,0.00004114357,0.0008381373,0.00010152382,0.018325005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955744,0.00007612589,0.000018036602,0.00013668896,0.00013284126,0.00007886604],"domain_scores_gemma":[0.99880207,0.00036410338,0.00022129483,0.0001955298,0.00022349825,0.00019348804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022558146,0.0003094241,0.0003679768,0.0015841224,0.001318565,0.001760981,0.000752227,0.00078001583,0.007135553],"category_scores_gemma":[0.0027151068,0.0002848173,0.0003321733,0.0011814366,0.0012614598,0.0012850618,0.0011208816,0.0011386279,0.0012292765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004117283,0.000034051995,0.00093689404,0.00008965587,0.000010946482,0.00020752824,0.00039932632,0.0016333512,0.0026509962,0.96457535,0.008525576,0.020895131],"study_design_scores_gemma":[0.00002748748,0.000037600286,0.0017261206,0.00006699218,0.000025216472,0.0013992055,0.00062231463,0.019557448,0.0034849297,0.94885695,0.024163691,0.000032130512],"about_ca_topic_score_codex":0.0010196888,"about_ca_topic_score_gemma":0.0010837988,"teacher_disagreement_score":0.007135553,"about_ca_system_score_codex":0.00055634574,"about_ca_system_score_gemma":0.00049144705,"threshold_uncertainty_score":0.023870766},"labels":[],"label_agreement":null},{"id":"W2592882128","doi":"10.1016/j.amc.2017.12.025","title":"Cospectrality of graphs with respect to distance matrices","year":2018,"lang":"en","type":"article","venue":"Applied Mathematics and Computation","topic":"Graph theory and applications","field":"Mathematics","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Distance matrix; Resistance distance; Combinatorics; Mathematics; Distance matrices in phylogeny; Laplacian matrix; Laplace operator; Connectivity; Graph; Spectrum (functional analysis); Spectral line; Discrete mathematics; Line graph; Physics; Graph power; Mathematical analysis","score_opus":0.02554821991534787,"score_gpt":0.29955603461978214,"score_spread":0.27400781470443425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592882128","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6576771,0.0006496092,0.26164696,0.002293202,0.00037128478,0.00008072633,0.0008135254,0.0004061996,0.07606131],"genre_scores_gemma":[0.95394444,0.0006131842,0.030611843,0.00048837723,0.00065808155,0.00010997426,0.0006556791,0.0003092416,0.01260911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981103,0.0005701834,0.00008466876,0.000519621,0.00047402832,0.00024116276],"domain_scores_gemma":[0.9922477,0.0033212712,0.0014354159,0.00074974453,0.0011643731,0.0010814994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012394618,0.00094083714,0.00084559666,0.003995074,0.0017339241,0.0036715933,0.0013824775,0.0013000879,0.009401339],"category_scores_gemma":[0.008404287,0.00052599557,0.0005574206,0.0026571935,0.0027907398,0.0051062894,0.0022361139,0.00227818,0.0010911495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069764035,0.000032937234,0.00043569357,0.000034881636,0.000008566196,0.00006909153,0.0002929547,0.002093556,0.002219155,0.9865866,0.0011445651,0.0070124073],"study_design_scores_gemma":[0.00001328228,0.00002320528,0.00045023454,0.000013890046,0.000008028422,0.00017675302,0.00012308826,0.01433268,0.0010764466,0.9817452,0.0020207856,0.00001657646],"about_ca_topic_score_codex":0.0007941009,"about_ca_topic_score_gemma":0.0007026229,"teacher_disagreement_score":0.009401339,"about_ca_system_score_codex":0.000965605,"about_ca_system_score_gemma":0.00049327716,"threshold_uncertainty_score":0.03145063},"labels":[],"label_agreement":null},{"id":"W2592983026","doi":"","title":"The Wiener index of cacti given matching number.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Matching (statistics); Index (typography); Statistics; Combinatorics; Computer science; World Wide Web","score_opus":0.02607460745190234,"score_gpt":0.3159737583519705,"score_spread":0.2898991509000682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592983026","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49097636,0.0043288153,0.08740962,0.0030346485,0.0022415116,0.00007517903,0.0009686931,0.00054530054,0.4104199],"genre_scores_gemma":[0.93932784,0.001504054,0.010558697,0.00030238988,0.0010490852,0.00007511691,0.0003592548,0.0001841826,0.046639394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993772,0.00008476944,0.000030040354,0.00014847933,0.00020580999,0.0001536627],"domain_scores_gemma":[0.9987172,0.00036953023,0.00024615726,0.00013153728,0.00021151874,0.00032400765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006381761,0.00056371343,0.0008403559,0.0049237506,0.0015889057,0.0030922072,0.0010831702,0.001163265,0.0115848025],"category_scores_gemma":[0.004307369,0.00030418957,0.00045099002,0.0021485987,0.0022573597,0.0052586617,0.001914233,0.0016482853,0.0020819907],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038246326,0.000012145649,0.0004114221,0.00004665388,0.0000091039,0.00006979627,0.00018358447,0.000585683,0.0013329575,0.9877495,0.002035265,0.00752561],"study_design_scores_gemma":[0.000008087435,0.000026758331,0.0011597916,0.000038267666,0.000014660217,0.00028283932,0.00013003606,0.0063953674,0.0015233662,0.9796244,0.010770124,0.00002633258],"about_ca_topic_score_codex":0.000982781,"about_ca_topic_score_gemma":0.0010019977,"teacher_disagreement_score":0.0115848025,"about_ca_system_score_codex":0.0018717643,"about_ca_system_score_gemma":0.00060299976,"threshold_uncertainty_score":0.038755},"labels":[],"label_agreement":null},{"id":"W2593046873","doi":"","title":"On the signless Laplacian spetral radius of bicyclic graphs with fixed diameter.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; RADIUS; Discrete mathematics; Computer network; Computer science","score_opus":0.03426526987705362,"score_gpt":0.2847459502372293,"score_spread":0.2504806803601757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593046873","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72460973,0.010121297,0.11253573,0.004720562,0.0007228913,0.00010336347,0.0011504978,0.0008517915,0.14518417],"genre_scores_gemma":[0.98103297,0.002109706,0.009085279,0.00034956675,0.0003550574,0.00008627451,0.0002699311,0.00017051835,0.006540661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993616,0.00023735045,0.000024762292,0.00012029357,0.00012680743,0.00012931204],"domain_scores_gemma":[0.99443746,0.0032789668,0.0007792928,0.0003637566,0.00037638258,0.0007641041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089904026,0.0007186329,0.0010026996,0.0027863507,0.0011755292,0.0019357493,0.002155131,0.0014696339,0.006061531],"category_scores_gemma":[0.010906035,0.00048396763,0.0003414651,0.0012952283,0.0026483776,0.0035822303,0.0020480051,0.0016744495,0.0011989212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025497348,0.000047217014,0.0011300863,0.0002598623,0.000026888618,0.00019934845,0.00036347166,0.019523969,0.0052304165,0.9453069,0.012484757,0.015172119],"study_design_scores_gemma":[0.000067846464,0.000088436995,0.0016038059,0.000116671516,0.000040678242,0.00050357694,0.00035497948,0.081489645,0.0019176872,0.90724564,0.0064994167,0.000071714145],"about_ca_topic_score_codex":0.0011534535,"about_ca_topic_score_gemma":0.0010970603,"teacher_disagreement_score":0.006061531,"about_ca_system_score_codex":0.0013462546,"about_ca_system_score_gemma":0.00042535106,"threshold_uncertainty_score":0.020277798},"labels":[],"label_agreement":null},{"id":"W2593075230","doi":"10.1090/surv/210/11","title":"Sparse sets in the dynamical Mordell-Lang conjecture","year":2016,"lang":"en","type":"book-chapter","venue":"Mathematical surveys and monographs","topic":"Graph theory and applications","field":"Mathematics","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 British Columbia; University of Waterloo","funders":"","keywords":"Conjecture; Mathematics; Pure mathematics; Combinatorics; Computer science","score_opus":0.04985222542107929,"score_gpt":0.2931457833323603,"score_spread":0.24329355791128102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593075230","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.21765001,0.011516925,0.13979885,0.04009536,0.0034358902,0.000073713,0.0011401089,0.0005019004,0.58578724],"genre_scores_gemma":[0.91902333,0.004486323,0.018277185,0.00325001,0.0032292733,0.00015596373,0.0007604122,0.0002232514,0.05059423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994363,0.00016800381,0.000020800091,0.00012177209,0.00016910105,0.000083980005],"domain_scores_gemma":[0.9988141,0.00072410994,0.000088446126,0.00017595872,0.000100339465,0.00009699392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007981825,0.00043108215,0.00078758446,0.0010335082,0.0019277601,0.0030353796,0.0008193807,0.0019163031,0.009561459],"category_scores_gemma":[0.0039091473,0.00040562113,0.00068175857,0.0011589709,0.004303037,0.0066098985,0.0027214873,0.0032684635,0.0015251327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008292376,0.000004264278,0.00004841435,0.000014932671,0.0000015996333,0.0000133200665,0.00007011044,0.00037095038,0.00006778211,0.99480313,0.0022372664,0.0023599206],"study_design_scores_gemma":[0.0000028807028,0.000001298697,0.00002780001,0.0000063979724,8.453474e-7,0.000009573822,0.000019157207,0.000601967,0.000027218455,0.99702954,0.0022714261,0.0000018390787],"about_ca_topic_score_codex":0.0011527456,"about_ca_topic_score_gemma":0.0012720586,"teacher_disagreement_score":0.009561459,"about_ca_system_score_codex":0.001519881,"about_ca_system_score_gemma":0.00063155545,"threshold_uncertainty_score":0.031986237},"labels":[],"label_agreement":null},{"id":"W2594435072","doi":"","title":"Extremal Laplacian Estrada Index of Threshold Graphs with Given Size.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Laplace operator; Combinatorics; Statistics; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.02679138242446925,"score_gpt":0.28186781658815707,"score_spread":0.2550764341636878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594435072","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8955274,0.0009837174,0.038979236,0.0013541164,0.00015688284,0.000027949112,0.0009393959,0.00046132554,0.061569914],"genre_scores_gemma":[0.9921022,0.00024882378,0.0033448467,0.00008933419,0.000078686324,0.000023188955,0.00024289319,0.000061624574,0.003808442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975115,0.000052662228,0.000008929491,0.00005666441,0.00006366444,0.00006695089],"domain_scores_gemma":[0.997962,0.001074401,0.00025712664,0.00015851327,0.00019214985,0.0003559315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044900333,0.00031206373,0.00056370755,0.0020979345,0.0008086374,0.0017257507,0.0010030336,0.0007721625,0.00563105],"category_scores_gemma":[0.0045608543,0.00021290156,0.00025365144,0.00074931147,0.00094775675,0.0018159247,0.0009384311,0.00086596404,0.0005215965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046600762,0.00010227247,0.0048843906,0.00023204485,0.000047912523,0.00042222795,0.00043938856,0.017531462,0.015467067,0.92907447,0.012839053,0.018493818],"study_design_scores_gemma":[0.00006021378,0.00006384759,0.006046485,0.00006188639,0.00005810928,0.00085052836,0.0004706015,0.15261227,0.0053918776,0.8299042,0.004439482,0.000040529078],"about_ca_topic_score_codex":0.0006499339,"about_ca_topic_score_gemma":0.0009712744,"teacher_disagreement_score":0.00563105,"about_ca_system_score_codex":0.0009485372,"about_ca_system_score_gemma":0.000341745,"threshold_uncertainty_score":0.01883775},"labels":[],"label_agreement":null},{"id":"W2599751583","doi":"10.1139/cjc-2017-0083","title":"Molecular description of carbon graphite and crystal cubic carbon structures","year":2017,"lang":"en","type":"article","venue":"Canadian Journal of Chemistry","topic":"Graph theory and applications","field":"Mathematics","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Molecular graph; Topological index; Chemistry; Graphite; Graph theory; Carbon fibers; Crystal structure; Crystal (programming language); Graph; Molecule; Combinatorics; Atom (system on chip); Chemical bond; Crystallography; Computational chemistry; Mathematics; Organic chemistry; Algorithm; Computer science","score_opus":0.018032503583199577,"score_gpt":0.24044131958793397,"score_spread":0.2224088160047344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599751583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24079461,0.010225468,0.47760084,0.0018065352,0.0006925659,0.0001424659,0.004236636,0.00094534917,0.2635555],"genre_scores_gemma":[0.88319886,0.0023589067,0.09483584,0.0003031536,0.00019704712,0.00009747175,0.0013439453,0.00011029544,0.01755439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99989986,0.000018647077,0.0000043779114,0.000014240777,0.000048105823,0.000014679565],"domain_scores_gemma":[0.9999014,0.000022659562,0.00001452252,0.000017059243,0.00003453543,0.000009791927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007888218,0.00021235357,0.00022100616,0.0012480929,0.00046568003,0.0005421697,0.00047307444,0.0005448371,0.0038006215],"category_scores_gemma":[0.00034167236,0.00007335837,0.00029640328,0.0011099376,0.00048931694,0.00061434484,0.00022838013,0.00049661007,0.0005193853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016988313,0.000011833972,0.00028009756,0.000119765005,0.000005036172,0.00017920227,0.0000546535,0.02536827,0.004322999,0.9501855,0.0028492867,0.016606504],"study_design_scores_gemma":[0.000007820575,0.000037779784,0.0010560531,0.000043313205,0.000008291182,0.000744444,0.00011608893,0.2068248,0.002226526,0.7514175,0.037486758,0.000030560383],"about_ca_topic_score_codex":0.0024839563,"about_ca_topic_score_gemma":0.0025798683,"teacher_disagreement_score":0.0038006215,"about_ca_system_score_codex":0.00036140397,"about_ca_system_score_gemma":0.00040366713,"threshold_uncertainty_score":0.012714386},"labels":[],"label_agreement":null},{"id":"W2600202171","doi":"10.1016/j.disc.2017.01.024","title":"On the roots of all-terminal reliability polynomials","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":39,"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; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Terminal (telecommunication); Conjecture; Simple graph; Upper and lower bounds; Properties of polynomial roots; Modulus; Graph; Reliability (semiconductor); Discrete mathematics; Enhanced Data Rates for GSM Evolution; Undirected graph; Polynomial; Mathematical analysis; Computer science; Geometry","score_opus":0.06495913138480752,"score_gpt":0.35416698980653794,"score_spread":0.2892078584217304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600202171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25799865,0.0019661395,0.6580624,0.0027730025,0.00034138732,0.0000679524,0.00041348644,0.0003124234,0.07806452],"genre_scores_gemma":[0.95544344,0.0016634329,0.025336068,0.000241248,0.00040909735,0.00006207596,0.0001627075,0.00017079235,0.016511146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991646,0.00030258423,0.000022926033,0.00014104579,0.00020779023,0.00016112652],"domain_scores_gemma":[0.9906906,0.0067610103,0.0007319408,0.0005648814,0.0008124772,0.00043902986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014436686,0.0007465852,0.000912669,0.001515085,0.00095783034,0.0016483832,0.0012522747,0.0009870455,0.007716138],"category_scores_gemma":[0.017095331,0.00044193363,0.00058872096,0.001196546,0.0031780833,0.0036930458,0.0015703368,0.0038441978,0.0012796323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003858281,0.000015216539,0.00017980793,0.00005337437,0.0000072104,0.000056024746,0.0001700977,0.012420355,0.00090454763,0.9762062,0.0015634572,0.008385156],"study_design_scores_gemma":[0.000010795791,0.000013503223,0.00020000244,0.000022497292,0.0000060250013,0.00005727445,0.00006359845,0.03390356,0.000333353,0.9640869,0.0012891713,0.000013328531],"about_ca_topic_score_codex":0.0010816997,"about_ca_topic_score_gemma":0.0009822049,"teacher_disagreement_score":0.007716138,"about_ca_system_score_codex":0.0011548653,"about_ca_system_score_gemma":0.000780221,"threshold_uncertainty_score":0.025813103},"labels":[],"label_agreement":null},{"id":"W2601087034","doi":"10.1090/fic/037/01","title":"On the distribution of values in the quadratic assignment problem","year":2003,"lang":"en","type":"other","venue":"","topic":"Graph theory and applications","field":"Mathematics","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":"Permutation (music); Combinatorics; Mathematics; Travelling salesman problem; Hamming distance; Function (biology); Class (philosophy); Metric (unit); Discrete mathematics; Permutation group; Value (mathematics); Expected value; Symmetric group; Quadratic equation; Fraction (chemistry); Mathematical optimization; Statistics; Computer science","score_opus":0.03391066366903426,"score_gpt":0.29452562169379587,"score_spread":0.2606149580247616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2601087034","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6371363,0.0012076263,0.3422097,0.0028088759,0.00004859999,0.00014993941,0.0006650384,0.0002400192,0.015533922],"genre_scores_gemma":[0.96418065,0.0007457864,0.029394133,0.00019270547,0.00011741256,0.00024695048,0.0007164938,0.00015182409,0.004253947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963342,0.001892336,0.00011360969,0.0007295215,0.0005539041,0.00037630057],"domain_scores_gemma":[0.9788522,0.016359579,0.0016255558,0.0013275438,0.0011105845,0.0007243789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006439487,0.00074036483,0.0017733325,0.0021744675,0.0014562121,0.0028549903,0.0021341739,0.001588362,0.0056596156],"category_scores_gemma":[0.035517313,0.0005808162,0.0006866042,0.002417795,0.003957578,0.0049554007,0.0021063816,0.0020564455,0.0006230361],"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.001351925,0.00034351688,0.013937129,0.00038314733,0.00016102326,0.00043721928,0.0012353883,0.46004158,0.0045128083,0.43652117,0.006530478,0.07454468],"study_design_scores_gemma":[0.00009324466,0.0002072151,0.0041205124,0.000063338826,0.00002314315,0.00026950374,0.00032383675,0.5835815,0.001523937,0.40759087,0.0021557782,0.00004707296],"about_ca_topic_score_codex":0.0015109414,"about_ca_topic_score_gemma":0.000896463,"teacher_disagreement_score":0.006439487,"about_ca_system_score_codex":0.0020658495,"about_ca_system_score_gemma":0.000694642,"threshold_uncertainty_score":0.03405571},"labels":[],"label_agreement":null},{"id":"W2601917914","doi":"","title":"Distance Laplacian eigenvalues and chromatic number in graphs","year":2016,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Chromatic scale; Spectral radius; Eigenvalues and eigenvectors; Combinatorics; Laplace operator; Resistance distance; Laplacian matrix; Graph; Discrete mathematics; Mathematical analysis; Line graph; Physics; Graph power","score_opus":0.013328185719392762,"score_gpt":0.2576371197784077,"score_spread":0.24430893405901494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2601917914","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78107184,0.0016626527,0.1875122,0.0014624628,0.000080881284,0.000028572878,0.00021302493,0.00029376618,0.027674528],"genre_scores_gemma":[0.9891454,0.00044180712,0.007265817,0.000081153776,0.00009231716,0.000024780731,0.00007520414,0.00005824331,0.0028152498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954456,0.000113118345,0.000013269515,0.00012978262,0.000120992634,0.000078309065],"domain_scores_gemma":[0.9952419,0.0031337808,0.00058971887,0.0002958756,0.00037659844,0.0003620878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006024623,0.0005317605,0.00046945506,0.002508338,0.00092570233,0.001591104,0.001191928,0.00079972117,0.003888235],"category_scores_gemma":[0.0067899,0.00034650075,0.00026431092,0.0014263578,0.0030344604,0.0022478718,0.0011727437,0.0011439916,0.0003588765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014808969,0.00006109131,0.004508969,0.00015293897,0.000034657867,0.00018461268,0.0004422795,0.06131048,0.012195219,0.9065935,0.0018529715,0.012515188],"study_design_scores_gemma":[0.000018402938,0.000037791757,0.004252252,0.00003317584,0.000013490841,0.0002657921,0.00024299398,0.17373656,0.002877511,0.816735,0.0017424915,0.000044595567],"about_ca_topic_score_codex":0.0013317087,"about_ca_topic_score_gemma":0.0013221785,"teacher_disagreement_score":0.003888235,"about_ca_system_score_codex":0.0015281899,"about_ca_system_score_gemma":0.0003490201,"threshold_uncertainty_score":0.013007462},"labels":[],"label_agreement":null},{"id":"W2602837592","doi":"","title":"A Magnetic Procedure for the Stability Number","year":2008,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Graph theory and applications","field":"Mathematics","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","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Stability (learning theory); Magnet; Discrete mathematics; Physics; Computer science; Quantum mechanics","score_opus":0.036486242238186715,"score_gpt":0.26930187030698366,"score_spread":0.23281562806879694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2602837592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053426687,0.00046740638,0.88571244,0.0010177676,0.0005565623,0.0004143401,0.00043019146,0.0011395027,0.05683515],"genre_scores_gemma":[0.43885052,0.0003892878,0.5330584,0.0003620257,0.0002427764,0.0005782572,0.00043756654,0.00045711704,0.025623975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990043,0.00021601137,0.00006322525,0.00027374525,0.00034676434,0.000095944],"domain_scores_gemma":[0.99826956,0.0007821858,0.00013146905,0.0003020786,0.00045311704,0.00006145252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008049771,0.00063134753,0.00039260107,0.002217129,0.0019041671,0.0010860959,0.0009146429,0.0006659812,0.010663804],"category_scores_gemma":[0.0041930196,0.00028317352,0.0006530306,0.0010618212,0.0024061883,0.0017815517,0.0011359336,0.0014049801,0.0027630106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045374033,0.00013584549,0.0017346402,0.00031680893,0.0000388917,0.000242059,0.0005888287,0.0078533245,0.058400378,0.6663166,0.009223369,0.2546955],"study_design_scores_gemma":[0.00008826265,0.00038760863,0.0024709625,0.00010572061,0.00006837785,0.00079357903,0.0003312731,0.04995265,0.10306309,0.7635387,0.07905259,0.00014717955],"about_ca_topic_score_codex":0.000958075,"about_ca_topic_score_gemma":0.001131296,"teacher_disagreement_score":0.010663804,"about_ca_system_score_codex":0.00082997186,"about_ca_system_score_gemma":0.00117201,"threshold_uncertainty_score":0.035673976},"labels":[],"label_agreement":null},{"id":"W2603607199","doi":"","title":"On a Conjecture About the Szeged Index","year":2009,"lang":"hu","type":"article","venue":"Les Cahiers du GERAD","topic":"Graph theory and applications","field":"Mathematics","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Bipartite graph; Edge-transitive graph; Graph; Discrete mathematics; Graph power; Line graph","score_opus":0.012033092598875505,"score_gpt":0.2524866901072873,"score_spread":0.2404535975084118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603607199","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63798785,0.0049666427,0.118255846,0.0400799,0.0020848538,0.000076466,0.0012403907,0.0006654255,0.19464263],"genre_scores_gemma":[0.9816404,0.0011441944,0.007942101,0.0017050414,0.0011155189,0.000051407565,0.00052222074,0.00008698144,0.0057920916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978569,0.00039239728,0.000119451164,0.0006238497,0.0005894408,0.00041792472],"domain_scores_gemma":[0.9889292,0.0069706775,0.0009408871,0.0016255737,0.0008846136,0.00064904086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028422826,0.00046104606,0.0013796687,0.0023339277,0.0024495078,0.004225939,0.0016962271,0.002300755,0.008715075],"category_scores_gemma":[0.014249266,0.0004452127,0.0011126613,0.0026908515,0.0074421037,0.009774498,0.003127055,0.0040951287,0.0014400334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015675701,0.000033644606,0.0015267713,0.00004770371,0.000014205242,0.00007656254,0.00042698678,0.0013321049,0.00057673984,0.98062474,0.0065523395,0.0086314315],"study_design_scores_gemma":[0.000033584394,0.000026731774,0.0008870382,0.000022635182,0.0000130975895,0.00010697637,0.00016785727,0.003569094,0.0006399481,0.9890698,0.0054413155,0.000021809432],"about_ca_topic_score_codex":0.0013365077,"about_ca_topic_score_gemma":0.0007119224,"teacher_disagreement_score":0.008715075,"about_ca_system_score_codex":0.0019172272,"about_ca_system_score_gemma":0.0007580799,"threshold_uncertainty_score":0.029154778},"labels":[],"label_agreement":null},{"id":"W2605639564","doi":"10.48550/arxiv.1704.04701","title":"Rooted Graph Minors and Reducibility of Graph Polynomials","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph theory and applications","field":"Mathematics","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":"Combinatorics; Mathematics; Feynman diagram; Vertex (graph theory); Feynman integral; Minor (academic); Robertson–Seymour theorem; Mathematical proof; Discrete mathematics; 1-planar graph; Graph; Chordal graph; Mathematical physics","score_opus":0.14929892867007064,"score_gpt":0.24738653454323625,"score_spread":0.09808760587316562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605639564","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.8794224,0.00019728251,0.090438284,0.0006593664,0.00005601859,0.00008715539,0.0003890785,0.00046607363,0.028284341],"genre_scores_gemma":[0.9734321,0.00013277124,0.018861286,0.00012240186,0.000050433024,0.000049944483,0.0005654758,0.00014314351,0.006642409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933165,0.00009533887,0.000030077568,0.00023386053,0.00016135645,0.00014774177],"domain_scores_gemma":[0.9976736,0.00093314133,0.000361876,0.00052875566,0.00025585684,0.00024683023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044976475,0.00039836287,0.00049192767,0.0011413172,0.0014240261,0.001401385,0.0008940652,0.0005088768,0.005156178],"category_scores_gemma":[0.0035855134,0.00037622845,0.0013398234,0.00053837546,0.0027710882,0.0023088413,0.0015354932,0.001988373,0.0005336224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012287244,0.000076389995,0.002026139,0.00008258074,0.000021999434,0.00038468323,0.0013454971,0.005270786,0.008467529,0.96903664,0.0014083781,0.011756605],"study_design_scores_gemma":[0.000026593663,0.00004444156,0.0009556105,0.000013930408,0.000018714281,0.00029087244,0.0002424624,0.012746881,0.004530446,0.97718185,0.0039272634,0.000020879976],"about_ca_topic_score_codex":0.0015789917,"about_ca_topic_score_gemma":0.0012676844,"teacher_disagreement_score":0.005156178,"about_ca_system_score_codex":0.0010614116,"about_ca_system_score_gemma":0.000438997,"threshold_uncertainty_score":0.017249167},"labels":[],"label_agreement":null},{"id":"W2608610082","doi":"10.1090/amsip/038/09","title":"Mirror symmetry for zeta functions with appendix","year":2006,"lang":"en","type":"book-chapter","venue":"AMS/IP studies in advanced mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"University of Alberta; Queen's University","funders":"","keywords":"Appendix; Symmetry (geometry); Theoretical physics; Physics; Mathematical physics; Mirror symmetry; Classical mechanics; Calculus (dental); Mathematics; Geometry; Geology; Quantum mechanics; Orthodontics; Medicine; Paleontology","score_opus":0.09302027656180845,"score_gpt":0.36052735416916115,"score_spread":0.2675070776073527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608610082","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.014887405,0.005698852,0.086127535,0.004793224,0.012472462,0.00021111315,0.0019156968,0.001265188,0.87262857],"genre_scores_gemma":[0.16978303,0.00747888,0.049067695,0.0017010899,0.0062860097,0.0005285756,0.0028739215,0.0018446463,0.7604362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977523,0.000051897976,0.000013973679,0.00003398583,0.00010205688,0.0000229611],"domain_scores_gemma":[0.99964225,0.000121000536,0.000025229587,0.000060403152,0.000119879965,0.000031184907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004932981,0.0010595254,0.00081106566,0.0018989957,0.0007910105,0.0012149648,0.0009909996,0.00074210286,0.06368105],"category_scores_gemma":[0.0016510417,0.00026225156,0.0006247069,0.0016355516,0.00079338014,0.0023475105,0.0008348738,0.0013594481,0.019465793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024123483,0.000054874192,0.000080109574,0.0002253574,0.000007214036,0.00010944867,0.00012254842,0.0004546557,0.0008734973,0.8348602,0.11572585,0.047462124],"study_design_scores_gemma":[0.000017883916,0.000024126773,0.0003607987,0.000048163736,0.000008260615,0.00024225976,0.000042659394,0.0012475984,0.00080410275,0.79118776,0.20599523,0.000021120106],"about_ca_topic_score_codex":0.0005884049,"about_ca_topic_score_gemma":0.0006332884,"teacher_disagreement_score":0.06368105,"about_ca_system_score_codex":0.0008570203,"about_ca_system_score_gemma":0.0006783104,"threshold_uncertainty_score":0.21303433},"labels":[],"label_agreement":null},{"id":"W2609450321","doi":"10.71781/10203","title":"Problèmes de tournées multicritères dans des graphes","year":2007,"lang":"fr","type":"dissertation","venue":"Papyrus : Institutional Repository (Université de Montréal)","topic":"Graph theory and applications","field":"Mathematics","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":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Humanities; Philosophy","score_opus":0.010553691046464675,"score_gpt":0.2180536770434727,"score_spread":0.20749998599700803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2609450321","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6668963,0.0038254645,0.25890976,0.011763994,0.0008158855,0.00077671907,0.0046864985,0.0007232399,0.05160219],"genre_scores_gemma":[0.833563,0.0018739771,0.11136043,0.0009237674,0.0014320763,0.00055890286,0.0047598463,0.00045882788,0.04506911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99637336,0.0012620232,0.00017611778,0.0010589574,0.0006175165,0.0005119348],"domain_scores_gemma":[0.962984,0.03178408,0.0016035181,0.00068766373,0.0010108402,0.001929906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036615334,0.0021658042,0.0044408934,0.0036189435,0.004625883,0.008705683,0.0040569305,0.0086664185,0.023382315],"category_scores_gemma":[0.03347862,0.001706148,0.0030068478,0.004323493,0.00276087,0.0062183505,0.0027543227,0.0058592637,0.000997502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024341044,0.0011452719,0.010591191,0.0021778778,0.0007918441,0.002299021,0.0017246366,0.37803847,0.0053645703,0.48059693,0.036140032,0.078696124],"study_design_scores_gemma":[0.0006415786,0.0004547658,0.0042314515,0.0002150218,0.00023814915,0.001302927,0.0014029263,0.73720884,0.0027127091,0.2416784,0.009801129,0.00011206047],"about_ca_topic_score_codex":0.01805895,"about_ca_topic_score_gemma":0.016702149,"teacher_disagreement_score":0.023382315,"about_ca_system_score_codex":0.0039862175,"about_ca_system_score_gemma":0.0014833629,"threshold_uncertainty_score":0.07822162},"labels":[],"label_agreement":null},{"id":"W2610879934","doi":"10.1139/cjc-2017-0206","title":"On molecular topological properties of diamond-like networks","year":2017,"lang":"en","type":"article","venue":"Canadian Journal of Chemistry","topic":"Graph theory and applications","field":"Mathematics","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":"Higher Education Commision, Pakistan; United Arab Emirates University","keywords":"Topological index; Diamond; Chemistry; Combinatorics; Molecular graph; Vertex (graph theory); Graph; Topology (electrical circuits); Mathematics; Computational chemistry","score_opus":0.033148307828970436,"score_gpt":0.2567104309246539,"score_spread":0.22356212309568346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610879934","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81256783,0.0024987312,0.1173392,0.0007622604,0.00011312801,0.000038228744,0.0005619133,0.00018709412,0.06593165],"genre_scores_gemma":[0.98668265,0.000911914,0.009716639,0.000059730824,0.00007333143,0.000028124468,0.00027567623,0.000032815362,0.0022191973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99991524,0.000022724322,0.000003276935,0.00001575155,0.000029060804,0.00001396386],"domain_scores_gemma":[0.9989748,0.0005730288,0.00015776082,0.000054075925,0.00014590519,0.00009441862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024770384,0.00021228372,0.00021492665,0.0018182573,0.00030774745,0.0009124702,0.00038654974,0.00030423654,0.002448775],"category_scores_gemma":[0.0022418674,0.00010642959,0.0001298695,0.0008510752,0.00075575267,0.0015603022,0.00037641532,0.0004247965,0.00017801108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054997297,0.000043817065,0.0018819176,0.00012795476,0.000011366144,0.00019078008,0.0001647767,0.077085294,0.0056198845,0.8930759,0.0021795323,0.0195638],"study_design_scores_gemma":[0.000010604159,0.00006181809,0.0024844317,0.00005323197,0.000010298115,0.00028098357,0.0001864105,0.37587824,0.0013726519,0.61559784,0.0040371404,0.00002637255],"about_ca_topic_score_codex":0.0007019158,"about_ca_topic_score_gemma":0.0009187217,"teacher_disagreement_score":0.002448775,"about_ca_system_score_codex":0.000544658,"about_ca_system_score_gemma":0.00019479771,"threshold_uncertainty_score":0.008191943},"labels":[],"label_agreement":null},{"id":"W2611693583","doi":"","title":"Energy ordering of unicyclic graphs","year":2006,"lang":"en","type":"article","venue":"HKBU Institutional Repository (Hong Kong Baptist University)","topic":"Graph theory and applications","field":"Mathematics","cited_by":28,"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":"Computer science; Combinatorics; Mathematics","score_opus":0.013147704357354222,"score_gpt":0.20598878251407637,"score_spread":0.19284107815672216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611693583","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.782459,0.001016133,0.04970626,0.0014509553,0.0001998925,0.000108368964,0.0027050935,0.00037366565,0.16198057],"genre_scores_gemma":[0.94865555,0.00056872494,0.008619933,0.00023950209,0.00009969889,0.00007075875,0.0019747978,0.0001402847,0.039630733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956185,0.00009430612,0.000028779936,0.00006083202,0.00011929691,0.00013494551],"domain_scores_gemma":[0.99754155,0.0008740193,0.0003469183,0.00026537702,0.0005465057,0.00042563793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028446803,0.0003515197,0.0005251499,0.002746018,0.0013491997,0.0021702987,0.0008091465,0.00069865235,0.013558208],"category_scores_gemma":[0.0019754844,0.0003370733,0.00028243716,0.0022980266,0.0009170473,0.001621722,0.00078286824,0.00092228915,0.0011407743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031246964,0.000074780524,0.001736892,0.00023330383,0.000015545393,0.00034430777,0.0004593889,0.006242391,0.006369115,0.9497986,0.008666854,0.025746396],"study_design_scores_gemma":[0.000034040637,0.000046238427,0.002358865,0.000041300525,0.000015786343,0.0003271688,0.00038368008,0.018285034,0.0022671984,0.96845686,0.0077587445,0.000024941572],"about_ca_topic_score_codex":0.0018789887,"about_ca_topic_score_gemma":0.004081647,"teacher_disagreement_score":0.013558208,"about_ca_system_score_codex":0.0011928879,"about_ca_system_score_gemma":0.00060188957,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2612538177","doi":"","title":"On the signless Laplacian spectral radius of tricyclic graphs with n vertices and diameter d.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Spectral radius; Tricyclic; RADIUS; Physics; Chemistry; Stereochemistry; Computer science; Computer network; Quantum mechanics","score_opus":0.02715207151651852,"score_gpt":0.2767585404666356,"score_spread":0.2496064689501171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612538177","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7606628,0.013198905,0.09562863,0.007013185,0.00079217786,0.00008426724,0.0011994216,0.0006524866,0.12076825],"genre_scores_gemma":[0.98548996,0.0023961759,0.0067382525,0.00040469633,0.0004891216,0.00006809356,0.00028269686,0.00012812944,0.0040029385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914455,0.00039150816,0.000034803972,0.00014129338,0.00015195763,0.00013585732],"domain_scores_gemma":[0.9908789,0.0061884397,0.001075181,0.0003981808,0.0005176921,0.0009416274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012414319,0.00070414454,0.0009096941,0.003421865,0.0008561421,0.0018349967,0.0018008642,0.0012778918,0.0045573986],"category_scores_gemma":[0.014532949,0.00044369887,0.00028830228,0.0015424569,0.0027979119,0.00303526,0.0020437068,0.0013283981,0.001150048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005682544,0.00012085146,0.003573274,0.0004951872,0.000068741836,0.00036948078,0.0006733774,0.038928747,0.007858777,0.88650286,0.028788416,0.032051988],"study_design_scores_gemma":[0.00009466768,0.000115792536,0.0034932254,0.00016966467,0.000054990465,0.0006595901,0.00064082,0.14419197,0.0021885443,0.8409904,0.00731009,0.000090268804],"about_ca_topic_score_codex":0.0011430853,"about_ca_topic_score_gemma":0.000848683,"teacher_disagreement_score":0.0045573986,"about_ca_system_score_codex":0.001297581,"about_ca_system_score_gemma":0.00040141444,"threshold_uncertainty_score":0.015246034},"labels":[],"label_agreement":null},{"id":"W2612569969","doi":"","title":"On the Laplacian Estrada index of graphs with given chromatic number.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Chromatic scale; Combinatorics; Laplace operator; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.022238575197236626,"score_gpt":0.281020372039026,"score_spread":0.25878179684178937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612569969","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73812413,0.0029563562,0.07926695,0.0031321782,0.0005902948,0.000041293642,0.0009870382,0.00045636724,0.1744453],"genre_scores_gemma":[0.97867775,0.00088490173,0.0077869534,0.00022624368,0.0003318296,0.000041380263,0.00038406643,0.00012262075,0.011544289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965703,0.00009831745,0.000011246793,0.00007506101,0.00008439385,0.00007405073],"domain_scores_gemma":[0.99747366,0.0014200346,0.00032547116,0.00014479613,0.00025721683,0.000378818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006168522,0.00049687165,0.00061697833,0.003737561,0.0009952427,0.001847886,0.0011695949,0.0008216125,0.007453013],"category_scores_gemma":[0.00479801,0.00020902912,0.0002738172,0.0017064989,0.0016961463,0.0028163267,0.001256615,0.0013193998,0.00095623743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020685705,0.000067006506,0.0031624145,0.00011612319,0.000024400264,0.00014661746,0.00039036403,0.01079195,0.003994424,0.95331603,0.0102802655,0.017503489],"study_design_scores_gemma":[0.00003123513,0.000039401697,0.0027686148,0.00006191277,0.000026241032,0.0002945339,0.0003808329,0.06193715,0.0014013221,0.92727673,0.0057455897,0.000036422476],"about_ca_topic_score_codex":0.001722481,"about_ca_topic_score_gemma":0.0022387283,"teacher_disagreement_score":0.007453013,"about_ca_system_score_codex":0.0015238705,"about_ca_system_score_gemma":0.00038515343,"threshold_uncertainty_score":0.024932861},"labels":[],"label_agreement":null},{"id":"W2613146741","doi":"","title":"Laplacian and signless Laplacian characteristic polynomial of generalized subdivision corona vertex graph.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Subdivision; Vertex (graph theory); Graph; Laplace operator; Discrete mathematics; Mathematical analysis; Geography","score_opus":0.030175763734057587,"score_gpt":0.2993318505597598,"score_spread":0.26915608682570225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613146741","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8229417,0.00073885336,0.0749138,0.0021230704,0.0003274786,0.000035347184,0.0005526135,0.00026149684,0.09810553],"genre_scores_gemma":[0.98353094,0.00024625173,0.003180845,0.00012668398,0.00012295927,0.000014065812,0.00020316454,0.000044389246,0.012530835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998448,0.000026744663,0.0000030374465,0.000033115764,0.00004779178,0.000044558947],"domain_scores_gemma":[0.9994399,0.00015845474,0.0000952992,0.000059102345,0.00011961053,0.0001275968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016468625,0.00022763685,0.00030296214,0.0011834792,0.0005311422,0.00093286217,0.00064617867,0.00048304815,0.007724434],"category_scores_gemma":[0.0016731523,0.000121120174,0.0002726712,0.0006615414,0.0009517777,0.0015894013,0.00061749574,0.00091522647,0.00068880164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008872659,0.000048459202,0.0017282187,0.0000642958,0.0000117714535,0.00023602706,0.00027781283,0.0045084143,0.0049299276,0.9592353,0.008378862,0.020492215],"study_design_scores_gemma":[0.000027314014,0.000036590573,0.0028800913,0.000018521816,0.000014087376,0.00050467195,0.00026123598,0.05107301,0.0014855317,0.93626434,0.007409109,0.000025499723],"about_ca_topic_score_codex":0.0015433817,"about_ca_topic_score_gemma":0.0017810456,"teacher_disagreement_score":0.007724434,"about_ca_system_score_codex":0.0007945142,"about_ca_system_score_gemma":0.0003762711,"threshold_uncertainty_score":0.025840819},"labels":[],"label_agreement":null},{"id":"W2613172277","doi":"","title":"The (distance) signless Laplacian spectral radii of digraphs with given dichromatic number.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.016350410814244598,"score_gpt":0.2814519750782307,"score_spread":0.2651015642639861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613172277","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7244739,0.0008723721,0.1544448,0.0013765158,0.00020569799,0.000068893234,0.0010217087,0.00058466586,0.11695139],"genre_scores_gemma":[0.96909744,0.00037781984,0.017960684,0.0002199684,0.00008971681,0.000072101444,0.00034173322,0.0001085178,0.011731923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940753,0.0001862584,0.000034093715,0.00013538935,0.00014092222,0.000095812706],"domain_scores_gemma":[0.99714726,0.001159357,0.00048453998,0.0002875956,0.00040191275,0.0005194014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059059926,0.0005133318,0.00045660068,0.0021430391,0.0010653554,0.002751538,0.0011227834,0.0009448387,0.007976244],"category_scores_gemma":[0.0060089477,0.00033401768,0.00028123177,0.000928257,0.0016754575,0.0030704117,0.0013656197,0.00080680253,0.0015474675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001620098,0.00004054059,0.0011894794,0.00011171573,0.000018380146,0.000115109935,0.00031066555,0.0038645314,0.0069124047,0.96896166,0.0035708211,0.014742554],"study_design_scores_gemma":[0.00004329696,0.000055438846,0.0017349079,0.000055976274,0.00002960127,0.00074791466,0.00049555715,0.03246114,0.0051236926,0.9507913,0.008419592,0.00004157317],"about_ca_topic_score_codex":0.0005192242,"about_ca_topic_score_gemma":0.0006255461,"teacher_disagreement_score":0.007976244,"about_ca_system_score_codex":0.0010775949,"about_ca_system_score_gemma":0.00039166582,"threshold_uncertainty_score":0.026683152},"labels":[],"label_agreement":null},{"id":"W2613198330","doi":"10.1016/j.laa.2017.05.016","title":"The distance spectrum of complements of trees","year":2017,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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":"McGill University","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Mathematics; Spectral radius; Distance matrix; Combinatorics; Distance matrices in phylogeny; Eigenvalues and eigenvectors; Spectrum (functional analysis); Graph; Minimum distance; Order (exchange); Connectivity; Discrete mathematics","score_opus":0.04095037157535835,"score_gpt":0.3363329604987585,"score_spread":0.29538258892340014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613198330","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7013544,0.0029942803,0.19658253,0.002676197,0.00032127535,0.000035124995,0.00049284945,0.00018273084,0.095360614],"genre_scores_gemma":[0.9693942,0.0013184518,0.017790895,0.00036099885,0.0005032396,0.000055837114,0.00032421606,0.00009454238,0.010157704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988691,0.00032192847,0.000049967144,0.00023928143,0.00036230203,0.00015733276],"domain_scores_gemma":[0.99587494,0.0022637793,0.00048026643,0.00020041048,0.0004953934,0.00068522897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010820673,0.0006138664,0.0011780816,0.0046167364,0.002121631,0.0047527137,0.0015110393,0.0014585672,0.0064133187],"category_scores_gemma":[0.0050464077,0.0006102898,0.00071187963,0.0033193424,0.0045718304,0.0063834796,0.002847431,0.0022499217,0.00057974766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019514373,0.000009751638,0.00011643327,0.000017161106,0.000003680045,0.000019340254,0.00014048164,0.000539099,0.00031905744,0.9960968,0.00033262454,0.0023860696],"study_design_scores_gemma":[0.0000067053365,0.0000070541982,0.00014458981,0.00001120112,0.000003941634,0.00005207686,0.00010358489,0.004802091,0.00015953371,0.993634,0.0010673908,0.000007714889],"about_ca_topic_score_codex":0.0019247908,"about_ca_topic_score_gemma":0.0012933803,"teacher_disagreement_score":0.0064133187,"about_ca_system_score_codex":0.0017518022,"about_ca_system_score_gemma":0.00080518465,"threshold_uncertainty_score":0.021454632},"labels":[],"label_agreement":null},{"id":"W2613284777","doi":"","title":"The minimum matching energy of tricyclic graphs and given girth and without K 4 -subdivision.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subdivision; Mathematics; Girth (graph theory); Combinatorics; Tricyclic; Matching (statistics); Discrete mathematics; Statistics; Chemistry; Geography; Stereochemistry","score_opus":0.019603087367869424,"score_gpt":0.28533731674830326,"score_spread":0.26573422938043384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613284777","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90985465,0.0012832527,0.023733763,0.0013681308,0.00014421306,0.000026082811,0.0010245688,0.00016399557,0.06240131],"genre_scores_gemma":[0.98585016,0.00032267487,0.0050874553,0.000110770125,0.000053179014,0.000025203517,0.00042176928,0.00007978054,0.008048997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976367,0.000055064524,0.000010334898,0.000052685242,0.000052546446,0.000065637476],"domain_scores_gemma":[0.9989874,0.0005076857,0.00018229926,0.00010953829,0.00008558524,0.00012744722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030469405,0.00037059764,0.0005336544,0.0011483058,0.0006466148,0.0015262397,0.0012493148,0.0013808432,0.010491338],"category_scores_gemma":[0.0032888332,0.00029889194,0.00033332294,0.0010396661,0.0010486236,0.0018487769,0.0011553031,0.0007869791,0.0010147856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005725066,0.00010418476,0.004281798,0.00043654823,0.00007900284,0.0003983803,0.00040054723,0.048212856,0.009965776,0.88048375,0.013516833,0.041547872],"study_design_scores_gemma":[0.0000482427,0.000058370224,0.004318981,0.00008060269,0.0000445332,0.0005265478,0.00047310413,0.08699839,0.003190835,0.8989747,0.005256074,0.000029580924],"about_ca_topic_score_codex":0.0006305129,"about_ca_topic_score_gemma":0.00094953366,"teacher_disagreement_score":0.010491338,"about_ca_system_score_codex":0.00063025695,"about_ca_system_score_gemma":0.00028899274,"threshold_uncertainty_score":0.035097063},"labels":[],"label_agreement":null},{"id":"W2613355329","doi":"","title":"Some Posets Of Unicyclic Graphs Based On Signless Laplacian Coefficients.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.030004486733901027,"score_gpt":0.30609367687779043,"score_spread":0.2760891901438894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613355329","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55740637,0.0018763646,0.08456575,0.0034650865,0.0010529145,0.00023420081,0.0016785995,0.0006623679,0.34905833],"genre_scores_gemma":[0.9471476,0.0009787338,0.010606081,0.0005054414,0.0004999918,0.0001588909,0.0009528724,0.0001579164,0.038992517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993925,0.00016501237,0.000033868433,0.00011553904,0.00014612303,0.00014693856],"domain_scores_gemma":[0.99839455,0.0006627431,0.0003145219,0.000111671,0.00017126618,0.00034515417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040963327,0.00088539266,0.00056233,0.0024068854,0.0020272087,0.003466091,0.00094788685,0.0009635927,0.019798618],"category_scores_gemma":[0.0024620725,0.000579192,0.00072432787,0.0015681164,0.0022990394,0.0030214435,0.0023190624,0.00222477,0.002118515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049172286,0.000033839962,0.00022927715,0.000059721886,0.0000081784065,0.00031544676,0.00036562272,0.0010718768,0.001090566,0.98770046,0.00399941,0.0050765756],"study_design_scores_gemma":[0.000030912975,0.000030264106,0.0002986049,0.00003255844,0.000014212395,0.00043066242,0.00034396935,0.00441463,0.00077507924,0.98739815,0.0062092175,0.000021640584],"about_ca_topic_score_codex":0.00071941817,"about_ca_topic_score_gemma":0.0010592605,"teacher_disagreement_score":0.019798618,"about_ca_system_score_codex":0.00084257656,"about_ca_system_score_gemma":0.0004871264,"threshold_uncertainty_score":0.06623292},"labels":[],"label_agreement":null},{"id":"W2613851664","doi":"","title":"On 3-term arithmetic progressions in product sets over finite rings via spectra of graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Term (time); Product (mathematics); Arithmetic; Discrete mathematics; Pure mathematics; Combinatorics; Geometry","score_opus":0.02603744304832309,"score_gpt":0.3188185857684699,"score_spread":0.29278114272014677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613851664","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41619834,0.00478789,0.29146877,0.0036189375,0.0012376589,0.00016065272,0.0007172067,0.00084568874,0.28096485],"genre_scores_gemma":[0.929303,0.0020133755,0.03629678,0.0007590943,0.0007772873,0.00013573136,0.00035505666,0.00030242593,0.030057298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990664,0.00028945407,0.000052243464,0.0001754038,0.00021593396,0.0002005422],"domain_scores_gemma":[0.99835,0.0007912475,0.00024213546,0.00016332707,0.00018355319,0.00026965883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011163955,0.00090132345,0.00078683207,0.0031039182,0.0026752467,0.00411219,0.0013028341,0.0014411344,0.010967592],"category_scores_gemma":[0.003368943,0.0007097749,0.0013502314,0.0019526269,0.004382553,0.01064817,0.003903978,0.0031963321,0.0020036001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002544013,0.00001989364,0.0001183993,0.000032568474,0.000005189457,0.00010873399,0.0003407132,0.0008114361,0.00041705556,0.99400324,0.00079061586,0.0033266305],"study_design_scores_gemma":[0.0000085111415,0.000013459293,0.00013680253,0.000026253312,0.000007380136,0.000103959996,0.00014111388,0.0022748967,0.00021519823,0.9947901,0.0022695186,0.000012862939],"about_ca_topic_score_codex":0.0012486184,"about_ca_topic_score_gemma":0.0014200285,"teacher_disagreement_score":0.010967592,"about_ca_system_score_codex":0.0015841209,"about_ca_system_score_gemma":0.0006225837,"threshold_uncertainty_score":0.036690235},"labels":[],"label_agreement":null},{"id":"W2614091911","doi":"","title":"The majorization theorem and signless Dirichlet spectral radius of connected graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Majorization; Spectral radius; Combinatorics; Dirichlet distribution; Eigenvalues and eigenvectors; Physics; Mathematical analysis","score_opus":0.019707779136475794,"score_gpt":0.27927326883956,"score_spread":0.2595654897030842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614091911","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45096266,0.004150506,0.24675705,0.007671256,0.0009610644,0.00006862548,0.000641365,0.00076038786,0.2880272],"genre_scores_gemma":[0.9705903,0.00091845787,0.011757377,0.0005299707,0.0006497642,0.000076353776,0.00021746293,0.00018299856,0.015077353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915075,0.00028336557,0.000027983133,0.00016811318,0.00023543798,0.00013431314],"domain_scores_gemma":[0.99645376,0.001743337,0.0004085506,0.000405138,0.00042233904,0.00056700106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092290406,0.00063084444,0.0008700561,0.0024820475,0.0012296495,0.0025670521,0.0014062894,0.0013060083,0.0077805878],"category_scores_gemma":[0.008669041,0.00042187222,0.00053865544,0.0011189635,0.0037165761,0.0044012386,0.0023962075,0.0022273085,0.0016162536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023763207,0.000009050274,0.00012981555,0.000027724042,0.000005047888,0.000026254153,0.000069421076,0.0005981632,0.00071843143,0.9931924,0.0019416166,0.003258341],"study_design_scores_gemma":[0.0000096297335,0.0000065256168,0.00023548411,0.000008595826,0.000004096819,0.000087708875,0.000035492685,0.0043763546,0.00037802564,0.99336785,0.0014832597,0.000006967861],"about_ca_topic_score_codex":0.0004795744,"about_ca_topic_score_gemma":0.0004042373,"teacher_disagreement_score":0.0077805878,"about_ca_system_score_codex":0.0009698777,"about_ca_system_score_gemma":0.00038501612,"threshold_uncertainty_score":0.026028633},"labels":[],"label_agreement":null},{"id":"W2615293252","doi":"10.71781/15111","title":"Les graphes asymétriques minimaux de longueur induite 3","year":2006,"lang":"fr","type":"dissertation","venue":"Open MIND","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Humanities; Philosophy","score_opus":0.07333397319793075,"score_gpt":0.37996055508056564,"score_spread":0.3066265818826349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2615293252","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.5090331,0.0048731836,0.303313,0.005392682,0.0006385748,0.00008176423,0.0019935453,0.0010439784,0.17363016],"genre_scores_gemma":[0.8476251,0.0035247903,0.059616283,0.00071750523,0.000609387,0.00019303475,0.0014215551,0.0006678528,0.08562458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911994,0.0001795211,0.000026003463,0.00027471222,0.00022213123,0.00017775853],"domain_scores_gemma":[0.9953294,0.002481434,0.0004893742,0.0003479667,0.00096349476,0.0003884771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010202024,0.0010721157,0.0012834027,0.0035347708,0.003378298,0.004911235,0.0014529112,0.0019842754,0.014182842],"category_scores_gemma":[0.0068266992,0.00086457527,0.0012083247,0.0023943365,0.0036458294,0.003519782,0.0011821908,0.004383697,0.0015305826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110299356,0.000026138325,0.0012943804,0.00013724163,0.000035645313,0.00022564117,0.0004302991,0.0056014825,0.0030607071,0.96629,0.0050039915,0.0177842],"study_design_scores_gemma":[0.00006367737,0.00005907972,0.0085966475,0.00009302436,0.000060683542,0.0007659434,0.0005533832,0.042115573,0.0033125093,0.9172552,0.027050357,0.000073904455],"about_ca_topic_score_codex":0.028636696,"about_ca_topic_score_gemma":0.031528227,"teacher_disagreement_score":0.028636696,"about_ca_system_score_codex":0.00461296,"about_ca_system_score_gemma":0.0015706209,"threshold_uncertainty_score":0.05694002},"labels":[],"label_agreement":null},{"id":"W2616177501","doi":"10.1002/1097-0118(200008)34:4<277::aid-jgt4>3.0.co;2-#","title":"A characterization of (γ, <i>i</i> )‐trees","year":2000,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Graph theory and applications","field":"Mathematics","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":"University of Victoria","funders":"","keywords":"Characterization (materials science); Mathematics; Combinatorics; Discrete mathematics; Physics","score_opus":0.016701907636086952,"score_gpt":0.2648895667963944,"score_spread":0.24818765916030747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2616177501","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.727538,0.0011116753,0.21614186,0.0008818106,0.00006252449,0.00009985926,0.0020806524,0.00028540162,0.05179828],"genre_scores_gemma":[0.9607301,0.0004766981,0.031851154,0.00021779294,0.00010323693,0.00009714171,0.0016432585,0.000095638214,0.0047851433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931586,0.00008769815,0.000048501315,0.00024519302,0.00014839563,0.0001543082],"domain_scores_gemma":[0.9966787,0.0014047092,0.00077157066,0.00025638708,0.00043695845,0.0004516716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005661937,0.00037462972,0.00038742903,0.0017606885,0.000994161,0.0037228225,0.0008617164,0.0006805472,0.0027784084],"category_scores_gemma":[0.004189849,0.0003043323,0.00031380937,0.0022347048,0.0013570937,0.0030559986,0.0009926955,0.00076703617,0.00052880234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045944806,0.00013834082,0.01801765,0.00029530615,0.000072412,0.0006588232,0.0021383413,0.018824654,0.05017917,0.8198098,0.010335309,0.07907078],"study_design_scores_gemma":[0.000055008997,0.00016392625,0.013012798,0.00011399543,0.00008181697,0.0035725334,0.0013953627,0.0704379,0.016046494,0.8515251,0.043533076,0.000061962994],"about_ca_topic_score_codex":0.0008695123,"about_ca_topic_score_gemma":0.00085530506,"teacher_disagreement_score":0.0037228225,"about_ca_system_score_codex":0.0009809784,"about_ca_system_score_gemma":0.0004051018,"threshold_uncertainty_score":0.009294689},"labels":[],"label_agreement":null},{"id":"W2624667578","doi":"","title":"A Constructive Enumeration of Fusenes and Benzenoids","year":2001,"lang":"fr","type":"article","venue":"","topic":"Graph theory and applications","field":"Mathematics","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":"Enumeration; Dual polyhedron; Construct (python library); Constructive; Path (computing); Mathematics; Homomorphism; Combinatorics; Computer science; Algebra over a field; Discrete mathematics; Pure mathematics; Programming language; Process (computing)","score_opus":0.02389675104247154,"score_gpt":0.2839598094534426,"score_spread":0.2600630584109711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2624667578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04845101,0.00068347267,0.9248758,0.00018960645,0.00015025404,0.00012253837,0.00045802307,0.0010615757,0.024007656],"genre_scores_gemma":[0.16499028,0.00068024144,0.8157494,0.00012796848,0.000048180867,0.0001945951,0.0011829298,0.00037452942,0.01665184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999146,0.00017750516,0.000046652767,0.00015957566,0.0003546139,0.000115608855],"domain_scores_gemma":[0.9991365,0.00038678775,0.00005336482,0.000148338,0.00022387972,0.00005110745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047474293,0.0008213162,0.0007444648,0.0021806008,0.0014674363,0.0013018338,0.0009774808,0.0008686525,0.009788043],"category_scores_gemma":[0.0017771645,0.0005630149,0.0009896208,0.0012522449,0.0011953095,0.0033211554,0.001993367,0.00114119,0.0026344252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013517549,0.00007549351,0.0014140356,0.0004933954,0.00003964224,0.00031120444,0.00050320063,0.015467769,0.03216433,0.62501043,0.0060959444,0.3182893],"study_design_scores_gemma":[0.00005362542,0.00020472422,0.0009956597,0.00025007917,0.00008515882,0.0010365152,0.0005052709,0.06828571,0.09198588,0.71996,0.1165056,0.00013182739],"about_ca_topic_score_codex":0.00072420365,"about_ca_topic_score_gemma":0.002101636,"teacher_disagreement_score":0.009788043,"about_ca_system_score_codex":0.0006595907,"about_ca_system_score_gemma":0.00085884373,"threshold_uncertainty_score":0.03274423},"labels":[],"label_agreement":null},{"id":"W267502919","doi":"10.13001/1081-3810.1676","title":"Refined inertias of tree sign-patterns","year":2013,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Graph theory and applications","field":"Mathematics","cited_by":13,"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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Digraph; Sign (mathematics); Combinatorics; Diagonal; Eigenvalues and eigenvectors; Star (game theory); Zero (linguistics); Tree (set theory); Order (exchange); Path (computing); Diagonal matrix; Discrete mathematics; Mathematical analysis; Geometry; Physics; Computer science","score_opus":0.01815009844258741,"score_gpt":0.2780404169671313,"score_spread":0.25989031852454386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W267502919","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8461228,0.00015816458,0.12827234,0.00010229379,0.00006580523,0.000065453154,0.00029457564,0.00031428816,0.02460425],"genre_scores_gemma":[0.97066295,0.000107070446,0.022782663,0.000058613285,0.000051123654,0.0000757847,0.00035778314,0.00010164409,0.005802364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945194,0.00006785407,0.000054767002,0.000099871424,0.00014901448,0.00017650299],"domain_scores_gemma":[0.99758255,0.0005178858,0.0005350715,0.00043255585,0.00041237942,0.0005195642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036783877,0.0003242123,0.00041639185,0.0013221275,0.00058419147,0.0011419964,0.00047675532,0.00049232756,0.005951543],"category_scores_gemma":[0.003002528,0.00032746408,0.00054541306,0.0006038791,0.001296279,0.001464559,0.0011005008,0.0006593032,0.00074795913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005316209,0.00013449651,0.009908198,0.00020384682,0.00004126993,0.0015827226,0.0010667352,0.026318252,0.10563469,0.8017182,0.003266293,0.04959374],"study_design_scores_gemma":[0.00013629794,0.00048037537,0.01502162,0.000071082366,0.000054658303,0.0015960159,0.0005571283,0.18649364,0.027566375,0.7546776,0.013203423,0.00014177624],"about_ca_topic_score_codex":0.0006904934,"about_ca_topic_score_gemma":0.0010730297,"teacher_disagreement_score":0.005951543,"about_ca_system_score_codex":0.0003497277,"about_ca_system_score_gemma":0.00047846689,"threshold_uncertainty_score":0.019909918},"labels":[],"label_agreement":null},{"id":"W2727778573","doi":"10.1002/jgt.22434","title":"Maximizing the mean subtree order","year":2018,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"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; Western Canada Research Grid; Goddard Space Flight Center; Compute Canada","keywords":"Combinatorics; Lemma (botany); Order (exchange); Mathematics; Tree (set theory); Simple (philosophy); Path (computing); Vertex (graph theory); Discrete mathematics; Graph; Computer science; Botany; Biology","score_opus":0.05332421525870787,"score_gpt":0.31890734668321197,"score_spread":0.26558313142450407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2727778573","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7148369,0.0008351019,0.26389882,0.00054502033,0.000038813367,0.000028486056,0.0004212151,0.0003488424,0.019046882],"genre_scores_gemma":[0.95598733,0.00026451467,0.04119577,0.00008236591,0.00004514592,0.00003522398,0.00023353782,0.00013151683,0.0020246403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993273,0.00015775494,0.000031214528,0.00019855483,0.00014769632,0.00013752941],"domain_scores_gemma":[0.9953448,0.002722912,0.00047658678,0.0006622478,0.00044478773,0.00034858988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010559955,0.0002534341,0.00092774286,0.0009742341,0.0009262856,0.0015950568,0.00088377733,0.0009751195,0.0038440153],"category_scores_gemma":[0.009481811,0.00041775938,0.000452533,0.0008920757,0.0010441645,0.0028897363,0.0009559637,0.00078729336,0.00046892083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034706417,0.000118467826,0.013781594,0.00043086894,0.00008223011,0.0003790833,0.00076405937,0.08533734,0.033560324,0.8032013,0.0060723014,0.05592535],"study_design_scores_gemma":[0.000025226884,0.00012826611,0.007210712,0.00005890461,0.00005345856,0.00086867483,0.000309736,0.24257082,0.008482563,0.73366666,0.0065890746,0.0000359517],"about_ca_topic_score_codex":0.0005580056,"about_ca_topic_score_gemma":0.000951902,"teacher_disagreement_score":0.0038440153,"about_ca_system_score_codex":0.0012355626,"about_ca_system_score_gemma":0.00057353545,"threshold_uncertainty_score":0.012859523},"labels":[],"label_agreement":null},{"id":"W2737156094","doi":"","title":"Distance Spectra of Graphs: A Survey","year":2013,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Graph theory and applications","field":"Mathematics","cited_by":23,"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":"Distance matrix; Distance matrices in phylogeny; Eigenvalues and eigenvectors; Mathematics; Combinatorics; Matrix (chemical analysis); Graph; Characteristic polynomial; Connectivity; Adjacency matrix; Spectrum of a matrix; Discrete mathematics; Polynomial; Matrix differential equation; Mathematical analysis; Physics","score_opus":0.018417143726199722,"score_gpt":0.24256187666005355,"score_spread":0.22414473293385384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737156094","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.07001761,0.6895352,0.14569771,0.005455012,0.0012037713,0.000059596765,0.0005660575,0.0002784506,0.08718662],"genre_scores_gemma":[0.50789034,0.42870662,0.047876522,0.0014889032,0.004882903,0.00009250749,0.0007646272,0.00021093809,0.008086684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988236,0.00024632885,0.00007123912,0.0003781896,0.00038342638,0.000097321004],"domain_scores_gemma":[0.9972367,0.001827122,0.00017904626,0.00020299903,0.00040398634,0.0001501837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008654456,0.000833382,0.0010523144,0.0055946293,0.00087676325,0.002648034,0.0012742176,0.0012855326,0.0037657355],"category_scores_gemma":[0.0036811016,0.00066826626,0.00067154656,0.006561927,0.0020447487,0.0048564123,0.0018478639,0.0019671537,0.001138912],"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.00007305443,0.00014790398,0.0023091482,0.0025153763,0.00008854384,0.00028371738,0.00058578275,0.010614305,0.002101938,0.7113343,0.011061291,0.2588847],"study_design_scores_gemma":[0.000019732024,0.000102505204,0.0022502576,0.00060305704,0.00003654176,0.0017020479,0.00041274753,0.01990431,0.0013132367,0.8258314,0.14776763,0.000056520505],"about_ca_topic_score_codex":0.0010701403,"about_ca_topic_score_gemma":0.00041856163,"teacher_disagreement_score":0.0055946293,"about_ca_system_score_codex":0.0015296158,"about_ca_system_score_gemma":0.0006275893,"threshold_uncertainty_score":0.0125976205},"labels":[],"label_agreement":null},{"id":"W2737290634","doi":"","title":"A Sharp Upper Bound on Algebraic Connectivity Using Domination Number","year":2009,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Graph theory and applications","field":"Mathematics","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Domination analysis; Algebraic connectivity; Mathematics; Combinatorics; Dominating set; Vertex (graph theory); Upper and lower bounds; Connectivity; Algebraic number; Laplacian matrix; Discrete mathematics; Graph; Eigenvalues and eigenvectors","score_opus":0.027318605387957516,"score_gpt":0.30346227195819375,"score_spread":0.27614366657023626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737290634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30895758,0.01613662,0.5449132,0.007294226,0.00061951444,0.00017308137,0.0012033597,0.0010296798,0.1196728],"genre_scores_gemma":[0.95049715,0.005310534,0.03748847,0.00082537223,0.00076772756,0.00017632388,0.00041464405,0.00017688997,0.004342802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792814,0.0004617722,0.00007088418,0.00051196996,0.0005966181,0.0004305933],"domain_scores_gemma":[0.9793393,0.016491689,0.0012142356,0.0009193396,0.0009909353,0.0010444968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018651311,0.001794752,0.0015437528,0.00432826,0.0016001428,0.0030987272,0.0020997329,0.0016241148,0.0055979807],"category_scores_gemma":[0.021109598,0.00080712396,0.0011104409,0.0026617507,0.0041514174,0.0074241087,0.0039833332,0.00403909,0.00067883485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036098447,0.00011964257,0.0042937505,0.00069340254,0.00014617747,0.00089413516,0.0006649422,0.062196176,0.016523585,0.86278534,0.0091623245,0.04215958],"study_design_scores_gemma":[0.000042798863,0.00019156204,0.0034534861,0.00028871812,0.00013811613,0.0014550345,0.00023100337,0.16339734,0.006110788,0.8125487,0.0120253805,0.0001170726],"about_ca_topic_score_codex":0.0007516218,"about_ca_topic_score_gemma":0.00097152893,"teacher_disagreement_score":0.0055979807,"about_ca_system_score_codex":0.0017919128,"about_ca_system_score_gemma":0.00044884026,"threshold_uncertainty_score":0.018727124},"labels":[],"label_agreement":null},{"id":"W2739351832","doi":"","title":"A Survey of Automated Conjectures in Spectral Graph Theory","year":2009,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Graph theory and applications","field":"Mathematics","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Graph; Computer science; Graph theory; Mathematics; Theoretical computer science; Discrete mathematics; Combinatorics","score_opus":0.02045557587740854,"score_gpt":0.2840638379587068,"score_spread":0.2636082620812983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739351832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079133175,0.2002392,0.5034027,0.03618851,0.0036335944,0.00029119442,0.0020288036,0.0033629283,0.17171991],"genre_scores_gemma":[0.6273864,0.17723884,0.15657577,0.005391524,0.012947636,0.0004406544,0.0050499337,0.0013569201,0.013612254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9916741,0.0030873867,0.0004832906,0.0015119154,0.002895966,0.00034736976],"domain_scores_gemma":[0.9440767,0.042107627,0.0013759747,0.0067833792,0.0051341476,0.0005220741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009315353,0.0012944309,0.0018910007,0.007977754,0.0026572517,0.005370879,0.0035120558,0.0024990814,0.013092867],"category_scores_gemma":[0.036080774,0.0013498039,0.0013686637,0.010171789,0.009151098,0.016650824,0.0041370923,0.0042895516,0.0036449945],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012718521,0.00033961496,0.0033423144,0.0029926316,0.0000756895,0.0002622432,0.0006965201,0.006554461,0.00074690895,0.72642326,0.033488028,0.22495109],"study_design_scores_gemma":[0.000046209254,0.00008328643,0.0015931797,0.00119669,0.000038895138,0.00044733612,0.00033732728,0.01844841,0.0016454402,0.8813261,0.09476708,0.0000700023],"about_ca_topic_score_codex":0.0015050748,"about_ca_topic_score_gemma":0.0007949167,"teacher_disagreement_score":0.013092867,"about_ca_system_score_codex":0.0028589172,"about_ca_system_score_gemma":0.0025790378,"threshold_uncertainty_score":0.049264908},"labels":[],"label_agreement":null},{"id":"W2739676197","doi":"","title":"Bounds and Conjectures for the Signless Laplacian Index of Graphs","year":2009,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Graph theory and applications","field":"Mathematics","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":"HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Independence number; Domination analysis; Vertex (graph theory); Upper and lower bounds; Clique number; Spectral radius; Algebraic number; Laplace operator; Graph; Connectivity; Discrete mathematics; Eigenvalues and eigenvectors","score_opus":0.016318487520812774,"score_gpt":0.27137224616983896,"score_spread":0.2550537586490262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739676197","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8812817,0.00080028415,0.07126852,0.001958875,0.000097186086,0.000030318652,0.00038156615,0.0003536433,0.043827947],"genre_scores_gemma":[0.9933454,0.00013704869,0.0050732885,0.00007222462,0.00008077895,0.000016834341,0.00014986467,0.000022961043,0.0011016825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984819,0.00036070633,0.00007972746,0.00036006945,0.00051705126,0.00020051091],"domain_scores_gemma":[0.9852668,0.009677416,0.0016030478,0.0018652515,0.0010323655,0.0005551379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025132953,0.0003980341,0.00058622425,0.0024719622,0.0012004726,0.0023670911,0.0010504539,0.0007088083,0.0048358403],"category_scores_gemma":[0.013876223,0.00026501188,0.00048508047,0.0014353162,0.0040109274,0.0038428502,0.001416549,0.001576654,0.00038508605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039038286,0.0001685073,0.01778138,0.00018036415,0.00003234288,0.00021590304,0.0008254339,0.028455168,0.005875335,0.91295576,0.0037687463,0.02935067],"study_design_scores_gemma":[0.000049387392,0.0001555751,0.0042089727,0.000040979292,0.00002443541,0.00028158815,0.0004060196,0.076774545,0.005899713,0.9090303,0.0030892864,0.000039063096],"about_ca_topic_score_codex":0.00052185013,"about_ca_topic_score_gemma":0.0007450595,"teacher_disagreement_score":0.0048358403,"about_ca_system_score_codex":0.0012155431,"about_ca_system_score_gemma":0.00050247053,"threshold_uncertainty_score":0.016177535},"labels":[],"label_agreement":null},{"id":"W2739763930","doi":"10.1016/j.jctb.2019.10.005","title":"The inverse eigenvalue problem of a graph: Multiplicities and minors","year":2019,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","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 Regina","funders":"American Institute of Mathematics","keywords":"Eigenvalues and eigenvectors; Mathematics; Monotonic function; Inverse; Multiplicity (mathematics); Combinatorics; Diagonal; Discrete mathematics; Mathematical analysis","score_opus":0.02327575785812396,"score_gpt":0.2748947017448028,"score_spread":0.2516189438866788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739763930","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71545875,0.001121631,0.22543739,0.0049286555,0.00063690246,0.00007471923,0.0004515227,0.00035511336,0.051535197],"genre_scores_gemma":[0.94931835,0.0005983579,0.029955367,0.0002944635,0.00090559607,0.00009041221,0.0002970556,0.00019749689,0.018343005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897385,0.00032447348,0.00004570857,0.00028871876,0.00023048016,0.00013680053],"domain_scores_gemma":[0.9954555,0.0027529318,0.0004919177,0.0003329053,0.00037863263,0.0005881249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010059319,0.0011175893,0.0011440483,0.0028363613,0.0015321655,0.0035343159,0.001718028,0.0024700945,0.007956739],"category_scores_gemma":[0.006582833,0.0007318489,0.00084058574,0.0011957518,0.0026619164,0.0049330066,0.0021120422,0.0024899892,0.00091337145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018209808,0.00014089442,0.001185886,0.00017236605,0.00003146023,0.0004659639,0.00065962935,0.0062035155,0.0067337016,0.9613006,0.0066099684,0.016313983],"study_design_scores_gemma":[0.000019391025,0.000023617056,0.00035686736,0.000015220857,0.000011290123,0.00043690915,0.00019550411,0.024593804,0.00085532217,0.9719011,0.0015708095,0.00002012797],"about_ca_topic_score_codex":0.00036862248,"about_ca_topic_score_gemma":0.00033430662,"teacher_disagreement_score":0.007956739,"about_ca_system_score_codex":0.00065442803,"about_ca_system_score_gemma":0.00044507225,"threshold_uncertainty_score":0.026617944},"labels":[],"label_agreement":null},{"id":"W2741988167","doi":"","title":"Recherche à voisinage variable de graphes extrémaux. 13. À propos de la maille","year":2005,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Graph theory and applications","field":"Mathematics","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; Polytechnique Montréal","funders":"","keywords":"Humanities; Mathematics; Combinatorics; Philosophy","score_opus":0.04135848229991372,"score_gpt":0.3075989000990868,"score_spread":0.26624041779917307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741988167","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27437767,0.00803434,0.5450256,0.004939585,0.0012705991,0.00019362048,0.0028844073,0.0019643067,0.16130976],"genre_scores_gemma":[0.71765876,0.0026581471,0.17055903,0.0012873269,0.0007381893,0.00030726634,0.0037488847,0.0008674785,0.10217484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988096,0.00033968198,0.000035703593,0.00044092155,0.00026408973,0.00011004552],"domain_scores_gemma":[0.99705374,0.0018184355,0.00022903195,0.00034658352,0.00042437378,0.00012791925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017371958,0.00082020985,0.0007932187,0.0019946215,0.0013815383,0.0027238633,0.0010432672,0.0011641113,0.016202621],"category_scores_gemma":[0.0057412544,0.0006624796,0.0009939333,0.0012467323,0.0018559023,0.0031463576,0.0012335423,0.0030112425,0.0028937457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027939762,0.00009029027,0.005332715,0.0005041224,0.00010553063,0.00019532406,0.00058311713,0.016041579,0.009012484,0.8747914,0.017019486,0.07604457],"study_design_scores_gemma":[0.0001380295,0.00025515814,0.0073420997,0.00018440414,0.00010569311,0.000718302,0.00051054533,0.11231888,0.023550948,0.7601517,0.09463215,0.00009207022],"about_ca_topic_score_codex":0.0033068734,"about_ca_topic_score_gemma":0.004711323,"teacher_disagreement_score":0.016202621,"about_ca_system_score_codex":0.0023928815,"about_ca_system_score_gemma":0.001013265,"threshold_uncertainty_score":0.054203212},"labels":[],"label_agreement":null},{"id":"W2742805712","doi":"10.4310/atmp.2019.v23.n6.a6","title":"Graph minors and the linear reducibility of Feynman diagrams","year":2019,"lang":"en","type":"preprint","venue":"Advances in Theoretical and Mathematical Physics","topic":"Graph theory and applications","field":"Mathematics","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 Waterloo","funders":"","keywords":"Feynman diagram; Feynman integral; Mathematics; Graph; Minor (academic); Combinatorics; Graph minor; Property (philosophy); Feynman graph; Discrete mathematics; Physics; Line graph; Voltage graph; Particle physics; Mathematical physics; Philosophy","score_opus":0.016603894896563446,"score_gpt":0.31555487779249414,"score_spread":0.2989509828959307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742805712","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.8464622,0.0006652855,0.10072829,0.0006851757,0.00011967245,0.00005446262,0.00023103684,0.00046571487,0.050588213],"genre_scores_gemma":[0.98567176,0.00022230973,0.007804089,0.00006319449,0.00006636041,0.00002797873,0.00012481582,0.00009286695,0.0059266454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996933,0.00007690525,0.000013737059,0.00007192558,0.00007869823,0.000065582666],"domain_scores_gemma":[0.9988582,0.0005301443,0.00017441255,0.00019637539,0.00012224872,0.00011859074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000386066,0.00041539138,0.00030628106,0.0012205802,0.001073335,0.0012185153,0.0006257733,0.0006005853,0.004541699],"category_scores_gemma":[0.0020545842,0.0002787415,0.0006395119,0.00039835507,0.001975211,0.0017472742,0.00076831196,0.001189344,0.00047859826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048535152,0.000030977004,0.00047956512,0.000057623074,0.000008443111,0.00019960804,0.00031735853,0.002019308,0.006510824,0.9843873,0.0006426026,0.0052977623],"study_design_scores_gemma":[0.000011065319,0.000017746966,0.00033173157,0.000010390079,0.0000064152837,0.00021666425,0.000074079944,0.006170657,0.002883113,0.9884919,0.001777167,0.000008901338],"about_ca_topic_score_codex":0.0006537162,"about_ca_topic_score_gemma":0.0004983558,"teacher_disagreement_score":0.004541699,"about_ca_system_score_codex":0.0005096017,"about_ca_system_score_gemma":0.00026341958,"threshold_uncertainty_score":0.015193462},"labels":[],"label_agreement":null},{"id":"W2744937545","doi":"10.1016/j.dam.2017.11.035","title":"The shape of node reliability","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Node (physics); Reliability (semiconductor); Combinatorics; Algorithm","score_opus":0.027183261341957456,"score_gpt":0.30308262914630385,"score_spread":0.2758993678043464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2744937545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28433728,0.0016353464,0.61290747,0.0069824043,0.00042853883,0.000090065005,0.0011158774,0.0012682906,0.09123471],"genre_scores_gemma":[0.96792555,0.00061246974,0.021292482,0.00027737807,0.00020594832,0.00008914497,0.0002256307,0.00039061706,0.008980663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867517,0.00053562154,0.00003674498,0.00027226345,0.0003431492,0.0001370163],"domain_scores_gemma":[0.9777926,0.014406797,0.0014324704,0.0026234284,0.0027779972,0.0009666972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026060543,0.00052332506,0.0007779296,0.0018399031,0.0006843429,0.0025361064,0.0019176825,0.0018801687,0.007843975],"category_scores_gemma":[0.038776174,0.00074563385,0.0004929183,0.001295947,0.0026178914,0.0050207833,0.0012516046,0.0023667656,0.001321936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016496041,0.000027623415,0.0019866747,0.00014379557,0.000023944955,0.00019252839,0.000667534,0.07533772,0.00426154,0.88199085,0.0064167813,0.028785992],"study_design_scores_gemma":[0.000029757211,0.00008123621,0.0020640113,0.000057754394,0.000024826972,0.0004600763,0.00037273928,0.26537603,0.0014006934,0.7247301,0.0053544804,0.000048256432],"about_ca_topic_score_codex":0.0010492072,"about_ca_topic_score_gemma":0.00063085946,"teacher_disagreement_score":0.007843975,"about_ca_system_score_codex":0.0012442797,"about_ca_system_score_gemma":0.00059543346,"threshold_uncertainty_score":0.026240706},"labels":[],"label_agreement":null},{"id":"W2748666773","doi":"10.46298/dmtcs.2518","title":"Sign variation, the Grassmannian, and total positivity","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Graph theory and applications","field":"Mathematics","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; Combinatorics; Linear subspace; Grassmannian; Sign (mathematics); Algebraic number; Pure mathematics; Mathematical analysis","score_opus":0.02706167935752997,"score_gpt":0.28974784394197023,"score_spread":0.2626861645844403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2748666773","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5013856,0.0008702851,0.4423104,0.00062114664,0.00025675577,0.00011637812,0.00060200214,0.00058052654,0.053256795],"genre_scores_gemma":[0.90449035,0.00044671248,0.084553786,0.00014844924,0.00007716288,0.000075689546,0.0003786051,0.00024438195,0.009584924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995308,0.00007322227,0.000024918514,0.00014342404,0.00012618573,0.000101496116],"domain_scores_gemma":[0.99946994,0.000114320705,0.000084629966,0.00010624821,0.000112305795,0.00011257806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004731897,0.00048387673,0.0004964638,0.0009165137,0.00083970674,0.0011630716,0.00060097384,0.0003300844,0.0035567384],"category_scores_gemma":[0.0018294592,0.00024666122,0.0005877113,0.0009315663,0.0030479378,0.0019709535,0.0018072347,0.0008162534,0.00064029987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018326519,0.000023320139,0.0024408412,0.000107734195,0.000013802949,0.0003964488,0.00061601936,0.0115653435,0.015453376,0.87993693,0.004637649,0.08462535],"study_design_scores_gemma":[0.000014036835,0.00006680066,0.0016184242,0.000025329535,0.000010993529,0.00034887902,0.00025442077,0.03613358,0.006801579,0.94471616,0.009941483,0.000068380294],"about_ca_topic_score_codex":0.0012216141,"about_ca_topic_score_gemma":0.0013156985,"teacher_disagreement_score":0.0035567384,"about_ca_system_score_codex":0.00061563967,"about_ca_system_score_gemma":0.00049554725,"threshold_uncertainty_score":0.011898458},"labels":[],"label_agreement":null},{"id":"W2752748329","doi":"10.1002/jgt.22185","title":"The mean order of sub‐<i>k</i>‐trees of <i>k</i>‐trees","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Graph theory and applications","field":"Mathematics","cited_by":8,"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":"Combinatorics; Mathematics; Tree (set theory); Order (exchange); Weight-balanced tree; Vertex (graph theory); Clique; Discrete mathematics; Graph; Binary tree; Binary search tree","score_opus":0.028572947037304997,"score_gpt":0.30471738066468446,"score_spread":0.27614443362737945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752748329","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7993744,0.000274593,0.193004,0.0003450737,0.00002308556,0.000050956067,0.0008676124,0.0003493868,0.0057109366],"genre_scores_gemma":[0.95050544,0.00015377677,0.045713365,0.0000626348,0.000033081502,0.000050309856,0.00083321147,0.00019024078,0.0024579214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993087,0.00010000846,0.000039014834,0.00021446458,0.0001510041,0.00018674633],"domain_scores_gemma":[0.99011314,0.0059183952,0.0013154391,0.0009833006,0.0009118386,0.0007579187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087727304,0.00024732033,0.0007646249,0.0010067391,0.00085894356,0.0020567128,0.0011080755,0.000555047,0.0034024282],"category_scores_gemma":[0.006303161,0.00042294673,0.0006407675,0.00088371633,0.001165324,0.0025453907,0.0008414777,0.0011441321,0.0004898254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018312251,0.00034941192,0.09789637,0.0008093904,0.0002126946,0.00072573626,0.0019361189,0.23949462,0.09619321,0.38991103,0.009161507,0.16147862],"study_design_scores_gemma":[0.00004881275,0.00025407656,0.028470356,0.00006925158,0.00010050172,0.0012011693,0.0007333926,0.50035274,0.031667314,0.43058425,0.006438336,0.00007988509],"about_ca_topic_score_codex":0.0013533186,"about_ca_topic_score_gemma":0.0020330565,"teacher_disagreement_score":0.0034024282,"about_ca_system_score_codex":0.0015241448,"about_ca_system_score_gemma":0.0011272293,"threshold_uncertainty_score":0.011382282},"labels":[],"label_agreement":null},{"id":"W2754833037","doi":"10.1139/cjp-2017-0274","title":"Eigenvalues of transition weight matrix and eigentime identity of weighted network with two hub nodes","year":2017,"lang":"en","type":"article","venue":"Canadian Journal of Physics","topic":"Graph theory and applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Education of the People's Republic of China; National Natural Science Foundation of China","keywords":"Eigenvalues and eigenvectors; Laplacian matrix; Matrix (chemical analysis); Spanning tree; Combinatorics; Laplace operator; Product (mathematics); Stochastic matrix; Identity (music); Mathematics; Pure mathematics; Graph; Physics; Mathematical analysis; Statistics; Quantum mechanics","score_opus":0.023585517583663795,"score_gpt":0.2941404920225172,"score_spread":0.2705549744388534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754833037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32717815,0.00044888048,0.65665984,0.00034208447,0.000091457376,0.00005510824,0.00023932134,0.00027156158,0.014713682],"genre_scores_gemma":[0.9362895,0.0003969479,0.055682804,0.0000680859,0.00007127704,0.0001291622,0.00021981669,0.000089546156,0.007052825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996026,0.00006807082,0.000018524568,0.0001364573,0.0000937597,0.000080649064],"domain_scores_gemma":[0.9989784,0.00035409792,0.00020328627,0.00009527799,0.0002655153,0.000103451785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040060477,0.0003574755,0.00030838864,0.0013372692,0.00051352923,0.0007714296,0.0005717567,0.0005252666,0.004944503],"category_scores_gemma":[0.003129193,0.00019381319,0.00043816897,0.0006843263,0.00095454836,0.0020391995,0.00051997276,0.0005050267,0.000408233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008641917,0.00006212631,0.0043602698,0.00016270335,0.000041466075,0.0004853461,0.0006201558,0.055035934,0.022921225,0.880714,0.0017798826,0.033730477],"study_design_scores_gemma":[0.000013088364,0.0000568467,0.004595857,0.000027879374,0.00001883278,0.0005867166,0.00024848618,0.41863862,0.004524618,0.5683999,0.0028373536,0.000051865994],"about_ca_topic_score_codex":0.0013700011,"about_ca_topic_score_gemma":0.0010303481,"teacher_disagreement_score":0.004944503,"about_ca_system_score_codex":0.00054932944,"about_ca_system_score_gemma":0.00040660915,"threshold_uncertainty_score":0.016541004},"labels":[],"label_agreement":null},{"id":"W2757565","doi":"10.1007/bf00456661","title":"New results on the eccentric digraphs of the digraphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Combinatorics; Vertex (graph theory); Mathematics; Eccentric; Eccentricity (behavior); Discrete mathematics; Graph; Physics","score_opus":0.033007409058571746,"score_gpt":0.25848545363596986,"score_spread":0.22547804457739812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15273511,0.0067952783,0.65003103,0.0031866238,0.0012629571,0.0002120496,0.003404079,0.00094559597,0.18142734],"genre_scores_gemma":[0.76328826,0.007278368,0.1595116,0.0015078922,0.002048244,0.0002927354,0.0042763227,0.00060318876,0.06119352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991879,0.0001653377,0.000066396045,0.00028701578,0.00020847711,0.00008490726],"domain_scores_gemma":[0.99664813,0.0014797456,0.0004946639,0.00052369386,0.00046154574,0.00039219978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060759106,0.0007094307,0.0006899616,0.004023273,0.0015433619,0.002803328,0.00094402255,0.0007788133,0.011499029],"category_scores_gemma":[0.005110201,0.00050886365,0.00078170275,0.0034138511,0.0018538437,0.0038546969,0.0018543943,0.0018562089,0.0020552042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007029731,0.000045868925,0.0014599708,0.00037262536,0.00004343532,0.00050044,0.00050583325,0.0029947432,0.003050335,0.9277849,0.008763669,0.05440783],"study_design_scores_gemma":[0.000023624467,0.00004680389,0.0024370612,0.0000645366,0.00005123883,0.0013969896,0.00018111667,0.013970423,0.0012293215,0.92231673,0.058243204,0.00003891192],"about_ca_topic_score_codex":0.001047974,"about_ca_topic_score_gemma":0.0016495733,"teacher_disagreement_score":0.011499029,"about_ca_system_score_codex":0.0010304227,"about_ca_system_score_gemma":0.0003454221,"threshold_uncertainty_score":0.038468063},"labels":[],"label_agreement":null},{"id":"W2757630574","doi":"","title":"Note on the distance spectral gap of graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral gap; Mathematical analysis","score_opus":0.0379458027025027,"score_gpt":0.30739166708374466,"score_spread":0.26944586438124196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757630574","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08663192,0.042665888,0.19792873,0.08419465,0.018885693,0.00008435278,0.001445511,0.0009745919,0.5671887],"genre_scores_gemma":[0.84053046,0.019595824,0.064306684,0.017607655,0.01639924,0.00022340834,0.0008017402,0.000655025,0.03987995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851185,0.0004091095,0.00005586845,0.00035942803,0.00050347927,0.0001602212],"domain_scores_gemma":[0.98913354,0.007914527,0.00042651515,0.0009992922,0.0006773218,0.0008488733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020558878,0.0011686406,0.0014060657,0.0034380858,0.0019405753,0.0027543604,0.0026071155,0.002251857,0.01763739],"category_scores_gemma":[0.013685814,0.0003566745,0.0008692953,0.0031558916,0.0059697214,0.00992437,0.0056576896,0.0066210795,0.0022169636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048736085,0.000026783933,0.00022710329,0.00012642829,0.000011639886,0.0001097671,0.00014976122,0.00070243736,0.0005916628,0.97675836,0.012848713,0.008398557],"study_design_scores_gemma":[0.0000076149045,0.000019024186,0.00024784298,0.000029099023,0.000008288816,0.00014404368,0.000075888165,0.0014796571,0.00021875821,0.985843,0.011916079,0.000010682781],"about_ca_topic_score_codex":0.0011494122,"about_ca_topic_score_gemma":0.0008353692,"teacher_disagreement_score":0.01763739,"about_ca_system_score_codex":0.0014237034,"about_ca_system_score_gemma":0.0006230682,"threshold_uncertainty_score":0.059002995},"labels":[],"label_agreement":null},{"id":"W2757702714","doi":"","title":"Distance spectral radius of quasi-trees.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; RADIUS; Spectral radius; Physics; Computer science","score_opus":0.027186262916313597,"score_gpt":0.30104481777193776,"score_spread":0.27385855485562416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757702714","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.629469,0.0052289516,0.2185155,0.004038822,0.0005467025,0.000053555825,0.0012660136,0.00047340099,0.1404081],"genre_scores_gemma":[0.96403205,0.0012853097,0.021458212,0.00039287345,0.00035640266,0.00006836348,0.00053102645,0.00014019037,0.011735562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913245,0.00026655773,0.000042218297,0.00017929461,0.00025167002,0.00012793936],"domain_scores_gemma":[0.9944496,0.0030489555,0.0006567154,0.00040239363,0.0006212426,0.0008211214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092307816,0.00040568266,0.00073154486,0.002602137,0.0012383538,0.002515302,0.001218834,0.0009963271,0.0073207435],"category_scores_gemma":[0.008105254,0.00029863333,0.00034259429,0.0015130047,0.0017987576,0.0041930294,0.0020412225,0.001392195,0.0016673323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007639181,0.000021772306,0.00083292066,0.00008276672,0.000013166312,0.0000485744,0.00021440904,0.0018691049,0.0016878397,0.98297775,0.0034903546,0.008684924],"study_design_scores_gemma":[0.000016246526,0.00002880841,0.0013644088,0.000030461484,0.000015584623,0.00030665533,0.00026306123,0.018592203,0.0010555934,0.97117114,0.007142118,0.000013706491],"about_ca_topic_score_codex":0.00077901926,"about_ca_topic_score_gemma":0.0007041788,"teacher_disagreement_score":0.0073207435,"about_ca_system_score_codex":0.0012311765,"about_ca_system_score_gemma":0.00035411364,"threshold_uncertainty_score":0.024490297},"labels":[],"label_agreement":null},{"id":"W2757888206","doi":"","title":"An Incomparable Upper Bound For The Largest Laplacian Graph Eigenvalue.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Upper and lower bounds; Laplace operator; Laplacian matrix; Combinatorics; Graph; Algebraic connectivity; Mathematical analysis; Physics","score_opus":0.04642426429592865,"score_gpt":0.34140376138068157,"score_spread":0.2949794970847529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757888206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07110881,0.013581713,0.5438109,0.026395844,0.005335739,0.0002110708,0.0036518262,0.002833441,0.33307067],"genre_scores_gemma":[0.72876984,0.008707051,0.18102145,0.007403969,0.0070577716,0.0010695047,0.0034880708,0.0024719941,0.06001034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951504,0.0010133692,0.00016072484,0.0011384966,0.0015892828,0.0009477184],"domain_scores_gemma":[0.9612833,0.030992659,0.000915123,0.0033348855,0.0016251972,0.0018487817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003995588,0.0030532528,0.0023784789,0.003257047,0.0033690212,0.0061384146,0.006176249,0.004092001,0.032919355],"category_scores_gemma":[0.042335868,0.001157321,0.0016193984,0.00324183,0.004312642,0.011783583,0.0070270873,0.012352983,0.00879603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054902193,0.0003246274,0.0010694591,0.00073160144,0.000100529025,0.00043083593,0.00042403123,0.013119862,0.00879535,0.86857384,0.063121386,0.042759463],"study_design_scores_gemma":[0.000039131246,0.000049056496,0.0005607391,0.00011420583,0.000057995825,0.0003176197,0.00010520955,0.049633507,0.0022010067,0.93318665,0.013686181,0.000048722388],"about_ca_topic_score_codex":0.0012327841,"about_ca_topic_score_gemma":0.002327129,"teacher_disagreement_score":0.032919355,"about_ca_system_score_codex":0.0027617721,"about_ca_system_score_gemma":0.0017827606,"threshold_uncertainty_score":0.1101262},"labels":[],"label_agreement":null},{"id":"W2758431483","doi":"10.13001/1081-3810.3746","title":"Average Mixing Matrix of Trees","year":2018,"lang":"en","type":"preprint","venue":"Electronic Journal of Linear Algebra","topic":"Graph theory and applications","field":"Mathematics","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":"Mixing (physics); Combinatorics; Mathematics; Bounded function; Rank (graph theory); Eigenvalues and eigenvectors; Upper and lower bounds; Tree (set theory); Matrix (chemical analysis); Physics; Mathematical analysis; Chemistry","score_opus":0.02305407482216389,"score_gpt":0.32347463859494224,"score_spread":0.30042056377277837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758431483","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6446831,0.0014003933,0.31412402,0.0006081694,0.00011942696,0.000058384063,0.0012294829,0.00072401273,0.03705297],"genre_scores_gemma":[0.9696256,0.0004660189,0.02287104,0.00008343625,0.00013666949,0.000038966442,0.0006658207,0.00010961872,0.0060028657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999212,0.00016503496,0.000027670345,0.00016752379,0.00024769863,0.00018015494],"domain_scores_gemma":[0.9972389,0.0011027836,0.00048872764,0.0002673222,0.00051998,0.00038227756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062860816,0.00047875842,0.00052535394,0.0017974004,0.0008892654,0.0019194375,0.0006003802,0.00056800473,0.0068721264],"category_scores_gemma":[0.0052454257,0.00030302195,0.000435718,0.0010468315,0.0011015771,0.001883478,0.0008359266,0.0010529571,0.0010194465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040534444,0.00005995235,0.0034227618,0.00021996287,0.000061004048,0.00039437713,0.0004568463,0.063035265,0.03997046,0.84363467,0.0056974445,0.04264193],"study_design_scores_gemma":[0.00002323812,0.00015674734,0.002888092,0.000036543846,0.0000289574,0.00054042385,0.00018752739,0.31196025,0.011078867,0.66554886,0.0074738655,0.000076560515],"about_ca_topic_score_codex":0.0007673213,"about_ca_topic_score_gemma":0.00069190474,"teacher_disagreement_score":0.0068721264,"about_ca_system_score_codex":0.00052856654,"about_ca_system_score_gemma":0.00042231925,"threshold_uncertainty_score":0.022989511},"labels":[],"label_agreement":null},{"id":"W2758744141","doi":"","title":"A study on degree characterization for hamiltonian-connected graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Characterization (materials science); Combinatorics; Physics; Nanotechnology; Materials science","score_opus":0.09181590200353909,"score_gpt":0.3404378760293594,"score_spread":0.24862197402582029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758744141","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6563847,0.007611886,0.23302184,0.0029323776,0.00051857956,0.00014658223,0.0011669977,0.00028382908,0.09793316],"genre_scores_gemma":[0.97086614,0.0027921288,0.015831897,0.00035506772,0.0004970842,0.000045290046,0.0005669601,0.00014514351,0.008900179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941874,0.00013980019,0.000025360876,0.00019314811,0.00013288567,0.00009010517],"domain_scores_gemma":[0.9965759,0.0020261586,0.00037719516,0.0002969732,0.00035601418,0.0003676878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006801433,0.00055428833,0.00048780948,0.0032929953,0.0010906877,0.0020041391,0.0010806796,0.0006612322,0.005317837],"category_scores_gemma":[0.006329113,0.00030067598,0.0006398963,0.0033389884,0.0018766142,0.0049952264,0.0011963369,0.0016151997,0.00052904966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000774357,0.00007648021,0.004898278,0.0002749141,0.000028552226,0.00023995705,0.0009912838,0.004237021,0.0073756254,0.9476717,0.004563651,0.029565051],"study_design_scores_gemma":[0.000020789485,0.00012339061,0.008266376,0.00018271341,0.00010998424,0.0014356632,0.0013952564,0.055365875,0.00632013,0.9022081,0.024515243,0.000056456574],"about_ca_topic_score_codex":0.0008380173,"about_ca_topic_score_gemma":0.00083987764,"teacher_disagreement_score":0.005317837,"about_ca_system_score_codex":0.0010874372,"about_ca_system_score_gemma":0.0003759726,"threshold_uncertainty_score":0.01778996},"labels":[],"label_agreement":null},{"id":"W2759760320","doi":"","title":"Pentacyclic Graphs with Maximal Estrada Index.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Discrete mathematics; Computer science; World Wide Web","score_opus":0.027798339497881807,"score_gpt":0.2915498129243886,"score_spread":0.2637514734265068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759760320","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23328003,0.001095111,0.062493447,0.0019867711,0.0004979812,0.00011024498,0.0029420792,0.0006306432,0.6969636],"genre_scores_gemma":[0.8938825,0.0009122587,0.022536436,0.0006669714,0.00018148644,0.00008308516,0.0025884109,0.00019549952,0.07895337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997203,0.000046016845,0.000014547636,0.00007820014,0.00006728761,0.000073569914],"domain_scores_gemma":[0.99928635,0.00027144895,0.000108601074,0.000109930814,0.000087539316,0.00013614872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017316034,0.0003640819,0.0006189004,0.0010365053,0.0013217856,0.0025535088,0.00056136213,0.00068859133,0.025015865],"category_scores_gemma":[0.0011078955,0.0003446361,0.00034574926,0.0010705894,0.0009823298,0.0019055089,0.0013420646,0.0016540769,0.003612974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013728837,0.00006527154,0.0005680062,0.000115817726,0.000019377636,0.00047996413,0.00023213669,0.001271602,0.0041769682,0.9655696,0.011899302,0.01546461],"study_design_scores_gemma":[0.000050421913,0.000033750228,0.0011332264,0.000052198848,0.000036039968,0.0005401839,0.00042601977,0.0037693998,0.0023824577,0.9591798,0.03237786,0.000018586159],"about_ca_topic_score_codex":0.00089303456,"about_ca_topic_score_gemma":0.0022134748,"teacher_disagreement_score":0.025015865,"about_ca_system_score_codex":0.00061249564,"about_ca_system_score_gemma":0.0004220009,"threshold_uncertainty_score":0.08368641},"labels":[],"label_agreement":null},{"id":"W2759894817","doi":"","title":"Generalized characteristic polynomial of generalized R-vertex corona.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Corona (planetary geology); Vertex (graph theory); Polynomial; Combinatorics; Mathematical analysis; Graph; Physics; Astrobiology","score_opus":0.039452995323459646,"score_gpt":0.31202343979528646,"score_spread":0.2725704444718268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759894817","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73091763,0.0018132827,0.069696166,0.0028275538,0.00056640967,0.00005264812,0.0011495147,0.00041178052,0.192565],"genre_scores_gemma":[0.9829091,0.0004537372,0.0034468719,0.0001756722,0.0002297637,0.000018223875,0.00028035764,0.000054505166,0.012431794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997317,0.00003889331,0.0000064527235,0.00007084454,0.00006793996,0.00008413928],"domain_scores_gemma":[0.9994649,0.00014866085,0.00009685417,0.00006728447,0.00010740908,0.00011494151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020838379,0.00032436472,0.00056843314,0.0012185455,0.00070711516,0.0014771677,0.0007009041,0.0005572739,0.008804885],"category_scores_gemma":[0.0014326485,0.0001775038,0.0004658334,0.0010154383,0.0012511188,0.0027563048,0.0010730635,0.0011389073,0.0012116244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009705847,0.000028667893,0.0011919369,0.000120541845,0.000018491015,0.00026862443,0.00023604122,0.0026980068,0.0032988314,0.96783787,0.006972374,0.017231572],"study_design_scores_gemma":[0.00003888043,0.000033991702,0.0019643935,0.000027574457,0.000022977049,0.0005729884,0.00017563642,0.016435616,0.0011303802,0.96772075,0.011851916,0.00002485459],"about_ca_topic_score_codex":0.0014411254,"about_ca_topic_score_gemma":0.0012936046,"teacher_disagreement_score":0.008804885,"about_ca_system_score_codex":0.0012038712,"about_ca_system_score_gemma":0.0004723249,"threshold_uncertainty_score":0.029455304},"labels":[],"label_agreement":null},{"id":"W2759937049","doi":"","title":"Bicyclic graphs with the second up to seventh largest Wiener indices.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Bicyclic molecule; Combinatorics; Statistics; Graph; Medicinal chemistry; Chemistry","score_opus":0.023780826423362766,"score_gpt":0.2909774739884292,"score_spread":0.26719664756506645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759937049","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5172252,0.003142444,0.09547734,0.0019145692,0.00070172385,0.00009890576,0.0018583392,0.00070805295,0.37887347],"genre_scores_gemma":[0.9398599,0.0010837448,0.016429968,0.0005562261,0.00014067357,0.000072920644,0.0007838206,0.00014868322,0.040923994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996803,0.00005433808,0.00001629942,0.000052824424,0.000092816794,0.00010346367],"domain_scores_gemma":[0.99924076,0.00020047279,0.00012879343,0.00014289143,0.00014527983,0.00014183055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002095204,0.00038578402,0.00046371925,0.0013064314,0.0010200843,0.0016057235,0.00050435856,0.00074317044,0.0080911545],"category_scores_gemma":[0.0017603852,0.00035658,0.00026807742,0.0010354606,0.000933048,0.0015015161,0.0015398155,0.0012528714,0.0020521288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001123715,0.000020890553,0.00055813836,0.000079089914,0.000012159326,0.00022344693,0.00020530961,0.001385972,0.0064715827,0.9656979,0.006435762,0.018797502],"study_design_scores_gemma":[0.000025579295,0.000037565904,0.0015107525,0.00007824674,0.000028960078,0.00071112404,0.00026199265,0.0069339797,0.0068008574,0.9595573,0.02401472,0.000039004397],"about_ca_topic_score_codex":0.0009099256,"about_ca_topic_score_gemma":0.0020064942,"teacher_disagreement_score":0.0080911545,"about_ca_system_score_codex":0.00051296735,"about_ca_system_score_gemma":0.0004718182,"threshold_uncertainty_score":0.027067602},"labels":[],"label_agreement":null},{"id":"W2760792438","doi":"","title":"On the minimum spectral radius of trees with given matching number.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Matching (statistics); Spectral radius; RADIUS; Combinatorics; Statistics; Computer science; Physics; Computer security; Eigenvalues and eigenvectors; Quantum mechanics","score_opus":0.023870554136700285,"score_gpt":0.2862473691199902,"score_spread":0.2623768149832899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760792438","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5642426,0.009102509,0.32690158,0.0045414213,0.00054414244,0.00010277848,0.0017224425,0.00078840175,0.09205406],"genre_scores_gemma":[0.9304091,0.002935669,0.056723535,0.00045457386,0.0006878103,0.00015540532,0.00076560176,0.0003970691,0.007471288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986975,0.00057960354,0.000057238838,0.00027107928,0.00021125675,0.00018328521],"domain_scores_gemma":[0.9877966,0.008831738,0.0011591836,0.00063136633,0.0006336906,0.00094744295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018035724,0.00071281404,0.0015045524,0.0027258082,0.0012590429,0.0025745695,0.00242489,0.0019252389,0.0068097627],"category_scores_gemma":[0.019571131,0.0005332459,0.00047809645,0.0019031197,0.0022618875,0.005630126,0.002214206,0.0017617792,0.0017529774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005992095,0.00011096959,0.0026774255,0.00051328994,0.00007722377,0.00018221718,0.00052062457,0.043858927,0.0077237254,0.89268005,0.016007558,0.03504889],"study_design_scores_gemma":[0.000045562185,0.000076570555,0.0018049199,0.000097622105,0.000048328013,0.0004836174,0.00036075155,0.12038406,0.0020877204,0.8685226,0.006048857,0.00003937769],"about_ca_topic_score_codex":0.00071458693,"about_ca_topic_score_gemma":0.00070673623,"teacher_disagreement_score":0.0068097627,"about_ca_system_score_codex":0.0014687043,"about_ca_system_score_gemma":0.00047906153,"threshold_uncertainty_score":0.022780955},"labels":[],"label_agreement":null},{"id":"W2761487990","doi":"10.4153/cmb-2016-055-4","title":"Maximal Weight Composition Factors for Weyl Modules","year":2016,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Composition (language); Pure mathematics; Linguistics","score_opus":0.030804692776286564,"score_gpt":0.25970240266164013,"score_spread":0.22889770988535357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761487990","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8734027,0.00043915765,0.06490465,0.00033101893,0.00009362336,0.000084358275,0.00010601534,0.00055332424,0.0600851],"genre_scores_gemma":[0.97878665,0.00019669981,0.009123828,0.000054896776,0.000072040464,0.00004175411,0.000101275175,0.00008938475,0.011533484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993073,0.00007835307,0.00003336392,0.00014732183,0.00022937848,0.00020420302],"domain_scores_gemma":[0.9994223,0.00012315478,0.000095844654,0.00006311228,0.00009612888,0.0001995413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061056786,0.0005006796,0.00037540012,0.0014408578,0.0015418417,0.0017478366,0.00036855822,0.00048687245,0.0071494877],"category_scores_gemma":[0.0015131724,0.0004024762,0.0005634436,0.0005284267,0.0020225402,0.003237003,0.0023036595,0.0008849693,0.0010339352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014129988,0.0000548387,0.0022602181,0.00007296303,0.000020172625,0.0005398004,0.0009661096,0.0008678944,0.014740927,0.9654757,0.00075306196,0.014107019],"study_design_scores_gemma":[0.00006741165,0.00012168619,0.0024535244,0.00004817014,0.000045912217,0.00069799816,0.0008530979,0.005780618,0.025276596,0.9435809,0.021032229,0.000041843596],"about_ca_topic_score_codex":0.0005147463,"about_ca_topic_score_gemma":0.000690607,"teacher_disagreement_score":0.0071494877,"about_ca_system_score_codex":0.0010071017,"about_ca_system_score_gemma":0.00039321088,"threshold_uncertainty_score":0.023917437},"labels":[],"label_agreement":null},{"id":"W2766975978","doi":"10.5614/ejgta.2017.5.2.14","title":"On the nullity number of graphs","year":2017,"lang":"en","type":"article","venue":"Electronic Journal of Graph Theory and Applications","topic":"Graph theory and applications","field":"Mathematics","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Clique number; Upper and lower bounds; Graph; Clique; Discrete mathematics","score_opus":0.0180531121251337,"score_gpt":0.31699401568668,"score_spread":0.2989409035615463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766975978","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47834903,0.005572501,0.39323288,0.0068023964,0.0005516905,0.000118707474,0.0010591338,0.00038418607,0.11392951],"genre_scores_gemma":[0.9506398,0.0022935218,0.03785089,0.0005923814,0.0005459395,0.00015932642,0.0005380786,0.0002716532,0.0071084383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99595,0.0013088674,0.00021494816,0.00093629013,0.000968967,0.00062096975],"domain_scores_gemma":[0.9514133,0.03668545,0.0027767743,0.0035521719,0.0026380816,0.002934229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044162394,0.0010057181,0.0013210594,0.0037228807,0.0025659085,0.0029526523,0.0023758328,0.0015152235,0.0051213377],"category_scores_gemma":[0.02669779,0.0008434107,0.001371737,0.0019262615,0.0070349043,0.009800808,0.004484598,0.003983912,0.0006510786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026770154,0.000048495596,0.0023145764,0.00019031862,0.000040000723,0.00015638038,0.00034158048,0.008623858,0.0039860075,0.9723929,0.0019216131,0.009716628],"study_design_scores_gemma":[0.00002293107,0.00006203654,0.0007765983,0.00005206766,0.000031793432,0.00022899808,0.00009424081,0.028016005,0.0024270376,0.9646355,0.0036214055,0.00003147158],"about_ca_topic_score_codex":0.00046801678,"about_ca_topic_score_gemma":0.00046166684,"teacher_disagreement_score":0.0051213377,"about_ca_system_score_codex":0.001750511,"about_ca_system_score_gemma":0.000577009,"threshold_uncertainty_score":0.023355603},"labels":[],"label_agreement":null},{"id":"W2767379641","doi":"","title":"Oriented Bicyclic Graphs with the First Five Large Skew Energies.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Skew; Mathematics; Combinatorics; Computer science; Telecommunications","score_opus":0.015444592651207314,"score_gpt":0.27054560026365354,"score_spread":0.25510100761244625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767379641","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6856664,0.0018371365,0.055193074,0.0012598927,0.0006079836,0.00007335864,0.0007196868,0.00040117907,0.25424132],"genre_scores_gemma":[0.9771494,0.00041748895,0.0069516553,0.00026093842,0.00006315204,0.000029233737,0.00023548724,0.00006211956,0.014830559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998418,0.00002642685,0.000005872115,0.000021797465,0.000049300008,0.00005476183],"domain_scores_gemma":[0.9995921,0.000103625585,0.000077595985,0.00006641613,0.00006692574,0.00009327178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015485917,0.0003691083,0.00030488553,0.00083775586,0.0008142111,0.0011363232,0.00039702552,0.00067973183,0.009012725],"category_scores_gemma":[0.0010287478,0.0002465789,0.00015352257,0.0006837613,0.00078816747,0.0010167233,0.001035323,0.00078860886,0.001112086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012100187,0.00003301215,0.0009191201,0.000090245005,0.000010872765,0.0003579673,0.00014823664,0.0030630543,0.006149666,0.96125996,0.0055453987,0.022301458],"study_design_scores_gemma":[0.000034831777,0.000044051314,0.0022780607,0.00007175488,0.000025155134,0.0009347327,0.00035631034,0.011352877,0.006771714,0.95893204,0.019162165,0.000036370715],"about_ca_topic_score_codex":0.00047970153,"about_ca_topic_score_gemma":0.0013754352,"teacher_disagreement_score":0.009012725,"about_ca_system_score_codex":0.00039182452,"about_ca_system_score_gemma":0.0003489735,"threshold_uncertainty_score":0.030150592},"labels":[],"label_agreement":null},{"id":"W2767409815","doi":"","title":"Harmonic index of graphs with more than one cut-vertex.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Index (typography); Combinatorics; Discrete mathematics; Graph; Computer science","score_opus":0.032786357015468164,"score_gpt":0.2902333492639153,"score_spread":0.25744699224844714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767409815","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5504515,0.002024994,0.12909007,0.0016506568,0.00089079974,0.00008384789,0.0015543884,0.00041062967,0.3138431],"genre_scores_gemma":[0.95312107,0.0007964953,0.013747355,0.00027559194,0.00039982155,0.00006845368,0.0009913219,0.00020907109,0.0303909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996728,0.000046805122,0.000013183721,0.00007034299,0.0000998913,0.00009699254],"domain_scores_gemma":[0.99878234,0.00049313257,0.00017478326,0.00014168101,0.00016424253,0.00024382843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036081098,0.00040160678,0.00059893104,0.0026620734,0.0011062887,0.0023927095,0.0012375059,0.0009540951,0.011173973],"category_scores_gemma":[0.0025965984,0.0002786129,0.0003327711,0.0012877831,0.001348379,0.0028110219,0.0016947204,0.0012287082,0.0017821209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007945457,0.000026451524,0.0009062205,0.00006589434,0.000016007543,0.00013284365,0.0001770569,0.0014769566,0.0029799058,0.9717272,0.005424502,0.01698753],"study_design_scores_gemma":[0.000016746077,0.000023094779,0.0016064754,0.00002750612,0.000025579735,0.00037072896,0.00023188964,0.015731763,0.0019791708,0.96935844,0.010607322,0.000021261427],"about_ca_topic_score_codex":0.0010350326,"about_ca_topic_score_gemma":0.0011136741,"teacher_disagreement_score":0.011173973,"about_ca_system_score_codex":0.0009893572,"about_ca_system_score_gemma":0.00038584817,"threshold_uncertainty_score":0.037380636},"labels":[],"label_agreement":null},{"id":"W2767562605","doi":"10.37236/109","title":"On a Problem of Marco Buratti","year":2009,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","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":"McMaster University","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01356816524068383,"score_gpt":0.2845898947932947,"score_spread":0.2710217295526109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767562605","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08703065,0.017430991,0.26008043,0.32582206,0.009530995,0.00027953106,0.0007376027,0.0005351074,0.2985527],"genre_scores_gemma":[0.66334844,0.015260326,0.15130393,0.023587754,0.009893518,0.00048516123,0.0009201844,0.0005415023,0.1346592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851054,0.0006826183,0.00003915914,0.00033647378,0.00020322266,0.00022798788],"domain_scores_gemma":[0.9970348,0.0022096785,0.0001298336,0.00017607646,0.00017657925,0.00027307455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017483332,0.00075930223,0.0011390575,0.0007994549,0.005340469,0.0027023093,0.0015715095,0.0052601313,0.010133768],"category_scores_gemma":[0.01041709,0.0007002485,0.0011574471,0.0018166404,0.0046245377,0.008122519,0.0036377523,0.00676644,0.0018807397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089573456,0.00005334997,0.00017191387,0.0001356681,0.000013886321,0.00017216425,0.00048535576,0.0038709869,0.00031739168,0.92719907,0.053948805,0.013541747],"study_design_scores_gemma":[0.000066080764,0.00004145242,0.00016205352,0.00008317334,0.000013636302,0.00015342861,0.00033937002,0.008127105,0.00038825008,0.91337085,0.07722566,0.000028914617],"about_ca_topic_score_codex":0.004021594,"about_ca_topic_score_gemma":0.0024895736,"teacher_disagreement_score":0.010133768,"about_ca_system_score_codex":0.0026087936,"about_ca_system_score_gemma":0.0016405081,"threshold_uncertainty_score":0.033900857},"labels":[],"label_agreement":null},{"id":"W2767596174","doi":"","title":"Molecular graphs with extremal first geometric-arithmetic index.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Arithmetic; Discrete mathematics; Computer science","score_opus":0.022571108241076356,"score_gpt":0.27306227359960106,"score_spread":0.2504911653585247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767596174","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.491118,0.0020168496,0.09439217,0.0041378764,0.00091205776,0.00008362559,0.0015286494,0.00095045887,0.4048603],"genre_scores_gemma":[0.9602397,0.0006686265,0.014009342,0.000538116,0.00031848825,0.00006324163,0.0005185897,0.00015976612,0.023484271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996119,0.000073195326,0.0000132800815,0.00007812323,0.00012557709,0.000097943084],"domain_scores_gemma":[0.99904126,0.00029640694,0.00020540967,0.00016395704,0.00012537978,0.00016750347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035017726,0.0004569512,0.0005278121,0.0020986693,0.0013394004,0.0027291065,0.0009683785,0.0013277947,0.014489015],"category_scores_gemma":[0.0021823964,0.0002989957,0.0003313481,0.00094489276,0.0018645391,0.0034789597,0.0018226018,0.0018117902,0.0022951313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003331706,0.000016178348,0.00018057162,0.000039366263,0.0000045420898,0.00006463993,0.00006303749,0.00060192484,0.0012283466,0.9898936,0.0025906707,0.0052837683],"study_design_scores_gemma":[0.000008817935,0.000014126892,0.00037908004,0.00001687916,0.0000072857215,0.00018614228,0.000077034245,0.0030367207,0.0010085017,0.9903656,0.0048872684,0.000012389908],"about_ca_topic_score_codex":0.00040217183,"about_ca_topic_score_gemma":0.0007364166,"teacher_disagreement_score":0.014489015,"about_ca_system_score_codex":0.00093379366,"about_ca_system_score_gemma":0.000462535,"threshold_uncertainty_score":0.048470616},"labels":[],"label_agreement":null},{"id":"W2770811529","doi":"10.1016/j.dam.2018.01.004","title":"On (distance) Laplacian energy and (distance) signless Laplacian energy of graphs","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"National Research Foundation of Korea; Sungkyunkwan University","keywords":"Combinatorics; Mathematics; Laplacian matrix; Distance matrix; Laplace operator; Resistance distance; Adjacency matrix; Algebraic connectivity; Discrete mathematics; Simple graph; Graph energy; Graph; Line graph; Voltage graph; Graph power; Mathematical analysis","score_opus":0.016012359617211754,"score_gpt":0.26088804628445683,"score_spread":0.24487568666724507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770811529","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5161257,0.0065800934,0.33999562,0.009704756,0.0013532276,0.0000629813,0.00045333628,0.0001753344,0.12554902],"genre_scores_gemma":[0.9464717,0.0029130431,0.02083379,0.0011689331,0.001284918,0.00007741351,0.0003151414,0.00016111482,0.026773863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933356,0.00022981741,0.000027632728,0.00012271677,0.00020974422,0.00007640687],"domain_scores_gemma":[0.9964774,0.0020146726,0.00034689857,0.0002662696,0.00042484887,0.00046995794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012568868,0.0007727668,0.00079400826,0.0027836056,0.0010224242,0.0020803628,0.0016751185,0.0020743574,0.0070626917],"category_scores_gemma":[0.008243786,0.00032099863,0.00056239276,0.001748345,0.0039449944,0.0055058105,0.002739076,0.0022277345,0.0006587294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002295094,0.000021089749,0.00027825212,0.00005874079,0.000007460949,0.000052916777,0.0001331028,0.003505702,0.00070427096,0.98964393,0.0010452168,0.0045263222],"study_design_scores_gemma":[0.0000040677473,0.000010642532,0.00023968465,0.000012698086,0.0000035821104,0.000063842774,0.00006972355,0.01248528,0.000106269086,0.9861936,0.00080218486,0.000008384906],"about_ca_topic_score_codex":0.0004945101,"about_ca_topic_score_gemma":0.00046360344,"teacher_disagreement_score":0.0070626917,"about_ca_system_score_codex":0.0009180199,"about_ca_system_score_gemma":0.0003484639,"threshold_uncertainty_score":0.023627102},"labels":[],"label_agreement":null},{"id":"W2781050708","doi":"10.1016/j.jde.2017.12.018","title":"Degree counting and Shadow system for Toda system of rank two: One bubbling","year":2017,"lang":"en","type":"article","venue":"Journal of Differential Equations","topic":"Graph theory and applications","field":"Mathematics","cited_by":28,"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":"Degree (music); Shadow (psychology); Rank (graph theory); Mathematics; Point (geometry); Dirac (video compression format); Sequence (biology); Pure mathematics; Topology (electrical circuits); Combinatorics; Geometry; Physics","score_opus":0.12988113461040235,"score_gpt":0.34627572226274894,"score_spread":0.2163945876523466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2781050708","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86046404,0.0008085033,0.09328795,0.001326994,0.00048009897,0.00007350356,0.00043202646,0.00048435334,0.042642612],"genre_scores_gemma":[0.97747874,0.00030552337,0.010453454,0.00020059828,0.00022993004,0.00006571555,0.00034851293,0.00012268456,0.01079497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994874,0.0000981361,0.000032061263,0.00011441269,0.0001159002,0.00015201297],"domain_scores_gemma":[0.99854064,0.0003000947,0.00016691878,0.00019350123,0.0002171234,0.0005817235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007010705,0.0006896914,0.001914766,0.0031181523,0.003657385,0.0029877906,0.0016594724,0.0021279491,0.0066821007],"category_scores_gemma":[0.0029239557,0.0005545095,0.00089971477,0.0011933958,0.0027106137,0.0041774926,0.002362299,0.0014110034,0.0005283235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076306365,0.000030440815,0.0007008569,0.00004765685,0.000010227863,0.00021368793,0.00023985286,0.0028186534,0.0015198484,0.9905319,0.0014420875,0.0023683049],"study_design_scores_gemma":[0.00003269137,0.000034783225,0.0006478267,0.000015529575,0.000014574975,0.0002432974,0.00017570761,0.045252115,0.0005896077,0.95149076,0.0014614679,0.000041593317],"about_ca_topic_score_codex":0.0025120596,"about_ca_topic_score_gemma":0.0019435892,"teacher_disagreement_score":0.0066821007,"about_ca_system_score_codex":0.0014365326,"about_ca_system_score_gemma":0.0011535925,"threshold_uncertainty_score":0.022353828},"labels":[],"label_agreement":null},{"id":"W2782679454","doi":"10.1016/j.disc.2018.05.014","title":"On the roots of Wiener polynomials of graphs","year":2018,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","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; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Wiener index; Closure (psychology); Order (exchange); Polynomial; Graph; Discrete mathematics; Mathematical analysis","score_opus":0.05401071563895392,"score_gpt":0.32432745570121224,"score_spread":0.2703167400622583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782679454","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5067312,0.006926725,0.34855202,0.005829454,0.0014246181,0.00007773942,0.0005611578,0.00040666247,0.12949048],"genre_scores_gemma":[0.9339756,0.0038575055,0.022674939,0.00050884415,0.0014676017,0.0000543997,0.00025355295,0.0002869911,0.036920656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992919,0.00020768795,0.000020632664,0.00014200997,0.0001885188,0.00014923365],"domain_scores_gemma":[0.99791974,0.0010996201,0.00028113314,0.00015192865,0.0002276475,0.00031988625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010070968,0.001182709,0.0010026643,0.0033858456,0.0010814185,0.0026687027,0.001194048,0.0012377099,0.007667627],"category_scores_gemma":[0.00788674,0.0005212953,0.0006862211,0.0022457242,0.0038766651,0.0047732876,0.002498542,0.002890257,0.0014569146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003881334,0.000014791303,0.00022942552,0.000057456185,0.000007312917,0.00005282653,0.00022826839,0.0027357943,0.00096274295,0.9846377,0.0014993504,0.009535537],"study_design_scores_gemma":[0.0000067727965,0.0000066359803,0.00014879803,0.000014439182,0.0000039052197,0.000034329787,0.00004926335,0.0058798343,0.00017000175,0.99219817,0.0014795096,0.000008312802],"about_ca_topic_score_codex":0.0014879105,"about_ca_topic_score_gemma":0.0015282902,"teacher_disagreement_score":0.007667627,"about_ca_system_score_codex":0.0013657386,"about_ca_system_score_gemma":0.000661917,"threshold_uncertainty_score":0.0256508},"labels":[],"label_agreement":null},{"id":"W2784072063","doi":"10.1109/cdc.2017.8263796","title":"The control of arbitrary size networks of linear systems via graphon limits: An initial investigation","year":2017,"lang":"en","type":"article","venue":"","topic":"Graph theory and applications","field":"Mathematics","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":"McGill University","funders":"","keywords":"Controllability; Limit (mathematics); Sequence (biology); Computer science; State (computer science); Control system; Control (management); Linear system; Upper and lower bounds; Discrete mathematics; Task (project management); Theoretical computer science; Algorithm; Mathematics; Applied mathematics; Artificial intelligence","score_opus":0.04524923450985712,"score_gpt":0.31482266410315635,"score_spread":0.2695734295932992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784072063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20319888,0.0018903315,0.7753087,0.0013891605,0.00008515578,0.000070304966,0.000042265667,0.00016267065,0.0178525],"genre_scores_gemma":[0.96152043,0.0010083301,0.03370477,0.00009655054,0.000035455196,0.00007724249,0.000032210148,0.000022521463,0.0035025596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979264,0.00007722298,0.0000066451275,0.000040511695,0.000058667854,0.000024343823],"domain_scores_gemma":[0.9988424,0.0008288554,0.00007290909,0.00006563712,0.0001345419,0.00005572218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077709416,0.000285802,0.00031217324,0.00024635778,0.00029619338,0.0005558406,0.00048882794,0.000590337,0.001334985],"category_scores_gemma":[0.003038647,0.00014334991,0.00027725115,0.00019412744,0.0011225925,0.0013215502,0.00056486827,0.0007555445,0.00008493844],"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.00011208334,0.00005804834,0.0008741018,0.00018197762,0.000030556002,0.00011876798,0.00024169561,0.6846522,0.0068368064,0.28212512,0.0007822373,0.023986405],"study_design_scores_gemma":[0.000006949783,0.00009234635,0.00023654941,0.000016166112,0.000006356088,0.00003383191,0.000052689924,0.9404291,0.0015756228,0.05569075,0.0018502743,0.000009319556],"about_ca_topic_score_codex":0.0016311497,"about_ca_topic_score_gemma":0.0015375562,"teacher_disagreement_score":0.0016311497,"about_ca_system_score_codex":0.00052125903,"about_ca_system_score_gemma":0.0002908466,"threshold_uncertainty_score":0.004465997},"labels":[],"label_agreement":null},{"id":"W2784290514","doi":"10.1016/j.jco.2018.05.004","title":"The rank of random regular digraphs of constant degree","year":2018,"lang":"en","type":"preprint","venue":"Journal of Complexity","topic":"Graph theory and applications","field":"Mathematics","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 Alberta","funders":"Agence Nationale de la Recherche","keywords":"Combinatorics; Adjacency matrix; Mathematics; Rank (graph theory); Degree (music); Eigenvalues and eigenvectors; Infinity; Constant (computer programming); Graph; Integer (computer science); Regular graph; Simple (philosophy); Adjacency list; Random graph; Discrete mathematics; Simple graph; Directed graph; Line graph; Graph power; Computer science; Physics","score_opus":0.1607622231782364,"score_gpt":0.35309317971431053,"score_spread":0.19233095653607413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784290514","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8675678,0.0013539594,0.10348109,0.0053265877,0.00019825043,0.00007901214,0.0026407463,0.00063414796,0.018718336],"genre_scores_gemma":[0.98809683,0.00047411997,0.0045605325,0.00027358253,0.00031622226,0.000050688388,0.0006274097,0.0001370364,0.005463631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972216,0.0010239689,0.00011509845,0.0005814339,0.00063850323,0.0004194997],"domain_scores_gemma":[0.96344346,0.023458226,0.0046712267,0.0028951964,0.001872332,0.0036595955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00240933,0.0010003839,0.00188486,0.0041689947,0.0015817599,0.0064209257,0.0023982534,0.0026029067,0.0073557007],"category_scores_gemma":[0.030289203,0.0013512482,0.00068432913,0.0022624505,0.0040420513,0.008292453,0.0023518307,0.002323628,0.0008020194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055319606,0.000105783714,0.004873909,0.00032774566,0.00008756999,0.00030610934,0.0006856458,0.029961593,0.002578471,0.94134736,0.007338383,0.01183411],"study_design_scores_gemma":[0.00006753919,0.000053421685,0.0011837225,0.00004786794,0.00004455511,0.00029254178,0.0002012235,0.08961895,0.0006943506,0.90621006,0.0015299601,0.000055784352],"about_ca_topic_score_codex":0.0013820194,"about_ca_topic_score_gemma":0.0018762964,"teacher_disagreement_score":0.0073557007,"about_ca_system_score_codex":0.0018365191,"about_ca_system_score_gemma":0.0009833182,"threshold_uncertainty_score":0.024607241},"labels":[],"label_agreement":null},{"id":"W2789910199","doi":"","title":"Some New Upper Bounds on the Wiener and Edge Wiener Index of k-Connected Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Index (typography); Enhanced Data Rates for GSM Evolution; Combinatorics; Upper and lower bounds; Discrete mathematics; Graph; Mathematical analysis; Telecommunications; Computer science","score_opus":0.023855923244972863,"score_gpt":0.2704288971248488,"score_spread":0.24657297387987592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789910199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14122975,0.026665147,0.53963214,0.004261233,0.002213862,0.00015326704,0.0026030177,0.0016039681,0.28163767],"genre_scores_gemma":[0.78764874,0.015322137,0.14834757,0.002030946,0.004063586,0.00050503993,0.0022472553,0.0014317483,0.03840284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847597,0.00026045466,0.0001168096,0.00031478974,0.0005416324,0.00029043434],"domain_scores_gemma":[0.9877517,0.008059153,0.000871069,0.0010975655,0.0009607215,0.0012597081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026475377,0.002080729,0.0015710008,0.007753057,0.0017737858,0.005002182,0.0031067613,0.0021145632,0.013422154],"category_scores_gemma":[0.018640608,0.0010484168,0.0015541391,0.0051064785,0.0034573216,0.012734633,0.0050457637,0.0071653253,0.0037512095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015617028,0.00010182614,0.0013733322,0.0003765037,0.00006485952,0.00020141168,0.0005201944,0.0064903456,0.0052319397,0.94079554,0.0102985725,0.034389324],"study_design_scores_gemma":[0.000011992519,0.000029447861,0.0011454703,0.00011535255,0.000057550587,0.00023687592,0.00011900867,0.022556063,0.0024515153,0.96296614,0.010256803,0.000053757558],"about_ca_topic_score_codex":0.0006339399,"about_ca_topic_score_gemma":0.0013701258,"teacher_disagreement_score":0.013422154,"about_ca_system_score_codex":0.002260432,"about_ca_system_score_gemma":0.00058456714,"threshold_uncertainty_score":0.04490161},"labels":[],"label_agreement":null},{"id":"W2790008489","doi":"","title":"On the harmonic index of quasi-tree graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Tree (set theory); Harmonic; Combinatorics; Discrete mathematics; Acoustics; Computer science; Physics; World Wide Web","score_opus":0.02961291843188532,"score_gpt":0.2841706048881804,"score_spread":0.25455768645629506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790008489","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49728954,0.005916287,0.18472901,0.0054215263,0.0015499712,0.000074791365,0.00094455347,0.00031677936,0.30375767],"genre_scores_gemma":[0.9408734,0.0028372363,0.019457895,0.0007720072,0.0011667222,0.00008401853,0.0005174127,0.00026078426,0.03403056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954885,0.00011200126,0.000019678075,0.0000833066,0.00013649707,0.00009955597],"domain_scores_gemma":[0.99749655,0.0013355068,0.0003192168,0.0002147525,0.00026202272,0.00037175685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007540236,0.00040096545,0.0006245117,0.0030622433,0.001345358,0.0025896623,0.0012238899,0.0012251175,0.010541462],"category_scores_gemma":[0.0051918086,0.00029015035,0.00034090402,0.0017162896,0.0023380693,0.006286541,0.0020284487,0.0020278022,0.0017167332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022068583,0.0000117134305,0.00027871845,0.00002970746,0.000004032314,0.00002796651,0.00012595838,0.00073601,0.0006115681,0.9897759,0.0020415364,0.0063347877],"study_design_scores_gemma":[0.0000062782583,0.00000947487,0.0004243786,0.000019916313,0.0000057101693,0.000082146136,0.000113726266,0.0064872666,0.0002873596,0.98893654,0.003618607,0.0000086423015],"about_ca_topic_score_codex":0.001146834,"about_ca_topic_score_gemma":0.001292186,"teacher_disagreement_score":0.010541462,"about_ca_system_score_codex":0.0014061888,"about_ca_system_score_gemma":0.00039438138,"threshold_uncertainty_score":0.03526473},"labels":[],"label_agreement":null},{"id":"W2790565012","doi":"","title":"Rank of the Hermitian-adjacency matrix of a mixed graph in terms of matching number.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hermitian matrix; Adjacency matrix; Rank (graph theory); Combinatorics; Matching (statistics); Graph; Matrix (chemical analysis); Discrete mathematics; Pure mathematics; Statistics","score_opus":0.01640992588016643,"score_gpt":0.29863082022717624,"score_spread":0.2822208943470098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790565012","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6547411,0.0019429764,0.26636428,0.0024029515,0.00048377283,0.000089377165,0.002072683,0.00083729276,0.07106557],"genre_scores_gemma":[0.96514535,0.00042963895,0.02123755,0.0002103829,0.0002856924,0.000075855605,0.00048364003,0.00014636757,0.011985571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993136,0.00023633036,0.000033220902,0.00013766043,0.0001671012,0.000112094895],"domain_scores_gemma":[0.9950728,0.0021873943,0.00091325666,0.00047790457,0.00066176,0.0006868951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093030545,0.0006573128,0.00053362444,0.0027339037,0.0006319474,0.0020091964,0.00114607,0.0008130749,0.011714084],"category_scores_gemma":[0.005337805,0.0003169916,0.0003188766,0.0010312309,0.0016225693,0.003257191,0.0010504053,0.0010328148,0.0015064634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019057798,0.00008853618,0.001908225,0.00013969337,0.000044658223,0.0002107272,0.00021070751,0.0072371163,0.0079035675,0.96064633,0.0064546973,0.014965231],"study_design_scores_gemma":[0.000023250057,0.000064431726,0.0024015987,0.000049861872,0.000026395335,0.0005183994,0.00016940534,0.09061428,0.003142553,0.89859384,0.0043327464,0.00006335614],"about_ca_topic_score_codex":0.00045731154,"about_ca_topic_score_gemma":0.000954498,"teacher_disagreement_score":0.011714084,"about_ca_system_score_codex":0.00056951446,"about_ca_system_score_gemma":0.0005270279,"threshold_uncertainty_score":0.03918749},"labels":[],"label_agreement":null},{"id":"W2792756847","doi":"","title":"Subgraph Component Polynomials Of Some Compound Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Component (thermodynamics); Combinatorics; Physics","score_opus":0.03024248674765808,"score_gpt":0.29254198734618153,"score_spread":0.26229950059852347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792756847","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54925424,0.0010389057,0.25198063,0.0021805607,0.00042550632,0.0001450766,0.0017445192,0.00049467816,0.1927359],"genre_scores_gemma":[0.9459135,0.00061472354,0.023888614,0.00022310103,0.00023270874,0.00006438903,0.00069808,0.000160833,0.028204028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997124,0.000058841495,0.000007902338,0.00007054027,0.00008593108,0.00006442457],"domain_scores_gemma":[0.99921477,0.00031154382,0.00012015128,0.00009286386,0.00015353608,0.000107048465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000298522,0.0003970367,0.0003983253,0.0014064695,0.0007966164,0.0012076676,0.00057208893,0.00043261956,0.012225096],"category_scores_gemma":[0.0017353739,0.00020321042,0.0004462962,0.0014768731,0.0012464694,0.001804578,0.0008164179,0.0014917423,0.0015531124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049693506,0.000023961056,0.0005095769,0.000073263924,0.000012134583,0.00017726752,0.00019658175,0.001974339,0.0023678613,0.9752632,0.005284353,0.014067782],"study_design_scores_gemma":[0.00002147665,0.000031022202,0.0013637551,0.000019999643,0.000025934409,0.00044299377,0.0001727783,0.020516299,0.0021146985,0.96054536,0.014726218,0.000019430145],"about_ca_topic_score_codex":0.0019826102,"about_ca_topic_score_gemma":0.0032254248,"teacher_disagreement_score":0.012225096,"about_ca_system_score_codex":0.0011511161,"about_ca_system_score_gemma":0.0005804725,"threshold_uncertainty_score":0.04089701},"labels":[],"label_agreement":null},{"id":"W2794133300","doi":"","title":"Bipartite graphs with every k-matching in a Hamiltonian cycle.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Hamiltonian path; Combinatorics; Matching (statistics); Hamiltonian (control theory); Complete bipartite graph; Pancyclic graph; Discrete mathematics; Chordal graph; Graph; 1-planar graph; Statistics; Mathematical optimization","score_opus":0.017341850816953778,"score_gpt":0.27518320199856194,"score_spread":0.25784135118160817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794133300","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45998842,0.001438045,0.24074277,0.004158907,0.00097547635,0.00037698736,0.005294658,0.0011685303,0.28585622],"genre_scores_gemma":[0.87231207,0.00070276397,0.064960055,0.00137388,0.00028951635,0.00033198387,0.0033107363,0.00028281318,0.05643616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992545,0.0001679204,0.00004999195,0.00023032074,0.0001042379,0.00019292015],"domain_scores_gemma":[0.99843305,0.0004671185,0.0003060614,0.0002971265,0.00021400586,0.00028262247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042214515,0.0005464887,0.0007418455,0.0009842812,0.002361799,0.0020263707,0.0013846832,0.0020984195,0.025624875],"category_scores_gemma":[0.0030374108,0.0006709088,0.00083588756,0.0015560596,0.0013556082,0.0038292063,0.0022644354,0.0017134954,0.00463529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003303288,0.00016679024,0.0011766274,0.00039641457,0.000087773755,0.00077563076,0.00048762196,0.0022845154,0.008416519,0.9418359,0.01772741,0.02631448],"study_design_scores_gemma":[0.000063565494,0.000041946292,0.00097133924,0.000073965675,0.000064284,0.000789813,0.0003934823,0.00722564,0.0024210562,0.9695431,0.018387133,0.00002455675],"about_ca_topic_score_codex":0.0012262475,"about_ca_topic_score_gemma":0.0016245169,"teacher_disagreement_score":0.025624875,"about_ca_system_score_codex":0.00066453475,"about_ca_system_score_gemma":0.0008443346,"threshold_uncertainty_score":0.08572376},"labels":[],"label_agreement":null},{"id":"W2794154631","doi":"","title":"On the Spectral Moment of Quasi-trees and Quasi-unicyclic Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Moment (physics); Combinatorics; Physics; Quantum mechanics","score_opus":0.024544570364443134,"score_gpt":0.28228721636879345,"score_spread":0.2577426460043503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794154631","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54775256,0.009411524,0.2681266,0.009516795,0.0016983539,0.00006294481,0.0009343629,0.000510634,0.16198623],"genre_scores_gemma":[0.9723302,0.002117417,0.011401717,0.0006207753,0.0012495202,0.000064407104,0.00027753893,0.00015293542,0.011785463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993919,0.00020863922,0.000023306473,0.000107315755,0.00012924582,0.00013947044],"domain_scores_gemma":[0.99440575,0.003439892,0.0006753051,0.0003452514,0.00043385162,0.0006998796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011864462,0.000497552,0.0009116378,0.002956795,0.0013519851,0.0023604038,0.0013496277,0.0013899633,0.009579452],"category_scores_gemma":[0.008649279,0.00043559796,0.0005842714,0.0017815442,0.0032993192,0.0053543244,0.0018504902,0.0021741404,0.0011703299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031432344,0.0000134323545,0.00019254847,0.00003436827,0.0000051548936,0.000038496953,0.00011672899,0.001268269,0.0005182968,0.9932668,0.0018739385,0.0026404827],"study_design_scores_gemma":[0.00000810965,0.000011794228,0.0003090197,0.000021866257,0.0000062606778,0.00010550306,0.000090055844,0.010925146,0.00022039405,0.9865305,0.0017594295,0.000012027743],"about_ca_topic_score_codex":0.00091044547,"about_ca_topic_score_gemma":0.0010863448,"teacher_disagreement_score":0.009579452,"about_ca_system_score_codex":0.0013594112,"about_ca_system_score_gemma":0.0004557584,"threshold_uncertainty_score":0.032046437},"labels":[],"label_agreement":null},{"id":"W2794213857","doi":"","title":"On the largest real root of independence polynomials of trees.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Root (linguistics); Independence (probability theory); Statistics; Linguistics","score_opus":0.028252631643615227,"score_gpt":0.2964323801444416,"score_spread":0.2681797485008264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794213857","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38337043,0.0066713654,0.3451693,0.008958901,0.0010170537,0.00006938022,0.0014146217,0.000517303,0.25281176],"genre_scores_gemma":[0.9536252,0.0020007757,0.022892071,0.00056654593,0.0011734129,0.000046320212,0.0005397779,0.00016780478,0.018988172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925905,0.00023727903,0.000022246522,0.0001495707,0.0001730034,0.00015884134],"domain_scores_gemma":[0.99300694,0.0051257415,0.0005632391,0.00037246707,0.00041156827,0.0005200661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001017218,0.00053794176,0.0007006056,0.0018609875,0.0012076367,0.0018589522,0.000907385,0.000908975,0.009135162],"category_scores_gemma":[0.010051638,0.0004830661,0.0005651914,0.0016814243,0.0035270099,0.0043695723,0.0017306941,0.0041615106,0.0018912347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008046193,0.000034484216,0.00052936544,0.00012865444,0.000012658709,0.00010425365,0.00029868045,0.002164565,0.001295753,0.97210884,0.0065295105,0.016712796],"study_design_scores_gemma":[0.000013557436,0.000012106617,0.00053370616,0.00002042009,0.000010072505,0.00013799049,0.00007029069,0.0052933064,0.00036792058,0.99012417,0.00340542,0.0000110422125],"about_ca_topic_score_codex":0.0014839966,"about_ca_topic_score_gemma":0.0019891567,"teacher_disagreement_score":0.009135162,"about_ca_system_score_codex":0.0010077644,"about_ca_system_score_gemma":0.000574356,"threshold_uncertainty_score":0.030560136},"labels":[],"label_agreement":null},{"id":"W2794409369","doi":"","title":"On the sum of the squares of all distances in bipartite graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Explained sum of squares; Cograph; Discrete mathematics; Statistics; Chordal graph; 1-planar graph; Graph","score_opus":0.029112963078660386,"score_gpt":0.29037175031374907,"score_spread":0.26125878723508866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794409369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17804268,0.0061303736,0.7343517,0.0057892227,0.0013283073,0.00009537754,0.0016988693,0.00066410773,0.07189941],"genre_scores_gemma":[0.74361384,0.0046699937,0.204555,0.0018787483,0.0028032085,0.00034827786,0.0021089579,0.0012812072,0.038740847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760973,0.0011095328,0.0001100777,0.00044769832,0.00051625725,0.0002066476],"domain_scores_gemma":[0.9868896,0.010112712,0.00076052354,0.00089341326,0.0007052974,0.00063857035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024802338,0.0012824349,0.001515966,0.0026222763,0.0011268525,0.0022867783,0.0029290523,0.0018742791,0.009183643],"category_scores_gemma":[0.019264478,0.0007603521,0.00085046317,0.0025083679,0.0033911092,0.0083228955,0.0032302209,0.0036147782,0.0021743733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015164579,0.000070455084,0.0013512407,0.0003095551,0.00009137055,0.00013877751,0.00034212516,0.021777805,0.0017502429,0.91273373,0.017812995,0.04347013],"study_design_scores_gemma":[0.0000131429815,0.000021664982,0.0006374774,0.000041222764,0.000023977243,0.00020620956,0.0000876389,0.050061535,0.00045325412,0.9450792,0.003352704,0.000022057358],"about_ca_topic_score_codex":0.0013797402,"about_ca_topic_score_gemma":0.001960202,"teacher_disagreement_score":0.009183643,"about_ca_system_score_codex":0.0012517428,"about_ca_system_score_gemma":0.00058181485,"threshold_uncertainty_score":0.03072238},"labels":[],"label_agreement":null},{"id":"W2796365873","doi":"10.1109/jproc.2018.2821924","title":"Electrical Networks and Algebraic Graph Theory: Models, Properties, and Applications","year":2018,"lang":"en","type":"article","venue":"Proceedings of the IEEE","topic":"Graph theory and applications","field":"Mathematics","cited_by":228,"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; Eidgenössische Technische Hochschule Zürich; Solar Energy Technologies Program; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Spectral graph theory; Algebraic graph theory; Electrical network; Algebraic connectivity; Graph theory; Computer science; Electronic circuit; Topology (electrical circuits); Adjacency list; Laplacian matrix; Mathematics; Graph; Theoretical computer science; Voltage graph; Line graph; Algorithm; Electrical engineering; Engineering","score_opus":0.037561223400352575,"score_gpt":0.24112460524986035,"score_spread":0.20356338184950779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796365873","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052533656,0.030481124,0.7975728,0.016650314,0.0005019965,0.000119703574,0.00069042895,0.00024857526,0.10120148],"genre_scores_gemma":[0.7930731,0.049941693,0.13740462,0.0016111516,0.0024121064,0.00038258356,0.00079332077,0.00010408792,0.014277308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993193,0.00025838253,0.000033600096,0.00013538722,0.00019977073,0.000053518885],"domain_scores_gemma":[0.99787176,0.0013373113,0.0002434993,0.00016114562,0.00028311624,0.0001031692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008067118,0.00049253553,0.0005218971,0.0018937933,0.0009666737,0.002663304,0.00082545844,0.0011016657,0.0028723574],"category_scores_gemma":[0.0031828631,0.0003129116,0.00056289794,0.0024629813,0.003265878,0.0058292733,0.001161738,0.0018199682,0.00045472514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017484157,0.000004794523,0.0001151308,0.00003955663,0.0000032948692,0.000017021128,0.00005421238,0.0038903144,0.000100062294,0.99111825,0.000694998,0.0039605517],"study_design_scores_gemma":[0.0000023479863,0.00000573287,0.000120565,0.000024284329,0.000003596987,0.00007059265,0.00005699369,0.01704306,0.00007129296,0.9721286,0.01046712,0.0000058155465],"about_ca_topic_score_codex":0.0018198253,"about_ca_topic_score_gemma":0.001561043,"teacher_disagreement_score":0.0028723574,"about_ca_system_score_codex":0.0016871305,"about_ca_system_score_gemma":0.00066127634,"threshold_uncertainty_score":0.012241006},"labels":[],"label_agreement":null},{"id":"W2799119604","doi":"10.55016/ojs/cdm.v15i2.62327","title":"A method to determine algebraically integral Cayley digraphs on finite abelian group","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"Cayley graph; Mathematics; Cayley transform; Abelian group; Cayley's theorem; Combinatorics; Eigenvalues and eigenvectors; Commutative property; Algebraic number; Finite field; Group (periodic table); Discrete mathematics; Graph; Mathematical analysis","score_opus":0.041047431846359034,"score_gpt":0.34807745104441473,"score_spread":0.3070300191980557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799119604","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.06524788,0.00033003744,0.91824704,0.00023006198,0.0001510812,0.00020876223,0.00036510453,0.00094182655,0.0142782945],"genre_scores_gemma":[0.2523817,0.00031086188,0.7398378,0.0001318746,0.00008531753,0.00019406507,0.00056701014,0.00017197673,0.006319447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996766,0.00007609447,0.000027898735,0.00009076092,0.00009076118,0.000037897364],"domain_scores_gemma":[0.99904746,0.00031035865,0.000083803585,0.00020515018,0.0002494016,0.00010381456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042960697,0.0005653773,0.00049571384,0.0031846913,0.0010443347,0.0010944006,0.00075468037,0.000507275,0.003998016],"category_scores_gemma":[0.0023514524,0.00036337887,0.0006243855,0.0015445153,0.0010299339,0.0016547589,0.0009917349,0.001115546,0.001111187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015900841,0.00021395985,0.004286651,0.00036737614,0.00009181531,0.00047802555,0.00093790825,0.014118909,0.04869867,0.6527754,0.008101131,0.26977098],"study_design_scores_gemma":[0.00010698897,0.00026541288,0.0028436717,0.00010200502,0.00008055645,0.0009698461,0.0005866028,0.20609921,0.02463902,0.72235763,0.041774835,0.00017415365],"about_ca_topic_score_codex":0.0012643286,"about_ca_topic_score_gemma":0.0024658684,"teacher_disagreement_score":0.003998016,"about_ca_system_score_codex":0.0005893012,"about_ca_system_score_gemma":0.0008724158,"threshold_uncertainty_score":0.013374686},"labels":[],"label_agreement":null},{"id":"W2799429911","doi":"10.1016/j.laa.2018.09.016","title":"An analog of Matrix Tree Theorem for signless Laplacians","year":2018,"lang":"en","type":"preprint","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Laplacian matrix; Spanning tree; Bipartite graph; Discrete mathematics; Graph; Connectivity","score_opus":0.037220487319705675,"score_gpt":0.34982220177507883,"score_spread":0.31260171445537316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799429911","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096223004,0.002947651,0.6781261,0.008448377,0.0029309797,0.00009759473,0.0007044622,0.00083759986,0.20968421],"genre_scores_gemma":[0.8159403,0.0027447108,0.095412865,0.0053700944,0.004265268,0.0001627835,0.0006229605,0.0006896334,0.07479135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994955,0.00012531746,0.00002484564,0.00012225033,0.0001753806,0.00005666089],"domain_scores_gemma":[0.99907804,0.00028127563,0.0001228514,0.00012831706,0.00025227747,0.00013723125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007401592,0.000593885,0.00073345756,0.0022208157,0.0012328628,0.0024142645,0.0013836932,0.0017043379,0.012970119],"category_scores_gemma":[0.0029300302,0.0002934699,0.00084573164,0.001623913,0.002175348,0.0052494705,0.0016190615,0.0024428105,0.0019137001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000614161,0.0000086525715,0.000043278043,0.000030599967,0.0000036318772,0.00003408537,0.000058153946,0.000277779,0.0008562713,0.9935586,0.001811332,0.0033115344],"study_design_scores_gemma":[0.000004038729,0.00000621294,0.000051324354,0.000005354219,0.0000024185792,0.00008395784,0.000020310707,0.0029070838,0.00017847813,0.9945058,0.0022294752,0.0000055662376],"about_ca_topic_score_codex":0.0006848785,"about_ca_topic_score_gemma":0.0006656754,"teacher_disagreement_score":0.012970119,"about_ca_system_score_codex":0.00073456514,"about_ca_system_score_gemma":0.0005162014,"threshold_uncertainty_score":0.04338938},"labels":[],"label_agreement":null},{"id":"W2807469515","doi":"","title":"On the nullity of bicyclic graphs","year":2008,"lang":"en","type":"article","venue":"HKBU Institutional Repository (Hong Kong Baptist University)","topic":"Graph theory and applications","field":"Mathematics","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":"Toronto Metropolitan University","funders":"","keywords":"Bicyclic molecule; Combinatorics; Eigenvalues and eigenvectors; Multiplicity (mathematics); Vertex (graph theory); Graph; Mathematics; Discrete mathematics; Chemistry; Physics; Stereochemistry; Mathematical analysis","score_opus":0.04195932457608987,"score_gpt":0.22572281679174844,"score_spread":0.18376349221565857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807469515","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94031906,0.00058655086,0.038700476,0.00050186005,0.000035165576,0.00002897998,0.00050938514,0.00009922554,0.019219367],"genre_scores_gemma":[0.99477863,0.00023531959,0.003166307,0.000057072393,0.000043244167,0.000028003891,0.00036968698,0.000031687567,0.0012900372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998684,0.00039448604,0.00010327061,0.00024783777,0.00032626843,0.00024408709],"domain_scores_gemma":[0.9895536,0.00530275,0.0015541366,0.00091636763,0.0014017316,0.0012713566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014645542,0.0005765079,0.000766399,0.003808378,0.0017683214,0.0024293985,0.0011972626,0.00070260616,0.0030804381],"category_scores_gemma":[0.008191051,0.00044892434,0.00043783142,0.0015534009,0.0034123769,0.003097919,0.0022765636,0.0011400784,0.00037369464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006749446,0.00008528922,0.010059792,0.00021401318,0.000054857665,0.00044471677,0.0010527289,0.011975465,0.013465065,0.94421256,0.0018762528,0.015884284],"study_design_scores_gemma":[0.000039013023,0.00009142239,0.0031724174,0.000072908035,0.000024522185,0.00045536726,0.00057650753,0.03963964,0.0043155984,0.94912446,0.0024349263,0.00005317163],"about_ca_topic_score_codex":0.00068266806,"about_ca_topic_score_gemma":0.0005771701,"teacher_disagreement_score":0.003808378,"about_ca_system_score_codex":0.000933011,"about_ca_system_score_gemma":0.00041027786,"threshold_uncertainty_score":0.010305047},"labels":[],"label_agreement":null},{"id":"W2808171719","doi":"10.1016/j.laa.2018.06.015","title":"The algebraic connectivity of a graph and its complement","year":2018,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Iran National Science Foundation; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Algebraic connectivity; Complement (music); Algebraic number; Graph; Combinatorics; Discrete mathematics; Line graph","score_opus":0.03776348520352631,"score_gpt":0.3174618663857823,"score_spread":0.279698381182256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808171719","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6023059,0.0032115977,0.27625978,0.0072107366,0.0005580534,0.000109885754,0.0016603074,0.00031335198,0.10837035],"genre_scores_gemma":[0.95511013,0.0021440014,0.030371519,0.0005824153,0.00092188973,0.0001790563,0.0009398818,0.00011116416,0.0096398685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907136,0.00027058762,0.0000442812,0.00031365492,0.00020984301,0.00009023721],"domain_scores_gemma":[0.99470115,0.003317941,0.0007579019,0.0002128419,0.0005744501,0.00043563335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008152502,0.0008020239,0.0010588514,0.0047244616,0.0021010141,0.0037629013,0.00127569,0.0013445108,0.0069437954],"category_scores_gemma":[0.0050759465,0.0005403468,0.00071487745,0.0041813883,0.006141386,0.008688208,0.0023757368,0.00267834,0.000506798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021087375,0.000012598261,0.00022568725,0.000035896224,0.000006410332,0.000046394238,0.00025334346,0.0006912992,0.00031942222,0.994175,0.00067269907,0.0035402619],"study_design_scores_gemma":[0.000009384797,0.000013408684,0.00033661726,0.000018049725,0.000011816849,0.00013623199,0.00016275253,0.0049479012,0.00019181344,0.99162805,0.0025300295,0.000014063201],"about_ca_topic_score_codex":0.0024709678,"about_ca_topic_score_gemma":0.0016060508,"teacher_disagreement_score":0.0069437954,"about_ca_system_score_codex":0.0010401718,"about_ca_system_score_gemma":0.00073132216,"threshold_uncertainty_score":0.023229301},"labels":[],"label_agreement":null},{"id":"W2808973873","doi":"10.6000/1927-5129.2018.14.37","title":"Edge Version of Harmonic Index and Harmonic Polynomial of Rooted Product Graphs","year":2018,"lang":"en","type":"article","venue":"Journal of Basic & Applied Sciences","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Harmonic; Product (mathematics); Vertex (graph theory); Enhanced Data Rates for GSM Evolution; Polynomial; Combinatorics; Index (typography); Discrete mathematics; Mathematical analysis; Graph; Geometry; Computer science; Physics; Quantum mechanics; Telecommunications","score_opus":0.03402237576156962,"score_gpt":0.2922507085396655,"score_spread":0.25822833277809587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808973873","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5911829,0.00059119717,0.35990843,0.0002599445,0.00016070947,0.000049492966,0.00047603593,0.00027892014,0.047092408],"genre_scores_gemma":[0.967682,0.0002465081,0.025453247,0.000045521247,0.000078664394,0.000018591489,0.00028926722,0.0001303172,0.006055893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996642,0.000036406593,0.000012433019,0.00010337877,0.00011058119,0.000073067546],"domain_scores_gemma":[0.9991398,0.0003370315,0.000093998424,0.00012351066,0.00018765607,0.00011801856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034103764,0.00031073668,0.00042064738,0.0014305654,0.00061850087,0.0013227572,0.0012118581,0.0005694051,0.007450689],"category_scores_gemma":[0.0026321597,0.00022204343,0.0005268636,0.0010189294,0.0010733722,0.004173428,0.0008711232,0.0014572567,0.0006067149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008190721,0.000051128216,0.0035462764,0.00014330978,0.000021250473,0.00028278003,0.00035616945,0.013729376,0.009213298,0.9381687,0.0015234522,0.032882508],"study_design_scores_gemma":[0.00001331322,0.000066112356,0.0029939925,0.000020265845,0.00002780244,0.00063104136,0.00025492924,0.13378173,0.0059479685,0.85114354,0.005072396,0.000046809873],"about_ca_topic_score_codex":0.0007166366,"about_ca_topic_score_gemma":0.0009025258,"teacher_disagreement_score":0.007450689,"about_ca_system_score_codex":0.0007370141,"about_ca_system_score_gemma":0.00030492217,"threshold_uncertainty_score":0.024925053},"labels":[],"label_agreement":null},{"id":"W282701158","doi":"","title":"The Actions of Fractional Automorphisms","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Automorphism; Adjacency matrix; Combinatorics; Vertex (graph theory); Permutation matrix; Isomorphism (crystallography); Discrete mathematics; Graph; Circulant matrix","score_opus":0.028997217715828597,"score_gpt":0.29983496546442134,"score_spread":0.27083774774859276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W282701158","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.705953,0.00047523342,0.21191633,0.0008782906,0.00023623997,0.00007156258,0.00016483922,0.0003904046,0.079914115],"genre_scores_gemma":[0.9830943,0.00013693773,0.009145089,0.00009171759,0.000105245126,0.000036941416,0.00007858957,0.00006376138,0.007247509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984895,0.00042568397,0.000085200554,0.00028314564,0.00037296466,0.00034348268],"domain_scores_gemma":[0.99622524,0.0013181907,0.00061695685,0.0010313541,0.00041199254,0.0003963046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011163509,0.0004363552,0.0005537616,0.001229909,0.0016539241,0.0017980738,0.00053560437,0.0008152393,0.005263523],"category_scores_gemma":[0.003921691,0.00031163977,0.0011355707,0.00042041566,0.0044982363,0.0027565106,0.0020092651,0.0010402928,0.00044206125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040070914,0.000019314813,0.00031490275,0.000014026616,0.0000108780305,0.00013591103,0.00044990555,0.0031267423,0.0023844203,0.98851657,0.00037342435,0.0046138014],"study_design_scores_gemma":[0.000014582221,0.00004664571,0.00034622522,0.000011868328,0.000009173312,0.00011600261,0.00014515241,0.014962858,0.0022076487,0.9772175,0.0049074637,0.000014895377],"about_ca_topic_score_codex":0.0010869628,"about_ca_topic_score_gemma":0.000622679,"teacher_disagreement_score":0.005263523,"about_ca_system_score_codex":0.0011350018,"about_ca_system_score_gemma":0.00047731074,"threshold_uncertainty_score":0.017608285},"labels":[],"label_agreement":null},{"id":"W2885828394","doi":"10.26493/2590-9770.1255.414","title":"Special Issue of ADAM on Symmetries of Graphs and Networks – Call for Papers","year":2018,"lang":"en","type":"paratext","venue":"The Art of Discrete and Applied Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Call control; Computer science; Computer network","score_opus":0.0206804572333441,"score_gpt":0.2812256970690215,"score_spread":0.2605452398356774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885828394","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.00093147764,0.00917651,0.0028378,0.0766909,0.7616241,0.000245057,0.003924666,0.001443,0.14312644],"genre_scores_gemma":[0.00727028,0.0059963115,0.0012069173,0.01130627,0.38995796,0.00025980722,0.00482685,0.0023773036,0.5767983],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99544406,0.00060239295,0.00032594867,0.0007609309,0.0023672609,0.0004994218],"domain_scores_gemma":[0.98903674,0.002133911,0.00078640674,0.0011111444,0.0036558341,0.0032760608],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0032527512,0.0018750215,0.0022676317,0.003243072,0.0026811769,0.0122442795,0.0016021935,0.0041765957,0.3543905],"category_scores_gemma":[0.01121249,0.000656148,0.0014029485,0.0022013318,0.0010449294,0.007842651,0.003323483,0.00516542,0.17279819],"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.000020190922,0.000014846028,0.000034761382,0.000079434634,0.000004389913,0.000029255163,0.000009138106,0.00004041118,0.00009355592,0.0023542196,0.9904393,0.0068805623],"study_design_scores_gemma":[0.000013569153,0.000016593656,0.0002453828,0.00008328484,0.0000045916877,0.00006113965,0.000021248135,0.0001937803,0.00012223436,0.003779859,0.9954516,0.0000067533747],"about_ca_topic_score_codex":0.0005379672,"about_ca_topic_score_gemma":0.0013078768,"teacher_disagreement_score":0.3543905,"about_ca_system_score_codex":0.0039858897,"about_ca_system_score_gemma":0.0024832427,"threshold_uncertainty_score":0.9208836},"labels":[],"label_agreement":null},{"id":"W2886014853","doi":"10.4064/aa180320-22-6","title":"Supercharacters and the Chebotarev density theorem","year":2018,"lang":"en","type":"article","venue":"Acta Arithmetica","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.024404801054179047,"score_gpt":0.28182314722023133,"score_spread":0.2574183461660523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886014853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31217796,0.0032579373,0.36464405,0.0031374856,0.0007666809,0.00006735128,0.00024309006,0.00039957528,0.31530586],"genre_scores_gemma":[0.9586058,0.00082127197,0.017100789,0.00059223606,0.00033345507,0.00008558797,0.000114276896,0.000108530745,0.022238037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991522,0.00019653888,0.000026782269,0.00013771818,0.00030839277,0.00017835318],"domain_scores_gemma":[0.99852705,0.00064416666,0.000089017296,0.0002590014,0.0003187251,0.00016192612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011658343,0.00039420172,0.0006863866,0.002016529,0.002580233,0.002173797,0.0013421931,0.0007978152,0.0072027775],"category_scores_gemma":[0.0035153732,0.00039257357,0.00060333405,0.0014084573,0.004203976,0.004672872,0.0031010143,0.0021037874,0.0009313559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027952299,0.0000033864178,0.000039778406,0.0000068360755,0.0000011102509,0.000013040504,0.00006193158,0.00027634393,0.00008148979,0.997997,0.00030164266,0.0012147138],"study_design_scores_gemma":[0.000003984292,0.0000064128894,0.00008720386,0.000008911136,0.000002538543,0.00004100229,0.000069536516,0.004339673,0.00027665397,0.992243,0.0029143759,0.000006697763],"about_ca_topic_score_codex":0.0019666858,"about_ca_topic_score_gemma":0.0011599461,"teacher_disagreement_score":0.0072027775,"about_ca_system_score_codex":0.0014407575,"about_ca_system_score_gemma":0.00071705977,"threshold_uncertainty_score":0.024095654},"labels":[],"label_agreement":null},{"id":"W2886387515","doi":"10.1007/s10801-019-00900-y","title":"Construction of cospectral graphs","year":2019,"lang":"en","type":"preprint","venue":"Journal of Algebraic Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"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":"Ministry of Education, India; University of Waterloo","keywords":"Combinatorics; Line graph; Cograph; Mathematics; Discrete mathematics; Pathwidth; Graph; Split graph; Symmetric graph; Comparability graph; Graph product; Voltage graph","score_opus":0.028059523223553345,"score_gpt":0.2959501441155659,"score_spread":0.26789062089201254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886387515","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41343272,0.00038548585,0.21430665,0.001598173,0.0009521383,0.00018863722,0.00058863853,0.0012509606,0.3672966],"genre_scores_gemma":[0.86471224,0.00040444994,0.07683479,0.00048134255,0.00020561417,0.00012447377,0.0008008205,0.000671664,0.05576468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997434,0.00006439929,0.000010584643,0.000060888753,0.00006900929,0.00005166896],"domain_scores_gemma":[0.99971145,0.00005855578,0.000027817214,0.00005532647,0.00006650849,0.000080427555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022584705,0.00060191914,0.00038685402,0.0015983187,0.0013057733,0.0017737766,0.0005052723,0.00068985374,0.014445597],"category_scores_gemma":[0.00060068234,0.0003282452,0.00037937297,0.00084894104,0.00093538896,0.0014383908,0.0015914692,0.0012607889,0.0020402933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032147735,0.00006193099,0.00024146884,0.00003301112,0.0000046004266,0.000111809146,0.00016845221,0.0005341963,0.007584949,0.9755974,0.0025077222,0.013122301],"study_design_scores_gemma":[0.000024711799,0.00002798641,0.00055123604,0.000026916963,0.000016113832,0.00036033633,0.00023062383,0.008429673,0.010646734,0.95065606,0.029010426,0.00001915882],"about_ca_topic_score_codex":0.0002649778,"about_ca_topic_score_gemma":0.00051293214,"teacher_disagreement_score":0.014445597,"about_ca_system_score_codex":0.00047743996,"about_ca_system_score_gemma":0.0003001384,"threshold_uncertainty_score":0.04832536},"labels":[],"label_agreement":null},{"id":"W2888141495","doi":"10.13001/1081-3810.3613","title":"Some Graphs Determined By Their Distance Spectrum","year":2018,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Graph theory and applications","field":"Mathematics","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":"McGill University","funders":"","keywords":"Mathematics; Lambda; Spectrum (functional analysis); Combinatorics; Graph; Order (exchange); Discrete mathematics; Physics; Quantum mechanics","score_opus":0.012449170809009053,"score_gpt":0.2699552457101116,"score_spread":0.25750607490110256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888141495","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8755585,0.00067111925,0.046609,0.00058228057,0.00006713496,0.000035804973,0.00060444704,0.00014640682,0.07572526],"genre_scores_gemma":[0.9763106,0.0004004037,0.013952045,0.00015131937,0.00007184506,0.00005022693,0.00058120076,0.000047249483,0.008435112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996722,0.00005669296,0.000013946306,0.00011921397,0.00008165873,0.000056343473],"domain_scores_gemma":[0.99935156,0.00021904873,0.00011638517,0.000048140835,0.000119240874,0.00014557112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001973195,0.0003734113,0.0002732351,0.0020921445,0.0012501184,0.001454774,0.00039336327,0.00046749692,0.0045136604],"category_scores_gemma":[0.0010164164,0.0002399443,0.00033934726,0.00089080416,0.0013919292,0.0012116735,0.0009953271,0.0006568753,0.00044492036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075449454,0.000021929045,0.0011409109,0.000041393232,0.0000095491505,0.00016472246,0.00030504508,0.0013920896,0.0043102084,0.9829606,0.0011817769,0.008396383],"study_design_scores_gemma":[0.000037578047,0.000040308172,0.002407196,0.000031074756,0.000020352189,0.0005144264,0.00044314392,0.013551697,0.0033807333,0.9688815,0.0106629,0.000029145074],"about_ca_topic_score_codex":0.0014646427,"about_ca_topic_score_gemma":0.0014328607,"teacher_disagreement_score":0.0045136604,"about_ca_system_score_codex":0.00101122,"about_ca_system_score_gemma":0.00038977028,"threshold_uncertainty_score":0.015099645},"labels":[],"label_agreement":null},{"id":"W2889694999","doi":"10.1016/j.jctb.2018.09.004","title":"Connectivity in bridge-addable graph classes: The McDiarmid–Steger–Welsh conjecture","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":6,"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":"European Research Council; McGill University","keywords":"Mathematics; Combinatorics; Conjecture; Graph; Partition (number theory); Class (philosophy); Discrete mathematics","score_opus":0.02475842331205823,"score_gpt":0.2984947733449122,"score_spread":0.27373635003285396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889694999","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8214442,0.0017983966,0.08920886,0.009574276,0.00034119128,0.00006133983,0.0006887305,0.00034787355,0.0765352],"genre_scores_gemma":[0.98126775,0.00082436635,0.01073742,0.00077439984,0.0004060447,0.00007738074,0.0006608936,0.000077453384,0.0051743058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933606,0.0001483389,0.000026246224,0.00022204181,0.00013693527,0.00013048784],"domain_scores_gemma":[0.9949904,0.0029710971,0.0004536387,0.0005990532,0.00038508608,0.00060066563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000996951,0.00049668865,0.0011626036,0.0019119541,0.0023108213,0.0037213126,0.0018331008,0.0028182585,0.008544678],"category_scores_gemma":[0.0101638995,0.0007075324,0.00079656823,0.0016238155,0.0036287936,0.0069278236,0.0029809065,0.0033761116,0.00075545063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010393185,0.000043391647,0.0018749948,0.0000919596,0.000017883835,0.00012124715,0.0005477866,0.0027593644,0.00083814544,0.97925526,0.005219985,0.00912592],"study_design_scores_gemma":[0.000036919824,0.000013511841,0.00072582305,0.000019155654,0.000013145251,0.00010016209,0.00017885222,0.008120109,0.00022471552,0.9884067,0.0021527484,0.000008118908],"about_ca_topic_score_codex":0.0014224227,"about_ca_topic_score_gemma":0.001595464,"teacher_disagreement_score":0.008544678,"about_ca_system_score_codex":0.0008050109,"about_ca_system_score_gemma":0.00043198015,"threshold_uncertainty_score":0.028584838},"labels":[],"label_agreement":null},{"id":"W2889835595","doi":"10.3386/w22964","title":"An Energy-centric Theory of Agglomeration","year":2016,"lang":"en","type":"preprint","venue":"National Bureau of Economic Research","topic":"Graph theory and applications","field":"Mathematics","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 Calgary","funders":"","keywords":"Economies of agglomeration; Economic geography; Computer science; Economics; Microeconomics","score_opus":0.325452886562613,"score_gpt":0.5149715822510145,"score_spread":0.18951869568840146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889835595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08178846,0.0017824088,0.6348273,0.012995751,0.00019227191,0.00007502239,0.00043662108,0.00029528205,0.26760688],"genre_scores_gemma":[0.91905206,0.0015249253,0.03407924,0.0011780513,0.00029523048,0.00015162086,0.00021354559,0.00011627504,0.043388996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954283,0.00013425453,0.000012673786,0.000105710664,0.00013466513,0.00007000494],"domain_scores_gemma":[0.99933237,0.00023987643,0.000089376634,0.00012645627,0.00013661048,0.00007532148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006581942,0.00040758846,0.00046428098,0.0011794998,0.0013235152,0.001931972,0.0012025177,0.0011833576,0.0078910515],"category_scores_gemma":[0.0020119336,0.0002857682,0.0006909822,0.0014502847,0.0027415755,0.0039814585,0.0018003389,0.0009622753,0.00096776296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013603893,0.0000020233433,0.000102274455,0.000008493122,0.0000038839726,0.000014632859,0.000053545453,0.0058327382,0.00006106598,0.9918967,0.0008843084,0.0011390205],"study_design_scores_gemma":[0.0000044112494,0.000004209111,0.00018108946,0.0000063002235,0.0000033681754,0.000033013457,0.000054242402,0.020165574,0.000055828095,0.97121215,0.008276305,0.000003565324],"about_ca_topic_score_codex":0.0033270863,"about_ca_topic_score_gemma":0.003234713,"teacher_disagreement_score":0.0078910515,"about_ca_system_score_codex":0.0024369308,"about_ca_system_score_gemma":0.0007654006,"threshold_uncertainty_score":0.026398242},"labels":[],"label_agreement":null},{"id":"W2892206262","doi":"10.3390/biom8030092","title":"On Molecular Descriptors of Carbon Nanocones","year":2018,"lang":"en","type":"article","venue":"Biomolecules","topic":"Graph theory and applications","field":"Mathematics","cited_by":38,"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":"Degree (music); Polynomial; Carbon fibers; Topological index; Maple; Mathematics; Topology (electrical circuits); Combinatorics; Physics; Mathematical analysis; Algorithm","score_opus":0.02866891782795584,"score_gpt":0.3030186157998308,"score_spread":0.274349697971875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892206262","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79214877,0.0010179469,0.18015708,0.0005380775,0.00016547405,0.00007515908,0.0016215988,0.0010432625,0.02323265],"genre_scores_gemma":[0.97037417,0.00032497552,0.02477244,0.000072287236,0.000037495185,0.00003137582,0.0007575489,0.00018624846,0.0034435077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99980587,0.000027028022,0.000008909004,0.000039972227,0.00008162932,0.000036561974],"domain_scores_gemma":[0.99942833,0.00019503428,0.00009803741,0.00009196142,0.000117409516,0.00006922103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031229111,0.0003338225,0.00035929828,0.002489403,0.000381995,0.001132379,0.0004241406,0.00048009973,0.0053869174],"category_scores_gemma":[0.0020113029,0.00012216037,0.00035309105,0.001679769,0.0007911828,0.001454959,0.000749102,0.0005460995,0.0005483478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037127323,0.00018069735,0.008280438,0.00046538282,0.000048899514,0.00037843076,0.00040387566,0.27658063,0.06533265,0.5141618,0.00646084,0.12733498],"study_design_scores_gemma":[0.000024934712,0.000088688845,0.0072055343,0.000038051076,0.000013699836,0.00022203964,0.00020527221,0.81615233,0.013827628,0.15326,0.008898738,0.00006315396],"about_ca_topic_score_codex":0.0013637352,"about_ca_topic_score_gemma":0.0011624736,"teacher_disagreement_score":0.0053869174,"about_ca_system_score_codex":0.0007299143,"about_ca_system_score_gemma":0.0002924471,"threshold_uncertainty_score":0.018021047},"labels":[],"label_agreement":null},{"id":"W28955333","doi":"10.1007/0-306-48213-4_11","title":"Polynomially Solvable Cases of the TSP","year":2006,"lang":"en","type":"book-chapter","venue":"Combinatorial optimization","topic":"Graph theory and applications","field":"Mathematics","cited_by":29,"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 New Brunswick","funders":"","keywords":"Combinatorics; Digraph; Mathematics; Travelling salesman problem; Diagonal; Permutation (music); Graph; Discrete mathematics; Physics; Algorithm","score_opus":0.026080830322034468,"score_gpt":0.2523124332487871,"score_spread":0.22623160292675265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W28955333","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036823742,0.00922673,0.14940384,0.005526208,0.00091032503,0.0001365853,0.0009804475,0.00040109904,0.79659104],"genre_scores_gemma":[0.50022805,0.019431613,0.15298107,0.0016257039,0.0022144336,0.00035935716,0.002650311,0.00076849957,0.319741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931264,0.00014351793,0.000029345989,0.00013146328,0.00021580147,0.0001672308],"domain_scores_gemma":[0.9992919,0.00046388138,0.000045566023,0.00009699268,0.000066768465,0.000034905945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043083154,0.0011126084,0.0009579832,0.0007323948,0.0012001507,0.004008469,0.0017369573,0.0013874929,0.020508153],"category_scores_gemma":[0.0023367808,0.00058605947,0.00092898967,0.0022009653,0.0015505487,0.0035817928,0.0012090304,0.0036115542,0.0033027162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007663794,0.000105364416,0.00013640188,0.00035218152,0.000024919545,0.00034201777,0.00019258767,0.015626732,0.00081172347,0.8709972,0.058729175,0.052605096],"study_design_scores_gemma":[0.0000278626,0.0000139881795,0.00014416482,0.00005411133,0.000012069045,0.00035751102,0.000112849135,0.019368257,0.00055037154,0.9191666,0.060180478,0.000011647427],"about_ca_topic_score_codex":0.0030751328,"about_ca_topic_score_gemma":0.005071621,"teacher_disagreement_score":0.020508153,"about_ca_system_score_codex":0.001630999,"about_ca_system_score_gemma":0.0010839538,"threshold_uncertainty_score":0.068606555},"labels":[],"label_agreement":null},{"id":"W2895947321","doi":"10.13001/1081-3810.3918","title":"On Orthogonal Matrices with Zero Diagonal","year":2019,"lang":"en","type":"preprint","venue":"Electronic Journal of Linear Algebra","topic":"Graph theory and applications","field":"Mathematics","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":"University of Manitoba; Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Memorial University of Newfoundland; University of Manitoba; University of Regina","keywords":"Diagonal; Zero (linguistics); Eigenvalues and eigenvectors; Combinatorics; Mathematics; Diagonal matrix; Main diagonal; Physics; Geometry; Quantum mechanics","score_opus":0.017305659884399725,"score_gpt":0.2892703387843755,"score_spread":0.2719646788999758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895947321","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5045397,0.0019272992,0.41739315,0.00061174104,0.00029122713,0.00006415948,0.00032280636,0.00019538049,0.07465441],"genre_scores_gemma":[0.9371692,0.0011827954,0.04927671,0.00026340617,0.00031783365,0.00009501051,0.0003708368,0.00008034422,0.011243755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918777,0.00023924821,0.00003528595,0.00018075375,0.0001812362,0.00017573337],"domain_scores_gemma":[0.99846834,0.0005950578,0.00033551783,0.00017842533,0.00023876675,0.0001838851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005761758,0.0007203896,0.00037848487,0.0012535899,0.0010137289,0.0010140892,0.0004337307,0.00062131375,0.0039289],"category_scores_gemma":[0.003287172,0.00028791607,0.00036033677,0.0009316861,0.0019011525,0.0017238747,0.0012214757,0.00080334535,0.000689376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057508107,0.000025077232,0.0004210552,0.000055978755,0.000007518271,0.00015474843,0.00015182568,0.006811617,0.0041707293,0.975749,0.0012268403,0.011168041],"study_design_scores_gemma":[0.000020206475,0.00007338152,0.0005115452,0.000039431612,0.0000067935803,0.0002927958,0.00013722121,0.053912193,0.002488266,0.9369588,0.0055321907,0.000027225735],"about_ca_topic_score_codex":0.0009377898,"about_ca_topic_score_gemma":0.0011554341,"teacher_disagreement_score":0.0039289,"about_ca_system_score_codex":0.00053938525,"about_ca_system_score_gemma":0.00041579848,"threshold_uncertainty_score":0.01314348},"labels":[],"label_agreement":null},{"id":"W2897536931","doi":"10.1016/j.ejc.2020.103181","title":"On the roots of the subtree polynomial","year":2020,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","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; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Root (linguistics); Polynomial; Closure (psychology); Mathematics; Tree (set theory); Boundary (topology); Interval (graph theory); Discrete mathematics; Mathematical analysis","score_opus":0.06453758780731812,"score_gpt":0.2762962373155245,"score_spread":0.2117586495082064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897536931","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4642244,0.007621884,0.2216997,0.010018788,0.0011876296,0.00008265227,0.0010518513,0.00054765673,0.29356545],"genre_scores_gemma":[0.91356117,0.003896864,0.024300063,0.00079661235,0.0013370378,0.000052887324,0.000637292,0.00048267908,0.0549354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940073,0.0001796334,0.000018000766,0.00013568508,0.00014354523,0.00012245004],"domain_scores_gemma":[0.996923,0.0021265799,0.00022975443,0.00023140012,0.00024748215,0.00024182511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064666383,0.0006872984,0.0011350033,0.0018806725,0.0010806142,0.002268876,0.0014299258,0.001521163,0.015589625],"category_scores_gemma":[0.00776155,0.00045825198,0.0007464319,0.002116535,0.002746142,0.0047833147,0.0023843015,0.004129922,0.0030590293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011882899,0.00004116811,0.00041941926,0.00013994148,0.000011602058,0.00015514636,0.0003377693,0.0037869082,0.0021146308,0.9660371,0.005543792,0.021293754],"study_design_scores_gemma":[0.000021436359,0.000013413508,0.00032803137,0.000026431928,0.000010914407,0.0001028961,0.00008275925,0.008717559,0.00040999855,0.9866089,0.0036672591,0.000010294286],"about_ca_topic_score_codex":0.0021000467,"about_ca_topic_score_gemma":0.0020707105,"teacher_disagreement_score":0.015589625,"about_ca_system_score_codex":0.0014037498,"about_ca_system_score_gemma":0.0007025131,"threshold_uncertainty_score":0.052152514},"labels":[],"label_agreement":null},{"id":"W2900883863","doi":"10.1142/s1230161220500018","title":"Dynamical Semigroups in the Birkhoff Polytope of Order 3 as a Tool for Analysis of Quantum Channels","year":2020,"lang":"en","type":"preprint","venue":"Open Systems & Information Dynamics","topic":"Graph theory and applications","field":"Mathematics","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":"Queen's University","funders":"","keywords":"Polytope; Mathematics; Markov chain; Semigroup; Parametrization (atmospheric modeling); Combinatorics; Birkhoff polytope; Order (exchange); Multiplicative function; Set (abstract data type); Pure mathematics; Discrete mathematics; Computer science; Mathematical analysis; Geometry; Physics","score_opus":0.0502034316947732,"score_gpt":0.3461255154272415,"score_spread":0.2959220837324683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900883863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4620828,0.0011041722,0.48805475,0.00067498506,0.00020281633,0.00013179398,0.00026387986,0.00024702394,0.047237806],"genre_scores_gemma":[0.96591336,0.00039382448,0.026345473,0.00010990343,0.00018461897,0.00012462944,0.000119726785,0.00006428113,0.0067441515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995357,0.0001309339,0.000019686076,0.00007366726,0.00013915543,0.00010088468],"domain_scores_gemma":[0.9985557,0.00061912864,0.00028128386,0.00014112005,0.00016186683,0.00024083453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006486495,0.0005184139,0.0004598461,0.0016039702,0.0010197316,0.001566339,0.0005551282,0.0005211989,0.0064400425],"category_scores_gemma":[0.0016431146,0.00022597132,0.0007018011,0.00054005045,0.0022376538,0.0023934802,0.0009582671,0.0014103289,0.0005498064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013492579,0.000016548536,0.00016125257,0.000018505858,0.000004045014,0.000075724085,0.00010934092,0.0030081263,0.0016311525,0.9933831,0.00016703519,0.0014116468],"study_design_scores_gemma":[0.000012372086,0.00004397607,0.00044821977,0.000012351407,0.0000051104116,0.00011103542,0.00009084392,0.056911234,0.0010334746,0.93918395,0.0021299708,0.000017391934],"about_ca_topic_score_codex":0.0007178694,"about_ca_topic_score_gemma":0.00041384815,"teacher_disagreement_score":0.0064400425,"about_ca_system_score_codex":0.0008872418,"about_ca_system_score_gemma":0.00056041236,"threshold_uncertainty_score":0.021544099},"labels":[],"label_agreement":null},{"id":"W2903179546","doi":"10.1109/tcsi.2018.2880601","title":"Network Science Meets Circuit Theory: Resistance Distance, Kirchhoff Index, and Foster’s Theorems With Generalizations and Unification","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Regular Papers","topic":"Graph theory and applications","field":"Mathematics","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 Waterloo","funders":"","keywords":"Unification; Criticality; Generalization; Computer science; Theoretical computer science; Network science; Range (aeronautics); Index (typography); Topology (electrical circuits); Complex network; Mathematics; Engineering","score_opus":0.02775459607580873,"score_gpt":0.2474663587823201,"score_spread":0.21971176270651135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903179546","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.091861725,0.019552045,0.7729929,0.010459529,0.0010959543,0.00009146292,0.00044198244,0.00037924285,0.103125244],"genre_scores_gemma":[0.88287747,0.015463485,0.08714352,0.0015551532,0.0028998237,0.00017621134,0.00029414735,0.00014485877,0.009445258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989316,0.00030122424,0.00004895219,0.00025734678,0.00036562502,0.000095249095],"domain_scores_gemma":[0.9939296,0.0040449826,0.0005781497,0.00059255364,0.0005978912,0.00025685225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024495872,0.0008332045,0.0008923435,0.003263543,0.0010337491,0.0028295212,0.0015061744,0.001744652,0.0036632281],"category_scores_gemma":[0.012544801,0.00028027722,0.0008632429,0.0031034271,0.0039725583,0.011077874,0.0020659813,0.002771336,0.00053363485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010795301,0.000007354353,0.0001950169,0.000043079977,0.000008228429,0.00003255437,0.000060860137,0.0039695785,0.00020141223,0.9843546,0.0012430768,0.009873358],"study_design_scores_gemma":[0.000004066345,0.000010176237,0.00015074808,0.000023332836,0.0000058781243,0.0000664626,0.00003516205,0.014867216,0.00016870783,0.981062,0.0035985496,0.000007743194],"about_ca_topic_score_codex":0.00130264,"about_ca_topic_score_gemma":0.0005957831,"teacher_disagreement_score":0.0036632281,"about_ca_system_score_codex":0.0021486108,"about_ca_system_score_gemma":0.00093911577,"threshold_uncertainty_score":0.015589356},"labels":[],"label_agreement":null},{"id":"W2905635537","doi":"10.48550/arxiv.1812.09775","title":"Maximum Modulus of Independence Roots of Graphs and Trees","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph theory and applications","field":"Mathematics","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 Guelph; Dalhousie University","funders":"","keywords":"Combinatorics; Independence number; Independence (probability theory); Mathematics; Graph; Upper and lower bounds; Polynomial; Discrete mathematics; Mathematical analysis; Statistics","score_opus":0.08364782340438444,"score_gpt":0.2210497515119239,"score_spread":0.13740192810753948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905635537","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5668463,0.002364653,0.33612847,0.006627369,0.00021257391,0.00009793598,0.0020075096,0.0012306279,0.084484555],"genre_scores_gemma":[0.96463126,0.0008859515,0.022039697,0.00035545308,0.00047198005,0.000111549256,0.00077691785,0.0003480903,0.010379147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991258,0.00016104437,0.00002659992,0.00024949963,0.00024935335,0.00018773631],"domain_scores_gemma":[0.98855877,0.00845357,0.000900605,0.00089520344,0.00043826524,0.00075368304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009151044,0.0008103413,0.0007268036,0.0012640047,0.00083386415,0.0017276881,0.0011974324,0.00068393373,0.0089208055],"category_scores_gemma":[0.012507621,0.00056675985,0.00087694085,0.0011653817,0.0023853227,0.005012241,0.0023575502,0.003418442,0.0015318335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000870656,0.0001534102,0.0051449975,0.0005199691,0.000080178186,0.00029618287,0.00060604035,0.04784804,0.020717999,0.8489061,0.019074831,0.055781603],"study_design_scores_gemma":[0.000058472786,0.00007027349,0.0035342483,0.000039925886,0.0000510711,0.00041414707,0.000074229116,0.07844183,0.0067073596,0.9044809,0.0060916883,0.000035783192],"about_ca_topic_score_codex":0.0007866312,"about_ca_topic_score_gemma":0.0011091046,"teacher_disagreement_score":0.0089208055,"about_ca_system_score_codex":0.0016489249,"about_ca_system_score_gemma":0.000657544,"threshold_uncertainty_score":0.029843092},"labels":[],"label_agreement":null},{"id":"W2907328673","doi":"10.1016/j.disc.2019.111607","title":"A relative bound for independence","year":2019,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"Upper and lower bounds; Independence number; Independence (probability theory); Eigenvalues and eigenvectors; Mathematics; Combinatorics; Graph; Physics; Statistics; Mathematical analysis","score_opus":0.06587805643236033,"score_gpt":0.3537486403950447,"score_spread":0.2878705839626844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907328673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036472894,0.006158534,0.7137216,0.01329199,0.0013453059,0.00010385328,0.001728249,0.00077517406,0.22640242],"genre_scores_gemma":[0.75420487,0.0057509663,0.13096823,0.006183464,0.0068660323,0.00087258755,0.0029756129,0.0018769345,0.0903013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.991422,0.0024329203,0.00035059085,0.002645354,0.0022350783,0.00091420545],"domain_scores_gemma":[0.9701286,0.020368453,0.0010870992,0.004516157,0.0020770766,0.001822654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059304587,0.0023362327,0.0035488433,0.0063582268,0.0052545425,0.007911313,0.005960063,0.0045641074,0.03550598],"category_scores_gemma":[0.028966157,0.0020846098,0.0036523512,0.008804911,0.009051192,0.037212476,0.011123508,0.021047719,0.0060818987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055649398,0.000027661572,0.0001437974,0.00008571906,0.000020035577,0.000025215037,0.00014726783,0.00095045235,0.00027869476,0.9884476,0.004065013,0.0057527875],"study_design_scores_gemma":[0.0000107163305,0.000014309911,0.00018300186,0.000029810568,0.000030906194,0.00008302134,0.000032616997,0.005438554,0.00032847884,0.9884289,0.0054053734,0.000014429656],"about_ca_topic_score_codex":0.00094330194,"about_ca_topic_score_gemma":0.0007864832,"teacher_disagreement_score":0.03550598,"about_ca_system_score_codex":0.0040401453,"about_ca_system_score_gemma":0.001152296,"threshold_uncertainty_score":0.11877936},"labels":[],"label_agreement":null},{"id":"W2912104270","doi":"10.1139/cjp-2018-0619","title":"Characteristic study of irregularity measures of some nanotubes","year":2019,"lang":"en","type":"article","venue":"Canadian Journal of Physics","topic":"Graph theory and applications","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Property (philosophy); Vertex (graph theory); Statistical physics; Physics; Variance (accounting); Graph; Molecular graph; Topological index; Graph theory; Combinatorics; Mathematics; Epistemology","score_opus":0.051859460898149835,"score_gpt":0.2706549216551421,"score_spread":0.21879546075699227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912104270","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8507814,0.00027984264,0.14360608,0.00016581394,0.000020147401,0.00002704931,0.00021349672,0.0001569103,0.0047492655],"genre_scores_gemma":[0.9883078,0.00009261422,0.010675076,0.000018206965,0.000019895604,0.000017697661,0.00016196321,0.000040065814,0.00066675746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997358,0.00005465064,0.00001447812,0.000071807044,0.000088854234,0.000034390894],"domain_scores_gemma":[0.99459803,0.0028491237,0.0011700471,0.00035671968,0.00069034554,0.00033579447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005193051,0.00025108908,0.00027185405,0.0025383858,0.00041277884,0.0005697303,0.00039344092,0.00030451862,0.0009388958],"category_scores_gemma":[0.005756135,0.00016809213,0.00033740042,0.0010285048,0.00092525664,0.0011497485,0.00040266596,0.0006010163,0.00008291279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024903327,0.00010465406,0.056355197,0.00021810905,0.00012418714,0.00088284316,0.0010204001,0.261494,0.06670878,0.5658666,0.0018829426,0.045093283],"study_design_scores_gemma":[0.000011013935,0.00008508301,0.024633456,0.000022961887,0.000024421577,0.00060542894,0.00017935042,0.7522226,0.010701933,0.20909797,0.002369828,0.00004588379],"about_ca_topic_score_codex":0.0006407202,"about_ca_topic_score_gemma":0.0005031787,"teacher_disagreement_score":0.0025383858,"about_ca_system_score_codex":0.0006817738,"about_ca_system_score_gemma":0.00023408492,"threshold_uncertainty_score":0.004946649},"labels":[],"label_agreement":null},{"id":"W2918186528","doi":"","title":"Further results on Wiener, Harary indices and graph properties.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Graph; Combinatorics","score_opus":0.03681575060499444,"score_gpt":0.27271480358290334,"score_spread":0.23589905297790892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918186528","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07640829,0.0149951475,0.18520318,0.011502597,0.0024473956,0.00007421288,0.0013195553,0.0006564894,0.70739317],"genre_scores_gemma":[0.75364834,0.016829828,0.06254631,0.0048504607,0.0033372894,0.00014422975,0.0018636445,0.00080305844,0.1559768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994165,0.00015358801,0.000031552932,0.00013408775,0.0001722008,0.00009208336],"domain_scores_gemma":[0.997561,0.0012467114,0.00026026068,0.00035017895,0.00034138237,0.00024034831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001014107,0.0010378442,0.0008686525,0.0030874442,0.0016135045,0.0026621227,0.0010044498,0.0012286988,0.025547644],"category_scores_gemma":[0.005684756,0.00035899493,0.0011061745,0.0030853488,0.002339164,0.008758245,0.0024904404,0.0038463403,0.0042630453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002601703,0.000040059167,0.00038304002,0.0001374104,0.000016271479,0.00010631263,0.00024946244,0.00060149044,0.0013214893,0.9726089,0.0093386695,0.0151707735],"study_design_scores_gemma":[0.0000036195731,0.000009567842,0.000550673,0.000025029922,0.000012040634,0.00012837282,0.00013199852,0.0010211803,0.0004137398,0.9838464,0.013847873,0.000009377523],"about_ca_topic_score_codex":0.0011810997,"about_ca_topic_score_gemma":0.002092001,"teacher_disagreement_score":0.025547644,"about_ca_system_score_codex":0.00097134244,"about_ca_system_score_gemma":0.00049771275,"threshold_uncertainty_score":0.08546543},"labels":[],"label_agreement":null},{"id":"W2918293970","doi":"","title":"Bicyclic graphs with the second up to eighth largest hyper-Wiener indices.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bicyclic molecule; Wiener index; Combinatorics; Statistics; Graph; Medicinal chemistry; Chemistry","score_opus":0.019580191362177524,"score_gpt":0.27085861240031606,"score_spread":0.2512784210381385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918293970","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.581316,0.0026780318,0.08403478,0.0015215916,0.0005842752,0.00010866606,0.0018017825,0.0007127048,0.32724226],"genre_scores_gemma":[0.94503576,0.00089914654,0.01636584,0.00045519925,0.00010769316,0.00008768244,0.0007247335,0.000132668,0.036191296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969625,0.00005494625,0.000015975591,0.000049541333,0.00008396348,0.00009924216],"domain_scores_gemma":[0.999292,0.00017537063,0.00011883066,0.00013774468,0.00013443247,0.0001414875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021279218,0.0003884679,0.00042895015,0.0012757095,0.0009806588,0.0015452116,0.0005087982,0.0007261141,0.009133427],"category_scores_gemma":[0.0017754777,0.00033171856,0.0002484818,0.0009880267,0.0008744956,0.0014407597,0.0014575904,0.0011384804,0.0021102089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017129166,0.00002691628,0.00080490427,0.00010783035,0.000015371987,0.00030202308,0.0002431072,0.0018594243,0.009081499,0.9573972,0.0071246875,0.02286577],"study_design_scores_gemma":[0.00003612239,0.000050467534,0.0018046302,0.00009260137,0.00003105522,0.00083657604,0.00029052558,0.008776888,0.008481609,0.95504063,0.024512947,0.000046024586],"about_ca_topic_score_codex":0.0007823343,"about_ca_topic_score_gemma":0.0018455611,"teacher_disagreement_score":0.009133427,"about_ca_system_score_codex":0.0004653308,"about_ca_system_score_gemma":0.00047774275,"threshold_uncertainty_score":0.030554354},"labels":[],"label_agreement":null},{"id":"W2918475526","doi":"","title":"Spectral characterizations of graphs with at most two (signless) Laplacian eigenvalues greater than 2.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Combinatorics; Discrete mathematics; Physics","score_opus":0.021813250109894104,"score_gpt":0.2722463776423414,"score_spread":0.2504331275324473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918475526","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.741722,0.0010045833,0.14556324,0.0021353858,0.00029020343,0.00006931657,0.001419202,0.0007228342,0.107073285],"genre_scores_gemma":[0.98280966,0.00025885704,0.009421695,0.00029648712,0.00016834223,0.00006194034,0.00071659934,0.00010802845,0.0061582527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965596,0.00008153243,0.000017356111,0.0000844758,0.000082407016,0.0000781878],"domain_scores_gemma":[0.9978635,0.0009230597,0.00037019965,0.00022166535,0.00031417506,0.0003075119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031311603,0.0005936725,0.0002839808,0.002484819,0.00082640717,0.0013097147,0.00070314365,0.0008568105,0.008115092],"category_scores_gemma":[0.003104659,0.0002479271,0.0003257745,0.0010144705,0.0012718006,0.0020164337,0.0009999254,0.0011374517,0.001468733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034403216,0.0001363259,0.003005836,0.00023565182,0.000027422084,0.0005504428,0.0010695609,0.0065400717,0.03644153,0.90163875,0.0154755,0.03453485],"study_design_scores_gemma":[0.000032455384,0.000056794877,0.0025252677,0.000050190756,0.000017531122,0.000994169,0.0008820319,0.030668635,0.0055251443,0.9519975,0.0072112,0.000039109706],"about_ca_topic_score_codex":0.0002484882,"about_ca_topic_score_gemma":0.00028703708,"teacher_disagreement_score":0.008115092,"about_ca_system_score_codex":0.00038235512,"about_ca_system_score_gemma":0.00021066662,"threshold_uncertainty_score":0.02714765},"labels":[],"label_agreement":null},{"id":"W2918493888","doi":"","title":"The linear programming approach to the harmonic index of a graph with minimum degree at least three.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Index (typography); Graph; Combinatorics; Computer science; Programming language","score_opus":0.046279962539619524,"score_gpt":0.27706904114541014,"score_spread":0.23078907860579062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918493888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060681142,0.0015004463,0.8227828,0.0031671177,0.0002513888,0.00008022671,0.0006400741,0.00021074708,0.11068611],"genre_scores_gemma":[0.62222546,0.0022789955,0.29726171,0.0009634104,0.0009709694,0.0003319646,0.00093667745,0.00057249673,0.07445832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955744,0.00014958082,0.000011762548,0.00009120326,0.00011028736,0.0000796292],"domain_scores_gemma":[0.99846447,0.001074765,0.000113957525,0.00009240716,0.00014004951,0.00011438249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060158386,0.0005422956,0.0006185787,0.0015450389,0.0007970029,0.0021031278,0.0017394238,0.0008451242,0.011942415],"category_scores_gemma":[0.004109176,0.0003866529,0.00062677276,0.0015853543,0.0016521637,0.0033339444,0.0013442489,0.0031150915,0.0014877822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003510548,0.000046649442,0.00026119984,0.00010589358,0.000017799402,0.00003367341,0.00013558212,0.027460042,0.00087341055,0.9301803,0.0068675512,0.03398277],"study_design_scores_gemma":[0.0000075273706,0.000018348617,0.00015210443,0.000017964643,0.000009062536,0.000028689792,0.00006485464,0.11648791,0.0004337052,0.879043,0.0037260188,0.000010704277],"about_ca_topic_score_codex":0.0028356856,"about_ca_topic_score_gemma":0.0037150895,"teacher_disagreement_score":0.011942415,"about_ca_system_score_codex":0.0016811835,"about_ca_system_score_gemma":0.0009531653,"threshold_uncertainty_score":0.039951384},"labels":[],"label_agreement":null},{"id":"W2918733661","doi":"","title":"On the connective eccentricity index of graphs with fixed clique number.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Clique; Eccentricity (behavior); Combinatorics; Index (typography); Computer science; Political science","score_opus":0.019004138609064206,"score_gpt":0.2799922236122643,"score_spread":0.2609880850032001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918733661","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73459643,0.0026048084,0.14755046,0.0025046663,0.00035411422,0.000051188,0.0008070429,0.00035764626,0.11117367],"genre_scores_gemma":[0.9758883,0.0007648391,0.015970381,0.00022090352,0.00035608409,0.000047700392,0.00027414758,0.00015415816,0.0063234926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992918,0.00021960976,0.00002770033,0.00016809955,0.00016534685,0.00012735483],"domain_scores_gemma":[0.9874938,0.008647039,0.0013165326,0.0007504196,0.0006753239,0.0011168564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016983835,0.0005275591,0.00081277237,0.0031322513,0.001405237,0.0024285354,0.0017623545,0.0011243648,0.006088662],"category_scores_gemma":[0.014363603,0.00040017883,0.000315516,0.0017849783,0.0027281267,0.0060181883,0.0016733595,0.0019597746,0.00081519195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002422872,0.000057703008,0.002240052,0.00012396886,0.000020885314,0.00016133313,0.00034639277,0.006750887,0.0033222055,0.9710877,0.0035573163,0.012089218],"study_design_scores_gemma":[0.000033820197,0.00003090414,0.0013968651,0.000051626226,0.000025526851,0.00030723077,0.00015153865,0.030647164,0.0011562404,0.9636023,0.0025719407,0.000024737392],"about_ca_topic_score_codex":0.00061333046,"about_ca_topic_score_gemma":0.00079242466,"teacher_disagreement_score":0.006088662,"about_ca_system_score_codex":0.0013828541,"about_ca_system_score_gemma":0.0003962865,"threshold_uncertainty_score":0.020368636},"labels":[],"label_agreement":null},{"id":"W2918815615","doi":"","title":"Minimizing Wiener index of trees containing a prescribed subtree.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Index (typography); Statistics; Combinatorics; Computer science; World Wide Web","score_opus":0.03535646671553372,"score_gpt":0.2953473363639706,"score_spread":0.2599908696484369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918815615","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64374155,0.0012166409,0.2554543,0.0007114802,0.00021620045,0.000047514608,0.00059025537,0.0003509792,0.0976711],"genre_scores_gemma":[0.89308536,0.0008259404,0.0689648,0.00019253146,0.00018369501,0.00009144751,0.0007184081,0.00045646465,0.03548136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996741,0.0000662087,0.000019415413,0.000058097423,0.00010705693,0.00007520645],"domain_scores_gemma":[0.9988329,0.00046096006,0.00019087696,0.0001164804,0.00017785192,0.00022089726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045829391,0.00046581475,0.0006685382,0.0015537861,0.00091449125,0.0018207541,0.00092526583,0.0010800847,0.004510414],"category_scores_gemma":[0.003176401,0.00033418107,0.00044516538,0.0008943114,0.00095202256,0.0021699716,0.0013732283,0.0012107239,0.0014537382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096077696,0.00003070072,0.00081459945,0.00009054148,0.000016912882,0.00019401473,0.00023280634,0.0051147547,0.016179878,0.95943666,0.002502638,0.015290428],"study_design_scores_gemma":[0.000015449914,0.00004407685,0.0010630906,0.000035843383,0.000019637202,0.00032483172,0.00015120102,0.050772976,0.0064473506,0.93641084,0.0046927775,0.000021981006],"about_ca_topic_score_codex":0.00069868035,"about_ca_topic_score_gemma":0.0014793827,"teacher_disagreement_score":0.004510414,"about_ca_system_score_codex":0.0010395012,"about_ca_system_score_gemma":0.00040856336,"threshold_uncertainty_score":0.015088797},"labels":[],"label_agreement":null},{"id":"W2918832912","doi":"","title":"A class of cospectral graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Class (philosophy); Combinatorics; Statistics; Computer science; Artificial intelligence","score_opus":0.022938388817884042,"score_gpt":0.29012750521640757,"score_spread":0.2671891163985235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918832912","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26618722,0.0017291292,0.12823409,0.0031299738,0.0012425005,0.00018915441,0.0022677942,0.0011796895,0.5958404],"genre_scores_gemma":[0.91870743,0.0011127245,0.01807741,0.0012651159,0.0007671915,0.00014108536,0.002365503,0.00033653597,0.05722704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959487,0.00006957662,0.000014879001,0.00013217168,0.00011214259,0.000076359385],"domain_scores_gemma":[0.9990427,0.0002595657,0.00015465773,0.00017890157,0.0001848019,0.00017925046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002470778,0.00058725465,0.00043065374,0.0018093133,0.0019256494,0.0024072062,0.0005650861,0.0010609279,0.023723727],"category_scores_gemma":[0.0016237168,0.00024537556,0.00036579938,0.0017213237,0.0011794105,0.0024853246,0.0011783089,0.0014151353,0.0030200821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040618233,0.000043775646,0.0006987787,0.00005961493,0.000009783879,0.00016275703,0.00014368162,0.0004030364,0.0019579614,0.96857846,0.010450245,0.01745132],"study_design_scores_gemma":[0.00002288233,0.000019612226,0.0012576242,0.00003898947,0.000016380252,0.0010380246,0.0003098202,0.006740118,0.0016280115,0.93822134,0.050690215,0.000017026026],"about_ca_topic_score_codex":0.0007822705,"about_ca_topic_score_gemma":0.0009119066,"teacher_disagreement_score":0.023723727,"about_ca_system_score_codex":0.000589968,"about_ca_system_score_gemma":0.00039873956,"threshold_uncertainty_score":0.07936376},"labels":[],"label_agreement":null},{"id":"W2919067400","doi":"","title":"A degree sequence variant of balanced bipartition problem of graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Sequence (biology); Combinatorics; Genetics; Biology; Physics","score_opus":0.05611509745440838,"score_gpt":0.30466061464293376,"score_spread":0.24854551718852538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919067400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3756678,0.0020441737,0.4668592,0.008767344,0.0010640059,0.00045480343,0.003494813,0.00094167574,0.14070618],"genre_scores_gemma":[0.8461615,0.001227375,0.10961201,0.0010829697,0.0007142381,0.00020067267,0.0041958406,0.00040484432,0.03640054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987913,0.0003233498,0.000059734117,0.00036676656,0.00023828883,0.00022056681],"domain_scores_gemma":[0.9966364,0.0016930079,0.00036322974,0.00047807477,0.00035313674,0.00047614647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085133157,0.0007815589,0.00093786133,0.0012352037,0.0017285403,0.0028100878,0.002068401,0.0028755686,0.016415007],"category_scores_gemma":[0.008581842,0.00046244974,0.0006604188,0.002287701,0.0013589173,0.0061392933,0.0019623656,0.0025790206,0.0018277098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037173746,0.00025373572,0.0013905182,0.00041527007,0.00006155485,0.00043550093,0.0003985357,0.032343626,0.0057425736,0.84564036,0.039177686,0.073768854],"study_design_scores_gemma":[0.000057204285,0.000062875406,0.00055124663,0.000050312075,0.000027245687,0.00044251353,0.00029592536,0.059364423,0.002232934,0.9223202,0.014571939,0.000023163217],"about_ca_topic_score_codex":0.0015331367,"about_ca_topic_score_gemma":0.0013911077,"teacher_disagreement_score":0.016415007,"about_ca_system_score_codex":0.0011501625,"about_ca_system_score_gemma":0.0007834582,"threshold_uncertainty_score":0.05491364},"labels":[],"label_agreement":null},{"id":"W2919068130","doi":"","title":"On the spectral moments of signless Laplacian matrix of trees and unicyclic graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.022112627964107155,"score_gpt":0.29377690374986204,"score_spread":0.27166427578575486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919068130","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5202421,0.009527584,0.39272323,0.0046620253,0.0015080234,0.000057638943,0.0007799449,0.00063129095,0.069868185],"genre_scores_gemma":[0.9759144,0.0019563513,0.013500556,0.00034107806,0.0007135635,0.000055274093,0.00025648507,0.00017111337,0.007091005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955994,0.00016599247,0.000015487618,0.000068091605,0.000105745654,0.00008473071],"domain_scores_gemma":[0.9961972,0.002195512,0.0004904468,0.00027336582,0.0004098345,0.00043358872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009438832,0.00065786805,0.0007279488,0.0024360048,0.00068324024,0.0012764928,0.0013952226,0.0011151838,0.0054195053],"category_scores_gemma":[0.00875794,0.0004134014,0.00046569333,0.0013647887,0.0021797058,0.0028401953,0.0012298034,0.0017659459,0.00089543307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007848432,0.000051668685,0.0007602179,0.00012658267,0.000025448,0.00018061028,0.00026093092,0.011651501,0.0032935115,0.9671911,0.0061549414,0.010225056],"study_design_scores_gemma":[0.000014488448,0.000026234642,0.00097328285,0.000049793147,0.00001500226,0.00026392046,0.00015275273,0.10409922,0.0008632777,0.8908987,0.0026044871,0.00003883794],"about_ca_topic_score_codex":0.0008821725,"about_ca_topic_score_gemma":0.0013085789,"teacher_disagreement_score":0.0054195053,"about_ca_system_score_codex":0.00077066576,"about_ca_system_score_gemma":0.00040082057,"threshold_uncertainty_score":0.018130004},"labels":[],"label_agreement":null},{"id":"W2919123079","doi":"","title":"A sharper lower bound on the signless Laplacian Estrada index.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Statistics; Upper and lower bounds; Mathematical analysis; Computer science","score_opus":0.031400793766020146,"score_gpt":0.28679259908889543,"score_spread":0.2553918053228753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919123079","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113141924,0.017403726,0.32718226,0.018847357,0.0053750817,0.00014797857,0.002767145,0.0018305399,0.513304],"genre_scores_gemma":[0.8331855,0.005789324,0.07519915,0.0071324464,0.004122698,0.00036785146,0.0020583917,0.001189596,0.07095505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985353,0.00033333577,0.00005554606,0.00033068057,0.00050015515,0.0002449099],"domain_scores_gemma":[0.99158746,0.0051544155,0.00049065176,0.0011270633,0.00069195137,0.00094835134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020793453,0.0014989967,0.0016510165,0.0038711648,0.0017474298,0.00404781,0.0033960151,0.0029722985,0.02270565],"category_scores_gemma":[0.017148629,0.0005416184,0.0009765853,0.0024077583,0.0030134118,0.007970636,0.0048677777,0.008886352,0.005871205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019696123,0.000104414255,0.0006859396,0.0003006934,0.000035308993,0.00015213787,0.00020077701,0.0041407263,0.005219538,0.9308034,0.0337003,0.024459759],"study_design_scores_gemma":[0.00003209754,0.000050271166,0.000613958,0.00009040159,0.000038473507,0.0002686418,0.00006436799,0.01846772,0.0014844238,0.9649613,0.013893056,0.00003532966],"about_ca_topic_score_codex":0.00080181385,"about_ca_topic_score_gemma":0.0013674396,"teacher_disagreement_score":0.02270565,"about_ca_system_score_codex":0.0018617681,"about_ca_system_score_gemma":0.00076853315,"threshold_uncertainty_score":0.075957954},"labels":[],"label_agreement":null},{"id":"W2919251934","doi":"","title":"On unicyclic graphs with maximum Harary spectral radius.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Combinatorics; Eigenvalues and eigenvectors; Physics; Quantum mechanics","score_opus":0.018633089515201602,"score_gpt":0.2671748255604362,"score_spread":0.2485417360452346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919251934","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54336256,0.0070468183,0.1942434,0.0045765787,0.00064309244,0.00013196438,0.0014959315,0.000955037,0.24754468],"genre_scores_gemma":[0.961908,0.002214764,0.019385558,0.00047655933,0.00033616237,0.00010224672,0.0004931131,0.00017545154,0.014908106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998874,0.0004785791,0.00004643635,0.00019578125,0.00018166476,0.00022347046],"domain_scores_gemma":[0.9929235,0.0044000978,0.0009863869,0.0006007673,0.00043653225,0.00065276766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006701777,0.00060656515,0.00091982924,0.0025555454,0.0016804906,0.0021638914,0.0013930306,0.001428905,0.011004116],"category_scores_gemma":[0.008932136,0.00054326275,0.00039139352,0.0020603873,0.0022180586,0.0038170354,0.0029380792,0.0014438413,0.00215396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026237062,0.00004941061,0.0009381545,0.00029479776,0.000034772398,0.00028222418,0.00046039882,0.010801152,0.0042912127,0.945717,0.011792849,0.025075732],"study_design_scores_gemma":[0.000033250115,0.000044277986,0.0008066463,0.000098024444,0.000030687086,0.0005770372,0.0004209699,0.027285937,0.0020230755,0.9611328,0.0075203623,0.000026976755],"about_ca_topic_score_codex":0.00061426056,"about_ca_topic_score_gemma":0.00087540183,"teacher_disagreement_score":0.011004116,"about_ca_system_score_codex":0.0009599215,"about_ca_system_score_gemma":0.00034755052,"threshold_uncertainty_score":0.036812425},"labels":[],"label_agreement":null},{"id":"W2919296063","doi":"","title":"On the maximum signless Laplacian spectral radius of bipartite graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Spectral radius; Combinatorics; Graph; Physics; Eigenvalues and eigenvectors; Quantum mechanics","score_opus":0.026933673101849864,"score_gpt":0.2766647719501171,"score_spread":0.24973109884826727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919296063","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4223737,0.011392458,0.40186328,0.008947379,0.0010843135,0.00011396674,0.0011615487,0.0010307609,0.1520327],"genre_scores_gemma":[0.95836157,0.0031019908,0.029065264,0.0007492474,0.0010282692,0.00016391854,0.00037318966,0.00031470903,0.006841756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985274,0.0007574378,0.00005026415,0.00022692252,0.0002876492,0.00015025248],"domain_scores_gemma":[0.9876601,0.008954185,0.0010208534,0.0006880904,0.0007210692,0.0009557035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021766298,0.00088003627,0.0010621414,0.0030238791,0.0010515472,0.00207662,0.0021323408,0.0018119272,0.005823379],"category_scores_gemma":[0.022995906,0.00050774013,0.0003782261,0.0015795563,0.0037114944,0.0049990625,0.0023520722,0.0019517555,0.001484456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020203892,0.00006778689,0.0009931047,0.00028057658,0.00003394059,0.00011340178,0.0002542116,0.015332438,0.0050164866,0.9446249,0.011990348,0.021090759],"study_design_scores_gemma":[0.000026488851,0.00003670297,0.0007921199,0.00007417598,0.000018930004,0.00024741556,0.0001326766,0.061234947,0.0012330331,0.9330429,0.0031318062,0.000028916831],"about_ca_topic_score_codex":0.0004506458,"about_ca_topic_score_gemma":0.0004972125,"teacher_disagreement_score":0.005823379,"about_ca_system_score_codex":0.0011064,"about_ca_system_score_gemma":0.00043003287,"threshold_uncertainty_score":0.019481122},"labels":[],"label_agreement":null},{"id":"W2919430489","doi":"","title":"Extremal Properties of Some Topological Indices of Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Topology (electrical circuits); Combinatorics","score_opus":0.05432449548216772,"score_gpt":0.2916358624358771,"score_spread":0.23731136695370936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919430489","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.756799,0.002078979,0.09579488,0.0020907996,0.0003945499,0.00005275498,0.0010304421,0.00032045643,0.14143819],"genre_scores_gemma":[0.9844599,0.0005049779,0.009442638,0.00013537225,0.00028227887,0.000047400004,0.0003688775,0.00008200467,0.0046767076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994454,0.00015804963,0.000032010666,0.000101505444,0.00016219518,0.00010082315],"domain_scores_gemma":[0.99717927,0.0011725804,0.00060442503,0.00027230865,0.0003258303,0.00044556073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008793142,0.0005238416,0.0005766774,0.003995042,0.0012980001,0.0028312653,0.0009970684,0.0009703657,0.005341282],"category_scores_gemma":[0.005615753,0.00036112894,0.0004997362,0.001662049,0.002355566,0.0034622306,0.0013181726,0.002084105,0.0006032458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042972424,0.000019371626,0.0008637253,0.000040751875,0.000009954861,0.00009095336,0.00015604697,0.0009303828,0.0014457182,0.9904867,0.0015060627,0.0044073793],"study_design_scores_gemma":[0.00001468,0.000022849426,0.0016380192,0.000032447628,0.00001888186,0.00038811995,0.00020891575,0.011039999,0.0009704363,0.98260176,0.0030450975,0.00001887763],"about_ca_topic_score_codex":0.0003529145,"about_ca_topic_score_gemma":0.00042112567,"teacher_disagreement_score":0.005341282,"about_ca_system_score_codex":0.00095343776,"about_ca_system_score_gemma":0.00028866204,"threshold_uncertainty_score":0.0178684},"labels":[],"label_agreement":null},{"id":"W2919798801","doi":"","title":"On the sum of the squares of all distances in trees with fixed diameter.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Statistics; Explained sum of squares","score_opus":0.02478737374470275,"score_gpt":0.27420308874436633,"score_spread":0.24941571499966358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919798801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29032943,0.009165383,0.6291177,0.005112827,0.001037064,0.00008747329,0.0016333257,0.00073222397,0.0627846],"genre_scores_gemma":[0.7842122,0.0045414423,0.17333853,0.0011977328,0.0020552468,0.00028275783,0.0017532278,0.0013878236,0.03123104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832076,0.0006907898,0.000091464906,0.000368476,0.00032881787,0.00019965906],"domain_scores_gemma":[0.98342067,0.013102323,0.0008862537,0.0009553548,0.00076371763,0.0008716034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024841216,0.0012331383,0.001824763,0.0023396604,0.0012181933,0.002566371,0.0035394062,0.0017917508,0.0075803003],"category_scores_gemma":[0.023211839,0.000914601,0.0008784767,0.0021831805,0.0031585237,0.009763708,0.0036495032,0.0035436112,0.001806626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025041297,0.000065151784,0.0018420579,0.00034422558,0.0000933347,0.00015775705,0.0004382065,0.03416808,0.0020788223,0.90851134,0.014989648,0.03706082],"study_design_scores_gemma":[0.000023644317,0.000035680958,0.00086938264,0.00004780617,0.00003777602,0.0002742552,0.00011507721,0.06817925,0.0005272174,0.9260888,0.003775578,0.000025515841],"about_ca_topic_score_codex":0.0015985584,"about_ca_topic_score_gemma":0.0021872167,"teacher_disagreement_score":0.0075803003,"about_ca_system_score_codex":0.0015179393,"about_ca_system_score_gemma":0.00064587756,"threshold_uncertainty_score":0.025358677},"labels":[],"label_agreement":null},{"id":"W2920016910","doi":"","title":"Ordering c-cyclic graphs with respect to signless Laplacian spectral moments.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.023510429681374127,"score_gpt":0.2880957711141978,"score_spread":0.2645853414328237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920016910","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58931386,0.0008002744,0.19079801,0.0016231295,0.0012059463,0.0001412364,0.0009807098,0.00095253746,0.21418433],"genre_scores_gemma":[0.9472904,0.00038336052,0.029566575,0.0006295839,0.0002981439,0.00007463179,0.0004884482,0.00023928336,0.021029651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942505,0.00013398523,0.00002756866,0.0000867678,0.00017805479,0.00014865719],"domain_scores_gemma":[0.99776006,0.00054172915,0.00038344137,0.0003586026,0.0004916141,0.00046454713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042438792,0.0003808333,0.00030750025,0.0020477702,0.0009219605,0.0014168972,0.0005536397,0.0008911212,0.01081347],"category_scores_gemma":[0.0037708587,0.00021937072,0.0002566717,0.0012624598,0.0014545261,0.0013010864,0.0010619578,0.0010555042,0.0013744549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012730785,0.000039821814,0.0005681927,0.00004983294,0.000007263948,0.00020115374,0.00020229918,0.0015759338,0.0128144855,0.9579955,0.0053738873,0.021044351],"study_design_scores_gemma":[0.000035255922,0.00007578641,0.0011278942,0.000033861208,0.000010999574,0.00053335447,0.0002736429,0.01747649,0.0056274314,0.9616936,0.013070576,0.000041147145],"about_ca_topic_score_codex":0.0011575128,"about_ca_topic_score_gemma":0.0023980162,"teacher_disagreement_score":0.01081347,"about_ca_system_score_codex":0.0006339868,"about_ca_system_score_gemma":0.00068278523,"threshold_uncertainty_score":0.036174655},"labels":[],"label_agreement":null},{"id":"W2920071073","doi":"","title":"Arc-Transitive Prime-Valent Graphs Of Order Twice A Prime Power.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transitive relation; Prime (order theory); Prime power; Arc (geometry); Combinatorics; Order (exchange); Geometry; Business","score_opus":0.018223771257146547,"score_gpt":0.2921293774823923,"score_spread":0.2739056062252458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920071073","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4319891,0.0012174682,0.18304136,0.0027247416,0.00074106286,0.00017578853,0.002327653,0.0012933372,0.3764895],"genre_scores_gemma":[0.91568804,0.0006960545,0.027120266,0.0004100499,0.0002552639,0.00007234581,0.0011574699,0.0002031612,0.05439736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999482,0.00010402853,0.000028319539,0.00012907898,0.00013941053,0.00011721086],"domain_scores_gemma":[0.9975337,0.0009856567,0.00038504085,0.00041201996,0.000325129,0.00035849118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004948046,0.00055373734,0.0006354274,0.0015554086,0.0016822979,0.0023892394,0.00091689057,0.0007528088,0.013889553],"category_scores_gemma":[0.0028278155,0.000477303,0.000587983,0.0012975223,0.0018956249,0.0036485463,0.0012508503,0.001580113,0.002137305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091596274,0.00003352701,0.00045601165,0.000057110392,0.000016796012,0.00036726668,0.00030553382,0.0008610001,0.0023358774,0.98356795,0.003646674,0.008260774],"study_design_scores_gemma":[0.000024694626,0.000022936012,0.0004790295,0.00001697227,0.000027915241,0.00043718348,0.00017276469,0.0024071846,0.0015857946,0.9828079,0.012004439,0.000013083398],"about_ca_topic_score_codex":0.0012168029,"about_ca_topic_score_gemma":0.0019548025,"teacher_disagreement_score":0.013889553,"about_ca_system_score_codex":0.0009283597,"about_ca_system_score_gemma":0.0005353387,"threshold_uncertainty_score":0.04646516},"labels":[],"label_agreement":null},{"id":"W2920097892","doi":"","title":"Wiener index and Harary index on Hamilton-connected and traceable graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Wiener index; Combinatorics; Statistics; Graph; Computer science; World Wide Web","score_opus":0.01963593642719662,"score_gpt":0.26641896721847375,"score_spread":0.2467830307912771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920097892","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69388294,0.002361252,0.13336816,0.0020132351,0.00044902263,0.00007328877,0.001049689,0.00037647955,0.16642605],"genre_scores_gemma":[0.9680208,0.00091551634,0.00949819,0.00020274382,0.00029734612,0.00005561059,0.00037954084,0.000109106644,0.020521037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994784,0.00010464496,0.000027560563,0.000094991905,0.00017472968,0.00011968989],"domain_scores_gemma":[0.997162,0.0012291981,0.00049774,0.00023982981,0.00032362746,0.0005475997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064049003,0.0005742307,0.00077320583,0.0039763264,0.0014091516,0.0023438837,0.0013015444,0.0010414475,0.0088700885],"category_scores_gemma":[0.0054293456,0.0003108392,0.00054744584,0.0022289369,0.0024721834,0.0052959686,0.002108077,0.001605634,0.0009440307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031053845,0.000013180877,0.00038670047,0.000025478626,0.000008148422,0.000057615318,0.00012600722,0.001158163,0.00070948794,0.99221087,0.0012054717,0.0040678713],"study_design_scores_gemma":[0.000007012123,0.000008608491,0.00039922644,0.000011250345,0.0000067334995,0.000068526955,0.00006714035,0.006481633,0.00031508785,0.9912621,0.0013631964,0.000009397954],"about_ca_topic_score_codex":0.0013982428,"about_ca_topic_score_gemma":0.0016407327,"teacher_disagreement_score":0.0088700885,"about_ca_system_score_codex":0.0014202312,"about_ca_system_score_gemma":0.0005389811,"threshold_uncertainty_score":0.029673398},"labels":[],"label_agreement":null},{"id":"W2920165927","doi":"","title":"On the first reformulated Zagreb indices of graphs with a given clique number.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Clique; Combinatorics; Clique number; Discrete mathematics; Graph","score_opus":0.01730043306879466,"score_gpt":0.27359028305768107,"score_spread":0.25628984998888643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920165927","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13709132,0.0031820533,0.40103775,0.0031940795,0.0029000184,0.00013891316,0.0014916951,0.000558012,0.45040613],"genre_scores_gemma":[0.76044047,0.0020355922,0.16880558,0.0013931678,0.0015877318,0.00023757381,0.0011969449,0.0007925693,0.063510366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901795,0.00028863872,0.000042196232,0.00018413375,0.00027065442,0.00019643153],"domain_scores_gemma":[0.99835986,0.00058774813,0.00016683253,0.00028325064,0.00035650353,0.00024577536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014869764,0.0008093127,0.001019976,0.002549731,0.0021749248,0.0036124878,0.0022203508,0.0014614488,0.012338669],"category_scores_gemma":[0.0067059053,0.00041816378,0.0008449068,0.0021028135,0.0029965048,0.0064617572,0.001824567,0.004781558,0.0027471075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014638908,0.000008938282,0.00008594382,0.000025058593,0.0000025113268,0.000015692158,0.00006660703,0.00050872634,0.00024194397,0.9925708,0.0021044407,0.004354695],"study_design_scores_gemma":[0.000006320518,0.000011401078,0.0001500532,0.000027613576,0.0000056320173,0.000055608496,0.00004800756,0.0040674503,0.00036331007,0.9869942,0.008258984,0.000011407158],"about_ca_topic_score_codex":0.0019908547,"about_ca_topic_score_gemma":0.0035153094,"teacher_disagreement_score":0.012338669,"about_ca_system_score_codex":0.0020913281,"about_ca_system_score_gemma":0.0010515247,"threshold_uncertainty_score":0.04127693},"labels":[],"label_agreement":null},{"id":"W2920214273","doi":"","title":"The diameter and Wiener index of modular product graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Modular design; Index (typography); Product (mathematics); Discrete mathematics; Graph; Computer science; Geometry; Programming language","score_opus":0.017804591139641113,"score_gpt":0.26872947389541857,"score_spread":0.25092488275577746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920214273","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79427135,0.0042573204,0.08179204,0.0021797512,0.00047200816,0.000029474793,0.0006913359,0.00024198285,0.116064794],"genre_scores_gemma":[0.9826163,0.0013143684,0.006302032,0.00012557834,0.00048886973,0.00004501019,0.00022512027,0.00009843606,0.008784504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995363,0.0001063398,0.000022680577,0.00011990452,0.00011889169,0.00009594493],"domain_scores_gemma":[0.9965215,0.0017598405,0.0006283869,0.00025649727,0.0002526541,0.0005810546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008336667,0.0005639642,0.0006994015,0.0030305653,0.00094555324,0.0021583305,0.0010235821,0.00082690234,0.0044562337],"category_scores_gemma":[0.0066850134,0.00044408604,0.00040543228,0.0011756271,0.0023479112,0.0058011874,0.0018924304,0.0011711991,0.0010423925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091355345,0.000020335476,0.0013934486,0.00005613857,0.000016529268,0.000092802926,0.00027043239,0.0018395381,0.0035845914,0.98224753,0.0026264677,0.007760807],"study_design_scores_gemma":[0.000017800743,0.000028106651,0.0021752531,0.000034190838,0.000025701558,0.0003839367,0.00015832104,0.011961794,0.0021347287,0.9781507,0.0049075517,0.00002189397],"about_ca_topic_score_codex":0.00042524384,"about_ca_topic_score_gemma":0.00043575413,"teacher_disagreement_score":0.0044562337,"about_ca_system_score_codex":0.0009416721,"about_ca_system_score_gemma":0.00026533424,"threshold_uncertainty_score":0.014907539},"labels":[],"label_agreement":null},{"id":"W2920327934","doi":"","title":"Ordering connected non-bipartite graphs by the least Q-eigenvalue.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Eigenvalues and eigenvectors; Discrete mathematics; Graph; Physics; Quantum mechanics","score_opus":0.022627687731638785,"score_gpt":0.2802282080225212,"score_spread":0.25760052029088243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920327934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40754884,0.00091871445,0.45931965,0.0028570218,0.00078899605,0.0002588071,0.0016229202,0.0012450583,0.12543999],"genre_scores_gemma":[0.8129093,0.000663497,0.13526179,0.00090514414,0.00044078805,0.0003052175,0.0012371463,0.00055681146,0.04772013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901545,0.00035940018,0.000058841986,0.00016839367,0.00019882897,0.00019896915],"domain_scores_gemma":[0.9956482,0.0019939775,0.00069192355,0.00045976322,0.0005669216,0.000639254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007908628,0.0006381962,0.0007143847,0.0018492778,0.0014034945,0.0020474703,0.0007305218,0.0012797742,0.016798267],"category_scores_gemma":[0.0055348026,0.00046506696,0.0005369213,0.0013953495,0.0018203554,0.0025214914,0.0014439718,0.0016556004,0.0037797599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003095702,0.0001356089,0.0013565723,0.00021769917,0.000033003602,0.00040492348,0.0005257651,0.004870277,0.01617458,0.927523,0.015173767,0.03327528],"study_design_scores_gemma":[0.00004219448,0.000047063895,0.00059794757,0.000034537392,0.000010364331,0.00025698915,0.0002246792,0.012515668,0.002381524,0.97785485,0.006011721,0.000022368666],"about_ca_topic_score_codex":0.0007350932,"about_ca_topic_score_gemma":0.0016017533,"teacher_disagreement_score":0.016798267,"about_ca_system_score_codex":0.0008316305,"about_ca_system_score_gemma":0.0006905372,"threshold_uncertainty_score":0.056195796},"labels":[],"label_agreement":null},{"id":"W2920466201","doi":"","title":"On Zagreb indices and spectral radius of partial k-trees.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; RADIUS; Spectral radius; Physics; Computer science; Eigenvalues and eigenvectors","score_opus":0.02003394539558644,"score_gpt":0.2844005039640042,"score_spread":0.26436655856841773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920466201","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7290553,0.008106514,0.09426637,0.0022616803,0.000369467,0.00004405468,0.00065758824,0.00032135853,0.16491765],"genre_scores_gemma":[0.9752677,0.002098394,0.0141679095,0.00023568221,0.0003036016,0.00005247304,0.00034352372,0.0001173363,0.0074133724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992143,0.0002458445,0.000047623056,0.00013852447,0.00018760188,0.00016604224],"domain_scores_gemma":[0.99566144,0.0023649072,0.0006924661,0.00033982625,0.00037971127,0.00056162523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011424702,0.0005114217,0.0010967718,0.00354756,0.0017050918,0.0030394818,0.0013517464,0.001026105,0.005721359],"category_scores_gemma":[0.009063406,0.00038821873,0.00032404604,0.0023045277,0.0027015926,0.005344995,0.0021024963,0.0017999883,0.00143097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007474296,0.000024135159,0.0012445007,0.000060138587,0.000010055823,0.000046518853,0.0003107499,0.0020588746,0.00089470885,0.9819402,0.0019601919,0.011375202],"study_design_scores_gemma":[0.000013147279,0.00001769666,0.0013865863,0.00004806718,0.000015742708,0.0002045256,0.0002653106,0.00845921,0.00050995627,0.98497194,0.0040913387,0.00001637871],"about_ca_topic_score_codex":0.0015039508,"about_ca_topic_score_gemma":0.0018768464,"teacher_disagreement_score":0.005721359,"about_ca_system_score_codex":0.0012653448,"about_ca_system_score_gemma":0.00042474447,"threshold_uncertainty_score":0.019139886},"labels":[],"label_agreement":null},{"id":"W2920501364","doi":"","title":"Integral Graphs With Distinct Eigenvalues.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Pure mathematics; Physics","score_opus":0.024139030417929874,"score_gpt":0.28524564654847334,"score_spread":0.2611066161305435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920501364","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40600115,0.0018638506,0.22817063,0.0045184577,0.0009977306,0.00010298266,0.00087859004,0.00082267926,0.35664394],"genre_scores_gemma":[0.9378573,0.0007274803,0.027277535,0.00053922,0.0003744794,0.00007128399,0.00037636174,0.0001858493,0.03259045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942243,0.00011245135,0.000022162063,0.00012530028,0.00019593918,0.000121725345],"domain_scores_gemma":[0.9985266,0.0005516788,0.0002038974,0.00023662779,0.00023182626,0.0002492656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045559247,0.0005610331,0.000597304,0.0023877227,0.0013862567,0.002503169,0.0008095626,0.00125861,0.01290766],"category_scores_gemma":[0.0035498603,0.00041586408,0.00047190703,0.0010967499,0.0025600512,0.003566418,0.0023817862,0.00228738,0.0021095644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025102509,0.000016426884,0.00017306299,0.000025487045,0.000005409511,0.00010986095,0.00009691868,0.0003414719,0.0012187365,0.99054724,0.0024257472,0.0050145276],"study_design_scores_gemma":[0.000009770367,0.0000054387856,0.00022801185,0.000013268261,0.000006854235,0.00024722968,0.00008468505,0.0030676776,0.0004955988,0.9927246,0.0031103764,0.0000064970013],"about_ca_topic_score_codex":0.0004504504,"about_ca_topic_score_gemma":0.0007383856,"teacher_disagreement_score":0.01290766,"about_ca_system_score_codex":0.0008903239,"about_ca_system_score_gemma":0.00045931904,"threshold_uncertainty_score":0.043180406},"labels":[],"label_agreement":null},{"id":"W2920753679","doi":"","title":"Hyper-Wiener index and Hamiltonicity of graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Wiener index; Combinatorics; Statistics; Graph; Computer science; World Wide Web","score_opus":0.022559600643046556,"score_gpt":0.28002582304284424,"score_spread":0.25746622239979766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920753679","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6847284,0.00428952,0.12872592,0.0027103606,0.00047636015,0.000060279704,0.0007982669,0.00026563625,0.1779453],"genre_scores_gemma":[0.96940494,0.0013733725,0.008564313,0.00024486592,0.0003214429,0.000046390058,0.00029269888,0.00006822052,0.01968367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996865,0.00007567641,0.000015233156,0.00005861057,0.00009824245,0.00006575213],"domain_scores_gemma":[0.9985446,0.0005766593,0.0003131752,0.00013259103,0.00017369824,0.00025937246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047391732,0.00037535987,0.0004662359,0.0027541236,0.00082035956,0.0019123661,0.00065260375,0.0006506735,0.0054375473],"category_scores_gemma":[0.003273261,0.00026692718,0.00038657867,0.0014162719,0.0019535748,0.0029243284,0.0012686875,0.0010441258,0.00079786347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022963624,0.000011276127,0.0005750721,0.000028376175,0.000008563916,0.000056018594,0.00012647352,0.00090570294,0.0012441468,0.99001336,0.0013183424,0.005689645],"study_design_scores_gemma":[0.0000058290907,0.000007281133,0.0005548039,0.000011462391,0.000005671098,0.00007030786,0.000070076116,0.0041777296,0.00037909718,0.99293643,0.0017739575,0.0000072642097],"about_ca_topic_score_codex":0.0012862411,"about_ca_topic_score_gemma":0.0020695708,"teacher_disagreement_score":0.0054375473,"about_ca_system_score_codex":0.0009849529,"about_ca_system_score_gemma":0.0004180187,"threshold_uncertainty_score":0.018190444},"labels":[],"label_agreement":null},{"id":"W2921118646","doi":"10.14738/assrj.62.6200","title":"The complexity coefficient for acyclic networks measuring network density: Application to project management","year":2019,"lang":"en","type":"article","venue":"Advances in Social Sciences Research Journal","topic":"Graph theory and applications","field":"Mathematics","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":"McMaster University","keywords":"Node (physics); Arc (geometry); Computer science; Directed acyclic graph; Mathematics; Theoretical computer science; Algorithm; Physics","score_opus":0.21064252480353976,"score_gpt":0.4867873723221334,"score_spread":0.2761448475185937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921118646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041060116,0.0014720509,0.9479415,0.00044966745,0.00010908615,0.00006703825,0.00019763464,0.0001489513,0.008554047],"genre_scores_gemma":[0.8204264,0.0025603673,0.17300782,0.00012841087,0.00040736955,0.00022217837,0.00033006942,0.00015660984,0.0027607619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793303,0.0006964618,0.00012004924,0.00028359733,0.00077582867,0.00019103447],"domain_scores_gemma":[0.96531737,0.02785153,0.0026613448,0.0014261593,0.0020730665,0.00067049376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024929363,0.00096706755,0.0008042798,0.004406731,0.00052903476,0.0018849649,0.0011482288,0.0007683387,0.0016639694],"category_scores_gemma":[0.027431149,0.00034683506,0.00082507945,0.003189448,0.00162438,0.0035860264,0.0021682067,0.0017111885,0.00024249141],"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.000086709326,0.0000913761,0.007227115,0.00037111584,0.00012361772,0.00032490812,0.0004417107,0.3601947,0.0070511904,0.5255232,0.0032953785,0.09526893],"study_design_scores_gemma":[0.0000046438504,0.00006171168,0.0023326231,0.00007817784,0.000040355728,0.00033282972,0.00011287798,0.8041372,0.0020319887,0.18765177,0.003150187,0.000065569184],"about_ca_topic_score_codex":0.0018359326,"about_ca_topic_score_gemma":0.0012304924,"teacher_disagreement_score":0.004406731,"about_ca_system_score_codex":0.0017248687,"about_ca_system_score_gemma":0.0007607326,"threshold_uncertainty_score":0.013184071},"labels":[],"label_agreement":null},{"id":"W2942306438","doi":"10.2298/yjor181115010d","title":"Minimum eccentric connectivity index for graphs with fixed order and fixed number of pendant vertices","year":2019,"lang":"en","type":"article","venue":"Yugoslav journal of operations research","topic":"Graph theory and applications","field":"Mathematics","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","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Connectivity; Topological index; Graph; Order (exchange); Vertex connectivity; Discrete mathematics","score_opus":0.06781829762024214,"score_gpt":0.40824239357759495,"score_spread":0.3404240959573528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942306438","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91144794,0.00050106953,0.07365498,0.00024433233,0.000019872256,0.000021672578,0.00053857925,0.00012061474,0.013450922],"genre_scores_gemma":[0.9819288,0.0002998464,0.015957765,0.000028154305,0.00003410917,0.000027842598,0.0004147987,0.000039680162,0.0012690454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997762,0.000031033644,0.000012064633,0.0000749871,0.00006113245,0.00004461078],"domain_scores_gemma":[0.99833494,0.00080686976,0.00034764415,0.00015068798,0.00017340691,0.00018648361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033175998,0.00035811745,0.00045337173,0.0016893358,0.00054459,0.0009297787,0.0004836607,0.000459485,0.001190046],"category_scores_gemma":[0.002774114,0.00016757793,0.00022292676,0.0010932069,0.0008617826,0.001633803,0.0005004601,0.0004047235,0.000116698575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012419632,0.00017132988,0.0254064,0.00056902284,0.00011430327,0.0011264182,0.0010731001,0.1743778,0.07594725,0.6539543,0.0062287487,0.059789397],"study_design_scores_gemma":[0.00008798291,0.00024918068,0.01838502,0.000095238785,0.00010553218,0.002125916,0.0005194605,0.36119604,0.02131255,0.58753204,0.00832666,0.00006436035],"about_ca_topic_score_codex":0.00058462453,"about_ca_topic_score_gemma":0.0008480428,"teacher_disagreement_score":0.0016893358,"about_ca_system_score_codex":0.00082661037,"about_ca_system_score_gemma":0.00028307148,"threshold_uncertainty_score":0.0059975386},"labels":[],"label_agreement":null},{"id":"W2946031841","doi":"10.4153/s000843951900064x","title":"Stable Components and Layers","year":2019,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Graph theory and applications","field":"Mathematics","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":"Western University","funders":"","keywords":"Path (computing); Set (abstract data type); Component (thermodynamics); Stability (learning theory); Topology (electrical circuits)","score_opus":0.02484929281959721,"score_gpt":0.24430282106295687,"score_spread":0.21945352824335965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946031841","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49855548,0.0013383968,0.28750694,0.00136223,0.00033464897,0.00026384887,0.0012883922,0.0011612478,0.20818879],"genre_scores_gemma":[0.939345,0.00040071888,0.03264865,0.00019338416,0.00011006798,0.0001339215,0.0006016478,0.0002929338,0.026273772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988937,0.00018584618,0.000072037124,0.00025831314,0.0003771791,0.00021286368],"domain_scores_gemma":[0.9978393,0.00047728885,0.00030632192,0.00035032377,0.00063903705,0.0003878348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070338603,0.00078262057,0.0004486266,0.003962635,0.0016434556,0.0041826195,0.0008797864,0.0007155948,0.015704896],"category_scores_gemma":[0.0039065895,0.0005296963,0.0005017842,0.002165934,0.002901869,0.004436681,0.0025674405,0.0011650942,0.001669267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016400894,0.000005367002,0.0005335011,0.00002330399,0.000007349119,0.000041914955,0.0001392811,0.00067683443,0.00081069925,0.9900822,0.0012451853,0.006418125],"study_design_scores_gemma":[0.0000067533997,0.000013415353,0.0010307885,0.000022308965,0.000015240357,0.00014612512,0.00021059804,0.006861384,0.0018342823,0.9769932,0.012850411,0.00001547022],"about_ca_topic_score_codex":0.002141121,"about_ca_topic_score_gemma":0.0021822688,"teacher_disagreement_score":0.015704896,"about_ca_system_score_codex":0.001519771,"about_ca_system_score_gemma":0.0006072844,"threshold_uncertainty_score":0.052538097},"labels":[],"label_agreement":null},{"id":"W2946625573","doi":"10.1016/j.disc.2019.04.022","title":"Corrigendum to “Colorings and spectral radius of digraphs” [Discrete Math. 339 (1) (2016) 327–332]","year":2019,"lang":"en","type":"erratum","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"National Natural Science Foundation of China-Shandong Joint Fund for Marine Science Research Centers","keywords":"Mathematics; Spectral radius; Combinatorics; RADIUS; Order (exchange); Discrete mathematics; Eigenvalues and eigenvectors; Computer science; Physics","score_opus":0.031839465290369476,"score_gpt":0.2884899560437913,"score_spread":0.25665049075342183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946625573","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.00021340583,0.0063937553,0.002473957,0.076149665,0.8859083,0.00004968859,0.00198241,0.00056972896,0.026259115],"genre_scores_gemma":[0.013851978,0.023392,0.007750645,0.09223798,0.33179572,0.0003068939,0.0055513442,0.0020752938,0.52303815],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99587977,0.00074947265,0.0004573472,0.0008488339,0.0017711812,0.000293444],"domain_scores_gemma":[0.9844242,0.003923854,0.0005232932,0.0012719732,0.009223485,0.0006332984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025887438,0.0023892554,0.0029801556,0.0063329837,0.0033511226,0.00435151,0.0043643457,0.004651307,0.11585852],"category_scores_gemma":[0.028072909,0.0011087169,0.002654497,0.004878713,0.0026646256,0.005470769,0.0023901602,0.0066923313,0.060925946],"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.000015808413,0.000006757929,0.000033246535,0.00010699972,0.00000931421,0.000037366433,0.000011584858,0.000065591834,0.00003368103,0.003372859,0.99249214,0.003814631],"study_design_scores_gemma":[0.00003808127,0.000028222648,0.0010736386,0.0003186095,0.00005126614,0.00022284761,0.000055676417,0.0006771175,0.00029934416,0.025337199,0.9718322,0.000065739194],"about_ca_topic_score_codex":0.026915032,"about_ca_topic_score_gemma":0.029780952,"teacher_disagreement_score":0.11585852,"about_ca_system_score_codex":0.0072560147,"about_ca_system_score_gemma":0.0031178733,"threshold_uncertainty_score":0.3875854},"labels":[],"label_agreement":null},{"id":"W2948357568","doi":"10.1016/j.laa.2019.05.035","title":"Complete multipartite graphs and Braess edges","year":2019,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Multipartite; Mathematics; Combinatorics; Constant (computer programming); Markov chain; Discrete mathematics; Graph; Enhanced Data Rates for GSM Evolution; Computer science; Statistics","score_opus":0.03483291375931677,"score_gpt":0.2896383067048822,"score_spread":0.2548053929455655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948357568","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42500803,0.0038274212,0.37806386,0.0038035752,0.00079307455,0.00011956097,0.001289677,0.0005102156,0.1865845],"genre_scores_gemma":[0.88417417,0.0019498261,0.051122446,0.0012114854,0.0007857473,0.0001997433,0.0009898639,0.00041724715,0.059149347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990103,0.00036207965,0.00003922835,0.00023625368,0.00020623044,0.0001458667],"domain_scores_gemma":[0.99644333,0.0017882655,0.00051827804,0.0005120777,0.0003448902,0.00039329028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00098669,0.0009950745,0.0013959236,0.0030616347,0.0030109503,0.0048251334,0.0015741917,0.0020758891,0.013332103],"category_scores_gemma":[0.0036402855,0.0012543538,0.0010632895,0.003938382,0.003712302,0.006985206,0.0025827105,0.0034326937,0.0016956667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016243526,0.000018198602,0.00006899718,0.000030072546,0.0000065369304,0.000038856873,0.000114159884,0.0010037628,0.00037337563,0.9946308,0.0012341843,0.0024647627],"study_design_scores_gemma":[0.000004554242,0.0000035150665,0.00008112334,0.000008217416,0.000003763797,0.00004818965,0.0000535851,0.0027184137,0.00014026403,0.9954638,0.0014687185,0.0000057808143],"about_ca_topic_score_codex":0.0006800204,"about_ca_topic_score_gemma":0.00096869183,"teacher_disagreement_score":0.013332103,"about_ca_system_score_codex":0.000757219,"about_ca_system_score_gemma":0.0004243691,"threshold_uncertainty_score":0.044600308},"labels":[],"label_agreement":null},{"id":"W2948867122","doi":"10.1515/spma-2020-0106","title":"Maximum nullity and zero forcing of circulant graphs","year":2020,"lang":"en","type":"preprint","venue":"Special Matrices","topic":"Graph theory and applications","field":"Mathematics","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":"Redeemer University; McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Circulant matrix; Bipartite graph; Mathematics; Zero (linguistics); Combinatorics; Upper and lower bounds; Circulant graph; Graph; Forcing (mathematics); Rank (graph theory); Torus; Discrete mathematics; Line graph; Voltage graph; Mathematical analysis; Geometry","score_opus":0.055796252488866674,"score_gpt":0.3084285747196465,"score_spread":0.25263232223077986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948867122","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8061809,0.00019762953,0.17835549,0.0003172121,0.00006229385,0.000026774473,0.00020996924,0.00016554317,0.014484217],"genre_scores_gemma":[0.98551834,0.00009068599,0.012711551,0.00003575688,0.00004346011,0.000025783862,0.00009605262,0.000036405552,0.0014418458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992224,0.0002075632,0.00003544184,0.0001412381,0.00023032125,0.00016296453],"domain_scores_gemma":[0.99194443,0.0043825377,0.0011801968,0.00075171125,0.00082381343,0.00091722386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092116155,0.00040529916,0.00047708946,0.0018078983,0.0010178544,0.0012308242,0.00067752536,0.0005388527,0.003105605],"category_scores_gemma":[0.006574475,0.00023066963,0.0003454361,0.00058794324,0.002583036,0.0015293465,0.0009897923,0.0007326336,0.00029589955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020110876,0.00006204609,0.0036519575,0.00009833484,0.000019378278,0.00021570799,0.00031846468,0.025187185,0.032967504,0.92496943,0.0013491042,0.010959756],"study_design_scores_gemma":[0.000027298285,0.00015229899,0.002891449,0.00005375528,0.000014144373,0.00037235246,0.00025293598,0.13412353,0.019302798,0.8401876,0.0025703497,0.000051385152],"about_ca_topic_score_codex":0.00046764355,"about_ca_topic_score_gemma":0.00072264456,"teacher_disagreement_score":0.003105605,"about_ca_system_score_codex":0.00062382274,"about_ca_system_score_gemma":0.00050243683,"threshold_uncertainty_score":0.010389328},"labels":[],"label_agreement":null},{"id":"W2949216217","doi":"10.1063/1.3622608","title":"Levinson's theorem for graphs","year":2011,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Graph theory and applications","field":"Mathematics","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":"Mitacs","keywords":"Mathematics; Upper and lower bounds; Vertex (graph theory); Combinatorics; Bound state; Scattering; Graph; Path (computing); State (computer science); Discrete mathematics; Mathematical analysis; Physics; Quantum mechanics","score_opus":0.11118948297143015,"score_gpt":0.3235141126207051,"score_spread":0.21232462964927495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949216217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29462475,0.001629065,0.55500025,0.0047752243,0.0003542027,0.00011752423,0.00074944814,0.00093720964,0.14181226],"genre_scores_gemma":[0.9330842,0.0009657585,0.046645988,0.0014225743,0.0002525502,0.0002243997,0.00047252834,0.00023922011,0.016692748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990325,0.00022235318,0.000056811263,0.00023031392,0.0002301982,0.00022787004],"domain_scores_gemma":[0.9965256,0.0021908197,0.00022456875,0.00041241574,0.00042116523,0.00022549542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015901619,0.00071513944,0.0010202612,0.0017649739,0.0015177954,0.0019138384,0.001237265,0.0011923863,0.00740389],"category_scores_gemma":[0.0061592874,0.00050425925,0.0014099046,0.001380475,0.0029424615,0.0050133686,0.0027506736,0.0021348018,0.0009044007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031127118,0.000011973673,0.00039006278,0.00005938661,0.000019467503,0.00008032724,0.0001838516,0.0021800702,0.0012778571,0.98815906,0.0020751471,0.0055315834],"study_design_scores_gemma":[0.000015799147,0.000014871312,0.00026125528,0.0000137367,0.000011616035,0.00010866857,0.00003930988,0.010855779,0.00055832684,0.98442405,0.0036880428,0.000008527602],"about_ca_topic_score_codex":0.0013872556,"about_ca_topic_score_gemma":0.0009893337,"teacher_disagreement_score":0.00740389,"about_ca_system_score_codex":0.0019382503,"about_ca_system_score_gemma":0.000623069,"threshold_uncertainty_score":0.024768472},"labels":[],"label_agreement":null},{"id":"W2949221507","doi":"10.48550/arxiv.1012.2950","title":"Average Degree in Graph Powers","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"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","keywords":"Combinatorics; Mathematics; Degree (music); Graph; Vertex (graph theory); Simple graph; Connectivity; Bound graph; Discrete mathematics; Graph power; Line graph; Physics","score_opus":0.1270008475263148,"score_gpt":0.22367727960767733,"score_spread":0.09667643208136253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949221507","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5986325,0.006160185,0.30653656,0.004447723,0.00046027676,0.00009374367,0.0018641555,0.0005419562,0.08126292],"genre_scores_gemma":[0.9729479,0.0020644392,0.018166143,0.00028975416,0.00041039014,0.00006867644,0.0003812233,0.00014411716,0.005527337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787784,0.00036711548,0.00009500717,0.0006874254,0.0005104436,0.00046214543],"domain_scores_gemma":[0.98749614,0.00802442,0.0011463382,0.0015517642,0.00085252913,0.00092874205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014132794,0.0007805222,0.001229704,0.0025149537,0.0015284219,0.0030862526,0.0020162803,0.0010325403,0.0056603807],"category_scores_gemma":[0.017770732,0.0005881209,0.00087654695,0.0027453825,0.0027085545,0.0074478895,0.0024494042,0.0017233242,0.0009943774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008105446,0.00010993663,0.013469397,0.0006334035,0.00015414311,0.0006089866,0.0012407749,0.090871476,0.011920411,0.7948507,0.010932657,0.074397564],"study_design_scores_gemma":[0.00005181254,0.00012998693,0.0037372815,0.000091859154,0.00007666487,0.0011124641,0.0003528702,0.099574976,0.00507741,0.8755439,0.014207217,0.00004354179],"about_ca_topic_score_codex":0.00091637607,"about_ca_topic_score_gemma":0.0010627755,"teacher_disagreement_score":0.0056603807,"about_ca_system_score_codex":0.0015001234,"about_ca_system_score_gemma":0.00044983183,"threshold_uncertainty_score":0.01893586},"labels":[],"label_agreement":null},{"id":"W2949500475","doi":"10.1016/j.disc.2019.05.002","title":"On the reliability roots of simplicial complexes and matroids","year":2019,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"Dalhousie University","funders":"","keywords":"Matroid; Mathematics; h-vector; Combinatorics; Abstract simplicial complex; Simplicial complex; Simplicial homology; Reliability (semiconductor); Simplicial approximation theorem; Discrete mathematics; Simplicial set; Pure mathematics","score_opus":0.023838984940373703,"score_gpt":0.2936747050196915,"score_spread":0.2698357200793178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949500475","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35398403,0.008086273,0.46487856,0.009986441,0.00068876037,0.00010305864,0.0006894978,0.00033096445,0.16125244],"genre_scores_gemma":[0.92680186,0.0041667973,0.038518142,0.00052483584,0.0010900857,0.00007752888,0.00030946554,0.00025782845,0.028253376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986929,0.00047317424,0.000052445186,0.00022183945,0.00041583198,0.00014371864],"domain_scores_gemma":[0.98622686,0.009853767,0.0011790295,0.00098905,0.0009858002,0.00076548144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020310634,0.0008423625,0.0014200074,0.0026532512,0.0014558661,0.0036107,0.0015913426,0.0016655679,0.011616952],"category_scores_gemma":[0.018238023,0.0008824731,0.00073201564,0.002178784,0.0047971243,0.008467758,0.0028317876,0.004774008,0.0014926112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017302287,0.000009019419,0.00020451407,0.00004358897,0.000005983401,0.00003221469,0.00025445077,0.0025925254,0.0003424783,0.9900197,0.0012740508,0.005204221],"study_design_scores_gemma":[0.0000053501426,0.000005122499,0.00016615704,0.000011909689,0.000003892794,0.00003579631,0.000057395566,0.005235209,0.00008685005,0.99248815,0.0018972058,0.0000070093893],"about_ca_topic_score_codex":0.0016264104,"about_ca_topic_score_gemma":0.0014313563,"teacher_disagreement_score":0.011616952,"about_ca_system_score_codex":0.0015018085,"about_ca_system_score_gemma":0.0004928445,"threshold_uncertainty_score":0.038862526},"labels":[],"label_agreement":null},{"id":"W2949550924","doi":"10.48550/arxiv.0712.1631","title":"Cayley sum graphs and eigenvalues of $(3,6)$-fullerenes","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Graph theory and applications","field":"Mathematics","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":"Simon Fraser University","funders":"","keywords":"Fullerene; Eigenvalues and eigenvectors; Combinatorics; Mathematics; Chemistry; Physics; Quantum mechanics; Organic chemistry","score_opus":0.12000733246884947,"score_gpt":0.3498742238551673,"score_spread":0.22986689138631783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949550924","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97553355,0.00014215926,0.008819907,0.00020206525,0.00001957306,0.000006570488,0.00012750197,0.00006784604,0.015080782],"genre_scores_gemma":[0.99512297,0.00009995588,0.0034176796,0.00003597101,0.00000968687,0.000008245182,0.00008701628,0.000017928556,0.0012004916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999912,0.000009386098,0.0000026978134,0.000018366261,0.000030739106,0.000026774074],"domain_scores_gemma":[0.9997322,0.000087968605,0.00007110666,0.000021538975,0.000041782714,0.000045317873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009508439,0.00028629534,0.00016752987,0.0015934684,0.00073029316,0.0006843187,0.00029896805,0.00050873787,0.0039536906],"category_scores_gemma":[0.00048930995,0.00013688237,0.00017872387,0.00053260685,0.00080590736,0.0006677891,0.00044501922,0.0004795095,0.0002860926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013172699,0.000076134565,0.0037520933,0.00009660689,0.00001757345,0.00073430996,0.00083203067,0.018441077,0.056775965,0.89825225,0.0032895494,0.017600648],"study_design_scores_gemma":[0.000029166627,0.000040462426,0.005639252,0.000046207297,0.000014087861,0.0007224481,0.001223545,0.11919159,0.0272171,0.84135514,0.0044751903,0.000045840665],"about_ca_topic_score_codex":0.0011235891,"about_ca_topic_score_gemma":0.0016418487,"teacher_disagreement_score":0.0039536906,"about_ca_system_score_codex":0.00036180814,"about_ca_system_score_gemma":0.00015570848,"threshold_uncertainty_score":0.0132264495},"labels":[],"label_agreement":null},{"id":"W2950349084","doi":"10.48550/arxiv.math/0301048","title":"The number of terms in the permanent and the determinant of a generic circulant matrix","year":2003,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Graph theory and applications","field":"Mathematics","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":"Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Circulant matrix; Mathematics; Matrix (chemical analysis); Combinatorics; Arithmetic; Pure mathematics","score_opus":0.05432822009444279,"score_gpt":0.3351910113159415,"score_spread":0.2808627912214987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950349084","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8193528,0.0014632815,0.116719656,0.0028708067,0.0006489867,0.00009303715,0.0010594437,0.00039558954,0.05739644],"genre_scores_gemma":[0.9686085,0.0007000227,0.016088657,0.00023722161,0.0005494274,0.00010584285,0.0005041302,0.00015917726,0.013047071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988342,0.00025629887,0.000070955444,0.00020223853,0.0003526275,0.00028359395],"domain_scores_gemma":[0.9925379,0.0039439667,0.00086937606,0.0008951746,0.00073432113,0.0010192385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013556844,0.0007155055,0.0010260742,0.0022275564,0.0022340775,0.002582445,0.0015365112,0.0015970767,0.0061370363],"category_scores_gemma":[0.00674637,0.0004940133,0.0006316746,0.0011885642,0.00423038,0.0034019558,0.00149117,0.00163992,0.00095370936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039724214,0.000112916765,0.0027723087,0.00020200899,0.000043120843,0.00077158865,0.00039517583,0.004918505,0.019899292,0.9408082,0.0069129784,0.022766687],"study_design_scores_gemma":[0.00007702652,0.0001486995,0.004274793,0.00007416715,0.00007534316,0.0018416604,0.00018377075,0.035377756,0.0135585815,0.93465585,0.009599027,0.00013325195],"about_ca_topic_score_codex":0.00053653127,"about_ca_topic_score_gemma":0.00086109014,"teacher_disagreement_score":0.0061370363,"about_ca_system_score_codex":0.0011119886,"about_ca_system_score_gemma":0.0010230191,"threshold_uncertainty_score":0.020530462},"labels":[],"label_agreement":null},{"id":"W2950493260","doi":"10.48550/arxiv.1505.01321","title":"Hermitian adjacency matrix of digraphs and mixed graphs","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"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; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Digraph; Hermitian matrix; Adjacency matrix; Eigenvalues and eigenvectors; Combinatorics; Spectral radius; Interlacing; Matrix (chemical analysis); Mathematics; Arc (geometry); Spectrum (functional analysis); Discrete mathematics; Pure mathematics; Computer science; Physics; Graph; Geometry; Quantum mechanics","score_opus":0.1126187601966015,"score_gpt":0.23687426074914397,"score_spread":0.12425550055254247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950493260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20121257,0.0057607065,0.6924964,0.0015875081,0.0006615447,0.00011591502,0.0012344193,0.00057236035,0.09635857],"genre_scores_gemma":[0.8720253,0.0024914916,0.10505354,0.00062366045,0.0005163369,0.00017405816,0.00063992833,0.0001498579,0.018325763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995272,0.00012979053,0.000031968073,0.00012987251,0.000116124334,0.00006499588],"domain_scores_gemma":[0.9991768,0.0003375342,0.0001330286,0.00010110259,0.00013303608,0.000118493226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003301735,0.0005622282,0.0003562708,0.0022710802,0.0007943534,0.0015127207,0.0005405438,0.0006356194,0.006228841],"category_scores_gemma":[0.0015707562,0.00031509425,0.00032620746,0.0014973975,0.0014290069,0.0019913057,0.0009400482,0.0010624845,0.00095684984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010624313,0.0000099330455,0.00019799876,0.000041937226,0.000005734892,0.000083240586,0.00016776618,0.0016242625,0.0018646502,0.98535734,0.0011010835,0.009535401],"study_design_scores_gemma":[0.0000047936437,0.000018579904,0.00043246045,0.00001869294,0.0000045057204,0.00023329271,0.00009524761,0.012770238,0.00081389653,0.9749874,0.010603369,0.000017549959],"about_ca_topic_score_codex":0.0009133971,"about_ca_topic_score_gemma":0.0009259366,"teacher_disagreement_score":0.006228841,"about_ca_system_score_codex":0.00081780733,"about_ca_system_score_gemma":0.00032143656,"threshold_uncertainty_score":0.020837545},"labels":[],"label_agreement":null},{"id":"W2951648555","doi":"10.48550/arxiv.1311.6561","title":"Entropy of Symmetric Graphs","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph theory and applications","field":"Mathematics","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":"Combinatorics; Mathematics; Perfect graph theorem; Perfect graph; Discrete mathematics; Circulant graph; Factor-critical graph; Disjoint sets; Line graph; Windmill graph; Voltage graph; Graph; Graph power","score_opus":0.09999484324013189,"score_gpt":0.21182541330755353,"score_spread":0.11183057006742164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951648555","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83858186,0.0004942174,0.14063387,0.00070774264,0.00007642265,0.000038770762,0.0006319241,0.00015300434,0.018682182],"genre_scores_gemma":[0.9923787,0.00018828767,0.0053921095,0.000072686686,0.0000949765,0.00003573687,0.00024789752,0.000046934343,0.0015426334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991026,0.00031715212,0.000044418102,0.00016305925,0.00021479673,0.00015804003],"domain_scores_gemma":[0.99636084,0.0020794466,0.0005080628,0.00044973462,0.00024397722,0.0003578935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094003876,0.00038758418,0.00057479134,0.0019014829,0.00056810107,0.001329327,0.000712167,0.00060206914,0.002228271],"category_scores_gemma":[0.0046962746,0.00023293676,0.0005310681,0.0007231372,0.002170464,0.0023447615,0.001324806,0.00063495187,0.0002406112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001261257,0.000032463384,0.0020594858,0.0000715134,0.000032859523,0.00016793692,0.00027599483,0.023353407,0.005709487,0.9589011,0.00118967,0.008079932],"study_design_scores_gemma":[0.000015051622,0.00003125691,0.0017748823,0.000016092043,0.000011255846,0.00015821548,0.00008426675,0.081554845,0.0015512072,0.9137115,0.0010728878,0.000018496725],"about_ca_topic_score_codex":0.00052829407,"about_ca_topic_score_gemma":0.00032324228,"teacher_disagreement_score":0.002228271,"about_ca_system_score_codex":0.00097525935,"about_ca_system_score_gemma":0.00032370116,"threshold_uncertainty_score":0.007454276},"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":"W2951772545","doi":"10.48550/arxiv.1201.2167","title":"Spectrum of Cayley graphs on the symmetric group generated by transpositions","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph theory and applications","field":"Mathematics","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":"Simon Fraser University","funders":"","keywords":"Cayley graph; Combinatorics; Mathematics; Symmetric group; Integer (computer science); Spectrum (functional analysis); Group (periodic table); Graph; Vertex-transitive graph; Cayley's theorem; Discrete mathematics; Physics; Voltage graph; Computer science; Line graph","score_opus":0.09339835945775307,"score_gpt":0.20272168606362256,"score_spread":0.10932332660586949,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951772545","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90835655,0.0005668296,0.0416204,0.00066636247,0.00011895791,0.000025467987,0.0005064163,0.00028785528,0.047851104],"genre_scores_gemma":[0.98811334,0.00026902076,0.006009083,0.00013526504,0.000088876805,0.000038950457,0.00038928533,0.000056787823,0.0048993793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997806,0.000042606596,0.000008447574,0.000051357056,0.000059405535,0.00005765315],"domain_scores_gemma":[0.9996301,0.00010751949,0.0000787142,0.0000350348,0.00005686319,0.0000917416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018866142,0.00041283178,0.00029717432,0.0015428271,0.0006165239,0.0011173482,0.00043730106,0.00040438835,0.0045258338],"category_scores_gemma":[0.0006015819,0.00018709234,0.00026056974,0.0006258278,0.0009665212,0.0009689078,0.0006010372,0.00044391488,0.0005602903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014123766,0.000042327803,0.0009857375,0.0000488571,0.000013267387,0.00036795277,0.00042607196,0.0033694494,0.01762825,0.9603069,0.0035822564,0.013087737],"study_design_scores_gemma":[0.000043833275,0.00006053615,0.0023265288,0.00003066805,0.000011873892,0.00046722998,0.00037257644,0.031161074,0.0066505075,0.9521096,0.0067351963,0.000030347022],"about_ca_topic_score_codex":0.0009189769,"about_ca_topic_score_gemma":0.0008848483,"teacher_disagreement_score":0.0045258338,"about_ca_system_score_codex":0.00055824016,"about_ca_system_score_gemma":0.000337149,"threshold_uncertainty_score":0.015140474},"labels":[],"label_agreement":null},{"id":"W2951844772","doi":"10.48550/arxiv.1505.02837","title":"Independence complexes of well-covered circulant graphs","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph theory and applications","field":"Mathematics","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":"McMaster University; Redeemer University","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Circulant matrix; Circulant graph; Vertex (graph theory); Combinatorics; Independence (probability theory); Mathematics; Graph; Discrete mathematics; Line graph; Voltage graph","score_opus":0.15717838055115194,"score_gpt":0.23910232499547496,"score_spread":0.08192394444432302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951844772","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9240896,0.00050667295,0.045626726,0.000305517,0.000038560225,0.000042950178,0.00038370263,0.00012689532,0.028879318],"genre_scores_gemma":[0.9857633,0.00026816907,0.009608778,0.00006115841,0.000030241757,0.000033588512,0.00064486405,0.000050645274,0.0035393462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994159,0.000076245444,0.000021644717,0.0001158086,0.00024507794,0.0001252807],"domain_scores_gemma":[0.99735594,0.00096472114,0.0004868413,0.00031496902,0.00042251142,0.00045492343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032634524,0.0004672523,0.0003426338,0.0022802588,0.0014773675,0.001545679,0.00073498604,0.0005367704,0.004026201],"category_scores_gemma":[0.0028265857,0.00045350118,0.00041241225,0.0012203598,0.0013292605,0.0021506473,0.0010323854,0.00095099816,0.00034363056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020109657,0.00009128997,0.016362786,0.00013701752,0.00006495579,0.0014036829,0.0015012816,0.015660806,0.018777573,0.91716534,0.004509331,0.024124896],"study_design_scores_gemma":[0.00004611034,0.00009395705,0.022038342,0.000075535,0.00008995085,0.0032561831,0.0014766521,0.10856948,0.023217754,0.8063006,0.03472508,0.00011033134],"about_ca_topic_score_codex":0.002785419,"about_ca_topic_score_gemma":0.002982463,"teacher_disagreement_score":0.004026201,"about_ca_system_score_codex":0.0009295683,"about_ca_system_score_gemma":0.00034683425,"threshold_uncertainty_score":0.013468981},"labels":[],"label_agreement":null},{"id":"W2954485064","doi":"10.1016/j.disc.2019.06.030","title":"The maximum multiplicity of the largest <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e100\" altimg=\"si3.svg\"> <mml:mi>k</mml:mi> </mml:math> -th eigenvalue in a matrix whose graph is acyclic or unicyclic","year":2019,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"FP7 People: Marie-Curie Actions; Seventh Framework Programme; Natural Sciences and Engineering Research Council of Canada; Palestine Polytechnic University; Research Executive Agency; Bundesministerium für Bildung und Forschung; Universität Konstanz; Deutscher Akademischer Austauschdienst","keywords":"Mathematics; Eigenvalues and eigenvectors; Combinatorics; Multiplicity (mathematics); Inverse; Graph; Discrete mathematics; Mathematical analysis","score_opus":0.02253368435304887,"score_gpt":0.2810905412138136,"score_spread":0.25855685686076474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954485064","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.6797285,0.0016468577,0.17806241,0.003751324,0.0011091818,0.00014687818,0.006564074,0.0011069527,0.12788375],"genre_scores_gemma":[0.95625955,0.0005054585,0.022741508,0.00018827934,0.0002939764,0.00011361114,0.0011265684,0.00031120656,0.018459944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991265,0.00014885305,0.00005577126,0.00028958276,0.00016584725,0.00021354877],"domain_scores_gemma":[0.9925218,0.0032630377,0.0012838312,0.0006658683,0.0010197217,0.001245771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006541621,0.0007281902,0.000758742,0.0024203795,0.0014944901,0.0021892365,0.001377213,0.0011742327,0.020527972],"category_scores_gemma":[0.007540198,0.0003210464,0.0004739092,0.0011748748,0.0020924609,0.0023761322,0.0013548512,0.0011411079,0.0037155503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012329253,0.00024129298,0.012730828,0.00105218,0.0001441299,0.0017657042,0.0017688855,0.014310863,0.05541965,0.8208063,0.029309887,0.061217394],"study_design_scores_gemma":[0.000099533325,0.0002345998,0.015092052,0.00024612405,0.000092720955,0.0035158654,0.0012113806,0.03968367,0.035606448,0.8799953,0.023962565,0.00025982718],"about_ca_topic_score_codex":0.00057625165,"about_ca_topic_score_gemma":0.00075649016,"teacher_disagreement_score":0.020527972,"about_ca_system_score_codex":0.0007902928,"about_ca_system_score_gemma":0.0006889261,"threshold_uncertainty_score":0.068672836},"labels":[],"label_agreement":null},{"id":"W2962760670","doi":"","title":"Maximally connected and super arc-connected Bi-Cayley digraphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arc (geometry); Cayley graph; Combinatorics; Geometry; Graph","score_opus":0.021095974597185464,"score_gpt":0.25668725136268533,"score_spread":0.23559127676549987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962760670","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45750788,0.0022819906,0.19510286,0.0020269575,0.00043692288,0.00013336557,0.003161843,0.0007028197,0.33864543],"genre_scores_gemma":[0.9152285,0.000989166,0.04501416,0.0008006315,0.00013536417,0.00009854577,0.001975345,0.00009855075,0.035659764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996698,0.00009440801,0.000021829408,0.00008886431,0.00007094209,0.000054281678],"domain_scores_gemma":[0.9989103,0.00037737752,0.00016499331,0.00012362015,0.00019533106,0.00022836884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003085201,0.00038306753,0.00032613717,0.0014052611,0.0011585343,0.0015909858,0.000807716,0.0007322898,0.011831878],"category_scores_gemma":[0.0016871771,0.00038808366,0.0003702187,0.0014123309,0.0006757215,0.0023089217,0.0011674361,0.0011552188,0.0013168443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057805893,0.000026386435,0.0005804379,0.00011906786,0.000021508742,0.00026648183,0.00017040285,0.0013620065,0.002424579,0.9785686,0.00471033,0.011692445],"study_design_scores_gemma":[0.000023856843,0.000021618818,0.0010859683,0.000045148332,0.000039863404,0.00052549416,0.0002722933,0.013146065,0.0013109939,0.96641713,0.01709494,0.000016581636],"about_ca_topic_score_codex":0.0012912147,"about_ca_topic_score_gemma":0.0031419308,"teacher_disagreement_score":0.011831878,"about_ca_system_score_codex":0.0006849477,"about_ca_system_score_gemma":0.00042991462,"threshold_uncertainty_score":0.039581597},"labels":[],"label_agreement":null},{"id":"W2962922560","doi":"","title":"Notes on the sum of powers of the signless Laplacian eigenvalues of graphs","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Eigenvalues and eigenvectors; Graph; Sums of powers; Discrete mathematics; Connectivity; Physics","score_opus":0.02401801892270766,"score_gpt":0.2676450529362539,"score_spread":0.24362703401354624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962922560","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4621878,0.013239006,0.3417663,0.006985232,0.0027128914,0.00006161077,0.0007020953,0.00087278517,0.1714723],"genre_scores_gemma":[0.9681649,0.00233286,0.016853184,0.0006662299,0.0018843564,0.00006304939,0.00022291129,0.00023816361,0.009574362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988065,0.00031526803,0.000060484024,0.00030468742,0.0003813436,0.00013173497],"domain_scores_gemma":[0.9916358,0.0058736727,0.00057395844,0.00068587426,0.0005213869,0.0007093523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002019501,0.0013029831,0.0011402722,0.0036357136,0.00090933836,0.0023058096,0.0018702513,0.00085566455,0.0077562556],"category_scores_gemma":[0.012283145,0.00043933527,0.00086435495,0.001960728,0.0054004756,0.005462201,0.002219547,0.0032248348,0.0008676328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020916952,0.000043454933,0.0013862038,0.00025851539,0.000043865308,0.00050925405,0.00046656522,0.008329394,0.0067764274,0.9602948,0.0052009146,0.016481306],"study_design_scores_gemma":[0.000019588133,0.00007158253,0.0018997398,0.000058533544,0.000033385873,0.00042076,0.00009143625,0.030339006,0.0017289114,0.9619797,0.0033200006,0.00003740524],"about_ca_topic_score_codex":0.00039932178,"about_ca_topic_score_gemma":0.0004046224,"teacher_disagreement_score":0.0077562556,"about_ca_system_score_codex":0.0008316589,"about_ca_system_score_gemma":0.00024027629,"threshold_uncertainty_score":0.025947273},"labels":[],"label_agreement":null},{"id":"W2963002481","doi":"","title":"Lower bounds for algebraic connectivity of graphs in terms of matching number or edge covering number.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Algebraic connectivity; Matching (statistics); Algebraic number; Enhanced Data Rates for GSM Evolution; Upper and lower bounds; Discrete mathematics; Graph; Connectivity; Line graph; Computer science; Statistics","score_opus":0.023840666708191155,"score_gpt":0.30532034046449696,"score_spread":0.2814796737563058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963002481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32913095,0.008840183,0.5515894,0.0040570656,0.00028509405,0.00018590025,0.001858143,0.00097613625,0.1030771],"genre_scores_gemma":[0.92720306,0.0029713036,0.0647371,0.00023734558,0.00048020654,0.00019649806,0.0012133721,0.00017223085,0.0027888734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978155,0.00044310122,0.00010493257,0.00054165337,0.00075133063,0.00034357357],"domain_scores_gemma":[0.9797071,0.015974369,0.0016910472,0.001152103,0.0008208056,0.00065461674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013806282,0.0015663294,0.0011162269,0.0035957254,0.0011125861,0.0024704624,0.001986697,0.0013137652,0.007536584],"category_scores_gemma":[0.01744317,0.00040511801,0.0007845071,0.0033728322,0.0023503967,0.00695977,0.0020463187,0.0024021708,0.0006805871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061762065,0.00029994716,0.01151825,0.0011134848,0.0001983129,0.00046109044,0.00067567,0.085452944,0.029267121,0.7776875,0.0076171076,0.08509092],"study_design_scores_gemma":[0.000059983453,0.0004804068,0.011670096,0.0003179425,0.00033409483,0.002325455,0.00048125882,0.23650597,0.026297724,0.6963581,0.025027137,0.00014189426],"about_ca_topic_score_codex":0.0005840556,"about_ca_topic_score_gemma":0.0010431375,"teacher_disagreement_score":0.007536584,"about_ca_system_score_codex":0.0015832304,"about_ca_system_score_gemma":0.0004970017,"threshold_uncertainty_score":0.025212407},"labels":[],"label_agreement":null},{"id":"W2963083471","doi":"10.37236/8833","title":"Fractional Decompositions and the Smallest-eigenvalue Separation","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","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":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; Univerza v Ljubljani; Canada Research Chairs","keywords":"Bipartite graph; Mathematics; Eigenvalues and eigenvectors; Bounding overwatch; Combinatorics; Generalization; Discrete mathematics; Graph; Mathematical analysis; Computer science","score_opus":0.020715950168881236,"score_gpt":0.3224050803431109,"score_spread":0.30168913017422966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963083471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0445103,0.0017819264,0.9154417,0.00089089386,0.0004215109,0.000026209485,0.00012638902,0.00030854077,0.03649247],"genre_scores_gemma":[0.75039923,0.0013180337,0.23197262,0.00063247606,0.000806089,0.00015797131,0.00021336105,0.00041907778,0.014081138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992086,0.00019739548,0.00002790781,0.00017269449,0.00026305983,0.00013044046],"domain_scores_gemma":[0.99818414,0.0009254325,0.0002051403,0.00022723059,0.00021178764,0.00024627146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010118035,0.0011382885,0.0006439725,0.0026814688,0.0011928185,0.0015439733,0.0011201212,0.00091806543,0.003676215],"category_scores_gemma":[0.0044866507,0.00033619988,0.0009788475,0.0009588877,0.0025364489,0.0025721032,0.002026822,0.002741131,0.0008291241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040275274,0.000015353979,0.0002285116,0.00004172426,0.000010499702,0.000063972955,0.000089913134,0.005921454,0.0034699813,0.97755367,0.0014875727,0.011076995],"study_design_scores_gemma":[0.0000062190284,0.00001463989,0.00026466788,0.00002363307,0.000006629181,0.00009035461,0.000035645182,0.057867236,0.0016516009,0.9360283,0.0039925734,0.000018558056],"about_ca_topic_score_codex":0.00061995856,"about_ca_topic_score_gemma":0.0006632917,"teacher_disagreement_score":0.003676215,"about_ca_system_score_codex":0.0011965248,"about_ca_system_score_gemma":0.00046730935,"threshold_uncertainty_score":0.012298107},"labels":[],"label_agreement":null},{"id":"W2963087026","doi":"10.4171/jst/145","title":"A generalised Gauss circle problem and integrated density of states","year":2016,"lang":"en","type":"article","venue":"Journal of Spectral Theory","topic":"Graph theory and applications","field":"Mathematics","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":"Université de Montréal","funders":"Engineering and Physical Sciences Research Council; Université de Montréal","keywords":"Gauss; Mathematics; Applied mathematics; Physics; Quantum mechanics","score_opus":0.018676361944733523,"score_gpt":0.26881448759712956,"score_spread":0.250138125652396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963087026","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5419463,0.0016358594,0.41756198,0.0032187905,0.00015541085,0.00006317252,0.00032008693,0.00046794643,0.03463044],"genre_scores_gemma":[0.95554876,0.00046308356,0.036446203,0.000269341,0.00029197932,0.00010192483,0.00022451015,0.00019273382,0.0064614355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981852,0.00068936276,0.00006661176,0.00030456646,0.00055741443,0.00019678281],"domain_scores_gemma":[0.99336594,0.004185364,0.00058891386,0.0005009607,0.0007959187,0.0005629236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002756554,0.0005806111,0.0012676434,0.0031272466,0.00097546837,0.002617239,0.00326542,0.0018650343,0.0043491577],"category_scores_gemma":[0.016404917,0.00051444146,0.0010492601,0.0015053564,0.0064703124,0.006409609,0.002622457,0.0017266135,0.00035833637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032888896,0.000017189848,0.00049372436,0.000043572123,0.000011162396,0.00008137992,0.0001508065,0.009348037,0.00076497503,0.9859772,0.0004979342,0.002581271],"study_design_scores_gemma":[0.0000153978,0.000020628677,0.0005465461,0.000021900594,0.000008108122,0.00013087904,0.000091004535,0.15168329,0.00070660433,0.84614295,0.000610516,0.000022065904],"about_ca_topic_score_codex":0.0020327517,"about_ca_topic_score_gemma":0.000990868,"teacher_disagreement_score":0.0043491577,"about_ca_system_score_codex":0.0027480717,"about_ca_system_score_gemma":0.00064573844,"threshold_uncertainty_score":0.019938767},"labels":[],"label_agreement":null},{"id":"W2963088367","doi":"","title":"The Laplacian polynomial of graphs derived from regular graphs and applications","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Graph; 1-planar graph; Laplace operator; Symmetric graph; Discrete mathematics; Chordal graph; Line graph; Voltage graph; Mathematical analysis","score_opus":0.013213284517185332,"score_gpt":0.24862245707134292,"score_spread":0.23540917255415758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963088367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42250356,0.001891544,0.4948434,0.0010140374,0.00026677956,0.000080080215,0.0004052214,0.00054067426,0.078454755],"genre_scores_gemma":[0.960201,0.0008792332,0.032792065,0.00011827985,0.00017482713,0.00002850876,0.0001671982,0.00008360338,0.005555375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997676,0.00004506545,0.000009054305,0.000043533797,0.00009020387,0.000044556782],"domain_scores_gemma":[0.9993167,0.00028873634,0.000089001325,0.00008280296,0.00014124846,0.00008147865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027924366,0.00032079854,0.0002881863,0.0018401851,0.0004650725,0.0007586903,0.00058527995,0.00036935363,0.0032615224],"category_scores_gemma":[0.00278247,0.00015151073,0.00044647048,0.0014600696,0.0009752078,0.0014949357,0.0006962492,0.00091013627,0.00040300566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058609665,0.00005506887,0.0009679744,0.00021359586,0.000017152594,0.00024225382,0.000331517,0.0309138,0.011231537,0.9039478,0.0027738565,0.049246885],"study_design_scores_gemma":[0.000008849225,0.000033052114,0.0010967703,0.000018994431,0.000012500276,0.00036906797,0.00014993874,0.15964632,0.00292301,0.83143127,0.0042825765,0.000027600488],"about_ca_topic_score_codex":0.0010606222,"about_ca_topic_score_gemma":0.0013474007,"teacher_disagreement_score":0.0032615224,"about_ca_system_score_codex":0.00078248786,"about_ca_system_score_gemma":0.0004414814,"threshold_uncertainty_score":0.010910928},"labels":[],"label_agreement":null},{"id":"W2963129494","doi":"","title":"The number of spanning trees of power graphs associated with specific groups and some applications.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Spanning tree; Graph; Isomorphism (crystallography); Discrete mathematics","score_opus":0.01965033774156178,"score_gpt":0.2796773922405817,"score_spread":0.2600270544990199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963129494","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8619008,0.001461415,0.09542036,0.00094144896,0.00010016642,0.00005527443,0.0005936512,0.00018053889,0.039346352],"genre_scores_gemma":[0.9690954,0.000779776,0.02456177,0.00007208988,0.000113098664,0.000054918455,0.00042444575,0.000041844633,0.0048566926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968016,0.00008067239,0.000019158906,0.000100901285,0.000059093327,0.00005998763],"domain_scores_gemma":[0.9983713,0.00088133465,0.0002993527,0.0001419716,0.00011672197,0.00018937625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003938342,0.00026685925,0.00026713774,0.0013958446,0.00083640986,0.0010242225,0.00066284585,0.0006205385,0.003481321],"category_scores_gemma":[0.0024328353,0.00019386016,0.00038994462,0.0013035112,0.0013013169,0.002440534,0.0007821315,0.0006074619,0.00030722216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011306265,0.00006010521,0.0049093277,0.0001605973,0.000028515266,0.00028014567,0.0008443482,0.008667846,0.007278251,0.93914956,0.003235278,0.035273027],"study_design_scores_gemma":[0.00001767273,0.00007713303,0.004683766,0.000037200127,0.000050633535,0.0013287461,0.0005196197,0.041696735,0.0048675877,0.9344981,0.012197308,0.000025529289],"about_ca_topic_score_codex":0.0005631665,"about_ca_topic_score_gemma":0.0007400777,"teacher_disagreement_score":0.003481321,"about_ca_system_score_codex":0.00065074145,"about_ca_system_score_gemma":0.00026405652,"threshold_uncertainty_score":0.011646211},"labels":[],"label_agreement":null},{"id":"W2963217502","doi":"10.1016/j.aim.2015.09.002","title":"Enumeration of graphs with a heavy-tailed degree sequence","year":2015,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":28,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Degree (music); Enumeration; Mathematics; Combinatorics; Sequence (biology); Discrete mathematics","score_opus":0.10246463178059065,"score_gpt":0.355229876230806,"score_spread":0.2527652444502153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963217502","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5604358,0.000338103,0.3940329,0.0017427561,0.00020049931,0.00013816125,0.0017812061,0.0006977146,0.040632907],"genre_scores_gemma":[0.81878096,0.0005315051,0.15149596,0.0005946992,0.00018845728,0.00019466128,0.002922651,0.00043077706,0.024860283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901783,0.0002710752,0.00007234668,0.00020999873,0.0002198817,0.00020889695],"domain_scores_gemma":[0.99214923,0.003753332,0.0006422718,0.0013732855,0.0011573486,0.00092466024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008879102,0.00072956696,0.00084084604,0.0018816788,0.0017077235,0.0023663896,0.0018400766,0.0013423932,0.00789644],"category_scores_gemma":[0.007818374,0.0007329188,0.00066464144,0.0022193887,0.0013471832,0.003944028,0.0020765825,0.002386123,0.00157937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052171794,0.00027806146,0.0045627505,0.00033395088,0.000051003757,0.00047810737,0.0008383331,0.022775307,0.019926585,0.8759563,0.010369501,0.06390835],"study_design_scores_gemma":[0.000037874903,0.000046871963,0.00093861076,0.00005760904,0.000029044042,0.00034541398,0.00019698522,0.057548787,0.004534068,0.93090785,0.00533388,0.000023066204],"about_ca_topic_score_codex":0.0006297058,"about_ca_topic_score_gemma":0.0016237576,"teacher_disagreement_score":0.00789644,"about_ca_system_score_codex":0.0007743565,"about_ca_system_score_gemma":0.0009607949,"threshold_uncertainty_score":0.026416242},"labels":[],"label_agreement":null},{"id":"W2963352212","doi":"","title":"1 A CLASSIFICATION OF ALL 1-SALEM GRAPHS","year":2016,"lang":"en","type":"article","venue":"","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Cyclotomic polynomial; Cyclotomic field; Discrete mathematics; Graph; Polynomial","score_opus":0.08397343147994354,"score_gpt":0.3316980540401624,"score_spread":0.24772462256021885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963352212","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8176516,0.0016836007,0.043044515,0.0023007297,0.00031459075,0.00018343933,0.0016519417,0.00040291456,0.13276663],"genre_scores_gemma":[0.96486706,0.0005080645,0.020625662,0.00034213765,0.00022686344,0.00006355032,0.002236544,0.00005845397,0.011071773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996131,0.000052809395,0.000018556484,0.00010432196,0.00013168127,0.000079513884],"domain_scores_gemma":[0.99951315,0.00013402362,0.00010669562,0.000062372856,0.00011030477,0.00007350173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019384925,0.00042595947,0.00035510364,0.002285473,0.0011406092,0.001636218,0.0007131654,0.00082004734,0.008577376],"category_scores_gemma":[0.00093191024,0.0002429026,0.0004154045,0.0017172758,0.0014859926,0.0016633312,0.0006490552,0.0008042376,0.0007614379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011912678,0.000059631337,0.005312722,0.00014652648,0.00001477493,0.00024249309,0.00047058417,0.0013535708,0.0067220675,0.9392859,0.009083408,0.03718917],"study_design_scores_gemma":[0.00004696859,0.00011307588,0.012214497,0.00008601392,0.000024471241,0.0016416264,0.0006784773,0.016821878,0.0040349374,0.91206306,0.052235983,0.000038959533],"about_ca_topic_score_codex":0.0011252102,"about_ca_topic_score_gemma":0.0016262006,"teacher_disagreement_score":0.008577376,"about_ca_system_score_codex":0.0010214827,"about_ca_system_score_gemma":0.00033543902,"threshold_uncertainty_score":0.028694212},"labels":[],"label_agreement":null},{"id":"W2963598847","doi":"10.1007/s00373-018-1946-0","title":"Optimal Graphs for Independence and k-Independence Polynomials","year":2018,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Graph theory and applications","field":"Mathematics","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":"Mount Saint Vincent University; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Discrete mathematics; Independence number; Independence (probability theory); Cardinality (data modeling); Chordal graph; Independent set; Graph","score_opus":0.030098859468858253,"score_gpt":0.2980547611719911,"score_spread":0.2679559017031328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963598847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35471448,0.001671894,0.4893837,0.0073594353,0.00038775415,0.00018873771,0.0020522035,0.00074362574,0.14349818],"genre_scores_gemma":[0.9045877,0.0016118913,0.06562569,0.0010509037,0.00060050073,0.00020146566,0.0014790156,0.0005129634,0.024329858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822146,0.00049240794,0.000060706025,0.000476926,0.00034489264,0.00040363992],"domain_scores_gemma":[0.9902485,0.006284025,0.0008490893,0.001106833,0.00062840816,0.0008831691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001247997,0.001056629,0.0013469139,0.0015792684,0.0025252886,0.003762735,0.0022434955,0.0017579092,0.01509768],"category_scores_gemma":[0.012205494,0.0013344486,0.0012888071,0.002532113,0.0034693254,0.009224894,0.0030682334,0.0056599993,0.0016298038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014151771,0.00009972753,0.00043696558,0.00012961711,0.000020813039,0.000056351157,0.00026137123,0.009094695,0.00094912614,0.9668728,0.0059646596,0.015972413],"study_design_scores_gemma":[0.000020730871,0.000009215451,0.00028731025,0.000013662016,0.00001472441,0.000046876576,0.000061049905,0.010669961,0.00037720436,0.98670006,0.0017881299,0.000011126647],"about_ca_topic_score_codex":0.0023054609,"about_ca_topic_score_gemma":0.003791517,"teacher_disagreement_score":0.01509768,"about_ca_system_score_codex":0.0024941096,"about_ca_system_score_gemma":0.0016999074,"threshold_uncertainty_score":0.05050677},"labels":[],"label_agreement":null},{"id":"W2963698649","doi":"","title":"A relation between clar covering polynomial and cube polynomial","year":2013,"lang":"en","type":"article","venue":"Lanzhou University Institutional Repository","topic":"Graph theory and applications","field":"Mathematics","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":"Bijection; Polynomial; Combinatorics; Cube (algebra); Tutte polynomial; Hypercube; Hexagonal crystal system; Mathematics; Zhàng; Graph; Relation (database); Computer science; Chemistry; Crystallography; Mathematical analysis; Geography","score_opus":0.01858365750300743,"score_gpt":0.2216180423809416,"score_spread":0.20303438487793418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963698649","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7757115,0.00048444016,0.15068246,0.0009084566,0.00011542995,0.000056298355,0.00035319815,0.00033798785,0.0713503],"genre_scores_gemma":[0.9866959,0.00020159193,0.008545005,0.000103247454,0.00010790366,0.000029533448,0.00014897651,0.0000484388,0.0041193995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921536,0.0001314283,0.000021733216,0.00019237796,0.00021843628,0.00022065309],"domain_scores_gemma":[0.99776506,0.0011574805,0.0002957749,0.0002918048,0.0002587766,0.00023099339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050097465,0.0002746319,0.00044204062,0.0011138296,0.00091964344,0.0012147108,0.0005220603,0.00034052526,0.0061924085],"category_scores_gemma":[0.0027607242,0.00019572413,0.0004748665,0.0010958862,0.0021933205,0.0028193789,0.0012242519,0.0015895526,0.0006869749],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016777891,0.000042005813,0.0031469546,0.00009586111,0.000011780703,0.00016200377,0.0004791435,0.00728559,0.007916488,0.95395106,0.0026187045,0.024122566],"study_design_scores_gemma":[0.000041328592,0.0002689063,0.010419154,0.00003979667,0.000038841725,0.0011930426,0.0005581137,0.06491803,0.01717458,0.8859205,0.019311206,0.00011648125],"about_ca_topic_score_codex":0.0012997877,"about_ca_topic_score_gemma":0.0008878147,"teacher_disagreement_score":0.0061924085,"about_ca_system_score_codex":0.00091024814,"about_ca_system_score_gemma":0.00049016,"threshold_uncertainty_score":0.020715714},"labels":[],"label_agreement":null},{"id":"W2963713505","doi":"10.48550/arxiv.1511.00113","title":"Adjacency matrices of random digraphs: singularity and\\n anti-concentration","year":2015,"lang":"","type":"article","venue":"arXiv (Cornell University)","topic":"Graph theory and applications","field":"Mathematics","cited_by":43,"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 Alberta","funders":"","keywords":"Mathematics; Combinatorics; Adjacency matrix; Invertible matrix; Vertex (graph theory); Graph; Discrete mathematics; Regular graph; Line graph; Graph power; Pure mathematics","score_opus":0.08928013013114253,"score_gpt":0.2085455317124797,"score_spread":0.11926540158133717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963713505","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48826706,0.0008545551,0.4850252,0.0030237117,0.00007913256,0.00016595719,0.001061897,0.000599779,0.020922659],"genre_scores_gemma":[0.9578535,0.00059793994,0.034703024,0.0005473271,0.000119518445,0.00018693182,0.00064388604,0.000096529584,0.0052514244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883527,0.00035450907,0.000053859785,0.0003716391,0.00023134329,0.0001533904],"domain_scores_gemma":[0.98876953,0.0069834874,0.0016298265,0.0010497982,0.0006738909,0.0008935645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095563853,0.00064768957,0.0006201424,0.0015308894,0.0008325113,0.0019088065,0.001584682,0.001252505,0.0032366738],"category_scores_gemma":[0.014023089,0.00078622095,0.0005802181,0.0008844399,0.0023355747,0.0026904447,0.0016300326,0.0018931879,0.0005337262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019815822,0.00012295406,0.0058792913,0.00019944477,0.0000674164,0.0005539985,0.00053669984,0.082394525,0.009238369,0.87232256,0.0067113554,0.021775307],"study_design_scores_gemma":[0.000051893167,0.00005993454,0.001812856,0.000033073436,0.00001989905,0.00046233396,0.00011809427,0.49510697,0.002700475,0.49710146,0.0024895398,0.000043408756],"about_ca_topic_score_codex":0.001523457,"about_ca_topic_score_gemma":0.0021694915,"teacher_disagreement_score":0.0032366738,"about_ca_system_score_codex":0.0012915788,"about_ca_system_score_gemma":0.0006067883,"threshold_uncertainty_score":0.01082778},"labels":[],"label_agreement":null},{"id":"W2963726634","doi":"","title":"On the edge-reconstruction number of a tree.","year":2014,"lang":"en","type":"article","venue":"OAR@UM (University of Malta)","topic":"Graph theory and applications","field":"Mathematics","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":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Enhanced Data Rates for GSM Evolution; Conjecture; Graph; Edge cover; Isomorphism (crystallography); Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.01899573932882898,"score_gpt":0.22595156607766878,"score_spread":0.2069558267488398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963726634","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6984603,0.0047523337,0.1439806,0.003508411,0.00040729635,0.000097338685,0.0019908296,0.00033816436,0.14646474],"genre_scores_gemma":[0.9382602,0.0024084921,0.04818622,0.00037208234,0.00021984788,0.00011608837,0.0010701311,0.00011441454,0.009252473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987161,0.00034064072,0.00008249317,0.0003461154,0.00026053248,0.0002541509],"domain_scores_gemma":[0.9899872,0.00744021,0.000707693,0.00094005174,0.00042508278,0.00049966143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017974483,0.00051503093,0.0005828042,0.0021681509,0.0013193972,0.0021218744,0.0012634078,0.0011531266,0.0060763643],"category_scores_gemma":[0.010248128,0.00034426618,0.00041849157,0.0013572708,0.0039490233,0.004641326,0.001732872,0.0017652393,0.00091558543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056564505,0.000059653867,0.0048019825,0.0002710937,0.000040644263,0.00019359731,0.0005360162,0.016719345,0.00933525,0.91662836,0.0053980355,0.045450296],"study_design_scores_gemma":[0.000051987605,0.000266753,0.0077274856,0.00021951523,0.000083196624,0.0015914057,0.00051772187,0.0558551,0.01483891,0.89077544,0.02796779,0.00010460842],"about_ca_topic_score_codex":0.0006703432,"about_ca_topic_score_gemma":0.0007445091,"teacher_disagreement_score":0.0060763643,"about_ca_system_score_codex":0.0012216404,"about_ca_system_score_gemma":0.00043637143,"threshold_uncertainty_score":0.020327449},"labels":[],"label_agreement":null},{"id":"W2963967099","doi":"10.13001/1081-3810.3244","title":"Spectral Bound for Separations in Eulerian Digraphs","year":2017,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Graph theory and applications","field":"Mathematics","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":"Digraph; Mathematics; Combinatorics; Eulerian path; Upper and lower bounds; Eigenvalues and eigenvectors; Laplacian matrix; Laplace operator; Discrete mathematics; Graph; Pure mathematics; Mathematical analysis","score_opus":0.036065542766523406,"score_gpt":0.3548031906885405,"score_spread":0.3187376479220171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963967099","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45161155,0.003426754,0.4486645,0.0037748814,0.00035957067,0.00007866365,0.001070618,0.0007338558,0.09027956],"genre_scores_gemma":[0.96799254,0.0010220913,0.021220686,0.00043796524,0.00033868937,0.0001002532,0.00054873194,0.0001477922,0.008191305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989901,0.00019665998,0.00004923401,0.00026223666,0.00026941826,0.00023236872],"domain_scores_gemma":[0.9893387,0.0071219266,0.00077297457,0.0006055251,0.00075708836,0.0014038283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009367928,0.0008164249,0.0009020018,0.002333712,0.0014711273,0.002881515,0.00129949,0.0012418714,0.0099083865],"category_scores_gemma":[0.010521245,0.0004925336,0.0005584323,0.0012194094,0.002673755,0.0048719095,0.0024998588,0.002594858,0.0011973623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013980601,0.00006087709,0.0009465421,0.00013097837,0.00002538444,0.00014560364,0.0003087713,0.014856884,0.003625305,0.9647229,0.0037442856,0.011292748],"study_design_scores_gemma":[0.00001453357,0.00002621512,0.0003865899,0.000037323996,0.000010503368,0.00011718567,0.00009312353,0.05192383,0.00074914977,0.9443131,0.002309591,0.000018821924],"about_ca_topic_score_codex":0.00080444384,"about_ca_topic_score_gemma":0.001032266,"teacher_disagreement_score":0.0099083865,"about_ca_system_score_codex":0.0019200761,"about_ca_system_score_gemma":0.0005667874,"threshold_uncertainty_score":0.0331468},"labels":[],"label_agreement":null},{"id":"W2964046804","doi":"","title":"On the reciprocal degree distance of graphs with cut vertices or cut edges.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Reciprocal; Degree (music); Combinatorics; Physics","score_opus":0.0821127410272369,"score_gpt":0.29683252418585687,"score_spread":0.21471978315861998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964046804","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61183125,0.007382788,0.2413871,0.0050113415,0.0008928865,0.000088333785,0.0015783078,0.00047233285,0.13135564],"genre_scores_gemma":[0.94398314,0.0026755736,0.040414073,0.000604449,0.0007758345,0.0001202107,0.00094139867,0.00028566638,0.010199694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981172,0.0007173593,0.000094246374,0.00039435542,0.0004378074,0.0002389946],"domain_scores_gemma":[0.98643607,0.009219038,0.0015541749,0.0010016972,0.000824369,0.00096464297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018538382,0.00085658237,0.0011699799,0.0036919303,0.0013813877,0.002571547,0.0025808758,0.0017961268,0.0066817338],"category_scores_gemma":[0.020180598,0.00043155602,0.00054440444,0.0026695316,0.0025361038,0.0065654377,0.0026158132,0.0024644155,0.0016419175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036362736,0.00012233401,0.0038495776,0.00033490697,0.0000863755,0.00017797439,0.00054792874,0.014667607,0.0027850145,0.92589134,0.011134742,0.040038686],"study_design_scores_gemma":[0.000048011105,0.000089701505,0.0023347498,0.00009878276,0.00007562101,0.00066341594,0.00049756246,0.044103418,0.001793682,0.9420545,0.008188891,0.00005175632],"about_ca_topic_score_codex":0.0008210232,"about_ca_topic_score_gemma":0.0008564445,"teacher_disagreement_score":0.0066817338,"about_ca_system_score_codex":0.001423504,"about_ca_system_score_gemma":0.0003961535,"threshold_uncertainty_score":0.022352636},"labels":[],"label_agreement":null},{"id":"W2964048937","doi":"10.1137/18m1174544","title":"An Optimization Parameter for Seriation of Noisy Data","year":2019,"lang":"kn","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; University of Delaware Research Foundation","keywords":"Mathematics; Similarity (geometry); Matrix (chemical analysis); Identity matrix; Combinatorics; Diagonal; Square matrix; Matrix similarity; Matrix norm; Row; Row and column spaces; Seriation (archaeology); Symmetric matrix; Artificial intelligence; Computer science; Mathematical analysis; Eigenvalues and eigenvectors","score_opus":0.05583733570121908,"score_gpt":0.34953243548031243,"score_spread":0.29369509977909336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964048937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019119656,0.00041313327,0.9769721,0.00077998365,0.00011602536,0.000099210534,0.00023092385,0.00095809065,0.0013107992],"genre_scores_gemma":[0.44511637,0.00053003203,0.5474606,0.0007369476,0.00032769877,0.00040574252,0.0010520689,0.0008115822,0.0035588995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940304,0.002519109,0.0005375665,0.0013623001,0.001242798,0.00030770266],"domain_scores_gemma":[0.96434724,0.02326679,0.0030799436,0.0057150717,0.0025774147,0.0010134719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009781443,0.001627938,0.0019581395,0.0014639273,0.0007381071,0.0027237232,0.0026828924,0.0028426407,0.0032158361],"category_scores_gemma":[0.08251316,0.00082599313,0.0009240527,0.0015570542,0.003149054,0.0061009293,0.0032470715,0.0033994236,0.0015160599],"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.00076690596,0.0001721682,0.0041526807,0.0004405552,0.0001791489,0.00022561567,0.0003379067,0.7445567,0.012329045,0.0618024,0.009427376,0.16560952],"study_design_scores_gemma":[0.00003180094,0.00014740071,0.0005650916,0.000053424374,0.000018422657,0.00016691687,0.00008275192,0.95808446,0.0047783284,0.0341057,0.0019267638,0.00003900865],"about_ca_topic_score_codex":0.0012713476,"about_ca_topic_score_gemma":0.0011936016,"teacher_disagreement_score":0.009781443,"about_ca_system_score_codex":0.0022131305,"about_ca_system_score_gemma":0.0019071157,"threshold_uncertainty_score":0.0517298},"labels":[],"label_agreement":null},{"id":"W2964533042","doi":"10.1016/j.disc.2019.06.036","title":"Characterizations of graphs <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e25\" altimg=\"si20.svg\"><mml:mi>G</mml:mi></mml:math> having all <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e30\" altimg=\"si21.svg\"><mml:mrow><mml:mo>[</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>k</mml:mi><mml:mo>]</mml:mo></mml:mrow></mml:math>-factors in <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e44\" altimg=\"si22.svg\"><mml:mrow><mml:mi>k</mml:mi><mml:mi>G</mml:mi></mml:mrow></mml:math>","year":2019,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"Thompson Rivers University","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.02091355520300997,"score_gpt":0.2545854632087166,"score_spread":0.23367190800570664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964533042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09734988,0.0019544242,0.7056601,0.0044747023,0.0004445729,0.00069247733,0.020751318,0.006755465,0.16191712],"genre_scores_gemma":[0.5076132,0.004248764,0.28167018,0.0021121905,0.0008064348,0.0016245772,0.0758499,0.0046221875,0.121452585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976801,0.00045260167,0.00029252443,0.0007972953,0.0005270951,0.00025035453],"domain_scores_gemma":[0.993745,0.0022654443,0.0010334874,0.0010282082,0.0014815873,0.00044620177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010849512,0.0015839881,0.0006530757,0.0052503794,0.0016797284,0.0056879213,0.0015791752,0.0014704157,0.029192902],"category_scores_gemma":[0.006762141,0.00067044154,0.0017958652,0.0049796375,0.0015824023,0.008312837,0.0018657987,0.0018100429,0.009860354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002546113,0.00017011228,0.0030620783,0.0009252268,0.00009521563,0.000671157,0.002490041,0.01312558,0.010669627,0.74977344,0.06769558,0.15106733],"study_design_scores_gemma":[0.00004597047,0.00015070967,0.0034092772,0.00046617805,0.00011434834,0.0013266132,0.0019211984,0.034668945,0.011886758,0.692202,0.2536921,0.000115948416],"about_ca_topic_score_codex":0.0037805012,"about_ca_topic_score_gemma":0.004417124,"teacher_disagreement_score":0.029192902,"about_ca_system_score_codex":0.0021134687,"about_ca_system_score_gemma":0.0011870277,"threshold_uncertainty_score":0.097659945},"labels":[],"label_agreement":null},{"id":"W2964912472","doi":"10.1016/j.laa.2019.08.002","title":"Chromatic numbers, Sabidussi's Theorem and Hedetniemi's conjecture for non-commutative graphs","year":2019,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"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","keywords":"Mathematics; Combinatorics; Discrete mathematics; Commutative property; Chromatic scale","score_opus":0.014786636911390772,"score_gpt":0.29187908579167565,"score_spread":0.2770924488802849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964912472","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.5886965,0.003892675,0.118365824,0.013236638,0.0011370694,0.00010509711,0.0010859076,0.00037331207,0.27310693],"genre_scores_gemma":[0.9594031,0.0011118166,0.011626941,0.00080253556,0.00056425703,0.000091256596,0.00050933927,0.00007666678,0.025814082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993943,0.000097524375,0.000024759536,0.00021940579,0.00012729685,0.00013673352],"domain_scores_gemma":[0.9976545,0.0013560886,0.0001995675,0.00026695887,0.0002477495,0.00027519782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095243444,0.0006647982,0.0009732002,0.002481363,0.003327225,0.0037245683,0.001854261,0.0015567747,0.0109692775],"category_scores_gemma":[0.003956865,0.0007605713,0.00086432614,0.002841187,0.0055142506,0.008259829,0.0024549118,0.003949498,0.0008207517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039461527,0.000016424741,0.00042329644,0.0000421146,0.0000060156012,0.000028932855,0.0002389516,0.00078923814,0.00049777166,0.9934831,0.0019220839,0.0025126096],"study_design_scores_gemma":[0.000017131897,0.0000060661528,0.0005192851,0.000009020491,0.000008424902,0.000029903505,0.00009474456,0.0022544072,0.00031315885,0.9941037,0.0026344915,0.000009708376],"about_ca_topic_score_codex":0.005076635,"about_ca_topic_score_gemma":0.0044470346,"teacher_disagreement_score":0.0109692775,"about_ca_system_score_codex":0.0023416001,"about_ca_system_score_gemma":0.001189409,"threshold_uncertainty_score":0.036695898},"labels":[],"label_agreement":null},{"id":"W2967051791","doi":"10.1088/1757-899x/567/1/012020","title":"Properties of anti-adjacency matrix of directed cyclic sun graph","year":2019,"lang":"en","type":"article","venue":"IOP Conference Series Materials Science and Engineering","topic":"Graph theory and applications","field":"Mathematics","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":"Toronto Metropolitan University","funders":"","keywords":"Adjacency matrix; Graph energy; Adjacency list; Combinatorics; Mathematics; Degree matrix; Characteristic polynomial; Eigenvalues and eigenvectors; Directed graph; Polynomial matrix; Matrix polynomial; Two-graph; Discrete mathematics; Graph; Polynomial; Line graph; Graph power; Physics; Mathematical analysis","score_opus":0.023752938957614697,"score_gpt":0.2411591524724003,"score_spread":0.21740621351478562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967051791","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63426554,0.00026421086,0.33226854,0.00034930324,0.00008317645,0.000044742905,0.00047903197,0.0002737164,0.031971805],"genre_scores_gemma":[0.985515,0.000114672555,0.010847334,0.00005753733,0.000034365235,0.000027239455,0.00018693172,0.00003892513,0.003177862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974436,0.000046504745,0.000008438315,0.00006593653,0.00008785725,0.000046955476],"domain_scores_gemma":[0.9989949,0.0003363222,0.00020116952,0.00007198082,0.00029146485,0.000104224535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015513688,0.00018647613,0.0001737723,0.0011447171,0.00037360503,0.000478383,0.00028570666,0.000270684,0.005772628],"category_scores_gemma":[0.0013257047,0.00010938659,0.00016609849,0.00056856015,0.0004631997,0.000946121,0.00026213558,0.00031416438,0.00038613446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017112574,0.00007066911,0.005910432,0.00021558261,0.000032872213,0.00072237063,0.0004967707,0.029104529,0.070439175,0.84311056,0.00516771,0.0445583],"study_design_scores_gemma":[0.000028583385,0.00012697023,0.0076071788,0.000027436647,0.00001649234,0.0015903724,0.0003558921,0.23374902,0.016634345,0.7324672,0.0073298835,0.00006664807],"about_ca_topic_score_codex":0.0005652444,"about_ca_topic_score_gemma":0.0006198121,"teacher_disagreement_score":0.005772628,"about_ca_system_score_codex":0.0002467207,"about_ca_system_score_gemma":0.00022434963,"threshold_uncertainty_score":0.019311368},"labels":[],"label_agreement":null},{"id":"W2974779804","doi":"","title":"The edge-graceful spectra of connected bicyclic graphs without pendant","year":2008,"lang":"en","type":"article","venue":"HKBU Institutional Repository (Hong Kong Baptist University)","topic":"Graph theory and applications","field":"Mathematics","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":"Enhanced Data Rates for GSM Evolution; Mathematics; Bicyclic molecule; Spectral line; Combinatorics; Chemistry; Computer science; Stereochemistry; Physics; Telecommunications","score_opus":0.02716605311881201,"score_gpt":0.23305260499066305,"score_spread":0.20588655187185104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2974779804","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88735837,0.00046424594,0.03172507,0.00064092985,0.00016340482,0.00011670512,0.0014225617,0.0005368753,0.0775718],"genre_scores_gemma":[0.9852245,0.00030031128,0.003867898,0.00013599181,0.00008327446,0.000074618554,0.00065062393,0.0001024693,0.009560202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945563,0.00006699776,0.000028600873,0.000107649284,0.00015205136,0.00018911334],"domain_scores_gemma":[0.998544,0.00040883836,0.0002781701,0.00016117131,0.00018911679,0.00041865362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036514818,0.0008054705,0.000664126,0.0036076372,0.0024164761,0.0030302901,0.0012785614,0.00091292243,0.010581905],"category_scores_gemma":[0.0019077612,0.00054412533,0.0005890162,0.0017280137,0.0016040029,0.002332853,0.001675124,0.0012615775,0.0014083264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004197879,0.00007834585,0.00080250937,0.00015750906,0.000016540995,0.000436276,0.0008353022,0.004373881,0.010942611,0.96386915,0.0039045499,0.014163486],"study_design_scores_gemma":[0.000059457132,0.00007297906,0.0013241153,0.000044415887,0.00002826861,0.00035400034,0.00043497529,0.012603496,0.0042698192,0.97680545,0.003960467,0.000042522825],"about_ca_topic_score_codex":0.0012656515,"about_ca_topic_score_gemma":0.0013166299,"teacher_disagreement_score":0.010581905,"about_ca_system_score_codex":0.00088507595,"about_ca_system_score_gemma":0.0007851088,"threshold_uncertainty_score":0.035400033},"labels":[],"label_agreement":null},{"id":"W2977288278","doi":"10.1016/j.laa.2021.10.023","title":"Incidence hypergraphs: Injectivity, uniformity, and matrix-tree theorems","year":2021,"lang":"en","type":"preprint","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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 Waterloo","funders":"","keywords":"Mathematics; Incidence matrix; Combinatorics; Discrete mathematics; Characteristic polynomial; Incidence (geometry); Injective function; Adjacency matrix; Integer matrix; Tutte polynomial; Polynomial; Graph; Eigenvalues and eigenvectors; Symmetric matrix; Nonnegative matrix; Line graph; Voltage graph","score_opus":0.026840838451385626,"score_gpt":0.3138531900473483,"score_spread":0.28701235159596267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2977288278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22447349,0.0023346161,0.6975058,0.0021703816,0.00023833054,0.00005174181,0.0009221552,0.00056976796,0.071733825],"genre_scores_gemma":[0.92927796,0.0024108815,0.048044335,0.00052161404,0.0008861347,0.000120777564,0.00077918934,0.00029002526,0.017669123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999132,0.00023807478,0.000049415157,0.0002435549,0.00023996652,0.000096938966],"domain_scores_gemma":[0.99515766,0.0026655234,0.00059411075,0.00047675872,0.0007112161,0.00039474457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001314237,0.00056665664,0.0006787504,0.0022633355,0.001038268,0.003406777,0.0010925584,0.00072789745,0.0049350224],"category_scores_gemma":[0.0059721773,0.00056927843,0.00082067115,0.0027460614,0.002361528,0.0072676335,0.0018579689,0.002349716,0.0009154938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021734144,0.00001676022,0.00030487753,0.000024344195,0.0000071482928,0.000035574765,0.00016589882,0.0007351437,0.0006321644,0.9910166,0.00085928495,0.006180382],"study_design_scores_gemma":[0.00000619212,0.000008454687,0.00020281189,0.0000085100255,0.000010018935,0.000103140126,0.000057626297,0.005327046,0.0008708243,0.9919269,0.0014705964,0.000007726426],"about_ca_topic_score_codex":0.0007751099,"about_ca_topic_score_gemma":0.00058255397,"teacher_disagreement_score":0.0049350224,"about_ca_system_score_codex":0.0009427102,"about_ca_system_score_gemma":0.00048355837,"threshold_uncertainty_score":0.016509295},"labels":[],"label_agreement":null},{"id":"W2977446980","doi":"10.48550/arxiv.1008.3660","title":"Sums of squares and negative correlation for spanning forests of series\\n parallel graphs","year":2010,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph theory and applications","field":"Mathematics","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; Matroid; Mathematics; Spanning tree; Matroid partitioning; Discrete mathematics; Monotonic function; Graphic matroid; Mathematical analysis","score_opus":0.07264050804643833,"score_gpt":0.22131100799762088,"score_spread":0.14867049995118253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2977446980","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7820015,0.00023066466,0.20218228,0.0005114031,0.00006468067,0.000022505534,0.00019395257,0.0001352892,0.014657725],"genre_scores_gemma":[0.9869686,0.00011403158,0.010081744,0.00007998966,0.00009721553,0.00001837656,0.00013367277,0.000036039728,0.002470297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994398,0.00013942832,0.000023660952,0.00013339001,0.00017815136,0.00008550942],"domain_scores_gemma":[0.9967899,0.0016805033,0.0005780301,0.00034002747,0.00033812382,0.00027336465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006255297,0.00027881085,0.00033045156,0.0008311551,0.0005094706,0.00085167884,0.00053840474,0.0002857671,0.0020743397],"category_scores_gemma":[0.0038506198,0.00021890894,0.0003939162,0.0006506221,0.0016411797,0.0016096828,0.00091749086,0.0008900919,0.00026577202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010329164,0.000048721307,0.0032691525,0.000057072826,0.00002033109,0.00026548508,0.00025042976,0.0168821,0.009358748,0.95207846,0.0016340524,0.016032312],"study_design_scores_gemma":[0.000015439966,0.000052083058,0.0024698046,0.000008746157,0.000015141345,0.00056710717,0.00009797589,0.120614916,0.004267967,0.8700241,0.0018385553,0.00002811131],"about_ca_topic_score_codex":0.00038158393,"about_ca_topic_score_gemma":0.0006571606,"teacher_disagreement_score":0.0020743397,"about_ca_system_score_codex":0.0004731809,"about_ca_system_score_gemma":0.00036500933,"threshold_uncertainty_score":0.0069393516},"labels":[],"label_agreement":null},{"id":"W2982608339","doi":"10.48550/arxiv.1910.13490","title":"Centrosymmetric Stochastic Matrices","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph theory and applications","field":"Mathematics","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; Canada Research Chairs","keywords":"Bipartite graph; Extreme point; Combinatorics; Mathematics; Basis (linear algebra); Regular polygon; Parity (physics); Graph; Matrix (chemical analysis); Set (abstract data type); Discrete mathematics; Physics; Geometry; Computer science","score_opus":0.1029964689091978,"score_gpt":0.2185692035824347,"score_spread":0.11557273467323691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982608339","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43479317,0.00030853736,0.4867852,0.0006934495,0.00018028691,0.00008358294,0.00065121625,0.00026750442,0.076237045],"genre_scores_gemma":[0.92656296,0.00029047785,0.058642674,0.00024320543,0.00011955821,0.00012594825,0.00050180015,0.000089072775,0.013424305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995363,0.00009769137,0.000015693291,0.00008271002,0.00014874789,0.00011894351],"domain_scores_gemma":[0.99935013,0.00016635966,0.00012187114,0.00009928296,0.0001285355,0.00013382526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038445383,0.00055772485,0.00042519963,0.0009823822,0.00083550345,0.00093515194,0.000718053,0.0006292156,0.0059563043],"category_scores_gemma":[0.0013629788,0.00019486292,0.00049437064,0.00060820667,0.0012041917,0.0010611427,0.001027804,0.0010363242,0.0009619664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005024727,0.000018835037,0.00036363804,0.000021278753,0.000007703611,0.00010749607,0.000086945445,0.012422061,0.004523247,0.9738433,0.0014532073,0.007102154],"study_design_scores_gemma":[0.00001685938,0.000052574218,0.0006241822,0.000017401342,0.000006983892,0.00022912853,0.0001735036,0.15932243,0.004404053,0.8288759,0.0062426375,0.000034327695],"about_ca_topic_score_codex":0.001412138,"about_ca_topic_score_gemma":0.001580414,"teacher_disagreement_score":0.0059563043,"about_ca_system_score_codex":0.00061770144,"about_ca_system_score_gemma":0.0004440376,"threshold_uncertainty_score":0.019925773},"labels":[],"label_agreement":null},{"id":"W2986518919","doi":"10.1142/s0218216519400170","title":"Stable Alexander polynomials of arborescent links","year":2019,"lang":"en","type":"article","venue":"Journal of Knot Theory and Its Ramifications","topic":"Graph theory and applications","field":"Mathematics","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":"Mathematics; Class (philosophy); Interlacing; Pure mathematics; Hahn polynomials; Wilson polynomials; Discrete orthogonal polynomials; Macdonald polynomials; Difference polynomials; Orthogonal polynomials; Property (philosophy); Classical orthogonal polynomials; Combinatorics; Gegenbauer polynomials; Algebra over a field","score_opus":0.029395714663305168,"score_gpt":0.3012471929987939,"score_spread":0.2718514783354887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2986518919","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9649999,0.00014844979,0.026112903,0.00010080775,0.000030106872,0.0000068535014,0.00005634035,0.000050944433,0.008493695],"genre_scores_gemma":[0.9969266,0.00008231639,0.0011129698,0.0000075825774,0.00002156928,0.000003967048,0.000033087013,0.0000114432705,0.0018005308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99982375,0.00003079363,0.0000060291036,0.000026868702,0.000052118387,0.00006041303],"domain_scores_gemma":[0.9989895,0.00028932144,0.0003413386,0.000050021947,0.00015305518,0.00017683064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003462995,0.0004900369,0.00021232908,0.0017671417,0.00047772453,0.0007755166,0.00041908323,0.00035349926,0.0029368629],"category_scores_gemma":[0.0021928425,0.00014971501,0.00020727981,0.00061186287,0.0010826967,0.0010774697,0.00062889996,0.0005492546,0.0003593764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019457491,0.00008242027,0.0042829495,0.00011468289,0.00002512164,0.0005462862,0.0005606529,0.0371337,0.018933961,0.9218529,0.0010255944,0.015247184],"study_design_scores_gemma":[0.00005987535,0.00024054197,0.005524562,0.0000432698,0.000024807927,0.0006215927,0.00048231854,0.19230756,0.008137547,0.7895261,0.0029613408,0.00007058028],"about_ca_topic_score_codex":0.0006608413,"about_ca_topic_score_gemma":0.0005556277,"teacher_disagreement_score":0.0029368629,"about_ca_system_score_codex":0.00037900588,"about_ca_system_score_gemma":0.00021731679,"threshold_uncertainty_score":0.009824812},"labels":[],"label_agreement":null},{"id":"W2987505511","doi":"10.1007/s10878-019-00466-2","title":"On the König deficiency of zero-reducible graphs","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Graph theory and applications","field":"Mathematics","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":"Memorial University of Newfoundland","funders":"Horizon 2020","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Graph; Matching (statistics); Theory of computation; Context (archaeology); Discrete mathematics; Line graph; Algorithm; Statistics","score_opus":0.018655397149084107,"score_gpt":0.2690757413895451,"score_spread":0.250420344240461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2987505511","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7179537,0.0003255368,0.26253945,0.0004944572,0.00003884032,0.00015887988,0.00032538443,0.0006174894,0.017546207],"genre_scores_gemma":[0.96217805,0.00011818557,0.034741018,0.00007400725,0.00001876706,0.000043108557,0.00031839553,0.00007415794,0.0024343377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867165,0.00030912843,0.00008170173,0.0003402442,0.00035121533,0.00024617588],"domain_scores_gemma":[0.9964619,0.0020005775,0.00029295794,0.000666106,0.00037248427,0.00020598076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013506712,0.00040211764,0.0008248994,0.0016885961,0.0011170992,0.0018823112,0.00095150707,0.0005777761,0.0018049929],"category_scores_gemma":[0.004708169,0.0003059183,0.0006223209,0.00083035993,0.002311513,0.00249156,0.0020809795,0.001276305,0.00028684453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041530753,0.00014042892,0.0041086893,0.00021835291,0.000041226187,0.0005403763,0.0011479148,0.03534988,0.022594161,0.88532984,0.0014638447,0.04864997],"study_design_scores_gemma":[0.000049009483,0.00015026134,0.00104238,0.000037203677,0.000037699952,0.00036008886,0.00035596467,0.08321978,0.024502289,0.88405234,0.006163955,0.000028924118],"about_ca_topic_score_codex":0.0016132902,"about_ca_topic_score_gemma":0.001324553,"teacher_disagreement_score":0.0018823112,"about_ca_system_score_codex":0.0013399835,"about_ca_system_score_gemma":0.0007755672,"threshold_uncertainty_score":0.009722352},"labels":[],"label_agreement":null},{"id":"W2989234367","doi":"10.1007/s00493-023-00007-w","title":"On the Density of Critical Graphs with No Large Cliques","year":2023,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Graph theory and applications","field":"Mathematics","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 Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Combinatorics; Clique-sum; Chordal graph; Discrete mathematics; Graph; 1-planar graph","score_opus":0.0351792611584909,"score_gpt":0.31964784191637935,"score_spread":0.28446858075788845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989234367","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7075078,0.0059791747,0.19755314,0.011230905,0.0005032252,0.00017184477,0.0012653493,0.00062307453,0.0751655],"genre_scores_gemma":[0.97445506,0.0021017788,0.014468179,0.00070928433,0.0009377464,0.00019417773,0.00067916187,0.00021258835,0.0062419674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985238,0.0006990997,0.000035820263,0.00025242355,0.00027549095,0.00021342565],"domain_scores_gemma":[0.94862086,0.042287998,0.0023397952,0.0015503118,0.0018872007,0.0033138576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027953188,0.0009404061,0.0022011015,0.0049733324,0.002676448,0.003637407,0.0037259702,0.0023553204,0.008775192],"category_scores_gemma":[0.04199545,0.0016264841,0.0007757147,0.0026108949,0.006356817,0.0073295026,0.003100979,0.0030322513,0.0005594797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020322621,0.00008368815,0.002747691,0.00026466793,0.000042685762,0.00012775215,0.000460977,0.01607861,0.0013255667,0.9653196,0.0073729623,0.0059726215],"study_design_scores_gemma":[0.00005759666,0.000027872755,0.0016835708,0.000077435616,0.000030694668,0.00022403788,0.00024170364,0.08461697,0.000462658,0.9107959,0.0017518325,0.000029707538],"about_ca_topic_score_codex":0.0033436315,"about_ca_topic_score_gemma":0.0026753906,"teacher_disagreement_score":0.008775192,"about_ca_system_score_codex":0.002612527,"about_ca_system_score_gemma":0.00094374106,"threshold_uncertainty_score":0.029356003},"labels":[],"label_agreement":null},{"id":"W2992437209","doi":"","title":"RANDIC INDEX AND EDGE ECCENTRIC CONNECTIVITY INDEX OF CERTAIN SPECIAL MOLECULAR GRAPHS","year":2014,"lang":"en","type":"article","venue":"International Journal of Chemistry","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chemistry; Topological index; Molecular graph; Graph; Combinatorics; Index (typography); Computational chemistry; Mathematics; Computer science","score_opus":0.009693341816664954,"score_gpt":0.27215753596058423,"score_spread":0.26246419414391925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2992437209","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8807854,0.001317159,0.0786236,0.00026070882,0.000053155214,0.00006697836,0.0005074961,0.00019412352,0.03819147],"genre_scores_gemma":[0.9868418,0.00051152916,0.011232118,0.00003092928,0.00003947801,0.000026559492,0.00026821604,0.000019779793,0.0010296255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997069,0.00005543528,0.000018066605,0.00008853,0.000082983235,0.000048083974],"domain_scores_gemma":[0.99850816,0.00048432592,0.00040201322,0.0001609267,0.0002720762,0.00017252621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033118957,0.00037594233,0.00040089153,0.0031319924,0.0007464564,0.00077917223,0.00050340657,0.00046276677,0.0025195898],"category_scores_gemma":[0.0024194482,0.00016160743,0.00026859422,0.0013534332,0.00086140534,0.0018986444,0.000440913,0.0004658274,0.00018581339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004758277,0.0001378235,0.03786231,0.0005939519,0.00014584632,0.0008562893,0.00087671226,0.071305,0.037122194,0.7344618,0.0060028424,0.1101595],"study_design_scores_gemma":[0.000071071154,0.00031460566,0.04839295,0.00013075127,0.00020483734,0.0032188285,0.0011052997,0.33557037,0.029122947,0.55907,0.02263127,0.00016710094],"about_ca_topic_score_codex":0.000739519,"about_ca_topic_score_gemma":0.00091600773,"teacher_disagreement_score":0.0031319924,"about_ca_system_score_codex":0.0006174666,"about_ca_system_score_gemma":0.00022858403,"threshold_uncertainty_score":0.008428812},"labels":[],"label_agreement":null},{"id":"W2994005856","doi":"10.1109/cdc40024.2019.9030220","title":"Spectral Representations of Graphons in Very Large Network Systems Control","year":2019,"lang":"en","type":"article","venue":"","topic":"Graph theory and applications","field":"Mathematics","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":"McGill University","funders":"","keywords":"Controllability; Eigenfunction; Spectral analysis; Computer science; Dynamical systems theory; Mathematics; Algorithm; Applied mathematics; Physics; Eigenvalues and eigenvectors; Spectroscopy; Quantum mechanics","score_opus":0.015546679610724024,"score_gpt":0.28580648057115315,"score_spread":0.2702598009604291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994005856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044293325,0.00067480054,0.94374824,0.00042400492,0.000120235236,0.000029920013,0.000056636465,0.000115263916,0.010537682],"genre_scores_gemma":[0.92576176,0.000850389,0.06709727,0.00018185578,0.00009759898,0.00009077198,0.00009229776,0.00007432435,0.0057538333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970007,0.00013258403,0.000010726283,0.000044310927,0.00008154784,0.000030824755],"domain_scores_gemma":[0.9989936,0.00059761293,0.000115131676,0.00009758275,0.00014326427,0.00005277012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007341526,0.0006278998,0.00040226793,0.0007040489,0.00041424172,0.00095814746,0.00064551755,0.00084608706,0.0022047793],"category_scores_gemma":[0.003073293,0.00021682461,0.00038499612,0.00047995648,0.00163853,0.0015773101,0.00071357633,0.0009851576,0.00023712173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000389931,0.000025550846,0.00027860695,0.000061566476,0.00001719468,0.00006311942,0.00015339722,0.34649006,0.0030020762,0.63889045,0.0007448809,0.010234189],"study_design_scores_gemma":[0.0000029855657,0.00001567347,0.000100452315,0.000008441151,0.0000022956406,0.00001791312,0.000028025655,0.849982,0.00026404322,0.1486993,0.00087044196,0.000008246879],"about_ca_topic_score_codex":0.0023216533,"about_ca_topic_score_gemma":0.0013361278,"teacher_disagreement_score":0.0023216533,"about_ca_system_score_codex":0.00077076454,"about_ca_system_score_gemma":0.00035037426,"threshold_uncertainty_score":0.007375717},"labels":[],"label_agreement":null},{"id":"W2994336805","doi":"10.1515/spma-2019-0026","title":"Inertias of Laplacian matrices of weighted signed graphs","year":2019,"lang":"en","type":"preprint","venue":"Special Matrices","topic":"Graph theory and applications","field":"Mathematics","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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Signed graph; Laplacian matrix; Mathematics; Laplace operator; Combinatorics; Eigenvalues and eigenvectors; Algebraic connectivity; Upper and lower bounds; Discrete mathematics; Graph; Mathematical analysis; Physics","score_opus":0.027309227176107575,"score_gpt":0.2958247948631122,"score_spread":0.26851556768700463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994336805","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8461805,0.0002452252,0.13936383,0.00021540321,0.00007387812,0.00003767665,0.00012662685,0.00023219273,0.013524695],"genre_scores_gemma":[0.99141496,0.00010882259,0.006698298,0.000038411294,0.000068097295,0.00003860947,0.000093109935,0.000043574284,0.0014961261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902916,0.00018495068,0.000060270046,0.00017579396,0.00034223156,0.0002075769],"domain_scores_gemma":[0.995261,0.0018520271,0.0011096633,0.0005199895,0.00033557968,0.0009217487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008578271,0.00085277105,0.00080265244,0.002857474,0.000894,0.0017588607,0.0009482747,0.0009254735,0.0046360753],"category_scores_gemma":[0.0053039524,0.0004961629,0.0007921095,0.00080169854,0.0025150916,0.0022580535,0.0016071291,0.00090888195,0.00042117282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041961094,0.00013210381,0.0026825548,0.00021088922,0.0000827194,0.00073109736,0.0006100781,0.039630223,0.05740034,0.87801296,0.0016002525,0.018487155],"study_design_scores_gemma":[0.00006127851,0.00021092601,0.0032047834,0.000048182614,0.000034046407,0.0005066781,0.00028418392,0.16518794,0.011177854,0.81731147,0.001885985,0.00008666678],"about_ca_topic_score_codex":0.00025421142,"about_ca_topic_score_gemma":0.00026051037,"teacher_disagreement_score":0.0046360753,"about_ca_system_score_codex":0.0005637105,"about_ca_system_score_gemma":0.00024336229,"threshold_uncertainty_score":0.015509248},"labels":[],"label_agreement":null},{"id":"W2996622318","doi":"10.1515/spma-2019-0022","title":"Achievable multiplicity partitions in the inverse eigenvalue problem of a graph","year":2019,"lang":"en","type":"article","venue":"Special Matrices","topic":"Graph theory and applications","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University; University of Regina","funders":"Palestine Polytechnic University; Canada Research Chairs; Deutscher Akademischer Austauschdienst; Natural Sciences and Engineering Research Council of Canada; European Commission; Universität Konstanz; Bundesministerium für Bildung und Forschung; University of Regina","keywords":"Mathematics; Combinatorics; Multiplicity (mathematics); Indifference graph; Partition (number theory); Diagonal; Discrete mathematics; Eigenvalues and eigenvectors; Chordal graph; Cograph; Graph; 1-planar graph","score_opus":0.029023872947341624,"score_gpt":0.288474923220522,"score_spread":0.2594510502731804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996622318","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76725876,0.00022045971,0.20669004,0.0010815861,0.000061950006,0.00008620476,0.00029762092,0.0003242279,0.023979172],"genre_scores_gemma":[0.97075427,0.000084806445,0.025589464,0.00009836715,0.00003900469,0.000075236014,0.00018100961,0.00009318234,0.0030846957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853766,0.0005187436,0.000057111476,0.00032471248,0.00025282506,0.00030893346],"domain_scores_gemma":[0.99427754,0.003411184,0.00066128344,0.00068392925,0.00032248214,0.00064358214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015400288,0.00093163113,0.001130906,0.001113531,0.0018544799,0.0022744592,0.0013683192,0.0018717411,0.0045121075],"category_scores_gemma":[0.008709992,0.0009710052,0.00071415014,0.00076000975,0.0026361747,0.0033262703,0.00217059,0.0017552193,0.0005256748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008348976,0.00020887317,0.0018399436,0.00020394938,0.00009212949,0.0008910412,0.00092700735,0.14424445,0.01848492,0.8130595,0.005246608,0.013966758],"study_design_scores_gemma":[0.000068164816,0.00011296548,0.0005581873,0.000032323875,0.000023248913,0.00041463636,0.00036242115,0.22056982,0.0069724596,0.76871973,0.002128034,0.000037905873],"about_ca_topic_score_codex":0.00053659006,"about_ca_topic_score_gemma":0.000622261,"teacher_disagreement_score":0.0045121075,"about_ca_system_score_codex":0.0013316293,"about_ca_system_score_gemma":0.000579644,"threshold_uncertainty_score":0.015094459},"labels":[],"label_agreement":null},{"id":"W2997909010","doi":"10.7151/dmgt.2285","title":"Some Observations on the Smallest Adjacency Eigenvalue of a Graph","year":2020,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Graph theory and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Interlacing; Adjacency matrix; Combinatorics; Mathematics; Eigenvalues and eigenvectors; Graph energy; Line graph; Adjacency list; Vertex (graph theory); Upper and lower bounds; Discrete mathematics; Graph; Voltage graph; Computer science; Mathematical analysis","score_opus":0.562540230958954,"score_gpt":0.5503696728113276,"score_spread":0.012170558147626354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997909010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30276805,0.005985355,0.57982665,0.005229985,0.00060236925,0.000053855765,0.0010062057,0.0010928198,0.10343476],"genre_scores_gemma":[0.929837,0.0042819693,0.054789193,0.00075923715,0.0014651451,0.00008735825,0.0007571688,0.00042659772,0.007596468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990895,0.00019824781,0.00004614975,0.00028834876,0.00025779568,0.000119990575],"domain_scores_gemma":[0.99067336,0.0065525104,0.00086196733,0.00076392805,0.0006739289,0.00047425186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009142508,0.0007392446,0.0005789469,0.002453727,0.0011041278,0.0013106058,0.0009345582,0.0008717469,0.0070596393],"category_scores_gemma":[0.009926395,0.0004226954,0.0005346026,0.0017538004,0.0025998186,0.0039411103,0.0011224578,0.0028501698,0.0009624206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001397613,0.00010770704,0.0026946825,0.00035995292,0.000040121293,0.0005745285,0.00096344104,0.025208628,0.023049243,0.90565336,0.0090078,0.032200683],"study_design_scores_gemma":[0.000014263467,0.00007183365,0.0032173232,0.00006626392,0.000020683712,0.0003306774,0.00027200222,0.044996202,0.0039108205,0.9398731,0.0071696984,0.000057263795],"about_ca_topic_score_codex":0.0008995137,"about_ca_topic_score_gemma":0.0010505455,"teacher_disagreement_score":0.0070596393,"about_ca_system_score_codex":0.0006885119,"about_ca_system_score_gemma":0.00025789032,"threshold_uncertainty_score":0.02361685},"labels":[],"label_agreement":null},{"id":"W2998654349","doi":"10.1515/spma-2019-0026","title":"Inertias of Laplacian matrices of weighted signed graphs","year":2019,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Graph theory and applications","field":"Mathematics","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 Victoria","funders":"","keywords":"Mathematics; Signed graph; Laplacian matrix; Laplace operator; Combinatorics; Eigenvalues and eigenvectors; Algebraic connectivity; Upper and lower bounds; Discrete mathematics; Inertia; Graph; Mathematical analysis","score_opus":0.20301198483071034,"score_gpt":0.5384347657138311,"score_spread":0.3354227808831207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998654349","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76723146,0.0003592496,0.21187894,0.00032231145,0.00008144166,0.00005554374,0.00021114471,0.00031806465,0.01954186],"genre_scores_gemma":[0.9828478,0.00024144881,0.013553761,0.00006628694,0.00011263826,0.00007681145,0.00018786646,0.00008631582,0.0028271223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989748,0.00017533771,0.00006662085,0.00018542416,0.00034474206,0.00025313848],"domain_scores_gemma":[0.99397933,0.002646499,0.0014250163,0.00054487097,0.00034729097,0.001057069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092952535,0.0010650621,0.0008240403,0.0034223527,0.0010900623,0.0020693757,0.0011742321,0.001004324,0.004974928],"category_scores_gemma":[0.0062453947,0.00062791654,0.0010526788,0.0010654741,0.0027295037,0.0031081764,0.0019348752,0.001279422,0.0005597758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027729213,0.00011864813,0.0020905067,0.00017556743,0.000063599044,0.00059802213,0.00067049626,0.036030784,0.035731625,0.9077138,0.001495598,0.015034081],"study_design_scores_gemma":[0.000047416874,0.00014112405,0.002375317,0.00004445025,0.00002713903,0.00035311928,0.0002511845,0.141077,0.006682227,0.84731513,0.0016095637,0.00007633965],"about_ca_topic_score_codex":0.00033666447,"about_ca_topic_score_gemma":0.00036398284,"teacher_disagreement_score":0.004974928,"about_ca_system_score_codex":0.0006874792,"about_ca_system_score_gemma":0.00029693954,"threshold_uncertainty_score":0.016642809},"labels":[],"label_agreement":null},{"id":"W2999031880","doi":"10.37236/7133","title":"Distribution of Coefficients of Rank Polynomials for Random Sparse Graphs","year":2018,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Mathematics; Combinatorics; Rank (graph theory); Random graph; Limiting; Distribution (mathematics); Graph; Asymptotic distribution; Discrete mathematics; Polynomial; Statistics; Mathematical analysis","score_opus":0.020871246361832543,"score_gpt":0.29655726252902237,"score_spread":0.27568601616718985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999031880","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85497147,0.00039980144,0.13372092,0.0011077301,0.000039786144,0.000079075086,0.00050539925,0.00051454967,0.008661296],"genre_scores_gemma":[0.98825026,0.0005257707,0.0064854426,0.00008609991,0.00008413437,0.00009548287,0.0005203646,0.00016954994,0.0037829361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921465,0.00027926735,0.000020156227,0.00012735446,0.00018518182,0.00017340468],"domain_scores_gemma":[0.9873841,0.008182934,0.00143068,0.00086749234,0.0010641882,0.0010705584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022115095,0.0006173974,0.0009258492,0.0030618445,0.00067733886,0.001859786,0.001681362,0.0011198262,0.004245139],"category_scores_gemma":[0.020734422,0.00064138894,0.0005972508,0.0013159917,0.003311003,0.0028528231,0.0013282867,0.0017289148,0.0005445843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027486315,0.00010453472,0.008024114,0.00024623374,0.000043942586,0.00074002193,0.0005531799,0.1886463,0.012740416,0.7765652,0.003585153,0.008476055],"study_design_scores_gemma":[0.00006038981,0.00006783654,0.0033689707,0.000056797027,0.000023533194,0.00047595313,0.00026303134,0.8036676,0.00422433,0.18638377,0.0013253712,0.00008242565],"about_ca_topic_score_codex":0.0023430209,"about_ca_topic_score_gemma":0.0017629896,"teacher_disagreement_score":0.004245139,"about_ca_system_score_codex":0.0015605829,"about_ca_system_score_gemma":0.0006204179,"threshold_uncertainty_score":0.014201403},"labels":[],"label_agreement":null},{"id":"W3000216555","doi":"10.37236/478","title":"A Classification of Ramanujan Unitary Cayley Graphs","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":35,"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":"Queen's University","keywords":"Mathematics; Combinatorics; Cayley graph; Ramanujan's sum; Vertex (graph theory); Multiplicative function; Modulo; Graph; Discrete mathematics","score_opus":0.018746582183908244,"score_gpt":0.2853144750696924,"score_spread":0.26656789288578414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000216555","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70764416,0.0034891285,0.116009034,0.0012753132,0.00030128437,0.00015166406,0.000601644,0.0005290863,0.16999857],"genre_scores_gemma":[0.96419173,0.0012515661,0.020538395,0.00036817387,0.0001916915,0.00009760764,0.0007103196,0.00007179285,0.012578655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945587,0.00010441333,0.0000308264,0.000116848205,0.000167915,0.00012410725],"domain_scores_gemma":[0.9989837,0.0003625197,0.00013884254,0.00014863249,0.00021484306,0.00015149624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035945346,0.00039816846,0.00034384517,0.0021118873,0.0013494433,0.0017642817,0.0007294606,0.00075431616,0.004089295],"category_scores_gemma":[0.0016713269,0.0002966382,0.00039321894,0.001544869,0.0014227912,0.0015866116,0.000800259,0.00082673645,0.00054965337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022772498,0.000022282768,0.00077689847,0.000039276976,0.000007631964,0.000119835604,0.00020170092,0.0014695965,0.0021715935,0.97750014,0.0023822454,0.015286107],"study_design_scores_gemma":[0.000017943321,0.000030112258,0.001258195,0.00003268574,0.000015318094,0.0005952581,0.00025675338,0.024785357,0.0016182705,0.9576268,0.013734543,0.000028812456],"about_ca_topic_score_codex":0.0014948908,"about_ca_topic_score_gemma":0.0017378482,"teacher_disagreement_score":0.004089295,"about_ca_system_score_codex":0.0007624425,"about_ca_system_score_gemma":0.00053096586,"threshold_uncertainty_score":0.013680041},"labels":[],"label_agreement":null},{"id":"W3000378593","doi":"10.37236/8498","title":"Fractional Factors, Component Factors and Isolated Vertex Conditions in Graphs","year":2019,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Fundamental Research Funds for the Central Universities; Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Graph; Vertex (graph theory)","score_opus":0.013398487517632509,"score_gpt":0.26743787978295636,"score_spread":0.25403939226532385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000378593","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6267858,0.0020309475,0.31307974,0.0007642261,0.00019351576,0.00015815895,0.0007386422,0.0009356093,0.055313356],"genre_scores_gemma":[0.9530644,0.0008574119,0.039266016,0.0002076857,0.00016836954,0.00009803251,0.00066288834,0.00019077296,0.005484409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870586,0.0002061668,0.000093668896,0.00040417968,0.00024661078,0.00034349717],"domain_scores_gemma":[0.99649566,0.0017581268,0.00038965626,0.00045396658,0.00041414562,0.00048846303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009118689,0.0011361516,0.00091627485,0.0022100452,0.0024703082,0.0026172043,0.000923024,0.0013411855,0.007239416],"category_scores_gemma":[0.008011156,0.0005629838,0.0016189411,0.0019582906,0.0041113426,0.005073628,0.002142355,0.0018641806,0.0010519285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042721373,0.00007435985,0.0029475947,0.0001665835,0.000032027678,0.0004383641,0.0009025547,0.009026515,0.005067549,0.9601505,0.0022280838,0.018538667],"study_design_scores_gemma":[0.000051843726,0.0001228951,0.0012742997,0.00007529777,0.00007070482,0.000716125,0.0006445869,0.030662483,0.007139014,0.94941086,0.009763074,0.00006886647],"about_ca_topic_score_codex":0.0041939733,"about_ca_topic_score_gemma":0.003213437,"teacher_disagreement_score":0.007239416,"about_ca_system_score_codex":0.001570831,"about_ca_system_score_gemma":0.00085649046,"threshold_uncertainty_score":0.024218202},"labels":[],"label_agreement":null},{"id":"W3004295516","doi":"10.1016/j.laa.2020.01.032","title":"Cut ratios and Laplacian eigenvalues","year":2020,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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":"McGill University","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Vertex (graph theory); Combinatorics; Laplace operator; Maximum cut; Upper and lower bounds; Graph; Mathematical analysis","score_opus":0.045138070525616955,"score_gpt":0.2983344160241639,"score_spread":0.2531963454985469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004295516","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.49194905,0.004494878,0.21517316,0.0062264255,0.0012475972,0.000099414334,0.00049343304,0.0010636409,0.27925235],"genre_scores_gemma":[0.9527902,0.0011104327,0.015660075,0.0006302289,0.0009206456,0.00010696682,0.00019875223,0.00037039776,0.028212318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993618,0.0001814672,0.00002299595,0.00014094212,0.00020064991,0.00009217268],"domain_scores_gemma":[0.99752384,0.0012439572,0.00039156928,0.00013208161,0.0002918386,0.0004167063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007505214,0.0010022861,0.0009372646,0.005560006,0.0015328951,0.0041598333,0.0013529706,0.0015965641,0.019349357],"category_scores_gemma":[0.0057163863,0.00057172205,0.0004712357,0.0020321356,0.002653351,0.0046494086,0.0020607684,0.0022311118,0.0021539931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026162767,0.00002858631,0.0001533894,0.000031742326,0.0000048643947,0.000048540078,0.00011984913,0.0008095597,0.0013285885,0.9894276,0.0016956982,0.0063254368],"study_design_scores_gemma":[0.000007671587,0.000007780559,0.00024088504,0.000012709345,0.000005187742,0.00015461312,0.000109319735,0.00844755,0.00061003777,0.98915815,0.0012340338,0.000012023571],"about_ca_topic_score_codex":0.00037795663,"about_ca_topic_score_gemma":0.00037217172,"teacher_disagreement_score":0.019349357,"about_ca_system_score_codex":0.0008936874,"about_ca_system_score_gemma":0.0003415123,"threshold_uncertainty_score":0.06473011},"labels":[],"label_agreement":null},{"id":"W3006025026","doi":"10.1109/itw44776.2019.8989394","title":"From the Spectrum of the Adjacency Matrix to the Spectrum of Directed Edge Matrix: Counting Cycles of a Bipartite Graph Through a Simple Equation","year":2019,"lang":"en","type":"article","venue":"","topic":"Graph theory and applications","field":"Mathematics","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":"Carleton University","funders":"","keywords":"Adjacency matrix; Bipartite graph; Adjacency list; Spectrum (functional analysis); Graph energy; Combinatorics; Mathematics; Simple (philosophy); Matrix (chemical analysis); Enhanced Data Rates for GSM Evolution; Complete bipartite graph; Graph; Discrete mathematics; Computer science; Line graph; Voltage graph; Physics; Artificial intelligence","score_opus":0.03077930581437639,"score_gpt":0.30564999050781566,"score_spread":0.2748706846934393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006025026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0617241,0.00028029646,0.9269443,0.0004789583,0.000102598366,0.000061580424,0.00039199347,0.0004537394,0.009562344],"genre_scores_gemma":[0.52175325,0.0009010165,0.4628259,0.00073323946,0.0002973383,0.00043258216,0.0011780635,0.000561906,0.01131674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934226,0.00015425314,0.000033429198,0.00015163475,0.00024676792,0.00007158109],"domain_scores_gemma":[0.99707735,0.0016873323,0.0002747882,0.00031162836,0.00044948456,0.00019935449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080887985,0.00076424866,0.0006137596,0.0029513976,0.0005081599,0.00127673,0.0015946636,0.0012215612,0.0063565467],"category_scores_gemma":[0.0086520715,0.0004006586,0.00074492604,0.0017516728,0.0017396922,0.004017669,0.0012823713,0.0015212724,0.0013377973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011561964,0.00010504903,0.0036333208,0.00021819871,0.000042711472,0.0002145188,0.000430376,0.08480177,0.015212641,0.8122618,0.0077746557,0.07518941],"study_design_scores_gemma":[0.000010721694,0.000020993977,0.00076041644,0.000035617137,0.000008463733,0.00013675727,0.000057671565,0.5989888,0.0026861634,0.3950418,0.0022227755,0.000029692837],"about_ca_topic_score_codex":0.002554414,"about_ca_topic_score_gemma":0.0025932428,"teacher_disagreement_score":0.0063565467,"about_ca_system_score_codex":0.0008163269,"about_ca_system_score_gemma":0.0007890956,"threshold_uncertainty_score":0.021264732},"labels":[],"label_agreement":null},{"id":"W3008022325","doi":"10.1016/j.laa.2020.02.026","title":"On the difference of energies of a graph and its complement graph","year":2020,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Distance-regular graph; Combinatorics; Graph energy; Graph; Complement graph; Regular graph; Eigenvalues and eigenvectors; Graph power; Voltage graph; Cubic graph; Discrete mathematics; Simplex graph; Line graph; Quantum mechanics; Physics","score_opus":0.05683909928595989,"score_gpt":0.29044558653278296,"score_spread":0.23360648724682306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008022325","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55795205,0.0050007435,0.31107304,0.0058825654,0.0012203108,0.0000445661,0.0005106469,0.00020466132,0.11811143],"genre_scores_gemma":[0.94555485,0.0015996703,0.028349813,0.0008760306,0.0008323171,0.000075804615,0.0003648704,0.00023288398,0.022113727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917966,0.0003221029,0.00003090069,0.00018167774,0.00019026957,0.00009545136],"domain_scores_gemma":[0.9951297,0.0035477786,0.00031843293,0.00022271664,0.000386424,0.00039502233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016126259,0.00069272355,0.0009690537,0.0036972063,0.0010548729,0.0021157507,0.002005281,0.0017688238,0.009254669],"category_scores_gemma":[0.0062344903,0.00043972136,0.00066731544,0.0019286952,0.0040957686,0.006692407,0.002097064,0.0028526303,0.00067873235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027194275,0.000020752537,0.00017513018,0.00003237492,0.000007052848,0.00002189047,0.00010604176,0.0016766224,0.0005096868,0.9932808,0.0005365217,0.0036060286],"study_design_scores_gemma":[0.0000057786488,0.000013273963,0.00031674324,0.000015999274,0.0000052009605,0.000067352594,0.00007662424,0.013248728,0.00019626357,0.98500526,0.0010362461,0.000012506916],"about_ca_topic_score_codex":0.0009165617,"about_ca_topic_score_gemma":0.00100386,"teacher_disagreement_score":0.009254669,"about_ca_system_score_codex":0.0013088612,"about_ca_system_score_gemma":0.0004305503,"threshold_uncertainty_score":0.030959964},"labels":[],"label_agreement":null},{"id":"W3008854661","doi":"10.1016/j.laa.2020.02.013","title":"On unit spherical Euclidean distance matrices which differ in one entry","year":2020,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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 Windsor","funders":"","keywords":"Euclidean distance matrix; Mathematics; Euclidean distance; Unit sphere; Euclidean geometry; Unit (ring theory); Combinatorics; Matrix (chemical analysis); Set (abstract data type); Distance matrix; Characterization (materials science); Geometry; Computer science; Physics","score_opus":0.04241428356594308,"score_gpt":0.2891106664882137,"score_spread":0.24669638292227064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008854661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3853571,0.0026293097,0.44529566,0.002363592,0.0013889687,0.00009632098,0.0006501986,0.00044976582,0.16176897],"genre_scores_gemma":[0.8878533,0.0020646444,0.050187454,0.0013735001,0.00093700446,0.00011458826,0.0008051077,0.00044721682,0.056217253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986292,0.00042706923,0.000063010026,0.00029352572,0.00040719123,0.00018005571],"domain_scores_gemma":[0.99686843,0.0012098437,0.0006126052,0.00040005532,0.00053591497,0.00037307537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009521215,0.0012017997,0.0008707009,0.002877304,0.0013063841,0.0026930457,0.002080035,0.0022070643,0.007818241],"category_scores_gemma":[0.004617718,0.0004616318,0.00068259396,0.0025367553,0.003429697,0.005193688,0.0027095373,0.0020912297,0.0027517094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027104672,0.00001964206,0.00008817261,0.000036635287,0.000005595355,0.00005654807,0.00018593937,0.001197355,0.0012390297,0.9894587,0.0013173224,0.00636795],"study_design_scores_gemma":[0.0000058580763,0.000022201493,0.00018239171,0.000019250638,0.000004466222,0.00015494079,0.0001399449,0.008225191,0.000697616,0.9882876,0.0022342722,0.000026274514],"about_ca_topic_score_codex":0.001099773,"about_ca_topic_score_gemma":0.001028162,"teacher_disagreement_score":0.007818241,"about_ca_system_score_codex":0.00080584246,"about_ca_system_score_gemma":0.00043378674,"threshold_uncertainty_score":0.026154637},"labels":[],"label_agreement":null},{"id":"W3009460062","doi":"","title":"On the difference of energies of a graph and its complement graph","year":2020,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Graph theory and applications","field":"Mathematics","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Complement graph; Distance-regular graph; Graph energy; Graph; Regular graph; Discrete mathematics; Line graph; Null graph; Cubic graph; Voltage graph; Simplex graph; Strength of a graph; Graph power","score_opus":0.04631915453908972,"score_gpt":0.258584714138284,"score_spread":0.21226555959919427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009460062","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8987666,0.0009408555,0.08389925,0.0011468859,0.00011663759,0.0000150611595,0.00025801721,0.000057703783,0.01479904],"genre_scores_gemma":[0.9885719,0.0002345509,0.008306218,0.00010293734,0.0001062425,0.000025771025,0.00016035655,0.000051224637,0.0024407792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993148,0.00023860685,0.00002070771,0.0001620381,0.000171827,0.00009210789],"domain_scores_gemma":[0.99403524,0.00475994,0.0003693829,0.000250078,0.0002649759,0.00032037147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011194475,0.00043081865,0.00073955394,0.0019897597,0.00056118023,0.0010976384,0.00093863363,0.0009698134,0.0042179227],"category_scores_gemma":[0.006045078,0.00021041589,0.00031749607,0.00093607634,0.0024039608,0.0024203393,0.0011682092,0.0010904673,0.0002573026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004009507,0.00010166027,0.0051533496,0.00017073538,0.0000794369,0.0002859967,0.00041416555,0.0547167,0.0081460215,0.91160554,0.0022707738,0.0166547],"study_design_scores_gemma":[0.000024633298,0.000095697564,0.0053928387,0.00004669076,0.00002322479,0.000420071,0.0002720329,0.19084328,0.001855835,0.7987312,0.002260277,0.000034214398],"about_ca_topic_score_codex":0.00041025734,"about_ca_topic_score_gemma":0.0003748033,"teacher_disagreement_score":0.0042179227,"about_ca_system_score_codex":0.0008071489,"about_ca_system_score_gemma":0.00017779446,"threshold_uncertainty_score":0.014110386},"labels":[],"label_agreement":null},{"id":"W3010132614","doi":"10.1016/j.ejc.2020.103280","title":"Graph covers with two new eigenvalues","year":2020,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Adjacency matrix; Mathematics; Eigenvalues and eigenvectors; Hypercube; Adjacency list; Regular graph; Discrete mathematics; Multiset; Conjecture; Graph energy; Graph; Cover (algebra); Line graph; Voltage graph","score_opus":0.053967928660172984,"score_gpt":0.27650973602796725,"score_spread":0.22254180736779428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010132614","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77752936,0.00038365007,0.061518125,0.0036862842,0.0008251216,0.00012488174,0.00050022395,0.001096984,0.15433541],"genre_scores_gemma":[0.94610244,0.00021767688,0.018263033,0.0003746542,0.00035143597,0.000107787055,0.00034931285,0.00028566053,0.033948004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991467,0.00012752082,0.000039296465,0.00014985124,0.00031757535,0.00021902869],"domain_scores_gemma":[0.9981686,0.000703982,0.00017101623,0.0002578137,0.00023332631,0.00046524912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003366274,0.0007083754,0.0006188812,0.0026935516,0.0022966922,0.003174084,0.0007521889,0.002264224,0.011350487],"category_scores_gemma":[0.0022984575,0.0005818055,0.0008122641,0.0012124602,0.0018031278,0.002831423,0.0026606128,0.0017664732,0.0015621381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025085168,0.000096860094,0.0011610144,0.000091866,0.00002537156,0.0015962792,0.0008492632,0.0014324711,0.013049292,0.95993304,0.0070671104,0.014446695],"study_design_scores_gemma":[0.0001335921,0.00008596563,0.003475413,0.000046131092,0.00005568533,0.0028471013,0.00077006785,0.018117845,0.008558628,0.94532275,0.020516038,0.000070725066],"about_ca_topic_score_codex":0.0004767769,"about_ca_topic_score_gemma":0.00056489516,"teacher_disagreement_score":0.011350487,"about_ca_system_score_codex":0.0009295611,"about_ca_system_score_gemma":0.00035978327,"threshold_uncertainty_score":0.03797114},"labels":[],"label_agreement":null},{"id":"W3011118259","doi":"10.1007/s00373-020-02160-1","title":"Maximum Modulus of Independence Roots of Graphs and Trees","year":2020,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Graph theory and applications","field":"Mathematics","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":"University of Guelph; Dalhousie University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Independence number; Independence (probability theory); Upper and lower bounds; Graph; Polynomial; Discrete mathematics; Mathematical analysis; Statistics","score_opus":0.029511971833910473,"score_gpt":0.2578558294510321,"score_spread":0.22834385761712162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011118259","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6083681,0.0024677354,0.18299812,0.008059063,0.00044123482,0.00009365734,0.002193879,0.0006945674,0.19468357],"genre_scores_gemma":[0.9602311,0.0011495962,0.018345902,0.0004891273,0.0009084792,0.00013692088,0.00074540277,0.00022150583,0.017771948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999113,0.00021837745,0.000039826722,0.00023946908,0.00024487617,0.00014451882],"domain_scores_gemma":[0.9836821,0.012553821,0.0010894852,0.0006842551,0.00056982716,0.0014204906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012384062,0.0007775053,0.0010775987,0.0023163005,0.0015357456,0.003145233,0.0014341283,0.0012656781,0.013861068],"category_scores_gemma":[0.014130143,0.00095740205,0.0007045903,0.0019491174,0.0028096975,0.0068137147,0.0026581176,0.0044050682,0.0018800918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002864951,0.00006444618,0.0014264826,0.00021285981,0.000032740507,0.00010716255,0.00057252316,0.0020162908,0.0047924323,0.968159,0.0050071795,0.017322404],"study_design_scores_gemma":[0.000032465403,0.000023473302,0.0015723682,0.00002641889,0.00002454968,0.00019985368,0.000098887765,0.0039284453,0.0013324448,0.9902047,0.0025409306,0.000015426867],"about_ca_topic_score_codex":0.0003182531,"about_ca_topic_score_gemma":0.0005711679,"teacher_disagreement_score":0.013861068,"about_ca_system_score_codex":0.0010477244,"about_ca_system_score_gemma":0.0005539012,"threshold_uncertainty_score":0.04636985},"labels":[],"label_agreement":null},{"id":"W3011216554","doi":"10.1109/cdc40024.2019.9030220","title":"Spectral Representations of Graphons in Very Large Network Systems Control","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph theory and applications","field":"Mathematics","cited_by":29,"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":"Computer science; Control (management); Artificial intelligence","score_opus":0.06421057586505022,"score_gpt":0.22317609980048392,"score_spread":0.1589655239354337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011216554","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.05091858,0.0007768522,0.9357585,0.00051994104,0.00013098434,0.000030345685,0.000065696564,0.00012291492,0.011676216],"genre_scores_gemma":[0.92949206,0.00089748105,0.06290727,0.00019493364,0.00010957743,0.00009013086,0.00009773671,0.00007905485,0.0061318423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996952,0.00013623107,0.000010544418,0.00004597884,0.000081221,0.0000308366],"domain_scores_gemma":[0.9990127,0.00058136304,0.000116339266,0.00009446398,0.00014139038,0.00005375968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007011941,0.0006261077,0.00039139146,0.00072487135,0.0004218185,0.0010006126,0.0006502821,0.00088528806,0.0022426834],"category_scores_gemma":[0.0031036334,0.0002214831,0.00038127063,0.00048812112,0.0016627809,0.0016436402,0.00076080905,0.0009860242,0.0002441078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037985286,0.000024678307,0.00028328714,0.000061310675,0.00001667984,0.00006099173,0.00015596545,0.3007493,0.002837652,0.68507665,0.00080428476,0.00989116],"study_design_scores_gemma":[0.0000033181964,0.000015865324,0.00011053153,0.000009346661,0.0000024166536,0.000019175945,0.000031069136,0.813236,0.00027823553,0.18528298,0.0010024149,0.000008687579],"about_ca_topic_score_codex":0.0022018922,"about_ca_topic_score_gemma":0.0012425404,"teacher_disagreement_score":0.0022426834,"about_ca_system_score_codex":0.0008042978,"about_ca_system_score_gemma":0.00035051393,"threshold_uncertainty_score":0.007502556},"labels":[],"label_agreement":null},{"id":"W3014065338","doi":"10.1093/imrn/rnab100","title":"Partition Regularity for Systems of Diagonal Equations","year":2021,"lang":"en","type":"preprint","venue":"International Mathematics Research Notices","topic":"Graph theory and applications","field":"Mathematics","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":"Diagonal; Partition (number theory); Mathematics; Diagonal matrix; Constant (computer programming); Coefficient matrix; Set (abstract data type); Matrix (chemical analysis); Mathematical analysis; Combinatorics; Pure mathematics; Physics; Geometry; Computer science","score_opus":0.401508842910625,"score_gpt":0.5093179378883604,"score_spread":0.10780909497773544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014065338","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9193645,0.00029376955,0.05303797,0.00062803965,0.00008518996,0.00003401924,0.00011273959,0.0000981086,0.026345702],"genre_scores_gemma":[0.9939421,0.000083521205,0.0031599416,0.000048286114,0.000044397897,0.000019704774,0.000079537494,0.000026507478,0.0025959986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957675,0.00010853478,0.000017088281,0.00006217566,0.00010592941,0.00012958892],"domain_scores_gemma":[0.999022,0.00040250155,0.00019204308,0.000102643084,0.00012135117,0.00015942962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005264347,0.00035791303,0.0006053218,0.000872321,0.0007257388,0.0014395919,0.0005268684,0.0005999983,0.0042856126],"category_scores_gemma":[0.0032409502,0.00027498166,0.0004248344,0.0003038719,0.0018622234,0.0010121617,0.0012998998,0.0008100901,0.00027572617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014540133,0.000060817663,0.0017198755,0.00008480529,0.000038503087,0.00027667737,0.00033438363,0.031400274,0.009197344,0.951359,0.0015349943,0.0038480018],"study_design_scores_gemma":[0.00007979629,0.00006465078,0.0014482565,0.000032763513,0.000019716319,0.00017195608,0.0002988829,0.36648637,0.003351805,0.62636006,0.0016502033,0.000035489345],"about_ca_topic_score_codex":0.0016485496,"about_ca_topic_score_gemma":0.0013529952,"teacher_disagreement_score":0.0042856126,"about_ca_system_score_codex":0.0006462036,"about_ca_system_score_gemma":0.00038926676,"threshold_uncertainty_score":0.014336765},"labels":[],"label_agreement":null},{"id":"W3015062818","doi":"10.1016/j.laa.2022.09.010","title":"Fundamentals of fractional revival in graphs","year":2022,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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 Waterloo; York University","funders":"","keywords":"Mathematics; Adjacency matrix; Diagonal; Combinatorics; Quantum graph; Quantum; Graph; Discrete mathematics; Quantum mechanics; Geometry","score_opus":0.03521110394705637,"score_gpt":0.3162613126379424,"score_spread":0.28105020869088604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015062818","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2037797,0.023043964,0.18792517,0.01784221,0.00447027,0.000118128235,0.0005843443,0.00064438314,0.5615918],"genre_scores_gemma":[0.91335213,0.00746863,0.024278486,0.0017979102,0.003986562,0.00012753537,0.0002019203,0.00020334606,0.048583478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946076,0.00016692495,0.000028025685,0.00010229425,0.00013633323,0.000105674466],"domain_scores_gemma":[0.99917465,0.0003676087,0.00012315233,0.00010944144,0.0001269951,0.00009815901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009695334,0.0007748116,0.0010954634,0.0031121327,0.002313312,0.0037544467,0.0015391624,0.0019346046,0.008300417],"category_scores_gemma":[0.0024319468,0.00048136813,0.0009926487,0.00244593,0.0065024737,0.005668989,0.0018920115,0.00368752,0.0009210978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002672274,0.000004594032,0.000015684616,0.000015131481,0.0000012110213,0.00000843019,0.00007515782,0.00021755707,0.00009411272,0.99747014,0.00054416136,0.0015511321],"study_design_scores_gemma":[0.0000023626524,0.0000021256055,0.000027036933,0.000007169159,0.0000010139048,0.000019448396,0.000024470297,0.0007291912,0.000048419406,0.99708325,0.0020522824,0.0000031717557],"about_ca_topic_score_codex":0.002022721,"about_ca_topic_score_gemma":0.0014079275,"teacher_disagreement_score":0.008300417,"about_ca_system_score_codex":0.0029412322,"about_ca_system_score_gemma":0.00089761254,"threshold_uncertainty_score":0.027767658},"labels":[],"label_agreement":null},{"id":"W3015682606","doi":"10.1017/9781108610902","title":"Tau Functions and their Applications","year":2021,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Graph theory and applications","field":"Mathematics","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"John Abbott College; Université de Montréal; Concordia University","funders":"","keywords":"Integrable system; Subject matter; Computer science; Graduate students; Ideal (ethics); Range (aeronautics); Special functions; Mathematics; Algebra over a field; Pure mathematics; Epistemology; Engineering","score_opus":0.02853865488998119,"score_gpt":0.21946843932859822,"score_spread":0.19092978443861702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015682606","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.02119647,0.11358517,0.06696015,0.004689238,0.0025294349,0.000041631363,0.0002759828,0.00041928384,0.7903027],"genre_scores_gemma":[0.410928,0.14808619,0.0530347,0.0027696376,0.005974677,0.00021527779,0.0005272498,0.00062379544,0.37784043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997867,0.000060533916,0.000008093602,0.000035639783,0.00008178359,0.000027260297],"domain_scores_gemma":[0.9997148,0.00014812294,0.00001695782,0.000034258057,0.00005914618,0.000026802103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033380184,0.0007740647,0.0004922752,0.002653312,0.0013239029,0.0025990473,0.00046247637,0.0007692075,0.009929262],"category_scores_gemma":[0.001251144,0.00023750955,0.0004050379,0.0024431765,0.0018233731,0.00303528,0.001093869,0.0015636457,0.0029217727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043569626,0.0000054290804,0.00004693961,0.00007726113,0.000002512442,0.00005227037,0.00025842772,0.0005447973,0.00031174268,0.95337844,0.010518783,0.034799002],"study_design_scores_gemma":[0.0000012647077,0.000009077111,0.00014878839,0.00008683576,0.0000032068851,0.0002039231,0.000117289725,0.0014070526,0.0002041457,0.87644047,0.12137184,0.000006178274],"about_ca_topic_score_codex":0.0005740476,"about_ca_topic_score_gemma":0.00046469603,"teacher_disagreement_score":0.009929262,"about_ca_system_score_codex":0.001147012,"about_ca_system_score_gemma":0.00045815826,"threshold_uncertainty_score":0.033216715},"labels":[],"label_agreement":null},{"id":"W3021447162","doi":"","title":"Some Properties of the Distance Laplacian Eigenvalues of a Graph","year":2013,"lang":"en","type":"article","venue":"Czech digital mathematics library","topic":"Graph theory and applications","field":"Mathematics","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Resistance distance; Laplacian matrix; Mathematics; Distance matrix; Combinatorics; Laplace operator; Eigenvalues and eigenvectors; Algebraic connectivity; Spectrum (functional analysis); Vertex (graph theory); Graph; Discrete mathematics; Line graph; Mathematical analysis; Physics; Graph power; Quantum mechanics","score_opus":0.02740523054475311,"score_gpt":0.21886558338919773,"score_spread":0.19146035284444463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021447162","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7511653,0.00029541054,0.21503817,0.0007198209,0.000060780985,0.00003795138,0.00034762986,0.0002172764,0.032117713],"genre_scores_gemma":[0.98977125,0.00008058824,0.0077548786,0.000043799395,0.000041584986,0.000022955994,0.00009398404,0.000027976195,0.0021631198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978715,0.000041409578,0.000007969259,0.00005396595,0.00007396156,0.000035450845],"domain_scores_gemma":[0.9987519,0.0006294901,0.00019373774,0.000083126666,0.00021805882,0.00012372684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026338996,0.0002365926,0.00018731547,0.001020795,0.00040458984,0.0007208308,0.00035509485,0.00044220145,0.0043110307],"category_scores_gemma":[0.00215896,0.00011564851,0.00022097077,0.00043663313,0.0007536458,0.0010159633,0.00049088825,0.00047353734,0.0004030462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009063988,0.00007597725,0.0035337394,0.00011442579,0.000023006412,0.000516144,0.00060184725,0.021322263,0.018857423,0.92596656,0.003395578,0.025502369],"study_design_scores_gemma":[0.000024778717,0.000065777676,0.005020898,0.000024086728,0.000013414724,0.0009850617,0.00041621012,0.23040907,0.0047693364,0.75477815,0.0034487841,0.00004447864],"about_ca_topic_score_codex":0.00041754814,"about_ca_topic_score_gemma":0.0002657302,"teacher_disagreement_score":0.0043110307,"about_ca_system_score_codex":0.0004970597,"about_ca_system_score_gemma":0.00022242314,"threshold_uncertainty_score":0.014421821},"labels":[],"label_agreement":null},{"id":"W3022978723","doi":"10.1016/j.laa.2020.04.029","title":"The main eigenvalues of signed graphs","year":2020,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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":"Carleton University","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Mathematics; Combinatorics; Eigenvalues and eigenvectors; Vertex (graph theory); Adjacency matrix; Strongly regular graph; Chordal graph; Conjecture; Discrete mathematics; Cayley graph; Signed graph; Graph; Pathwidth; Line graph","score_opus":0.03800301192216106,"score_gpt":0.2919343721434654,"score_spread":0.25393136022130436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022978723","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51746196,0.0028962027,0.30540663,0.0047002654,0.0019819844,0.00011645169,0.0005964621,0.000964471,0.16587551],"genre_scores_gemma":[0.95028496,0.001103405,0.015159672,0.00059018674,0.0010827642,0.00013988356,0.00020354279,0.00032747528,0.031108128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994173,0.00016648496,0.000024277313,0.00011783515,0.00019392859,0.00008013535],"domain_scores_gemma":[0.9976694,0.0011067826,0.0003509397,0.00015598544,0.00032226322,0.00039449966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067796884,0.0010228622,0.0006911054,0.0031111697,0.0010765002,0.003161609,0.0011073812,0.0017117611,0.011579889],"category_scores_gemma":[0.005285875,0.0005021342,0.00051899586,0.0014180898,0.0026459969,0.003715674,0.0014561345,0.0020177278,0.0018906693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057660476,0.000042314645,0.00016310957,0.00006715769,0.0000075018233,0.0000678597,0.0002327958,0.0015774987,0.0029097951,0.9815809,0.0026452101,0.0106482245],"study_design_scores_gemma":[0.000011045107,0.000012767138,0.00022869752,0.00002042334,0.0000038253993,0.00008664011,0.00010559008,0.008947847,0.0006905955,0.98855025,0.0013224351,0.000020012105],"about_ca_topic_score_codex":0.00027612472,"about_ca_topic_score_gemma":0.00028383735,"teacher_disagreement_score":0.011579889,"about_ca_system_score_codex":0.0006758258,"about_ca_system_score_gemma":0.0005611077,"threshold_uncertainty_score":0.03873861},"labels":[],"label_agreement":null},{"id":"W3026493967","doi":"10.1002/jgt.22855","title":"On the cop number of graphs of high girth","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Graph theory and applications","field":"Mathematics","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Mathematics; Combinatorics; Girth (graph theory); Odd graph; Ramanujan's sum; Upper and lower bounds; Discrete mathematics; Bounded function; Conjecture; Degree (music); Graph; Exponent; Chordal graph; 1-planar graph","score_opus":0.02201858569347133,"score_gpt":0.2863006391288283,"score_spread":0.264282053435357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3026493967","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81325907,0.0014872001,0.12517744,0.0025020377,0.0002445455,0.000111811474,0.0006560911,0.00034607403,0.056215834],"genre_scores_gemma":[0.98308575,0.0006382748,0.011863303,0.00022732056,0.00018584159,0.00009662488,0.00036391293,0.00013975608,0.0033992275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998987,0.00025140456,0.000026807737,0.00023399558,0.00023809973,0.00026268844],"domain_scores_gemma":[0.9889338,0.0071803606,0.0009998912,0.00093756884,0.00076938135,0.0011790365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012139948,0.0006373546,0.0011855334,0.0025318458,0.0016881067,0.002257364,0.0013293662,0.0009766184,0.006353252],"category_scores_gemma":[0.009645633,0.0005036384,0.0005604102,0.0010307167,0.0025749907,0.0033116767,0.0020060493,0.0021399588,0.0007989294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080132997,0.00015034569,0.011884123,0.00045550955,0.000084603416,0.0010654444,0.0009012495,0.032601316,0.031439103,0.8702115,0.01516304,0.035242487],"study_design_scores_gemma":[0.00007227709,0.00020968553,0.009525713,0.00015300332,0.00007249704,0.001884811,0.00044794168,0.20650473,0.028064243,0.73586625,0.01710885,0.00009008044],"about_ca_topic_score_codex":0.00049600855,"about_ca_topic_score_gemma":0.00041412146,"teacher_disagreement_score":0.006353252,"about_ca_system_score_codex":0.0011468414,"about_ca_system_score_gemma":0.0003950958,"threshold_uncertainty_score":0.021253765},"labels":[],"label_agreement":null},{"id":"W3033773296","doi":"10.1007/s12045-020-0985-z","title":"Group Laws Satisfying 1+1=11 and 2+2=22","year":2020,"lang":"en","type":"article","venue":"Resonance","topic":"Graph theory and applications","field":"Mathematics","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 Manitoba","funders":"","keywords":"Viewpoints; Group (periodic table); Prime (order theory); Field (mathematics); Law; Work (physics); Argumentation theory; Politics; Composition (language); Sociology; Mathematics; Mathematics education; Computer science; Political science; Epistemology; Pure mathematics; Physics; Combinatorics; Linguistics; Philosophy","score_opus":0.054366495874723954,"score_gpt":0.2907875702914894,"score_spread":0.23642107441676544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033773296","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34906685,0.00039039046,0.12409454,0.004397123,0.0014987292,0.00024405142,0.00031447323,0.0009428301,0.51905096],"genre_scores_gemma":[0.9215169,0.00032958447,0.02337512,0.0016419926,0.0005854406,0.00019570318,0.00021166028,0.0003301205,0.05181355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931467,0.00019266717,0.000026182188,0.00013149678,0.00016659824,0.00016846547],"domain_scores_gemma":[0.99912006,0.000312871,0.000126468,0.00017569013,0.00012886942,0.00013604561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072658795,0.00060355203,0.0006066513,0.0011764802,0.0021814352,0.0019288108,0.0007373049,0.0017990856,0.015127828],"category_scores_gemma":[0.0020971347,0.00034023,0.00048080133,0.0005662755,0.002795905,0.0026212765,0.0009405669,0.0018848196,0.0016598958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024102515,0.000028027589,0.00008454701,0.000026421672,0.0000041613666,0.00008227387,0.00023999655,0.00019736383,0.003014128,0.98972833,0.0026743426,0.0038962031],"study_design_scores_gemma":[0.00004102595,0.000029931216,0.00018363126,0.000012324687,0.000006029777,0.00016001274,0.00021054834,0.0017982174,0.0018918059,0.9881002,0.0075516263,0.0000147013125],"about_ca_topic_score_codex":0.0006198186,"about_ca_topic_score_gemma":0.0006946169,"teacher_disagreement_score":0.015127828,"about_ca_system_score_codex":0.0006036093,"about_ca_system_score_gemma":0.00065348943,"threshold_uncertainty_score":0.05060768},"labels":[],"label_agreement":null},{"id":"W3037656498","doi":"10.1007/s11856-023-2497-5","title":"A note on the trace method for random regular graphs","year":2023,"lang":"en","type":"article","venue":"Israel Journal of Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"University of British Columbia","funders":"","keywords":"Mathematics; Backtracking; Combinatorics; Spectrum (functional analysis); Eigenvalues and eigenvectors; Graph; TRACE (psycholinguistics); Random graph; Random regular graph; Discrete mathematics; Upper and lower bounds; Regular graph; Voltage graph; Line graph; Algorithm; Pathwidth; Mathematical analysis","score_opus":0.07021418051087097,"score_gpt":0.37401567687536424,"score_spread":0.3038014963644933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037656498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044074,0.0015295587,0.98072535,0.0022939553,0.0010418773,0.000078757796,0.00012099326,0.0004607769,0.009341306],"genre_scores_gemma":[0.24726437,0.008672946,0.6668457,0.0033670685,0.007638025,0.00078698766,0.00070629065,0.0030564761,0.061662134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99375594,0.003707612,0.00023001127,0.0007921208,0.0012200839,0.0002941956],"domain_scores_gemma":[0.964873,0.026644526,0.00080215244,0.0044770925,0.0019836375,0.001219542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009764908,0.0025173787,0.0034955568,0.0052340403,0.0017857271,0.0037126832,0.0065983804,0.004347347,0.011033486],"category_scores_gemma":[0.051323984,0.0016256851,0.004889552,0.0036740743,0.007148486,0.01163652,0.007863973,0.010274641,0.0021741043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007543988,0.000072272844,0.00036730646,0.00015541888,0.00009429086,0.0001864902,0.00014963489,0.012542039,0.0009278711,0.9591999,0.0049760896,0.021253204],"study_design_scores_gemma":[0.000025822017,0.000040202867,0.00010390129,0.00003950175,0.000031347285,0.00008990561,0.000032017146,0.13770285,0.00041037676,0.85612094,0.0053622797,0.000040816118],"about_ca_topic_score_codex":0.0036728438,"about_ca_topic_score_gemma":0.0026361898,"teacher_disagreement_score":0.011033486,"about_ca_system_score_codex":0.0017622957,"about_ca_system_score_gemma":0.0018250586,"threshold_uncertainty_score":0.051642418},"labels":[],"label_agreement":null},{"id":"W3047012801","doi":"10.1016/j.jmaa.2021.125449","title":"Some properties of a class of sparse polynomials","year":2021,"lang":"en","type":"preprint","venue":"Journal of Mathematical Analysis and Applications","topic":"Graph theory and applications","field":"Mathematics","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":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Narodowe Centrum Nauki","keywords":"Mathematics; Monotonic function; Class (philosophy); Orthogonal polynomials; Discrete orthogonal polynomials; Sequence (biology); Difference polynomials; Binomial coefficient; Hahn polynomials; Wilson polynomials; Pure mathematics; Classical orthogonal polynomials; Combinatorics; Discrete mathematics; Gegenbauer polynomials; Mathematical analysis; Computer science","score_opus":0.05774569509471101,"score_gpt":0.3071095863241829,"score_spread":0.2493638912294719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047012801","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.816679,0.0010278054,0.14211208,0.0016165408,0.00011617889,0.000055886114,0.00032381498,0.00019871289,0.03787006],"genre_scores_gemma":[0.97953206,0.0005842694,0.012978181,0.00016801253,0.0002887352,0.00004744089,0.00025750708,0.00006806146,0.0060756174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994205,0.00012586486,0.000022846423,0.0000897989,0.00022165434,0.00011936414],"domain_scores_gemma":[0.99622226,0.0019121901,0.00068123516,0.00020402763,0.00050668133,0.00047362625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009135403,0.0004456921,0.00046117525,0.0018065855,0.0011447509,0.0017011029,0.0005970189,0.0007587984,0.004883732],"category_scores_gemma":[0.009871286,0.00030607643,0.00037034298,0.0011551594,0.0017557548,0.0030126355,0.0012840104,0.0015624363,0.00047207077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006910282,0.00004884731,0.0018314827,0.00008036121,0.000008997982,0.00033058494,0.00030963,0.0050591505,0.0072136596,0.9716016,0.0012787328,0.012167875],"study_design_scores_gemma":[0.000035627316,0.00012615776,0.0016924032,0.00005576083,0.000013261104,0.0012698902,0.0002783692,0.08474816,0.0037788542,0.90117836,0.006791528,0.000031719213],"about_ca_topic_score_codex":0.00048000913,"about_ca_topic_score_gemma":0.00039087687,"teacher_disagreement_score":0.004883732,"about_ca_system_score_codex":0.00068668695,"about_ca_system_score_gemma":0.00040978813,"threshold_uncertainty_score":0.016337752},"labels":[],"label_agreement":null},{"id":"W3088594123","doi":"10.1002/jgt.22621","title":"On the mean subtree order of graphs under edge addition","year":2020,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Graph theory and applications","field":"Mathematics","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; University of Guelph","funders":"","keywords":"Combinatorics; Conjecture; Mathematics; Counterexample; Order (exchange); Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science","score_opus":0.05114219761848536,"score_gpt":0.28047953772127177,"score_spread":0.2293373401027864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088594123","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9350215,0.00033000123,0.053050667,0.0005050235,0.00005142615,0.00002023634,0.00030158286,0.00027653904,0.01044315],"genre_scores_gemma":[0.98923254,0.00017045504,0.009257596,0.00011549227,0.00008387471,0.000026772046,0.00018623561,0.000065401226,0.0008616557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921334,0.00019237537,0.00003288732,0.00017662904,0.00021527542,0.00016945896],"domain_scores_gemma":[0.9880987,0.0071105957,0.001335314,0.0014633576,0.0008905193,0.0011015737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011029936,0.0002565232,0.0010440999,0.0017703361,0.0010542343,0.001969397,0.00094594795,0.0008192569,0.00283706],"category_scores_gemma":[0.010108783,0.0003386193,0.0005512665,0.0013805361,0.0020190245,0.0029329124,0.0010090874,0.0011963106,0.0002620419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011355149,0.0002205582,0.015590618,0.00035909135,0.000107090695,0.00079982076,0.0010156266,0.08860174,0.05431972,0.7838855,0.005054126,0.048910614],"study_design_scores_gemma":[0.00006520644,0.00017380575,0.009632211,0.000040326217,0.000073062096,0.0007396405,0.00029071877,0.14100522,0.009516108,0.835108,0.0033040133,0.00005166032],"about_ca_topic_score_codex":0.00076019776,"about_ca_topic_score_gemma":0.0010669194,"teacher_disagreement_score":0.00283706,"about_ca_system_score_codex":0.0009874937,"about_ca_system_score_gemma":0.0005577437,"threshold_uncertainty_score":0.009490907},"labels":[],"label_agreement":null},{"id":"W3098853299","doi":"10.1002/net.22004","title":"Roots of two‐terminal reliability polynomials","year":2020,"lang":"en","type":"article","venue":"Networks","topic":"Graph theory and applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Terminal (telecommunication); Mathematics; Reliability (semiconductor); Combinatorics; Spanning tree; Graph; Path (computing); Discrete mathematics; Computer science; Computer network","score_opus":0.04322838962037749,"score_gpt":0.31648656952860466,"score_spread":0.27325817990822715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098853299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23380332,0.0010655685,0.7355805,0.0014260053,0.00020676186,0.000069063164,0.00044433257,0.0003487317,0.027055731],"genre_scores_gemma":[0.98232806,0.0005524496,0.011290276,0.000109860535,0.00012596534,0.00004415108,0.00008603838,0.00006671467,0.0053964877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991104,0.00020254735,0.000026550191,0.00017749191,0.00028602566,0.00019699507],"domain_scores_gemma":[0.9925874,0.0043063113,0.0011097055,0.00061129517,0.0010663739,0.0003190718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013444825,0.0005415322,0.0006768732,0.0011630268,0.0004920271,0.0010362694,0.0007700385,0.0006995308,0.004006033],"category_scores_gemma":[0.014033899,0.00030103794,0.00050394,0.0010374285,0.0018885417,0.0019597001,0.0011899037,0.0021085737,0.0006685351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010599971,0.000044565255,0.0026561702,0.00017961238,0.000031152686,0.00045459726,0.00051431573,0.13711841,0.005662102,0.8292717,0.0037330817,0.020228295],"study_design_scores_gemma":[0.000030051513,0.00006801988,0.0020027964,0.000047708312,0.000016465081,0.00046728406,0.00020471954,0.41331306,0.0018003959,0.5782206,0.0037756383,0.000053194253],"about_ca_topic_score_codex":0.0018501196,"about_ca_topic_score_gemma":0.0011393776,"teacher_disagreement_score":0.004006033,"about_ca_system_score_codex":0.0010224008,"about_ca_system_score_gemma":0.00061586767,"threshold_uncertainty_score":0.013401508},"labels":[],"label_agreement":null},{"id":"W3099858109","doi":"","title":"Median eigenvalues of bipartite subcubic graphs","year":2016,"lang":"en","type":"article","venue":"","topic":"Graph theory and applications","field":"Mathematics","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":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Eigenvalues and eigenvectors; Bipartite graph; Graph; Interval (graph theory); Complete bipartite graph; Degree (music); Discrete mathematics; Quantum mechanics; Physics","score_opus":0.05382444444016894,"score_gpt":0.31771130384168284,"score_spread":0.2638868594015139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099858109","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8896341,0.00043940873,0.075294524,0.00033474618,0.00003569216,0.00002478925,0.000325368,0.00030457746,0.033606764],"genre_scores_gemma":[0.99206865,0.00014672073,0.0047018947,0.000057408084,0.00003823583,0.000041313742,0.00017420178,0.000046475237,0.0027251667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996766,0.00006118538,0.0000096793265,0.00005940015,0.00010734857,0.000085763786],"domain_scores_gemma":[0.99913186,0.0003798366,0.00014802825,0.00008958823,0.00010919427,0.00014152435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028055956,0.00032152788,0.0003733953,0.0019619323,0.00060481543,0.00086814276,0.0004152653,0.00036159696,0.0048702406],"category_scores_gemma":[0.0019409751,0.00020238553,0.0001770837,0.0008923107,0.0009692753,0.0008841336,0.00088963954,0.00045373206,0.0005306688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037734988,0.00008125413,0.003417156,0.00015732653,0.000030646614,0.000352604,0.0006360239,0.026908945,0.029307645,0.8941708,0.0050187423,0.03954151],"study_design_scores_gemma":[0.000026443073,0.000028864326,0.0034255993,0.000020823805,0.000007815231,0.0001862316,0.00021047352,0.08976296,0.0042228256,0.8993257,0.002762964,0.000019326986],"about_ca_topic_score_codex":0.0004623102,"about_ca_topic_score_gemma":0.0004103876,"teacher_disagreement_score":0.0048702406,"about_ca_system_score_codex":0.00048908405,"about_ca_system_score_gemma":0.00018012844,"threshold_uncertainty_score":0.016292572},"labels":[],"label_agreement":null},{"id":"W3101406180","doi":"","title":"Mahler measure under variations of the base group","year":2009,"lang":"en","type":"article","venue":"Civil War Book Review","topic":"Graph theory and applications","field":"Mathematics","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 British Columbia","funders":"","keywords":"Mathematics; Dihedral group; Measure (data warehouse); Base (topology); Abelian group; Group (periodic table); Non-abelian group; Generalization; Pure mathematics; Combinatorics; Elementary abelian group; Mathematical analysis; Data mining; Computer science","score_opus":0.044205751552595374,"score_gpt":0.2969970430036985,"score_spread":0.25279129145110313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101406180","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83504134,0.0034746893,0.07150789,0.0019343774,0.0004009635,0.000041055016,0.00017929923,0.00034238628,0.08707796],"genre_scores_gemma":[0.98140645,0.0009204361,0.0060871416,0.00018844823,0.0005873048,0.00003108164,0.00008045497,0.00008325465,0.010615389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994449,0.00012219553,0.000020259457,0.00012959124,0.00019413784,0.00008901529],"domain_scores_gemma":[0.9986386,0.00041944243,0.00028028668,0.00014033735,0.00018599656,0.00033550625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068565994,0.00044283306,0.00066385424,0.0019301194,0.0011388889,0.002242914,0.0009851833,0.0009848286,0.0034400683],"category_scores_gemma":[0.0033181643,0.0002478926,0.0006020594,0.0009769459,0.0026692003,0.003941867,0.0012965661,0.0014986349,0.0005412261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018467092,0.000009822158,0.00029893365,0.000025011914,0.00001031292,0.0001340693,0.0002515505,0.0017892922,0.0019708907,0.9921279,0.00049772765,0.0028660556],"study_design_scores_gemma":[0.0000104877945,0.00005842809,0.0011174603,0.000015764148,0.000012770458,0.00044078758,0.00012687407,0.014479488,0.0015488034,0.97760427,0.004551272,0.00003368067],"about_ca_topic_score_codex":0.00072502746,"about_ca_topic_score_gemma":0.00045934046,"teacher_disagreement_score":0.0034400683,"about_ca_system_score_codex":0.0012943323,"about_ca_system_score_gemma":0.00034005553,"threshold_uncertainty_score":0.011508226},"labels":[],"label_agreement":null},{"id":"W3101855936","doi":"","title":"Structure and enumeration of two-connected graphs with prescribed three-connected components","year":2009,"lang":"en","type":"article","venue":"","topic":"Graph theory and applications","field":"Mathematics","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":"Acadia University","funders":"","keywords":"Mathematics; Combinatorics; Modular decomposition; Chordal graph; Connected component; Planar graph; Indifference graph; Discrete mathematics; Simply connected space; Pathwidth; Enumeration; 1-planar graph; Clique-sum; Graph; Line graph","score_opus":0.022792587485139404,"score_gpt":0.26689286773838206,"score_spread":0.24410028025324265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101855936","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80157435,0.00034892507,0.1479831,0.000250688,0.000037414135,0.00007969254,0.0006083017,0.00025056614,0.048866916],"genre_scores_gemma":[0.940892,0.00019557202,0.051358264,0.00006486759,0.000016778162,0.00007830319,0.00073702954,0.000054904765,0.0066022556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998217,0.00003388456,0.000013060025,0.00003479135,0.00006160185,0.00003484597],"domain_scores_gemma":[0.9994758,0.00016814572,0.000086672786,0.000064133805,0.00013507348,0.0000701903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015879754,0.00021510443,0.00023112599,0.0017774547,0.00063562545,0.000989027,0.0005684575,0.00057471194,0.003107324],"category_scores_gemma":[0.0010901723,0.00019374299,0.00028736348,0.0014675354,0.0008698124,0.001269275,0.00065597193,0.00048822438,0.00046130188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008014015,0.00004742431,0.0034979002,0.00015646567,0.000011812028,0.00030846655,0.0007491436,0.011060933,0.018965025,0.9276831,0.0013999067,0.036039688],"study_design_scores_gemma":[0.000025210713,0.000050555645,0.0038692094,0.000068827845,0.000016511578,0.0006746001,0.00042214568,0.100148104,0.011887906,0.86990464,0.012898928,0.000033355922],"about_ca_topic_score_codex":0.0011800786,"about_ca_topic_score_gemma":0.0012545593,"teacher_disagreement_score":0.003107324,"about_ca_system_score_codex":0.00064046343,"about_ca_system_score_gemma":0.00031976524,"threshold_uncertainty_score":0.01039499},"labels":[],"label_agreement":null},{"id":"W3106018864","doi":"10.1002/rsa.21167","title":"Matchings on trees and the adjacency matrix: A determinantal viewpoint","year":2023,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Graph theory and applications","field":"Mathematics","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":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Mathematics; Logarithm; Adjacency matrix; Combinatorics; Vertex (graph theory); Matching (statistics); Entropy (arrow of time); Adjacency list; Discrete mathematics; Statistics; Mathematical analysis; Graph","score_opus":0.018177185056195175,"score_gpt":0.3068621500989922,"score_spread":0.288684965042797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106018864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41462815,0.001377517,0.5547047,0.0020921172,0.00010014197,0.0000463052,0.0001403129,0.00018513796,0.026725603],"genre_scores_gemma":[0.97991806,0.00043516303,0.016519131,0.00014042326,0.00014897883,0.00003220965,0.00004511404,0.00003400191,0.0027269647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991985,0.0003450956,0.000029717694,0.00010697141,0.00021180157,0.00010796772],"domain_scores_gemma":[0.9952207,0.003103164,0.00054349814,0.00040773072,0.0003576248,0.000367257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001635518,0.00027609,0.00066346745,0.0020765185,0.0007636422,0.0019419842,0.0010418141,0.00081178354,0.0022991782],"category_scores_gemma":[0.0072754547,0.0003139069,0.00047668582,0.0009975809,0.0027775853,0.003167626,0.001407713,0.0010467062,0.0002496054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001259349,0.00001632285,0.0003512317,0.00001795077,0.000008085909,0.00005011153,0.00008806589,0.02020712,0.0007196738,0.9755215,0.0003574381,0.0026498495],"study_design_scores_gemma":[0.0000064711367,0.000016298422,0.00038564534,0.0000099922,0.000005699294,0.000060864117,0.000050445084,0.27412453,0.0002943167,0.72421044,0.0008233144,0.000011963912],"about_ca_topic_score_codex":0.0011755369,"about_ca_topic_score_gemma":0.0012151941,"teacher_disagreement_score":0.0022991782,"about_ca_system_score_codex":0.0014320081,"about_ca_system_score_gemma":0.00049672625,"threshold_uncertainty_score":0.010389924},"labels":[],"label_agreement":null},{"id":"W3107112554","doi":"10.48550/arxiv.2011.10641","title":"The node cop-win reliability of unicyclic and bicyclic graphs","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph theory and applications","field":"Mathematics","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 Guelph","funders":"","keywords":"Combinatorics; Graph; Random graph; Discrete mathematics; Mathematics; Computer science","score_opus":0.1009581048507064,"score_gpt":0.2267730583188323,"score_spread":0.12581495346812588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107112554","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52302593,0.0014167312,0.46238524,0.0011754672,0.00006064776,0.00016881355,0.0009988522,0.00045876577,0.010309588],"genre_scores_gemma":[0.9847015,0.00059179217,0.01204342,0.00009859878,0.00006410495,0.00010010975,0.00031120828,0.00010450191,0.0019848756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977665,0.00086612033,0.00009979719,0.0004867506,0.00048133606,0.0002995405],"domain_scores_gemma":[0.97500086,0.015050786,0.0040729283,0.0028526771,0.0018889105,0.0011338723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003003859,0.001047206,0.0012844678,0.0019341314,0.0007893562,0.0014667036,0.0022075737,0.0010478228,0.0022659148],"category_scores_gemma":[0.023725472,0.00081700546,0.000677374,0.0014519023,0.0024986083,0.003402616,0.0017459057,0.0014909379,0.00038930093],"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.0005429709,0.00009514302,0.010504163,0.00051128905,0.00016916396,0.0005448309,0.0015339309,0.57179296,0.006702344,0.3715273,0.007262466,0.028813437],"study_design_scores_gemma":[0.000035854133,0.00015661622,0.0035559582,0.00007687809,0.0000771778,0.0006114255,0.00037413632,0.7570412,0.0020997215,0.23334007,0.0025791044,0.00005179941],"about_ca_topic_score_codex":0.0027668641,"about_ca_topic_score_gemma":0.0021513903,"teacher_disagreement_score":0.003003859,"about_ca_system_score_codex":0.0015574137,"about_ca_system_score_gemma":0.0006407773,"threshold_uncertainty_score":0.015886128},"labels":[],"label_agreement":null},{"id":"W3110965025","doi":"10.1515/spma-2020-0106","title":"Maximum nullity and zero forcing of circulant graphs","year":2020,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Graph theory and applications","field":"Mathematics","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":"McMaster University; Redeemer University","funders":"","keywords":"Circulant matrix; Mathematics; Bipartite graph; Combinatorics; Eigenvalues and eigenvectors; Upper and lower bounds; Zero (linguistics); Circulant graph; Torus; Graph; Discrete mathematics; Inverse; Line graph; Voltage graph; Mathematical analysis; Geometry","score_opus":0.3732123960360028,"score_gpt":0.5514480804222348,"score_spread":0.178235684386232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110965025","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7886754,0.0002299221,0.19459069,0.00037127495,0.00005293284,0.000025812886,0.00021187357,0.00015871927,0.015683422],"genre_scores_gemma":[0.9798933,0.00016604667,0.017858962,0.000043295957,0.00005067737,0.000032339125,0.00013610283,0.000050830175,0.0017683654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930453,0.00017964454,0.000032632317,0.00012808238,0.00019185938,0.00016314664],"domain_scores_gemma":[0.9917836,0.0049702283,0.0010145551,0.0007695801,0.00069902936,0.00076309906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081663916,0.0003605361,0.00040838227,0.0015738935,0.0010067002,0.0011597626,0.0006323722,0.00045965062,0.002080431],"category_scores_gemma":[0.0071441894,0.0002428058,0.00036458016,0.00056413485,0.002657205,0.0017865637,0.0009419534,0.00084557856,0.00027571066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001522704,0.00005187869,0.0034312147,0.000096831616,0.00001540476,0.00018618879,0.00034480143,0.027381111,0.0274964,0.92628014,0.0011748683,0.0133888675],"study_design_scores_gemma":[0.000021076154,0.00012658423,0.0028946276,0.000047817117,0.000013125327,0.00033750737,0.00024310878,0.11141075,0.015870914,0.8664189,0.0025589194,0.000056532386],"about_ca_topic_score_codex":0.0004833611,"about_ca_topic_score_gemma":0.0007877177,"teacher_disagreement_score":0.002080431,"about_ca_system_score_codex":0.0006252689,"about_ca_system_score_gemma":0.00057652494,"threshold_uncertainty_score":0.006959796},"labels":[],"label_agreement":null},{"id":"W3115569881","doi":"10.1007/978-3-030-65347-7_16","title":"Distances on a Graph","year":2020,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Graph theory and applications","field":"Mathematics","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":"University of Toronto","funders":"","keywords":"Computer science; Graph; Combinatorics; Artificial intelligence; Theoretical computer science; Mathematics","score_opus":0.2620302346655542,"score_gpt":0.42348393269060425,"score_spread":0.16145369802505005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115569881","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016339803,0.010926824,0.20227869,0.005445645,0.0023335188,0.00007757328,0.001147702,0.0004913201,0.7609589],"genre_scores_gemma":[0.29383647,0.02280998,0.20961797,0.0018897451,0.003460089,0.00026934108,0.0025868532,0.00092834665,0.46460125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967265,0.00006628644,0.000015129227,0.00009392352,0.00013197778,0.00002013854],"domain_scores_gemma":[0.99957603,0.00020412436,0.000023739607,0.000087105014,0.000075350195,0.00003369718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020213542,0.00066975376,0.0005098058,0.0019799364,0.0009118857,0.0018730484,0.0007396142,0.00061842275,0.019795358],"category_scores_gemma":[0.001334324,0.00029275144,0.0003280287,0.0032708163,0.0017354261,0.0038173907,0.0011942959,0.0018684071,0.004837833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048973898,0.0000054907514,0.000039896022,0.00006856861,0.000004065046,0.0000151054655,0.000111549794,0.0007521311,0.0003828366,0.93871856,0.017552562,0.042344306],"study_design_scores_gemma":[0.0000019520528,0.0000073445713,0.000121561556,0.000025309222,0.000004694531,0.00009042515,0.00006376795,0.001353033,0.00026774948,0.8522605,0.14579822,0.0000055151227],"about_ca_topic_score_codex":0.00083596486,"about_ca_topic_score_gemma":0.0009827563,"teacher_disagreement_score":0.019795358,"about_ca_system_score_codex":0.0009965517,"about_ca_system_score_gemma":0.000310625,"threshold_uncertainty_score":0.06622207},"labels":[],"label_agreement":null},{"id":"W3120354260","doi":"10.1088/1742-6596/1722/1/012055","title":"Characteristic polynomial and eigenvalues of antiadjacency matrix of directed unicyclic flower vase graph","year":2021,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Graph theory and applications","field":"Mathematics","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":"Universitas Indonesia","keywords":"Adjacency matrix; Eigenvalues and eigenvectors; Mathematics; Algorithm; Characteristic polynomial; Combinatorics; Graph; Polynomial; Mathematical analysis; Physics","score_opus":0.03454239643492763,"score_gpt":0.3041587446976853,"score_spread":0.26961634826275765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120354260","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7805608,0.00035074298,0.1887965,0.00061052066,0.0001099403,0.000055688848,0.000581078,0.00024310067,0.028691517],"genre_scores_gemma":[0.98439956,0.0001621136,0.009175777,0.000044068915,0.000031444033,0.000028651317,0.00028874504,0.00003168056,0.0058379886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973816,0.000043692064,0.000006661662,0.000062862346,0.00008434067,0.00006417658],"domain_scores_gemma":[0.99900514,0.00034303791,0.00017193126,0.000050947892,0.00029624585,0.00013260868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014551694,0.000280597,0.0002330172,0.0012913622,0.00042401731,0.0005729161,0.00036289042,0.0002704998,0.006358577],"category_scores_gemma":[0.0017140271,0.00011899158,0.00024755058,0.00078119896,0.0005142672,0.00081284903,0.00028191792,0.00046737102,0.0004530762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047020198,0.00018136633,0.013590256,0.00040150178,0.000076860546,0.0015710384,0.001035029,0.06248257,0.07122407,0.7361611,0.013562217,0.099243745],"study_design_scores_gemma":[0.00008528142,0.00028084646,0.020442693,0.000065462336,0.000037754795,0.0019565478,0.0010440834,0.3390301,0.017382022,0.60453236,0.014982029,0.00016093961],"about_ca_topic_score_codex":0.0018042059,"about_ca_topic_score_gemma":0.0015271076,"teacher_disagreement_score":0.006358577,"about_ca_system_score_codex":0.00064367,"about_ca_system_score_gemma":0.00031350763,"threshold_uncertainty_score":0.021271527},"labels":[],"label_agreement":null},{"id":"W3121123538","doi":"10.1088/1742-6596/1722/1/012056","title":"Properties of characteristic polynomial and eigenvalues of antiadjacency matrix of directed unicyclic helm graph","year":2021,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Universitas Indonesia","keywords":"Algorithm; Computer science; Artificial intelligence","score_opus":0.04985123377797959,"score_gpt":0.2895274795654394,"score_spread":0.2396762457874598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121123538","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87871814,0.00027922404,0.0961912,0.0007428338,0.00009431152,0.000049753595,0.0005930755,0.0002109467,0.023120468],"genre_scores_gemma":[0.9906668,0.00013124612,0.0045347875,0.000041892054,0.00003543431,0.0000399023,0.00025380275,0.000029910818,0.004266198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996848,0.000049297956,0.000009139439,0.00006484371,0.00011017273,0.000081802784],"domain_scores_gemma":[0.99827325,0.00066396693,0.00037788966,0.00008168082,0.00035711605,0.0002461624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023179401,0.00034858516,0.00030162113,0.0017004708,0.0005499743,0.00067575235,0.00042479977,0.0003653153,0.00763121],"category_scores_gemma":[0.0027289805,0.00015989668,0.0002225553,0.00089811767,0.00071057316,0.00096583366,0.0004009488,0.0005933721,0.00056045054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007514389,0.00026611416,0.0135897165,0.00031168232,0.00007005731,0.0016529339,0.0010088637,0.05200103,0.04192088,0.81048256,0.013511564,0.06443312],"study_design_scores_gemma":[0.000112562615,0.0002712776,0.011393407,0.00006210047,0.00002568325,0.0013759517,0.0007736194,0.30735707,0.010276132,0.6604985,0.0077081244,0.00014552273],"about_ca_topic_score_codex":0.0017919897,"about_ca_topic_score_gemma":0.0014646058,"teacher_disagreement_score":0.00763121,"about_ca_system_score_codex":0.00067618396,"about_ca_system_score_gemma":0.00042775436,"threshold_uncertainty_score":0.025528967},"labels":[],"label_agreement":null},{"id":"W3127350324","doi":"10.48550/arxiv.1911.02974","title":"Cutoff for Random Walks on Upper Triangular Matrices","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph theory and applications","field":"Mathematics","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":"University of British Columbia","funders":"","keywords":"Combinatorics; Conjecture; Mathematics; Cutoff; Heisenberg group; Dihedral group; Abelian group; Cayley graph; Group (periodic table); Random walk; Graph; Physics; Statistics; Mathematical analysis; Quantum mechanics","score_opus":0.10754882685470948,"score_gpt":0.2351928607429992,"score_spread":0.1276440338882897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127350324","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6410492,0.0014156267,0.29602775,0.0021767614,0.00028127455,0.00018289083,0.00078880053,0.0020744188,0.056003287],"genre_scores_gemma":[0.97402114,0.00035384335,0.01751946,0.00034701463,0.00010055801,0.00021804689,0.00053844,0.0002174903,0.0066840616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990933,0.0002688611,0.0000345301,0.0001730572,0.00015637756,0.00027391355],"domain_scores_gemma":[0.98943835,0.0056445296,0.0010801826,0.0013628637,0.0007850899,0.0016889833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015351293,0.0005690568,0.0009840417,0.0014834392,0.0014030127,0.001948024,0.0012521549,0.0011661524,0.0074002114],"category_scores_gemma":[0.015468185,0.0003652704,0.00079448166,0.0008109941,0.0021415611,0.0035628239,0.0018677214,0.0030055759,0.0009846587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000239298,0.00009425053,0.0014515811,0.00009759699,0.000019810566,0.00033604665,0.0003878038,0.016922742,0.0057820138,0.9642198,0.0043286495,0.006120419],"study_design_scores_gemma":[0.000058457845,0.0000744859,0.000854616,0.00004781002,0.000013815663,0.00016891706,0.000104132516,0.2996378,0.0021145234,0.6943142,0.0025723272,0.000038910286],"about_ca_topic_score_codex":0.0021984691,"about_ca_topic_score_gemma":0.0022171238,"teacher_disagreement_score":0.0074002114,"about_ca_system_score_codex":0.0021873126,"about_ca_system_score_gemma":0.001039767,"threshold_uncertainty_score":0.024756193},"labels":[],"label_agreement":null},{"id":"W3127781635","doi":"10.1016/j.dam.2021.01.014","title":"A relation between proximity and the third largest distance eigenvalue of a graph","year":2021,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"Group for Research in Decision Analysis; HEC Montréal; University of Regina","funders":"","keywords":"Mathematics; Distance matrix; Combinatorics; Resistance distance; Distance-regular graph; Graph; Connectivity; Butterfly graph; Vertex (graph theory); Graph power; Eigenvalues and eigenvectors; Regular graph; Discrete mathematics; Line graph; Voltage graph","score_opus":0.026710223647579544,"score_gpt":0.2760365620352981,"score_spread":0.24932633838771853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127781635","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.798931,0.0010584624,0.1799232,0.002010432,0.00016292857,0.00004290118,0.00031948154,0.00030425002,0.017247275],"genre_scores_gemma":[0.9833235,0.00025058558,0.014154564,0.00010394585,0.00019121284,0.00003504088,0.00009894302,0.000036497997,0.0018056415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989851,0.00032052476,0.000041533585,0.00034933168,0.00020789601,0.0000955036],"domain_scores_gemma":[0.9609679,0.029910842,0.0043643857,0.0012717121,0.0014389663,0.002046196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009665949,0.0004232004,0.0008955346,0.0025564583,0.0013479077,0.00196967,0.0010696083,0.0012420228,0.004883797],"category_scores_gemma":[0.019770706,0.00044852291,0.00043733648,0.0019779275,0.0029385944,0.0038204852,0.0016762648,0.0017523309,0.00055052456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006246341,0.0003646563,0.022662524,0.00042178648,0.00016366849,0.0010801184,0.0024051252,0.030190596,0.022191122,0.8782462,0.0048760907,0.03677349],"study_design_scores_gemma":[0.000056347213,0.00023307366,0.013407905,0.000048139642,0.00007737796,0.0014527178,0.00084119523,0.102643736,0.0027780114,0.87619716,0.0021568118,0.00010755382],"about_ca_topic_score_codex":0.00064890645,"about_ca_topic_score_gemma":0.0005920037,"teacher_disagreement_score":0.004883797,"about_ca_system_score_codex":0.0006586883,"about_ca_system_score_gemma":0.00037860486,"threshold_uncertainty_score":0.016337931},"labels":[],"label_agreement":null},{"id":"W3128855366","doi":"10.5070/c62359150","title":"Inducibility and universality for trees","year":2022,"lang":"en","type":"article","venue":"Combinatorial Theory","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"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":"Australian Research Council; University of Warwick; Masarykova Univerzita; Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; European Commission; Univerza v Ljubljani","keywords":"Universality (dynamical systems); Mathematics; Combinatorics; Limit (mathematics); Tree (set theory); Path (computing); Sequence (biology); Discrete mathematics; Graph; Physics; Computer science; Mathematical analysis; Quantum mechanics; Biology","score_opus":0.05204656677476473,"score_gpt":0.31602164374714986,"score_spread":0.26397507697238515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128855366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46092862,0.0036372102,0.48123077,0.0041221124,0.00013356419,0.0000679858,0.00040485116,0.0008382077,0.048636623],"genre_scores_gemma":[0.95324105,0.0012114153,0.04005851,0.00049743225,0.00023393802,0.00007993602,0.00026665805,0.00009866019,0.0043123383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887294,0.00024215512,0.0000451326,0.0003326196,0.00034726705,0.00015992446],"domain_scores_gemma":[0.99028707,0.0068328036,0.00059316325,0.0007804698,0.00072345923,0.00078305014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015955748,0.00039816808,0.00069739245,0.0015204534,0.0013096805,0.0016405104,0.0012908754,0.0007113717,0.0036693735],"category_scores_gemma":[0.009950488,0.0005207736,0.0008453509,0.001117568,0.0042616674,0.0065725353,0.0026861094,0.0026897206,0.00035064714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003561849,0.000028857005,0.0018573374,0.00008602156,0.000012558645,0.000097300304,0.00068206625,0.0020223532,0.0023999738,0.9822426,0.0008932819,0.009642046],"study_design_scores_gemma":[0.000010245385,0.000027264496,0.0010612989,0.000029662693,0.000012571814,0.00023236299,0.00016711726,0.013550305,0.0015628102,0.9791245,0.0042093424,0.000012433266],"about_ca_topic_score_codex":0.0007660358,"about_ca_topic_score_gemma":0.0006441545,"teacher_disagreement_score":0.0036693735,"about_ca_system_score_codex":0.0013953747,"about_ca_system_score_gemma":0.0004341862,"threshold_uncertainty_score":0.012275279},"labels":[],"label_agreement":null},{"id":"W3150655385","doi":"","title":"First variation of Selberg zeta functions and variational trace formulas","year":2003,"lang":"en","type":"article","venue":"Journal of the Ramanujan Mathematical Society","topic":"Graph theory and applications","field":"Mathematics","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":"Toronto Metropolitan University","funders":"","keywords":"Selberg trace formula; TRACE (psycholinguistics); Mathematics; Variation (astronomy); Riemann zeta function; Pure mathematics; Physics; Philosophy; Astrophysics","score_opus":0.02252716164833487,"score_gpt":0.26258329588994794,"score_spread":0.24005613424161307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3150655385","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61668265,0.004135578,0.2141542,0.006994619,0.0013483021,0.00006713794,0.00023496246,0.000460972,0.15592147],"genre_scores_gemma":[0.95749426,0.001046928,0.009617891,0.00036595028,0.0008646613,0.000056594767,0.00013032241,0.00018650938,0.030236995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993284,0.00021907875,0.000032424414,0.000092082446,0.00018528751,0.00014288732],"domain_scores_gemma":[0.99815553,0.0006945186,0.00019280559,0.00017855442,0.00033448,0.00044409212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019730332,0.0012094554,0.0012482431,0.0039640735,0.00244944,0.004506187,0.0023213332,0.001805689,0.006309502],"category_scores_gemma":[0.006803406,0.0005949555,0.0010816844,0.0018176299,0.005035772,0.0063455813,0.0026282219,0.0031547123,0.0008092985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001122461,0.000010671731,0.00009938343,0.000009465943,0.0000036048104,0.000028850574,0.000084186904,0.000517685,0.00020065573,0.9974075,0.00032046047,0.0013062692],"study_design_scores_gemma":[0.0000049982364,0.000004422731,0.00006341946,0.000005231158,0.0000021838382,0.000031833035,0.00003141363,0.0037722916,0.00008837089,0.995548,0.00044086028,0.000007043281],"about_ca_topic_score_codex":0.0021528495,"about_ca_topic_score_gemma":0.0017940294,"teacher_disagreement_score":0.006309502,"about_ca_system_score_codex":0.0024811765,"about_ca_system_score_gemma":0.0013787453,"threshold_uncertainty_score":0.021107435},"labels":[],"label_agreement":null},{"id":"W3153127972","doi":"10.21136/cmj.2021.0198-20","title":"Fiedler vectors with unbalanced sign patterns","year":2021,"lang":"en","type":"article","venue":"Czechoslovak Mathematical Journal","topic":"Graph theory and applications","field":"Mathematics","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; Akademie Věd České Republiky","keywords":"Mathematics; Sign (mathematics); Mathematical analysis; Calculus (dental); Medicine","score_opus":0.034770545773601697,"score_gpt":0.2977681469681259,"score_spread":0.2629976011945242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3153127972","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79190266,0.00019872384,0.17212734,0.0005844666,0.00017454392,0.000090869245,0.00042834142,0.00041577252,0.034077264],"genre_scores_gemma":[0.95959777,0.000098355835,0.030917577,0.00015461168,0.00005145985,0.00007733516,0.00055933744,0.000093582144,0.00844984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955875,0.00008386431,0.000040635852,0.00012001041,0.00009801384,0.00009867947],"domain_scores_gemma":[0.99850285,0.00033820298,0.00035292158,0.00020040212,0.00038052478,0.0002251384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044632496,0.00048680007,0.00031247965,0.001776488,0.0008104182,0.0011719386,0.00042426234,0.0006782784,0.007030858],"category_scores_gemma":[0.0028515998,0.00016053265,0.00027605103,0.0008258235,0.0011306857,0.0022025753,0.0007852617,0.00066406303,0.0010147333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070006977,0.00016653062,0.005665679,0.00023881542,0.000042960488,0.00066715427,0.00039261236,0.013179928,0.047299262,0.8549306,0.0051427907,0.071573645],"study_design_scores_gemma":[0.00008718448,0.00025801378,0.003895634,0.000064629,0.000035846086,0.0015006064,0.00042382977,0.09160271,0.038038258,0.8512233,0.012786699,0.00008328553],"about_ca_topic_score_codex":0.00042455178,"about_ca_topic_score_gemma":0.00041424128,"teacher_disagreement_score":0.007030858,"about_ca_system_score_codex":0.0005262144,"about_ca_system_score_gemma":0.00024695206,"threshold_uncertainty_score":0.02352053},"labels":[],"label_agreement":null},{"id":"W3153810790","doi":"10.28924/2291-8639-19-2021-252","title":"Fuzzy Zagreb Indices and Some Bounds for Fuzzy Zagreb Energy","year":2021,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Fuzzy logic; Combinatorics; Graph; Simple graph; Simple (philosophy); Product (mathematics); Discrete mathematics; Computer science; Artificial intelligence; Geometry","score_opus":0.01833320269701044,"score_gpt":0.31859019461187177,"score_spread":0.3002569919148613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3153810790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40853724,0.00613451,0.4551896,0.0010216016,0.00032964087,0.000043172044,0.0004268397,0.00016348244,0.12815386],"genre_scores_gemma":[0.9442773,0.0014740569,0.044668924,0.00015031207,0.00021705235,0.000052989453,0.00019353443,0.000053431497,0.00891251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994468,0.0000970599,0.000032877197,0.00014240267,0.00019186968,0.00008903745],"domain_scores_gemma":[0.9989454,0.00043785322,0.00016223082,0.00013173457,0.0002083665,0.00011439493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008370796,0.00046850755,0.0004305653,0.0027023593,0.00090295664,0.0017348239,0.0006570736,0.000620763,0.0049731345],"category_scores_gemma":[0.0026800781,0.00018789861,0.00045622152,0.001144015,0.0014364237,0.0027803695,0.0008911548,0.0017025288,0.00047805478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028478931,0.0000128211805,0.00055755454,0.00004173647,0.000011964726,0.00004843076,0.00011818844,0.003610508,0.0024242788,0.98102486,0.0004267644,0.011694365],"study_design_scores_gemma":[0.0000069275875,0.00003154097,0.0017502402,0.000042559826,0.000019057581,0.00018930556,0.00016034362,0.039690208,0.0024242275,0.94997394,0.005682093,0.000029446137],"about_ca_topic_score_codex":0.0008713229,"about_ca_topic_score_gemma":0.0008896226,"teacher_disagreement_score":0.0049731345,"about_ca_system_score_codex":0.0010695909,"about_ca_system_score_gemma":0.00030376358,"threshold_uncertainty_score":0.016636848},"labels":[],"label_agreement":null},{"id":"W3163031225","doi":"10.28924/2291-8639-19-2021-205","title":"Downhill Zagreb Topological Indices of Graphs","year":2021,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Topological index; Mathematics; Topological graph; Line graph; Topological graph theory; Graph; Combinatorics; Topology (electrical circuits); Voltage graph; Discrete mathematics","score_opus":0.022621313391438372,"score_gpt":0.3416212392833754,"score_spread":0.31899992589193704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163031225","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49202597,0.0037876558,0.34167692,0.0005826265,0.0006174322,0.000185196,0.0014322383,0.00057202915,0.15911984],"genre_scores_gemma":[0.8997476,0.0025689087,0.07859612,0.00020019268,0.00026429517,0.00015558582,0.0009966769,0.00017094442,0.01729969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965966,0.000049770515,0.000022316588,0.00007536505,0.00011826998,0.000074707124],"domain_scores_gemma":[0.9995734,0.00008338734,0.000076590404,0.00007581614,0.00013789862,0.00005289217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027681427,0.0004097004,0.0003094377,0.003458503,0.0007986371,0.0017697108,0.0004967431,0.00037801522,0.0038262464],"category_scores_gemma":[0.001473343,0.00020662748,0.00034567015,0.0010279043,0.0010752241,0.0023178018,0.0007140651,0.0009882409,0.0008915242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000369377,0.000013629063,0.0015356976,0.00006639504,0.000010321404,0.00009196123,0.00015114533,0.006095402,0.0045156484,0.95914453,0.0020616977,0.02627671],"study_design_scores_gemma":[0.000015361058,0.00006644257,0.0040193964,0.000063022635,0.00002042918,0.0005207511,0.00023509302,0.06607652,0.005453442,0.88855755,0.034920443,0.000051642637],"about_ca_topic_score_codex":0.0013477112,"about_ca_topic_score_gemma":0.001270424,"teacher_disagreement_score":0.0038262464,"about_ca_system_score_codex":0.00068270875,"about_ca_system_score_gemma":0.00035738418,"threshold_uncertainty_score":0.012800097},"labels":[],"label_agreement":null},{"id":"W3168361363","doi":"10.1007/s00205-021-01663-2","title":"Publisher Correction to: Isodiametry, Variance, and Regular Simplices from Particle Interactions","year":2021,"lang":"en","type":"article","venue":"Archive for Rational Mechanics and Analysis","topic":"Graph theory and applications","field":"Mathematics","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 Toronto","funders":"","keywords":"Variance (accounting); Complex system; Particle (ecology); Particle system; Statistical physics; Mathematics; Physics; Theoretical physics; Computer science; Artificial intelligence; Geology; Computer graphics (images)","score_opus":0.024245064029322368,"score_gpt":0.2983256845166252,"score_spread":0.27408062048730286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3168361363","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.00045573091,0.0021103916,0.0060512857,0.03006671,0.9343866,0.00003157781,0.0028440787,0.00094529067,0.02310835],"genre_scores_gemma":[0.03461236,0.008762275,0.016355844,0.022954188,0.21479958,0.00018748644,0.0052325153,0.004089336,0.6930064],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971968,0.00035346206,0.0003740616,0.00051873765,0.0013617711,0.00019520197],"domain_scores_gemma":[0.9818959,0.003744323,0.0007000031,0.0031422132,0.009866647,0.00065096375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020652264,0.001717164,0.0018702184,0.0055250134,0.0033405358,0.005928818,0.0032610325,0.004381723,0.14090516],"category_scores_gemma":[0.03980356,0.0011962525,0.0015981969,0.005112953,0.0031464922,0.004107916,0.0019670995,0.00929061,0.049179465],"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.000021447417,0.0000059856666,0.00006349099,0.00012297994,0.000011668011,0.000085967804,0.000041575157,0.00012585285,0.000040623458,0.021954555,0.9693916,0.008134247],"study_design_scores_gemma":[0.000026811034,0.00001432884,0.00058083684,0.00017013687,0.000033081677,0.00044146736,0.000087166336,0.00096045824,0.00038403552,0.032629658,0.9646283,0.000043790962],"about_ca_topic_score_codex":0.0103097055,"about_ca_topic_score_gemma":0.015608537,"teacher_disagreement_score":0.14090516,"about_ca_system_score_codex":0.0036079253,"about_ca_system_score_gemma":0.003643798,"threshold_uncertainty_score":0.4713747},"labels":[],"label_agreement":null},{"id":"W3175707130","doi":"","title":"The number of spanning trees of composite graphs","year":2014,"lang":"en","type":"article","venue":"HKBU Institutional Repository (Hong Kong Baptist University)","topic":"Graph theory and applications","field":"Mathematics","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":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Spanning tree; Composite number; Combinatorics; Discrete mathematics; Algorithm","score_opus":0.0155482126698136,"score_gpt":0.23986959554419365,"score_spread":0.22432138287438005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175707130","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9229409,0.0009579777,0.049000308,0.001062546,0.00011800945,0.00007222488,0.005202267,0.00043140547,0.020214343],"genre_scores_gemma":[0.9707929,0.0005532251,0.018740324,0.00010189794,0.00012782996,0.00010596567,0.0037805683,0.00014153616,0.0056555998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878746,0.0002533146,0.00009044993,0.00035678636,0.00030139086,0.00021060427],"domain_scores_gemma":[0.981215,0.011818605,0.002086624,0.001279003,0.0015531376,0.002047663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011798217,0.0004156318,0.00075492414,0.0029481999,0.0013202797,0.0029463447,0.0014291288,0.001201057,0.008104916],"category_scores_gemma":[0.0123325335,0.00061733567,0.0005901789,0.0020029729,0.0011421503,0.0038965195,0.0009984028,0.0009364567,0.00081986847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037070892,0.0004626234,0.09322784,0.0023546026,0.0006050558,0.0009207246,0.0016332924,0.13028769,0.057116695,0.52394867,0.039352257,0.14638345],"study_design_scores_gemma":[0.00013968722,0.0003202547,0.047266733,0.00013368564,0.00038950416,0.002666275,0.0008546571,0.29907545,0.015323371,0.6200754,0.013670403,0.00008460355],"about_ca_topic_score_codex":0.0009637291,"about_ca_topic_score_gemma":0.0019867122,"teacher_disagreement_score":0.008104916,"about_ca_system_score_codex":0.0012545944,"about_ca_system_score_gemma":0.00096674834,"threshold_uncertainty_score":0.027113676},"labels":[],"label_agreement":null},{"id":"W3176383582","doi":"10.1137/21m1450082","title":"A Spectral Moore Bound for Bipartite Semiregular Graphs","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Upper and lower bounds; Discrete mathematics; Graph","score_opus":0.050809379309891226,"score_gpt":0.33745628495734264,"score_spread":0.28664690564745143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176383582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20315963,0.002015442,0.7025218,0.0024578914,0.0002702872,0.0000785072,0.0012817734,0.0016630003,0.086551666],"genre_scores_gemma":[0.88715506,0.0012345555,0.096244074,0.0011531316,0.00038697076,0.00022249598,0.0007950543,0.00044451887,0.012364189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985353,0.0002996804,0.00006868062,0.00036907397,0.00046676907,0.00026052207],"domain_scores_gemma":[0.9921697,0.004548437,0.00063744275,0.0010512616,0.0008246251,0.00076862844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013295277,0.0008487287,0.00094115094,0.0019992134,0.001141744,0.0019893404,0.0019616382,0.0011604853,0.013658057],"category_scores_gemma":[0.008520398,0.00055481616,0.000745804,0.0017096993,0.0020394789,0.0048334496,0.0025274807,0.001988889,0.002688259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003002295,0.00010694125,0.0012277114,0.00021989697,0.00004083352,0.0001458227,0.00026957298,0.037291925,0.011232267,0.9118386,0.008170798,0.029155303],"study_design_scores_gemma":[0.0000212851,0.000069410286,0.00087550783,0.000063802916,0.000023109384,0.00019375066,0.00013093305,0.1862023,0.005813592,0.7988391,0.0077161393,0.00005093706],"about_ca_topic_score_codex":0.00106099,"about_ca_topic_score_gemma":0.0017010237,"teacher_disagreement_score":0.013658057,"about_ca_system_score_codex":0.0016284339,"about_ca_system_score_gemma":0.00058680674,"threshold_uncertainty_score":0.045690715},"labels":[],"label_agreement":null},{"id":"W3181497812","doi":"10.37236/9940","title":"On Automorphisms of Direct Products of Cayley Graphs on Abelian Groups","year":2021,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","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 Lethbridge","funders":"","keywords":"Mathematics; Automorphism; Combinatorics; Abelian group; Cayley graph; Direct product; Prime (order theory); Cyclic group; Discrete mathematics; Graph","score_opus":0.017413738974182743,"score_gpt":0.26644849811630034,"score_spread":0.2490347591421176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181497812","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79448706,0.0016972207,0.11393105,0.00047007352,0.00043891952,0.00013753632,0.0002691385,0.0004691379,0.088099964],"genre_scores_gemma":[0.96294105,0.0014107316,0.017899955,0.00020961397,0.00039203305,0.00011878956,0.00045735892,0.00015563985,0.016414894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999212,0.00019537476,0.000048718317,0.00018408454,0.00018004999,0.00017965223],"domain_scores_gemma":[0.99788755,0.00091961655,0.00040024362,0.0002708956,0.00023708967,0.00028452172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005890089,0.00078225526,0.00055416557,0.0016914875,0.0013114049,0.0017227116,0.0006399927,0.0007271795,0.0050396724],"category_scores_gemma":[0.0027953056,0.0005840331,0.0010345185,0.0011728426,0.0027087217,0.0028371476,0.0021603093,0.0012240899,0.0010654371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013467396,0.000064759224,0.0012139791,0.00009360122,0.000025766712,0.00079949474,0.0011659446,0.0049476856,0.0069539086,0.9697253,0.0016914459,0.013183432],"study_design_scores_gemma":[0.000039555092,0.00008021805,0.0009713799,0.000033285167,0.000024986442,0.00041960808,0.0002600369,0.011554232,0.0025325632,0.97547907,0.00857988,0.000025178018],"about_ca_topic_score_codex":0.0015727063,"about_ca_topic_score_gemma":0.0017586973,"teacher_disagreement_score":0.0050396724,"about_ca_system_score_codex":0.00095458707,"about_ca_system_score_gemma":0.00040391178,"threshold_uncertainty_score":0.016859353},"labels":[],"label_agreement":null},{"id":"W3184463101","doi":"","title":"5. SOME EXTREMAL GRAPHS WITH RESPECT TO THE ZEROTH-ORDER GENERAL RANDIC INDEX","year":2020,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Independence number; Graph; Upper and lower bounds; Invariant (physics); Matching (statistics); Discrete mathematics; Statistics; Mathematical analysis","score_opus":0.04478669488987825,"score_gpt":0.2903861804508267,"score_spread":0.24559948556094846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184463101","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82526934,0.0012585142,0.10509577,0.0005303145,0.000041921558,0.000038694492,0.00040631767,0.0003054718,0.06705364],"genre_scores_gemma":[0.98139507,0.0002923696,0.01474602,0.000068276284,0.000033109336,0.000019832765,0.0001893215,0.000040053663,0.003215882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994665,0.00012083963,0.000022461616,0.00016452112,0.00010093505,0.00012471055],"domain_scores_gemma":[0.99830484,0.0006834827,0.00040492424,0.0002204903,0.00020488726,0.00018124087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007649011,0.0003954634,0.00056984054,0.0022837645,0.0012286929,0.0016180043,0.0008257948,0.00052727107,0.003448384],"category_scores_gemma":[0.0026432916,0.00029619702,0.000655991,0.0009363952,0.001533192,0.001729543,0.0006531298,0.0011119636,0.0002971185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013039826,0.000029208159,0.002056328,0.00010567236,0.000033871493,0.00018031844,0.00021303313,0.015792796,0.006933945,0.9642681,0.0009007869,0.009355507],"study_design_scores_gemma":[0.000027730337,0.000059911068,0.0043213936,0.000041183106,0.000046347548,0.0005079265,0.00026975427,0.072978914,0.0063476376,0.9112204,0.0041295984,0.000049188904],"about_ca_topic_score_codex":0.0009889596,"about_ca_topic_score_gemma":0.0012916845,"teacher_disagreement_score":0.003448384,"about_ca_system_score_codex":0.0011217032,"about_ca_system_score_gemma":0.0003340247,"threshold_uncertainty_score":0.011536062},"labels":[],"label_agreement":null},{"id":"W3186838640","doi":"10.1080/03081087.2021.1954584","title":"Symmetric Pascal matrices and related graphs","year":2021,"lang":"en","type":"article","venue":"Linear and Multilinear Algebra","topic":"Graph theory and applications","field":"Mathematics","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 Regina","funders":"National Research Foundation of Korea; Ministry of Education; Ministry of Science, ICT and Future Planning; National Research Foundation","keywords":"Mathematics; Combinatorics","score_opus":0.021501673011562715,"score_gpt":0.2938175080813706,"score_spread":0.2723158350698079,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186838640","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47132388,0.0027455746,0.26253664,0.0020143806,0.0006093293,0.00012075315,0.0006222456,0.0005975745,0.25942966],"genre_scores_gemma":[0.95298773,0.0010298205,0.02655656,0.00040261296,0.0005066838,0.00006017035,0.00030019888,0.00014564038,0.018010534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994124,0.00014035703,0.00001598198,0.00010333973,0.00020759278,0.00012039747],"domain_scores_gemma":[0.9988288,0.00037036702,0.00022173743,0.00011130822,0.00028354456,0.00018429388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000447081,0.00045461266,0.00037791792,0.0026886335,0.0009845645,0.0014145075,0.0005991357,0.000663128,0.008469299],"category_scores_gemma":[0.002891659,0.00023129949,0.00033752684,0.0015483674,0.0022230158,0.0020213865,0.00095100625,0.000928906,0.0013406511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010224708,0.000011460317,0.00015535021,0.00002125171,0.0000027721462,0.00006082836,0.000111766145,0.0021002311,0.00057551137,0.99066377,0.0014465601,0.0048402427],"study_design_scores_gemma":[0.0000040996565,0.000010264299,0.00024584398,0.000008222966,0.0000018712188,0.00012737724,0.000080367005,0.013316025,0.0003787488,0.98148215,0.0043338384,0.0000110946285],"about_ca_topic_score_codex":0.0013395319,"about_ca_topic_score_gemma":0.0011306179,"teacher_disagreement_score":0.008469299,"about_ca_system_score_codex":0.00067732914,"about_ca_system_score_gemma":0.00038950285,"threshold_uncertainty_score":0.02833265},"labels":[],"label_agreement":null},{"id":"W3191917670","doi":"10.5802/aif.3742","title":"Metric upper bounds for Steklov and Laplace eigenvalues","year":2025,"lang":"en","type":"article","venue":"Annales de l’institut Fourier","topic":"Graph theory and applications","field":"Mathematics","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":"Mathematics; Boundary (topology); Eigenvalues and eigenvectors; Mathematical analysis; Bounded function; Riemannian manifold; Upper and lower bounds; Manifold (fluid mechanics); Ball (mathematics); Pure mathematics; Physics","score_opus":0.032338163093237206,"score_gpt":0.33886663854343957,"score_spread":0.30652847545020234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3191917670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29657295,0.0087510105,0.58117926,0.0047080587,0.0004597034,0.000079871366,0.00045746425,0.00086000207,0.10693165],"genre_scores_gemma":[0.95884204,0.0023577614,0.0289322,0.00046414806,0.0006521856,0.00015019042,0.00032336728,0.0004000247,0.007878012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982054,0.00040689713,0.0000810886,0.00033425563,0.0006520174,0.00032038972],"domain_scores_gemma":[0.9885649,0.006398484,0.00126796,0.0008431875,0.0015741163,0.0013513785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018824948,0.001929325,0.0014684973,0.0049608774,0.0016588997,0.002626279,0.0017391938,0.00160921,0.0065898495],"category_scores_gemma":[0.016699199,0.0007303123,0.0012479388,0.0012889581,0.0051084943,0.0064131576,0.005281487,0.003945234,0.0014067147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010462979,0.000050951316,0.0016405936,0.00018957486,0.000036981433,0.00031433918,0.0004829656,0.014606975,0.008845871,0.95980024,0.0023805297,0.011546348],"study_design_scores_gemma":[0.000016660357,0.00007662573,0.0017393994,0.00012586618,0.000023196024,0.00048666834,0.00021678854,0.11344231,0.0075756493,0.87097883,0.0052334503,0.000084530366],"about_ca_topic_score_codex":0.00071460224,"about_ca_topic_score_gemma":0.0005876239,"teacher_disagreement_score":0.0065898495,"about_ca_system_score_codex":0.002130707,"about_ca_system_score_gemma":0.0004959312,"threshold_uncertainty_score":0.022045255},"labels":[],"label_agreement":null},{"id":"W3195869111","doi":"10.1137/19m1296069","title":"Hamiltonicity of Random Graphs in the Stochastic Block Model","year":2021,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"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; National Science Foundation","keywords":"Mathematics; Combinatorics; Random graph; Discrete mathematics; Partition (number theory); Graph; Stochastic block model; Statistics","score_opus":0.041733432782126996,"score_gpt":0.31380075152884246,"score_spread":0.27206731874671547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195869111","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5329057,0.00096976326,0.4461624,0.0026264878,0.000096393625,0.00017898154,0.0007929695,0.00040927946,0.01585815],"genre_scores_gemma":[0.97589684,0.00066435686,0.014072962,0.00028511055,0.000084319676,0.00018520394,0.0003421416,0.00010610678,0.008363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991767,0.0003511782,0.000023640447,0.00014994881,0.00011151212,0.00018715185],"domain_scores_gemma":[0.9943638,0.0035751543,0.00088634685,0.0003304846,0.00030827237,0.0005359293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014759656,0.0007256403,0.0012305721,0.0010788018,0.0006999059,0.0012349872,0.0018902231,0.001296823,0.0045701293],"category_scores_gemma":[0.0066610677,0.00065424317,0.00077549106,0.0007484982,0.0018258552,0.0025902893,0.001225316,0.0014777825,0.0005116725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019627035,0.00007570715,0.0014972222,0.00010528916,0.00007271172,0.00040231427,0.00027636476,0.17023596,0.0040626517,0.81608754,0.0038166696,0.003171314],"study_design_scores_gemma":[0.000061344756,0.00004588166,0.00045800363,0.000014836375,0.000022092014,0.00005480951,0.000053224616,0.7327221,0.00044867842,0.26521176,0.0008811521,0.000026046646],"about_ca_topic_score_codex":0.007846433,"about_ca_topic_score_gemma":0.0077558197,"teacher_disagreement_score":0.007846433,"about_ca_system_score_codex":0.001701065,"about_ca_system_score_gemma":0.0010654735,"threshold_uncertainty_score":0.015601575},"labels":[],"label_agreement":null},{"id":"W3198054999","doi":"10.1090/cams/14","title":"Maximum spread of graphs and bipartite graphs","year":2022,"lang":"en","type":"article","venue":"Communications of the American Mathematical Society","topic":"Graph theory and applications","field":"Mathematics","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":"Ontario Tech University","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Algorithm; Annotation; Computer science; Artificial intelligence","score_opus":0.04217375577249832,"score_gpt":0.3175858613774179,"score_spread":0.2754121056049196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198054999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19809137,0.0019349502,0.75734997,0.0025081178,0.00011431988,0.00011981992,0.0022963316,0.001749337,0.035835806],"genre_scores_gemma":[0.86391395,0.0016996617,0.111130685,0.0007481918,0.0005101388,0.0004975683,0.0034135766,0.00073503435,0.017351305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969216,0.0010646675,0.00014010847,0.000943423,0.00068614737,0.00024398328],"domain_scores_gemma":[0.981136,0.012988169,0.0014462138,0.0017152969,0.0017079235,0.0010063727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003349766,0.0010570252,0.0014759226,0.00490616,0.0014736665,0.003900228,0.0020423236,0.002133514,0.007952509],"category_scores_gemma":[0.02791958,0.0008569525,0.001176538,0.0036957737,0.0028841689,0.008395835,0.0029046657,0.0023167832,0.0016248527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002693039,0.00006988413,0.0021695711,0.00033821247,0.000112442474,0.00018619424,0.000842665,0.05759295,0.0030964294,0.88260156,0.00850144,0.044219363],"study_design_scores_gemma":[0.000027306585,0.000028242766,0.0008381581,0.000057755962,0.000028439043,0.0001272196,0.00013406065,0.091159664,0.0012297822,0.90303636,0.0033063004,0.000026737367],"about_ca_topic_score_codex":0.002069361,"about_ca_topic_score_gemma":0.0018430752,"teacher_disagreement_score":0.007952509,"about_ca_system_score_codex":0.0028074847,"about_ca_system_score_gemma":0.0009490231,"threshold_uncertainty_score":0.026603818},"labels":[],"label_agreement":null},{"id":"W3200990721","doi":"10.1016/j.disc.2023.113341","title":"Strongly cospectral vertices in normal Cayley graphs","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"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","keywords":"Cayley graph; Mathematics; Combinatorics; Pairwise comparison; Upper and lower bounds; Discrete mathematics; Eigenvalues and eigenvectors; Cayley transform; Vertex-transitive graph; Graph; Line graph; Voltage graph","score_opus":0.037653657690925414,"score_gpt":0.3176544382678461,"score_spread":0.2800007805769207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200990721","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81239927,0.0003236091,0.06631803,0.0010156577,0.00038309253,0.000072157454,0.00047425384,0.0004041832,0.11860979],"genre_scores_gemma":[0.96487546,0.0002752564,0.011326694,0.00025581196,0.00018107153,0.000059750128,0.00047618017,0.00015858814,0.0223912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994754,0.00013142402,0.000022354157,0.00012454326,0.00015120654,0.00009504427],"domain_scores_gemma":[0.9978459,0.0007259568,0.00032647597,0.00020493218,0.00036905456,0.0005275322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003854568,0.0008314343,0.00072119944,0.0021093385,0.002050285,0.0036746766,0.00086002913,0.0011451555,0.009631113],"category_scores_gemma":[0.0024726384,0.0007081878,0.00040292193,0.001715377,0.0021291107,0.0030101617,0.0014877717,0.002263146,0.0014761053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009336204,0.000048020906,0.0007696065,0.000032871885,0.000008354355,0.00013628918,0.00029884573,0.0011333042,0.0028581757,0.98749834,0.0016817738,0.005441031],"study_design_scores_gemma":[0.000021878424,0.000020418154,0.00048558554,0.000011480032,0.000009563356,0.00013890158,0.00022835791,0.0066246935,0.0013415997,0.9890904,0.002016131,0.00001106269],"about_ca_topic_score_codex":0.0015091663,"about_ca_topic_score_gemma":0.0027105259,"teacher_disagreement_score":0.009631113,"about_ca_system_score_codex":0.00083346653,"about_ca_system_score_gemma":0.0004982107,"threshold_uncertainty_score":0.03221935},"labels":[],"label_agreement":null},{"id":"W3203176266","doi":"10.1109/tnse.2022.3232397","title":"Algebraic Connectivity: Local and Global Maximizer Graphs","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Graph theory and applications","field":"Mathematics","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":"University of Alberta","funders":"","keywords":"Algebraic connectivity; Conjecture; Bipartite graph; Mathematics; Combinatorics; Eigenvalues and eigenvectors; Algebraic number; Laplacian matrix; Laplace operator; Discrete mathematics; Vertex (graph theory); Algebraic graph theory; Graph theory; Graph","score_opus":0.019640821576302554,"score_gpt":0.254019951444218,"score_spread":0.23437912986791545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203176266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3095462,0.0005126605,0.65725523,0.0011926014,0.000026136571,0.00010530087,0.00031773734,0.00025712242,0.030786984],"genre_scores_gemma":[0.952822,0.00043652556,0.041972913,0.00015951788,0.00009364086,0.0001768184,0.00026058874,0.00012532779,0.0039526126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878484,0.0004122469,0.00003901194,0.00039731924,0.00022344218,0.00014304173],"domain_scores_gemma":[0.99543035,0.0025669578,0.00082428847,0.00038914543,0.00038855485,0.00040084898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014281865,0.0009187208,0.00092059997,0.0012478068,0.00082685344,0.0017338918,0.00085604173,0.0010042756,0.004071207],"category_scores_gemma":[0.00806386,0.00051786273,0.0006977784,0.0009584534,0.0023926925,0.0038231304,0.0018382347,0.0011831513,0.000378917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000865562,0.00005580526,0.0033211457,0.00017692609,0.000079920734,0.00024319287,0.0004554139,0.101115376,0.008465037,0.8645153,0.0020214692,0.019463986],"study_design_scores_gemma":[0.000029400151,0.00013655407,0.003559431,0.00004708663,0.00006357323,0.0003605143,0.00036957592,0.24228653,0.0046406914,0.7447507,0.0037136632,0.000042238986],"about_ca_topic_score_codex":0.00062085147,"about_ca_topic_score_gemma":0.0008257126,"teacher_disagreement_score":0.004071207,"about_ca_system_score_codex":0.0010034561,"about_ca_system_score_gemma":0.00040547113,"threshold_uncertainty_score":0.013619542},"labels":[],"label_agreement":null},{"id":"W3203748658","doi":"10.1016/j.dam.2021.09.019","title":"Minimum values of the second largest <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e165\" altimg=\"si16.svg\"> <mml:mi>Q</mml:mi> </mml:math> -eigenvalue","year":2021,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Combinatorics; Mathematics; Adjacency matrix; Eigenvalues and eigenvectors; Laplacian matrix; Graph; Diagonal matrix; Laplace operator; Diagonal; Discrete mathematics; Geometry; Mathematical analysis; Physics","score_opus":0.021612144143040853,"score_gpt":0.2616916501359515,"score_spread":0.24007950599291067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203748658","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42131445,0.0031593894,0.3108678,0.0046707047,0.0018521936,0.00027715965,0.014969744,0.0053605842,0.23752812],"genre_scores_gemma":[0.8871031,0.000670158,0.06673259,0.0004353268,0.00027517477,0.00030461972,0.005110176,0.002301726,0.03706715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990847,0.00012717626,0.000039781484,0.000232549,0.00025003744,0.00026581902],"domain_scores_gemma":[0.99466634,0.0024886962,0.00041788042,0.0006452405,0.0012731733,0.0005087261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008714496,0.001155997,0.0013111487,0.0027123142,0.001527509,0.0029446448,0.0013272985,0.0014975473,0.045533683],"category_scores_gemma":[0.010933156,0.00038388858,0.00085970835,0.0012160456,0.0014445666,0.0024558194,0.0012499904,0.0014370299,0.0088980645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026551778,0.0005006411,0.012422437,0.0032183346,0.0002767611,0.0012637522,0.0012698211,0.049656607,0.083672695,0.47357285,0.15993725,0.21155371],"study_design_scores_gemma":[0.00019704858,0.000386644,0.029619396,0.0006156356,0.00014281156,0.0021328547,0.0014595453,0.1550858,0.07422047,0.68226695,0.0534394,0.00043343348],"about_ca_topic_score_codex":0.001047013,"about_ca_topic_score_gemma":0.0013789461,"teacher_disagreement_score":0.045533683,"about_ca_system_score_codex":0.00091855845,"about_ca_system_score_gemma":0.000816547,"threshold_uncertainty_score":0.15232533},"labels":[],"label_agreement":null},{"id":"W3206701587","doi":"","title":"The Level of Nonmultiplicativity of Graphs","year":2001,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Graph theory and applications","field":"Mathematics","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 Regina","funders":"","keywords":"Mathematics; Combinatorics; Multiplicative function; Graph product; Cograph; Discrete mathematics; Block graph; Graph; Conjecture; Pathwidth; Split graph; Line graph","score_opus":0.06360075486249524,"score_gpt":0.32292982749508,"score_spread":0.25932907263258476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206701587","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67698574,0.0008813236,0.28813353,0.001468241,0.000117940435,0.00007589251,0.0002769006,0.00046958157,0.031590834],"genre_scores_gemma":[0.959419,0.00025574962,0.035836414,0.0001380832,0.00011698691,0.000089655325,0.00018063783,0.000077555815,0.0038860077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99499834,0.0014930204,0.00039113162,0.0012064121,0.0012113873,0.0006996118],"domain_scores_gemma":[0.98260456,0.008826251,0.0021239847,0.0035780612,0.0015134746,0.0013536173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028041694,0.0005636689,0.0008546965,0.0015511387,0.002553306,0.0050234376,0.0015869349,0.0013073009,0.0033661998],"category_scores_gemma":[0.00953148,0.0009610384,0.0010489504,0.0011260615,0.0059105116,0.008231274,0.003442721,0.0025258004,0.00048507168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015291548,0.000046771722,0.0036912956,0.00011680821,0.000036492962,0.00027417034,0.0011088459,0.003468377,0.007745065,0.9715045,0.00067799457,0.01117684],"study_design_scores_gemma":[0.00001898334,0.00010451976,0.0018418633,0.000038831968,0.000045476474,0.0006244884,0.0003198957,0.014990416,0.008457737,0.965212,0.008298884,0.000047029003],"about_ca_topic_score_codex":0.0003193707,"about_ca_topic_score_gemma":0.00037231154,"teacher_disagreement_score":0.0050234376,"about_ca_system_score_codex":0.0018759838,"about_ca_system_score_gemma":0.000558923,"threshold_uncertainty_score":0.014830053},"labels":[],"label_agreement":null},{"id":"W3208171027","doi":"10.1016/j.laa.2024.03.013","title":"Deletion-contraction for a unified Laplacian and applications","year":2024,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Laplace operator; Conjecture; Laplacian matrix; Vertex (graph theory); Eigenvalues and eigenvectors; Interlacing; Laplacian smoothing; Contraction (grammar); Graph; Spanning tree; Discrete mathematics; Computer science; Artificial intelligence; Mathematical analysis","score_opus":0.026283835269497395,"score_gpt":0.3130012834160383,"score_spread":0.2867174481465409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208171027","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.119667664,0.0031057692,0.71470624,0.0054634362,0.001994413,0.000107491636,0.00031902042,0.00038326322,0.15425275],"genre_scores_gemma":[0.6857,0.0035687133,0.16908444,0.0024399816,0.0028543582,0.00029331664,0.0004960651,0.00075122924,0.13481194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992279,0.00024702222,0.000043173884,0.00020697666,0.00018021229,0.000094790834],"domain_scores_gemma":[0.99852943,0.00060471724,0.00012773016,0.00017166266,0.0003345683,0.00023186584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014422615,0.0010449915,0.0012514658,0.0025334335,0.0022601031,0.001794786,0.0021057825,0.0018229663,0.011344775],"category_scores_gemma":[0.0029732424,0.000470257,0.0017875291,0.0024640393,0.003345016,0.004428258,0.0033789305,0.0037901015,0.0015803463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007679396,0.000017741271,0.000033508204,0.000025468831,0.0000031231696,0.000050826176,0.00014814605,0.0004791745,0.0006416486,0.9928127,0.0015107604,0.0042692656],"study_design_scores_gemma":[0.000005169162,0.000009696172,0.000045019653,0.000006333039,0.0000045584034,0.0000974558,0.00006731152,0.006031056,0.00020464379,0.9904558,0.003064092,0.000008948682],"about_ca_topic_score_codex":0.0009393001,"about_ca_topic_score_gemma":0.0009814131,"teacher_disagreement_score":0.011344775,"about_ca_system_score_codex":0.00097174273,"about_ca_system_score_gemma":0.00077861594,"threshold_uncertainty_score":0.037952006},"labels":[],"label_agreement":null},{"id":"W3210765768","doi":"10.5206/mt.v1i2.14360","title":"Skew-symmetric tridiagonal Bohemian matrices","year":2021,"lang":"en","type":"article","venue":"Maple Transactions","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tridiagonal matrix; Mathematics; Nilpotent; Dimension (graph theory); Eigenvalues and eigenvectors; Conjecture; Cardinality (data modeling); Combinatorics; Pure mathematics; Algebra over a field; Computer science; Physics","score_opus":0.03924126552678279,"score_gpt":0.2997036436395348,"score_spread":0.26046237811275197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210765768","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5816993,0.0026831462,0.18608122,0.008305704,0.0018304868,0.00008925952,0.00058120483,0.0008418444,0.21788782],"genre_scores_gemma":[0.9449377,0.00080311147,0.025843106,0.00094525446,0.00034092856,0.00007611593,0.00018955834,0.00008508871,0.026779078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997805,0.00005048803,0.000009569561,0.00003956778,0.000085252315,0.00003474876],"domain_scores_gemma":[0.99965215,0.00007930584,0.00004635766,0.000043318072,0.000096234384,0.000082590326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002891245,0.00028209886,0.00020164896,0.0007187137,0.0010994582,0.00082034856,0.00029602172,0.00041091512,0.006984144],"category_scores_gemma":[0.0012312704,0.00014065382,0.00018267552,0.0004326888,0.0012474142,0.0013627328,0.0008383404,0.00086335116,0.0013212148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004323338,0.0000146911925,0.0002543595,0.00003108444,0.0000037568816,0.00009862029,0.0003355471,0.0013277116,0.004211756,0.97506773,0.0060589532,0.012552694],"study_design_scores_gemma":[0.000013430211,0.00003601076,0.00044972537,0.00001871359,0.0000031902864,0.00019076852,0.00018645052,0.009297116,0.0044793044,0.9638194,0.021477899,0.000028077106],"about_ca_topic_score_codex":0.00064613344,"about_ca_topic_score_gemma":0.00064939086,"teacher_disagreement_score":0.006984144,"about_ca_system_score_codex":0.00049928296,"about_ca_system_score_gemma":0.00038972366,"threshold_uncertainty_score":0.023364305},"labels":[],"label_agreement":null},{"id":"W3211285223","doi":"","title":"Characterizing graphs from diffused worshop","year":2016,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Graph theory and applications","field":"Mathematics","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":"McGill University","funders":"","keywords":"Computer science; Laplacian matrix; Graph; Signal processing; Theoretical computer science; Algorithm; Digital signal processing","score_opus":0.027982083268015937,"score_gpt":0.2574491321292934,"score_spread":0.22946704886127745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211285223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43366545,0.0012624058,0.5009023,0.0025356326,0.00025164965,0.00026004872,0.0022742555,0.0011218506,0.05772638],"genre_scores_gemma":[0.8558749,0.0011948798,0.08915352,0.0009951417,0.00048626767,0.00015563116,0.0035492196,0.0010461105,0.047544327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988273,0.0002755166,0.000037531103,0.00044560092,0.00030841093,0.00010565615],"domain_scores_gemma":[0.9916066,0.003714094,0.0012005415,0.001562515,0.0009929421,0.0009232644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070106314,0.0010584616,0.0011542839,0.0022921904,0.0014523704,0.0023722516,0.0024025799,0.0022185093,0.010637029],"category_scores_gemma":[0.0088332705,0.00094191567,0.0009135794,0.0024777101,0.002386544,0.004683774,0.0029596218,0.002744577,0.0018478737],"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.00020394861,0.0000875004,0.0028150533,0.00055184576,0.00006563416,0.00055193785,0.0013326518,0.03744411,0.006048189,0.9060919,0.013373034,0.03143423],"study_design_scores_gemma":[0.000021859982,0.000036970272,0.00077674177,0.000047789825,0.000027157335,0.00042971032,0.00043970745,0.035872027,0.0015818301,0.94982624,0.010917438,0.00002257231],"about_ca_topic_score_codex":0.0015420758,"about_ca_topic_score_gemma":0.0022177948,"teacher_disagreement_score":0.010637029,"about_ca_system_score_codex":0.0013493154,"about_ca_system_score_gemma":0.0005525977,"threshold_uncertainty_score":0.03558439},"labels":[],"label_agreement":null},{"id":"W3214894396","doi":"10.13001/ela.2022.6737","title":"Constructions of cospectral graphs with different zero forcing numbers","year":2022,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Medical Research Council; Vlaamse regering; Natural Sciences and Engineering Research Council of Canada; Fonds Wetenschappelijk Onderzoek; American Mathematical Society; National Science Foundation","keywords":"Mathematics; Combinatorics; Adjacency matrix; Graph; Discrete mathematics; Zero (linguistics)","score_opus":0.011724130021918576,"score_gpt":0.25743601313154585,"score_spread":0.24571188310962727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214894396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44010708,0.00022645868,0.5032769,0.0006513864,0.00016915878,0.00012533543,0.00029019968,0.0006333922,0.054520115],"genre_scores_gemma":[0.88961756,0.00018202898,0.102835916,0.0002769735,0.00006220927,0.00016865977,0.00039967516,0.00021276959,0.0062442096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992888,0.00018564382,0.00003881151,0.00020845998,0.00018288493,0.00009533924],"domain_scores_gemma":[0.998184,0.00073880795,0.00022578605,0.00038932904,0.0002252864,0.00023687146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007620844,0.00051506015,0.00037083088,0.0015584581,0.0014546183,0.0012386981,0.0007512244,0.00083941955,0.005649144],"category_scores_gemma":[0.0027072113,0.00039076773,0.0005909782,0.0008436607,0.0017566276,0.0030487378,0.0016929802,0.0015316899,0.00066190184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042960688,0.000030535768,0.0005015938,0.000035793473,0.000006986058,0.00015156915,0.0002493944,0.0036263335,0.008925932,0.97653925,0.0008926813,0.008997033],"study_design_scores_gemma":[0.000021355112,0.000052493633,0.0006255281,0.000030181376,0.000018421359,0.0005367613,0.00034911823,0.051939383,0.011076659,0.9289201,0.0063944003,0.000035689085],"about_ca_topic_score_codex":0.00018816038,"about_ca_topic_score_gemma":0.00038580294,"teacher_disagreement_score":0.005649144,"about_ca_system_score_codex":0.00069868134,"about_ca_system_score_gemma":0.00037963712,"threshold_uncertainty_score":0.018898308},"labels":[],"label_agreement":null},{"id":"W3215506604","doi":"10.1016/j.laa.2022.06.005","title":"Joins of circulant matrices","year":2022,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":6,"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; Kyoto University; National Research Council Canada; Western University; Compute Canada; Canada First Research Excellence Fund; National Science Foundation","keywords":"Circulant matrix; Joins; Mathematics; Spectrum (functional analysis); Combinatorics; Join (topology); Circulant graph; Discrete mathematics; Algebra over a field; Pure mathematics; Graph; Computer science; Line graph","score_opus":0.03151913662266422,"score_gpt":0.2936063694131929,"score_spread":0.2620872327905287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215506604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34720388,0.0012291028,0.5022535,0.0010713763,0.0010652349,0.00015838695,0.00088289764,0.0010117945,0.14512382],"genre_scores_gemma":[0.84049934,0.0011120824,0.0902192,0.0008671452,0.002133227,0.00023116342,0.0013202735,0.0006784422,0.062939115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985019,0.0003468434,0.00006550532,0.00041123692,0.00046052661,0.00021403878],"domain_scores_gemma":[0.9943275,0.0022778271,0.00093532796,0.00040720592,0.0010086327,0.0010435114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001042166,0.0008259872,0.00091592834,0.0031391676,0.0020113287,0.004142817,0.0010748217,0.0009132401,0.011862485],"category_scores_gemma":[0.0056036,0.000624049,0.0005842511,0.002120851,0.0021334551,0.0035747902,0.0018031776,0.0019533064,0.002329392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004416143,0.00004791009,0.00015634697,0.000025649462,0.000008071823,0.00007650741,0.00018129977,0.000682625,0.0021152343,0.9863382,0.0021513083,0.008172703],"study_design_scores_gemma":[0.0000121892535,0.000044167205,0.00027324958,0.000011974384,0.0000088668485,0.00019661394,0.00011676529,0.0076023536,0.0022513913,0.9814357,0.008023745,0.000022784125],"about_ca_topic_score_codex":0.0005956191,"about_ca_topic_score_gemma":0.0007799036,"teacher_disagreement_score":0.011862485,"about_ca_system_score_codex":0.00078478636,"about_ca_system_score_gemma":0.0007654804,"threshold_uncertainty_score":0.039683998},"labels":[],"label_agreement":null},{"id":"W3216895961","doi":"","title":"Minimum values of the second largest `\\(Q\\)` eigenvalue","year":2021,"lang":"oc","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Graph theory and applications","field":"Mathematics","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","funders":"","keywords":"Combinatorics; Mathematics; Adjacency matrix; Eigenvalues and eigenvectors; Diagonal matrix; Graph; Laplacian matrix; Connectivity; Diagonal; Discrete mathematics; Physics","score_opus":0.015966084247194815,"score_gpt":0.2525896235563258,"score_spread":0.236623539309131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216895961","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94833356,0.00030571234,0.035405602,0.000576251,0.000045644127,0.000018880115,0.00034807774,0.0002469306,0.014719268],"genre_scores_gemma":[0.99522686,0.000028822606,0.0038629242,0.0000213427,0.000011387604,0.000014165724,0.00008207532,0.00002698971,0.00072531274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978036,0.000054265325,0.000009612733,0.00005559671,0.00005318712,0.00004698046],"domain_scores_gemma":[0.99835795,0.00081861194,0.00025603944,0.00011307957,0.00022425635,0.00023013231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004403999,0.00039794648,0.0004363733,0.001375663,0.00057869893,0.0009461706,0.00041676316,0.0006765656,0.004183213],"category_scores_gemma":[0.0031664276,0.00016722167,0.00015610005,0.00046631548,0.0012517965,0.0006831113,0.0005042158,0.00035887928,0.00028633518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016006135,0.0003455461,0.025851367,0.0009978099,0.00016354065,0.0014947692,0.00086951675,0.08743692,0.25098804,0.5470461,0.012207295,0.07099852],"study_design_scores_gemma":[0.00016438773,0.00032843873,0.042878564,0.0001565547,0.000064041014,0.0014117989,0.0010049737,0.39856204,0.06488069,0.48616388,0.004222173,0.00016247023],"about_ca_topic_score_codex":0.00035777825,"about_ca_topic_score_gemma":0.00048276735,"teacher_disagreement_score":0.004183213,"about_ca_system_score_codex":0.000500772,"about_ca_system_score_gemma":0.00025456795,"threshold_uncertainty_score":0.013994217},"labels":[],"label_agreement":null},{"id":"W341212695","doi":"","title":"New results on harmonies trees","year":2007,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Harmony (Music); Mathematics; Art","score_opus":0.06585452461742525,"score_gpt":0.33920892608600683,"score_spread":0.2733544014685816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W341212695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1267323,0.009040008,0.43630737,0.009852619,0.0027499953,0.000104772225,0.00087520736,0.0007850285,0.4135527],"genre_scores_gemma":[0.63016367,0.012312239,0.14004073,0.0045132586,0.0059938026,0.00029164084,0.0015637119,0.0014752651,0.20364568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905974,0.00020208964,0.00005158082,0.00025565023,0.00031458653,0.00011639446],"domain_scores_gemma":[0.9972127,0.0015855696,0.00023278987,0.00036712064,0.00030644157,0.00029544937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009062794,0.0008034521,0.0012571046,0.0036494078,0.0029447875,0.003344819,0.0019094723,0.0014433889,0.01896854],"category_scores_gemma":[0.0045207962,0.00090155366,0.0012657348,0.0050251656,0.003059432,0.010642274,0.0042011067,0.005175572,0.0024565612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016313143,0.00001778774,0.00012600404,0.00006526184,0.000012880991,0.000049198843,0.00022525828,0.0007412703,0.00036178573,0.9816886,0.004227294,0.012468331],"study_design_scores_gemma":[0.0000065134927,0.0000061117335,0.00014076103,0.000011660628,0.000014339151,0.00007716813,0.000080061756,0.0017086156,0.00016929753,0.98507917,0.012700327,0.0000061180667],"about_ca_topic_score_codex":0.00081355113,"about_ca_topic_score_gemma":0.0011926447,"teacher_disagreement_score":0.01896854,"about_ca_system_score_codex":0.0012067793,"about_ca_system_score_gemma":0.00050940603,"threshold_uncertainty_score":0.06345612},"labels":[],"label_agreement":null},{"id":"W35075569","doi":"10.1007/s00604-022-05173-0","title":"Eccentricity sequences and eccentricity sets in digraphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Research Council of Thailand","keywords":"Digraph; Eccentricity (behavior); Mathematics; Combinatorics; Sequence (biology); Vertex (graph theory); Eccentric; Set (abstract data type); Order (exchange); Discrete mathematics; Physics; Graph; Computer science; Biology","score_opus":0.03507426591244646,"score_gpt":0.283843585084521,"score_spread":0.24876931917207457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35075569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37311473,0.0018011847,0.5357464,0.0010759685,0.00033909842,0.00019715454,0.0019213388,0.001115422,0.08468874],"genre_scores_gemma":[0.8127918,0.0010492968,0.15764111,0.00034022745,0.00017240719,0.00017420274,0.001508198,0.000190916,0.026131833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994803,0.00012416685,0.00004307558,0.00018389476,0.00010892641,0.000059576592],"domain_scores_gemma":[0.9978467,0.00084027427,0.00046216714,0.00023448064,0.0003618456,0.0002545001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040713197,0.00040222306,0.0003341177,0.0020114435,0.0008364023,0.0014038513,0.00050074264,0.00069224444,0.007105543],"category_scores_gemma":[0.0034944292,0.00035854717,0.00028099967,0.0015314748,0.0013129034,0.0023599907,0.0009549815,0.0007608225,0.0014049333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023507544,0.00005815795,0.0026932582,0.0002865593,0.000033326956,0.00056176365,0.0007952927,0.011758022,0.017510464,0.8627177,0.0039909575,0.099359475],"study_design_scores_gemma":[0.00003468244,0.00012056167,0.0029942067,0.00010392669,0.000030677373,0.0013463275,0.00047146712,0.06064735,0.011555773,0.8855106,0.037137102,0.000047223257],"about_ca_topic_score_codex":0.000710343,"about_ca_topic_score_gemma":0.0010111309,"teacher_disagreement_score":0.007105543,"about_ca_system_score_codex":0.00089621055,"about_ca_system_score_gemma":0.00033743258,"threshold_uncertainty_score":0.023770392},"labels":[],"label_agreement":null},{"id":"W36680195","doi":"10.3390/v15010155","title":"Eigenvalues of the Discrete p-Laplacian for Graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Eigenvalues and eigenvectors; Laplacian matrix; Laplace operator; Pure mathematics; Combinatorics; Mathematical analysis; Physics","score_opus":0.026469833968516262,"score_gpt":0.2914175538317178,"score_spread":0.26494771986320154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W36680195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08112663,0.010445205,0.649586,0.015161617,0.0026873564,0.00032351067,0.006702565,0.0012617429,0.23270544],"genre_scores_gemma":[0.7172735,0.01647456,0.11422687,0.0035726354,0.0035241295,0.001180685,0.0046892553,0.0010992669,0.13795914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993988,0.0001801429,0.000028270017,0.00015584302,0.0001363803,0.00010053982],"domain_scores_gemma":[0.9980394,0.000992869,0.00032875343,0.00017759153,0.00027229,0.00018910615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006722977,0.0012687898,0.0007479136,0.0029536127,0.0010965749,0.0020248264,0.0013040508,0.0018363643,0.030461961],"category_scores_gemma":[0.0039282045,0.00034489494,0.0010115404,0.0019766225,0.0016275065,0.002800514,0.0015202507,0.0023120476,0.006977292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035464036,0.000035673875,0.0005514952,0.00020895556,0.0000265221,0.00031952123,0.00030340522,0.008684508,0.0015677476,0.94509834,0.02329007,0.019878218],"study_design_scores_gemma":[0.0000078588255,0.000009740524,0.0005208206,0.000027796268,0.000006575318,0.00036674197,0.00008844553,0.027249735,0.00016226344,0.95281404,0.0187267,0.000019323317],"about_ca_topic_score_codex":0.0024236399,"about_ca_topic_score_gemma":0.002871198,"teacher_disagreement_score":0.030461961,"about_ca_system_score_codex":0.001328479,"about_ca_system_score_gemma":0.0005940588,"threshold_uncertainty_score":0.101905406},"labels":[],"label_agreement":null},{"id":"W4200032008","doi":"10.1515/spma-2021-0152","title":"Graphs with the second signless Laplacian eigenvalue ≤ 4","year":2021,"lang":"en","type":"article","venue":"Special Matrices","topic":"Graph theory and applications","field":"Mathematics","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":"McGill University","funders":"","keywords":"Knapsack problem; Combinatorics; Mathematics; Eigenvalues and eigenvectors; Simple (philosophy); Laplace operator; Discrete mathematics; Class (philosophy); Laplacian matrix; Graph; Computer science; Mathematical optimization; Physics","score_opus":0.02073033612705072,"score_gpt":0.26729986961542895,"score_spread":0.24656953348837823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200032008","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97189707,0.00010839749,0.016524974,0.00047883854,0.00004109552,0.000012037758,0.00007204466,0.00006624955,0.010799225],"genre_scores_gemma":[0.9951265,0.000051175983,0.0025903087,0.0000771545,0.000042856456,0.000010567107,0.00007041249,0.000014570889,0.0020164843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977833,0.000051131603,0.000008001997,0.000052716066,0.00005595516,0.000053894084],"domain_scores_gemma":[0.9988986,0.00043333598,0.00026178415,0.00009245033,0.00011735636,0.00019642999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022954587,0.00036577738,0.0003471364,0.0013026256,0.00067329674,0.0012147201,0.0005134573,0.000927784,0.0040157153],"category_scores_gemma":[0.0015130622,0.00019863671,0.00030180032,0.00053944724,0.0019335559,0.0012277149,0.00072949985,0.0006054132,0.00027948577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025881975,0.00008201296,0.0038438716,0.00015946016,0.0000412168,0.00075203925,0.0006122126,0.013027581,0.033684224,0.9330496,0.0031247388,0.011364251],"study_design_scores_gemma":[0.000028781615,0.000053969237,0.0021999227,0.000021708976,0.000010748783,0.00035352889,0.00032699367,0.027181325,0.0039904844,0.9637975,0.002015077,0.0000199273],"about_ca_topic_score_codex":0.0003984576,"about_ca_topic_score_gemma":0.00050891197,"teacher_disagreement_score":0.0040157153,"about_ca_system_score_codex":0.00031300887,"about_ca_system_score_gemma":0.00017283899,"threshold_uncertainty_score":0.013433874},"labels":[],"label_agreement":null},{"id":"W4200580284","doi":"10.13001/ela.2021.6489","title":"On the Ger\\v{s}gorin disks of distance matrices of graphs","year":2021,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Graph theory and applications","field":"Mathematics","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Counterexample; Combinatorics; Spectral radius; Distance matrix; Laplacian matrix; Eigenvalues and eigenvectors; Vertex (graph theory); Laplace operator; Resistance distance; Matrix (chemical analysis); Diagonal; Graph; Discrete mathematics; Graph power; Line graph; Physics; Mathematical analysis; Geometry; Chemistry","score_opus":0.018929415637558438,"score_gpt":0.28980123315826745,"score_spread":0.270871817520709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200580284","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9018912,0.0017043015,0.049077656,0.0029150809,0.00013564447,0.00004515417,0.00023592808,0.00024117793,0.04375386],"genre_scores_gemma":[0.9876338,0.0003993435,0.008268724,0.00023094635,0.00013364835,0.00006333756,0.00013437147,0.000032942426,0.0031028793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932003,0.00028879815,0.000026841491,0.000109479086,0.00015610264,0.00009886367],"domain_scores_gemma":[0.9976152,0.0014761994,0.00031929676,0.00014380486,0.00012889442,0.00031662683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007863393,0.0008217143,0.0008611792,0.0021779486,0.002090004,0.002125474,0.0012591112,0.0017215902,0.0035357769],"category_scores_gemma":[0.005376955,0.0003975942,0.00034188252,0.0008989118,0.004656593,0.0033337115,0.0022328575,0.0014994079,0.00047431662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006527413,0.00001208926,0.00037042718,0.00004348821,0.0000042109614,0.00011823328,0.00030051224,0.0023080362,0.0005706588,0.991198,0.001478829,0.0035302632],"study_design_scores_gemma":[0.000034539426,0.00003713333,0.00069162966,0.000024871646,0.000004970948,0.0002737258,0.00037916668,0.025546404,0.00047475297,0.9701375,0.002378527,0.000016854505],"about_ca_topic_score_codex":0.00075194525,"about_ca_topic_score_gemma":0.00044691397,"teacher_disagreement_score":0.0035357769,"about_ca_system_score_codex":0.00081768737,"about_ca_system_score_gemma":0.00019989317,"threshold_uncertainty_score":0.011828363},"labels":[],"label_agreement":null},{"id":"W4210319770","doi":"10.28924/2291-8639-20-2022-6","title":"On the Uphill Zagreb Indices of Graphs","year":2022,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Topological index; Combinatorics; Physics","score_opus":0.019749224401156364,"score_gpt":0.3094185601282957,"score_spread":0.2896693357271394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210319770","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5978158,0.0037547138,0.27485472,0.0008413264,0.00054958696,0.00008151325,0.0005487791,0.00025242573,0.12130106],"genre_scores_gemma":[0.9554673,0.0020341962,0.03374914,0.00019453069,0.00033001028,0.0000661555,0.00032557914,0.00009776227,0.007735498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996437,0.00009127952,0.00001805699,0.00006998523,0.000120106946,0.000056794266],"domain_scores_gemma":[0.999153,0.0003000174,0.00017129105,0.00008627368,0.00017859314,0.0001109111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046886475,0.00035235027,0.0003866717,0.0025026607,0.0008504255,0.0014302963,0.00045646733,0.00038280172,0.002902389],"category_scores_gemma":[0.0026242277,0.00019768954,0.00034892827,0.0010897398,0.0015301534,0.002786491,0.0006632411,0.0011694267,0.0004633167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002342346,0.000010715126,0.0007499665,0.000034855348,0.0000049413666,0.00006465709,0.00015161367,0.003532305,0.0018061191,0.9851269,0.0008096243,0.007684895],"study_design_scores_gemma":[0.0000072634807,0.000031270974,0.0012226641,0.000036419442,0.000009277224,0.00018631529,0.00012823324,0.02659593,0.00091606507,0.96402645,0.0068198605,0.000020289737],"about_ca_topic_score_codex":0.0013400478,"about_ca_topic_score_gemma":0.0012713064,"teacher_disagreement_score":0.002902389,"about_ca_system_score_codex":0.000635939,"about_ca_system_score_gemma":0.00034725442,"threshold_uncertainty_score":0.009709477},"labels":[],"label_agreement":null},{"id":"W4224903069","doi":"10.48550/arxiv.2204.00093","title":"The Spectrum of Triangle-free Graphs","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph theory and applications","field":"Mathematics","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 Illinois at Urbana-Champaign; Grantová Agentura České Republiky; National Science Foundation","keywords":"Combinatorics; Mathematics; Conjecture; Bipartite graph; Vertex (graph theory); Upper and lower bounds; Eigenvalues and eigenvectors; Graph; Discrete mathematics; Physics","score_opus":0.110603057504999,"score_gpt":0.21749405727895013,"score_spread":0.10689099977395113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224903069","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8381015,0.0008151603,0.08617779,0.0013434953,0.00015377864,0.0000376203,0.00063960697,0.00031181797,0.07241929],"genre_scores_gemma":[0.9890904,0.00030672702,0.005013541,0.00015884177,0.00010824498,0.000042495027,0.00030238664,0.00006342734,0.004913983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963355,0.000052480817,0.00001174386,0.000082239516,0.00012659238,0.000093404095],"domain_scores_gemma":[0.9988225,0.0004929268,0.00014928123,0.00009340605,0.00016820001,0.00027358378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031449582,0.0003626203,0.00028319322,0.0018324326,0.00069279486,0.0011314879,0.00075667904,0.0005889168,0.010129809],"category_scores_gemma":[0.0025218728,0.00025356025,0.00029992042,0.0007292114,0.0014756935,0.0017510076,0.0010923778,0.0006045745,0.0008729417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012685785,0.000034707442,0.0009758872,0.00008439979,0.000010458469,0.00020510294,0.000466978,0.0038861078,0.008141139,0.96925193,0.0036654135,0.013151116],"study_design_scores_gemma":[0.000031125583,0.000033165634,0.0013191386,0.0000296268,0.0000058715104,0.0002854386,0.00022279365,0.037022196,0.002084209,0.95519286,0.003757263,0.000016316317],"about_ca_topic_score_codex":0.0010532837,"about_ca_topic_score_gemma":0.00050776795,"teacher_disagreement_score":0.010129809,"about_ca_system_score_codex":0.0006954604,"about_ca_system_score_gemma":0.00025999773,"threshold_uncertainty_score":0.033887565},"labels":[],"label_agreement":null},{"id":"W4226336034","doi":"10.55016/ojs/cdm.v20i1.76009","title":"On the double covers of a line graph.","year":2025,"lang":"en","type":"preprint","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Prime (order theory); Mathematics; Graph; Coprime integers; Discrete mathematics","score_opus":0.04081099044575935,"score_gpt":0.35660132929703264,"score_spread":0.3157903388512733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226336034","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82509226,0.0014301148,0.091360174,0.00080780924,0.0001347984,0.00003720372,0.00037480996,0.00013201429,0.08063091],"genre_scores_gemma":[0.9738749,0.0008300085,0.015306392,0.00016019848,0.0001372865,0.00003682092,0.00037931366,0.000053887103,0.009221103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972945,0.0000656639,0.000008461316,0.000066995985,0.00006418686,0.000065228436],"domain_scores_gemma":[0.999506,0.00018657277,0.00013078413,0.00004863951,0.0000480943,0.00007979615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018888856,0.00039806162,0.00021981711,0.0011965989,0.0010271012,0.0008845739,0.00030657114,0.00047008714,0.0042918664],"category_scores_gemma":[0.0007814997,0.00024755532,0.00029935737,0.0006994862,0.0013671533,0.0018099628,0.0008958807,0.00066986005,0.00042635214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058227975,0.000016898024,0.00093491137,0.00004709805,0.000008947425,0.00028146323,0.00038859376,0.0023696427,0.005827592,0.97877824,0.0013640216,0.009924404],"study_design_scores_gemma":[0.000018321836,0.000080399106,0.00416459,0.000047540547,0.000022982113,0.001207898,0.00069644325,0.028618775,0.0060410853,0.9364411,0.022631442,0.000029354174],"about_ca_topic_score_codex":0.00084571633,"about_ca_topic_score_gemma":0.0008622244,"teacher_disagreement_score":0.0042918664,"about_ca_system_score_codex":0.00064311596,"about_ca_system_score_gemma":0.00016060016,"threshold_uncertainty_score":0.014357686},"labels":[],"label_agreement":null},{"id":"W4229067867","doi":"10.1016/j.amc.2022.126945","title":"Inner Bohemian inverses","year":2022,"lang":"en","type":"article","venue":"Applied Mathematics and Computation","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Ciencia e Innovación; Western University; Ministerio de Ciencia, Innovación y Universidades","keywords":"Mathematics; Type (biology); Population; Set (abstract data type); Combinatorics; Computer science; Geology; Demography","score_opus":0.033324749321228926,"score_gpt":0.27966916809158315,"score_spread":0.24634441877035423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229067867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2749008,0.0006665017,0.5388812,0.0009264444,0.00049184257,0.00013741557,0.00034664586,0.00049154734,0.18315761],"genre_scores_gemma":[0.8899531,0.00041712608,0.07887754,0.00063546683,0.0003669362,0.00022428314,0.00031360835,0.00022735672,0.0289845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870205,0.00028847207,0.000089136964,0.00025361273,0.00044705343,0.00021957292],"domain_scores_gemma":[0.99774075,0.0009232728,0.0001981468,0.00035202922,0.00054561225,0.00024025867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00106405,0.0004990522,0.00054375804,0.0014151791,0.0016356036,0.0015439977,0.0007882498,0.00083868,0.011336868],"category_scores_gemma":[0.005124908,0.00029862137,0.0007561103,0.00047362517,0.0025812148,0.003924732,0.001745379,0.0016540468,0.0017824755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022673137,0.000014015058,0.00013460108,0.00003760204,0.0000045255983,0.00004741351,0.00020448897,0.00072075083,0.0017692432,0.9909306,0.00066717865,0.005446927],"study_design_scores_gemma":[0.000007536244,0.000027869895,0.00015822065,0.000015409812,0.0000049357714,0.00014073041,0.00009131888,0.0064731385,0.0022399526,0.98622954,0.004592275,0.000019040323],"about_ca_topic_score_codex":0.00043330344,"about_ca_topic_score_gemma":0.00058453955,"teacher_disagreement_score":0.011336868,"about_ca_system_score_codex":0.0005794507,"about_ca_system_score_gemma":0.000559931,"threshold_uncertainty_score":0.0379256},"labels":[],"label_agreement":null},{"id":"W4231619975","doi":"10.1090/surv/239/05","title":"Analysis on trees","year":2019,"lang":"en","type":"book-chapter","venue":"Mathematical surveys and monographs","topic":"Graph theory and applications","field":"Mathematics","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":"McMaster University","funders":"","keywords":"Computer science","score_opus":0.04819704822828268,"score_gpt":0.2903148675963532,"score_spread":0.24211781936807053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231619975","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.011646761,0.029507333,0.34885123,0.007910742,0.0018474922,0.00007309803,0.0017517488,0.0008819526,0.5975296],"genre_scores_gemma":[0.2775143,0.03831678,0.12660465,0.0033259003,0.0054230304,0.0003052384,0.0039059508,0.0019972879,0.54260683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993519,0.0001839334,0.00002339294,0.00014697295,0.00023104018,0.00006282698],"domain_scores_gemma":[0.9992119,0.0003744331,0.00004663983,0.0001474617,0.00018163612,0.00003783736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005049589,0.0008614016,0.0009483994,0.003139772,0.001056569,0.0030743654,0.00093664776,0.0007971719,0.02969835],"category_scores_gemma":[0.0026463228,0.000498882,0.00084468786,0.004073837,0.0017775369,0.0045201443,0.0014024783,0.0023160395,0.011558852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008300693,0.000011830156,0.0001326755,0.000092470975,0.000014039657,0.000022568916,0.00011265599,0.0014245785,0.00035900634,0.9137755,0.03701063,0.04703569],"study_design_scores_gemma":[0.0000012375536,0.000003003044,0.00017726362,0.00004210954,0.000007939057,0.000031194526,0.00003558676,0.0023440598,0.00014694646,0.9344158,0.062790625,0.0000041885223],"about_ca_topic_score_codex":0.0018587285,"about_ca_topic_score_gemma":0.0017151191,"teacher_disagreement_score":0.02969835,"about_ca_system_score_codex":0.0020511514,"about_ca_system_score_gemma":0.000717791,"threshold_uncertainty_score":0.09935087},"labels":[],"label_agreement":null},{"id":"W4231748513","doi":"10.13001/ela.2019.5175","title":"Computing Kemeny's constant for a barbell graph","year":2019,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Graph theory and applications","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Iowa State University","keywords":"Mathematics; Combinatorics; Regular graph; Distance-regular graph; Discrete mathematics; Line graph; Graph power; Voltage graph; Graph; Spectral graph theory; Null graph","score_opus":0.01659689781592324,"score_gpt":0.2962628181128738,"score_spread":0.2796659202969506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231748513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39481914,0.0013042965,0.5730626,0.00086892676,0.00014601125,0.000098002645,0.0008975621,0.0019807334,0.026822757],"genre_scores_gemma":[0.87137365,0.00043800514,0.120613396,0.00012655505,0.00006589105,0.0000691759,0.000481627,0.00046775475,0.00636394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990239,0.00015038211,0.000037643604,0.00036219423,0.00023954205,0.00018640685],"domain_scores_gemma":[0.9911538,0.0056102145,0.0006598909,0.0014143758,0.0005781301,0.00058367604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018601622,0.00063728995,0.0007796539,0.004176816,0.0016337329,0.0018083019,0.0016918667,0.001409434,0.0063162735],"category_scores_gemma":[0.020313697,0.00039593832,0.00062114885,0.0027175392,0.0019916764,0.005615604,0.001453885,0.001818916,0.00158351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005471632,0.00012447663,0.0060343794,0.00031865333,0.00010829952,0.00046557747,0.0008068429,0.17097588,0.013662877,0.72601056,0.00776122,0.07318411],"study_design_scores_gemma":[0.00002658385,0.00004906068,0.0021529512,0.000036844332,0.000039463903,0.00024110611,0.00018443949,0.28657645,0.007655423,0.69777524,0.0051837782,0.000078551486],"about_ca_topic_score_codex":0.004573986,"about_ca_topic_score_gemma":0.0072288243,"teacher_disagreement_score":0.0063162735,"about_ca_system_score_codex":0.0021985634,"about_ca_system_score_gemma":0.0011762091,"threshold_uncertainty_score":0.021130025},"labels":[],"label_agreement":null},{"id":"W4235523307","doi":"10.1002/jgt.20146","title":"Roots of cube polynomials of median graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Graph theory and applications","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences","funders":"","keywords":"Combinatorics; Mathematics; Cartesian product; Graph; Regular polygon; Discrete mathematics; Geometry","score_opus":0.01798738066600316,"score_gpt":0.282285436764795,"score_spread":0.26429805609879187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235523307","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86933213,0.0005040531,0.0903351,0.0005650618,0.00011621282,0.000058286198,0.0007085584,0.0003323069,0.038048483],"genre_scores_gemma":[0.9833066,0.00017817353,0.009606111,0.0000612804,0.00007375589,0.00002935791,0.00025071946,0.000066738205,0.0064272294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959534,0.00005543533,0.000010809371,0.000077875426,0.0001308103,0.00012968839],"domain_scores_gemma":[0.9988086,0.00042018332,0.00024744356,0.00007984091,0.00019341144,0.00025053998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032080497,0.00034061747,0.0005478014,0.0013679411,0.0008691202,0.0013347276,0.0005404552,0.0003344635,0.010098116],"category_scores_gemma":[0.002739283,0.00025663228,0.00040637163,0.0010244743,0.001730872,0.0013994704,0.001207793,0.001123928,0.0010350597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004169947,0.000057186513,0.0026371193,0.00014946538,0.000016712907,0.00032048748,0.0004575094,0.016268583,0.0089767855,0.9242734,0.0057396796,0.040686082],"study_design_scores_gemma":[0.00006929297,0.00013127516,0.003527764,0.00003805569,0.000017846824,0.00063743413,0.00034952268,0.057429265,0.006656018,0.9208606,0.01022631,0.00005664304],"about_ca_topic_score_codex":0.0026014042,"about_ca_topic_score_gemma":0.003400306,"teacher_disagreement_score":0.010098116,"about_ca_system_score_codex":0.0016982033,"about_ca_system_score_gemma":0.0006444704,"threshold_uncertainty_score":0.033781588},"labels":[],"label_agreement":null},{"id":"W4238730366","doi":"10.1002/net.20301","title":"On the roots of strongly connected reliability polynomials","year":2009,"lang":"en","type":"article","venue":"Networks","topic":"Graph theory and applications","field":"Mathematics","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":"Dalhousie University","funders":"","keywords":"Digraph; Strongly connected component; Mathematics; Reliability (semiconductor); Vertex connectivity; Combinatorics; Simply connected space; Unit disk; Plane (geometry); Arc (geometry); Closure (psychology); Complex plane; Connected component; Discrete mathematics; Vertex (graph theory); Graph; Mathematical analysis; Geometry; Physics","score_opus":0.02494561104413878,"score_gpt":0.28564447756926165,"score_spread":0.26069886652512286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238730366","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4990859,0.00076062285,0.48994523,0.0011343281,0.000061838284,0.000051846502,0.00030883012,0.00025208842,0.008399354],"genre_scores_gemma":[0.9898801,0.0002897435,0.008488252,0.000040830564,0.00007000741,0.000042186562,0.000062766085,0.000034038934,0.0010921783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998985,0.00031942947,0.000031690844,0.00021244407,0.00032083478,0.00013061751],"domain_scores_gemma":[0.981851,0.013692593,0.0020742742,0.00064913114,0.0012387173,0.0004942759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016995466,0.0004803025,0.0006424516,0.001839271,0.000552451,0.0011446145,0.0007961015,0.00077838154,0.00279546],"category_scores_gemma":[0.026844805,0.00039161256,0.0003184516,0.00091314776,0.0026827764,0.0024665196,0.0016704721,0.0017785744,0.0003747697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030974904,0.000052705345,0.0042483835,0.000215973,0.000033889573,0.00052756764,0.00084834953,0.1935141,0.011182521,0.7548628,0.0019135508,0.03229046],"study_design_scores_gemma":[0.000053655403,0.00009068483,0.002293425,0.000056838755,0.000018186849,0.00037601189,0.00024292311,0.37395728,0.0031468323,0.61809146,0.001615493,0.00005720686],"about_ca_topic_score_codex":0.0007536289,"about_ca_topic_score_gemma":0.00035281864,"teacher_disagreement_score":0.00279546,"about_ca_system_score_codex":0.0008376648,"about_ca_system_score_gemma":0.0004719567,"threshold_uncertainty_score":0.00935173},"labels":[],"label_agreement":null},{"id":"W4241858850","doi":"10.1007/978-1-4613-0163-9_1","title":"Graphs","year":2001,"lang":"en","type":"book-chapter","venue":"Graduate texts in mathematics","topic":"Graph theory and applications","field":"Mathematics","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 Waterloo","funders":"","keywords":"Notation; Homomorphism; Automorphism; Computer science; Task (project management); Mathematics; Discrete mathematics; Arithmetic; Engineering","score_opus":0.11239021370399348,"score_gpt":0.3170068615751623,"score_spread":0.2046166478711688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241858850","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.003790991,0.0014182997,0.042175524,0.0024774838,0.001354999,0.0001033022,0.0032267026,0.0011416582,0.94431096],"genre_scores_gemma":[0.050034557,0.0025068955,0.022593398,0.001538328,0.00054400775,0.00016396052,0.0061389725,0.0010901853,0.9153898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996592,0.000050141334,0.000009801569,0.00012354316,0.00012018054,0.000037258713],"domain_scores_gemma":[0.9996106,0.000073890194,0.000021522475,0.00012920877,0.00012061996,0.000044148415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019001467,0.00084066787,0.0004753185,0.0013506595,0.0012352578,0.002707336,0.0009620553,0.000788175,0.16180882],"category_scores_gemma":[0.0009973276,0.0004186937,0.00039746385,0.0018837515,0.0008883711,0.0032737383,0.0011860286,0.0018628672,0.067680314],"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.000014916726,0.000026280428,0.000087253335,0.000107197615,0.000008581555,0.000046039124,0.00012422967,0.00045680953,0.00086200127,0.69326013,0.22111703,0.08388949],"study_design_scores_gemma":[0.0000064737087,0.000005399354,0.00013249856,0.00003578166,0.000006973443,0.00010751798,0.00007135346,0.0004696396,0.0005961972,0.35418835,0.64437413,0.000005761318],"about_ca_topic_score_codex":0.0012952362,"about_ca_topic_score_gemma":0.0017594872,"teacher_disagreement_score":0.16180882,"about_ca_system_score_codex":0.001047934,"about_ca_system_score_gemma":0.0006527158,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4247791125","doi":"10.1090/fic/045/13","title":"A generalization of the Auslander formula","year":2005,"lang":"en","type":"other","venue":"","topic":"Graph theory and applications","field":"Mathematics","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 Toronto","funders":"","keywords":"Generalization; Mathematics; Mathematical analysis","score_opus":0.02653295307461025,"score_gpt":0.3006240855259453,"score_spread":0.27409113245133504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247791125","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.030267617,0.0026187014,0.2970482,0.0066918726,0.002934474,0.00012154509,0.0009902489,0.0011018622,0.6582254],"genre_scores_gemma":[0.46541882,0.0056643803,0.20103477,0.005527878,0.003272688,0.00029495682,0.0018581967,0.0013691523,0.31555927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938,0.00014912813,0.00003577413,0.00016863513,0.00019610731,0.00007035903],"domain_scores_gemma":[0.9994142,0.0001703342,0.000042689717,0.00017986346,0.0001545427,0.00003846644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079920737,0.0006680911,0.00095532637,0.0020289866,0.0015940116,0.0022052526,0.0014969369,0.0013261498,0.024827672],"category_scores_gemma":[0.0026007574,0.00031989056,0.0010746389,0.002243213,0.0017519438,0.006494168,0.0019480749,0.0029680904,0.005507697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012325648,0.0000122230595,0.000051328614,0.000033543976,0.0000048708566,0.000037693288,0.00006309886,0.00027020316,0.00031561134,0.97044396,0.008784227,0.019970812],"study_design_scores_gemma":[0.000009724254,0.000006875828,0.00009323223,0.000019525734,0.000008899612,0.00010750806,0.00002578245,0.0027852792,0.00036944513,0.96553236,0.031032478,0.000008847433],"about_ca_topic_score_codex":0.0017610573,"about_ca_topic_score_gemma":0.0021395497,"teacher_disagreement_score":0.024827672,"about_ca_system_score_codex":0.0011215755,"about_ca_system_score_gemma":0.00081834564,"threshold_uncertainty_score":0.08305681},"labels":[],"label_agreement":null},{"id":"W4248971632","doi":"10.1038/nnano.2013.6","title":"Complexities abound","year":2013,"lang":"en","type":"letter","venue":"Nature Nanotechnology","topic":"Graph theory and applications","field":"Mathematics","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 Toronto","funders":"","keywords":"Nanotechnology; Computer science; Materials science","score_opus":0.029459214837344434,"score_gpt":0.3034689729740708,"score_spread":0.2740097581367264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248971632","genre_codex":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061103487,0.0045863143,0.019774599,0.4624755,0.0120474575,0.000034821398,0.00023201504,0.00035115075,0.4943878],"genre_scores_gemma":[0.49300683,0.009556985,0.017671356,0.1789698,0.025544403,0.00041744843,0.00041147377,0.00059894525,0.27382278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887997,0.00024733617,0.00003997579,0.00017151392,0.00053201563,0.00012915547],"domain_scores_gemma":[0.99688464,0.0018314373,0.00018856283,0.0005068451,0.00036071808,0.00022781751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010431618,0.0005687136,0.00050041097,0.0011907121,0.0028163092,0.0055097314,0.0010697433,0.0050736615,0.02194368],"category_scores_gemma":[0.009297939,0.00026617292,0.00038683854,0.0005255232,0.008382605,0.01099195,0.0035469872,0.008674309,0.006487854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074041595,0.000004763464,0.000031709355,0.000022397893,0.0000030162819,0.00011928392,0.000080054575,0.00012934374,0.000069942274,0.929454,0.064524025,0.0055539724],"study_design_scores_gemma":[0.0000043390405,0.0000015301378,0.000024184521,0.000015349222,0.0000013018264,0.000113293994,0.000063670035,0.0002603135,0.0000622493,0.9114801,0.087969586,0.000004069762],"about_ca_topic_score_codex":0.0009725508,"about_ca_topic_score_gemma":0.00177047,"teacher_disagreement_score":0.02194368,"about_ca_system_score_codex":0.0027969317,"about_ca_system_score_gemma":0.0010142955,"threshold_uncertainty_score":0.07340896},"labels":[],"label_agreement":null},{"id":"W4251582664","doi":"10.1007/978-3-030-27227-2_7","title":"Convexity","year":2019,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in mathematics","topic":"Graph theory and applications","field":"Mathematics","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 Toronto; University of Waterloo","funders":"","keywords":"Mathematics; Hermitian matrix; Torus; Eigenvalues and eigenvectors; Diagonal; Pure mathematics; Combinatorics; Convex hull; Convexity; Regular polygon; Geometry; Physics","score_opus":0.056794648682553045,"score_gpt":0.29563368135793855,"score_spread":0.2388390326753855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251582664","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.001801817,0.0019544386,0.018445946,0.002159388,0.000636358,0.000023675808,0.0004926826,0.00012682243,0.97435886],"genre_scores_gemma":[0.113625966,0.008593929,0.013510956,0.0018340603,0.0018851605,0.00017384169,0.0015149971,0.0010933199,0.8577677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994955,0.00008395326,0.000020119423,0.00013992311,0.00019896588,0.00006148159],"domain_scores_gemma":[0.9996195,0.0001063156,0.000023605746,0.00008502887,0.0001338755,0.000031723863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003120801,0.0010144676,0.00073310116,0.0015397297,0.0015676154,0.0038762395,0.0008215201,0.00072583527,0.081154965],"category_scores_gemma":[0.0015781801,0.00038746893,0.00073111587,0.001326609,0.0022992361,0.0037455042,0.002066949,0.0032698088,0.022276599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008512742,0.0000063592447,0.000033438922,0.000057513236,0.0000053425797,0.000024343348,0.000058821726,0.00034815873,0.0002134096,0.9189101,0.057456132,0.022877987],"study_design_scores_gemma":[0.0000043935033,0.00000430878,0.00013143882,0.00003526731,0.000005452572,0.00012159478,0.0000552454,0.00056191627,0.00024898906,0.7447381,0.2540877,0.000005544272],"about_ca_topic_score_codex":0.0019119459,"about_ca_topic_score_gemma":0.0017400666,"teacher_disagreement_score":0.081154965,"about_ca_system_score_codex":0.0017555676,"about_ca_system_score_gemma":0.0010055006,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4255411022","doi":"10.1002/qua.1075","title":"Structural analysis of certain linear operators representing chemical network systems via the existence and uniqueness theorems of spectral resolution. VI*","year":2001,"lang":"en","type":"article","venue":"International Journal of Quantum Chemistry","topic":"Graph theory and applications","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal College of Physicians and Surgeons of Canada; Mount Royal University; University of Toronto; University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Uniqueness; Resolution (logic); Space (punctuation); Additive function; Series (stratigraphy); Power series; Pure mathematics; Topology (electrical circuits); Computer science; Combinatorics; Mathematical analysis","score_opus":0.034158747754588985,"score_gpt":0.3225322657639052,"score_spread":0.2883735180093162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255411022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3131232,0.0002895573,0.6666777,0.0004652631,0.000038192724,0.000052340198,0.00008096425,0.00014978574,0.019123025],"genre_scores_gemma":[0.9422947,0.00015960114,0.052820668,0.00007871964,0.00003167947,0.00004585497,0.000063242995,0.00003290586,0.004472701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998029,0.000074316245,0.00000857407,0.00003760124,0.00004574502,0.000030846128],"domain_scores_gemma":[0.9991289,0.0004972448,0.00017551683,0.0000503719,0.00009322447,0.00005464784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006867498,0.00026857218,0.00019583727,0.0006769697,0.0004452337,0.0007986782,0.0004917439,0.0005384509,0.0033560218],"category_scores_gemma":[0.0023830624,0.00017601943,0.00035213435,0.0002921478,0.0012212336,0.0014226448,0.0006120014,0.00056196866,0.00025664526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023894258,0.000023143877,0.00038856387,0.00004574929,0.000009796622,0.000081591315,0.00021317814,0.027136713,0.005418915,0.9581407,0.00044024762,0.008077518],"study_design_scores_gemma":[0.0000075941616,0.0000313392,0.0003747288,0.000012114021,0.0000060253324,0.0001145654,0.00013574444,0.38294744,0.0026884463,0.61252433,0.0011450734,0.000012578991],"about_ca_topic_score_codex":0.00035703054,"about_ca_topic_score_gemma":0.00033692646,"teacher_disagreement_score":0.0033560218,"about_ca_system_score_codex":0.00040232623,"about_ca_system_score_gemma":0.00023274761,"threshold_uncertainty_score":0.011226952},"labels":[],"label_agreement":null},{"id":"W4255530619","doi":"10.23952/jnva.2.2018.1.07","title":"Intersection properties, hyperconvexity and Jung constants","year":2018,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Intersection (aeronautics); Mathematics; Engineering; Transport engineering","score_opus":0.048983566943052365,"score_gpt":0.3046983399484739,"score_spread":0.25571477300542156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255530619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42759824,0.007947967,0.48497054,0.0021187246,0.0001916417,0.0001183335,0.0006524519,0.00026766065,0.076134525],"genre_scores_gemma":[0.9355216,0.0031694178,0.04810958,0.00025444105,0.00029701903,0.00013458461,0.0005488924,0.0002127827,0.011751751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984445,0.0003213822,0.00008862208,0.00042901683,0.00043517127,0.00028127697],"domain_scores_gemma":[0.9945064,0.0023191613,0.0010991999,0.0004776918,0.0008548442,0.00074263354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018251697,0.0010480713,0.0008867495,0.0052200616,0.0021945222,0.0034248012,0.0015519231,0.0011329083,0.00802111],"category_scores_gemma":[0.0070384354,0.00073497655,0.0011583042,0.003064103,0.005696649,0.014067053,0.0047972794,0.0046089683,0.0006687938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038189926,0.00002120637,0.0019558286,0.00014313393,0.000036356385,0.00012406113,0.0004914386,0.0026901304,0.0022293532,0.981149,0.00068234245,0.010439067],"study_design_scores_gemma":[0.000013503915,0.00015276682,0.0058686235,0.00013949348,0.00007496444,0.0007707049,0.0014987455,0.035906598,0.0074365702,0.9355386,0.012466092,0.00013329744],"about_ca_topic_score_codex":0.0015368499,"about_ca_topic_score_gemma":0.0011244756,"teacher_disagreement_score":0.00802111,"about_ca_system_score_codex":0.0019327629,"about_ca_system_score_gemma":0.0007457198,"threshold_uncertainty_score":0.026833296},"labels":[],"label_agreement":null},{"id":"W4255957560","doi":"10.1007/978-1-4939-7131-2_100269","title":"Descriptive Graphs","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Graph theory and applications","field":"Mathematics","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 Calgary","funders":"","keywords":"Computer science; Mathematics","score_opus":0.07735905851012725,"score_gpt":0.29023744916641997,"score_spread":0.21287839065629272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255957560","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.0016761542,0.0030837161,0.023892224,0.002321788,0.0010421323,0.000031323674,0.00068117154,0.0004023641,0.9668692],"genre_scores_gemma":[0.03696591,0.0050196713,0.011430174,0.000935576,0.00070092495,0.00007583562,0.0016214456,0.00058964465,0.94266087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997893,0.000047201385,0.000007282445,0.000052781186,0.000085250875,0.000018256353],"domain_scores_gemma":[0.9997687,0.00006120432,0.000012527922,0.000054238302,0.00007621245,0.000027263004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020679756,0.00063005276,0.0003127792,0.0016413783,0.0010821873,0.003209618,0.000658022,0.0005529965,0.07618236],"category_scores_gemma":[0.00077046495,0.00027581846,0.00025931,0.0019244327,0.0014395932,0.0043386025,0.001068802,0.0016140753,0.022630138],"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.0000032389344,0.000008018199,0.000026224525,0.00004622439,0.0000016343955,0.000009524026,0.00015317206,0.00016367353,0.0001572636,0.8718116,0.09279027,0.034829076],"study_design_scores_gemma":[0.0000015344248,0.000002066037,0.00005358205,0.000046423174,0.000002259607,0.00003882832,0.000103905506,0.0002183766,0.00013776064,0.38721064,0.6121809,0.000003714514],"about_ca_topic_score_codex":0.0014920415,"about_ca_topic_score_gemma":0.0032547212,"teacher_disagreement_score":0.07618236,"about_ca_system_score_codex":0.001758592,"about_ca_system_score_gemma":0.0009481835,"threshold_uncertainty_score":0.2548554},"labels":[],"label_agreement":null},{"id":"W4256668698","doi":"10.4153/cjm-2009-047-4","title":"Adjacency Preserving Maps on Hermitian Matrices","year":2008,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Variety (cybernetics); Mathematics; Cover (algebra); Adjacency list; Hermitian matrix; Algebra over a field; Mathematical sciences; Current (fluid); Pure mathematics; Mathematics education; Combinatorics; Statistics; Engineering","score_opus":0.06888368041273756,"score_gpt":0.2788842661450819,"score_spread":0.2100005857323443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256668698","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23812848,0.0063924678,0.30496392,0.0058161053,0.0036420869,0.00021284787,0.0012852544,0.00074139104,0.43881738],"genre_scores_gemma":[0.7695544,0.0050465763,0.035318658,0.0012411557,0.0020921277,0.00017078158,0.0005726217,0.00029951218,0.18570425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957603,0.00007875116,0.000014800122,0.0000737937,0.00016975781,0.00008687986],"domain_scores_gemma":[0.9988778,0.00036115161,0.00014264906,0.00011736768,0.00026314685,0.00023787239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002878472,0.00045082884,0.00037140757,0.0016892321,0.0010837937,0.0019140628,0.0004458255,0.00058832107,0.010946147],"category_scores_gemma":[0.0019395411,0.00027343477,0.0003841232,0.00136328,0.0018054637,0.0024469504,0.0013923721,0.0017266851,0.002030015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010118234,0.0000098210985,0.000076214004,0.000026279016,0.0000035773778,0.00008964691,0.0001813451,0.0008104885,0.0009262051,0.98251534,0.005839041,0.0095118815],"study_design_scores_gemma":[0.0000058525784,0.000016924212,0.00030016684,0.000010503212,0.0000027830263,0.00016048412,0.00006133569,0.0038127883,0.00044049963,0.9812866,0.0138905905,0.000011424257],"about_ca_topic_score_codex":0.002749312,"about_ca_topic_score_gemma":0.0028733818,"teacher_disagreement_score":0.010946147,"about_ca_system_score_codex":0.0008956071,"about_ca_system_score_gemma":0.0009323281,"threshold_uncertainty_score":0.03661853},"labels":[],"label_agreement":null},{"id":"W4282926610","doi":"10.1139/cjc-2022-0087","title":"Topological characterizations of crystal cubic carbon structures","year":2022,"lang":"en","type":"article","venue":"Canadian Journal of Chemistry","topic":"Graph theory and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Molecular graph; Crystal structure; Chemistry; Topological index; Chemical shift; Graph; Molecule; Graph theory; Crystal (programming language); Chemical species; Melting point; Topology (electrical circuits); Chemical physics; Crystallography; Computational chemistry; Mathematics; Combinatorics; Computer science; Organic chemistry; Physical chemistry","score_opus":0.020684254556814153,"score_gpt":0.2474477393381985,"score_spread":0.22676348478138433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4282926610","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8791962,0.0007950233,0.07859683,0.0002022038,0.00006149947,0.00006198637,0.0013215343,0.0004975819,0.039267134],"genre_scores_gemma":[0.986212,0.0001480684,0.012134269,0.000017813143,0.000012282379,0.000021674656,0.0006423376,0.00004458145,0.0007669913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998729,0.000014463779,0.0000062659137,0.000018106417,0.00006429895,0.000023904575],"domain_scores_gemma":[0.99955004,0.000111169764,0.00011686245,0.00006384637,0.00011269462,0.000045310135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013658653,0.00023298075,0.00016787877,0.0028023364,0.00043630798,0.00069754565,0.00038786198,0.0003291894,0.0030438225],"category_scores_gemma":[0.0010944762,0.00010080374,0.00023461047,0.001225174,0.0006272162,0.0007817638,0.0003595957,0.00032427133,0.00018809365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028087653,0.00009934882,0.033852987,0.0005979858,0.00007531969,0.00051754643,0.00042768594,0.36555228,0.038181353,0.46315762,0.0049815145,0.09227555],"study_design_scores_gemma":[0.000027873382,0.000114691924,0.027212495,0.000048435963,0.000029794206,0.00059272384,0.00041969153,0.806331,0.014458137,0.14242671,0.008254501,0.000083951236],"about_ca_topic_score_codex":0.0028158245,"about_ca_topic_score_gemma":0.0033072648,"teacher_disagreement_score":0.0030438225,"about_ca_system_score_codex":0.00059685844,"about_ca_system_score_gemma":0.0004364527,"threshold_uncertainty_score":0.010182619},"labels":[],"label_agreement":null},{"id":"W4285190472","doi":"10.1007/978-981-19-0957-3","title":"A First Course in Graph Theory and Combinatorics","year":2022,"lang":"en","type":"book","venue":"Texts and readings in mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Ramanujan's sum; Combinatorics; Adjacency list; Conjecture; Adjacency matrix; Mathematics; Graph theory; Discrete mathematics; Graph","score_opus":0.018501757178275284,"score_gpt":0.2788111156372538,"score_spread":0.2603093584589785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285190472","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.000693996,0.010512443,0.006019883,0.005676211,0.005197923,0.000042175532,0.00061165955,0.00039156887,0.9708543],"genre_scores_gemma":[0.003121066,0.003296674,0.0016004646,0.0010093239,0.0010906282,0.000033622524,0.0003027791,0.00029547347,0.98924994],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999673,0.000054398613,0.000011576545,0.000053849362,0.00017202731,0.000035138368],"domain_scores_gemma":[0.99939907,0.00020287326,0.000020900527,0.00006750441,0.00017886623,0.00013091775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003902129,0.0014617229,0.0014194888,0.002220655,0.002209997,0.0046182247,0.0012373816,0.0014813105,0.18301615],"category_scores_gemma":[0.001035578,0.000630821,0.0008125222,0.003408356,0.001429035,0.0051307976,0.0015972955,0.0043283054,0.09799745],"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.000017593986,0.00007762586,0.00009493285,0.0001654618,0.0000051960774,0.000047419977,0.00022691909,0.00023075052,0.000411653,0.10912126,0.8177047,0.07189654],"study_design_scores_gemma":[0.000003350233,0.000011541061,0.0002475578,0.00010439578,0.0000034034783,0.000068022266,0.00007099539,0.0001443426,0.00015193176,0.03106831,0.96812195,0.000004278953],"about_ca_topic_score_codex":0.0026320897,"about_ca_topic_score_gemma":0.009133527,"teacher_disagreement_score":0.18301615,"about_ca_system_score_codex":0.0025047758,"about_ca_system_score_gemma":0.0015291084,"threshold_uncertainty_score":0.61225003},"labels":[],"label_agreement":null},{"id":"W4286972781","doi":"10.48550/arxiv.2109.08646","title":"A noncommutative approach to the graphon Fourier transform","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph theory and applications","field":"Mathematics","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":"","keywords":"Fourier transform; Fourier analysis; Graph; Fourier inversion theorem; Discrete Fourier transform (general); Fractional Fourier transform; Mathematics; Computer science; Discrete mathematics; Algorithm; Combinatorics; Mathematical analysis","score_opus":0.13052300797685773,"score_gpt":0.22690740987612204,"score_spread":0.09638440189926431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286972781","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020340594,0.0009704958,0.94982666,0.0007416678,0.00044115988,0.000028941671,0.00010152155,0.00011823137,0.027430704],"genre_scores_gemma":[0.560283,0.003596712,0.39973208,0.0013237717,0.0019415448,0.00020444789,0.00024460696,0.00042152265,0.032252368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938333,0.00022750985,0.00002791426,0.00014978643,0.00016155327,0.000049922168],"domain_scores_gemma":[0.9988714,0.0005018417,0.00011798146,0.00023172637,0.00018722066,0.00008979426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013503863,0.0006865083,0.0004467821,0.0020183038,0.0007030114,0.0017492439,0.0011327729,0.001115934,0.0055088983],"category_scores_gemma":[0.0028441132,0.00027143472,0.00071170874,0.0012149776,0.0032225347,0.002851272,0.0015564078,0.0020416132,0.001101225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007666925,0.000007688929,0.00006444538,0.000018400033,0.000003859962,0.000052833366,0.000096148695,0.002720708,0.0016100449,0.9910473,0.00041628536,0.0039545996],"study_design_scores_gemma":[0.000003393858,0.0000264424,0.00018600178,0.000014832105,0.000004010946,0.00013808842,0.000056108645,0.04357274,0.0009238158,0.94707257,0.007987175,0.000014956779],"about_ca_topic_score_codex":0.00050003885,"about_ca_topic_score_gemma":0.00049950223,"teacher_disagreement_score":0.0055088983,"about_ca_system_score_codex":0.0006461057,"about_ca_system_score_gemma":0.00038323773,"threshold_uncertainty_score":0.0184291},"labels":[],"label_agreement":null},{"id":"W4296210796","doi":"10.1088/1742-6596/2332/1/012008","title":"Results on Graph Energy","year":2022,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Graph theory and applications","field":"Mathematics","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":"Horizon College and Seminary","funders":"","keywords":"Graph energy; Adjacency matrix; Regular graph; Combinatorics; Graph; Distance-regular graph; Butterfly graph; Circulant graph; Mathematics; Vertex (graph theory); Voltage graph; Windmill graph; Eigenvalues and eigenvectors; Null graph; Line graph; Discrete mathematics; Physics; Quantum mechanics","score_opus":0.053128344475275986,"score_gpt":0.28659105109190086,"score_spread":0.23346270661662488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296210796","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21005893,0.01673432,0.3189696,0.006771888,0.001163459,0.00006173777,0.0011702827,0.00050218706,0.44456774],"genre_scores_gemma":[0.91637945,0.007954258,0.030045234,0.0012236594,0.0011844074,0.00011646996,0.001018105,0.0006273248,0.041451123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909246,0.00018105324,0.000047241687,0.00024589212,0.00029176028,0.00014150716],"domain_scores_gemma":[0.99568105,0.0026841178,0.0002802097,0.0005614955,0.00056803104,0.00022501229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009076561,0.0009554711,0.00095991103,0.005172894,0.0013457707,0.0016968335,0.0012177369,0.0014010245,0.012770912],"category_scores_gemma":[0.0056852517,0.00028677587,0.0010678367,0.0033137691,0.0025787104,0.005127836,0.0018677161,0.0017901626,0.0017592767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017625602,0.000023563985,0.0004077268,0.00013232748,0.000024055134,0.00006929071,0.00011600061,0.006291501,0.00092160626,0.9788562,0.0027359272,0.01040415],"study_design_scores_gemma":[0.0000025256422,0.000008253303,0.0005533207,0.000032343512,0.000009773692,0.00006945821,0.00006546637,0.011260675,0.0003577761,0.98264676,0.004984505,0.000009187718],"about_ca_topic_score_codex":0.00087426644,"about_ca_topic_score_gemma":0.0007233908,"teacher_disagreement_score":0.012770912,"about_ca_system_score_codex":0.001276398,"about_ca_system_score_gemma":0.00025186018,"threshold_uncertainty_score":0.042723},"labels":[],"label_agreement":null},{"id":"W4298281162","doi":"10.48550/arxiv.1506.03691","title":"Global cycle properties in graphs with large minimum clustering\\n coefficient","year":2015,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph theory and applications","field":"Mathematics","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 Winnipeg; Manitoba Beekeepers' Association","funders":"","keywords":"Clustering coefficient; Cluster analysis; Combinatorics; Conjecture; Mathematics; Vertex (graph theory); Graph; Discrete mathematics; Statistics","score_opus":0.08271141094929806,"score_gpt":0.21090312826720217,"score_spread":0.12819171731790413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298281162","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.92820466,0.00050304126,0.054643363,0.0004109476,0.000019164705,0.000040016374,0.00056893425,0.00024083507,0.015369072],"genre_scores_gemma":[0.9880933,0.00027650513,0.0078058937,0.00008354889,0.000029237739,0.000070133676,0.0005875622,0.00008549023,0.0029683416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99972266,0.00004229621,0.000011073092,0.00010947432,0.00005626545,0.000058174654],"domain_scores_gemma":[0.99756867,0.0012070602,0.00039494483,0.00024443585,0.00030465334,0.0002802666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025567226,0.00032062945,0.00051867065,0.0015861169,0.0008567852,0.0012821966,0.00082073413,0.00055517984,0.0031172466],"category_scores_gemma":[0.0031782766,0.00040142,0.00033366506,0.0012073835,0.0013150608,0.0015126682,0.0008288817,0.00070257235,0.00033936877],"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.00045739638,0.00010469554,0.021048902,0.0006033955,0.00011024757,0.0011582603,0.0021118594,0.0830407,0.04895971,0.78493106,0.008886742,0.048586972],"study_design_scores_gemma":[0.00007058563,0.00010581757,0.014297437,0.000094702504,0.00008020468,0.0009840785,0.00080784643,0.20528819,0.012016408,0.7580726,0.008124148,0.000057874862],"about_ca_topic_score_codex":0.002330855,"about_ca_topic_score_gemma":0.0035015647,"teacher_disagreement_score":0.0031172466,"about_ca_system_score_codex":0.00081123185,"about_ca_system_score_gemma":0.0004374305,"threshold_uncertainty_score":0.01042819},"labels":[],"label_agreement":null},{"id":"W4298350926","doi":"","title":"Calcul de paramètres minimaux dans les graphes dynamiques.","year":2017,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Graph theory and applications","field":"Mathematics","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","score_opus":0.030062972622065406,"score_gpt":0.27689958730579606,"score_spread":0.24683661468373064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298350926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23501308,0.0032040754,0.71921504,0.0022916002,0.0004497383,0.00010560276,0.0007172463,0.0010352946,0.03796823],"genre_scores_gemma":[0.84735817,0.0019123254,0.12670064,0.000239401,0.0003069453,0.00031959443,0.0006253726,0.000825018,0.02171243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992693,0.00027958085,0.000017060494,0.00015724578,0.00021045946,0.000066384106],"domain_scores_gemma":[0.9935819,0.0051213605,0.00032334166,0.00026309412,0.00041824707,0.0002920948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017423956,0.0011831411,0.0013153715,0.003234427,0.0014749891,0.003219326,0.0014888992,0.0017820785,0.0064581847],"category_scores_gemma":[0.013644329,0.00086728815,0.0013097877,0.001605589,0.0028770387,0.0030663789,0.0011761244,0.004480015,0.00081027416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018197378,0.000107566426,0.0027851018,0.0004932518,0.00015450794,0.00040170344,0.00041210445,0.19875887,0.005706897,0.76095414,0.0039191647,0.026124785],"study_design_scores_gemma":[0.00005229938,0.000043817952,0.00240653,0.00008679985,0.000027434124,0.00023128379,0.00015647548,0.63707715,0.0026736162,0.3525428,0.0046559395,0.000045890876],"about_ca_topic_score_codex":0.008048995,"about_ca_topic_score_gemma":0.010348878,"teacher_disagreement_score":0.008048995,"about_ca_system_score_codex":0.0029228895,"about_ca_system_score_gemma":0.0011708534,"threshold_uncertainty_score":0.021604836},"labels":[],"label_agreement":null},{"id":"W4299358577","doi":"10.17615/b915-bb97","title":"Necessary and sufficient conditions for the N -representability of density functionals","year":2021,"lang":"en","type":"article","venue":"UNC Libraries","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"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; Canada Research Chairs","keywords":"Mathematics; Statistical physics; Applied mathematics; Physics","score_opus":0.060413633999762004,"score_gpt":0.31501005021798584,"score_spread":0.2545964162182238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299358577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10203945,0.0006552259,0.8402123,0.0036330982,0.0001848903,0.00025665364,0.00103942,0.0003014243,0.051677626],"genre_scores_gemma":[0.77203614,0.0011274496,0.2131263,0.0009257216,0.00034379578,0.0012561096,0.0011912915,0.00054911175,0.00944395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972066,0.0009900252,0.00019125476,0.0005051011,0.00070770376,0.00039927723],"domain_scores_gemma":[0.98834294,0.008035837,0.0010984414,0.0009851428,0.0010893882,0.00044833016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005967342,0.0010707276,0.0010578396,0.0016409454,0.001642858,0.0019323059,0.0017052306,0.002417159,0.00907318],"category_scores_gemma":[0.02089073,0.00080019794,0.0012919835,0.0008755086,0.004464642,0.0059383186,0.002893751,0.0041301614,0.0012226845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028043161,0.0000474062,0.00032061944,0.00008306688,0.000011491693,0.00019327908,0.00014541922,0.018493783,0.0024999212,0.97278184,0.0009491636,0.0044460106],"study_design_scores_gemma":[0.000022680786,0.000050840186,0.000325225,0.000076893375,0.000007127902,0.00017893051,0.00009902707,0.15040033,0.002847296,0.842938,0.0030223278,0.000031272662],"about_ca_topic_score_codex":0.0018652653,"about_ca_topic_score_gemma":0.0019233841,"teacher_disagreement_score":0.00907318,"about_ca_system_score_codex":0.0014321151,"about_ca_system_score_gemma":0.0019523575,"threshold_uncertainty_score":0.031558752},"labels":[],"label_agreement":null},{"id":"W4302064060","doi":"","title":"Homomorphisms of signed bipartite graphs","year":2013,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Graph theory and applications","field":"Mathematics","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; Homomorphism; Signed graph; Combinatorics; Computer science; Mathematics; Discrete mathematics; Graph","score_opus":0.026437626451797237,"score_gpt":0.25414381441333006,"score_spread":0.22770618796153283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4302064060","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49800947,0.0016128281,0.39531842,0.0032424948,0.0010856709,0.00019976059,0.00087546604,0.0012940962,0.09836181],"genre_scores_gemma":[0.9042231,0.0015614015,0.041963935,0.0010650977,0.0012392562,0.0002770862,0.0010655321,0.00043573818,0.048168838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988238,0.00040037354,0.000058059857,0.00035272606,0.00023928357,0.00012566142],"domain_scores_gemma":[0.99608266,0.001948872,0.0005247302,0.00030257608,0.00041812,0.00072304555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008651818,0.00066634757,0.0006778897,0.002374313,0.0014796236,0.003050815,0.001148953,0.001284543,0.012068354],"category_scores_gemma":[0.005542227,0.0005781691,0.000849794,0.0018053915,0.0019028019,0.0054136226,0.0024176901,0.0026626608,0.0016290303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006895208,0.000078573816,0.00032047555,0.000104836705,0.000010664593,0.00012905506,0.00045995857,0.0014101637,0.0022190565,0.974512,0.0023387936,0.018347556],"study_design_scores_gemma":[0.000018206903,0.000024713872,0.00025978446,0.000018291537,0.0000070178403,0.00015920671,0.00010579946,0.004524286,0.00057511695,0.99092144,0.0033722953,0.000013860529],"about_ca_topic_score_codex":0.0004722774,"about_ca_topic_score_gemma":0.0003609892,"teacher_disagreement_score":0.012068354,"about_ca_system_score_codex":0.0011730805,"about_ca_system_score_gemma":0.0006361788,"threshold_uncertainty_score":0.04037267},"labels":[],"label_agreement":null},{"id":"W4307695646","doi":"10.48550/arxiv.2205.08235","title":"Kemeny's constant for a graph with bridges","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph theory and applications","field":"Mathematics","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":"Constant (computer programming); Computation; Graph; Mathematics; Combinatorics; Discrete mathematics; Computer science; Algorithm","score_opus":0.12375704157605905,"score_gpt":0.2256312505839816,"score_spread":0.10187420900792254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307695646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17097223,0.004097616,0.74017394,0.0037600512,0.00046781762,0.00012054006,0.00069171016,0.0008408054,0.07887538],"genre_scores_gemma":[0.6950871,0.0024835041,0.27283952,0.00065213704,0.00039250677,0.000235934,0.00051278726,0.0008546826,0.02694185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926347,0.000110634515,0.00003377372,0.00022963676,0.00021134803,0.00015108554],"domain_scores_gemma":[0.9957231,0.0030076401,0.00027015287,0.0005175361,0.00032080285,0.00016062454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017160134,0.0008102699,0.00071705465,0.0024240909,0.0011494155,0.0015371902,0.002171277,0.0010030475,0.012326606],"category_scores_gemma":[0.0115475105,0.00032973438,0.0009125151,0.0018473637,0.002299642,0.009039254,0.0018371145,0.0028529288,0.0016421746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017839186,0.000051452258,0.0020184296,0.0003802507,0.00004838861,0.00017136446,0.0003966489,0.030190697,0.0072197313,0.871857,0.008045974,0.079441674],"study_design_scores_gemma":[0.000023366807,0.00004517828,0.0016723284,0.000079707184,0.000056302226,0.00023536032,0.00014046236,0.06828721,0.007916259,0.91083884,0.010657307,0.000047630387],"about_ca_topic_score_codex":0.0020530156,"about_ca_topic_score_gemma":0.0035801425,"teacher_disagreement_score":0.012326606,"about_ca_system_score_codex":0.0020937477,"about_ca_system_score_gemma":0.0011132355,"threshold_uncertainty_score":0.04123658},"labels":[],"label_agreement":null},{"id":"W4310826848","doi":"10.48550/arxiv.2212.02005","title":"On the Paley graph of a quadratic character","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph theory and applications","field":"Mathematics","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; Đại học Quốc gia Hà Nội","keywords":"Mathematics; Legendre symbol; Ramanujan's sum; Combinatorics; Quadratic equation; Character (mathematics); Modulo; Quadratic residue; Binary quadratic form; Discrete mathematics; Dirichlet distribution; Quadratic function; Mathematical analysis","score_opus":0.14108526282974368,"score_gpt":0.21861821609199844,"score_spread":0.07753295326225476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310826848","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7706396,0.0008404422,0.13476591,0.0024568243,0.0002277577,0.000037918006,0.00021657087,0.00024940993,0.09056552],"genre_scores_gemma":[0.9740892,0.0004728816,0.013099654,0.0003467233,0.00017454373,0.000032449527,0.00011600603,0.00009410272,0.011574391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996804,0.00011505195,0.0000072701823,0.00006486495,0.00007479173,0.000057580946],"domain_scores_gemma":[0.9990625,0.00047584818,0.00011343867,0.000103123115,0.000114769726,0.00013035025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041765903,0.00033517496,0.0003559751,0.0014064019,0.0012341823,0.0011183423,0.00049936393,0.00083205255,0.004606694],"category_scores_gemma":[0.0020098533,0.0002984065,0.00037675857,0.0007431648,0.0029103248,0.0022884824,0.0013771948,0.0013077398,0.00047068082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018751516,0.000006597629,0.00021729387,0.000023569968,0.0000033050007,0.00007993253,0.00012295734,0.0020007354,0.0013742573,0.99149674,0.00069709885,0.0039587817],"study_design_scores_gemma":[0.0000074021723,0.000013344957,0.00037169261,0.000014508848,0.000003979813,0.00016785348,0.000096866934,0.0142271435,0.0009137688,0.9813234,0.0028486731,0.000011358752],"about_ca_topic_score_codex":0.0006346572,"about_ca_topic_score_gemma":0.0005904895,"teacher_disagreement_score":0.004606694,"about_ca_system_score_codex":0.00071110466,"about_ca_system_score_gemma":0.00030135844,"threshold_uncertainty_score":0.0154109},"labels":[],"label_agreement":null},{"id":"W4313011639","doi":"10.1007/978-981-19-0957-3_14","title":"Correction to: Graphs and Matrices","year":2022,"lang":"en","type":"book-chapter","venue":"Texts and readings in mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"Queen's University","funders":"","keywords":"Computer science; Information retrieval","score_opus":0.024578644330862365,"score_gpt":0.280156515639812,"score_spread":0.2555778713089496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313011639","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.00018407531,0.0023305288,0.0020370297,0.06935782,0.8596475,0.00004532573,0.0025881543,0.0012741991,0.0625354],"genre_scores_gemma":[0.008114416,0.004230575,0.003137198,0.033804584,0.13669054,0.00014081475,0.0024259535,0.0028894346,0.8085665],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971418,0.0005226781,0.0002423307,0.00045584992,0.001411764,0.00022550664],"domain_scores_gemma":[0.9819834,0.0028266339,0.0005168543,0.0020776265,0.011821044,0.00077455095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019485849,0.0020027775,0.0018533469,0.0062878756,0.0044764606,0.0062844115,0.00273902,0.004524586,0.22211467],"category_scores_gemma":[0.030387355,0.0008634198,0.0010459328,0.0049701836,0.0029605182,0.005018823,0.002283998,0.007078255,0.123850435],"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.000007435459,0.0000020164111,0.000011746281,0.000049506496,0.0000017849936,0.00001435745,0.000014251358,0.000023299928,0.000010681156,0.0031473315,0.99292386,0.0037937772],"study_design_scores_gemma":[0.000007828329,0.0000037933023,0.00015309674,0.000075072334,0.0000059483664,0.0000627077,0.000036122197,0.00007797062,0.000071709364,0.0038316953,0.99566597,0.000008193744],"about_ca_topic_score_codex":0.019852923,"about_ca_topic_score_gemma":0.029200047,"teacher_disagreement_score":0.22211467,"about_ca_system_score_codex":0.0047542974,"about_ca_system_score_gemma":0.004911671,"threshold_uncertainty_score":0.7430476},"labels":[],"label_agreement":null},{"id":"W4315490050","doi":"10.46793/match.89-3.653a","title":"Some Relations Between Rank, Vertex Cover Number and Energy of Graph","year":2023,"lang":"en","type":"article","venue":"match Communications in Mathematical and in Computer Chemistry","topic":"Graph theory and applications","field":"Mathematics","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":"Concordia University; Sharif University of Technology","keywords":"Combinatorics; Vertex cover; Mathematics; Vertex (graph theory); Graph; Cover (algebra); Domination analysis; Discrete mathematics","score_opus":0.03701886311585235,"score_gpt":0.3042647453386594,"score_spread":0.26724588222280704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315490050","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6198124,0.016510705,0.2620169,0.004610328,0.00042602204,0.00008072936,0.0016594069,0.00034297188,0.09454043],"genre_scores_gemma":[0.96317315,0.004406473,0.022576611,0.00039005568,0.0005277211,0.000069069756,0.00059830985,0.00016330011,0.008095476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989549,0.00023808799,0.000049219136,0.00028123992,0.0002776097,0.0001990482],"domain_scores_gemma":[0.9923361,0.005601968,0.0007871317,0.00052195444,0.00043888384,0.00031391738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001032501,0.00071105955,0.00061700214,0.0027122935,0.00094578665,0.0014827655,0.0011801095,0.0010682696,0.0061349603],"category_scores_gemma":[0.010014341,0.0003334456,0.0006808852,0.0024999457,0.0021633427,0.004912643,0.0011208924,0.001656529,0.0005640459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038986542,0.00020321611,0.012357524,0.0009283309,0.00014101736,0.0006926675,0.00081094797,0.08621799,0.014882907,0.81155354,0.009236743,0.0625852],"study_design_scores_gemma":[0.000024267976,0.00018754708,0.009272264,0.0001539428,0.00010255467,0.0012181973,0.0003835598,0.15980679,0.006491005,0.8133071,0.008946833,0.000105976134],"about_ca_topic_score_codex":0.0006707953,"about_ca_topic_score_gemma":0.0008628676,"teacher_disagreement_score":0.0061349603,"about_ca_system_score_codex":0.0010553357,"about_ca_system_score_gemma":0.00034676943,"threshold_uncertainty_score":0.020523489},"labels":[],"label_agreement":null},{"id":"W4315642671","doi":"10.1016/j.laa.2023.01.002","title":"Signed spectral Turań type theorems","year":2023,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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":"Simon Fraser University","funders":"","keywords":"Signed graph; Mathematics; Combinatorics; Conjecture; Discrete mathematics; Adjacency matrix; Mathematical proof; Eigenvalues and eigenvectors; Clique number; Triangle-free graph; Chordal graph; Graph; 1-planar graph","score_opus":0.040589653757062055,"score_gpt":0.3185607623186688,"score_spread":0.2779711085616068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315642671","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13324027,0.0019719133,0.44171256,0.0051650587,0.0017445084,0.00006242811,0.0005961373,0.0010654138,0.41444182],"genre_scores_gemma":[0.85013574,0.0017081683,0.037499733,0.0022855015,0.001712197,0.00016426174,0.00042588942,0.0005515042,0.10551701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946827,0.00015220474,0.00002518594,0.000090526184,0.00019347036,0.00007032525],"domain_scores_gemma":[0.998755,0.00045108923,0.00017397343,0.00014675187,0.00028078305,0.00019251648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067844643,0.0007576647,0.0007359508,0.0026697437,0.0016734096,0.0031063582,0.0011088221,0.0011408046,0.016155018],"category_scores_gemma":[0.002487772,0.0003865173,0.0006730657,0.0024373005,0.0024383108,0.005832883,0.0023409943,0.0029174057,0.002235112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067709097,0.000008281167,0.000032614596,0.000014402556,0.0000019662066,0.000014640976,0.000040262126,0.00015552164,0.00017977813,0.99504834,0.0013912962,0.003106141],"study_design_scores_gemma":[0.0000038285534,0.0000045238216,0.00006544495,0.0000056864737,0.000003094313,0.000048117756,0.00003281327,0.0015447189,0.00024314264,0.99494594,0.0030967828,0.000005995508],"about_ca_topic_score_codex":0.00033017193,"about_ca_topic_score_gemma":0.00044263812,"teacher_disagreement_score":0.016155018,"about_ca_system_score_codex":0.0008602779,"about_ca_system_score_gemma":0.0004694853,"threshold_uncertainty_score":0.05404389},"labels":[],"label_agreement":null},{"id":"W4319792731","doi":"10.48550/arxiv.2302.03854","title":"Cospectral graphs obtained by edge deletion","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph theory and applications","field":"Mathematics","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; China Scholarship Council; University of Waterloo","keywords":"Mathematics; Laplacian matrix; Combinatorics; Adjacency matrix; Laplace operator; Adjacency list; Graph; Discrete mathematics; Matrix (chemical analysis); Mathematical analysis","score_opus":0.12261654321285359,"score_gpt":0.2255400170068856,"score_spread":0.10292347379403202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319792731","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7410169,0.00015911632,0.20667493,0.0004598961,0.00019627604,0.00011287223,0.0008388828,0.000878824,0.049662203],"genre_scores_gemma":[0.9047076,0.00024231274,0.07464626,0.0003827482,0.00009319405,0.0001609076,0.0024726202,0.0003027278,0.016991567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964654,0.00005243142,0.000015614924,0.00012710392,0.00009186192,0.00006638878],"domain_scores_gemma":[0.9992551,0.00018214513,0.00013503141,0.0002138816,0.0001145965,0.00009914587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017226413,0.00053849403,0.00027276506,0.0008125722,0.0008802501,0.00054786005,0.000664942,0.0004876746,0.005814998],"category_scores_gemma":[0.001238746,0.000255102,0.00045240208,0.0006886127,0.0005968465,0.0012181428,0.00091437704,0.0006617309,0.00081973715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046546778,0.00042232042,0.0047328435,0.00030231915,0.000092578375,0.0020349282,0.0010789725,0.036261,0.14052103,0.67762935,0.01648389,0.119975336],"study_design_scores_gemma":[0.00009591215,0.00016168338,0.00752494,0.000043788248,0.00011315578,0.00243026,0.0010126174,0.17567453,0.06087183,0.70333916,0.048660927,0.000071237395],"about_ca_topic_score_codex":0.0009469832,"about_ca_topic_score_gemma":0.0016155073,"teacher_disagreement_score":0.005814998,"about_ca_system_score_codex":0.00036459407,"about_ca_system_score_gemma":0.0003201386,"threshold_uncertainty_score":0.019453108},"labels":[],"label_agreement":null},{"id":"W4321474798","doi":"","title":"Strong uniform convergence of Laplacians of random geometric and directed kNN graphs on compact manifolds","year":2022,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Graph theory and applications","field":"Mathematics","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; Université du Québec à Montréal","funders":"","keywords":"Convergence (economics); Mathematics; Pure mathematics; Topology (electrical circuits); Combinatorics; Economics","score_opus":0.025286085837469222,"score_gpt":0.2647552746072061,"score_spread":0.23946918876973688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321474798","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7085459,0.000769471,0.2814009,0.001333161,0.000077491495,0.000074218995,0.00022204977,0.00034769773,0.007229135],"genre_scores_gemma":[0.97937727,0.0004657625,0.015559822,0.00013916197,0.000075971955,0.000113623806,0.00019802082,0.00009993519,0.003970306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992125,0.00032488606,0.000028899425,0.00017413164,0.00015962632,0.000099920566],"domain_scores_gemma":[0.9929436,0.0044168164,0.0009681458,0.00035673103,0.00061978115,0.00069489685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020808298,0.0007475729,0.00076134433,0.0021765013,0.0007220884,0.0012713633,0.0021284705,0.001071522,0.0017638543],"category_scores_gemma":[0.014909262,0.0006093534,0.0008428684,0.0006916631,0.0034923956,0.0024723245,0.002097039,0.0010114994,0.00023511946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018122187,0.000100286976,0.005056088,0.00026320195,0.000085677726,0.0005751985,0.0007144347,0.23660131,0.008204403,0.7385594,0.0017710824,0.0078876605],"study_design_scores_gemma":[0.000019348385,0.000036842073,0.0023115252,0.00002823837,0.00001114562,0.00016472358,0.00013153363,0.7982144,0.0010171803,0.1975833,0.00044257083,0.00003917975],"about_ca_topic_score_codex":0.003944511,"about_ca_topic_score_gemma":0.0029236,"teacher_disagreement_score":0.003944511,"about_ca_system_score_codex":0.0021831205,"about_ca_system_score_gemma":0.00061842863,"threshold_uncertainty_score":0.015839756},"labels":[],"label_agreement":null},{"id":"W4327525870","doi":"10.48550/arxiv.2303.07949","title":"Bordering of Symmetric Matrices and an Application to the Minimum Number of Distinct Eigenvalues for the Join of Graphs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph theory and applications","field":"Mathematics","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; Vlaamse regering; Fonds Wetenschappelijk Onderzoek; Villanova University; Javna Agencija za Raziskovalno Dejavnost RS; American Institute of Mathematics; National Science Foundation","keywords":"Eigenvalues and eigenvectors; Combinatorics; Join (topology); Mathematics; Graph; Inverse; Discrete mathematics; Physics; Geometry","score_opus":0.10936016798750088,"score_gpt":0.2748084065164901,"score_spread":0.1654482385289892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327525870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21034712,0.0005238771,0.7767871,0.00033881128,0.0000911313,0.000051822797,0.000057912715,0.00018871539,0.011613565],"genre_scores_gemma":[0.77498686,0.00047454183,0.21968631,0.000113000395,0.00018996223,0.00012377498,0.000086643464,0.00017894755,0.0041600405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989507,0.00036238035,0.000049243623,0.00026845047,0.00025558675,0.00011350639],"domain_scores_gemma":[0.9908682,0.0060139233,0.0009380111,0.0009253495,0.00053974823,0.00071487634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021908414,0.0004502763,0.0008040917,0.0013866561,0.0011751238,0.0014248142,0.0009984028,0.00087526755,0.0028402412],"category_scores_gemma":[0.00957549,0.0003869894,0.00069649244,0.0007780515,0.0033243848,0.0027374083,0.002390854,0.0018331829,0.00031397963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023956601,0.00008739754,0.0010576944,0.00009773938,0.0000191148,0.00016858322,0.0005394874,0.034983348,0.0330669,0.9035556,0.00089692365,0.025287716],"study_design_scores_gemma":[0.00002845095,0.000157591,0.00065731653,0.00002513135,0.000013516461,0.00019478088,0.00021884812,0.24696502,0.01092605,0.738063,0.002713486,0.000036884056],"about_ca_topic_score_codex":0.00033992843,"about_ca_topic_score_gemma":0.00043507884,"teacher_disagreement_score":0.0028402412,"about_ca_system_score_codex":0.00063992897,"about_ca_system_score_gemma":0.0003495389,"threshold_uncertainty_score":0.011586428},"labels":[],"label_agreement":null},{"id":"W4367048681","doi":"10.1016/j.disc.2023.113471","title":"The optimal bound on the 3-independence number obtainable from a polynomial-type method","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Discrete mathematics; Independent set; Distance-regular graph; Independence number; Graph; Wheel graph; Upper and lower bounds; Hamming graph; Cubic graph; Graph power; Line graph; Voltage graph; Hamming code; Algorithm","score_opus":0.05090655308444312,"score_gpt":0.35669398881691744,"score_spread":0.3057874357324743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367048681","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05804636,0.0037611092,0.72125345,0.009221827,0.0014270142,0.00017203345,0.001228578,0.0012357278,0.20365398],"genre_scores_gemma":[0.60387444,0.004583225,0.3271439,0.0031110945,0.002639682,0.0009336951,0.0016536536,0.0020591486,0.054001108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99638605,0.0012279908,0.0001080783,0.0006764277,0.00097523915,0.00062621385],"domain_scores_gemma":[0.9864529,0.010249223,0.0003810693,0.0015105742,0.0005519555,0.00085421064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004114311,0.0026126688,0.002284999,0.0026942627,0.0023123755,0.0035738545,0.005156215,0.0033233613,0.02560736],"category_scores_gemma":[0.018044723,0.0012595766,0.0023919882,0.0030731498,0.004903965,0.008477705,0.005755243,0.01234294,0.00551825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011172284,0.0003370694,0.00090982264,0.00083529606,0.0001274201,0.00014692325,0.00029970982,0.030676227,0.009832975,0.8634678,0.028736776,0.06351275],"study_design_scores_gemma":[0.00013218266,0.000077574165,0.0009322453,0.00012044278,0.00011384778,0.00014268451,0.000047358717,0.15505078,0.005384642,0.828789,0.009143665,0.00006554646],"about_ca_topic_score_codex":0.0017200197,"about_ca_topic_score_gemma":0.0036219626,"teacher_disagreement_score":0.02560736,"about_ca_system_score_codex":0.003075665,"about_ca_system_score_gemma":0.0026552824,"threshold_uncertainty_score":0.08566511},"labels":[],"label_agreement":null},{"id":"W4368248197","doi":"10.2139/ssrn.4436975","title":"Periodicity of Bipartite Walks on Biregular Graphs with Conditional Spectra","year":2023,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Graph theory and applications","field":"Mathematics","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 Waterloo","funders":"","keywords":"Quantum walk; Bipartite graph; Mathematics; Combinatorics; Eigenvalues and eigenvectors; Random walk; Discrete mathematics; Algebraic number; Self-avoiding walk; Edge-transitive graph; Unitary state; Voltage graph; Graph; Quantum; Line graph; Quantum computer; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.03398343548734662,"score_gpt":0.2945803558778947,"score_spread":0.2605969203905481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4368248197","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8419617,0.00043179505,0.13498716,0.0006933072,0.00014833207,0.000054780005,0.00062232,0.00044398732,0.020656662],"genre_scores_gemma":[0.9733786,0.00025357425,0.019416733,0.00018579386,0.00020082998,0.00009735817,0.0006042375,0.00018649438,0.0056763235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908745,0.00029158528,0.000043509575,0.00022207698,0.00016030608,0.00019510074],"domain_scores_gemma":[0.99370664,0.003326859,0.0011330479,0.00055384444,0.0004473526,0.0008322829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000937684,0.00050919264,0.0010223634,0.0021873293,0.0014197214,0.002227229,0.0014460876,0.0014437174,0.0070502097],"category_scores_gemma":[0.0062481095,0.0007999132,0.0007810162,0.0013930791,0.0020560152,0.0030939896,0.0012837925,0.0014738376,0.00080566126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026873077,0.000094139796,0.0018298927,0.000110547946,0.000022242613,0.0003075087,0.00042059927,0.0066603394,0.0050983964,0.97461617,0.0024031454,0.008168356],"study_design_scores_gemma":[0.000040705978,0.00003665864,0.0013775607,0.000026252821,0.000013499135,0.00021985137,0.0001395476,0.0582205,0.0007427578,0.938396,0.00076458085,0.000022107683],"about_ca_topic_score_codex":0.0010427982,"about_ca_topic_score_gemma":0.0012716176,"teacher_disagreement_score":0.0070502097,"about_ca_system_score_codex":0.0007673128,"about_ca_system_score_gemma":0.000581533,"threshold_uncertainty_score":0.02358532},"labels":[],"label_agreement":null},{"id":"W4376639658","doi":"10.1145/3564246.3585139","title":"Cheeger Inequalities for Directed Graphs and Hypergraphs using Reweighted Eigenvalues","year":2023,"lang":"en","type":"article","venue":"","topic":"Graph theory and applications","field":"Mathematics","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Eigenvalues and eigenvectors; Mathematics; Vertex (graph theory); Combinatorics; Directed graph; Undirected graph; Spectral theory; Spectral graph theory; Graph theory; Discrete mathematics; Computer science; Graph; Pure mathematics; Line graph","score_opus":0.14313047293003334,"score_gpt":0.36695875624611307,"score_spread":0.22382828331607973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376639658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014323508,0.0010181435,0.95787364,0.0007036967,0.00021633452,0.000050958362,0.00015476768,0.0000883011,0.025570702],"genre_scores_gemma":[0.5464137,0.004942244,0.4098252,0.001737941,0.0009467418,0.0006354218,0.00045111423,0.00059382786,0.034453806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986759,0.00046365883,0.00005925394,0.00023671081,0.00036817405,0.00019624054],"domain_scores_gemma":[0.99458367,0.003679412,0.00033809082,0.00032996238,0.00083832873,0.00023045852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002393667,0.0015449484,0.000901293,0.0034353489,0.0007841188,0.00187153,0.001940446,0.0016288721,0.007348139],"category_scores_gemma":[0.008088384,0.0004926477,0.0015363459,0.0020182598,0.0022385877,0.0059523555,0.0017721765,0.0046593715,0.0015592396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015364089,0.000022072401,0.00013362351,0.000078231446,0.000017929682,0.0000949091,0.00011581955,0.019427486,0.0026026901,0.9645871,0.0022522525,0.01065261],"study_design_scores_gemma":[0.000006291714,0.0000148575955,0.00013176596,0.00004610746,0.000011104704,0.00006747092,0.000054374774,0.14006251,0.00093355635,0.85582626,0.0028211065,0.000024616922],"about_ca_topic_score_codex":0.0015453876,"about_ca_topic_score_gemma":0.0020243246,"teacher_disagreement_score":0.007348139,"about_ca_system_score_codex":0.0020340898,"about_ca_system_score_gemma":0.0006988455,"threshold_uncertainty_score":0.024582028},"labels":[],"label_agreement":null},{"id":"W4377238405","doi":"10.1007/s10107-023-01967-z","title":"Total dual dyadicness and dyadic generating sets","year":2023,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Graph theory and applications","field":"Mathematics","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":"University of Waterloo","funders":"Office of Naval Research; Office of Naval Research Global; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Linear subspace; Matroid; Dual (grammatical number); Rational number; Joins; Discrete mathematics; Pure mathematics","score_opus":0.05686645443064241,"score_gpt":0.3363351452649714,"score_spread":0.27946869083432896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377238405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23819385,0.0011065204,0.5609727,0.0041310857,0.00045077776,0.000099207675,0.0009863278,0.00027894377,0.1937807],"genre_scores_gemma":[0.8647683,0.0010678014,0.0699181,0.00077081757,0.0004823409,0.0003075463,0.00089818775,0.00037694944,0.06141003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988194,0.00040078282,0.000050335122,0.00033955887,0.00021161605,0.00017825143],"domain_scores_gemma":[0.9961902,0.0017571938,0.000432482,0.00038565198,0.0007026255,0.0005317547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015635227,0.00079243263,0.0011350883,0.0029347367,0.002676984,0.00455747,0.0014626378,0.001280437,0.015673885],"category_scores_gemma":[0.0046351533,0.00086075754,0.0011864507,0.002746513,0.0033372894,0.0072866767,0.0031780484,0.0041015283,0.0012042307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040975215,0.0000044069584,0.000031199346,0.0000071979257,0.0000015614631,0.000007359652,0.000052257197,0.00010543276,0.000054725602,0.99864405,0.00027423253,0.00081340334],"study_design_scores_gemma":[0.00000535564,0.0000031389332,0.000036484893,0.000005227398,0.0000041356384,0.000033266762,0.00005637584,0.0011160736,0.00008192403,0.99722433,0.001430289,0.0000033534884],"about_ca_topic_score_codex":0.00088241504,"about_ca_topic_score_gemma":0.0009243679,"teacher_disagreement_score":0.015673885,"about_ca_system_score_codex":0.0015986505,"about_ca_system_score_gemma":0.000669059,"threshold_uncertainty_score":0.052434325},"labels":[],"label_agreement":null},{"id":"W4379185352","doi":"10.37236/11281","title":"Generalized Riemann Functions, Their Weights, and the Complete Graph","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Riemann hypothesis; Combinatorics; Rank (graph theory); Weight function; Graph; Function (biology); Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.024589569102364855,"score_gpt":0.26070422665529713,"score_spread":0.2361146575529323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379185352","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71229273,0.0017405263,0.19821079,0.0011382832,0.00018161713,0.000051042975,0.00041944225,0.00042146796,0.085544124],"genre_scores_gemma":[0.9458766,0.0008265907,0.029355897,0.00021351766,0.00017213609,0.000057520137,0.00030001238,0.00015963805,0.023037955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997316,0.000056304547,0.000008316785,0.000043921384,0.000093309885,0.00006652721],"domain_scores_gemma":[0.999468,0.00014477273,0.000083621344,0.00010599398,0.000087301516,0.00011024836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005423271,0.00064731744,0.00040376492,0.002656625,0.00060529663,0.0016593026,0.0007429923,0.00060340593,0.0035429515],"category_scores_gemma":[0.0023385722,0.0002320804,0.00043533268,0.0012821527,0.0020459818,0.0028634558,0.0011852499,0.00085717795,0.00061450794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017629243,0.000007172996,0.00034716376,0.000017373102,0.0000050027943,0.000035932906,0.000068801586,0.0038097752,0.00063366396,0.9844637,0.0007484841,0.009845292],"study_design_scores_gemma":[0.000005698046,0.000011806683,0.0005523516,0.000010896833,0.0000046579607,0.00004572856,0.00006447309,0.017965907,0.0007554299,0.9767502,0.0038186498,0.000014234735],"about_ca_topic_score_codex":0.001949688,"about_ca_topic_score_gemma":0.0018237664,"teacher_disagreement_score":0.0035429515,"about_ca_system_score_codex":0.0011833074,"about_ca_system_score_gemma":0.00048050992,"threshold_uncertainty_score":0.011852384},"labels":[],"label_agreement":null},{"id":"W4379383237","doi":"10.1016/j.laa.2023.05.029","title":"Kemeny's constant and Wiener index on trees","year":2023,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"National Research Foundation of Korea; Fields Institute for Research in Mathematical Sciences; College of Science, Sungkyunkwan University","keywords":"Mathematics; Constant (computer programming); Wiener index; Combinatorics; Mathematical proof; Relation (database); Tree (set theory); Discrete mathematics; Graph; Computer science; Data mining","score_opus":0.036137478054615285,"score_gpt":0.3080092982972199,"score_spread":0.2718718202426046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379383237","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4102385,0.018420555,0.26092884,0.00833818,0.0014039556,0.000080612306,0.0011337751,0.00072248874,0.298733],"genre_scores_gemma":[0.90587217,0.005701838,0.02411036,0.0006710022,0.0016395584,0.00008640116,0.00027434624,0.0003200142,0.061324168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989575,0.00021204958,0.000068701804,0.00025715886,0.00028488465,0.00021967894],"domain_scores_gemma":[0.9961659,0.0021746322,0.00044509582,0.00027873434,0.00035277588,0.00058290566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016229136,0.00084200624,0.0020225,0.0080299545,0.0027813653,0.004313916,0.0023159129,0.0015130406,0.010854872],"category_scores_gemma":[0.007966998,0.00081310543,0.0009848239,0.008611064,0.005114246,0.015330837,0.0038009626,0.0042455504,0.0014933142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001853508,0.000007767516,0.00010379668,0.000029538354,0.000005440263,0.000025510712,0.00016979403,0.00036266088,0.0002965695,0.99431145,0.00087819615,0.0037907893],"study_design_scores_gemma":[0.00000447817,0.0000042319607,0.00018489816,0.000009927083,0.000008050236,0.00004874673,0.00004695126,0.0012068679,0.00022689179,0.9961125,0.0021335448,0.000012808846],"about_ca_topic_score_codex":0.002329772,"about_ca_topic_score_gemma":0.0020937019,"teacher_disagreement_score":0.010854872,"about_ca_system_score_codex":0.0032924083,"about_ca_system_score_gemma":0.001086067,"threshold_uncertainty_score":0.036313176},"labels":[],"label_agreement":null},{"id":"W4379389000","doi":"10.1139/cjc-2022-0300","title":"A note on the use of rhombus silicate networks and rhombus oxide networks","year":2023,"lang":"en","type":"article","venue":"Canadian Journal of Chemistry","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Rhombus; Silicate; Chemistry; Oxygen; Oxide; Ion; Crystallography; Inorganic chemistry; Organic chemistry","score_opus":0.05020915350632212,"score_gpt":0.25542688442180367,"score_spread":0.20521773091548154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379389000","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06139415,0.12916572,0.2118211,0.2175435,0.016418438,0.00017593661,0.0010979697,0.0007782022,0.361605],"genre_scores_gemma":[0.6356808,0.09244933,0.15447222,0.026020152,0.018444093,0.0005924913,0.0005756231,0.00085416884,0.07091118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953395,0.0020010131,0.00033198076,0.0009351663,0.0011385093,0.00025385336],"domain_scores_gemma":[0.9788437,0.014429594,0.000788474,0.0032496944,0.0021415947,0.00054698385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005555449,0.0007249643,0.0011565742,0.00237059,0.0023460614,0.0040334356,0.0029113782,0.002291337,0.0052087875],"category_scores_gemma":[0.018575063,0.0004641281,0.0010123763,0.003071333,0.006017218,0.018901166,0.003742749,0.0038784698,0.0011992005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003569747,0.000015161241,0.00045873126,0.00023122312,0.000022722636,0.00009819459,0.00024389278,0.000744473,0.0006657229,0.9643128,0.012422749,0.02074863],"study_design_scores_gemma":[0.000011618457,0.000024528741,0.00036526445,0.00025069903,0.000018222667,0.00022359088,0.00019366441,0.003256773,0.001495621,0.8725995,0.12153032,0.000030258609],"about_ca_topic_score_codex":0.002283846,"about_ca_topic_score_gemma":0.0028690337,"teacher_disagreement_score":0.005555449,"about_ca_system_score_codex":0.0019525348,"about_ca_system_score_gemma":0.00089679274,"threshold_uncertainty_score":0.029380381},"labels":[],"label_agreement":null},{"id":"W4379743348","doi":"10.1016/j.laa.2023.06.004","title":"Sparsity of graphs that allow two distinct eigenvalues","year":2023,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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 Regina","funders":"Natural Sciences and Engineering Research Council of Canada; American Institute of Mathematics; National Science Foundation","keywords":"Mathematics; Combinatorics; Eigenvalues and eigenvectors; Graph; Characterization (materials science); Discrete mathematics","score_opus":0.06817175953016401,"score_gpt":0.33047220649875836,"score_spread":0.26230044696859434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379743348","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60575503,0.0006327079,0.3306513,0.0036905897,0.000328096,0.0000845777,0.0016237432,0.0006223624,0.056611534],"genre_scores_gemma":[0.96333414,0.00032424458,0.027102454,0.0005871972,0.00033491934,0.0001097406,0.0010250331,0.00019085039,0.0069915247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936956,0.00023868866,0.00002279153,0.00014725223,0.00012569808,0.00009607578],"domain_scores_gemma":[0.9941507,0.0034265139,0.0007538806,0.00073038647,0.00050753367,0.0004308773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070085004,0.00048343182,0.00077923277,0.0012473939,0.00061875914,0.0012093092,0.0007529638,0.0011744888,0.005556397],"category_scores_gemma":[0.0066301464,0.0004332958,0.00047174917,0.0010237021,0.0013823766,0.0028322453,0.0010408562,0.0017570207,0.00065379404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024414348,0.00013079989,0.0015719784,0.00018285935,0.000035899066,0.00028964537,0.00030019507,0.008659097,0.011004822,0.94538724,0.010167335,0.022025894],"study_design_scores_gemma":[0.000028169306,0.00003107629,0.0009403072,0.000024870234,0.000012625685,0.00025951536,0.00014269991,0.03885698,0.0014027033,0.95643723,0.0018433548,0.000020424439],"about_ca_topic_score_codex":0.00033042667,"about_ca_topic_score_gemma":0.00046378514,"teacher_disagreement_score":0.005556397,"about_ca_system_score_codex":0.00023992921,"about_ca_system_score_gemma":0.0003258211,"threshold_uncertainty_score":0.018588006},"labels":[],"label_agreement":null},{"id":"W4380791465","doi":"10.1090/stml/104/10","title":"The circle method and the Goldbach conjectures","year":2023,"lang":"en","type":"book-chapter","venue":"Student mathematical library","topic":"Graph theory and applications","field":"Mathematics","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":"Queen's University","funders":"","keywords":"Goldbach's conjecture; Mathematics; Art; Pure mathematics; Number theory","score_opus":0.02981831651331912,"score_gpt":0.32061291649621243,"score_spread":0.2907945999828933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380791465","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.012084688,0.009152683,0.04782902,0.006756574,0.0017489246,0.000025828,0.00016510344,0.0003486584,0.9218886],"genre_scores_gemma":[0.4051294,0.01468887,0.048272345,0.0028200396,0.0031382474,0.00014338581,0.00036644124,0.0007348144,0.5247065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954635,0.00015890657,0.000014516974,0.0000828626,0.00015201991,0.000045241573],"domain_scores_gemma":[0.9993217,0.00034377095,0.000034160494,0.00013911593,0.00010512505,0.00005611141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006547437,0.0006962486,0.00083441776,0.0017116227,0.0015393434,0.0025541284,0.00086835073,0.0013726321,0.021245776],"category_scores_gemma":[0.0026071975,0.00037541,0.0006401138,0.0014621406,0.004191815,0.004763516,0.0018493051,0.0028902187,0.005296486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004778528,0.0000025625106,0.000012114704,0.000018620389,0.0000012542976,0.000006473492,0.000037967806,0.00019438393,0.000047609767,0.9892258,0.005769442,0.004679023],"study_design_scores_gemma":[0.0000023377645,0.0000021109854,0.00003147959,0.000013219653,0.0000013906928,0.000019675841,0.00002356975,0.00064154604,0.00007676533,0.9810004,0.018184373,0.0000031200866],"about_ca_topic_score_codex":0.0016030609,"about_ca_topic_score_gemma":0.0015770857,"teacher_disagreement_score":0.021245776,"about_ca_system_score_codex":0.0017578055,"about_ca_system_score_gemma":0.00062826223,"threshold_uncertainty_score":0.07107419},"labels":[],"label_agreement":null},{"id":"W4380925393","doi":"10.5817/cz.muni.eurocomb23-048","title":"Cycles through two edges in signed graphs","year":2023,"lang":"en","type":"article","venue":"","topic":"Graph theory and applications","field":"Mathematics","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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Signed graph; Combinatorics; Sign (mathematics); Graph; Property (philosophy); Characterization (materials science); Computer science; Mathematics; Discrete mathematics; Physics; Philosophy; Mathematical analysis; Optics; Epistemology","score_opus":0.0929848992711429,"score_gpt":0.37326000010118293,"score_spread":0.28027510083004004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380925393","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66672665,0.0020962253,0.2671502,0.0018648312,0.0006725991,0.00017924716,0.00074238156,0.0004272231,0.060140625],"genre_scores_gemma":[0.945431,0.0015255098,0.039875973,0.00046943725,0.00024934,0.00022369181,0.0005931753,0.00013965808,0.011492211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990043,0.00022532365,0.00010018071,0.00025475162,0.00020257875,0.0002129435],"domain_scores_gemma":[0.9955552,0.0019869409,0.0009241177,0.00040175277,0.0006038983,0.00052809756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006260116,0.0006689251,0.0006341998,0.0022861485,0.0015793451,0.0023572138,0.00096539897,0.0017891072,0.005056919],"category_scores_gemma":[0.0067487094,0.00047431007,0.0007301783,0.0024723562,0.0023153012,0.0058434913,0.0022058527,0.0012431359,0.00076356187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019202133,0.00004897373,0.0017336444,0.00017281796,0.000027041217,0.0006692044,0.00081106095,0.0046543786,0.006194273,0.9578045,0.0028405383,0.02485154],"study_design_scores_gemma":[0.000034893128,0.000080936064,0.00079140434,0.00008831494,0.000042937743,0.0006085351,0.00042108618,0.017396076,0.0042917565,0.9619403,0.014245829,0.00005796239],"about_ca_topic_score_codex":0.0011125518,"about_ca_topic_score_gemma":0.0010089533,"teacher_disagreement_score":0.005056919,"about_ca_system_score_codex":0.00083961914,"about_ca_system_score_gemma":0.0005662574,"threshold_uncertainty_score":0.01691705},"labels":[],"label_agreement":null},{"id":"W4381382709","doi":"10.1137/22m150767x","title":"The Spectrum of Triangle-Free Graphs","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky; Beckman Institute for Advanced Science and Technology, University of Illinois, Urbana-Champaign; Simons Foundation; National Science Foundation","keywords":"Combinatorics; Mathematics; Discrete mathematics; Vertex (graph theory); Bipartite graph; Conjecture; Triangle-free graph; Upper and lower bounds; Graph; Line graph; Graph power","score_opus":0.042926857678239116,"score_gpt":0.316427439417595,"score_spread":0.2735005817393559,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381382709","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7878163,0.0011619014,0.11189828,0.0014971675,0.00021330963,0.000049867092,0.0008688177,0.00032152692,0.09617292],"genre_scores_gemma":[0.9834915,0.00041686895,0.006860522,0.00014616014,0.00010652488,0.000038375703,0.00042276888,0.000059614056,0.008457692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997435,0.00003440776,0.000008268012,0.000058829635,0.000090066475,0.000064927546],"domain_scores_gemma":[0.99933213,0.00025412245,0.00009823911,0.000064581676,0.00010873653,0.00014211892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002102759,0.00034125388,0.0001893612,0.0014223218,0.0006182003,0.0009802941,0.0005900869,0.00044471258,0.012280092],"category_scores_gemma":[0.0015229327,0.00016415447,0.0002415186,0.00080308237,0.001072669,0.0014492336,0.0009359738,0.0004925644,0.00088417367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000924452,0.000025863816,0.00094917195,0.00008301447,0.000007818814,0.00017047992,0.00035249957,0.0030932124,0.006439978,0.96349204,0.0039969003,0.021296624],"study_design_scores_gemma":[0.000020589037,0.000029888355,0.0014113326,0.000026027206,0.0000047207245,0.00027133155,0.00018709105,0.030825334,0.0022380746,0.95875907,0.0062150247,0.000011399727],"about_ca_topic_score_codex":0.0011610908,"about_ca_topic_score_gemma":0.000714965,"teacher_disagreement_score":0.012280092,"about_ca_system_score_codex":0.0006316286,"about_ca_system_score_gemma":0.00020201287,"threshold_uncertainty_score":0.04108095},"labels":[],"label_agreement":null},{"id":"W4383041039","doi":"10.1142/s0219498825500033","title":"On (distance) Laplacian characteristic polynomials of power graphs","year":2023,"lang":"en","type":"article","venue":"Journal of Algebra and Its Applications","topic":"Graph theory and applications","field":"Mathematics","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Laplace operator; Combinatorics; Characteristic polynomial; Discrete mathematics; Pure mathematics; Polynomial; Mathematical analysis","score_opus":0.023456976945466685,"score_gpt":0.2993328147377801,"score_spread":0.27587583779231345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383041039","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7094486,0.0012346697,0.1735599,0.00199491,0.00031779995,0.00004209332,0.00033786343,0.00020975387,0.112854406],"genre_scores_gemma":[0.9856507,0.00076741975,0.005671289,0.00012251012,0.0002791996,0.000020358853,0.00009359206,0.00004366829,0.007351305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964535,0.00006867853,0.0000075109356,0.00007533501,0.00010623636,0.000096911856],"domain_scores_gemma":[0.9980672,0.0010080456,0.00026639676,0.000100573474,0.0003053345,0.00025255032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056966674,0.0005432835,0.00033513474,0.0021032868,0.0006703432,0.0014028236,0.0005835876,0.00042819802,0.006351142],"category_scores_gemma":[0.0050255735,0.00019990059,0.0002950567,0.0015692628,0.002637534,0.0026750178,0.0012198427,0.0014619672,0.0008292102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000480456,0.000016618153,0.00043747394,0.0000458911,0.0000029157907,0.00010355813,0.00020879056,0.0047355387,0.002043285,0.981614,0.0011278256,0.00961606],"study_design_scores_gemma":[0.000010567554,0.000024779498,0.0006676429,0.000018408307,0.000004714219,0.00014306666,0.000140658,0.022114426,0.0011053631,0.9738173,0.0019332941,0.000019917283],"about_ca_topic_score_codex":0.001669231,"about_ca_topic_score_gemma":0.0012721531,"teacher_disagreement_score":0.006351142,"about_ca_system_score_codex":0.001062817,"about_ca_system_score_gemma":0.00051384827,"threshold_uncertainty_score":0.021246672},"labels":[],"label_agreement":null},{"id":"W4384007477","doi":"10.1016/j.laa.2023.07.006","title":"Fractional revival between twin vertices","year":2023,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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 Manitoba","funders":"University of Manitoba","keywords":"Mathematics; Combinatorics; Adjacency list; Adjacency matrix; Graph; Laplacian matrix; Characterization (materials science); Physics","score_opus":0.06335148418905781,"score_gpt":0.3484085412428338,"score_spread":0.28505705705377604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384007477","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55438083,0.0013649631,0.16352734,0.0038960685,0.0028827183,0.00012189777,0.00031266495,0.0008702935,0.27264324],"genre_scores_gemma":[0.941896,0.00034624996,0.016149146,0.0006851056,0.00055058504,0.00007263069,0.00015053764,0.00041448558,0.039735135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993032,0.000147302,0.000028755452,0.00014323162,0.00019199896,0.0001854561],"domain_scores_gemma":[0.99834967,0.00042341952,0.00016658109,0.00052045344,0.00021806663,0.00032179052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091704604,0.00053738727,0.0015940078,0.0025438853,0.0035478903,0.004083149,0.0016031396,0.0023147373,0.016328214],"category_scores_gemma":[0.005171618,0.00058242213,0.0011023486,0.0014270894,0.0032995278,0.006374171,0.0035080195,0.0037855299,0.0012288627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037687314,0.000013761402,0.00004519473,0.000016054055,0.000004216955,0.000044671007,0.000090149144,0.00038304724,0.00056101213,0.9962495,0.00061835465,0.0019364086],"study_design_scores_gemma":[0.000009467683,0.0000104100845,0.00005686269,0.000010454416,0.0000047894355,0.00007690367,0.00009487013,0.003802585,0.00044502047,0.9936884,0.0017921493,0.000008117686],"about_ca_topic_score_codex":0.000803789,"about_ca_topic_score_gemma":0.00073149183,"teacher_disagreement_score":0.016328214,"about_ca_system_score_codex":0.0012387849,"about_ca_system_score_gemma":0.0007007739,"threshold_uncertainty_score":0.054623306},"labels":[],"label_agreement":null},{"id":"W4384918760","doi":"10.48550/arxiv.2307.09663","title":"Spectral Applications of Vertex-Clique Incidence Matrices Associated with a Graph","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph theory and applications","field":"Mathematics","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":"Combinatorics; Mathematics; Clique graph; Block graph; Discrete mathematics; Split graph; Line graph; Simplex graph; Vertex (graph theory); Spectral graph theory; Graph power; Graph; Pathwidth","score_opus":0.08955239206976333,"score_gpt":0.2276439287051913,"score_spread":0.13809153663542795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384918760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123700015,0.00056609913,0.8399446,0.00079696876,0.0002157951,0.000051510837,0.00017207557,0.0002533869,0.03429951],"genre_scores_gemma":[0.8969959,0.00064205093,0.09555649,0.00026529926,0.000508362,0.000108364184,0.00019888843,0.00013379328,0.0055908123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989813,0.00030228536,0.00003466857,0.00020056203,0.00036021552,0.00012089044],"domain_scores_gemma":[0.9964013,0.0022124655,0.0004362159,0.00033067196,0.00034694566,0.00027241197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008365733,0.0008070478,0.00046327568,0.0023122774,0.0009995954,0.0016325224,0.00082834467,0.00077125535,0.005011468],"category_scores_gemma":[0.0060334736,0.00031965127,0.0004968442,0.0013167465,0.0021332034,0.0023686602,0.001624537,0.0016529605,0.00052537624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032733922,0.000028867922,0.0004952409,0.000044716413,0.000009395963,0.00010788744,0.0002031208,0.018062769,0.003570219,0.9681074,0.0007619809,0.008575683],"study_design_scores_gemma":[0.0000063740645,0.0000282114,0.00053478015,0.000024742194,0.0000070365977,0.00023664044,0.00014691308,0.16734263,0.0021376738,0.8261034,0.0034122157,0.000019530267],"about_ca_topic_score_codex":0.0007279706,"about_ca_topic_score_gemma":0.0008023978,"teacher_disagreement_score":0.005011468,"about_ca_system_score_codex":0.00093457295,"about_ca_system_score_gemma":0.00042695896,"threshold_uncertainty_score":0.016765058},"labels":[],"label_agreement":null},{"id":"W4384927394","doi":"10.20944/preprints202307.1338.v1","title":"Spectral Applications of Vertex-Clique Incidence Matrices Associated with a Graph","year":2023,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"Graph theory and applications","field":"Mathematics","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 Regina","funders":"","keywords":"Combinatorics; Mathematics; Clique graph; Block graph; Discrete mathematics; Split graph; Line graph; Simplex graph; Vertex (graph theory); Spectral graph theory; Graph power; Graph; Pathwidth","score_opus":0.1344864537288776,"score_gpt":0.37173716112056054,"score_spread":0.23725070739168294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384927394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0993061,0.0005699962,0.86764234,0.0007328062,0.00021418472,0.000046279325,0.00014828236,0.00023954631,0.031100487],"genre_scores_gemma":[0.8814027,0.00073275337,0.11006065,0.0003164916,0.00059708767,0.00011590492,0.00019902264,0.00015760318,0.006417711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998982,0.00030359198,0.00003564086,0.00020409646,0.00035559566,0.00011901891],"domain_scores_gemma":[0.99624795,0.0023011675,0.0004331694,0.00035659486,0.00036508834,0.00029607725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008444472,0.0008572037,0.00047044756,0.002164705,0.00093843695,0.0015931717,0.0009084438,0.0007851637,0.005066342],"category_scores_gemma":[0.0060046087,0.000317725,0.00050646474,0.0012487473,0.002068922,0.0024019387,0.0016864641,0.0017074692,0.00055629294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032000306,0.000029375942,0.00043150634,0.000045120178,0.000009796543,0.00010636548,0.0001950548,0.018799076,0.003641462,0.9672948,0.0008063514,0.008609046],"study_design_scores_gemma":[0.0000065125573,0.000029824154,0.0004647019,0.000024986502,0.0000070770247,0.00022142082,0.00013470731,0.1720005,0.002112938,0.8214306,0.0035470605,0.000019669671],"about_ca_topic_score_codex":0.00074388506,"about_ca_topic_score_gemma":0.0008439839,"teacher_disagreement_score":0.005066342,"about_ca_system_score_codex":0.00093972,"about_ca_system_score_gemma":0.00041765484,"threshold_uncertainty_score":0.01694858},"labels":[],"label_agreement":null},{"id":"W4385691834","doi":"10.4153/s0008414x23000482","title":"Simple eigenvalues of cubic vertex-transitive graphs","year":2023,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Eigenvalues and eigenvectors; Lambda; Combinatorics; Vertex (graph theory); Transitive relation; Multiplicity (mathematics); Automorphism; Simple (philosophy); Simple graph; Graph; Discrete mathematics; Mathematical analysis; Physics; Quantum mechanics","score_opus":0.050002317898272634,"score_gpt":0.29988881796283906,"score_spread":0.24988650006456642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385691834","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9197223,0.00009538102,0.03976037,0.00027507078,0.00009277351,0.00004342765,0.00014500508,0.00032259416,0.039543096],"genre_scores_gemma":[0.9924779,0.000034216522,0.004172417,0.000024122268,0.000026133133,0.00001892956,0.000040393843,0.000029456229,0.003176462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999602,0.00006537818,0.000015991096,0.00006029471,0.0001492593,0.000107035325],"domain_scores_gemma":[0.9988673,0.00034046164,0.0002147615,0.00009452187,0.00018206089,0.00030087243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026708527,0.00033071596,0.00033481538,0.0017839916,0.000860849,0.001014024,0.00040048567,0.00044679083,0.0063089035],"category_scores_gemma":[0.0016311723,0.00021766018,0.00028240323,0.0005947248,0.0013126126,0.00083749014,0.00064004393,0.0005131843,0.00039979865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012800851,0.000046844358,0.0018753539,0.00009309887,0.00001720506,0.0005475193,0.000466853,0.0066757374,0.015350882,0.9648153,0.0022999875,0.0076832105],"study_design_scores_gemma":[0.00003377187,0.00004552665,0.0019548985,0.000018644585,0.000009510579,0.0004361754,0.00035238263,0.043013725,0.005357597,0.9460777,0.0026671465,0.00003287478],"about_ca_topic_score_codex":0.0014817266,"about_ca_topic_score_gemma":0.0019760928,"teacher_disagreement_score":0.0063089035,"about_ca_system_score_codex":0.0008111974,"about_ca_system_score_gemma":0.00035865628,"threshold_uncertainty_score":0.021105409},"labels":[],"label_agreement":null},{"id":"W4386030634","doi":"10.3390/math11163595","title":"Spectral Applications of Vertex-Clique Incidence Matrices Associated with a Graph","year":2023,"lang":"en","type":"article","venue":"Mathematics","topic":"Graph theory and applications","field":"Mathematics","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 Regina","funders":"","keywords":"Combinatorics; Incidence matrix; Adjacency matrix; Mathematics; Eigenvalues and eigenvectors; Vertex (graph theory); Laplacian matrix; Split graph; Incidence (geometry); Discrete mathematics; Clique number; Chordal graph; Clique; Graph; 1-planar graph; Physics","score_opus":0.028254752463520792,"score_gpt":0.2970171236034608,"score_spread":0.26876237113994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386030634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2289208,0.00037255778,0.72603947,0.000654466,0.00021024799,0.00006232143,0.0001698942,0.00024142505,0.043328807],"genre_scores_gemma":[0.93372905,0.00042356216,0.059302885,0.00014674368,0.00029532035,0.00008132059,0.00014365079,0.00009988124,0.0057774945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991366,0.0002705661,0.00003369252,0.00014995881,0.00028759998,0.000121505574],"domain_scores_gemma":[0.996451,0.0020976253,0.00041143154,0.0003482811,0.0003787766,0.00031272758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008629461,0.0008190532,0.00043132447,0.002289371,0.0010479784,0.0019269686,0.0009950992,0.00090230815,0.0049061505],"category_scores_gemma":[0.007048047,0.00035024437,0.0006027478,0.001399759,0.0019387631,0.0020783206,0.0018033785,0.0014231015,0.0005533751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046710808,0.000046041216,0.0006687592,0.00004586609,0.000013535796,0.00014766019,0.0002255342,0.027770255,0.004932067,0.9562216,0.0006849018,0.00919704],"study_design_scores_gemma":[0.000007257406,0.00002563026,0.0004486651,0.000026527914,0.000009069898,0.00023195578,0.00014562301,0.23657438,0.0028560737,0.75789696,0.0017588342,0.000018963998],"about_ca_topic_score_codex":0.0005960032,"about_ca_topic_score_gemma":0.00088926754,"teacher_disagreement_score":0.0049061505,"about_ca_system_score_codex":0.00083162525,"about_ca_system_score_gemma":0.00045666815,"threshold_uncertainty_score":0.016412675},"labels":[],"label_agreement":null},{"id":"W4386789972","doi":"10.1016/j.laa.2023.09.012","title":"Regular graphs of degree at most four that allow two distinct eigenvalues","year":2023,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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 Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Villanova University; American Institute of Mathematics; College of Liberal Arts, Rochester Institute of Technology; Fort Lewis College; National Science Foundation","keywords":"Mathematics; Combinatorics; Eigenvalues and eigenvectors; Degree (music); Strongly regular graph; Inverse; Discrete mathematics; Graph; Regular graph; Pathwidth; Line graph; Graph power","score_opus":0.09503327023489623,"score_gpt":0.32055760056328464,"score_spread":0.22552433032838842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386789972","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70308214,0.0005356231,0.15946697,0.0025724503,0.0005125326,0.00018086497,0.001463049,0.001873273,0.13031313],"genre_scores_gemma":[0.95384216,0.00023689728,0.029648002,0.00038254855,0.00012715656,0.00014928449,0.0005527773,0.00020862055,0.014852602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915135,0.0001911016,0.00003375837,0.00023560118,0.00013580175,0.00025241077],"domain_scores_gemma":[0.99686,0.0012742112,0.0005352597,0.00064710923,0.00029469046,0.00038871588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005735272,0.0009789873,0.0010320093,0.0016572295,0.0018156924,0.0018095425,0.0012963667,0.0013298499,0.008905165],"category_scores_gemma":[0.0035859665,0.000624392,0.0007459561,0.0013746729,0.0017719817,0.002654511,0.0014261262,0.001919263,0.0018244339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004555293,0.00020922747,0.0017515762,0.00024848935,0.00007583211,0.0008316262,0.0006529109,0.0038996888,0.023165822,0.9377995,0.00969661,0.021213219],"study_design_scores_gemma":[0.00008375026,0.0000658229,0.0009139297,0.00004727099,0.000058984693,0.0006685401,0.0005078179,0.009573108,0.007015728,0.97108847,0.009922047,0.00005443863],"about_ca_topic_score_codex":0.00036549903,"about_ca_topic_score_gemma":0.00066147425,"teacher_disagreement_score":0.008905165,"about_ca_system_score_codex":0.00045428603,"about_ca_system_score_gemma":0.0004731371,"threshold_uncertainty_score":0.02979076},"labels":[],"label_agreement":null},{"id":"W4387878556","doi":"10.4153/s000843952300084x","title":"Some results on various types of compactness of weak<sup>*</sup> Dunford–Pettis operators on Banach lattices","year":2023,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dedekind cut; Compact space; Order (exchange); Banach space; Pure mathematics; Prime (order theory); Operator (biology); Discrete mathematics; Combinatorics","score_opus":0.032330493704465994,"score_gpt":0.28146708896327094,"score_spread":0.24913659525880494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387878556","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72136396,0.002991931,0.21375534,0.0034087573,0.00024848644,0.00007017443,0.00024863577,0.00016311966,0.05774956],"genre_scores_gemma":[0.9690289,0.00069631875,0.02130436,0.00027963374,0.00024002453,0.000097339485,0.00012748312,0.00006237681,0.008163597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761224,0.00081640866,0.0002281889,0.00040251185,0.0007139627,0.00022676797],"domain_scores_gemma":[0.9892966,0.0064020297,0.0013466054,0.0007260513,0.0011833544,0.0010453622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046590865,0.0007729344,0.0008841884,0.00237677,0.0017453016,0.0033262433,0.0011852544,0.0012848837,0.005069612],"category_scores_gemma":[0.009911601,0.0007014628,0.0012044774,0.0015858767,0.006717887,0.007647075,0.004259721,0.0024733879,0.00033379675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011771971,0.00003187282,0.0013413234,0.00014675473,0.000027342097,0.0003511294,0.0009600608,0.0025109455,0.005513428,0.98285574,0.0005952413,0.0055484152],"study_design_scores_gemma":[0.000037288784,0.00018764137,0.0031719478,0.00009162334,0.000033288088,0.0012136061,0.0011017952,0.04762671,0.007616171,0.9313263,0.007527616,0.00006602202],"about_ca_topic_score_codex":0.0007912061,"about_ca_topic_score_gemma":0.00052301865,"teacher_disagreement_score":0.005069612,"about_ca_system_score_codex":0.0019569993,"about_ca_system_score_gemma":0.00062873424,"threshold_uncertainty_score":0.024639904},"labels":[],"label_agreement":null},{"id":"W4387972686","doi":"10.18280/mmep.100529","title":"Analysis of Sombor and Harmonic Indices of Thorn Cog-Graphs","year":2023,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cog; Mathematics; Harmonic; Econometrics; Statistics; Computer science; Physics; Artificial intelligence; Acoustics","score_opus":0.05273696176157248,"score_gpt":0.2713169317201845,"score_spread":0.21857996995861204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387972686","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5113811,0.0012304616,0.46108097,0.0004584407,0.00009286604,0.00010622022,0.00061918213,0.00024500658,0.024785772],"genre_scores_gemma":[0.94914544,0.0006804493,0.044256046,0.00009656334,0.00010616752,0.0000762107,0.00053473783,0.0000947109,0.005009655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996815,0.00006547585,0.000013061668,0.000075034135,0.000106123436,0.00005878258],"domain_scores_gemma":[0.99720734,0.0013684147,0.00054557953,0.0002057509,0.0003679724,0.00030499118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006209938,0.00040706445,0.00045847567,0.003122133,0.00079215673,0.0012375207,0.0007798519,0.00057194603,0.0039435728],"category_scores_gemma":[0.0049520023,0.00024869392,0.0005088215,0.0012429791,0.0016317966,0.002126795,0.00082906015,0.00089676416,0.00041814166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010581079,0.00006182599,0.0070261704,0.00018382783,0.000040689058,0.00029856505,0.00037819083,0.064827055,0.0054507493,0.87949425,0.0025642868,0.03956856],"study_design_scores_gemma":[0.000012454786,0.00007405714,0.0058538625,0.000051384744,0.000024983241,0.000340112,0.000273418,0.3610156,0.0017669591,0.6258664,0.00467979,0.000040883657],"about_ca_topic_score_codex":0.0010493906,"about_ca_topic_score_gemma":0.0013035472,"teacher_disagreement_score":0.0039435728,"about_ca_system_score_codex":0.0010338854,"about_ca_system_score_gemma":0.0005556277,"threshold_uncertainty_score":0.013192534},"labels":[],"label_agreement":null},{"id":"W4388655331","doi":"10.3390/sym15112061","title":"The Chromatic Entropy of Linear Supertrees and Its Application","year":2023,"lang":"en","type":"article","venue":"Symmetry","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Higher Education Discipline Innovation Project; Natural Science Foundation of Qinghai; National Natural Science Foundation of China","keywords":"Supertree; Chromatic scale; Entropy (arrow of time); Mathematics; Combinatorics; Graph; Discrete mathematics; Biology; Physics; Thermodynamics; Phylogenetic tree","score_opus":0.025697226519468267,"score_gpt":0.30553649767392205,"score_spread":0.2798392711544538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388655331","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5553674,0.0047610253,0.39667606,0.0011750715,0.00021105737,0.00005937223,0.00039824002,0.00018498373,0.041166674],"genre_scores_gemma":[0.97870755,0.001338687,0.016971262,0.00008011764,0.00011738978,0.00003284264,0.00011580526,0.000035319354,0.002601017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979144,0.00006351558,0.000007874871,0.000045236873,0.000054321637,0.000037629543],"domain_scores_gemma":[0.9988404,0.0006388198,0.0001818027,0.000087757886,0.00013930218,0.00011186522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046522726,0.0003116145,0.00034898266,0.0016641706,0.0005986671,0.0006992555,0.0005540155,0.0004456118,0.001807228],"category_scores_gemma":[0.0023291782,0.00016484021,0.00038659817,0.0009704733,0.0014520191,0.0014204978,0.0008783533,0.0006022316,0.00016560429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006001634,0.0000368618,0.0018657204,0.00012534847,0.000022096998,0.0001502484,0.00017596116,0.1074809,0.007098082,0.8671969,0.0013576739,0.014430175],"study_design_scores_gemma":[0.000005528881,0.000029999537,0.001283885,0.000023820381,0.000007807255,0.00011888163,0.00006815681,0.47532713,0.001418509,0.5203575,0.0013268202,0.00003196868],"about_ca_topic_score_codex":0.0011021328,"about_ca_topic_score_gemma":0.00078177196,"teacher_disagreement_score":0.001807228,"about_ca_system_score_codex":0.0009124342,"about_ca_system_score_gemma":0.00041853767,"threshold_uncertainty_score":0.0066201687},"labels":[],"label_agreement":null},{"id":"W4389937051","doi":"10.1016/j.jpaa.2023.107589","title":"Asymptotic behavior of Markov complexity","year":2023,"lang":"en","type":"article","venue":"Journal of Pure and Applied Algebra","topic":"Graph theory and applications","field":"Mathematics","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":"Israel Science Foundation; Ontario Ministry of Research, Innovation and Science; Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii; Corporation for National and Community Service","keywords":"Mathematics; Markov chain; Rank (graph theory); Bounded function; Integer (computer science); Combinatorics; Contrast (vision); Value (mathematics); Discrete mathematics; Matrix (chemical analysis); Markov process; Statistics; Computer science; Mathematical analysis; Artificial intelligence","score_opus":0.04720625965754912,"score_gpt":0.30319923556856854,"score_spread":0.25599297591101944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389937051","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67927873,0.0034245122,0.176091,0.018858291,0.0005330534,0.000104774976,0.0009105378,0.001844993,0.11895409],"genre_scores_gemma":[0.98421174,0.0007476153,0.006659147,0.0005791788,0.0007256328,0.00010778937,0.00034370198,0.00028357987,0.0063416557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99725074,0.0011279011,0.000090229936,0.00039561387,0.00068840315,0.00044701513],"domain_scores_gemma":[0.9214003,0.060899325,0.003998631,0.0041373936,0.0044442965,0.005120071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050572194,0.0008296892,0.0023577902,0.0049816216,0.0027731103,0.005169489,0.0034299267,0.0031759162,0.013562928],"category_scores_gemma":[0.06800002,0.0011403196,0.0011388498,0.0022021155,0.0073418464,0.0120484885,0.0049819695,0.0051278872,0.00088932045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063797655,0.0000500135,0.00084599975,0.000068444446,0.000025444857,0.000061534265,0.00013843534,0.0059966515,0.00052000955,0.98825336,0.0020116891,0.0019645721],"study_design_scores_gemma":[0.000024098248,0.000017827153,0.0009053864,0.00003722584,0.000014812501,0.00010318249,0.000055669945,0.081805415,0.0002563141,0.91626644,0.00048372697,0.000029935947],"about_ca_topic_score_codex":0.0028528203,"about_ca_topic_score_gemma":0.0023427824,"teacher_disagreement_score":0.013562928,"about_ca_system_score_codex":0.0041538114,"about_ca_system_score_gemma":0.0025596581,"threshold_uncertainty_score":0.045372486},"labels":[],"label_agreement":null},{"id":"W4390092862","doi":"10.48550/arxiv.2312.13201","title":"On Kemeny's constant and stochastic complement","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph theory and applications","field":"Mathematics","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; Gruppo Nazionale per il Calcolo Scientifico; Division of Mathematical Sciences; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Constant (computer programming); Complement (music); Markov chain; Combinatorics; Mathematics; Kronecker delta; Discrete mathematics; Computation; Matrix (chemical analysis); Algorithm; Computer science; Statistics; Physics","score_opus":0.2179687238825011,"score_gpt":0.24888431954924342,"score_spread":0.030915595666742318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390092862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06540738,0.0012518978,0.9134974,0.0007580355,0.00011671957,0.000057610465,0.00019247475,0.0004567007,0.01826182],"genre_scores_gemma":[0.7833613,0.0016582435,0.20364471,0.00032644562,0.00020692225,0.00020787143,0.00023849017,0.00030472362,0.010051312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990876,0.0002753551,0.000031138727,0.00019411343,0.00025638496,0.00015542824],"domain_scores_gemma":[0.9897078,0.008109753,0.00045811868,0.00085723604,0.000533851,0.00033321613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023521439,0.0012328142,0.00077049393,0.0023966213,0.000846123,0.0014261085,0.001540504,0.00078650867,0.00465002],"category_scores_gemma":[0.022549551,0.00046084262,0.0007952698,0.0020910266,0.0045078257,0.004175779,0.002472982,0.0027863241,0.0009953822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002860896,0.000051658695,0.0013824814,0.00014218822,0.000040101324,0.0001354587,0.00027765974,0.19193715,0.003077813,0.74594694,0.0034811953,0.053241324],"study_design_scores_gemma":[0.000019551644,0.000051074014,0.00044050458,0.000046636833,0.000016044078,0.00008667905,0.00006175697,0.43910688,0.0035765362,0.55404073,0.002516111,0.00003751652],"about_ca_topic_score_codex":0.0041136118,"about_ca_topic_score_gemma":0.0036957364,"teacher_disagreement_score":0.00465002,"about_ca_system_score_codex":0.0025814725,"about_ca_system_score_gemma":0.0018605598,"threshold_uncertainty_score":0.018730044},"labels":[],"label_agreement":null},{"id":"W4390414797","doi":"10.1016/j.laa.2023.12.020","title":"On the stability of the principal ratio","year":2023,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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 Waterloo","funders":"","keywords":"Mathematics; Bounded function; Combinatorics; Multiplicative function; Spectral gap; Adjacency matrix; Eigenvalues and eigenvectors; Upper and lower bounds; Graph; Discrete mathematics; Measure (data warehouse); Graph energy; Line graph; Graph power; Mathematical analysis","score_opus":0.05441369205311207,"score_gpt":0.3033575243069773,"score_spread":0.24894383225386524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390414797","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50227237,0.010358709,0.30312368,0.014616703,0.0012784133,0.00009240209,0.0005902341,0.0005745752,0.16709282],"genre_scores_gemma":[0.96875787,0.0028978735,0.012981752,0.00071596587,0.0018264148,0.0000920799,0.00020039576,0.00019946892,0.012328207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986265,0.000571459,0.000046172157,0.00033181082,0.0002617932,0.00016229862],"domain_scores_gemma":[0.9906262,0.0064712386,0.00090058846,0.00037685363,0.0008776079,0.0007474126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00252541,0.001110969,0.001522446,0.004066795,0.0019048024,0.0037320533,0.0018018931,0.0015348734,0.009189789],"category_scores_gemma":[0.016880844,0.0005842973,0.0010006602,0.0022586852,0.0066116117,0.007665309,0.0027934306,0.0035018858,0.001279823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010681857,0.00002188056,0.00022125934,0.000050812974,0.000013562376,0.00004344068,0.00017687297,0.002612777,0.000945986,0.9894945,0.0012893678,0.005022892],"study_design_scores_gemma":[0.000016629363,0.000021179714,0.00018043647,0.000011877785,0.0000073669657,0.000048573314,0.000054575372,0.014698244,0.00033285414,0.98366565,0.0009484547,0.000014156483],"about_ca_topic_score_codex":0.0012174231,"about_ca_topic_score_gemma":0.0005272045,"teacher_disagreement_score":0.009189789,"about_ca_system_score_codex":0.0017269251,"about_ca_system_score_gemma":0.000806944,"threshold_uncertainty_score":0.030742884},"labels":[],"label_agreement":null},{"id":"W4390691520","doi":"10.1007/s10910-023-01561-w","title":"Inductive proof of Borchardt’s theorem","year":2024,"lang":"en","type":"article","venue":"Journal of Mathematical Chemistry","topic":"Graph theory and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Oak Ridge Associated Universities","keywords":"Antisymmetric relation; Mathematics; Cauchy distribution; Matrix (chemical analysis); Algebra over a field; Combinatorics; Pure mathematics; Mathematical analysis; Mathematical physics","score_opus":0.03474142059613658,"score_gpt":0.3218592679084527,"score_spread":0.28711784731231615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390691520","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030850446,0.00396598,0.52248347,0.023816802,0.0034376616,0.00024523394,0.0014158315,0.0019488414,0.41183573],"genre_scores_gemma":[0.6708536,0.003925025,0.1997312,0.008316191,0.001493107,0.00057734724,0.0017124075,0.0012016511,0.11218946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793637,0.0003677001,0.000092590926,0.00045764924,0.0007152106,0.00043056378],"domain_scores_gemma":[0.99570763,0.0021945753,0.00011461046,0.00044918267,0.0012985575,0.00023532829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030415736,0.0018315346,0.0013474001,0.0030470307,0.0024294239,0.0026225357,0.0028066079,0.0013771501,0.022030234],"category_scores_gemma":[0.0061400966,0.0011834223,0.0027390278,0.0015221599,0.0050344816,0.0057074414,0.00793543,0.0070185983,0.005012807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006938414,0.00010637922,0.0002510289,0.00023810472,0.000043826563,0.00024603624,0.00051693915,0.00059905037,0.0029053343,0.9721829,0.011587738,0.011253141],"study_design_scores_gemma":[0.00007388067,0.000023726685,0.00045724201,0.00007002503,0.0000431942,0.00027147954,0.00011596334,0.002270296,0.004703084,0.9452206,0.046714805,0.00003562521],"about_ca_topic_score_codex":0.0022459156,"about_ca_topic_score_gemma":0.0021183789,"teacher_disagreement_score":0.022030234,"about_ca_system_score_codex":0.0029356217,"about_ca_system_score_gemma":0.0013622858,"threshold_uncertainty_score":0.07369846},"labels":[],"label_agreement":null},{"id":"W4390714306","doi":"10.55016/ojs/cdm.v17i2.69706","title":"On $D_{\\alpha}$ spectrum of connected graphs","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Spectral radius; Combinatorics; Mathematics; Diagonal; Alpha (finance); Graph; Eigenvalues and eigenvectors; Physics; Geometry","score_opus":0.01871690452322534,"score_gpt":0.3125228308750543,"score_spread":0.29380592635182895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390714306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.449748,0.008116275,0.48915654,0.0018938306,0.00022441919,0.000103615865,0.0007773098,0.00076853053,0.049211457],"genre_scores_gemma":[0.9311746,0.005055543,0.05809892,0.0005242826,0.00044889303,0.00024176379,0.00053911156,0.00031504288,0.0036018388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981598,0.000824486,0.000065123044,0.00038371753,0.00035012327,0.0002167754],"domain_scores_gemma":[0.9877401,0.008972887,0.0010445226,0.00081800966,0.0005361145,0.0008883278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015748222,0.0017931106,0.0014014528,0.0037259029,0.0012876126,0.001858059,0.0017418177,0.0014551766,0.0035731343],"category_scores_gemma":[0.011363338,0.00062413915,0.0007954115,0.0021725895,0.0035944427,0.0035824978,0.002445937,0.0020932667,0.0010751095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026881875,0.000072281444,0.0011643716,0.0002882423,0.000052648946,0.00039543465,0.0006776806,0.04353559,0.013555119,0.9159454,0.003823849,0.020220589],"study_design_scores_gemma":[0.00003504189,0.00007886357,0.0013670654,0.0001286765,0.00003706219,0.0005964468,0.0002496908,0.1982913,0.0035042677,0.7915897,0.004052428,0.000069388036],"about_ca_topic_score_codex":0.00097357616,"about_ca_topic_score_gemma":0.0006593626,"teacher_disagreement_score":0.0037259029,"about_ca_system_score_codex":0.0012365963,"about_ca_system_score_gemma":0.00038580218,"threshold_uncertainty_score":0.011953294},"labels":[],"label_agreement":null},{"id":"W4390714307","doi":"10.55016/ojs/cdm.v17i2.62734","title":"Hamilton cycles in bidirected complete graphs","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Generalization; Indifference graph; 1-planar graph; Chordal graph; Discrete mathematics; Graph","score_opus":0.03429892041570055,"score_gpt":0.32880357045648684,"score_spread":0.2945046500407863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390714307","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.702787,0.0012745612,0.22450842,0.001383023,0.0001520716,0.00015623786,0.00062012824,0.0001975644,0.06892097],"genre_scores_gemma":[0.95363855,0.000799273,0.03386092,0.00032978065,0.000058270063,0.00014586166,0.00037911613,0.000035215737,0.010752959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996693,0.00009765686,0.000020233687,0.00006865824,0.000090670546,0.00005343072],"domain_scores_gemma":[0.9988815,0.00043762525,0.00017261902,0.00008000101,0.00026011086,0.00016807638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037497806,0.00028739334,0.00023517663,0.0012399015,0.0007650943,0.0010979861,0.0005593214,0.00041350056,0.002733716],"category_scores_gemma":[0.0021602982,0.00030179316,0.00025329448,0.00091573026,0.0012855558,0.0015627808,0.0010411182,0.0006954021,0.00026156785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003004382,0.000015222376,0.0004279797,0.000046022684,0.00000671782,0.00011175235,0.00028295934,0.0026392804,0.0017249121,0.9869131,0.00095884904,0.006843276],"study_design_scores_gemma":[0.00002969106,0.000017455524,0.0003982023,0.00001594437,0.00000975117,0.00007945566,0.0001460055,0.01593499,0.0009248443,0.97634614,0.006083522,0.000013988997],"about_ca_topic_score_codex":0.0027548831,"about_ca_topic_score_gemma":0.0029603704,"teacher_disagreement_score":0.0027548831,"about_ca_system_score_codex":0.0008069247,"about_ca_system_score_gemma":0.0005446359,"threshold_uncertainty_score":0.009145141},"labels":[],"label_agreement":null},{"id":"W4391092460","doi":"10.1080/03081087.2023.2300674","title":"On a question of Erdős on doubly stochastic matrices","year":2024,"lang":"en","type":"article","venue":"Linear and Multilinear Algebra","topic":"Graph theory and applications","field":"Mathematics","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é TÉLUQ; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec – Nature et technologies; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Diagonal; Permutation matrix; Permutation (music); Matrix (chemical analysis); Combinatorics; Set (abstract data type); Mathematical economics; Algebra over a field; Pure mathematics; Applied mathematics; Computer science; Philosophy; Chemistry; Geometry","score_opus":0.026363060637237895,"score_gpt":0.33633649726094994,"score_spread":0.309973436623712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391092460","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07171535,0.029818073,0.14253484,0.505998,0.0136471,0.00008172622,0.001396228,0.00032411903,0.23448458],"genre_scores_gemma":[0.79243076,0.019320384,0.025543846,0.087176524,0.027848486,0.00023543721,0.0005967311,0.0004895897,0.04635815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970245,0.0012866652,0.000100464764,0.00067010813,0.00063124456,0.00028708152],"domain_scores_gemma":[0.9908117,0.007112954,0.0003975166,0.0005108797,0.00078852015,0.00037840178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043230066,0.00063909823,0.0015120187,0.0012492994,0.004113395,0.0031997995,0.0011841074,0.005117996,0.0058538057],"category_scores_gemma":[0.019744787,0.00047262394,0.001023488,0.0016943605,0.010266591,0.013376251,0.0039656647,0.007155993,0.0015826139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004408113,0.00001547408,0.00012628282,0.000029066412,0.000006811001,0.000038537743,0.00019559589,0.000374787,0.0001271757,0.9707257,0.023615012,0.0047014337],"study_design_scores_gemma":[0.000013438342,0.000007875891,0.00004618411,0.000018377603,0.0000021926467,0.00003167679,0.00006562796,0.0005947204,0.0000751972,0.9857357,0.0133995805,0.0000093166545],"about_ca_topic_score_codex":0.0015665696,"about_ca_topic_score_gemma":0.00061983214,"teacher_disagreement_score":0.0058538057,"about_ca_system_score_codex":0.0023022078,"about_ca_system_score_gemma":0.00096140563,"threshold_uncertainty_score":0.022862494},"labels":[],"label_agreement":null},{"id":"W4391127520","doi":"10.61091/ars157-14","title":"On Lanzhou Index of Graphs","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Innovation Scientists and Technicians Troop Construction Projects of Henan Province; National Natural Science Foundation of China; Sungkyunkwan University; National Research Foundation","keywords":"Mathematics; Index (typography); Statistics; Computer science; World Wide Web","score_opus":0.028476082883004183,"score_gpt":0.29881417138011196,"score_spread":0.2703380884971078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127520","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.817354,0.0045259246,0.11024168,0.00061607,0.00012287125,0.0000614513,0.0008301671,0.00021095188,0.06603688],"genre_scores_gemma":[0.97339636,0.0014698762,0.0191456,0.00015853118,0.00025765054,0.0000688243,0.00053429423,0.00008374267,0.004885231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938726,0.00012605467,0.000045222467,0.00017001541,0.00014653044,0.00012483286],"domain_scores_gemma":[0.9981305,0.0008426453,0.00041947258,0.00018204062,0.00021788616,0.00020753659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008819775,0.00039220756,0.00065931235,0.003723295,0.00137575,0.0013337428,0.0006004391,0.00054481346,0.004026396],"category_scores_gemma":[0.0032276362,0.00019799267,0.000520206,0.0025523335,0.0015013702,0.0032644626,0.0011832064,0.0009054246,0.0005615122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014216421,0.000030453813,0.0052537816,0.00009696347,0.000028809922,0.00015700632,0.00045093297,0.004214181,0.0052703395,0.96046466,0.0018624391,0.022028286],"study_design_scores_gemma":[0.000025836434,0.0001330601,0.00989362,0.000066427565,0.000045483423,0.00072100357,0.00032175527,0.037420284,0.0038414195,0.9320916,0.015389274,0.00005016062],"about_ca_topic_score_codex":0.0010504464,"about_ca_topic_score_gemma":0.001478297,"teacher_disagreement_score":0.004026396,"about_ca_system_score_codex":0.0013416857,"about_ca_system_score_gemma":0.00028350632,"threshold_uncertainty_score":0.013469577},"labels":[],"label_agreement":null},{"id":"W4391127522","doi":"10.61091/ars157-03","title":"On a conjecture of the harmonic index with given minimum degree of graphs and short proof of Liu’s result on Randić index","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Index (typography); Degree (music); Combinatorics; Discrete mathematics; Statistics; Computer science; Physics","score_opus":0.03007204907759478,"score_gpt":0.2713264816441492,"score_spread":0.2412544325665544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15785259,0.028576344,0.54285634,0.044496935,0.0068616,0.00022340019,0.0019574198,0.0014939172,0.21568152],"genre_scores_gemma":[0.8244205,0.009946813,0.12380082,0.006733814,0.009831379,0.00036399456,0.0016319733,0.00061577023,0.022655005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824834,0.00035770773,0.00009705887,0.00065546896,0.0004438209,0.00019755533],"domain_scores_gemma":[0.9929034,0.004992267,0.00052644714,0.0006125532,0.0005874496,0.0003777954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027012585,0.0010226512,0.0014368868,0.0028239419,0.0018313706,0.0023703892,0.0021016821,0.002110474,0.006872381],"category_scores_gemma":[0.014412927,0.00066044525,0.0017779716,0.003876424,0.0052862307,0.008347051,0.0034717084,0.0063216933,0.0015078131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016116457,0.00005841772,0.001484622,0.000404894,0.000045659064,0.00042303855,0.00055090553,0.0036238485,0.002620801,0.94596165,0.01989971,0.024765443],"study_design_scores_gemma":[0.000026769001,0.000068309666,0.0012529795,0.00007308819,0.00004243535,0.00043042554,0.00010165122,0.009247093,0.0016228203,0.96910113,0.017983036,0.00005022109],"about_ca_topic_score_codex":0.0009224812,"about_ca_topic_score_gemma":0.000585981,"teacher_disagreement_score":0.006872381,"about_ca_system_score_codex":0.0020776729,"about_ca_system_score_gemma":0.0006618494,"threshold_uncertainty_score":0.022990406},"labels":[],"label_agreement":null},{"id":"W4391127890","doi":"10.61091/jcmcc117-18","title":"On Some Topological Indices for the Orbit Graph of Dihedral Groups","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Dihedral group; Wiener index; Orbit (dynamics); Dihedral angle; Mathematics; Graph; Combinatorics; Topology (electrical circuits); Discrete mathematics; Pure mathematics; Group (periodic table); Physics; Quantum mechanics","score_opus":0.03740168451983691,"score_gpt":0.3121668195081129,"score_spread":0.27476513498827604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127890","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7878678,0.00096955453,0.17938837,0.00045654038,0.00013484167,0.00008199038,0.000594693,0.00015729794,0.030348843],"genre_scores_gemma":[0.95641905,0.0007105482,0.03690319,0.000088472,0.0001745294,0.00009058612,0.0008006256,0.000105321116,0.0047076656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970835,0.00006486522,0.000018716046,0.000054062137,0.00009384727,0.000060205857],"domain_scores_gemma":[0.99849963,0.00062112074,0.00030564747,0.000110036446,0.00022335198,0.00024024019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006847212,0.00046632436,0.00042802704,0.0048288694,0.0008661609,0.001902313,0.0007242002,0.0005385605,0.0031085694],"category_scores_gemma":[0.004012381,0.00016964725,0.0004538383,0.0018156474,0.0018252947,0.0032329224,0.0008854665,0.0011111198,0.00061633653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009677964,0.000047618734,0.003365226,0.0000710133,0.000013461475,0.000108951936,0.00040071586,0.010173924,0.0038596329,0.96031004,0.0013978416,0.02015478],"study_design_scores_gemma":[0.000023208193,0.00008972837,0.0037220875,0.00006521705,0.000022941791,0.00024541802,0.0003864159,0.070008844,0.0032040167,0.91683644,0.0053323056,0.00006346519],"about_ca_topic_score_codex":0.0008364413,"about_ca_topic_score_gemma":0.00083082134,"teacher_disagreement_score":0.0048288694,"about_ca_system_score_codex":0.0012282149,"about_ca_system_score_gemma":0.0004648354,"threshold_uncertainty_score":0.010399163},"labels":[],"label_agreement":null},{"id":"W4391256074","doi":"10.1007/s12190-024-01995-8","title":"On distance Laplacian spectral ordering of some graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Applied Mathematics and Computing","topic":"Graph theory and applications","field":"Mathematics","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Spectral radius; Mathematics; Combinatorics; Eigenvalues and eigenvectors; Spectral line; Order (exchange); Laplace operator; Discrete mathematics; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.017245283872143885,"score_gpt":0.2727302950174858,"score_spread":0.25548501114534194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391256074","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7702802,0.00082473207,0.15891993,0.0024079278,0.00037551712,0.000053225427,0.000610659,0.0002457472,0.06628202],"genre_scores_gemma":[0.9593761,0.0007214497,0.023179175,0.0004525295,0.00036285384,0.000051629086,0.00062135345,0.00012161571,0.015113253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996123,0.00009808005,0.000017356346,0.00008354971,0.00011461352,0.00007415165],"domain_scores_gemma":[0.9979819,0.0007818064,0.00023408698,0.00012016073,0.00041069207,0.000471297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000430014,0.00044172342,0.000476976,0.002248214,0.001588563,0.0016759599,0.00074310135,0.000643146,0.005568024],"category_scores_gemma":[0.0026565115,0.00023964983,0.00045657498,0.0018945211,0.0012696123,0.0023389214,0.00085270515,0.0012924112,0.00046242832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007537618,0.000051206913,0.001031566,0.000054187607,0.000008357816,0.00016353272,0.0005806919,0.0022919306,0.0036831885,0.98031497,0.0025852066,0.009159796],"study_design_scores_gemma":[0.000013076654,0.000031361127,0.0008750054,0.000015025909,0.000009958635,0.00020614799,0.00041817027,0.022381226,0.0008104081,0.97209024,0.003131412,0.000017861415],"about_ca_topic_score_codex":0.0017461502,"about_ca_topic_score_gemma":0.001838815,"teacher_disagreement_score":0.005568024,"about_ca_system_score_codex":0.00096651574,"about_ca_system_score_gemma":0.0005690739,"threshold_uncertainty_score":0.018626928},"labels":[],"label_agreement":null},{"id":"W4391258415","doi":"10.1063/5.0179137","title":"Energy is not a convex function of particle number for r−k interparticle potentials with k &amp;gt; log34","year":2024,"lang":"en","type":"article","venue":"The Journal of Chemical Physics","topic":"Graph theory and applications","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Alliance de recherche numérique du Canada; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Convex function; Function (biology); Particle (ecology); Regular polygon; Physics; Mathematics; Mathematical physics; Combinatorics; Geometry; Geology; Biology","score_opus":0.03944021101536895,"score_gpt":0.3063788190612833,"score_spread":0.26693860804591435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391258415","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5883953,0.001684699,0.2724697,0.007822013,0.00020247072,0.00005345711,0.000722245,0.00051135314,0.12813866],"genre_scores_gemma":[0.9736015,0.0006572533,0.015984094,0.00043448835,0.00006052052,0.000060426,0.0003784268,0.00033025345,0.00849308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988386,0.00025161973,0.000049215,0.00022496423,0.00031333586,0.00032222856],"domain_scores_gemma":[0.99167776,0.005312851,0.0010434636,0.0009526167,0.0005236709,0.00048955856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015554596,0.00066155556,0.00096183445,0.0014218295,0.0011693109,0.0038105876,0.0015746295,0.0009797955,0.005147954],"category_scores_gemma":[0.0088951755,0.0007166315,0.0010721107,0.00075113314,0.005625174,0.004207421,0.001595309,0.001958093,0.0010575615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014053418,0.000048344296,0.0022497738,0.0002145743,0.00006683562,0.0006094571,0.0002614989,0.0820219,0.006977171,0.88976985,0.0032817286,0.014358334],"study_design_scores_gemma":[0.000016555738,0.00003683157,0.004912942,0.000058119687,0.000022479155,0.0009495998,0.00018263394,0.28791562,0.0043171346,0.6979913,0.0035220676,0.00007473199],"about_ca_topic_score_codex":0.0016361005,"about_ca_topic_score_gemma":0.0013503823,"teacher_disagreement_score":0.005147954,"about_ca_system_score_codex":0.0018175998,"about_ca_system_score_gemma":0.00063847477,"threshold_uncertainty_score":0.01722163},"labels":[],"label_agreement":null},{"id":"W4392004678","doi":"10.1103/prxquantum.5.010329","title":"Quantum Complexity of the Kronecker Coefficients","year":2024,"lang":"en","type":"article","venue":"PRX Quantum","topic":"Graph theory and applications","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Army Research Office; Office of Science; Ministry of Colleges and Universities; Canadian Institute for Advanced Research; Institut Périmètre de physique théorique; Government of Canada; U.S. Department of Energy","keywords":"Kronecker delta; Quantum; Mathematics; Quantum mechanics; Physics","score_opus":0.10614810165333109,"score_gpt":0.3433496145485968,"score_spread":0.2372015128952657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392004678","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6201088,0.0012887159,0.34491158,0.0035343377,0.0002565648,0.00009203675,0.0012092368,0.0004539742,0.028144639],"genre_scores_gemma":[0.97145736,0.0005651815,0.023954075,0.00021165078,0.00020725408,0.00011306119,0.000425394,0.00010217609,0.002963687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99699295,0.00093612587,0.00017505378,0.0005095845,0.0009931792,0.00039303504],"domain_scores_gemma":[0.98469573,0.009197913,0.0011809436,0.0031647237,0.0011886414,0.00057206716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00287932,0.0005540435,0.0011117968,0.0015163695,0.0010937195,0.0039869216,0.0022209699,0.0012316293,0.004920047],"category_scores_gemma":[0.02421563,0.00068038964,0.0008728897,0.0010157122,0.0046808827,0.01116122,0.0030663498,0.0037135878,0.000646747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010108217,0.000031412947,0.0014313031,0.000093681716,0.000021850277,0.00006794949,0.00019381003,0.021395303,0.0013708397,0.9655896,0.001445673,0.008257501],"study_design_scores_gemma":[0.000013349026,0.00002189999,0.000514352,0.000033768127,0.0000088987135,0.00006257079,0.000053690175,0.11328503,0.0011200003,0.8839648,0.000889384,0.0000323103],"about_ca_topic_score_codex":0.0014806809,"about_ca_topic_score_gemma":0.0010246299,"teacher_disagreement_score":0.004920047,"about_ca_system_score_codex":0.0015976089,"about_ca_system_score_gemma":0.0013586935,"threshold_uncertainty_score":0.016459167},"labels":[],"label_agreement":null},{"id":"W4392563096","doi":"10.1515/jgth-2022-0213","title":"Representation zeta function of a family of maximal class groups: Non-exceptional primes","year":2024,"lang":"en","type":"article","venue":"Journal of Group Theory","topic":"Graph theory and applications","field":"Mathematics","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":"Cape Breton University","funders":"","keywords":"Mathematics; Class (philosophy); Representation (politics); Riemann zeta function; Function (biology); Pure mathematics; Mathematics education; Combinatorics; Computer science; Artificial intelligence","score_opus":0.03673273253303572,"score_gpt":0.3194945904023766,"score_spread":0.2827618578693409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392563096","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87984014,0.00022177366,0.090678275,0.0005729734,0.00012999223,0.000044960805,0.00008690075,0.0003495584,0.02807542],"genre_scores_gemma":[0.9878043,0.00009308402,0.005351359,0.00005641687,0.00008255798,0.000039388102,0.00007684608,0.000056823792,0.006439176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993636,0.000115253984,0.000023569943,0.00011828334,0.0002023405,0.00017698157],"domain_scores_gemma":[0.9991615,0.00022843214,0.00011690127,0.00009053611,0.00011887624,0.00028379026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010065846,0.00068114157,0.0006469511,0.0022981348,0.0016548613,0.002451255,0.00090091873,0.0006166165,0.0052457373],"category_scores_gemma":[0.002340875,0.0003031803,0.0011137117,0.00063150126,0.002607403,0.0024122729,0.0021267028,0.0017899061,0.0007756559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001599063,0.000087609464,0.0022592312,0.000077687,0.000031745574,0.0006614636,0.0007966118,0.003447141,0.009285232,0.96688956,0.001243388,0.015060349],"study_design_scores_gemma":[0.00007577926,0.00017200522,0.0021234597,0.000058123143,0.000047294354,0.0010249732,0.00048178612,0.026835987,0.013465414,0.9492132,0.0064299777,0.00007196029],"about_ca_topic_score_codex":0.00040843853,"about_ca_topic_score_gemma":0.00026678827,"teacher_disagreement_score":0.0052457373,"about_ca_system_score_codex":0.0016529441,"about_ca_system_score_gemma":0.00050111744,"threshold_uncertainty_score":0.01754874},"labels":[],"label_agreement":null},{"id":"W4392616725","doi":"10.1090/proc/17035","title":"Distribution of power residues over shifted subfields and maximal cliques in generalized Paley graphs","year":2024,"lang":"lv","type":"preprint","venue":"Proceedings of the American Mathematical Society","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Power (physics); Distribution (mathematics); Mathematics; Combinatorics; Physics; Mathematical analysis","score_opus":0.015581012378705576,"score_gpt":0.2875601054928759,"score_spread":0.27197909311417034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392616725","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89037156,0.00022081564,0.10036968,0.0007135182,0.00003412483,0.00003112122,0.0002675539,0.00027268706,0.007719008],"genre_scores_gemma":[0.9841936,0.00017526714,0.011680315,0.00008309566,0.000067159446,0.000062662555,0.00026075708,0.00010120397,0.0033759119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994535,0.00013001224,0.000017330978,0.00016087826,0.00011143243,0.00012690508],"domain_scores_gemma":[0.9954242,0.0027422789,0.0005775212,0.00037829683,0.00036501282,0.000512669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012724119,0.00035692792,0.00056048395,0.001969744,0.0010051971,0.0014699083,0.0009946973,0.0006581942,0.005638378],"category_scores_gemma":[0.009395168,0.00046784704,0.000536131,0.0008749174,0.002671618,0.0032932754,0.0012853354,0.0010333281,0.00034545883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025248315,0.00004870016,0.0065196236,0.00012824079,0.000030539675,0.00032939858,0.0007987244,0.03293804,0.008842524,0.9320798,0.0029316156,0.015100324],"study_design_scores_gemma":[0.000055908644,0.000047210087,0.0034214114,0.000045437104,0.000017901455,0.00028525438,0.00030815747,0.18333273,0.0045146137,0.80525655,0.0026763573,0.000038404487],"about_ca_topic_score_codex":0.0016184411,"about_ca_topic_score_gemma":0.0015962793,"teacher_disagreement_score":0.005638378,"about_ca_system_score_codex":0.0015814179,"about_ca_system_score_gemma":0.0005396072,"threshold_uncertainty_score":0.018862307},"labels":[],"label_agreement":null},{"id":"W4392682309","doi":"10.48550/arxiv.2403.05439","title":"Scarf complexes of graphs and their powers","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph theory and applications","field":"Mathematics","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":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Vietnam Institute for Advanced Study in Mathematics","keywords":"Mathematics; Combinatorics","score_opus":0.09612492794770884,"score_gpt":0.21940582391914645,"score_spread":0.12328089597143761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392682309","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.6047543,0.0064048558,0.22308335,0.0018241403,0.00037579224,0.00016015707,0.0009578064,0.0006324019,0.16180715],"genre_scores_gemma":[0.94589037,0.0019649402,0.032697823,0.00028271886,0.00038282076,0.00008461392,0.0006448852,0.00015633302,0.017895551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911255,0.0001416338,0.000050616618,0.00021632834,0.00031273355,0.00016615],"domain_scores_gemma":[0.9984882,0.0005301653,0.00023124194,0.00017786364,0.00023175789,0.00034075984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007351342,0.00058259984,0.00058491295,0.0041173194,0.0015142276,0.0027693822,0.0007537697,0.0006254531,0.009065247],"category_scores_gemma":[0.0023693058,0.0005753587,0.0007430158,0.0015946681,0.0024865628,0.0046331515,0.0022345888,0.0016069273,0.0010744772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027323062,0.000017977201,0.00081107917,0.00006798476,0.00001196946,0.00024721614,0.0007246554,0.0010211003,0.0017344954,0.97939724,0.001562092,0.014376812],"study_design_scores_gemma":[0.000013717585,0.000031365267,0.0015121426,0.00004899286,0.000014923763,0.00095572823,0.00052611943,0.0058670226,0.0024969399,0.9660208,0.022483934,0.000028323433],"about_ca_topic_score_codex":0.0008732512,"about_ca_topic_score_gemma":0.0007296174,"teacher_disagreement_score":0.009065247,"about_ca_system_score_codex":0.00095726474,"about_ca_system_score_gemma":0.00027564575,"threshold_uncertainty_score":0.030326247},"labels":[],"label_agreement":null},{"id":"W4392734384","doi":"10.1007/s00373-023-02745-6","title":"The Strong Spectral Property of Graphs: Graph Operations and Barbell Partitions","year":2024,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Graph theory and applications","field":"Mathematics","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 Regina","funders":"Medical Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Combinatorics; Property (philosophy); Graph; Discrete mathematics","score_opus":0.026094945186521293,"score_gpt":0.2735957473646457,"score_spread":0.24750080217812442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392734384","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5029598,0.0026536628,0.40515828,0.0037651267,0.0005758073,0.000073012896,0.0004045162,0.00046245733,0.08394731],"genre_scores_gemma":[0.9590662,0.0011157326,0.028986556,0.00043597652,0.0006321155,0.00010419443,0.00024595327,0.00019855791,0.009214711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898857,0.00035360616,0.000048809863,0.00026029456,0.0001979486,0.00015081368],"domain_scores_gemma":[0.9952952,0.0026743968,0.0005182296,0.0006341745,0.00040487674,0.00047312773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001222437,0.00085942994,0.0010378843,0.002785573,0.0025281492,0.00390344,0.0014476094,0.0017424942,0.0057737036],"category_scores_gemma":[0.0058438736,0.0006832051,0.0009341411,0.0026775266,0.0060258834,0.009602312,0.0028244872,0.0026547622,0.00080592046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025368152,0.00001565097,0.00014336212,0.000025644795,0.0000035653522,0.000026595839,0.00018840392,0.00076852296,0.0006130055,0.99459213,0.0005466118,0.0030511073],"study_design_scores_gemma":[0.0000045407833,0.0000067136916,0.000098890116,0.000007908904,0.000005078205,0.000040924733,0.00010009512,0.0026057295,0.00031842306,0.9959657,0.00084028544,0.0000056648123],"about_ca_topic_score_codex":0.00074391376,"about_ca_topic_score_gemma":0.000791312,"teacher_disagreement_score":0.0057737036,"about_ca_system_score_codex":0.0007671729,"about_ca_system_score_gemma":0.0006035132,"threshold_uncertainty_score":0.019314945},"labels":[],"label_agreement":null},{"id":"W4392899684","doi":"","title":"Borne a priori dans L∞ pour les minimiseurs de l'énergie de Ginzburg-Landau avec pénalisation de la divergence","year":2024,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Graph theory and applications","field":"Mathematics","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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Divergence (linguistics); A priori and a posteriori; Physics; Statistical physics; Mathematical physics; Energy (signal processing); Quantum mechanics; Philosophy","score_opus":0.02536395961915438,"score_gpt":0.2827300238776647,"score_spread":0.25736606425851033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392899684","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5275909,0.0015915302,0.44814855,0.003017745,0.00016075218,0.00008116915,0.00026481904,0.00022416588,0.01892046],"genre_scores_gemma":[0.90156275,0.00095435855,0.077861175,0.00029404572,0.00010118421,0.00031067725,0.00034506316,0.00049663516,0.018074263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964356,0.00015208762,0.000012316942,0.00007931531,0.000054401626,0.000058286663],"domain_scores_gemma":[0.9982285,0.0010908738,0.0002259329,0.00006590459,0.00018252527,0.00020625466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018266112,0.0016427548,0.0011397087,0.0012633085,0.0009152082,0.0024346542,0.00092174974,0.00178916,0.0023708774],"category_scores_gemma":[0.0075419536,0.00063092017,0.00080866175,0.00041096626,0.0028691264,0.0020228953,0.0020525702,0.0020081736,0.00032996203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038623987,0.00015183933,0.0046566506,0.00061487017,0.00015685312,0.0006283781,0.000808951,0.34749314,0.016054971,0.61180204,0.002394004,0.014852005],"study_design_scores_gemma":[0.000028942444,0.00010397993,0.0013096316,0.00010638495,0.00002299648,0.00015590046,0.00023592317,0.8682367,0.0027136456,0.1252495,0.0017799264,0.000056442514],"about_ca_topic_score_codex":0.0044811205,"about_ca_topic_score_gemma":0.003935183,"teacher_disagreement_score":0.0044811205,"about_ca_system_score_codex":0.002092724,"about_ca_system_score_gemma":0.0010837725,"threshold_uncertainty_score":0.015183806},"labels":[],"label_agreement":null},{"id":"W4393951975","doi":"10.1007/s10878-024-01144-8","title":"The average size of maximal matchings in graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Graph theory and applications","field":"Mathematics","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":"Polytechnique Montréal","funders":"","keywords":"Theory of computation; Combinatorics; Mathematics; Discrete mathematics; Algorithm","score_opus":0.011279871558782639,"score_gpt":0.2755982248044911,"score_spread":0.26431835324570846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393951975","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8710176,0.0024225647,0.10259057,0.004619711,0.00026121343,0.000104963896,0.0032866963,0.00077425945,0.01492252],"genre_scores_gemma":[0.97936696,0.0009892524,0.014311165,0.00030070398,0.00046125002,0.00009558544,0.0012797371,0.00030914677,0.0028861123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99742484,0.0007745622,0.00014563756,0.0007039655,0.0004963522,0.00045474057],"domain_scores_gemma":[0.9211084,0.063153155,0.005477068,0.0035511516,0.0028653468,0.0038448551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043084384,0.0010696917,0.0028739134,0.0034516433,0.0014723501,0.004543525,0.0050095688,0.0030164304,0.007325597],"category_scores_gemma":[0.052035686,0.0020595882,0.00130674,0.0033539203,0.0028946097,0.011230457,0.0024003054,0.0020564604,0.0005438202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004056852,0.0005437393,0.03044046,0.0016688767,0.000820598,0.00054953736,0.0010485223,0.31169313,0.02533519,0.5419761,0.025662553,0.056204483],"study_design_scores_gemma":[0.00015985378,0.00019075203,0.006121373,0.000102535945,0.00017962922,0.0003926341,0.00032198112,0.44673997,0.0046247565,0.53916276,0.0019468104,0.000056870507],"about_ca_topic_score_codex":0.001724212,"about_ca_topic_score_gemma":0.0018310961,"teacher_disagreement_score":0.007325597,"about_ca_system_score_codex":0.0026238058,"about_ca_system_score_gemma":0.0015846255,"threshold_uncertainty_score":0.02450651},"labels":[],"label_agreement":null},{"id":"W4394576567","doi":"10.1137/23m1566881","title":"The Rainbow Saturation Number Is Linear","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Royal Society; Pacific Institute for the Mathematical Sciences","keywords":"Mathematics; Rainbow; Combinatorics; Saturation (graph theory); Discrete mathematics; Physics","score_opus":0.03317991022247071,"score_gpt":0.35077285444035566,"score_spread":0.317592944217885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394576567","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51613533,0.0017793687,0.274589,0.010119661,0.0004056177,0.00021105654,0.0040738764,0.0041902172,0.1884959],"genre_scores_gemma":[0.93032694,0.00104133,0.045741018,0.00087989384,0.00026290579,0.00026039206,0.0012945943,0.0004040579,0.019788796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998293,0.00019090791,0.00007726695,0.00072907045,0.00033881815,0.00037094115],"domain_scores_gemma":[0.991867,0.0051459265,0.00043221322,0.0013293718,0.0006314563,0.00059413334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009936284,0.00077347335,0.0007925455,0.00081680494,0.0012867404,0.0019168155,0.001533704,0.0008977776,0.013553636],"category_scores_gemma":[0.005886985,0.00065351836,0.0008475803,0.0010642837,0.0028097255,0.008176278,0.0023318378,0.0023932264,0.0022212076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017021009,0.0003459789,0.01184745,0.0011858958,0.00019327525,0.00045910137,0.0010778491,0.06150276,0.09328894,0.67922723,0.031809494,0.11735992],"study_design_scores_gemma":[0.00013992109,0.00024243824,0.004538438,0.0001302304,0.00014167957,0.00075515866,0.0003616252,0.11689584,0.0510656,0.786814,0.038806688,0.00010828951],"about_ca_topic_score_codex":0.0015998672,"about_ca_topic_score_gemma":0.0026396199,"teacher_disagreement_score":0.013553636,"about_ca_system_score_codex":0.0024452668,"about_ca_system_score_gemma":0.0019947316,"threshold_uncertainty_score":0.04534149},"labels":[],"label_agreement":null},{"id":"W4394577775","doi":"10.28924/2291-8639-22-2024-63","title":"A Study on Degree Based Topological Indices of Harary Subdivision Graphs With Application","year":2024,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Subdivision; Degree (music); Topology (electrical circuits); Pure mathematics; Combinatorics; Geography; Physics","score_opus":0.04362794042633572,"score_gpt":0.3624411701241556,"score_spread":0.3188132296978199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394577775","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7979238,0.0017531902,0.15027262,0.00030011518,0.00008345979,0.000038651393,0.00011561657,0.00005945339,0.049453136],"genre_scores_gemma":[0.9806904,0.000787515,0.015103297,0.00003961289,0.00005499086,0.00002101715,0.00009628627,0.000020180483,0.0031867577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99981874,0.000045540335,0.000008257144,0.00004556466,0.000055927972,0.000026114478],"domain_scores_gemma":[0.9992329,0.0003139753,0.00016833187,0.00006447496,0.00013628227,0.00008413243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029000512,0.00027651252,0.00030006887,0.0016803113,0.00058843184,0.0009217405,0.0004498741,0.0002661039,0.0015099276],"category_scores_gemma":[0.0015484854,0.00012811675,0.000264799,0.0012812713,0.0008037768,0.0012221403,0.00046180194,0.0005746607,0.0001506454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004755454,0.00004632539,0.0076106885,0.00009803167,0.000018112016,0.0001984162,0.00046665245,0.024007814,0.010758632,0.9124218,0.0009949681,0.043331027],"study_design_scores_gemma":[0.000017179742,0.0002586549,0.014536227,0.00010385641,0.00006398456,0.0014490586,0.0010560863,0.23369984,0.007505178,0.71890414,0.022347782,0.000058028934],"about_ca_topic_score_codex":0.0005716025,"about_ca_topic_score_gemma":0.0006792714,"teacher_disagreement_score":0.0016803113,"about_ca_system_score_codex":0.0005014753,"about_ca_system_score_gemma":0.000254418,"threshold_uncertainty_score":0.005051255},"labels":[],"label_agreement":null},{"id":"W4394793009","doi":"10.61091/um119-07","title":"The Index Weighted Hermitian Adjacency Matrices for Mixed Graphs","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Spectral radius; Mathematics; Hermitian matrix; Adjacency list; Adjacency matrix; Combinatorics; Two-graph; Chordal graph; Indifference graph; Eigenvalues and eigenvectors; Discrete mathematics; Graph; Pure mathematics; Line graph; Physics","score_opus":0.029961414154297015,"score_gpt":0.31756857005514416,"score_spread":0.2876071559008471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394793009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3123059,0.00073104235,0.66193223,0.000321676,0.000114820774,0.00007063232,0.00037675223,0.00024055067,0.023906352],"genre_scores_gemma":[0.923007,0.0004184854,0.07197688,0.00016307202,0.00017698415,0.000101027144,0.0002399231,0.00007362881,0.0038430407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956125,0.00012386692,0.000021113205,0.000107339154,0.00013430236,0.000052183077],"domain_scores_gemma":[0.9987105,0.00045853527,0.00033766188,0.00012918381,0.00021448545,0.00014960124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003983277,0.00057627354,0.00039040786,0.0020208019,0.00058272283,0.0011736086,0.00074839237,0.00063451356,0.002512026],"category_scores_gemma":[0.002203347,0.00023387435,0.00027002877,0.0010660412,0.0010994368,0.0020003372,0.00078853,0.00094996486,0.0003895764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051728734,0.0000229017,0.0006787734,0.000069932255,0.000016483556,0.000113262766,0.00014863226,0.008209244,0.011656322,0.9650773,0.000905744,0.013049793],"study_design_scores_gemma":[0.000009573049,0.000056864043,0.0011528232,0.000016406764,0.000012454357,0.00046942735,0.00009469992,0.09917005,0.0043621934,0.89134413,0.0032774394,0.000033987213],"about_ca_topic_score_codex":0.00018396271,"about_ca_topic_score_gemma":0.00021860257,"teacher_disagreement_score":0.002512026,"about_ca_system_score_codex":0.00038679133,"about_ca_system_score_gemma":0.00015954807,"threshold_uncertainty_score":0.008403599},"labels":[],"label_agreement":null},{"id":"W4394793043","doi":"10.61091/um119-02","title":"On the Laplacian Energy of an Orbit Graph of Finite Groups","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Dihedral group; Mathematics; Combinatorics; Graph; Orbit (dynamics); Discrete mathematics; Group (periodic table); Physics","score_opus":0.03470644109703165,"score_gpt":0.293295437107868,"score_spread":0.25858899601083635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394793043","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8304106,0.0016351346,0.099131584,0.0022391754,0.000222382,0.00002872631,0.0002659595,0.00012960422,0.06593688],"genre_scores_gemma":[0.983238,0.00070898794,0.00782595,0.0002014151,0.00024382479,0.000030024255,0.00015272346,0.00006868055,0.007530439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997508,0.000075704804,0.000008164704,0.000041948468,0.00007797092,0.000045390952],"domain_scores_gemma":[0.9989704,0.0005328644,0.00013310935,0.00007357183,0.00011418557,0.00017580744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004495569,0.00041008377,0.00039799162,0.0022924207,0.0009049558,0.0012670121,0.0005753052,0.0008393339,0.0043605003],"category_scores_gemma":[0.0019028698,0.00019518034,0.00030496577,0.0009727682,0.002447485,0.002070553,0.0010425915,0.00073293416,0.00033136518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026453492,0.000025205536,0.0005897421,0.000037805887,0.000009777931,0.00012987095,0.00024382617,0.0061077033,0.0020357205,0.9847563,0.00096803653,0.0050695543],"study_design_scores_gemma":[0.000005764654,0.000016311678,0.00081360154,0.000014942881,0.000004148479,0.000112761605,0.00013291696,0.026539009,0.0002853186,0.9708829,0.0011782773,0.000014138234],"about_ca_topic_score_codex":0.0007170103,"about_ca_topic_score_gemma":0.0006735034,"teacher_disagreement_score":0.0043605003,"about_ca_system_score_codex":0.0008110007,"about_ca_system_score_gemma":0.00024557146,"threshold_uncertainty_score":0.014587343},"labels":[],"label_agreement":null},{"id":"W4394847455","doi":"10.26493/2590-9770.1702.63d","title":"Trees with minimum weighted Szeged index","year":2024,"lang":"en","type":"article","venue":"The Art of Discrete and Applied Mathematics","topic":"Graph theory and applications","field":"Mathematics","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","funders":"Dirección General de Asuntos del Personal Académico, Universidad Nacional Autónoma de México; Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología","keywords":"Index (typography); Mathematics; Statistics; Forestry; Computer science; Geography; World Wide Web","score_opus":0.01719747597292178,"score_gpt":0.2632761434848075,"score_spread":0.2460786675118857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394847455","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7525544,0.0010201795,0.21016152,0.0010389746,0.000098860844,0.00006949046,0.0017904331,0.00043427,0.03283185],"genre_scores_gemma":[0.94201046,0.0004765381,0.051946905,0.00013472047,0.000098291945,0.00007377512,0.001289763,0.00010346561,0.0038659843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942493,0.00007064201,0.000046501773,0.00012716449,0.000174002,0.00015686733],"domain_scores_gemma":[0.9978963,0.0007579856,0.0004316117,0.00035803506,0.00029524503,0.00026075816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005834861,0.00030472135,0.0007130645,0.0021731975,0.0012297068,0.0026088406,0.0007256181,0.00083360163,0.003507198],"category_scores_gemma":[0.00385636,0.00030001454,0.00054868445,0.002169643,0.00125016,0.0041494993,0.0010656664,0.0010140133,0.00059601257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020706907,0.000035205852,0.003970327,0.00011732308,0.000025487825,0.00016051509,0.000312863,0.012145724,0.015488389,0.9425836,0.0025716482,0.022381848],"study_design_scores_gemma":[0.000019469033,0.000047237103,0.0021844143,0.00002637252,0.00002366492,0.00032706847,0.00017687352,0.026787471,0.005774693,0.95622915,0.008374882,0.000028809503],"about_ca_topic_score_codex":0.0005112004,"about_ca_topic_score_gemma":0.0008199814,"teacher_disagreement_score":0.003507198,"about_ca_system_score_codex":0.00095829915,"about_ca_system_score_gemma":0.0005034131,"threshold_uncertainty_score":0.011732757},"labels":[],"label_agreement":null},{"id":"W4396234469","doi":"10.61091/jcmcc119-04","title":"Equi Neighbor Polynomial of Some Binary Graph Operations","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Binary number; Combinatorics; Mathematics; Graph; Discrete mathematics; Computer science; Arithmetic","score_opus":0.023275115770257093,"score_gpt":0.29639360318792257,"score_spread":0.2731184874176655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396234469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81175154,0.00032595894,0.09797521,0.000576693,0.00008268607,0.000054463697,0.00042250488,0.00022203744,0.088589],"genre_scores_gemma":[0.96631205,0.00025656252,0.018741686,0.00013284001,0.00008692068,0.000039209914,0.0003838106,0.000091013935,0.01395587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955183,0.000050568222,0.000021577995,0.00009981428,0.00014827914,0.00012791717],"domain_scores_gemma":[0.99957436,0.00013256194,0.000076008575,0.000055312918,0.00009024167,0.000071484596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027619186,0.00022003392,0.00031418024,0.00087118463,0.00057144667,0.0008574055,0.0004203085,0.0002560367,0.0046983655],"category_scores_gemma":[0.0012918618,0.000106303196,0.00032691756,0.00094725617,0.0009973922,0.0016069983,0.000773623,0.000819961,0.00046389343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016741431,0.00013097598,0.0008162582,0.000099616,0.000007701954,0.00013526384,0.0003771567,0.0063631176,0.0060928753,0.9154873,0.0028580858,0.06746442],"study_design_scores_gemma":[0.000054956614,0.00021462343,0.0030733142,0.000024304103,0.00002193993,0.00062471785,0.00033428599,0.07736355,0.012819167,0.8860804,0.019343859,0.00004482743],"about_ca_topic_score_codex":0.0012939293,"about_ca_topic_score_gemma":0.0015656159,"teacher_disagreement_score":0.0046983655,"about_ca_system_score_codex":0.0010571092,"about_ca_system_score_gemma":0.00045844723,"threshold_uncertainty_score":0.015717626},"labels":[],"label_agreement":null},{"id":"W4396234598","doi":"10.61091/jcmcc119-07","title":"Inverse of \\(\\alpha\\)-Hermitian Adjacency Matrix of a Unicyclic Bipartite Graph","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Adjacency matrix; Bipartite graph; Combinatorics; Hermitian matrix; Mathematics; Inverse; Complete bipartite graph; Edge-transitive graph; Graph; Discrete mathematics; Line graph; Voltage graph; Pure mathematics; Geometry","score_opus":0.02370849155242829,"score_gpt":0.3059902708696927,"score_spread":0.28228177931726445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396234598","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6923307,0.00034388475,0.26016495,0.0005200652,0.00016881806,0.00007493843,0.00053191144,0.00025700202,0.04560777],"genre_scores_gemma":[0.9444013,0.00020061003,0.045538604,0.00018008465,0.000064984415,0.0000710042,0.00032084674,0.000049784954,0.00917282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977547,0.000050435323,0.000012928832,0.0000614003,0.000056474106,0.000043361688],"domain_scores_gemma":[0.99963486,0.00008905972,0.00007497177,0.000040504496,0.000093900984,0.00006669641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014636274,0.0002240042,0.00017284475,0.0007312378,0.00040189803,0.000545332,0.00030716564,0.0003342397,0.0036284593],"category_scores_gemma":[0.00066313654,0.00012282968,0.0001804981,0.00044513587,0.00063091354,0.00057582423,0.00043771332,0.00037886034,0.00029643773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012503109,0.000054668886,0.0016595306,0.00012903691,0.000024285373,0.00047270465,0.0003707942,0.006917408,0.042681284,0.9165932,0.0031400365,0.027832104],"study_design_scores_gemma":[0.000034524117,0.00018269425,0.0057212305,0.00005519454,0.000030718482,0.0016954824,0.00052286556,0.15925868,0.021738943,0.7939341,0.016733699,0.00009182642],"about_ca_topic_score_codex":0.00071113,"about_ca_topic_score_gemma":0.0009823078,"teacher_disagreement_score":0.0036284593,"about_ca_system_score_codex":0.00027690717,"about_ca_system_score_gemma":0.00032328974,"threshold_uncertainty_score":0.012138426},"labels":[],"label_agreement":null},{"id":"W4396608435","doi":"10.37236/11732","title":"Central Limit Theorems via Analytic Combinatorics in Several Variables","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","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":"Limit (mathematics); Mathematics; Central limit theorem; Combinatorics; Enumerative combinatorics; Discrete mathematics; Statistics; Mathematical analysis","score_opus":0.013330712486469781,"score_gpt":0.27465006504180856,"score_spread":0.2613193525553388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396608435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15637347,0.0019746071,0.8027055,0.0020476845,0.00017862853,0.00006895727,0.00027495006,0.00051113253,0.035865057],"genre_scores_gemma":[0.89181066,0.001370867,0.09321909,0.00070360285,0.0006028068,0.00040222512,0.00032338177,0.00050383614,0.011063592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973386,0.0011813584,0.000094753195,0.0004692227,0.0006581643,0.00025782787],"domain_scores_gemma":[0.98803186,0.008550188,0.0009017548,0.0009782559,0.0009674832,0.000570511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004890369,0.00089266413,0.001241007,0.0050669457,0.0017108106,0.0041776095,0.0019228314,0.0008374773,0.0049233935],"category_scores_gemma":[0.017570946,0.0006595706,0.0018790773,0.0024619435,0.006677516,0.007497331,0.0034338848,0.0046511437,0.0007966601],"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.00000507525,0.000008313767,0.00022418941,0.000017131895,0.000005742375,0.000034192904,0.00008667739,0.001790254,0.00015122471,0.995708,0.0002680168,0.0017011815],"study_design_scores_gemma":[0.0000056352637,0.0000076235297,0.00012201627,0.0000118631315,0.0000047884596,0.000041901436,0.000025306226,0.02531169,0.00023257772,0.97321814,0.0010090189,0.000009387786],"about_ca_topic_score_codex":0.0014255864,"about_ca_topic_score_gemma":0.0010814365,"teacher_disagreement_score":0.0050669457,"about_ca_system_score_codex":0.003348609,"about_ca_system_score_gemma":0.001156754,"threshold_uncertainty_score":0.025863051},"labels":[],"label_agreement":null},{"id":"W4396620950","doi":"10.1016/j.laa.2024.04.033","title":"Dominant eigenvalue and universal winners of digraphs","year":2024,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Indian Institute of Technology Guwahati","keywords":"Mathematics; Eigenvalues and eigenvectors; Combinatorics; Pure mathematics; Algebra over a field","score_opus":0.019751480152346172,"score_gpt":0.2905636755917382,"score_spread":0.270812195439392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396620950","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6586989,0.0010030762,0.25419205,0.002106786,0.0003496737,0.0001068881,0.00063421944,0.0005683125,0.08234002],"genre_scores_gemma":[0.9661481,0.000540554,0.013409319,0.0002294053,0.0002623118,0.00010902577,0.00023932694,0.00012859184,0.018933335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982468,0.0003808961,0.00009122833,0.00038702955,0.00040473777,0.00048934616],"domain_scores_gemma":[0.9924165,0.0039106305,0.0006700538,0.00053589663,0.00076023524,0.0017066391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017180772,0.00086182693,0.0018910905,0.0036627199,0.0027225476,0.0053908587,0.0019116602,0.0015396797,0.008840442],"category_scores_gemma":[0.00986073,0.00092247326,0.0010349423,0.0022267892,0.00365856,0.0054597976,0.003174108,0.0021921853,0.0009086797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000626946,0.00004206047,0.00038203693,0.000056622954,0.000025876105,0.00007832499,0.00033920904,0.00213668,0.0011274418,0.9876887,0.0016278502,0.0064325645],"study_design_scores_gemma":[0.000016022319,0.000009900102,0.00019659445,0.000009453611,0.000010593541,0.000053368833,0.00013698926,0.0071598394,0.00032979247,0.99132603,0.0007401965,0.000011100442],"about_ca_topic_score_codex":0.0013536015,"about_ca_topic_score_gemma":0.0019701077,"teacher_disagreement_score":0.008840442,"about_ca_system_score_codex":0.0017419287,"about_ca_system_score_gemma":0.0010799381,"threshold_uncertainty_score":0.029574215},"labels":[],"label_agreement":null},{"id":"W4399497717","doi":"10.4171/aihpd/193","title":"Dimers on Riemann surfaces I: Temperleyan forests","year":2024,"lang":"en","type":"article","venue":"Annales de l’Institut Henri Poincaré D Combinatorics Physics and their Interactions","topic":"Graph theory and applications","field":"Mathematics","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":"University of Victoria","funders":"Engineering and Physical Sciences Research Council; Agence Nationale de la Recherche","keywords":"Forestry; Physics; Mathematics; Geography","score_opus":0.03419339987887322,"score_gpt":0.3086046272589038,"score_spread":0.2744112273800306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399497717","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9060979,0.0010378989,0.050622515,0.0007146878,0.00012982184,0.000021404707,0.000057742847,0.0000974478,0.041220553],"genre_scores_gemma":[0.99133366,0.00019175869,0.003978571,0.000100662975,0.00006017411,0.000012481267,0.000035590627,0.000020764937,0.0042662467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978,0.000056549223,0.00000968646,0.00005073726,0.00006133807,0.00004165922],"domain_scores_gemma":[0.99958426,0.000089874025,0.00007329941,0.000073701754,0.00005040822,0.00012853715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002951667,0.00022643027,0.0003903485,0.00065042835,0.0011538529,0.001735602,0.00056422735,0.000759553,0.002986598],"category_scores_gemma":[0.0008606661,0.00022818315,0.00038122176,0.00040523254,0.0014950011,0.0019568512,0.0011276836,0.00087324536,0.000281001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003323649,0.000030768853,0.00068035326,0.000026067626,0.000006595222,0.00020084984,0.00018859444,0.0067604287,0.0064623975,0.9833825,0.00043019932,0.001798053],"study_design_scores_gemma":[0.000021221464,0.000054575,0.0015110316,0.00002206603,0.000009291807,0.0006895303,0.00031565744,0.09536068,0.0028649606,0.89610076,0.0030278172,0.000022427654],"about_ca_topic_score_codex":0.00056723325,"about_ca_topic_score_gemma":0.0004985166,"teacher_disagreement_score":0.002986598,"about_ca_system_score_codex":0.0007077563,"about_ca_system_score_gemma":0.00022786745,"threshold_uncertainty_score":0.009991229},"labels":[],"label_agreement":null},{"id":"W4400089048","doi":"10.1016/j.dam.2024.06.016","title":"Constructing cospectral graphs by unfolding non-bipartite graphs","year":2024,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"Simon Fraser University","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Cograph; Discrete mathematics; Chordal graph; Graph; 1-planar graph","score_opus":0.018870227043850385,"score_gpt":0.2890157208435074,"score_spread":0.270145493799657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400089048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20512092,0.00013907005,0.75482416,0.00038714695,0.0002391295,0.00010353068,0.00032229436,0.0014318163,0.037431896],"genre_scores_gemma":[0.576723,0.00033596135,0.40526545,0.0003169714,0.00010241758,0.0001068103,0.0010925302,0.0011250555,0.014931868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997228,0.000084736675,0.0000101163,0.00007212243,0.000055759327,0.000054477485],"domain_scores_gemma":[0.9992176,0.00027234663,0.00005634869,0.00023953413,0.00011992049,0.00009420696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030782406,0.00061160343,0.00044068,0.0008491275,0.0009224416,0.00090424594,0.0006418065,0.00054634287,0.008088973],"category_scores_gemma":[0.0014537057,0.0003988521,0.00060760847,0.00079575647,0.00073514675,0.0016538478,0.001444284,0.0013219996,0.0016406548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017739012,0.00028993413,0.0013189927,0.00021877447,0.000035590463,0.0003515166,0.0006486124,0.031645156,0.036431395,0.80003905,0.007845677,0.12099791],"study_design_scores_gemma":[0.00002014839,0.00004422316,0.0004449331,0.000032885495,0.000023087074,0.00015623128,0.00035693412,0.11284849,0.013293083,0.858967,0.013795439,0.000017543463],"about_ca_topic_score_codex":0.0007392132,"about_ca_topic_score_gemma":0.002005782,"teacher_disagreement_score":0.008088973,"about_ca_system_score_codex":0.00040936584,"about_ca_system_score_gemma":0.0003443346,"threshold_uncertainty_score":0.02706033},"labels":[],"label_agreement":null},{"id":"W4400208897","doi":"10.1515/ms-2024-0040","title":"On the Paley graph of a quadratic character","year":2024,"lang":"en","type":"article","venue":"Mathematica Slovaca","topic":"Graph theory and applications","field":"Mathematics","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":"Western University","funders":"","keywords":"Mathematics; Character (mathematics); Quadratic equation; Graph; Combinatorics; Pure mathematics; Geometry","score_opus":0.04689404564450549,"score_gpt":0.3072878683875244,"score_spread":0.2603938227430189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400208897","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8410495,0.0006351835,0.107603356,0.0016343179,0.00017923384,0.00003646604,0.00019445855,0.00017690193,0.04849063],"genre_scores_gemma":[0.98465526,0.00027069973,0.008366974,0.00020794121,0.00011165384,0.000020166994,0.00008458132,0.000055628076,0.0062271156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960595,0.0001349256,0.00000939062,0.00008399473,0.00009637761,0.00006936095],"domain_scores_gemma":[0.9985506,0.0007419185,0.0001830413,0.00014243068,0.00016811285,0.0002138719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005141699,0.00029081252,0.00046620858,0.0016428643,0.0012928839,0.0014217496,0.0005255027,0.0008554327,0.005887635],"category_scores_gemma":[0.002743914,0.00030101443,0.00035532392,0.0008850929,0.0028427409,0.0023164735,0.0015579395,0.0012917153,0.00043728252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003967138,0.00001073831,0.00044172697,0.000033992976,0.0000056401964,0.00014119102,0.00019993649,0.0028104999,0.0015695223,0.9891244,0.0008277887,0.0047949096],"study_design_scores_gemma":[0.000010847414,0.000020832369,0.0005258169,0.0000189467,0.000005529918,0.00024629294,0.0001463347,0.014948576,0.00094592804,0.9802596,0.002858191,0.000013128852],"about_ca_topic_score_codex":0.00060356205,"about_ca_topic_score_gemma":0.0004997651,"teacher_disagreement_score":0.005887635,"about_ca_system_score_codex":0.0007171175,"about_ca_system_score_gemma":0.00025135785,"threshold_uncertainty_score":0.019696057},"labels":[],"label_agreement":null},{"id":"W4400486017","doi":"10.61091/jcmcc120-07","title":"On Vertex-Disjoint Chorded Cycles and Degree Sum Conditions","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Emory University","keywords":"Degree (music); Disjoint sets; Vertex (graph theory); Combinatorics; Mathematics; Discrete mathematics; Graph; Physics","score_opus":0.03249054303481505,"score_gpt":0.30567342501009587,"score_spread":0.27318288197528084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400486017","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6757134,0.0018628747,0.24093942,0.0025043609,0.00055918546,0.0002828209,0.0013426731,0.0005440334,0.07625117],"genre_scores_gemma":[0.95129967,0.0008043395,0.040562667,0.0005528345,0.00041384817,0.00017267832,0.0011197492,0.00014360042,0.0049306075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979241,0.00034912312,0.00017355157,0.00038929356,0.00062616623,0.0005376949],"domain_scores_gemma":[0.98951095,0.0067416285,0.0007981456,0.0004883315,0.001196941,0.0012640832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001759234,0.000933976,0.0011406319,0.0027425417,0.0024700747,0.0022372291,0.0014595288,0.0012811932,0.008129906],"category_scores_gemma":[0.013699254,0.00059124804,0.0010048054,0.0016455357,0.0029318125,0.006465413,0.003606813,0.0020572483,0.0009653704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011255912,0.00017170249,0.00608908,0.0007473902,0.00010741844,0.0022899406,0.00076944043,0.040503696,0.02246144,0.8881776,0.0049345354,0.032622132],"study_design_scores_gemma":[0.00016923764,0.00019156482,0.0017624171,0.0001136471,0.0000661745,0.0012370425,0.0005715154,0.08140101,0.015511934,0.8917433,0.0071423897,0.00008981082],"about_ca_topic_score_codex":0.0012909638,"about_ca_topic_score_gemma":0.0013871389,"teacher_disagreement_score":0.008129906,"about_ca_system_score_codex":0.0011076871,"about_ca_system_score_gemma":0.0010923716,"threshold_uncertainty_score":0.027197182},"labels":[],"label_agreement":null},{"id":"W4400512486","doi":"10.61091/ars159-15","title":"Sharp Upper Bound for Harmonic Index of Trees with Given Total Domination Number","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Universiti Malaysia Terengganu; Universiti Sains Malaysia","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Vertex (graph theory); Graph; Connectivity; Bound graph; Simple graph; Harmonic mean; Topological index; Discrete mathematics; Mathematical analysis; Geometry; Graph power; Line graph","score_opus":0.018183247079297034,"score_gpt":0.29291427582129237,"score_spread":0.27473102874199534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400512486","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71806216,0.0036704852,0.18392596,0.00133181,0.00016097691,0.000064730164,0.0011961288,0.000372722,0.091214985],"genre_scores_gemma":[0.97785425,0.00084644253,0.015615778,0.00015388793,0.0001655031,0.000060594397,0.00046048712,0.00010844522,0.004734406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931264,0.00009147296,0.000023038323,0.00014977127,0.00020023517,0.00022289138],"domain_scores_gemma":[0.99737465,0.0016248923,0.00016275272,0.0002362043,0.00022487371,0.00037662958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000750961,0.00045164672,0.0009089975,0.0022102431,0.0011903696,0.0021232015,0.0014664151,0.0008501196,0.0047283936],"category_scores_gemma":[0.0050044493,0.0003094312,0.00047806636,0.0013264157,0.001316581,0.0026488537,0.001801961,0.0013318824,0.00043779594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035518061,0.00010212036,0.0063053407,0.00036219627,0.00008133891,0.00046185593,0.0007019999,0.038817823,0.027548522,0.88701224,0.0063228663,0.031928357],"study_design_scores_gemma":[0.00002812899,0.000076605575,0.00468648,0.00008081244,0.000063415166,0.00066267274,0.0002449906,0.20696348,0.008134609,0.77207595,0.006914081,0.00006887375],"about_ca_topic_score_codex":0.0006741799,"about_ca_topic_score_gemma":0.0011901803,"teacher_disagreement_score":0.0047283936,"about_ca_system_score_codex":0.0014842404,"about_ca_system_score_gemma":0.00041216798,"threshold_uncertainty_score":0.015818119},"labels":[],"label_agreement":null},{"id":"W4400512519","doi":"10.61091/ars159-09","title":"On the Eccentric Graph of Trees","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Eccentric; Graph; Vertex (graph theory); Complement graph; Bound graph; Discrete mathematics; Graph power; Line graph; Physics","score_opus":0.023725452130310354,"score_gpt":0.2797744487017792,"score_spread":0.25604899657146885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400512519","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69579935,0.0010273908,0.24846527,0.00082608586,0.00008914222,0.000057573536,0.00030111204,0.00013764782,0.053296354],"genre_scores_gemma":[0.943986,0.0013203189,0.04655091,0.00022416894,0.00018049468,0.000054082444,0.00040183842,0.00007508031,0.007207136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996197,0.00010971869,0.000014465605,0.0001092229,0.00007216598,0.000074678144],"domain_scores_gemma":[0.99852127,0.000677618,0.0002569245,0.00015507369,0.00016673861,0.00022237467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039743507,0.00035975978,0.00043722146,0.0011527269,0.0013267499,0.0009701447,0.0005417007,0.0007157749,0.0034441263],"category_scores_gemma":[0.0024234867,0.00021702815,0.0002896661,0.0012130251,0.001832963,0.0029547682,0.0019261946,0.00091801246,0.0004203584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009029399,0.000029104409,0.0015508501,0.00008286458,0.000009802959,0.00050127984,0.0006508208,0.0076706787,0.005416162,0.9679597,0.0012691728,0.014769308],"study_design_scores_gemma":[0.000021452335,0.00006290561,0.0020774805,0.00004472846,0.000024823352,0.0009485633,0.00068972795,0.037994016,0.002226432,0.9375172,0.018372875,0.00001980457],"about_ca_topic_score_codex":0.0012706334,"about_ca_topic_score_gemma":0.0009425387,"teacher_disagreement_score":0.0034441263,"about_ca_system_score_codex":0.00058601977,"about_ca_system_score_gemma":0.00023774178,"threshold_uncertainty_score":0.011521757},"labels":[],"label_agreement":null},{"id":"W4400513380","doi":"10.61091/ars159-03","title":"Full Edge-Friendly Index Sets of One Point Union of Cycles","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Point (geometry); Enhanced Data Rates for GSM Evolution; Geometry; Computer science; Artificial intelligence","score_opus":0.021356344053248058,"score_gpt":0.28971049691793777,"score_spread":0.2683541528646897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400513380","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7171612,0.00094989146,0.20732744,0.00020991314,0.00008898289,0.00016093231,0.0013875661,0.0005659582,0.07214802],"genre_scores_gemma":[0.9163176,0.0006795396,0.06745392,0.00018410721,0.00011295635,0.00027305618,0.0022606486,0.0002947816,0.012423386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988651,0.00013156304,0.0000987064,0.000305771,0.00039396217,0.00020480585],"domain_scores_gemma":[0.99837035,0.00041518122,0.00033645768,0.00028580838,0.00027220524,0.00032003497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051536516,0.00061611424,0.00079743325,0.002784204,0.0019138304,0.0028032935,0.001243673,0.0007837752,0.0051431623],"category_scores_gemma":[0.003010797,0.0005636939,0.0009530136,0.0022080105,0.0014422175,0.003120698,0.0020387066,0.0009999383,0.001090339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025581682,0.00006628454,0.0024417208,0.0001477058,0.000045086148,0.0004512129,0.001027039,0.0093109,0.0065624863,0.9466597,0.0024203034,0.030611886],"study_design_scores_gemma":[0.00004372148,0.00010715375,0.0017175949,0.000078845755,0.00005752712,0.0006130938,0.00042760698,0.048631273,0.005559968,0.9267419,0.015957506,0.00006378296],"about_ca_topic_score_codex":0.0012217689,"about_ca_topic_score_gemma":0.0010530163,"teacher_disagreement_score":0.0051431623,"about_ca_system_score_codex":0.0008860113,"about_ca_system_score_gemma":0.00044981128,"threshold_uncertainty_score":0.017205596},"labels":[],"label_agreement":null},{"id":"W4400596698","doi":"10.55016/ojs/cdm.v14i1.62415","title":"Feedback vertex number of Sierpi\\'{n}ski-type graphs","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Upper and lower bounds; Clique number; Wheel graph; Discrete mathematics; Graph power; Line graph","score_opus":0.016495107194708706,"score_gpt":0.32924276054402213,"score_spread":0.3127476533493134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596698","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.868992,0.00037908106,0.09936645,0.0004659918,0.00007142993,0.00007079192,0.0010171667,0.0009164166,0.028720768],"genre_scores_gemma":[0.98042715,0.00023656327,0.014627642,0.00007884566,0.000030414267,0.00011130075,0.00049273705,0.00007040689,0.003925051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972075,0.00004082362,0.000013038659,0.00006519876,0.00007755788,0.00008264115],"domain_scores_gemma":[0.9984896,0.00072298537,0.00021664402,0.00013264862,0.0001752935,0.00026274446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002728574,0.00038682378,0.00037756303,0.00076971314,0.0007145733,0.000682209,0.0009921759,0.0005611115,0.005334082],"category_scores_gemma":[0.002270851,0.000184486,0.0002697691,0.00056216394,0.00080484635,0.0012065931,0.0005134622,0.0006242858,0.0004555842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009885196,0.00026694412,0.0061182776,0.0006122728,0.00005010279,0.0005639314,0.00078941346,0.11575088,0.13136321,0.65766186,0.008610642,0.07722396],"study_design_scores_gemma":[0.00014310097,0.00030865922,0.0053532966,0.00009502238,0.00007382241,0.00060446485,0.00035208327,0.5132164,0.05397228,0.41641617,0.009381137,0.00008362328],"about_ca_topic_score_codex":0.00146197,"about_ca_topic_score_gemma":0.0034300294,"teacher_disagreement_score":0.005334082,"about_ca_system_score_codex":0.00113365,"about_ca_system_score_gemma":0.0006255091,"threshold_uncertainty_score":0.01784426},"labels":[],"label_agreement":null},{"id":"W4400596718","doi":"10.55016/ojs/cdm.v14i1.62428","title":"Cyclic Orthogonal Double Covers of Circulants by Certain Nerve Cell Graphs.","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Circulant matrix; Circulant graph; Graph; Discrete mathematics; Line graph; Graph power","score_opus":0.01524160891194308,"score_gpt":0.2983028389239839,"score_spread":0.2830612300120408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596718","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7196062,0.0012519604,0.19166747,0.0004620143,0.00032699198,0.000091077585,0.0003792595,0.0001717026,0.08604336],"genre_scores_gemma":[0.94419014,0.00081236725,0.040897615,0.00019521892,0.00015271004,0.00010382079,0.00050527765,0.00006294966,0.013079821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995431,0.0000776012,0.000015392356,0.00010282549,0.0001475183,0.000113591996],"domain_scores_gemma":[0.99942183,0.0001519081,0.00013807179,0.00008325893,0.00008134956,0.0001235916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016977104,0.0003911736,0.0002490634,0.0010375036,0.0012370521,0.0008962226,0.0004654455,0.0004483079,0.0036195612],"category_scores_gemma":[0.00077496696,0.00018980843,0.00031829832,0.0006463847,0.0011046265,0.0011575138,0.0011678399,0.0006981399,0.00030891947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006037031,0.000030031297,0.000824471,0.00008822801,0.000017186201,0.00042136048,0.00029629146,0.0030716932,0.014604122,0.9640621,0.0019297298,0.014594544],"study_design_scores_gemma":[0.00003401162,0.00013858207,0.0043437313,0.0000829383,0.00006661846,0.0030982723,0.00097361236,0.044437815,0.033863515,0.8371741,0.0757202,0.00006651758],"about_ca_topic_score_codex":0.0010566083,"about_ca_topic_score_gemma":0.0015278269,"teacher_disagreement_score":0.0036195612,"about_ca_system_score_codex":0.00054686074,"about_ca_system_score_gemma":0.00030485907,"threshold_uncertainty_score":0.012108624},"labels":[],"label_agreement":null},{"id":"W4400596773","doi":"10.55016/ojs/cdm.v15i1.62697","title":"Corrigendum to ``\"On the enumeration of a class of toroidal graphs\" [Contrib. Discrete Math. 13 (2018), no. 1, 79-119]","year":2020,"lang":"en","type":"erratum","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enumeration; Toroid; Class (philosophy); Mathematics; Combinatorics; Discrete mathematics; Computer science; Physics; Plasma; Quantum mechanics; Artificial intelligence","score_opus":0.03011817204652721,"score_gpt":0.2997804728554948,"score_spread":0.2696623008089676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596773","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.00030413884,0.0065330123,0.0029074166,0.09272656,0.8002137,0.000064996624,0.0026997179,0.0010311723,0.093519345],"genre_scores_gemma":[0.010797295,0.012994428,0.005057678,0.05250057,0.13366577,0.0002051788,0.0045476956,0.0021491556,0.77808213],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962513,0.0005642346,0.00024901755,0.0006865157,0.0018826538,0.0003663065],"domain_scores_gemma":[0.9890147,0.001981796,0.00041074163,0.00084210304,0.007030051,0.0007206128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022189443,0.0017907849,0.0019656818,0.0036392582,0.0036139542,0.0042938148,0.0028779113,0.004000704,0.18048695],"category_scores_gemma":[0.018482085,0.00083643023,0.0016470498,0.002699009,0.0027588054,0.005686247,0.0027064777,0.0076840986,0.09997512],"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.000008988049,0.000004167341,0.000017030185,0.000061163984,0.0000030312153,0.000018702573,0.000011651929,0.000024460356,0.000030222169,0.004105749,0.99231917,0.0033955858],"study_design_scores_gemma":[0.000010196665,0.0000107056385,0.00031191486,0.00015509932,0.000014282361,0.00009598537,0.000037843754,0.0001790524,0.00023178528,0.011224706,0.9877037,0.000024865898],"about_ca_topic_score_codex":0.014386087,"about_ca_topic_score_gemma":0.022631194,"teacher_disagreement_score":0.18048695,"about_ca_system_score_codex":0.0074782874,"about_ca_system_score_gemma":0.0032457258,"threshold_uncertainty_score":0.603789},"labels":[],"label_agreement":null},{"id":"W4400596830","doi":"10.55016/ojs/cdm.v15i3.68174","title":"Degree sequence of the generalized Sierpiński graph","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Sierpinski triangle; Combinatorics; Mathematics; Degree (music); Discrete mathematics; Fractal; Graph; Sequence (biology)","score_opus":0.08688189845068182,"score_gpt":0.34426589242265393,"score_spread":0.2573839939719721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596830","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9481562,0.0004649036,0.038963705,0.00018197589,0.000047565372,0.000020052134,0.00034783845,0.00009818352,0.011719586],"genre_scores_gemma":[0.98952544,0.0004255662,0.0073470264,0.000046555193,0.000044077737,0.00002509137,0.0002743446,0.000025784719,0.00228613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99986386,0.000020882268,0.000006936359,0.000038066933,0.000034690333,0.000035623572],"domain_scores_gemma":[0.9994967,0.00015518552,0.00009566265,0.000039763174,0.00008418756,0.00012837585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014618532,0.00022180474,0.0002389904,0.0012885714,0.00042870306,0.0006447883,0.00036117545,0.00026770044,0.0011649993],"category_scores_gemma":[0.001115077,0.00015319092,0.00021048631,0.00050704076,0.0007879745,0.0010676765,0.0003978452,0.0005145908,0.00016920718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015240061,0.00004534609,0.0068300734,0.00015034841,0.000017000697,0.00036834885,0.0005817275,0.026659794,0.037139557,0.89922816,0.0020615605,0.026765687],"study_design_scores_gemma":[0.00003279864,0.00011902508,0.014305936,0.00005902517,0.000027156277,0.0007429808,0.00032481962,0.18088655,0.01566486,0.7760268,0.011712788,0.00009726447],"about_ca_topic_score_codex":0.0014291505,"about_ca_topic_score_gemma":0.0017145877,"teacher_disagreement_score":0.0014291505,"about_ca_system_score_codex":0.0005253359,"about_ca_system_score_gemma":0.0003080592,"threshold_uncertainty_score":0.0038973093},"labels":[],"label_agreement":null},{"id":"W4400597037","doi":"10.55016/ojs/cdm.v16i3.71273","title":"Oriented unicyclic graphs with minimal skew Randić energy","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Sigma; Graph; Skew-symmetric matrix; Skew; Eigenvalues and eigenvectors; Physics; Symmetric matrix; Square matrix","score_opus":0.014509283144606405,"score_gpt":0.29761211877887217,"score_spread":0.28310283563426575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400597037","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87602216,0.0006109472,0.041318838,0.00048475724,0.00013792384,0.00007257645,0.0007198024,0.00033489647,0.080298126],"genre_scores_gemma":[0.97756803,0.00033824414,0.011818655,0.00020115246,0.000038736394,0.00007027693,0.00061964727,0.00008439676,0.009260958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997756,0.000039468323,0.000012375548,0.000039470655,0.00006437624,0.00006870556],"domain_scores_gemma":[0.99950707,0.000109330846,0.00012117043,0.00006516394,0.00008774238,0.000109611676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012533095,0.00038003613,0.00041548608,0.001028689,0.00078462367,0.0011335707,0.0005013847,0.0006248427,0.0047321157],"category_scores_gemma":[0.0009075982,0.00033345103,0.00023524277,0.0010273135,0.00067210966,0.0006168807,0.00078289397,0.0004479886,0.0007333471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003363061,0.0000749974,0.0018066169,0.00030718386,0.000038196362,0.00081079185,0.00033707992,0.030233335,0.015413472,0.9031157,0.008445149,0.039081175],"study_design_scores_gemma":[0.000111763155,0.0001237594,0.0032304497,0.00008505947,0.000048307982,0.001302104,0.00041301077,0.097333916,0.008122901,0.8716187,0.017536825,0.00007330523],"about_ca_topic_score_codex":0.0007326521,"about_ca_topic_score_gemma":0.0014256163,"teacher_disagreement_score":0.0047321157,"about_ca_system_score_codex":0.0005078735,"about_ca_system_score_gemma":0.00035835002,"threshold_uncertainty_score":0.015830457},"labels":[],"label_agreement":null},{"id":"W4401977103","doi":"10.28924/2291-8639-22-2024-144","title":"Some Entire Topological Indices of Specific Graph Families","year":2024,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"University of Jeddah","keywords":"Mathematics; Graph; Topology (electrical circuits); Discrete mathematics; Combinatorics","score_opus":0.025064513926776364,"score_gpt":0.3345749618111878,"score_spread":0.3095104478844114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401977103","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91482645,0.00046011084,0.070671454,0.0001108756,0.000025828036,0.00002412738,0.00021576315,0.00016115821,0.0135041615],"genre_scores_gemma":[0.9814556,0.00021134054,0.016563445,0.00003113544,0.00002419017,0.00003211953,0.0002461681,0.000057564994,0.001378358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997625,0.00004870194,0.000014567827,0.0000689397,0.00006193839,0.000043425684],"domain_scores_gemma":[0.9981931,0.00068546226,0.0003734835,0.00027436,0.00030439606,0.00016921267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060200744,0.00025711526,0.00032253243,0.002138475,0.0006974513,0.0010646948,0.0006540069,0.0003928832,0.0023245553],"category_scores_gemma":[0.0034873097,0.00020840028,0.00035298822,0.00097341585,0.0010872963,0.0028372314,0.00054807344,0.00060626375,0.00016200254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010614093,0.00004399644,0.011661721,0.00010626733,0.000032567164,0.00027220318,0.0007260067,0.019067809,0.012980418,0.9272252,0.0013934962,0.026384102],"study_design_scores_gemma":[0.00002084782,0.00013029603,0.015199845,0.000052910913,0.00005076532,0.0009443601,0.0008552331,0.16123451,0.0064487397,0.8079887,0.0070104455,0.00006335331],"about_ca_topic_score_codex":0.0006206142,"about_ca_topic_score_gemma":0.00075457786,"teacher_disagreement_score":0.0023245553,"about_ca_system_score_codex":0.00068743306,"about_ca_system_score_gemma":0.00024706885,"threshold_uncertainty_score":0.0077763796},"labels":[],"label_agreement":null},{"id":"W4402033864","doi":"10.1007/s40879-024-00763-z","title":"On the distribution of eigenvalues in families of Cayley graphs","year":2024,"lang":"en","type":"article","venue":"European Journal of Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec; Simons Foundation","keywords":"Cayley graph; Mathematics; Eigenvalues and eigenvectors; Combinatorics; Distribution (mathematics); Genealogy; History; Graph; Physics; Mathematical analysis","score_opus":0.04196215865936147,"score_gpt":0.2868028208268555,"score_spread":0.244840662167494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402033864","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9039401,0.0011872206,0.08298825,0.0012844036,0.000092261274,0.000043664677,0.00044612025,0.0003109032,0.009707169],"genre_scores_gemma":[0.9909899,0.000904987,0.005058291,0.00010536181,0.00014573066,0.00006646836,0.0003486009,0.0001272689,0.002253289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888366,0.00048629678,0.000034741104,0.00020636956,0.000233933,0.0001549589],"domain_scores_gemma":[0.96606565,0.026629202,0.0021683213,0.0012534556,0.001983082,0.0019002344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030887653,0.0006450471,0.0013097086,0.0049676537,0.001560742,0.002881296,0.002535718,0.0017102658,0.00731861],"category_scores_gemma":[0.024818888,0.00092851534,0.00066945766,0.0022324454,0.0036599475,0.004395259,0.0015781583,0.0018388045,0.0005171051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005040568,0.00022034337,0.012301011,0.00027041355,0.00010993579,0.0005371216,0.0016709698,0.066076405,0.009200231,0.8818617,0.007154852,0.020093009],"study_design_scores_gemma":[0.00010733233,0.00008324953,0.0073113088,0.00013901074,0.000040290983,0.00050093164,0.0009061518,0.31930596,0.0014274298,0.66842127,0.0016602828,0.000096791686],"about_ca_topic_score_codex":0.0023108788,"about_ca_topic_score_gemma":0.002072834,"teacher_disagreement_score":0.00731861,"about_ca_system_score_codex":0.0016856784,"about_ca_system_score_gemma":0.00064080354,"threshold_uncertainty_score":0.024483204},"labels":[],"label_agreement":null},{"id":"W4402111019","doi":"10.5539/ijsp.v13n3p16","title":"Extended Second-Order Moment Symmetry Model and Decomposition of Symmetry Model for Ordinal Square Contingency Tables","year":2024,"lang":"en","type":"article","venue":"International Journal of Statistics and Probability","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Contingency table; Square (algebra); Symmetry (geometry); Order (exchange); Moment (physics); Applied mathematics; Combinatorics; Statistics; Geometry; Physics","score_opus":0.032350625442808714,"score_gpt":0.3468881659220476,"score_spread":0.3145375404792389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402111019","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.04167739,0.0004178318,0.95201576,0.00055430335,0.00012424287,0.00015058312,0.001036927,0.00024201292,0.0037809256],"genre_scores_gemma":[0.8346299,0.0006038656,0.15483597,0.0002947126,0.00025771392,0.0005488258,0.0024595282,0.00010618268,0.006263226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951894,0.0022419826,0.00023044148,0.0009116846,0.00097061874,0.0004559449],"domain_scores_gemma":[0.99113244,0.004228835,0.0014114624,0.0014039888,0.0014805697,0.00034268148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005200107,0.0009426653,0.0010923643,0.002057025,0.0006182062,0.002020246,0.0016618605,0.0008937232,0.006259195],"category_scores_gemma":[0.015210675,0.00046120142,0.0019706571,0.002740453,0.0014081467,0.0035075697,0.0011228337,0.0018396212,0.0011716651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029092713,0.00018925322,0.024165105,0.00031844192,0.00040745892,0.00065926404,0.0009741833,0.16674103,0.0024504152,0.7027391,0.009977653,0.09108714],"study_design_scores_gemma":[0.000035167322,0.00011776562,0.005579344,0.000055753513,0.00006123086,0.0002845888,0.0001835932,0.6239253,0.00041488936,0.36466736,0.004613029,0.000061886785],"about_ca_topic_score_codex":0.0046976632,"about_ca_topic_score_gemma":0.0034596126,"teacher_disagreement_score":0.006259195,"about_ca_system_score_codex":0.0015284183,"about_ca_system_score_gemma":0.0016863509,"threshold_uncertainty_score":0.027501106},"labels":[],"label_agreement":null},{"id":"W4402264813","doi":"10.23919/acc60939.2024.10644709","title":"Mean Field Games on Dense and Sparse Networks: The Graphexon MFG Equations","year":2024,"lang":"en","type":"article","venue":"","topic":"Graph theory and applications","field":"Mathematics","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":"Carleton University; McGill University","funders":"","keywords":"Computer science; Field (mathematics); Mathematics","score_opus":0.046681946717591995,"score_gpt":0.3063054624079805,"score_spread":0.2596235156903885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402264813","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.217924,0.00446459,0.6504663,0.020379668,0.00069722737,0.00019101298,0.0016562806,0.00044728979,0.10377362],"genre_scores_gemma":[0.83756226,0.0031410109,0.06916275,0.0028796005,0.00088835973,0.0007116522,0.0010627868,0.0002637451,0.0843279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994092,0.00023902844,0.000020775478,0.000101622354,0.00010687506,0.00012256464],"domain_scores_gemma":[0.9965526,0.002267189,0.00031591,0.00013377097,0.0002933749,0.00043718403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023377489,0.0012031266,0.0016367588,0.0016666426,0.00092093286,0.0022516467,0.0023168363,0.0040902873,0.009762353],"category_scores_gemma":[0.011537413,0.0005786435,0.0013584256,0.0010234241,0.002441637,0.005030726,0.002143085,0.0031136952,0.0008146996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020144036,0.00001444364,0.00036761715,0.00004511484,0.00001589731,0.00007109999,0.000087075074,0.031868592,0.00019716237,0.9604091,0.004147801,0.002755889],"study_design_scores_gemma":[0.000025050014,0.000012769549,0.00026360605,0.000028234866,0.000008197138,0.00003973049,0.000039104565,0.32307488,0.000053912092,0.6749355,0.0015005196,0.000018432518],"about_ca_topic_score_codex":0.010852553,"about_ca_topic_score_gemma":0.007076677,"teacher_disagreement_score":0.010852553,"about_ca_system_score_codex":0.0032372861,"about_ca_system_score_gemma":0.0014923221,"threshold_uncertainty_score":0.03265828},"labels":[],"label_agreement":null},{"id":"W4402587880","doi":"10.1080/03081087.2024.2404453","title":"Bipartite unicyclic graphs with a unique perfect matching having the smallest positive eigenvalue equal to √2 − 1","year":2024,"lang":"en","type":"article","venue":"Linear and Multilinear Algebra","topic":"Graph theory and applications","field":"Mathematics","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 Manitoba","funders":"Council of Scientific and Industrial Research, India","keywords":"Bipartite graph; Combinatorics; Matching (statistics); Mathematics; Eigenvalues and eigenvectors; Discrete mathematics; Graph; Statistics; Physics","score_opus":0.029065870948228625,"score_gpt":0.31973202747632906,"score_spread":0.29066615652810046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402587880","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88248485,0.00079507596,0.08163919,0.00059829553,0.000047851634,0.000038793292,0.00045488306,0.00013881923,0.033802282],"genre_scores_gemma":[0.9843237,0.00029049677,0.012330751,0.000083568564,0.00003310676,0.000040100233,0.00023361044,0.000017356655,0.002647311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998348,0.000034203145,0.000009527063,0.00004774529,0.000031349206,0.00004241171],"domain_scores_gemma":[0.99946684,0.00017028794,0.00016691753,0.00005797552,0.00006690625,0.00007102382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016566226,0.00026304187,0.0002815623,0.0009660987,0.0006924071,0.00073704775,0.00038960943,0.0005043929,0.0016181375],"category_scores_gemma":[0.0012520184,0.00017400744,0.00018944338,0.0009188302,0.0008567962,0.0008401393,0.000605053,0.0004146739,0.000204063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015453734,0.000049053986,0.0018912909,0.00015517577,0.000029022589,0.0003431292,0.00037680523,0.01135391,0.016387774,0.9428698,0.003990051,0.022399465],"study_design_scores_gemma":[0.000020918354,0.00004501552,0.002296569,0.000033966473,0.000016500333,0.0006883258,0.00026998448,0.06649576,0.004774473,0.9199753,0.0053607817,0.000022527121],"about_ca_topic_score_codex":0.00053838367,"about_ca_topic_score_gemma":0.0009321398,"teacher_disagreement_score":0.0016181375,"about_ca_system_score_codex":0.0003624584,"about_ca_system_score_gemma":0.00021461357,"threshold_uncertainty_score":0.0054132342},"labels":[],"label_agreement":null},{"id":"W4402877840","doi":"10.28924/2291-8639-22-2024-162","title":"Some Results on the Degree of Vertices of the Power Digraph and Its Complement","year":2024,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Complement (music); Mathematics; Degree (music); Power (physics); Combinatorics; Chemistry; Thermodynamics","score_opus":0.06290431162987319,"score_gpt":0.34343049068206777,"score_spread":0.28052617905219457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402877840","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5653018,0.007776369,0.32434824,0.0017901032,0.000365324,0.00010189462,0.0011252647,0.00015067337,0.0990404],"genre_scores_gemma":[0.95356095,0.0035456477,0.03372293,0.00020496566,0.00033254348,0.00007774427,0.0005338109,0.00006827138,0.0079532815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993375,0.00011699358,0.0000393769,0.00023630918,0.00014526314,0.00012451172],"domain_scores_gemma":[0.99535793,0.0030369032,0.00039359726,0.00036277436,0.00038211164,0.00046669613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011101348,0.0006037068,0.00079780875,0.0028759954,0.0013851725,0.0015187323,0.0011597516,0.0006402081,0.004036325],"category_scores_gemma":[0.005230221,0.00039328568,0.0012106149,0.0021831559,0.0020704377,0.0039327187,0.0011894696,0.0018612108,0.00028223151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103559396,0.000057588,0.003409813,0.00022927414,0.00003806712,0.00023557142,0.00058982114,0.013866794,0.004405961,0.95666707,0.001229542,0.019166883],"study_design_scores_gemma":[0.000023348244,0.000111305526,0.0031858534,0.0000843889,0.00008956248,0.00044132068,0.000316017,0.03898995,0.0030528153,0.9443452,0.009315135,0.000045097204],"about_ca_topic_score_codex":0.0021745295,"about_ca_topic_score_gemma":0.0023543416,"teacher_disagreement_score":0.004036325,"about_ca_system_score_codex":0.0016976407,"about_ca_system_score_gemma":0.0006776468,"threshold_uncertainty_score":0.013502896},"labels":[],"label_agreement":null},{"id":"W4403073076","doi":"10.1063/5.0222792","title":"Two-sided Lieb–Thirring bounds","year":2024,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Thirring model; Mathematical physics; Mathematics; Physics; Pure mathematics; Algebra over a field; Fermion; Quantum mechanics","score_opus":0.054271036891294006,"score_gpt":0.3600428778399256,"score_spread":0.30577184094863163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403073076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15687594,0.0028464578,0.73216784,0.003949626,0.00044113694,0.00009481815,0.0002566409,0.00042067817,0.102946885],"genre_scores_gemma":[0.857959,0.0020092605,0.10865854,0.0013398763,0.00065182144,0.0003899664,0.00022642974,0.00030970626,0.028455459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820757,0.0005340182,0.00008223019,0.00029243244,0.0005465603,0.0003372193],"domain_scores_gemma":[0.99180627,0.0051124864,0.0005240083,0.00077510835,0.0009732886,0.00080890855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004172839,0.0017346728,0.0011544533,0.0030671763,0.0012160144,0.0021673557,0.0020888925,0.001472695,0.007931283],"category_scores_gemma":[0.01205529,0.00051982066,0.0019175821,0.0009451268,0.0048204875,0.0059772413,0.00533085,0.005144114,0.0013643509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069914335,0.000041376283,0.00042860696,0.00013147674,0.000024546802,0.00015833658,0.00032327938,0.00716895,0.0055895606,0.97740847,0.00133576,0.0073198183],"study_design_scores_gemma":[0.000016412276,0.000064528824,0.00053479115,0.000058387686,0.000022213286,0.0001750192,0.00009296787,0.11491756,0.003998733,0.8770985,0.0029793542,0.00004152577],"about_ca_topic_score_codex":0.0006665076,"about_ca_topic_score_gemma":0.00062526745,"teacher_disagreement_score":0.007931283,"about_ca_system_score_codex":0.0014249812,"about_ca_system_score_gemma":0.00063359085,"threshold_uncertainty_score":0.026532829},"labels":[],"label_agreement":null},{"id":"W4403097226","doi":"10.37236/12040","title":"Hamiltonians of Bipartite Walks","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bipartite graph; Random walk; Mathematics; Combinatorics; Statistics; Graph","score_opus":0.01865481315606235,"score_gpt":0.3070295926730617,"score_spread":0.2883747795169993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403097226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39664266,0.001142037,0.4567678,0.0014544184,0.00041002754,0.00015663126,0.00045430992,0.00052076456,0.14245151],"genre_scores_gemma":[0.96601874,0.00028575218,0.020246128,0.0003459762,0.00009311166,0.000107712905,0.00017911219,0.00009067517,0.012632934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995408,0.00014084991,0.000018677678,0.00006851298,0.00013396368,0.00009723766],"domain_scores_gemma":[0.9995993,0.00012967888,0.00004736312,0.00008208086,0.000054735494,0.000086943626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003529285,0.00028054405,0.00033305294,0.0006269741,0.00080686284,0.00088587543,0.000505373,0.0009433203,0.008154879],"category_scores_gemma":[0.0012257332,0.00024146521,0.0004407632,0.00039998489,0.0016945815,0.0017307658,0.0012837963,0.00090357853,0.000587033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000607273,0.000010077417,0.00005780231,0.000014573919,0.0000023652387,0.000042035397,0.000058671205,0.0022572917,0.0010347385,0.9946578,0.0004308293,0.0014275933],"study_design_scores_gemma":[0.000014180927,0.000019002471,0.0001481204,0.000011297882,0.0000028811482,0.00008567532,0.000057574463,0.035594177,0.0005295575,0.9600675,0.0034587202,0.000011251905],"about_ca_topic_score_codex":0.000924449,"about_ca_topic_score_gemma":0.00071443233,"teacher_disagreement_score":0.008154879,"about_ca_system_score_codex":0.00058584753,"about_ca_system_score_gemma":0.000412554,"threshold_uncertainty_score":0.027280748},"labels":[],"label_agreement":null},{"id":"W4403165970","doi":"10.61091/um120-07","title":"On Some Classes of Cycles-Related Γ -Harmonious Graphs","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.03520961918562015,"score_gpt":0.32322611184287087,"score_spread":0.2880164926572507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165970","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87632036,0.0005148421,0.056659244,0.0005167903,0.000047512298,0.00008978958,0.00027512084,0.00013920736,0.0654372],"genre_scores_gemma":[0.97666454,0.00044055542,0.011665927,0.00017098576,0.00007797006,0.000094600546,0.0003280529,0.00005398284,0.010503297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995938,0.000072329945,0.000019118266,0.00014279052,0.00008689773,0.00008521096],"domain_scores_gemma":[0.9992011,0.00024519244,0.00022349568,0.000100028396,0.00008830422,0.00014200655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030439236,0.00030016014,0.00024984468,0.0017303753,0.0013693188,0.0012973382,0.0006697024,0.0006310759,0.0050098496],"category_scores_gemma":[0.0012532179,0.00033979642,0.00049503765,0.0012435,0.0015911206,0.0020059492,0.0011005364,0.0007441034,0.00034961186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002920565,0.000025519043,0.0012654794,0.00003776026,0.000012563997,0.00022446639,0.0006183426,0.0033664713,0.0020979275,0.98409516,0.0007672466,0.007459895],"study_design_scores_gemma":[0.000020410382,0.000041299758,0.0021977376,0.000032682452,0.000020087702,0.00042666483,0.0006652222,0.019199608,0.0014011572,0.9655745,0.010399872,0.000020732054],"about_ca_topic_score_codex":0.0015624416,"about_ca_topic_score_gemma":0.0012564283,"teacher_disagreement_score":0.0050098496,"about_ca_system_score_codex":0.0009199879,"about_ca_system_score_gemma":0.0002740089,"threshold_uncertainty_score":0.016759634},"labels":[],"label_agreement":null},{"id":"W4403166163","doi":"10.61091/jcmcc122-28","title":"The Multiplicative Sum Zagreb Indices of Graphs with Given Clique Number","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Clique; Multiplicative function; Mathematics; Combinatorics; Clique number; Discrete mathematics; Graph; Mathematical analysis","score_opus":0.01624176467393727,"score_gpt":0.2938648754923374,"score_spread":0.27762311081840013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403166163","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7242111,0.001519925,0.21384238,0.00051197084,0.0001548082,0.00006046659,0.00065543136,0.0002963618,0.05874759],"genre_scores_gemma":[0.9577918,0.00057956896,0.037380803,0.00011379025,0.00012281761,0.00006083984,0.00044543634,0.0000830978,0.0034218058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996043,0.00008150132,0.000021042348,0.00012960657,0.00009481985,0.00006871024],"domain_scores_gemma":[0.99899143,0.00043698397,0.00021612213,0.00011097928,0.0001294682,0.00011496103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045811088,0.00040072604,0.00044397768,0.0020843062,0.00091154873,0.0016960179,0.0007174736,0.00048706375,0.0026246544],"category_scores_gemma":[0.0025686377,0.00022197994,0.00032872212,0.0011308452,0.0011741543,0.002086959,0.00064985023,0.00072075013,0.0002930223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012840256,0.00004071352,0.0039282977,0.00019613498,0.000043591386,0.00024006722,0.00026381444,0.013868279,0.018791143,0.92455554,0.0019354817,0.03600865],"study_design_scores_gemma":[0.0000142871495,0.00006702504,0.00489125,0.000041102146,0.00003900137,0.0006652445,0.00016489661,0.069854684,0.0064728493,0.9099678,0.0077762995,0.00004543687],"about_ca_topic_score_codex":0.00039913546,"about_ca_topic_score_gemma":0.00066685193,"teacher_disagreement_score":0.0026246544,"about_ca_system_score_codex":0.00059124833,"about_ca_system_score_gemma":0.00030383657,"threshold_uncertainty_score":0.00878036},"labels":[],"label_agreement":null},{"id":"W4403572595","doi":"10.1016/j.dam.2024.10.001","title":"Distance Laplacian spectra of graphs: A survey","year":2024,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Combinatorics; Laplace operator; Spectral line; Discrete mathematics; Mathematical analysis","score_opus":0.035698751838526124,"score_gpt":0.3067660870989439,"score_spread":0.27106733526041776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403572595","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.083533205,0.4970047,0.32634464,0.0069566634,0.0011978855,0.00008046919,0.00084966584,0.0005479301,0.08348489],"genre_scores_gemma":[0.49590343,0.3924276,0.091202095,0.0021657008,0.005265991,0.00010818847,0.001197338,0.0003106276,0.011419104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993406,0.00012128064,0.0000434443,0.0002175167,0.00022663586,0.000050488055],"domain_scores_gemma":[0.9977215,0.0014583747,0.00015025066,0.00019669536,0.00033910797,0.00013408046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007921529,0.0007281791,0.0011175185,0.004408709,0.00080130284,0.002924195,0.0013106526,0.0011504507,0.0030484246],"category_scores_gemma":[0.0033496674,0.00057289895,0.0006128983,0.0056303455,0.0017633699,0.0047549247,0.0015492811,0.001929258,0.0008575623],"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.00006605827,0.00019743902,0.0022419933,0.0019291842,0.0000875367,0.0001435226,0.0005259066,0.008019926,0.002594781,0.65817696,0.010822466,0.31519428],"study_design_scores_gemma":[0.000014477044,0.00006719592,0.0016709999,0.0002917803,0.000037516085,0.00089081837,0.00042023338,0.02439054,0.0013143726,0.8957891,0.07505868,0.00005428397],"about_ca_topic_score_codex":0.0007423469,"about_ca_topic_score_gemma":0.00063884794,"teacher_disagreement_score":0.004408709,"about_ca_system_score_codex":0.0011292042,"about_ca_system_score_gemma":0.000652411,"threshold_uncertainty_score":0.010197997},"labels":[],"label_agreement":null},{"id":"W4403633514","doi":"10.1016/j.laa.2024.10.016","title":"Laplacian {−1,0,1}- and {−1,1}-diagonalizable graphs","year":2024,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University; Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Canada Foundation for Innovation","keywords":"Diagonalizable matrix; Mathematics; Combinatorics; Laplace operator; Laplacian matrix; Eigenvalues and eigenvectors; Discrete mathematics; Graph; Pure mathematics; Mathematical analysis; Symmetric matrix","score_opus":0.025656693105596137,"score_gpt":0.30687753168674275,"score_spread":0.2812208385811466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403633514","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83473164,0.00052434584,0.11476524,0.0005174668,0.00006719709,0.000058568545,0.00053759926,0.00024203933,0.048555948],"genre_scores_gemma":[0.9770907,0.0003285269,0.015515707,0.00011442295,0.000058189038,0.00003738799,0.00044619042,0.000043120526,0.0063657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998061,0.000026979278,0.0000097066595,0.000055800625,0.00005341169,0.000048112783],"domain_scores_gemma":[0.99950373,0.00014896976,0.000105968655,0.00006040435,0.00008362577,0.00009729481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017428423,0.000275584,0.000247864,0.00089988316,0.0005712691,0.0007898599,0.0004131266,0.0003510015,0.002972704],"category_scores_gemma":[0.00088119926,0.00016302046,0.0002746484,0.00061778305,0.00097578595,0.0009107305,0.00044946795,0.0004730546,0.00027378666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007666903,0.000035265577,0.0015313741,0.00006864556,0.000014978953,0.00026669673,0.0002984268,0.008374673,0.014506345,0.9562313,0.0021048805,0.01649074],"study_design_scores_gemma":[0.000019824522,0.000041510983,0.0022998648,0.0000239793,0.000016456277,0.00045052895,0.00030786142,0.046946496,0.006227411,0.9369861,0.0066542854,0.000025613816],"about_ca_topic_score_codex":0.0006328823,"about_ca_topic_score_gemma":0.0008198294,"teacher_disagreement_score":0.002972704,"about_ca_system_score_codex":0.00035320065,"about_ca_system_score_gemma":0.00028985532,"threshold_uncertainty_score":0.009944618},"labels":[],"label_agreement":null},{"id":"W4403976080","doi":"10.55016/ojs/cdm.v19i3.72597","title":"Some results about star-factors in graphs","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"Star (game theory); Combinatorics; Mathematics","score_opus":0.026070265175263486,"score_gpt":0.3353275022472045,"score_spread":0.30925723707194097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403976080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1282352,0.022979757,0.5265879,0.0047601885,0.0013168141,0.00025408025,0.0041048382,0.0021659462,0.30959523],"genre_scores_gemma":[0.7183325,0.024470372,0.12143036,0.0031570399,0.0038778596,0.00043458948,0.006336502,0.00226201,0.119698875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886835,0.00016531619,0.000076583245,0.0003665494,0.00031011662,0.00021319452],"domain_scores_gemma":[0.9976974,0.0011403974,0.00023183908,0.0002525704,0.00033125246,0.00034653433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011134439,0.001748474,0.0012153138,0.0035088914,0.0020466684,0.0026024561,0.0013998635,0.0011330459,0.023641292],"category_scores_gemma":[0.003910304,0.00085529697,0.0027574257,0.0054411534,0.002906355,0.006869667,0.0019134614,0.0033659423,0.00436878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001222411,0.000078891,0.0012355278,0.00054756296,0.00005763713,0.00023306784,0.0009346661,0.0060331444,0.0020505951,0.9286391,0.016424766,0.043642726],"study_design_scores_gemma":[0.00002199958,0.00007385021,0.001129583,0.00009739011,0.000057219724,0.00034823333,0.00026829203,0.0118483305,0.0009910689,0.9444832,0.04064821,0.00003260543],"about_ca_topic_score_codex":0.004464288,"about_ca_topic_score_gemma":0.0036371686,"teacher_disagreement_score":0.023641292,"about_ca_system_score_codex":0.0020899484,"about_ca_system_score_gemma":0.0006876735,"threshold_uncertainty_score":0.07908797},"labels":[],"label_agreement":null},{"id":"W4404095250","doi":"10.1016/j.laa.2024.10.028","title":"Digraphs with few distinct eigenvalues","year":2024,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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":"Carleton University; The Scarborough Hospital","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Combinatorics; Pure mathematics","score_opus":0.025583561173155543,"score_gpt":0.30184383071573767,"score_spread":0.27626026954258215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404095250","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6806184,0.00039018344,0.2849702,0.0005239948,0.000063499676,0.0000671464,0.0007612085,0.00037319728,0.03223219],"genre_scores_gemma":[0.9634384,0.00016564164,0.03065546,0.00014970257,0.000026621974,0.00005960245,0.00036340018,0.000031069972,0.0051101134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997249,0.000062233536,0.000020349531,0.00010406106,0.000044564058,0.00004383422],"domain_scores_gemma":[0.99850744,0.0008175204,0.00019845495,0.00015155156,0.0001623319,0.00016262894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015484041,0.0002753156,0.0003095448,0.00078761,0.00065471535,0.0009911852,0.0002348058,0.00039913337,0.0032831966],"category_scores_gemma":[0.0015489351,0.00019473495,0.00023207089,0.00043830936,0.0008861607,0.0010328704,0.0005522407,0.0004740375,0.00057791406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019142053,0.00008658936,0.0033044568,0.0002416261,0.000037809303,0.00044650026,0.000502761,0.019236362,0.035063125,0.90728104,0.0028117294,0.030796552],"study_design_scores_gemma":[0.00003042173,0.000063033,0.001521908,0.000035795547,0.000020293148,0.0005044649,0.00028542336,0.051135704,0.0062242653,0.9327518,0.007392031,0.00003488517],"about_ca_topic_score_codex":0.00038891868,"about_ca_topic_score_gemma":0.0008614501,"teacher_disagreement_score":0.0032831966,"about_ca_system_score_codex":0.0004475786,"about_ca_system_score_gemma":0.0002568734,"threshold_uncertainty_score":0.0109834075},"labels":[],"label_agreement":null},{"id":"W4404244279","doi":"10.1088/1742-6596/2886/1/012007","title":"Distance and Degree Based Topological Indices of Cog-Wheel Graph, n-Barbell Graph and Boron Kagome Lattice","year":2024,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Graph theory and applications","field":"Mathematics","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":"Horizon College and Seminary","funders":"","keywords":"Cog; Graph; Lattice (music); Mathematics; Combinatorics; Topology (electrical circuits); Discrete mathematics; Physics; Computer science; Artificial intelligence","score_opus":0.06352342086674807,"score_gpt":0.30838907113951947,"score_spread":0.2448656502727714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404244279","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9368105,0.00013714952,0.056376025,0.00010880286,0.000017195145,0.000015185375,0.00037430265,0.00010331945,0.0060574613],"genre_scores_gemma":[0.9910296,0.000053204458,0.007863241,0.0000062689305,0.0000070146516,0.000006950399,0.0001926044,0.000010555264,0.00083046587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99988675,0.000020330459,0.000004693868,0.000025810072,0.000042048625,0.000020353857],"domain_scores_gemma":[0.9993013,0.00024096952,0.00019062076,0.00006618319,0.00012405905,0.00007694617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015553784,0.00017031241,0.00016743086,0.0014154494,0.00027762912,0.0005131292,0.00029236206,0.0002563936,0.0018875828],"category_scores_gemma":[0.0015000935,0.00007788715,0.000179141,0.00068943185,0.00045316215,0.0008236145,0.00029350238,0.00022807506,0.00014162254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071743614,0.00017734089,0.06902205,0.000360471,0.00008255856,0.00067743385,0.0005185275,0.35821876,0.051050153,0.38903633,0.0042529176,0.12588611],"study_design_scores_gemma":[0.00002887166,0.00022977643,0.03651393,0.000035572266,0.00003215603,0.00069130765,0.00038226723,0.76655114,0.013881968,0.17699029,0.0046029417,0.00005996478],"about_ca_topic_score_codex":0.0017610824,"about_ca_topic_score_gemma":0.0019763345,"teacher_disagreement_score":0.0018875828,"about_ca_system_score_codex":0.00046853148,"about_ca_system_score_gemma":0.00021493057,"threshold_uncertainty_score":0.0063146353},"labels":[],"label_agreement":null},{"id":"W4404344798","doi":"10.48550/arxiv.2411.00250","title":"Minimum number of distinct eigenvalues of distance-regular and signed Johnson graphs","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph theory and applications","field":"Mathematics","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; Hebei Normal University","keywords":"Eigenvalues and eigenvectors; Mathematics; Combinatorics; Discrete mathematics; Physics","score_opus":0.06256083160357898,"score_gpt":0.23321140194466947,"score_spread":0.1706505703410905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404344798","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8267468,0.0002976982,0.16045056,0.000517975,0.000049576163,0.000042611853,0.00041665422,0.00018916244,0.011289026],"genre_scores_gemma":[0.96256834,0.00018946618,0.032079525,0.00006709,0.000058406153,0.000066691486,0.00034442858,0.000101409685,0.004524543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890053,0.0002652221,0.00006807836,0.00027154968,0.00028033077,0.00021420696],"domain_scores_gemma":[0.9925291,0.0038338674,0.001275677,0.0006730768,0.0007490737,0.0009391986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008945794,0.0006019991,0.00071741693,0.0016117118,0.0011566669,0.0018423278,0.0011608503,0.0010888205,0.0046549817],"category_scores_gemma":[0.0085927015,0.00047171858,0.0003530429,0.0010190124,0.0018723087,0.0032721532,0.0011659269,0.0009101944,0.00057528354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040721855,0.00014495806,0.0050839474,0.0002396665,0.00005331845,0.0003548443,0.000574873,0.03923378,0.02342245,0.90237296,0.0032584493,0.024853379],"study_design_scores_gemma":[0.000037045065,0.0000907248,0.0017425284,0.000029850577,0.000020032474,0.00034765672,0.00038569074,0.11474841,0.0071976203,0.8728075,0.0025501319,0.00004291209],"about_ca_topic_score_codex":0.00044200878,"about_ca_topic_score_gemma":0.0007401377,"teacher_disagreement_score":0.0046549817,"about_ca_system_score_codex":0.00077403995,"about_ca_system_score_gemma":0.0004261291,"threshold_uncertainty_score":0.015572429},"labels":[],"label_agreement":null},{"id":"W4404408154","doi":"10.3842/sigma.2025.097","title":"Rational Solutions of Painlevé V from Hankel Determinants and the Asymptotics of Their Pole Locations","year":2025,"lang":"en","type":"preprint","venue":"Symmetry Integrability and Geometry Methods and Applications","topic":"Graph theory and applications","field":"Mathematics","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; University of Bristol","keywords":"Mathematics; Mathematical analysis; Pure mathematics; Mathematical economics","score_opus":0.051449491856547576,"score_gpt":0.3751585590381771,"score_spread":0.3237090671816295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404408154","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7329546,0.0011035595,0.22969376,0.0007966962,0.00013552782,0.000045023142,0.00006974292,0.00029830355,0.03490277],"genre_scores_gemma":[0.9831944,0.00036167746,0.010269761,0.00008021422,0.00004272595,0.000038003025,0.00004687934,0.00008802057,0.0058781877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999764,0.000064335974,0.0000082930965,0.00003333069,0.000066012704,0.00006398829],"domain_scores_gemma":[0.99932706,0.00026021418,0.00014653796,0.000041398966,0.00011123254,0.00011356647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005491758,0.0005412416,0.0004960806,0.001430158,0.00071010273,0.0015032536,0.0006794698,0.000990122,0.0043220217],"category_scores_gemma":[0.0039699026,0.00036045496,0.0005558033,0.0004154435,0.0019593607,0.0016436543,0.0011992513,0.0012853397,0.000570463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006755126,0.000029880357,0.00070531736,0.00010562738,0.000015335785,0.00041170744,0.000533187,0.016187744,0.011118376,0.9629553,0.00070746033,0.0071624652],"study_design_scores_gemma":[0.000053082676,0.00008169068,0.0013452908,0.00007459624,0.000016717628,0.00065121637,0.0005367486,0.21735683,0.0055946494,0.7718773,0.0023464079,0.00006546989],"about_ca_topic_score_codex":0.0009814112,"about_ca_topic_score_gemma":0.00065529527,"teacher_disagreement_score":0.0043220217,"about_ca_system_score_codex":0.00092061306,"about_ca_system_score_gemma":0.0005974606,"threshold_uncertainty_score":0.014458597},"labels":[],"label_agreement":null},{"id":"W4404702132","doi":"10.3390/e26121014","title":"It Is Better to Be Semi-Regular When You Have a Low Degree","year":2024,"lang":"en","type":"article","venue":"Entropy","topic":"Graph theory and applications","field":"Mathematics","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":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Degree (music); Combinatorics; Discrete mathematics; Random regular graph; Bipartite graph; Indifference graph; Random graph; Algebraic number; Algebraic connectivity; Chordal graph; Expander graph; Regular graph; Degree distribution; 1-planar graph; Line graph; Graph; Voltage graph; Complex network","score_opus":0.04727768286374005,"score_gpt":0.3041784021484056,"score_spread":0.2569007192846655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404702132","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92266476,0.00042831313,0.05550208,0.0036351644,0.000084268344,0.000020714062,0.0003033355,0.00013739575,0.017224034],"genre_scores_gemma":[0.99335504,0.00013635085,0.004800198,0.00015070774,0.0000253453,0.000008675783,0.000082640116,0.000018653942,0.0014224607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977785,0.00005637458,0.0000052319047,0.000077805016,0.00003692696,0.000045735585],"domain_scores_gemma":[0.99783736,0.0009884008,0.0005461055,0.0002428476,0.00012622219,0.00025911463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004047756,0.00019901246,0.0002709223,0.00047692758,0.000935082,0.0006821212,0.00049556734,0.0005475174,0.004776813],"category_scores_gemma":[0.0035830834,0.00015716988,0.00026290948,0.0005216659,0.0012090384,0.0019262689,0.0004825129,0.00057870144,0.00045822398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082227757,0.00039195365,0.05436166,0.00044363365,0.00019522144,0.0016128318,0.0022480171,0.05485974,0.03483666,0.75597656,0.016243456,0.07800799],"study_design_scores_gemma":[0.000086197884,0.00028056654,0.03128911,0.00010426246,0.000091681155,0.0018273935,0.0028632157,0.16228604,0.013460728,0.76391363,0.02366651,0.00013063542],"about_ca_topic_score_codex":0.0009268607,"about_ca_topic_score_gemma":0.0014638479,"teacher_disagreement_score":0.004776813,"about_ca_system_score_codex":0.00035552421,"about_ca_system_score_gemma":0.00013291981,"threshold_uncertainty_score":0.015980005},"labels":[],"label_agreement":null},{"id":"W4404912034","doi":"10.1007/s10801-024-01377-0","title":"On matrix product factorization of graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Graph theory and applications","field":"Mathematics","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":"Carleton University; University of Lethbridge","funders":"","keywords":"Mathematics; Combinatorics; Factorization; Product (mathematics); Matrix (chemical analysis); Algorithm","score_opus":0.022365709726515047,"score_gpt":0.3228266449933744,"score_spread":0.30046093526685935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404912034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20899813,0.0046721455,0.6373016,0.0045403247,0.0013460855,0.000141737,0.00080518634,0.00064805686,0.14154674],"genre_scores_gemma":[0.82887715,0.0038799217,0.10404546,0.0012517221,0.0018013035,0.0001376053,0.0013369132,0.0005053526,0.058164563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999014,0.00034975383,0.000034917106,0.00023615117,0.00020225064,0.00016294018],"domain_scores_gemma":[0.996651,0.0018012179,0.00030410005,0.0003588872,0.00055284245,0.0003319851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015370571,0.0016108894,0.0014611093,0.0020414062,0.001609512,0.0026989381,0.0012738311,0.0012249331,0.012042314],"category_scores_gemma":[0.0050689224,0.0007592215,0.00135905,0.0024117553,0.0033904165,0.0069599748,0.002117738,0.0028744026,0.0020630548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005429781,0.000039478844,0.00018698876,0.00007227149,0.000011363825,0.000087135995,0.00040984986,0.0028426112,0.0007223955,0.98178977,0.00458882,0.00919493],"study_design_scores_gemma":[0.0000057076923,0.000014479121,0.00007179031,0.000015308935,0.000004692298,0.000056352674,0.000054457698,0.006397109,0.00013706328,0.99078864,0.0024456892,0.00000867745],"about_ca_topic_score_codex":0.002748465,"about_ca_topic_score_gemma":0.002655223,"teacher_disagreement_score":0.012042314,"about_ca_system_score_codex":0.0011184791,"about_ca_system_score_gemma":0.0005971563,"threshold_uncertainty_score":0.040285528},"labels":[],"label_agreement":null},{"id":"W4405082755","doi":"10.1080/03081087.2024.2435403","title":"Kemeny's constant and enumerating Braess edges in trees","year":2024,"lang":"en","type":"article","venue":"Linear and Multilinear Algebra","topic":"Graph theory and applications","field":"Mathematics","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":"York University","funders":"National Research Foundation of Korea; Natural Sciences and Engineering Research Council of Canada; Fields Institute for Research in Mathematical Sciences","keywords":"Constant (computer programming); Combinatorics; Computer science; Mathematics; Mathematical economics; Programming language","score_opus":0.035434443876462406,"score_gpt":0.3265441007758562,"score_spread":0.29110965689939383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405082755","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5490226,0.005364011,0.3937034,0.0029087334,0.0002529898,0.00007762376,0.00064596033,0.000720529,0.047304098],"genre_scores_gemma":[0.9171981,0.0019943991,0.06483201,0.000371343,0.00021881674,0.00012982018,0.00036945526,0.00028859414,0.014597419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987735,0.0002885376,0.000057158424,0.00029356923,0.00028277547,0.00030445954],"domain_scores_gemma":[0.98613876,0.011046783,0.0006884216,0.00092419295,0.00062674383,0.0005751681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022559478,0.0007658252,0.0010260512,0.003250674,0.0022939993,0.002194948,0.0021262942,0.0014235,0.0075722337],"category_scores_gemma":[0.018656647,0.0004991614,0.0009515923,0.0029282463,0.003677347,0.00911176,0.0017760339,0.00376229,0.001029063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028402955,0.00007693781,0.0031718486,0.00031530004,0.00003807499,0.00021747063,0.0008356373,0.013896529,0.006242057,0.93723696,0.004018768,0.033666484],"study_design_scores_gemma":[0.000014836001,0.000032784967,0.00091728807,0.000063311716,0.000029703951,0.00021906322,0.00019027642,0.02604914,0.0033324736,0.9656942,0.0034260668,0.00003075504],"about_ca_topic_score_codex":0.001359272,"about_ca_topic_score_gemma":0.0015813382,"teacher_disagreement_score":0.0075722337,"about_ca_system_score_codex":0.0017054961,"about_ca_system_score_gemma":0.0008344925,"threshold_uncertainty_score":0.025331616},"labels":[],"label_agreement":null},{"id":"W4405194378","doi":"10.28924/2291-8639-22-2024-226","title":"Topological Indices of Inverse Graph for Generalized Quaternion Group","year":2024,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Umm Al-Qura University","keywords":"Wiener index; Mathematics; Topological index; Inverse; Index (typography); Eccentric; Graph; Quaternion; Combinatorics; Geometry; Computer science; Physics","score_opus":0.03582963936202626,"score_gpt":0.36635128867545813,"score_spread":0.33052164931343186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405194378","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52937347,0.0019649437,0.38003176,0.0008193791,0.0005561842,0.00008639834,0.00081238383,0.00042041644,0.08593512],"genre_scores_gemma":[0.9640417,0.0011826883,0.023611257,0.00013172411,0.00028553337,0.00005424777,0.0007010138,0.00012052472,0.0098713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996443,0.000061685976,0.000020203257,0.00008875955,0.00013350399,0.000051509607],"domain_scores_gemma":[0.999453,0.00010380016,0.000115420706,0.000050757633,0.00019302033,0.000083952254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002656671,0.0004136815,0.00035174077,0.0035547314,0.00062659354,0.0012805626,0.0004432523,0.00033563637,0.004693088],"category_scores_gemma":[0.0012648725,0.00011920486,0.00031379922,0.0013420084,0.00096127746,0.0023260976,0.0006257664,0.00057467225,0.00061428256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008981403,0.000029922727,0.0024048449,0.00012204134,0.000025449977,0.00023476171,0.00039163293,0.0078088623,0.0091939,0.9261355,0.0036818972,0.049881436],"study_design_scores_gemma":[0.000020378327,0.000093204384,0.0040567475,0.00004168211,0.000032159955,0.0008607736,0.0004290887,0.051620197,0.0062408284,0.91427296,0.022266306,0.00006566358],"about_ca_topic_score_codex":0.00073818193,"about_ca_topic_score_gemma":0.00046740062,"teacher_disagreement_score":0.004693088,"about_ca_system_score_codex":0.000597069,"about_ca_system_score_gemma":0.0002747298,"threshold_uncertainty_score":0.015699983},"labels":[],"label_agreement":null},{"id":"W4405252988","doi":"10.4153/s0008439525100763","title":"Critical scaling profile for trees and connected subgraphs on the complete graph","year":2025,"lang":"en","type":"preprint","venue":"Canadian Mathematical Bulletin","topic":"Graph theory and applications","field":"Mathematics","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":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of Cambridge","keywords":"Scaling; Graph; Combinatorics; Mathematics; Computer science; Geometry","score_opus":0.06443823404583102,"score_gpt":0.3135565681945881,"score_spread":0.2491183341487571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405252988","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.869616,0.000974055,0.09331523,0.0011840989,0.00007943006,0.000053942345,0.0002711046,0.00043231135,0.03407392],"genre_scores_gemma":[0.99266547,0.00029590182,0.0039281757,0.00008227758,0.00010572864,0.00005055621,0.0001402341,0.0000780469,0.002653712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997198,0.00007967602,0.0000075470816,0.000045319728,0.0000778774,0.000069908114],"domain_scores_gemma":[0.99763465,0.001130262,0.00029912643,0.00015111415,0.0002947426,0.0004901141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091741444,0.00040318817,0.0005256688,0.0027523742,0.0007253827,0.0013594183,0.00061410165,0.0007138872,0.0041438146],"category_scores_gemma":[0.0050361254,0.00027867427,0.000593153,0.00057820027,0.0016157697,0.0019132367,0.00069851085,0.0007667771,0.0003418444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033348468,0.000023661389,0.0013425951,0.000039788352,0.000010421943,0.0001904043,0.00022567535,0.006481048,0.0025999707,0.9829061,0.002198205,0.003948753],"study_design_scores_gemma":[0.000017558064,0.000027260936,0.0023879528,0.000032471555,0.000012241385,0.0002747573,0.00018744792,0.11998839,0.0014079505,0.8737823,0.0018615642,0.000020097312],"about_ca_topic_score_codex":0.0014675453,"about_ca_topic_score_gemma":0.0009808069,"teacher_disagreement_score":0.0041438146,"about_ca_system_score_codex":0.0011281902,"about_ca_system_score_gemma":0.0003780062,"threshold_uncertainty_score":0.013862431},"labels":[],"label_agreement":null},{"id":"W4405291314","doi":"10.4171/jncg/584","title":"Hopf-cyclic coefficients in the braided setting","year":2024,"lang":"en","type":"article","venue":"Journal of Noncommutative Geometry","topic":"Graph theory and applications","field":"Mathematics","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 Windsor","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.039952530864119186,"score_gpt":0.3761923753454328,"score_spread":0.3362398444813136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405291314","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7357125,0.0015634992,0.10440119,0.0005455686,0.0002972177,0.00006822186,0.00037217638,0.00019866339,0.15684092],"genre_scores_gemma":[0.9716129,0.00042297202,0.010676504,0.00015155323,0.00012941542,0.000034713503,0.00018932109,0.00004967502,0.016733075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995834,0.00004751374,0.000018465265,0.00007922247,0.00014887341,0.00012253225],"domain_scores_gemma":[0.9995579,0.00007547087,0.000059291455,0.000057348443,0.00014033077,0.000109536064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045360383,0.00055549794,0.00036491867,0.0023905071,0.00085151003,0.0013808886,0.00056493527,0.00040310112,0.0064460896],"category_scores_gemma":[0.00073603075,0.00022381208,0.00039548147,0.0008709639,0.001922202,0.0020997848,0.001670585,0.0009399287,0.0009523709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009591342,0.000009554141,0.0003381371,0.000031328316,0.0000050866806,0.000094539464,0.00028030036,0.00057396456,0.002893422,0.99057066,0.00046023913,0.0047330563],"study_design_scores_gemma":[0.000012312517,0.000031848947,0.001626468,0.00003710008,0.000017827993,0.00034537257,0.00029987292,0.008669997,0.007660161,0.96897763,0.012284996,0.000036401478],"about_ca_topic_score_codex":0.0017302271,"about_ca_topic_score_gemma":0.0017320341,"teacher_disagreement_score":0.0064460896,"about_ca_system_score_codex":0.00088195945,"about_ca_system_score_gemma":0.0005586657,"threshold_uncertainty_score":0.021564305},"labels":[],"label_agreement":null},{"id":"W4406079452","doi":"10.36227/techrxiv.173610613.34874972/v1","title":"Restricted Hopfield Networks are Robust to Adversarial Attack","year":2025,"lang":"en","type":"preprint","venue":"","topic":"Graph theory and applications","field":"Mathematics","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 Ottawa","funders":"","keywords":"Adversarial system; Computer science; Hopfield network; Artificial intelligence; Computer security; Artificial neural network","score_opus":0.09209507178194078,"score_gpt":0.3426419369190043,"score_spread":0.25054686513706353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406079452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111033686,0.0010630375,0.87784255,0.00045697682,0.000102874954,0.000092045535,0.00021702742,0.001143115,0.008048693],"genre_scores_gemma":[0.9498639,0.00049855997,0.04589143,0.00012541574,0.000031796335,0.00007531129,0.00022138174,0.00007272378,0.0032194133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995741,0.00009239056,0.000029868257,0.00010863774,0.00012568112,0.000069215355],"domain_scores_gemma":[0.9982356,0.00083369267,0.00026999667,0.0003126343,0.0002817308,0.00006624944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011882557,0.0009045489,0.0007347875,0.0005922012,0.00043248426,0.0008009124,0.0010864473,0.00089471706,0.00206665],"category_scores_gemma":[0.00571914,0.00039168744,0.00057859614,0.00041709305,0.0013912931,0.0017819953,0.0013018207,0.0012483133,0.00041369078],"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.00007119326,0.000019221696,0.0005986981,0.00007714384,0.00005831192,0.00007059289,0.000038911407,0.9433025,0.0044332636,0.013517989,0.0007782631,0.03703384],"study_design_scores_gemma":[0.000004993112,0.00003632842,0.0001399742,0.000007234728,0.000008470685,0.000037114063,0.000008297204,0.9832698,0.0018116168,0.01430582,0.0003629808,0.0000074389345],"about_ca_topic_score_codex":0.00507339,"about_ca_topic_score_gemma":0.0043953233,"teacher_disagreement_score":0.00507339,"about_ca_system_score_codex":0.00072620064,"about_ca_system_score_gemma":0.00089597964,"threshold_uncertainty_score":0.0100877285},"labels":[],"label_agreement":null},{"id":"W4406107765","doi":"10.1016/j.laa.2024.12.022","title":"Threshold graphs, Kemeny's constant, and related random walk parameters","year":2025,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; York University; Ontario Tech University","funders":"","keywords":"Mathematics; Random walk; Constant (computer programming); Combinatorics; Discrete mathematics; Statistics; Computer science","score_opus":0.018176047534950224,"score_gpt":0.28285288283623333,"score_spread":0.2646768353012831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406107765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4377308,0.0033445938,0.49457556,0.0015405291,0.00017760276,0.00011048923,0.00053049804,0.00070668984,0.061283138],"genre_scores_gemma":[0.96208006,0.001159099,0.029878864,0.00018668502,0.00009464481,0.00010253845,0.00014441842,0.00018443339,0.0061693164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944705,0.0001299742,0.00002525855,0.00014517977,0.00013280127,0.00011965794],"domain_scores_gemma":[0.9923684,0.0048801405,0.0009760363,0.0007448059,0.00040460384,0.0006259967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010828716,0.00046187214,0.00062277546,0.0029394904,0.0011227112,0.0016207611,0.0014769679,0.0013286093,0.0054108477],"category_scores_gemma":[0.0130307395,0.00036280116,0.00053715013,0.0021821298,0.0028470466,0.0065136524,0.0012142712,0.0020250278,0.000646678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030103596,0.000019816778,0.0007389786,0.0000539049,0.000009136845,0.00006848512,0.00019553685,0.014890264,0.0015159294,0.9766728,0.0007882593,0.0050167735],"study_design_scores_gemma":[0.000007609443,0.0000124649805,0.00069672125,0.000023757468,0.000008378199,0.00010778888,0.00011086885,0.04315303,0.000968148,0.95328796,0.0015928813,0.000030353303],"about_ca_topic_score_codex":0.0018495041,"about_ca_topic_score_gemma":0.0017705989,"teacher_disagreement_score":0.0054108477,"about_ca_system_score_codex":0.0020300383,"about_ca_system_score_gemma":0.00075357,"threshold_uncertainty_score":0.018101096},"labels":[],"label_agreement":null},{"id":"W4406164283","doi":"10.61091/ars161-14","title":"Sharp Lower Bound for Randić index of Trees with Fixed Roman Domination Number","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Upper and lower bounds; Combinatorics; Computer science; World Wide Web; Mathematical analysis","score_opus":0.016686441878597295,"score_gpt":0.2918168312654158,"score_spread":0.2751303893868185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406164283","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5771528,0.0083610425,0.22985613,0.0024759243,0.00032887224,0.00010836256,0.0013590072,0.0008708402,0.17948696],"genre_scores_gemma":[0.96493095,0.001465467,0.025424147,0.00033181283,0.00025201854,0.00010774214,0.00059726543,0.00020497387,0.0066856365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989435,0.00019927953,0.000039995266,0.00024148173,0.0002635698,0.00031216547],"domain_scores_gemma":[0.9953784,0.0027294764,0.00040845235,0.0005103605,0.00039289318,0.00058051676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010866103,0.00072208524,0.0013354969,0.0031014227,0.0016356924,0.0031739392,0.0017778177,0.0011988619,0.006067576],"category_scores_gemma":[0.008584617,0.00047457346,0.00061151484,0.0014660319,0.0021715176,0.003994345,0.0020450281,0.0026897283,0.00086483685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030485584,0.000068808935,0.003307729,0.0002661131,0.00004820848,0.00031393845,0.00040657952,0.020300211,0.010760091,0.9420257,0.0065116,0.015686171],"study_design_scores_gemma":[0.00003619242,0.00006400859,0.002076056,0.00010900758,0.00004904518,0.00054462196,0.00015650185,0.075832285,0.0045368033,0.9090172,0.007512315,0.0000658642],"about_ca_topic_score_codex":0.0005465218,"about_ca_topic_score_gemma":0.0010228895,"teacher_disagreement_score":0.006067576,"about_ca_system_score_codex":0.0016144133,"about_ca_system_score_gemma":0.00055792875,"threshold_uncertainty_score":0.020298064},"labels":[],"label_agreement":null},{"id":"W4406203446","doi":"10.61091/jcmcc123-19","title":"On Radenković and Gutman Conjecture for certain Classes of Trees","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Conjecture; Mathematics; Arithmetic; Psychology; Discrete mathematics","score_opus":0.023286780570048404,"score_gpt":0.30488599429151464,"score_spread":0.28159921372146623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406203446","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8649952,0.0016023339,0.04758935,0.006309893,0.00030123402,0.000040176772,0.00039266,0.00037200062,0.078397214],"genre_scores_gemma":[0.9883599,0.0005740197,0.006401286,0.00064868765,0.00027170836,0.00003394067,0.0003352753,0.000044343033,0.0033307888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928766,0.00014709264,0.000031421914,0.00020106121,0.00013940484,0.00019340182],"domain_scores_gemma":[0.99485415,0.003267714,0.00042892748,0.00048017947,0.00048040302,0.00048853544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012507436,0.0002636578,0.0007990652,0.0019207041,0.0021876977,0.0021107632,0.0009983473,0.0013071825,0.004727447],"category_scores_gemma":[0.008744281,0.0003093722,0.0007724822,0.0012826475,0.0027456705,0.0037485943,0.0017169751,0.0016003882,0.0005295317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010887364,0.000050742605,0.0039155246,0.000079076,0.000013923351,0.00018819698,0.0005086065,0.0058245216,0.0010468024,0.9717838,0.008259318,0.008220517],"study_design_scores_gemma":[0.0000447679,0.00003072654,0.0019519257,0.00004654335,0.000015636735,0.00022325113,0.00034803475,0.04263557,0.0005601849,0.94989574,0.0042232038,0.000024485817],"about_ca_topic_score_codex":0.0023037416,"about_ca_topic_score_gemma":0.0024883826,"teacher_disagreement_score":0.004727447,"about_ca_system_score_codex":0.0011884058,"about_ca_system_score_gemma":0.00064505846,"threshold_uncertainty_score":0.0158149},"labels":[],"label_agreement":null},{"id":"W4406237464","doi":"10.2139/ssrn.5092406","title":"Bounds on Kemeny's Constant of a Graph and the Nordhaus-Gaddum Problem","year":2025,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Graph theory and applications","field":"Mathematics","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 Manitoba; York University; University of Guelph","funders":"","keywords":"Combinatorics; Graph; Mathematics; Omega; Discrete mathematics; Constant (computer programming); Physics; Quantum mechanics; Computer science","score_opus":0.014985067848960958,"score_gpt":0.285046998629596,"score_spread":0.270061930780635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406237464","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3712939,0.028557194,0.1767382,0.051355265,0.002247632,0.00019160914,0.0021994605,0.0013837225,0.36603302],"genre_scores_gemma":[0.91304684,0.0072365245,0.03658087,0.0017316373,0.0016836956,0.00028997863,0.0007771799,0.0005939861,0.038059212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983152,0.00045830695,0.00006170757,0.0003956864,0.00035088445,0.00041817807],"domain_scores_gemma":[0.9724472,0.021718552,0.0012510944,0.0014644187,0.0009575747,0.0021612088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036507049,0.0021463148,0.0022611604,0.0065608732,0.0033055693,0.0042953603,0.0058988086,0.003307012,0.018952211],"category_scores_gemma":[0.02528217,0.001048335,0.0017122601,0.005353222,0.006586404,0.017499855,0.0056915954,0.009914722,0.0021035122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005317243,0.00010365279,0.0012649914,0.0004546956,0.00007492314,0.00014874732,0.0006642752,0.009114185,0.0017528381,0.95213735,0.012882778,0.020869877],"study_design_scores_gemma":[0.00004289798,0.00003370494,0.0007525187,0.000073973475,0.000058055022,0.00012011684,0.00014639641,0.013036025,0.000755913,0.98008484,0.00486207,0.00003346536],"about_ca_topic_score_codex":0.002659072,"about_ca_topic_score_gemma":0.0030704222,"teacher_disagreement_score":0.018952211,"about_ca_system_score_codex":0.0046868827,"about_ca_system_score_gemma":0.0021762508,"threshold_uncertainty_score":0.06340152},"labels":[],"label_agreement":null},{"id":"W4406302025","doi":"10.48550/arxiv.2408.00983","title":"Quasi-tree-partitions of graphs with an excluded subgraph","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph theory and applications","field":"Mathematics","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; National Center for Theoretical Sciences; National Science Foundation","keywords":"Induced subgraph isomorphism problem; Combinatorics; Mathematics; Tree (set theory); Computer science; Graph; Line graph","score_opus":0.11272177367873118,"score_gpt":0.2342680274721694,"score_spread":0.12154625379343822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406302025","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74444896,0.0005206375,0.23870023,0.00032792255,0.0000649331,0.000048674865,0.00054062554,0.00019211117,0.015155937],"genre_scores_gemma":[0.947564,0.00022092156,0.04630408,0.00013302927,0.00005805714,0.00006246051,0.00069956214,0.00013484382,0.0048229895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995977,0.000111716785,0.00001733662,0.0001155761,0.00008878548,0.000068953384],"domain_scores_gemma":[0.99792,0.00090102584,0.00038420453,0.00031565456,0.00022790258,0.00025121364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004032485,0.00030841745,0.00037133213,0.0010201756,0.0011075373,0.0014506793,0.0007389798,0.00059358793,0.003296899],"category_scores_gemma":[0.001830264,0.00035995737,0.00050785195,0.00096337846,0.001462351,0.00293849,0.000748515,0.0008230006,0.0003870333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002065815,0.00003718721,0.0022522071,0.00013701568,0.000023922283,0.00026764016,0.00061771617,0.018915227,0.016274843,0.9494712,0.0014740018,0.0103224],"study_design_scores_gemma":[0.000032734537,0.00007380966,0.002493416,0.000043407927,0.000029061523,0.0005214132,0.00038325813,0.07059053,0.005584515,0.91272557,0.007496349,0.000025975338],"about_ca_topic_score_codex":0.0007977426,"about_ca_topic_score_gemma":0.0015991924,"teacher_disagreement_score":0.003296899,"about_ca_system_score_codex":0.0006782192,"about_ca_system_score_gemma":0.00034578305,"threshold_uncertainty_score":0.0110292435},"labels":[],"label_agreement":null},{"id":"W4406345617","doi":"10.21203/rs.3.rs-4752385/v2","title":"WITHDRAWN: A Comprehensive Study of Prime Gaps Through Stochastic and Statistical Methods","year":2025,"lang":"en","type":"preprint","venue":"Research Square","topic":"Graph theory and applications","field":"Mathematics","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":"Preprint; Prime (order theory); Computer science; Prime time; Wish; Work (physics); Mathematical economics; Operations research; Sociology; Mathematics; World Wide Web; Engineering; Combinatorics; Telecommunications","score_opus":0.22485123806252724,"score_gpt":0.5617715306250562,"score_spread":0.336920292562529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406345617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05786188,0.024575448,0.75136894,0.046490453,0.00735914,0.00012226314,0.0035237616,0.0012227014,0.10747549],"genre_scores_gemma":[0.65474856,0.02316083,0.20007192,0.008752392,0.012798905,0.000299811,0.002543666,0.0022208085,0.09540305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975528,0.001048221,0.000096867014,0.00044411165,0.00074509205,0.00011279264],"domain_scores_gemma":[0.9783845,0.013598667,0.0015876648,0.0023986837,0.0031821947,0.0008481847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044094143,0.0009001212,0.0014588792,0.003121915,0.0017509818,0.003274022,0.0022782744,0.0021138208,0.01903249],"category_scores_gemma":[0.04108006,0.0004220214,0.0010804794,0.003964316,0.0030448677,0.009209431,0.0026408804,0.004233935,0.003620297],"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.00007597566,0.0000334163,0.0005014858,0.00030234078,0.000022926246,0.000069367685,0.00014154015,0.004130241,0.00048250327,0.9339582,0.019417651,0.040864293],"study_design_scores_gemma":[0.000012894185,0.000024278977,0.0003435167,0.00008638624,0.000012653089,0.00008919756,0.00005527712,0.015247561,0.0004971291,0.96178204,0.021831155,0.00001790918],"about_ca_topic_score_codex":0.0023754248,"about_ca_topic_score_gemma":0.0013308002,"teacher_disagreement_score":0.01903249,"about_ca_system_score_codex":0.0016498616,"about_ca_system_score_gemma":0.0025281503,"threshold_uncertainty_score":0.06366998},"labels":[],"label_agreement":null},{"id":"W4406659047","doi":"10.30538/psrp-odam2022.0077","title":"On the largest real root of the independence polynomial of a unicyclic graph","year":2022,"lang":"en","type":"article","venue":"Open Journal of Discrete Applied Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Independence (probability theory); Root (linguistics); Graph; Combinatorics; Discrete mathematics; Computer science; Statistics; Linguistics; Philosophy","score_opus":0.03516077578560541,"score_gpt":0.30209388021385525,"score_spread":0.26693310442824986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406659047","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7386715,0.0025150897,0.13943203,0.006821561,0.00055301905,0.00008853504,0.001009827,0.00037469043,0.11053378],"genre_scores_gemma":[0.9797331,0.0011114737,0.0076679257,0.0003217421,0.00057816296,0.000048363716,0.00044859658,0.00014553177,0.009945102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990151,0.00031211728,0.000023799348,0.00022697642,0.00023009257,0.00019191524],"domain_scores_gemma":[0.9847327,0.012090063,0.0011101731,0.0005035312,0.0006185494,0.0009450453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012234709,0.00093879155,0.0012553098,0.0024445003,0.0011067742,0.0023001968,0.0016799594,0.0011539673,0.009510548],"category_scores_gemma":[0.01380075,0.0005434057,0.00073339953,0.0021930074,0.0040614144,0.0038607,0.0016928626,0.004967291,0.0011902761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062693073,0.00017341167,0.002096896,0.0004545193,0.000055976503,0.00042542344,0.00087245944,0.025400106,0.007364994,0.91934514,0.010278154,0.032906033],"study_design_scores_gemma":[0.000068674184,0.00006463068,0.0016227461,0.00005224297,0.000034989676,0.00029108237,0.00016754778,0.048137665,0.001577507,0.9450333,0.0029009774,0.00004862239],"about_ca_topic_score_codex":0.0018305427,"about_ca_topic_score_gemma":0.0018258742,"teacher_disagreement_score":0.009510548,"about_ca_system_score_codex":0.0014690581,"about_ca_system_score_gemma":0.0008874396,"threshold_uncertainty_score":0.031815946},"labels":[],"label_agreement":null},{"id":"W4406668899","doi":"10.1016/b978-0-12-556950-7.50006-0","title":"10.1016/b978-0-12-556950-7.50006-0","year":2000,"lang":"en","type":"book-chapter","venue":"Time to knit","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Geology","score_opus":0.020854136128893933,"score_gpt":0.21421631741005193,"score_spread":0.193362181281158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406668899","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.00018194213,0.0003642384,0.001664313,0.00035361812,0.00018417127,0.000041991763,0.00095947704,0.0013485899,0.99490166],"genre_scores_gemma":[0.00054417294,0.0002450488,0.00056896504,0.00010944608,0.000032904478,0.000030146393,0.00060391595,0.00038223795,0.9974832],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99947256,0.000034311382,0.000036143087,0.00018239582,0.0001725325,0.000102071324],"domain_scores_gemma":[0.9979881,0.0005822886,0.00012549966,0.0003830218,0.00036967258,0.00055147376],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009744935,0.0022166881,0.0014528338,0.0020183579,0.001384616,0.0052092667,0.0030222407,0.003899893,0.9823188],"category_scores_gemma":[0.001871024,0.0008831645,0.0009643904,0.002654459,0.0012214222,0.005488908,0.003502302,0.0023169862,0.99083763],"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.00013211496,0.000110993155,0.00033020662,0.0003963628,0.000017135917,0.00009126653,0.00007324958,0.00040573406,0.0019891344,0.009423631,0.4302823,0.55674785],"study_design_scores_gemma":[0.000015068048,0.000031309024,0.00035503446,0.00018839561,0.000006392199,0.00013917757,0.000058931997,0.00016026772,0.00034635034,0.0015301045,0.99715817,0.000010749246],"about_ca_topic_score_codex":0.0027958783,"about_ca_topic_score_gemma":0.002656159,"teacher_disagreement_score":0.017681181,"about_ca_system_score_codex":0.0011056766,"about_ca_system_score_gemma":0.00085766125,"threshold_uncertainty_score":0.025220037},"labels":[],"label_agreement":null},{"id":"W4406786294","doi":"10.1021/acsomega.4c08243","title":"Investigating the Neighborhood Degree Based Topological Indices of Certain Isomeric Natural Polymers","year":2025,"lang":"en","type":"article","venue":"ACS Omega","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"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 Alberta","keywords":"Degree (music); Natural (archaeology); Polymer; Mathematics; Topology (electrical circuits); Combinatorics; Materials science; Physics; Biology","score_opus":0.04450654628577005,"score_gpt":0.31498061141434325,"score_spread":0.2704740651285732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406786294","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95603615,0.000106606334,0.04112113,0.00004452761,0.000006276175,0.000008249703,0.00007232922,0.000034827113,0.0025699846],"genre_scores_gemma":[0.98902917,0.000073170944,0.01050937,0.000004560393,0.000004086974,0.0000054707025,0.000077496996,0.00000888152,0.00028785336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99995446,0.000009958901,0.0000017018896,0.000011491717,0.000013557142,0.000008834051],"domain_scores_gemma":[0.9995696,0.00019333871,0.00011032889,0.000035995654,0.000052383402,0.000038278748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016725005,0.00011274921,0.00010674527,0.00079870445,0.00021356579,0.00031578986,0.00019393393,0.0001296076,0.0006597212],"category_scores_gemma":[0.0011818548,0.000057796864,0.00012355164,0.00047602627,0.0003300023,0.00063040055,0.0002494674,0.00017763264,0.00005405334],"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.00038000202,0.0001973221,0.068863116,0.00036939862,0.00008092438,0.00052349543,0.0007482723,0.39885128,0.11246465,0.3087033,0.001462557,0.107355714],"study_design_scores_gemma":[0.00000862657,0.00008993362,0.016210856,0.000009273423,0.000016556956,0.0001930488,0.00024897652,0.91588557,0.013123964,0.05278965,0.0014010294,0.000022504277],"about_ca_topic_score_codex":0.00082516944,"about_ca_topic_score_gemma":0.00129261,"teacher_disagreement_score":0.00082516944,"about_ca_system_score_codex":0.00024040848,"about_ca_system_score_gemma":0.00017280027,"threshold_uncertainty_score":0.0022070408},"labels":[],"label_agreement":null},{"id":"W4407089618","doi":"10.1021/acs.jcim.4c02013","title":"Vertex-Edge-Weighted Molecular Graphs: A Study on Topological Indices and Their Relevance to Physicochemical Properties of Drugs Used in Cancer Treatment","year":2025,"lang":"en","type":"article","venue":"Journal of Chemical Information and Modeling","topic":"Graph theory and applications","field":"Mathematics","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":"Relevance (law); Vertex (graph theory); Enhanced Data Rates for GSM Evolution; Computer science; Mathematics; Topology (electrical circuits); Medicine; Data mining; Combinatorics; Graph; Artificial intelligence","score_opus":0.04844809838916384,"score_gpt":0.3237936306695402,"score_spread":0.27534553228037634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407089618","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7534614,0.0026750062,0.23781194,0.0005251181,0.000061152765,0.000057656052,0.00040704664,0.00014051335,0.0048600677],"genre_scores_gemma":[0.9734957,0.0013207425,0.024095492,0.00004865229,0.000046527344,0.000027039852,0.00025772257,0.000031343272,0.000676692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971396,0.00012945823,0.000012984591,0.00005178628,0.000058623365,0.000033112254],"domain_scores_gemma":[0.9943011,0.004136263,0.0009085756,0.00022684927,0.0003058745,0.000121397155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007599903,0.0003781107,0.00036541803,0.0024510263,0.00025772885,0.0007463813,0.0003929381,0.0003623867,0.0008330112],"category_scores_gemma":[0.005901723,0.00012478311,0.00040639174,0.0022145852,0.00072145555,0.0013685081,0.0003681798,0.0004233037,0.00009003261],"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.00033363383,0.00025130814,0.031592518,0.0005406802,0.00032170356,0.0006168093,0.00036354945,0.58186954,0.02170648,0.22333384,0.0017347308,0.13733512],"study_design_scores_gemma":[0.000010195532,0.0002190366,0.009497401,0.00004247713,0.00011716149,0.00027336893,0.00015121448,0.89882606,0.0029326791,0.085520335,0.0023714493,0.00003867926],"about_ca_topic_score_codex":0.00093445985,"about_ca_topic_score_gemma":0.00091802253,"teacher_disagreement_score":0.0024510263,"about_ca_system_score_codex":0.0003966712,"about_ca_system_score_gemma":0.00029103135,"threshold_uncertainty_score":0.0040192604},"labels":[],"label_agreement":null},{"id":"W4407983107","doi":"10.1080/03081087.2025.2468968","title":"Cospectral graphs obtained by edge deletion","year":2025,"lang":"en","type":"article","venue":"Linear and Multilinear Algebra","topic":"Graph theory and applications","field":"Mathematics","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","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council; University of Waterloo","keywords":"Enhanced Data Rates for GSM Evolution; Combinatorics; Mathematics; Computer science; Artificial intelligence","score_opus":0.01470268351551642,"score_gpt":0.3048225502429996,"score_spread":0.2901198667274832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407983107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30602965,0.000112745474,0.6557036,0.00046815205,0.00022819772,0.00007600913,0.00045614154,0.00098544,0.035940077],"genre_scores_gemma":[0.7602572,0.00025674122,0.22486605,0.00044644112,0.00007822544,0.00015883271,0.0011892999,0.00050546904,0.012241729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971956,0.00005966068,0.000010892448,0.000086793865,0.00007623116,0.00004689041],"domain_scores_gemma":[0.9993175,0.0001899852,0.0001027323,0.00021647717,0.00010301565,0.00007023824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025991446,0.00056274317,0.00029495824,0.00067640183,0.00057217974,0.00049492676,0.00060819066,0.00052315526,0.0042827995],"category_scores_gemma":[0.001102399,0.0002044919,0.00038122904,0.00053643255,0.0007883564,0.0012498386,0.0009473658,0.000993875,0.00087153964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024327874,0.00021302623,0.00095400115,0.00019015536,0.000035840487,0.000643847,0.0003338664,0.02970489,0.15684983,0.7250302,0.005229397,0.08057165],"study_design_scores_gemma":[0.000061339044,0.00012055249,0.001426019,0.000034087287,0.000054807326,0.0008686776,0.00030747964,0.17164461,0.11153923,0.6876714,0.026215741,0.000055916295],"about_ca_topic_score_codex":0.00032942896,"about_ca_topic_score_gemma":0.00059286726,"teacher_disagreement_score":0.0042827995,"about_ca_system_score_codex":0.00026238462,"about_ca_system_score_gemma":0.00028400167,"threshold_uncertainty_score":0.014327407},"labels":[],"label_agreement":null},{"id":"W4408044409","doi":"10.56994/jxm.001.001.004","title":"Fekete polynomials of principal Dirichlet characters","year":2025,"lang":"en","type":"article","venue":"Journal of Experimental Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"Western University","funders":"","keywords":"Principal (computer security); Mathematics; Dirichlet distribution; Pure mathematics; Computer science; Mathematical analysis","score_opus":0.03588923447371215,"score_gpt":0.3607018782012038,"score_spread":0.32481264372749163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408044409","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8753244,0.00043243327,0.07242435,0.0007739236,0.00013740113,0.000036402813,0.00020536299,0.00014595994,0.05051956],"genre_scores_gemma":[0.9841299,0.00017256224,0.0076221437,0.00007529798,0.00010853182,0.000013610273,0.00010705226,0.000048477967,0.0077224597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999549,0.000080046,0.000013472962,0.000093655835,0.00012264808,0.00014127199],"domain_scores_gemma":[0.9991474,0.0003487822,0.00014104243,0.00012687179,0.00008943171,0.00014641426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050731585,0.000464823,0.00041813846,0.0013872392,0.0012069817,0.00159048,0.0005023956,0.00057965453,0.007972035],"category_scores_gemma":[0.0029516937,0.00022861848,0.0005047245,0.00076312426,0.0026145757,0.0032394286,0.0011570603,0.001349525,0.0007492415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006514734,0.000026249809,0.0009059454,0.000042129326,0.0000045922043,0.00016492773,0.00029924198,0.0022852593,0.0025010484,0.9865621,0.0006457674,0.0064977948],"study_design_scores_gemma":[0.000018882793,0.000038609676,0.0014283028,0.000027841616,0.000007460974,0.00059017283,0.00024574276,0.015979415,0.0039585237,0.97165316,0.0060178055,0.00003420491],"about_ca_topic_score_codex":0.0008148693,"about_ca_topic_score_gemma":0.00067629776,"teacher_disagreement_score":0.007972035,"about_ca_system_score_codex":0.0008138597,"about_ca_system_score_gemma":0.00037399237,"threshold_uncertainty_score":0.026669085},"labels":[],"label_agreement":null},{"id":"W4408366230","doi":"10.1007/s11075-025-02041-9","title":"Cut-edge centralities in an undirected graph","year":2025,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Graph theory and applications","field":"Mathematics","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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Gruppo Nazionale per il Calcolo Scientifico; NextGenerationEU; Ministero dell'Università e della Ricerca","keywords":"Mathematics; Theory of computation; Undirected graph; Graph; Combinatorics; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Algorithm; Artificial intelligence","score_opus":0.0385007283488646,"score_gpt":0.3413768819822541,"score_spread":0.3028761536333895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408366230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17843153,0.0008245319,0.8072066,0.0008078957,0.000114391965,0.00008415781,0.00035075823,0.0004474006,0.01173275],"genre_scores_gemma":[0.74720335,0.0006444502,0.24341728,0.0003231403,0.00023698626,0.0002452152,0.00048729763,0.0003832847,0.007058864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983271,0.00069073687,0.000059605885,0.0004570022,0.00032934154,0.00013623289],"domain_scores_gemma":[0.96477824,0.02671147,0.0024328337,0.002281888,0.0024133304,0.0013821962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003702372,0.0007898919,0.0013517109,0.0038692956,0.0014662336,0.0037418848,0.0028741786,0.00175302,0.0052548023],"category_scores_gemma":[0.030174835,0.0011527878,0.0007227345,0.0031396644,0.003438284,0.0059959996,0.0028588942,0.0030156476,0.000664782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032880824,0.00014628048,0.0027642907,0.00026866203,0.00007635873,0.00013730933,0.00044110155,0.06666949,0.0032380458,0.89674824,0.0031285887,0.026053008],"study_design_scores_gemma":[0.000037083217,0.000026423693,0.0005174438,0.000053363023,0.000030449299,0.00010975905,0.00009284266,0.20479983,0.001209292,0.7919353,0.00117068,0.000017422557],"about_ca_topic_score_codex":0.0011598173,"about_ca_topic_score_gemma":0.0018391178,"teacher_disagreement_score":0.0052548023,"about_ca_system_score_codex":0.0013844122,"about_ca_system_score_gemma":0.0011692523,"threshold_uncertainty_score":0.019580245},"labels":[],"label_agreement":null},{"id":"W4408420269","doi":"10.1007/s00214-025-03175-8","title":"Properties and applications of basis sets with linearly dependent products","year":2025,"lang":"en","type":"article","venue":"Theoretical Chemistry Accounts","topic":"Graph theory and applications","field":"Mathematics","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":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Basis (linear algebra); Computational chemistry; Chemistry; Statistical physics; Physics; Mathematics; Geometry","score_opus":0.015923866662707096,"score_gpt":0.2589432877974459,"score_spread":0.24301942113473882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408420269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2152285,0.0032288423,0.70020646,0.0014478259,0.00027558935,0.00009990794,0.0004684232,0.00041755982,0.07862683],"genre_scores_gemma":[0.81220144,0.002423397,0.17154759,0.00034645904,0.00047482864,0.00022744409,0.0005552014,0.00044464803,0.011779086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998345,0.0007942889,0.00009059794,0.00017219526,0.00048294137,0.0001150114],"domain_scores_gemma":[0.9916323,0.00532056,0.00046765347,0.0011650668,0.00094872894,0.00046575654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024137408,0.00059517415,0.00084829936,0.0026321546,0.0013077136,0.00299037,0.0018193498,0.0012168823,0.0043836473],"category_scores_gemma":[0.011637814,0.0006862277,0.0009197522,0.0030086522,0.002838705,0.0029545254,0.0022494434,0.002344004,0.0008332879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001898872,0.00001777101,0.00019491791,0.00003429116,0.000008884756,0.000022922906,0.00007682134,0.0031107496,0.0007675847,0.98826164,0.0005318121,0.0069535463],"study_design_scores_gemma":[0.000008952848,0.000020140871,0.00020221117,0.00003583923,0.000011769676,0.00012143674,0.000042886662,0.061847277,0.0013120566,0.93416536,0.0022141105,0.000018011613],"about_ca_topic_score_codex":0.0008596882,"about_ca_topic_score_gemma":0.00067271566,"teacher_disagreement_score":0.0043836473,"about_ca_system_score_codex":0.0007665104,"about_ca_system_score_gemma":0.00086074235,"threshold_uncertainty_score":0.014664769},"labels":[],"label_agreement":null},{"id":"W4408444218","doi":"10.5070/c65165021","title":"Feynman symmetries of the Martin and \\(c_2\\) invariants of regular graphs","year":2025,"lang":"en","type":"article","venue":"Combinatorial Theory","topic":"Graph theory and applications","field":"Mathematics","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; Innovation, Science and Economic Development Canada; Institut Périmètre de physique théorique; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Division of Mathematical Sciences; Government of Canada","keywords":"Feynman diagram; Mathematics; Homogeneous space; Discrete mathematics; Combinatorics; Mathematical physics; Geometry","score_opus":0.014361991926134018,"score_gpt":0.2760777170764259,"score_spread":0.2617157251502919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408444218","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8879823,0.00015242207,0.08564335,0.00025025854,0.00006532687,0.000035789042,0.00020531222,0.00016315536,0.025502082],"genre_scores_gemma":[0.9832667,0.00008348313,0.01226478,0.00004372858,0.000055974528,0.000039019953,0.000114613955,0.000054890417,0.0040768012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959713,0.00006926409,0.000020412625,0.0000903052,0.00009824435,0.00012475756],"domain_scores_gemma":[0.9990004,0.00033924016,0.0002530998,0.00014839334,0.00010835403,0.00015058824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000614327,0.00026758766,0.0002916947,0.0016262548,0.00084519706,0.0014122549,0.00053884985,0.00052405335,0.0031926483],"category_scores_gemma":[0.002345462,0.0001795718,0.00048537322,0.0006502799,0.0019688106,0.0024370141,0.00071689644,0.0009665761,0.0002810109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037007307,0.000018450095,0.00065091753,0.000015353906,0.0000020657578,0.00004654132,0.00015113913,0.0014925015,0.0027903633,0.989174,0.00031899265,0.0053026956],"study_design_scores_gemma":[0.00001526746,0.00006160284,0.0021611892,0.000020706813,0.000006635093,0.0002419142,0.00015594537,0.02970437,0.0041293935,0.9607939,0.0026842598,0.000024839457],"about_ca_topic_score_codex":0.0005569689,"about_ca_topic_score_gemma":0.00067575753,"teacher_disagreement_score":0.0031926483,"about_ca_system_score_codex":0.0010272769,"about_ca_system_score_gemma":0.0003962215,"threshold_uncertainty_score":0.010680437},"labels":[],"label_agreement":null},{"id":"W4408490945","doi":"10.61091/jcmcc124-06","title":"The general inverse degree and some Hamiltonian properties of graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Degree (music); Mathematics; Inverse; Hamiltonian (control theory); Combinatorics; Physics; Mathematical optimization; Geometry","score_opus":0.032439438146967946,"score_gpt":0.2760614539856348,"score_spread":0.24362201583866686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408490945","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90827674,0.00071005273,0.062278718,0.00052967784,0.00003307862,0.000035219335,0.00025963227,0.000072263174,0.027804503],"genre_scores_gemma":[0.99265784,0.00027052313,0.0053856904,0.000056587927,0.00004527669,0.000015307305,0.0001426385,0.000020499578,0.0014056085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957293,0.00009231709,0.00002102019,0.00010953917,0.00010384172,0.00010043571],"domain_scores_gemma":[0.9975032,0.0014326613,0.00034636134,0.0001967371,0.00020516993,0.00031583977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051059946,0.00032317758,0.00038748444,0.0011383129,0.0006702177,0.0007960674,0.00062718714,0.00045635767,0.002926494],"category_scores_gemma":[0.0030825695,0.000283021,0.00046583897,0.00062352617,0.0016435815,0.0019038119,0.0008483685,0.0009033004,0.0001539882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031883104,0.00018396344,0.0077628787,0.0003473249,0.0000636454,0.0008976151,0.0010700076,0.031019771,0.044477936,0.88899976,0.0019503243,0.022907892],"study_design_scores_gemma":[0.000052269155,0.00014381882,0.0068181944,0.000049238453,0.000053534917,0.0019391255,0.0006343146,0.0901658,0.011938849,0.8823354,0.0057970127,0.00007241996],"about_ca_topic_score_codex":0.0006083736,"about_ca_topic_score_gemma":0.0012716304,"teacher_disagreement_score":0.002926494,"about_ca_system_score_codex":0.0005757487,"about_ca_system_score_gemma":0.00026689182,"threshold_uncertainty_score":0.0097901225},"labels":[],"label_agreement":null},{"id":"W4408492765","doi":"10.61091/jcmcc124-16","title":"The Wiener index of connected tripartite graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Wiener index; Index (typography); Mathematics; Combinatorics; Graph; Computer science; World Wide Web","score_opus":0.016097865893522762,"score_gpt":0.2860321925356661,"score_spread":0.26993432664214334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408492765","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68045914,0.0013560746,0.24791117,0.0005531056,0.00020075054,0.000050734358,0.00035271345,0.00027193243,0.068844266],"genre_scores_gemma":[0.9766642,0.00067865365,0.016064981,0.00013099005,0.00012341833,0.00005321391,0.0002127505,0.00008932456,0.0059825242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993569,0.00012275651,0.000034571447,0.00012777738,0.00021769105,0.00014028995],"domain_scores_gemma":[0.9980563,0.00078452454,0.00035606982,0.00020280347,0.00027869767,0.000321657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050443807,0.00038805557,0.0005100316,0.0027066343,0.0010785455,0.0018946887,0.00090305903,0.0006075085,0.0039480613],"category_scores_gemma":[0.0033219322,0.00030476117,0.00043453602,0.0014623293,0.0016314596,0.0045895614,0.001662485,0.0012219603,0.0008418851],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009041541,0.000026351758,0.0011381246,0.00009219095,0.000023069928,0.000116122814,0.0003043345,0.004982323,0.006406719,0.9749015,0.0013457276,0.010573117],"study_design_scores_gemma":[0.000006448401,0.000032477783,0.0008717946,0.000027514528,0.000017907803,0.0001636955,0.00013856545,0.035659794,0.0028570872,0.95703465,0.0031599419,0.000030045752],"about_ca_topic_score_codex":0.00038270524,"about_ca_topic_score_gemma":0.000369229,"teacher_disagreement_score":0.0039480613,"about_ca_system_score_codex":0.00071278284,"about_ca_system_score_gemma":0.00032527948,"threshold_uncertainty_score":0.013207614},"labels":[],"label_agreement":null},{"id":"W4408568259","doi":"10.61091/jcmcc124-34","title":"Axiomatic characterization of the center function on fan graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Center (category theory); Characterization (materials science); Function (biology); Mathematics; Axiom; Combinatorics; Geometry; Nanotechnology; Materials science; Chemistry","score_opus":0.013893686824402418,"score_gpt":0.2609591501789511,"score_spread":0.24706546335454868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408568259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16164851,0.00041787824,0.8194443,0.0005516601,0.00009269531,0.000059106107,0.000397339,0.00047147478,0.016916925],"genre_scores_gemma":[0.8527959,0.00050716836,0.14084356,0.0003260583,0.00016490243,0.00013316168,0.0007066875,0.00017119966,0.004351432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983637,0.00045883172,0.00010949704,0.00047951183,0.00039748359,0.00019092455],"domain_scores_gemma":[0.9931496,0.0033886794,0.00058647385,0.0009605617,0.0015013888,0.0004132944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024058542,0.0006316051,0.0007295072,0.0020192983,0.001208057,0.0013828935,0.0017153143,0.0011032332,0.0023880794],"category_scores_gemma":[0.007814022,0.00031597476,0.0009999265,0.0014246044,0.0036538125,0.005576238,0.0018486892,0.0021638824,0.00034988511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022118182,0.000018961962,0.00079324184,0.00003134673,0.000008136002,0.00006256472,0.00013560249,0.0048109433,0.0014087007,0.98651147,0.00076641026,0.0054305927],"study_design_scores_gemma":[0.000012585002,0.0000370365,0.0008347956,0.000017554199,0.000014950832,0.00022318195,0.00011402368,0.062143754,0.002908512,0.9290523,0.0046090735,0.00003231589],"about_ca_topic_score_codex":0.0016048286,"about_ca_topic_score_gemma":0.0016056066,"teacher_disagreement_score":0.0024058542,"about_ca_system_score_codex":0.0012246064,"about_ca_system_score_gemma":0.0011463233,"threshold_uncertainty_score":0.0127235055},"labels":[],"label_agreement":null},{"id":"W4408568635","doi":"10.1007/s00153-025-00971-8","title":"Siblings of direct sums of chains","year":2025,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","topic":"Graph theory and applications","field":"Mathematics","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 Calgary","funders":"","keywords":"Mathematics; Algebra over a field; Chain (unit); Combinatorics; Discrete mathematics; Arithmetic; Pure mathematics","score_opus":0.05107347960088803,"score_gpt":0.3586310636584284,"score_spread":0.30755758405754036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408568635","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6694844,0.000814732,0.16735174,0.0011002927,0.00048575507,0.00017490466,0.0018223783,0.00055109966,0.15821472],"genre_scores_gemma":[0.90363187,0.00052301184,0.037847437,0.00033045592,0.00023279477,0.00015972872,0.0017669005,0.00039292887,0.05511498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989943,0.00020181602,0.000082839586,0.00027090212,0.00029698916,0.00015313285],"domain_scores_gemma":[0.9958935,0.0019000586,0.000413006,0.00043145154,0.0006459949,0.00071604305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007249439,0.00052680133,0.00096429634,0.0022711297,0.0023127429,0.0033264742,0.0011745861,0.0012359181,0.01987743],"category_scores_gemma":[0.0049861693,0.00096627313,0.0009400294,0.002356589,0.0021361175,0.0066426797,0.0032169216,0.0020647342,0.0022154239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083727966,0.000039067156,0.0010805419,0.00007945551,0.000025228126,0.00060026266,0.00072316476,0.00043878643,0.0015478741,0.984891,0.001974288,0.00851654],"study_design_scores_gemma":[0.00001814055,0.000017118824,0.00040800497,0.000024855943,0.000022887954,0.00033580113,0.00030128533,0.0013812883,0.0007893849,0.9917767,0.0049126986,0.00001184942],"about_ca_topic_score_codex":0.0011362209,"about_ca_topic_score_gemma":0.0019376895,"teacher_disagreement_score":0.01987743,"about_ca_system_score_codex":0.00083376485,"about_ca_system_score_gemma":0.00063787634,"threshold_uncertainty_score":0.06649667},"labels":[],"label_agreement":null},{"id":"W4408736835","doi":"10.61091/ars162-03","title":"On First Zagreb index, \\({\\tau}\\)-path-coverable and \\({\\tau}\\)-edge-Hamiltonian graphs","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Path (computing); Hamiltonian (control theory); Enhanced Data Rates for GSM Evolution; Hamiltonian path; Combinatorics; Graph; Computer science; Computer network; Telecommunications; Mathematical optimization","score_opus":0.011392266814499862,"score_gpt":0.25933135012198927,"score_spread":0.2479390833074894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408736835","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84587437,0.002584129,0.08828653,0.0014429151,0.00013998408,0.000054851236,0.0013155449,0.00045360206,0.059848163],"genre_scores_gemma":[0.965971,0.0011451317,0.024339912,0.00036442984,0.00020440183,0.00006815841,0.0013993718,0.0002548183,0.006252767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922633,0.00013183383,0.00002693318,0.00023433528,0.00014021453,0.00024034166],"domain_scores_gemma":[0.99404305,0.0037406932,0.000520868,0.00070750475,0.00023398592,0.0007537737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086166797,0.0012522527,0.0013105546,0.0015113299,0.0020095436,0.0032176203,0.0017801363,0.0010597021,0.0051868777],"category_scores_gemma":[0.006066299,0.0005591308,0.0008475423,0.0014184383,0.0021332896,0.0034401615,0.0017519013,0.0026437505,0.000654906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012695385,0.00022464104,0.010039152,0.0006770149,0.00010248775,0.00058246555,0.0014143329,0.04896672,0.021162523,0.84706366,0.012062116,0.056435358],"study_design_scores_gemma":[0.00009065393,0.00014934168,0.005550206,0.00012329227,0.00011082594,0.0006926265,0.0003249197,0.08007298,0.0068233167,0.8976766,0.008330925,0.000054318516],"about_ca_topic_score_codex":0.002764263,"about_ca_topic_score_gemma":0.005389821,"teacher_disagreement_score":0.0051868777,"about_ca_system_score_codex":0.002024838,"about_ca_system_score_gemma":0.00096672255,"threshold_uncertainty_score":0.017351866},"labels":[],"label_agreement":null},{"id":"W4408788915","doi":"10.1007/978-3-031-86602-9_2","title":"Commuting Ramanujan Graphs and the Random Self-reducibility of Isogeny Problems","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph theory and applications","field":"Mathematics","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":"","keywords":"Isogeny; Ramanujan's sum; Computer science; Discrete mathematics; Combinatorics; Mathematics; Abelian group","score_opus":0.02030451864079396,"score_gpt":0.2691006963522291,"score_spread":0.24879617771143514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408788915","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6413606,0.00397178,0.11640388,0.0057912595,0.0006981629,0.00013511775,0.00033242034,0.00032871898,0.23097809],"genre_scores_gemma":[0.9611263,0.0011726368,0.01346073,0.00045715313,0.00062820833,0.00013945467,0.00019659098,0.00012379815,0.022695025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983621,0.00066375255,0.00006564486,0.0002374745,0.0004643742,0.00020661007],"domain_scores_gemma":[0.9948783,0.0031925866,0.00036637674,0.0009018984,0.00029378757,0.0003670811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024270548,0.0005792627,0.0012544182,0.0021588514,0.0027972867,0.0037237832,0.0015095084,0.0015599524,0.0066420473],"category_scores_gemma":[0.00795108,0.00064425735,0.0012203569,0.0018464028,0.0056348853,0.0056064096,0.0023098674,0.0036288262,0.00060034124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000974247,0.000011599697,0.00005572981,0.000012805699,0.000003565951,0.000015494497,0.0000760081,0.0004791481,0.00011174459,0.9973476,0.0004506985,0.0014258262],"study_design_scores_gemma":[0.0000049953883,0.0000029153766,0.00004318819,0.0000032552887,0.0000016131609,0.000020946798,0.000019452227,0.0010847012,0.00007374462,0.9983273,0.00041519996,0.0000028150769],"about_ca_topic_score_codex":0.00054688024,"about_ca_topic_score_gemma":0.00046895928,"teacher_disagreement_score":0.0066420473,"about_ca_system_score_codex":0.0015018114,"about_ca_system_score_gemma":0.0009773946,"threshold_uncertainty_score":0.022219837},"labels":[],"label_agreement":null},{"id":"W4408911974","doi":"10.4153/s0008439525000372","title":"Ordinary isogeny graphs with level structure","year":2025,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Isogeny; Pure mathematics; Abelian group","score_opus":0.024882071693696346,"score_gpt":0.2648977427753613,"score_spread":0.24001567108166497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408911974","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.9514713,0.000121478515,0.022626929,0.00041162063,0.000054027434,0.000050831728,0.00012791788,0.00016571351,0.024970213],"genre_scores_gemma":[0.9885833,0.00010716528,0.0046484666,0.00010753701,0.000049791823,0.000033131895,0.00019582499,0.00006464246,0.006209998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966836,0.000053721185,0.000011286419,0.00007420484,0.000089847556,0.00010249002],"domain_scores_gemma":[0.9992674,0.00015337688,0.00013458169,0.00012606758,0.000092320915,0.00022627482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027831714,0.0003346459,0.0004086348,0.0014720445,0.0009998468,0.0016118783,0.0005734608,0.00056048797,0.0051303036],"category_scores_gemma":[0.0009807298,0.00022670117,0.00054329284,0.0006605425,0.0020490736,0.001936739,0.001469708,0.0011692095,0.00038444652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007984882,0.00004064572,0.0018619406,0.000043302396,0.000011473051,0.00046844973,0.0007647958,0.0037259613,0.0063940887,0.9796616,0.0009364444,0.00601151],"study_design_scores_gemma":[0.000044673183,0.00007107735,0.004021407,0.000031908527,0.000027197788,0.00049070164,0.0009710348,0.015538557,0.005098773,0.9649363,0.008733289,0.00003511826],"about_ca_topic_score_codex":0.0010702249,"about_ca_topic_score_gemma":0.000959193,"teacher_disagreement_score":0.0051303036,"about_ca_system_score_codex":0.0009131973,"about_ca_system_score_gemma":0.00028363176,"threshold_uncertainty_score":0.017162561},"labels":[],"label_agreement":null},{"id":"W4408968286","doi":"10.61091/ars162-10","title":"Chemical applicability of GQ and QG indices of a graph and their bounds","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.011899939445502987,"score_gpt":0.2731626614923572,"score_spread":0.2612627220468542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408968286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37056234,0.009029262,0.5252357,0.0020824934,0.00038657026,0.000093595074,0.000720696,0.00028593477,0.091603376],"genre_scores_gemma":[0.94603014,0.0024128917,0.048772417,0.00023330834,0.00033188149,0.00012539329,0.0002565036,0.00007899673,0.0017583825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880564,0.0003986947,0.00006190898,0.00029739473,0.00031213014,0.00012433808],"domain_scores_gemma":[0.99415416,0.0037596256,0.0007581941,0.0006067528,0.00049498084,0.00022624411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019489827,0.0005432304,0.00037933394,0.0037649234,0.0007841233,0.0016336062,0.0008746944,0.00074999686,0.0019038055],"category_scores_gemma":[0.008997721,0.00021153089,0.0004607306,0.0015821228,0.0032848045,0.0041475827,0.0014645724,0.0014200893,0.0003312862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032045096,0.000021972935,0.0018548572,0.00012622346,0.000013638974,0.000054933782,0.00016595416,0.016482335,0.0037771838,0.9622607,0.000582452,0.014627649],"study_design_scores_gemma":[0.000006143842,0.00005931988,0.001681736,0.00004950551,0.00001646327,0.00020461134,0.000120648416,0.069776736,0.0030201017,0.9195148,0.0055211065,0.000028957851],"about_ca_topic_score_codex":0.00060856726,"about_ca_topic_score_gemma":0.00043257995,"teacher_disagreement_score":0.0037649234,"about_ca_system_score_codex":0.0011705088,"about_ca_system_score_gemma":0.0004778197,"threshold_uncertainty_score":0.010307312},"labels":[],"label_agreement":null},{"id":"W4409189926","doi":"10.61091/jcmcc122-20","title":"Maxima of the \\(A_\\alpha\\)-spectral Radius of Graphs with Given Size and Minimum Degree \\(\\delta \\ge 2\\)","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Degree (music); Maxima; RADIUS; Combinatorics; Mathematics; Spectral radius; Delta; Alpha (finance); Physics; Statistics; Computer science; Quantum mechanics; History","score_opus":0.02121282106012115,"score_gpt":0.26386682354377505,"score_spread":0.2426540024836539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409189926","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8903588,0.0006265546,0.09393528,0.00036821127,0.000028668022,0.000033661232,0.00032824086,0.00021900407,0.01410154],"genre_scores_gemma":[0.9822364,0.00028714855,0.01625517,0.0000477807,0.000046078912,0.00004739205,0.00020037273,0.000063502535,0.00081611227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995036,0.00015915274,0.000025229889,0.00015423582,0.000084169835,0.00007358177],"domain_scores_gemma":[0.99476904,0.0032140056,0.0010086843,0.00026551186,0.00034602205,0.0003966372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006373686,0.000554057,0.0006559057,0.0018657411,0.0008244452,0.0012508109,0.0009391875,0.00069191365,0.0022396392],"category_scores_gemma":[0.006287077,0.0004109212,0.00037711716,0.0008805668,0.0015385587,0.0021580113,0.00080782484,0.00060882024,0.00031906454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006564999,0.00015565677,0.013788546,0.00056101807,0.00013737829,0.00050571625,0.00084802497,0.1039463,0.06667721,0.77004504,0.004370499,0.038308084],"study_design_scores_gemma":[0.000058090183,0.0002195266,0.015685458,0.000116883,0.00011531126,0.0016883375,0.0010360243,0.3374925,0.030439546,0.60789466,0.0051527712,0.000100974714],"about_ca_topic_score_codex":0.00030695542,"about_ca_topic_score_gemma":0.0003904088,"teacher_disagreement_score":0.0022396392,"about_ca_system_score_codex":0.00060887274,"about_ca_system_score_gemma":0.00024401632,"threshold_uncertainty_score":0.0074923635},"labels":[],"label_agreement":null},{"id":"W4409723126","doi":"10.61091/jcmcc126-03","title":"On the classification of graphs induced by a sequence of local complementations of Paley graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Sequence (biology); Mathematics; Computer science; Biology; Genetics","score_opus":0.049367005393984316,"score_gpt":0.3286106279228144,"score_spread":0.2792436225288301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409723126","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91373986,0.00015133014,0.07470372,0.00043049204,0.000028401622,0.00007767746,0.00033645265,0.00012248661,0.010409551],"genre_scores_gemma":[0.9751785,0.00021198974,0.021377947,0.00010780269,0.000050685176,0.000073316485,0.00075653434,0.000048621212,0.002194573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999138,0.0001958382,0.000045091052,0.0002836388,0.00017158817,0.00016570403],"domain_scores_gemma":[0.9954348,0.0022919192,0.0007950876,0.0005389028,0.00047482646,0.0004644838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007967071,0.00033075854,0.00043858794,0.00271714,0.0015755503,0.0014395734,0.0005362066,0.0006926275,0.0031363664],"category_scores_gemma":[0.003949141,0.0002525455,0.0006920577,0.0011631398,0.0033830726,0.0031071173,0.0011840374,0.001557355,0.000260148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059577957,0.00016600212,0.013595215,0.00016802586,0.0000339976,0.0004371025,0.0012333118,0.018934265,0.020613486,0.9097607,0.001410849,0.033051226],"study_design_scores_gemma":[0.00006316591,0.00025333103,0.011464527,0.00006765787,0.000045963996,0.0013051406,0.0010598982,0.07392435,0.0118598575,0.89380324,0.0060825865,0.00007026622],"about_ca_topic_score_codex":0.00086350087,"about_ca_topic_score_gemma":0.000701761,"teacher_disagreement_score":0.0031363664,"about_ca_system_score_codex":0.00084119913,"about_ca_system_score_gemma":0.00053306675,"threshold_uncertainty_score":0.010492206},"labels":[],"label_agreement":null},{"id":"W4409748946","doi":"10.1080/03081087.2025.2484265","title":"On the second largest adjacency eigenvalue of trees with given diameter","year":2025,"lang":"en","type":"article","venue":"Linear and Multilinear Algebra","topic":"Graph theory and applications","field":"Mathematics","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Adjacency list; Eigenvalues and eigenvectors; Mathematics; Combinatorics; Physics; Quantum mechanics","score_opus":0.020733587059937584,"score_gpt":0.2854339977999638,"score_spread":0.2647004107400262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409748946","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5319163,0.0027691808,0.40716845,0.0019033244,0.0002278899,0.00004096781,0.00044638084,0.00035798832,0.055169515],"genre_scores_gemma":[0.9552255,0.0010105391,0.037481297,0.00027198138,0.00040514712,0.000067507135,0.00021312729,0.00020548918,0.0051194327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994248,0.0002051042,0.000016804666,0.00013881912,0.00009450566,0.000120036224],"domain_scores_gemma":[0.996451,0.0021945871,0.0003733143,0.00018732874,0.00036626714,0.00042749743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010351406,0.00052250666,0.0006558591,0.001714471,0.0010324906,0.001584615,0.0007085689,0.00084592105,0.0035257398],"category_scores_gemma":[0.006562887,0.00033605777,0.000446051,0.001079628,0.002221026,0.0023786668,0.0014228047,0.0014581286,0.0006789659],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009549873,0.00003112762,0.0011961992,0.000109702734,0.000016737715,0.00012956366,0.000386514,0.016657785,0.008404178,0.9591093,0.0036011762,0.010262319],"study_design_scores_gemma":[0.000013366536,0.000039031293,0.0018357582,0.000048264552,0.000009681066,0.00023969292,0.00021668785,0.086792834,0.0021375988,0.90548897,0.003145513,0.00003263688],"about_ca_topic_score_codex":0.0005571356,"about_ca_topic_score_gemma":0.00049968506,"teacher_disagreement_score":0.0035257398,"about_ca_system_score_codex":0.000908401,"about_ca_system_score_gemma":0.00035727568,"threshold_uncertainty_score":0.011794746},"labels":[],"label_agreement":null},{"id":"W4410070236","doi":"10.1002/jgt.23253","title":"A Nordhaus–Gaddum Problem for the Spectral Gap of a Graph","year":2025,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Graph theory and applications","field":"Mathematics","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":"York University","funders":"","keywords":"Mathematics; Combinatorics; Graph","score_opus":0.03388345908459915,"score_gpt":0.3225049509430111,"score_spread":0.28862149185841196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410070236","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59094703,0.0022773237,0.37599263,0.004782951,0.0002810204,0.00012443936,0.0005071167,0.00025950448,0.024827965],"genre_scores_gemma":[0.9498317,0.0006361172,0.043913644,0.0003171073,0.00022441392,0.00015486429,0.00029185417,0.000107908534,0.0045224046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989844,0.00045065183,0.00004680386,0.0002436704,0.00010659474,0.00016781963],"domain_scores_gemma":[0.98572725,0.011972473,0.0005798663,0.0004239998,0.0004120447,0.0008842133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030691016,0.0008132264,0.0018930888,0.0021216816,0.0019712923,0.002503781,0.0019144209,0.0029059045,0.0066660517],"category_scores_gemma":[0.016210893,0.0006517504,0.0008491214,0.0012114224,0.0036723854,0.0058659473,0.002768683,0.0024444808,0.0004798746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024820416,0.00010482579,0.0006482334,0.00019602422,0.000034427827,0.00016442307,0.00046740196,0.03951458,0.0012272142,0.9439341,0.003146844,0.010313775],"study_design_scores_gemma":[0.000040574265,0.000049076512,0.0002190084,0.000040200004,0.000010915657,0.00010333934,0.00023164965,0.17085715,0.00057587423,0.8267164,0.0011335409,0.000022154254],"about_ca_topic_score_codex":0.0014337746,"about_ca_topic_score_gemma":0.00065636315,"teacher_disagreement_score":0.0066660517,"about_ca_system_score_codex":0.0022017728,"about_ca_system_score_gemma":0.0010865093,"threshold_uncertainty_score":0.022300184},"labels":[],"label_agreement":null},{"id":"W4410278531","doi":"10.61091/jcmcc125-29","title":"Mostar index of certain classes of bicyclic graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Index (typography); Bicyclic molecule; Mathematics; Combinatorics; Statistics; Computer science; Chemistry; Stereochemistry; World Wide Web","score_opus":0.01868917144099398,"score_gpt":0.29635226984659097,"score_spread":0.277663098405597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410278531","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96452844,0.00047996535,0.0159841,0.00015698433,0.0000176758,0.00003529109,0.00066645275,0.00016763856,0.017963275],"genre_scores_gemma":[0.99534,0.000128044,0.0031846834,0.00003215033,0.000021670512,0.000019669958,0.00046125744,0.00002150222,0.0007909131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996768,0.00004477085,0.000019072904,0.000060790007,0.00009109306,0.00010755416],"domain_scores_gemma":[0.99836344,0.0005802137,0.0004909132,0.00018066044,0.00016026112,0.00022445549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003389557,0.00030350304,0.00040558906,0.0035681215,0.000697444,0.0012062989,0.000552771,0.00054237334,0.0028841675],"category_scores_gemma":[0.0028112275,0.0001889835,0.00024374008,0.001370719,0.0007867695,0.0012227258,0.00063195435,0.00063852686,0.0002266065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082510134,0.0002520839,0.05750048,0.00035220323,0.00011130521,0.0007300956,0.0011645285,0.11545423,0.029819883,0.70438945,0.009499725,0.07990088],"study_design_scores_gemma":[0.00006235147,0.0002161986,0.04204213,0.00008750254,0.00005404501,0.0012343192,0.0007254614,0.3927019,0.0095935,0.5429646,0.010199102,0.00011895273],"about_ca_topic_score_codex":0.0009943007,"about_ca_topic_score_gemma":0.001536738,"teacher_disagreement_score":0.0035681215,"about_ca_system_score_codex":0.00080392085,"about_ca_system_score_gemma":0.00022169713,"threshold_uncertainty_score":0.0096485615},"labels":[],"label_agreement":null},{"id":"W4410498801","doi":"10.26434/chemrxiv-2025-ztdt2","title":"Some Recent Advances of Information-Theoretic Approach in Density Functional Theory","year":2025,"lang":"en","type":"preprint","venue":"ChemRxiv","topic":"Graph theory and applications","field":"Mathematics","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":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Cognitive science; Computer science; Information theory; Epistemology; Mathematical economics; Data science; Psychology; Philosophy; Mathematics; Statistics","score_opus":0.028288226493680485,"score_gpt":0.27435498750539994,"score_spread":0.24606676101171945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410498801","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.004277006,0.6093653,0.31175375,0.016733205,0.003994299,0.000041212486,0.0003059352,0.0002803181,0.05324898],"genre_scores_gemma":[0.099948324,0.70168835,0.1632531,0.005560828,0.01767486,0.00018014254,0.0004796074,0.00032120955,0.010893544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892575,0.0005075571,0.00007580055,0.00015302176,0.000287343,0.00005044164],"domain_scores_gemma":[0.99747497,0.0019120974,0.00006774725,0.00015706704,0.00031819017,0.00006986532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003003529,0.000930982,0.0011968218,0.0023859285,0.00070231827,0.0021648307,0.0013537536,0.0015138816,0.004529754],"category_scores_gemma":[0.0047531263,0.0004699617,0.00096670876,0.0027368835,0.0024962563,0.003910865,0.001610434,0.0041763224,0.0012429109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014629487,0.000035500852,0.00014676587,0.0012492762,0.000041243296,0.000102445905,0.00015590967,0.0047707763,0.00043608533,0.9142604,0.011477567,0.06730942],"study_design_scores_gemma":[0.0000076074325,0.000029739742,0.00023497653,0.00035391754,0.000022383361,0.00020085099,0.000046071786,0.014929935,0.00038015805,0.8817094,0.10204348,0.000041363284],"about_ca_topic_score_codex":0.0009387809,"about_ca_topic_score_gemma":0.0008091219,"teacher_disagreement_score":0.004529754,"about_ca_system_score_codex":0.0015075799,"about_ca_system_score_gemma":0.00084568013,"threshold_uncertainty_score":0.01588434},"labels":[],"label_agreement":null},{"id":"W4410586790","doi":"10.1007/s11587-025-00971-z","title":"On vertex peripherians and Wiener index of graphs with fixed number of cut vertices","year":2025,"lang":"en","type":"article","venue":"Ricerche di Matematica","topic":"Graph theory and applications","field":"Mathematics","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":"Wilfrid Laurier University","funders":"","keywords":"Wiener index; Mathematics; Vertex (graph theory); Combinatorics; Topological index; Index (typography); Discrete mathematics; Graph; Computer science","score_opus":0.01836141869515161,"score_gpt":0.31181403492505766,"score_spread":0.29345261622990604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410586790","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89277893,0.0012990393,0.07240431,0.0006873081,0.00009101511,0.00003002459,0.0002915226,0.00019362247,0.03222422],"genre_scores_gemma":[0.97832644,0.00093330507,0.0127664935,0.00011600551,0.0001671324,0.000053596912,0.00028822778,0.00017170749,0.0071771406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993647,0.00018981613,0.000021451453,0.00016211436,0.00010538052,0.00015649],"domain_scores_gemma":[0.99069655,0.005475653,0.0014207747,0.00050069997,0.0004667811,0.0014396701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015572906,0.0009117159,0.0017773601,0.005093626,0.0021176392,0.003683659,0.0025370074,0.0016963684,0.005685988],"category_scores_gemma":[0.0100425985,0.0011025864,0.00097566785,0.0024392968,0.0039844494,0.006352569,0.0023824808,0.002551468,0.0006826483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003117051,0.000065745524,0.0020985007,0.00012977293,0.000039372993,0.0001281478,0.00046496524,0.016229572,0.0044466103,0.96844786,0.0013269625,0.00631084],"study_design_scores_gemma":[0.000060295115,0.000051295177,0.0019331146,0.00006139621,0.000043331394,0.00015668235,0.00024514375,0.0694153,0.0011996533,0.92569035,0.0011006759,0.00004266058],"about_ca_topic_score_codex":0.0011372648,"about_ca_topic_score_gemma":0.0017513128,"teacher_disagreement_score":0.005685988,"about_ca_system_score_codex":0.0017678072,"about_ca_system_score_gemma":0.000600967,"threshold_uncertainty_score":0.019021511},"labels":[],"label_agreement":null},{"id":"W4410590613","doi":"10.37236/12746","title":"Classification of Vertex-Transitive Digraphs of Order a Product of Two Distinct Primes via Automorphism Group","year":2025,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","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 Lethbridge","funders":"","keywords":"Transitive relation; Automorphism group; Automorphism; Vertex (graph theory); Combinatorics; Mathematics; Order (exchange); Group (periodic table); Inner automorphism; Product (mathematics); Digraph; Discrete mathematics; Graph; Physics; Business","score_opus":0.012377976705542236,"score_gpt":0.28865931985978394,"score_spread":0.2762813431542417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410590613","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8498121,0.0013074976,0.07836396,0.0011125876,0.00040441586,0.00019440129,0.0015453218,0.0005515185,0.0667083],"genre_scores_gemma":[0.9587285,0.0009367092,0.022249022,0.00023270796,0.00013915876,0.000057834513,0.0020772112,0.000092207294,0.015486496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994338,0.00008544696,0.000056455563,0.00018000085,0.0001339809,0.00011019876],"domain_scores_gemma":[0.99820685,0.00070285815,0.00030715278,0.0002508362,0.0002064078,0.00032587006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036586635,0.00035320854,0.00048747525,0.0019200487,0.0011943682,0.0020621163,0.0004954368,0.0006741141,0.003979495],"category_scores_gemma":[0.0017615964,0.00036559088,0.0005060778,0.0013613882,0.001698606,0.0026701705,0.0008380294,0.0010444481,0.00070324395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032571724,0.00009785394,0.007721946,0.0003837265,0.00003460521,0.0009279701,0.0015216437,0.0036417947,0.01381754,0.92210644,0.0070622107,0.042358488],"study_design_scores_gemma":[0.00006598557,0.00015999921,0.00908032,0.00012221381,0.00007763213,0.0017376422,0.001000761,0.018028032,0.008462594,0.9114943,0.049695607,0.00007491285],"about_ca_topic_score_codex":0.0009366772,"about_ca_topic_score_gemma":0.0010160683,"teacher_disagreement_score":0.003979495,"about_ca_system_score_codex":0.0010702019,"about_ca_system_score_gemma":0.00058830675,"threshold_uncertainty_score":0.013312757},"labels":[],"label_agreement":null},{"id":"W4411150769","doi":"10.1515/ms-2025-0035","title":"Joins of normal matrices, their spectrum, and applications","year":2025,"lang":"en","type":"article","venue":"Mathematica Slovaca","topic":"Graph theory and applications","field":"Mathematics","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":"Western University","funders":"","keywords":"Mathematics; Joins; Join (topology); Mathematical proof; Ramanujan's sum; Spectrum (functional analysis); Simple (philosophy); Discrete mathematics; Combinatorics; Computer science","score_opus":0.016642707131749052,"score_gpt":0.2785230629755059,"score_spread":0.26188035584375685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411150769","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77717036,0.0007958389,0.17611201,0.00075625535,0.00016208559,0.000039773433,0.00017043119,0.00020409947,0.044589207],"genre_scores_gemma":[0.98398584,0.00025981668,0.01058779,0.00006210046,0.00020719864,0.000022261574,0.000072503295,0.000036757778,0.004765833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994357,0.00009371455,0.000016915086,0.00014991776,0.00021679618,0.00008681152],"domain_scores_gemma":[0.9983088,0.00078892166,0.00022216307,0.00008127903,0.00018566476,0.00041321717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063219684,0.00033224488,0.0004245686,0.002261254,0.0007768947,0.0015853122,0.0007679306,0.000537585,0.0061226618],"category_scores_gemma":[0.0031534755,0.00026625366,0.00042854718,0.0009428334,0.0021980854,0.002193136,0.0016294259,0.001096036,0.00047247732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004109978,0.00003186582,0.00064848305,0.000030093457,0.000005244596,0.00010441916,0.00020708657,0.0035113348,0.003172921,0.98712385,0.00043283857,0.004690834],"study_design_scores_gemma":[0.000018646087,0.00007618345,0.00083480374,0.000019836432,0.000005730003,0.00035012385,0.00030069333,0.058824576,0.0025181258,0.93438745,0.0026440606,0.000019839232],"about_ca_topic_score_codex":0.00063042395,"about_ca_topic_score_gemma":0.00045874607,"teacher_disagreement_score":0.0061226618,"about_ca_system_score_codex":0.0008371558,"about_ca_system_score_gemma":0.0003610267,"threshold_uncertainty_score":0.020482302},"labels":[],"label_agreement":null},{"id":"W4411300717","doi":"10.29303/aca.v8i1.232","title":"NM-polynomial and neighborhood degree-based indices in graph theory: a study on non-kekulean benzenoid graphs","year":2025,"lang":"en","type":"article","venue":"Acta Chimica Asiana","topic":"Graph theory and applications","field":"Mathematics","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 Alberta","funders":"","keywords":"Mathematics; Combinatorics; Degree (music); Graph theory; Discrete mathematics; Graph; Physics","score_opus":0.026114054774686028,"score_gpt":0.3007790973830199,"score_spread":0.27466504260833385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411300717","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78415275,0.0015529118,0.19657946,0.00025763112,0.000040596733,0.00004171026,0.00024939387,0.00008666924,0.017038943],"genre_scores_gemma":[0.9713388,0.0005642568,0.026434587,0.000026921189,0.00002582559,0.000023911978,0.00015020503,0.000025384352,0.0014101329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999864,0.00003433166,0.000005353128,0.00003400801,0.000042018124,0.0000202417],"domain_scores_gemma":[0.9991155,0.00050617225,0.00011892996,0.00010151599,0.0000953557,0.00006237796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034678332,0.0002104562,0.00033431745,0.0012877518,0.00043850494,0.0006029426,0.00047445,0.0002729123,0.0015862369],"category_scores_gemma":[0.0018951171,0.00009556216,0.00032375302,0.0009741872,0.00073199574,0.0013639189,0.00041695213,0.00042116322,0.00014332614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013571489,0.00008779206,0.009780631,0.00036299517,0.000045822664,0.00026792733,0.0003370222,0.24721977,0.00811937,0.67369044,0.0014468994,0.058505673],"study_design_scores_gemma":[0.000012507356,0.00008681403,0.0058605066,0.000034809713,0.00002591725,0.00021902903,0.00022733728,0.71919435,0.0026873685,0.26731652,0.004305881,0.00002893877],"about_ca_topic_score_codex":0.0011878104,"about_ca_topic_score_gemma":0.0016082872,"teacher_disagreement_score":0.0015862369,"about_ca_system_score_codex":0.00048549534,"about_ca_system_score_gemma":0.00030525462,"threshold_uncertainty_score":0.0053064823},"labels":[],"label_agreement":null},{"id":"W4411309621","doi":"10.1002/cta.70020","title":"On the Fractional‐Order Input Impedance of Equal‐ <i>R</i> Equal‐ <i>C</i> Infinite Two‐Dimensional Ladder/Tree Networks","year":2025,"lang":"en","type":"article","venue":"International Journal of Circuit Theory and Applications","topic":"Graph theory and applications","field":"Mathematics","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":"McMaster University; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Order (exchange); Mathematics; Electrical impedance; Tree (set theory); Mathematical analysis; Engineering; Electrical engineering","score_opus":0.02106104634723068,"score_gpt":0.31539366522441337,"score_spread":0.2943326188771827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411309621","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4902982,0.00043127124,0.47767758,0.0003086891,0.000044732755,0.0000349184,0.000104335806,0.000279785,0.030820616],"genre_scores_gemma":[0.98819715,0.00014273079,0.009796076,0.00003132609,0.000007591686,0.000015348342,0.000032199547,0.000023875284,0.0017538182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99986005,0.000056385994,0.0000043231958,0.000018338265,0.000040066177,0.000020830552],"domain_scores_gemma":[0.9995647,0.00027167145,0.00006020484,0.000030960044,0.000054358443,0.000018192593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031639106,0.00030448003,0.00021218174,0.00045799842,0.00023318386,0.0006136845,0.00036713164,0.0005582551,0.002017991],"category_scores_gemma":[0.001495041,0.00012713732,0.00025163745,0.000370013,0.00064098526,0.00086523255,0.00027403998,0.00025820476,0.00019017617],"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.00013866943,0.00006343109,0.0010259848,0.00012647772,0.000023575725,0.0005040138,0.0002433215,0.5968105,0.06104286,0.32310855,0.00086979993,0.016042804],"study_design_scores_gemma":[0.000005380551,0.000022919205,0.00031505935,0.000010934084,0.0000056564086,0.00010354617,0.000029378229,0.9678647,0.0036755288,0.027366914,0.000590796,0.0000091748325],"about_ca_topic_score_codex":0.0006484156,"about_ca_topic_score_gemma":0.0005604391,"teacher_disagreement_score":0.002017991,"about_ca_system_score_codex":0.00067818817,"about_ca_system_score_gemma":0.00013147735,"threshold_uncertainty_score":0.0067508817},"labels":[],"label_agreement":null},{"id":"W4411583423","doi":"10.5206/mase/22495","title":"Reformulated Zagreb indices of thorny graphs and algorithms","year":2025,"lang":"en","type":"article","venue":"Mathematics in Applied Sciences and Engineering","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Algorithm; Computer science; Mathematics","score_opus":0.022887107992306432,"score_gpt":0.288624083640766,"score_spread":0.2657369756484596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411583423","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.06099471,0.00096012745,0.92362803,0.00021850815,0.00010429298,0.00009600785,0.00033163387,0.00039720442,0.013269442],"genre_scores_gemma":[0.37435097,0.0009036547,0.6156928,0.00012027037,0.00009828837,0.00023301774,0.00092874,0.00024322339,0.0074290833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994981,0.00014194597,0.000034385408,0.00011634853,0.00015114452,0.000057904785],"domain_scores_gemma":[0.9989448,0.00040124235,0.00011428876,0.0002771025,0.00020943301,0.00005311703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091602607,0.0005643917,0.00071725255,0.0015205136,0.0005067753,0.0017901856,0.0013317601,0.0006440345,0.003452621],"category_scores_gemma":[0.0052900356,0.0002645769,0.00049535435,0.0011350142,0.0013498346,0.0033768935,0.0010195106,0.001734251,0.00078215945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067033434,0.000052344032,0.00092929375,0.00012434903,0.00002519937,0.000047254765,0.00010477821,0.17851622,0.0029764085,0.72990835,0.0021044263,0.0851443],"study_design_scores_gemma":[0.000017057482,0.00004199313,0.00039726496,0.000023284949,0.000010182672,0.000040159757,0.00004088043,0.6051465,0.0019591288,0.38862997,0.0036716608,0.000021841664],"about_ca_topic_score_codex":0.0022091602,"about_ca_topic_score_gemma":0.0027680933,"teacher_disagreement_score":0.003452621,"about_ca_system_score_codex":0.001704032,"about_ca_system_score_gemma":0.0009870192,"threshold_uncertainty_score":0.012363732},"labels":[],"label_agreement":null},{"id":"W4411599109","doi":"10.61091/jcmcc126-18","title":"On the number of Hamiltonian cycles in the generalized Petersen graph","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Petersen graph; Mathematics; Combinatorics; Graph; Voltage graph; Line graph","score_opus":0.021401705615776624,"score_gpt":0.3035536831838663,"score_spread":0.28215197756808963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411599109","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8158755,0.0022835576,0.04902011,0.0033030398,0.0007264117,0.00010832046,0.0012381787,0.0002734374,0.12717141],"genre_scores_gemma":[0.9730655,0.000959579,0.011439752,0.0003108634,0.00033391925,0.00011460679,0.0004821802,0.00009443171,0.013199159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993856,0.0001516212,0.00002759706,0.00015221087,0.00016094743,0.00012192476],"domain_scores_gemma":[0.99764156,0.0012797648,0.0002838489,0.00020026002,0.000255794,0.00033871396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063703547,0.0005967242,0.0005963927,0.0031166582,0.0015883363,0.0016582167,0.0013331966,0.0008909866,0.009202842],"category_scores_gemma":[0.0044724843,0.0004764541,0.0005947398,0.0017824492,0.002575276,0.0030237136,0.0012654936,0.0014993807,0.0005205262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027892328,0.000076482575,0.0026866354,0.00025922945,0.00006970735,0.00020334701,0.0003707247,0.022179184,0.0032921063,0.9289924,0.007210807,0.034380436],"study_design_scores_gemma":[0.00005359257,0.000062113475,0.0027968036,0.00006174293,0.000041700296,0.00019663414,0.00022823973,0.05366634,0.0021582448,0.9342978,0.0063752253,0.000061539424],"about_ca_topic_score_codex":0.0024342937,"about_ca_topic_score_gemma":0.002736709,"teacher_disagreement_score":0.009202842,"about_ca_system_score_codex":0.0014901203,"about_ca_system_score_gemma":0.0006956656,"threshold_uncertainty_score":0.030786574},"labels":[],"label_agreement":null},{"id":"W4411687196","doi":"10.61091/um123-07","title":"Characterizing s-strongly chordal bipartite graphs","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chordal graph; Mathematics; Bipartite graph; Combinatorics; Discrete mathematics; Graph","score_opus":0.03318212892953164,"score_gpt":0.3200311036284845,"score_spread":0.2868489746989529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411687196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20778093,0.00038384603,0.7034032,0.001271786,0.00009975231,0.00028757294,0.001569039,0.00058034324,0.08462357],"genre_scores_gemma":[0.8619532,0.0006270833,0.1112091,0.0007290552,0.00027735645,0.00028812548,0.0025712447,0.00029540493,0.022049436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902594,0.00021921807,0.000052305557,0.0003149346,0.00023762356,0.00015004248],"domain_scores_gemma":[0.99619776,0.0015774415,0.00051851204,0.0005097159,0.0007600034,0.000436479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008714089,0.00067638577,0.00038511248,0.0014090576,0.0009233082,0.0020899891,0.0011772672,0.000806746,0.0079467865],"category_scores_gemma":[0.0053520873,0.00035398555,0.00072493113,0.0013473025,0.0016335563,0.0033713884,0.0022348205,0.0013110085,0.0013526202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005358604,0.000044047913,0.0018508239,0.00012466627,0.000016850472,0.00012826128,0.0003615806,0.01089016,0.0060923668,0.9478325,0.005343341,0.027261859],"study_design_scores_gemma":[0.000011738854,0.000033056956,0.0007469074,0.000026357791,0.000010679687,0.00020002283,0.00027434537,0.05975658,0.00244234,0.92467546,0.011805479,0.000016949309],"about_ca_topic_score_codex":0.001640904,"about_ca_topic_score_gemma":0.0017589343,"teacher_disagreement_score":0.0079467865,"about_ca_system_score_codex":0.0012936988,"about_ca_system_score_gemma":0.0007370583,"threshold_uncertainty_score":0.026584685},"labels":[],"label_agreement":null},{"id":"W4411687204","doi":"10.61091/um123-09","title":"Path-systems in regular graphs and bipartite graphs","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Path (computing); Chordal graph; Longest path problem; Discrete mathematics; Graph; Computer science; Computer network","score_opus":0.025653382567953017,"score_gpt":0.29861877485096544,"score_spread":0.2729653922830124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411687204","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36497658,0.0008195473,0.55944616,0.0015972176,0.0003054182,0.0003989947,0.0038888382,0.0017813265,0.066785984],"genre_scores_gemma":[0.82488155,0.00077116187,0.13610148,0.0007001682,0.0002931037,0.0006648858,0.005223344,0.00039333114,0.030971017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983962,0.0003566182,0.000118964315,0.0006266994,0.00023490618,0.00026654],"domain_scores_gemma":[0.9972549,0.0011794211,0.00054454984,0.00032736757,0.00031723533,0.00037659373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011160966,0.0010047978,0.0007971522,0.0019802246,0.0023941726,0.0025986517,0.0014276134,0.0013421898,0.015519028],"category_scores_gemma":[0.0030615283,0.000823478,0.0011454697,0.0039151525,0.0026175678,0.0055281688,0.0025033713,0.002070948,0.0017041805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001364646,0.0000712048,0.0007667242,0.00016469786,0.000027822864,0.00024672068,0.0005353353,0.007481421,0.002119008,0.97111267,0.003825504,0.013512542],"study_design_scores_gemma":[0.000047964128,0.00005338761,0.0005160304,0.000029157598,0.000025253394,0.00021365902,0.00021615282,0.021855801,0.0011185759,0.96752644,0.008371693,0.00002590226],"about_ca_topic_score_codex":0.0020668781,"about_ca_topic_score_gemma":0.0018567999,"teacher_disagreement_score":0.015519028,"about_ca_system_score_codex":0.0011861331,"about_ca_system_score_gemma":0.0008698749,"threshold_uncertainty_score":0.0519163},"labels":[],"label_agreement":null},{"id":"W4412026617","doi":"10.1016/j.laa.2025.06.023","title":"Universal winners in trees","year":2025,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","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 Manitoba","funders":"Indian Institute of Technology Guwahati","keywords":"Mathematics; Combinatorics","score_opus":0.017547218825280955,"score_gpt":0.2991920811863322,"score_spread":0.2816448623610513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412026617","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4536918,0.003240605,0.2818794,0.007164418,0.0010052156,0.00011232555,0.00076482364,0.0013029638,0.2508384],"genre_scores_gemma":[0.9437359,0.00068008614,0.014994008,0.00048561074,0.00047210194,0.000070701215,0.0002541095,0.00027124988,0.039036263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981692,0.00044794235,0.000088142726,0.0004023158,0.00044330268,0.00044900537],"domain_scores_gemma":[0.9952856,0.0022939316,0.00039872702,0.0005421999,0.0006246888,0.00085490505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014850372,0.00040353523,0.0019330942,0.0023308897,0.0042225313,0.006695667,0.0015707292,0.0017538421,0.011185001],"category_scores_gemma":[0.0072598355,0.00074479333,0.001018318,0.002700249,0.0045476505,0.008687061,0.004221972,0.003526911,0.001562034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013307766,0.000009470409,0.000102730686,0.000015342554,0.0000057860266,0.000016606366,0.00017773817,0.00022724213,0.00015181526,0.9951676,0.0010134501,0.0030987994],"study_design_scores_gemma":[0.0000052869163,0.0000030109643,0.00006977775,0.0000047354843,0.000005171424,0.000020145191,0.000092196104,0.0011272659,0.00011163658,0.99716115,0.0013954208,0.00000424168],"about_ca_topic_score_codex":0.0018492409,"about_ca_topic_score_gemma":0.0023020108,"teacher_disagreement_score":0.011185001,"about_ca_system_score_codex":0.001779821,"about_ca_system_score_gemma":0.0010194455,"threshold_uncertainty_score":0.03741753},"labels":[],"label_agreement":null},{"id":"W4412409721","doi":"10.26493/1855-3974.3365.d2c","title":"Centrality in connected graphs via convexity or concavity","year":2025,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"Graph theory and applications","field":"Mathematics","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":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Convexity; Centrality; Combinatorics; Discrete mathematics; Business","score_opus":0.05923040225344551,"score_gpt":0.34313408951968566,"score_spread":0.28390368726624016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412409721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28666773,0.0014781614,0.65253896,0.0027582184,0.00009046576,0.00008320564,0.0004013006,0.0003854206,0.05559661],"genre_scores_gemma":[0.9429814,0.0011007496,0.048840556,0.0003549199,0.00026561518,0.00010561523,0.00024996395,0.00015308241,0.0059480714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990651,0.00032588007,0.000024116276,0.00026474288,0.00022487623,0.000095387455],"domain_scores_gemma":[0.9949504,0.0033868686,0.0005890645,0.00038554796,0.0004444864,0.00024349599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001052519,0.00047571055,0.00076515775,0.0016098928,0.0010781916,0.0020697755,0.0008508608,0.00066851656,0.002701243],"category_scores_gemma":[0.007151546,0.00038522464,0.00056442234,0.0017631869,0.003786837,0.0032364554,0.001265496,0.0016848946,0.00039363204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003305706,0.000014680681,0.0011435626,0.000061324696,0.000019666251,0.00014023435,0.00033629627,0.014955278,0.001730844,0.9683506,0.0018417774,0.011372738],"study_design_scores_gemma":[0.000011267159,0.0000224374,0.0014258788,0.00001890875,0.000016959491,0.00025142802,0.00014218682,0.09773288,0.0011174367,0.89364344,0.0055995323,0.00001757568],"about_ca_topic_score_codex":0.0023203038,"about_ca_topic_score_gemma":0.0021099648,"teacher_disagreement_score":0.002701243,"about_ca_system_score_codex":0.0016253121,"about_ca_system_score_gemma":0.00063356606,"threshold_uncertainty_score":0.011792541},"labels":[],"label_agreement":null},{"id":"W4412435968","doi":"10.55016/ojs/cdm.v11i2.62457","title":"Sufficient conditions for certain structural properties of graphs based on Wiener-type indices","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Hunan Province; National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Type (biology); Wiener index; Graph; Biology","score_opus":0.04887605859054891,"score_gpt":0.35994521970138227,"score_spread":0.3110691611108334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412435968","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6977278,0.00044083176,0.24570476,0.0012621252,0.00022185965,0.0002007097,0.0017771146,0.0006074686,0.05205742],"genre_scores_gemma":[0.9646336,0.0002708435,0.030449826,0.00021980125,0.00019006092,0.00021364987,0.0014458976,0.00017186318,0.0024044646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985839,0.00031753755,0.00012636867,0.00036816899,0.00028806026,0.0003159363],"domain_scores_gemma":[0.98403555,0.007959513,0.0028515735,0.0013375161,0.0016946369,0.0021211507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001963296,0.00068425253,0.00086269947,0.0025195803,0.0015260442,0.0019388113,0.0013363544,0.0015602598,0.0059870547],"category_scores_gemma":[0.015605696,0.00084905146,0.0012222537,0.0012054042,0.003193981,0.0058241715,0.0020520058,0.0026104804,0.0012898633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022094861,0.00010763401,0.0031383145,0.00012395062,0.000024608422,0.00033776116,0.00048300202,0.0065360884,0.010130067,0.97218937,0.001925323,0.0047829673],"study_design_scores_gemma":[0.000095205745,0.00020212361,0.0027852138,0.00007588379,0.000034736535,0.00049888954,0.000516232,0.054500706,0.008794838,0.9290929,0.003329661,0.000073616255],"about_ca_topic_score_codex":0.00040106635,"about_ca_topic_score_gemma":0.0009301676,"teacher_disagreement_score":0.0059870547,"about_ca_system_score_codex":0.0010515032,"about_ca_system_score_gemma":0.0011242084,"threshold_uncertainty_score":0.02002865},"labels":[],"label_agreement":null},{"id":"W4412439630","doi":"10.55016/ojs/cdm.v11i1.62390","title":"Automorphisms of circulants that respect partitions","year":2016,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"University of Lethbridge","funders":"","keywords":"Automorphism; Mathematics; Combinatorics","score_opus":0.04983588222167305,"score_gpt":0.34409065007234896,"score_spread":0.2942547678506759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412439630","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7467862,0.0004186372,0.19771464,0.00025524618,0.00039253398,0.00018503907,0.00017238823,0.0005032743,0.053572178],"genre_scores_gemma":[0.9570325,0.0003268267,0.028355729,0.00021816953,0.00029455964,0.000116442774,0.00024772092,0.00024383268,0.01316416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907696,0.0001547036,0.000054249387,0.00025182794,0.0002121595,0.0002502094],"domain_scores_gemma":[0.99843675,0.00036883174,0.00030897354,0.00044132688,0.00022593261,0.000218162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005625077,0.00049821305,0.00049799826,0.0010653092,0.001506059,0.0015260435,0.00039710177,0.00050384464,0.002423173],"category_scores_gemma":[0.0026277346,0.0003300882,0.0008003333,0.0005191356,0.0024372358,0.0016248372,0.0012877518,0.0009748594,0.00069176627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106067266,0.000046738613,0.0008919277,0.0000455624,0.000020944666,0.00024181731,0.00090044655,0.005283272,0.018175708,0.95682544,0.00084878545,0.016613303],"study_design_scores_gemma":[0.00007134884,0.00013567357,0.0016223071,0.000029261964,0.00003109008,0.0003652526,0.00032261937,0.013451034,0.010421872,0.9580185,0.015487449,0.00004363793],"about_ca_topic_score_codex":0.0021852457,"about_ca_topic_score_gemma":0.0020117508,"teacher_disagreement_score":0.002423173,"about_ca_system_score_codex":0.0009486918,"about_ca_system_score_gemma":0.00071556173,"threshold_uncertainty_score":0.008106291},"labels":[],"label_agreement":null},{"id":"W4412472971","doi":"10.1007/978-3-031-83864-4_13","title":"COP Numbers of Periodic Graphs","year":2025,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"Graph theory and applications","field":"Mathematics","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; University of Ottawa","funders":"","keywords":"Mathematics","score_opus":0.02520317441745478,"score_gpt":0.28962825145449267,"score_spread":0.2644250770370379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412472971","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0887911,0.008503335,0.055166293,0.0032382167,0.0030777936,0.00008646369,0.00064485637,0.00044133986,0.84005064],"genre_scores_gemma":[0.7025204,0.008400316,0.024102591,0.0010792121,0.0046408386,0.0003144825,0.0011147513,0.0006782038,0.2571492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997402,0.000046830333,0.000009597691,0.000063479136,0.000093685725,0.000046170033],"domain_scores_gemma":[0.99921155,0.00035550812,0.00008476978,0.00009560491,0.000110503715,0.0001419153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003005533,0.0007521011,0.000726733,0.0028339443,0.0012297941,0.003160527,0.0008669503,0.0008918207,0.01607459],"category_scores_gemma":[0.002684041,0.0005420723,0.00042182635,0.0020371228,0.0017471578,0.0024436251,0.0010146135,0.002315245,0.0024894576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014379787,0.000009777626,0.000070516624,0.00004764768,0.0000037426337,0.000025318192,0.000093069255,0.0007196185,0.0003599872,0.97392625,0.01237815,0.0123515995],"study_design_scores_gemma":[0.0000048349875,0.0000073396586,0.00025230754,0.000020092635,0.0000038097696,0.0000800453,0.00004083439,0.0022961944,0.00016658595,0.9822249,0.014895348,0.000007638371],"about_ca_topic_score_codex":0.00065429305,"about_ca_topic_score_gemma":0.00065595633,"teacher_disagreement_score":0.01607459,"about_ca_system_score_codex":0.0011169725,"about_ca_system_score_gemma":0.00046439824,"threshold_uncertainty_score":0.053774893},"labels":[],"label_agreement":null},{"id":"W4412647388","doi":"10.55016/ojs/cdm.v2i2.61984","title":"The cop density of a graph","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"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":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Mitacs; McGill University","keywords":"Combinatorics; Mathematics; Graph","score_opus":0.019359780623625485,"score_gpt":0.33642489472371545,"score_spread":0.31706511410009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647388","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63084805,0.00067205855,0.32644898,0.0021795076,0.000077532815,0.000087904045,0.0002914511,0.00029515324,0.039099332],"genre_scores_gemma":[0.98975897,0.0002204916,0.0071864375,0.00012026533,0.00004881141,0.0000561146,0.00007803174,0.000044362794,0.0024865158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895144,0.00037704373,0.000027263797,0.00023579791,0.00020514299,0.00020322633],"domain_scores_gemma":[0.9942543,0.0036990535,0.0006263716,0.00036877696,0.00039086767,0.0006605879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011452868,0.00053561333,0.00088542013,0.0017352204,0.0011946799,0.001935985,0.0013041451,0.0010813412,0.003751712],"category_scores_gemma":[0.011860953,0.00047247438,0.00047237577,0.00076603174,0.0043730903,0.003088457,0.0017169662,0.0014502088,0.000317533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052674623,0.000029898307,0.001272837,0.000048226946,0.000025746242,0.0002740915,0.0003460791,0.022912737,0.0012896351,0.96864074,0.0010525213,0.0040547037],"study_design_scores_gemma":[0.000022690661,0.000055275745,0.0011417025,0.000033070995,0.00002535537,0.0003058942,0.00021777954,0.30368757,0.00088525494,0.6910939,0.0024969846,0.000034463246],"about_ca_topic_score_codex":0.0038121936,"about_ca_topic_score_gemma":0.0015331608,"teacher_disagreement_score":0.0038121936,"about_ca_system_score_codex":0.0019457993,"about_ca_system_score_gemma":0.0005501277,"threshold_uncertainty_score":0.014117777},"labels":[],"label_agreement":null},{"id":"W4412647884","doi":"10.55016/ojs/cdm.v2i1.61950","title":"A canonical partition theorem for trees","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Partition (number theory); Combinatorics; Discrete mathematics","score_opus":0.031732370162845344,"score_gpt":0.36440235914605473,"score_spread":0.3326699889832094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647884","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12301317,0.0023552035,0.75548697,0.0018154263,0.00066649227,0.00010079668,0.00060434017,0.0007086435,0.11524895],"genre_scores_gemma":[0.87573063,0.0019096025,0.09094712,0.00112759,0.00079839,0.00023509879,0.0013362028,0.00076376053,0.027151657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871135,0.0001988769,0.00005397115,0.00038184712,0.00038911926,0.00026490772],"domain_scores_gemma":[0.9980531,0.0008901128,0.00009767105,0.00025250317,0.00046673632,0.00023984505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009697063,0.0005082078,0.00073580106,0.0012949279,0.0020808626,0.0030260852,0.0009301295,0.00080438127,0.008692052],"category_scores_gemma":[0.003442876,0.0005083111,0.0014435704,0.001174594,0.0038056618,0.0058439625,0.0035298215,0.0029642165,0.0020393198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071676545,0.0000053922463,0.00017802307,0.000025696258,0.0000046477417,0.000034527646,0.00015976446,0.00046948387,0.0005471427,0.9937483,0.0012695688,0.0035502978],"study_design_scores_gemma":[0.000012320646,0.000017188906,0.00024495486,0.000024735484,0.000013146955,0.00018604232,0.00013508085,0.00604429,0.0011701065,0.97959685,0.012541899,0.000013411652],"about_ca_topic_score_codex":0.001662276,"about_ca_topic_score_gemma":0.0017303267,"teacher_disagreement_score":0.008692052,"about_ca_system_score_codex":0.0015667217,"about_ca_system_score_gemma":0.0008202498,"threshold_uncertainty_score":0.029077828},"labels":[],"label_agreement":null},{"id":"W4412932479","doi":"10.1007/s10801-025-01433-3","title":"Integral normal Cayley graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Graph theory and applications","field":"Mathematics","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 Waterloo","funders":"European Commission; Università degli Studi di Milano-Bicocca; Università degli Studi di Milano","keywords":"Mathematics; Combinatorics; Cayley graph; Discrete mathematics; Graph","score_opus":0.01624173765218381,"score_gpt":0.3056028474660342,"score_spread":0.28936110981385044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412932479","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.608834,0.0007474765,0.120743304,0.001629631,0.0005407379,0.000118009215,0.00083690643,0.00071363896,0.26583627],"genre_scores_gemma":[0.95027936,0.0003908716,0.013929098,0.0003105628,0.00018040629,0.00004884439,0.0007119791,0.00011105905,0.034037918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992674,0.000110543195,0.000042792468,0.00023739872,0.00017784802,0.0001640045],"domain_scores_gemma":[0.99882597,0.00030982026,0.00013345119,0.00018518553,0.00025831704,0.0002873143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048689434,0.0005034097,0.00050227426,0.0014075019,0.0012937629,0.0031466356,0.0006438175,0.0006193208,0.0072626397],"category_scores_gemma":[0.0015845795,0.00029299772,0.0005401019,0.0007603716,0.0028906157,0.003903857,0.0016785645,0.0014826858,0.0012354114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058149137,0.000019261895,0.00053404,0.000027522956,0.0000075735497,0.00019083559,0.00038270597,0.0007206172,0.0017866218,0.98824614,0.0020215057,0.006004934],"study_design_scores_gemma":[0.000018172343,0.000021154357,0.00043007184,0.000018945508,0.00001434944,0.0002340664,0.00036403295,0.0064508384,0.0019458622,0.97659624,0.013891074,0.000015074928],"about_ca_topic_score_codex":0.0020763425,"about_ca_topic_score_gemma":0.0022078245,"teacher_disagreement_score":0.0072626397,"about_ca_system_score_codex":0.0014558772,"about_ca_system_score_gemma":0.00043089932,"threshold_uncertainty_score":0.024295986},"labels":[],"label_agreement":null},{"id":"W4413105468","doi":"10.1016/j.dam.2025.08.012","title":"Bounds on Kemeny’s constant of a graph and the Nordhaus–Gaddum problem","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"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 Manitoba; York University; University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada; Fields Institute for Research in Mathematical Sciences","keywords":"Mathematics; Graph; Combinatorics; Constant (computer programming); Discrete mathematics; Computer science","score_opus":0.015425017341538439,"score_gpt":0.2800924389007287,"score_spread":0.26466742155919026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413105468","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5855426,0.01989768,0.26854834,0.015732674,0.00073395134,0.00015199221,0.000980121,0.00064447033,0.10776811],"genre_scores_gemma":[0.92650276,0.004059098,0.054408967,0.00064982485,0.0005370919,0.00019268948,0.0003520098,0.00020099463,0.013096532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988876,0.00027983676,0.00004357694,0.0003101146,0.00021596965,0.00026288079],"domain_scores_gemma":[0.97931015,0.016250126,0.0011548559,0.0012228243,0.0006300674,0.001432043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033001928,0.0015823729,0.001737921,0.003485494,0.002392508,0.0022618016,0.0034112972,0.0019952527,0.0071255974],"category_scores_gemma":[0.022604745,0.0007670168,0.0016591318,0.0026565897,0.005211981,0.012663154,0.0036838115,0.0054472825,0.00095607707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008911583,0.00015314411,0.003150365,0.00062386005,0.00014970043,0.00028176216,0.0008773698,0.04440733,0.0053168195,0.9034841,0.009104949,0.031559393],"study_design_scores_gemma":[0.0000703847,0.000115021634,0.0019306084,0.00014075954,0.00008115435,0.00030316072,0.0002800991,0.068421885,0.00323588,0.9186861,0.0066573955,0.00007762539],"about_ca_topic_score_codex":0.001734857,"about_ca_topic_score_gemma":0.0016002321,"teacher_disagreement_score":0.0071255974,"about_ca_system_score_codex":0.0032029569,"about_ca_system_score_gemma":0.0013242471,"threshold_uncertainty_score":0.023837447},"labels":[],"label_agreement":null},{"id":"W4413212194","doi":"10.1109/tnse.2025.3597541","title":"A Two-Level Dirichlet Framework for Heterogeneous Federated Network","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Graph theory and applications","field":"Mathematics","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","funders":"","keywords":"Computer science; Computer network; Distributed computing","score_opus":0.03232322381614552,"score_gpt":0.2968801529724322,"score_spread":0.2645569291562867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413212194","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.0041770367,0.00015581372,0.99417406,0.00022340046,0.00002716158,0.00003577528,0.000094156654,0.00032794054,0.0007846586],"genre_scores_gemma":[0.45464444,0.00048640408,0.5350954,0.0004720099,0.00018607955,0.0004816069,0.0009089452,0.00042665075,0.0072984276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971059,0.0014182606,0.000112620466,0.0006088396,0.0004447833,0.00030963527],"domain_scores_gemma":[0.9964367,0.0020261924,0.00021454193,0.0005605153,0.00047074028,0.00029133877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047442517,0.0009947082,0.0015256099,0.0013420717,0.0012913309,0.0027028492,0.0037626387,0.001959398,0.0028985692],"category_scores_gemma":[0.009792407,0.0007832928,0.0018436235,0.0015831203,0.0018311397,0.0034134067,0.0034412341,0.0024599957,0.0010239708],"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.00014936311,0.00006600126,0.0009415046,0.000071643684,0.000053041542,0.00010293791,0.00021680165,0.88166213,0.0008436221,0.07957209,0.0025777319,0.0337431],"study_design_scores_gemma":[0.0000061220053,0.000008729691,0.000047089805,0.000004868248,0.000003896207,0.000014159907,0.000021181178,0.96617883,0.00019817175,0.032743167,0.0007675058,0.000006264908],"about_ca_topic_score_codex":0.008793199,"about_ca_topic_score_gemma":0.01093428,"teacher_disagreement_score":0.008793199,"about_ca_system_score_codex":0.0030700527,"about_ca_system_score_gemma":0.0021701357,"threshold_uncertainty_score":0.025090277},"labels":[],"label_agreement":null},{"id":"W4414581290","doi":"10.61091/jcmcc127-05","title":"On the sigma index of chemical graphs with a given order, number of edges and pendent vertices","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Shanxi Province; Shanxi Scholarship Council of China","keywords":"Sigma; Vertex (graph theory); Topological index; Graph; Mathematical chemistry; Order (exchange)","score_opus":0.014583138259976517,"score_gpt":0.2784154364126861,"score_spread":0.2638322981527096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414581290","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2576093,0.0025232348,0.69262266,0.0011972553,0.00015531231,0.00018529141,0.0017665185,0.0011751025,0.042765316],"genre_scores_gemma":[0.70640826,0.0026773214,0.2763138,0.0004995595,0.00023186763,0.0002864894,0.0024951582,0.0007751971,0.010312415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991374,0.00015950217,0.000040925202,0.00020532621,0.00027999538,0.00017677166],"domain_scores_gemma":[0.992892,0.004296129,0.0006631806,0.00080930773,0.0006972166,0.00064211036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001403745,0.0015434904,0.0013087273,0.0024616576,0.00097268063,0.0020804289,0.0018631633,0.0008467355,0.0043450836],"category_scores_gemma":[0.008346672,0.0005402932,0.00080858887,0.0025906528,0.0016383498,0.0037621078,0.0016369403,0.0019091388,0.0011863116],"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.00088581484,0.00038579578,0.009254979,0.00080980646,0.00013780067,0.00023231553,0.00045803288,0.43904936,0.028578715,0.3416098,0.01876074,0.15983684],"study_design_scores_gemma":[0.000041581003,0.00029612126,0.0027193448,0.00012243945,0.00006388757,0.00024205424,0.00016350711,0.691752,0.012804978,0.28468102,0.0070574507,0.000055587858],"about_ca_topic_score_codex":0.0018887141,"about_ca_topic_score_gemma":0.0033642133,"teacher_disagreement_score":0.0043450836,"about_ca_system_score_codex":0.0021416326,"about_ca_system_score_gemma":0.0020792442,"threshold_uncertainty_score":0.015538752},"labels":[],"label_agreement":null},{"id":"W4414617432","doi":"10.1137/23m1624828","title":"On a Generalization of Wasserstein Distance and the Beckmann Problem to Connection Graphs","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"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":"Intel Corporation; Pacific Institute for the Mathematical Sciences; National Science Foundation","keywords":"Connection (principal bundle); Generalization; Graph; Duality (order theory); Simple (philosophy)","score_opus":0.02075691311585754,"score_gpt":0.30862307739321765,"score_spread":0.2878661642773601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414617432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117679015,0.0031794575,0.82291394,0.0072945557,0.0009794194,0.00009946836,0.00037260336,0.00023304095,0.047248498],"genre_scores_gemma":[0.7526596,0.0065361173,0.19111499,0.0022062173,0.0021499302,0.00025277535,0.00096666755,0.0005873169,0.043526404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831885,0.00079788256,0.00007678392,0.00035433425,0.0003045706,0.00014756895],"domain_scores_gemma":[0.9938122,0.003958351,0.00046436902,0.00054518395,0.0006246754,0.0005950976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027526452,0.0013147164,0.0020778754,0.0025002467,0.0020118572,0.0026830505,0.0030177846,0.0034581725,0.009028924],"category_scores_gemma":[0.01624188,0.00088001654,0.0017694,0.0034480288,0.004240467,0.012233516,0.0059740776,0.004643525,0.00077313033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016945796,0.000023931634,0.00013978177,0.00003802821,0.000012023407,0.000038516937,0.00006552664,0.009776728,0.00020125885,0.9823966,0.0016623504,0.005628337],"study_design_scores_gemma":[0.000005123745,0.0000106150765,0.000083810446,0.000013764823,0.0000050658246,0.00002552211,0.000025727139,0.04398332,0.00005614674,0.9544292,0.0013510599,0.000010746741],"about_ca_topic_score_codex":0.003518699,"about_ca_topic_score_gemma":0.0031839784,"teacher_disagreement_score":0.009028924,"about_ca_system_score_codex":0.0021470564,"about_ca_system_score_gemma":0.001280274,"threshold_uncertainty_score":0.030204713},"labels":[],"label_agreement":null},{"id":"W4414631951","doi":"10.61091/ars164-02","title":"Existentially closed critical Cayley graphs","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science","keywords":"Cayley graph; Vertex-transitive graph; Vertex (graph theory); Adjacency list; Chordal graph; Indifference graph; Graph; Symmetric graph","score_opus":0.025179444904508793,"score_gpt":0.3294265627726002,"score_spread":0.3042471178680914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414631951","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.852981,0.0003850529,0.10019793,0.0002786351,0.00009280696,0.000080758444,0.0006037587,0.0003464029,0.045033675],"genre_scores_gemma":[0.9762656,0.00016224505,0.017387897,0.000107956635,0.000030473286,0.00003922767,0.00053979526,0.0000525601,0.0054141725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933535,0.000081990576,0.0000525014,0.00021407264,0.00013704086,0.00017900107],"domain_scores_gemma":[0.99806565,0.0005060012,0.0003075871,0.00028045735,0.0004139554,0.00042646346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004215373,0.00042872288,0.0003387656,0.0011073727,0.0013236173,0.0013578255,0.000732003,0.0004069849,0.002707134],"category_scores_gemma":[0.0019750108,0.00029626032,0.000360876,0.00093615527,0.0017249747,0.0018863397,0.0012931229,0.0010824229,0.00019168261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009641129,0.000025396497,0.0032277803,0.00008073029,0.000018847946,0.00042340517,0.0007006342,0.003245207,0.015730992,0.9560029,0.0016595308,0.018788226],"study_design_scores_gemma":[0.000029553463,0.00008493579,0.0036263918,0.000042711898,0.00005175588,0.0010008379,0.0009565839,0.020164482,0.02122354,0.91842407,0.034339685,0.000055488897],"about_ca_topic_score_codex":0.0019674844,"about_ca_topic_score_gemma":0.0024802266,"teacher_disagreement_score":0.002707134,"about_ca_system_score_codex":0.0011349877,"about_ca_system_score_gemma":0.000560711,"threshold_uncertainty_score":0.0090562105},"labels":[],"label_agreement":null},{"id":"W4414643069","doi":"10.61091/ars164-07","title":"On maximum Zagreb connection indices for trees with fixed matching number","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Connection (principal bundle); Matching (statistics); Index (typography); Tree (set theory); Base (topology)","score_opus":0.016139074717204896,"score_gpt":0.2946702317796536,"score_spread":0.27853115706244874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414643069","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90698165,0.0011799147,0.043101437,0.00037283037,0.000057109937,0.000024702123,0.00028471407,0.00016270937,0.04783492],"genre_scores_gemma":[0.98629504,0.00046540578,0.0105074085,0.000046699188,0.00005357623,0.00004057609,0.00019319668,0.000048929454,0.002349126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995685,0.000104938845,0.00001899156,0.00009641142,0.00009657559,0.000114713475],"domain_scores_gemma":[0.99880886,0.0005388696,0.00022880189,0.00010380807,0.00011459766,0.00020510901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087272294,0.0003974034,0.0004902011,0.0027526466,0.0014572518,0.002075347,0.0010366826,0.0006218318,0.002140186],"category_scores_gemma":[0.0032535999,0.00032486796,0.0003537258,0.0018336514,0.0013503343,0.0020491048,0.0010085324,0.0009678339,0.00025306855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009521655,0.00003340121,0.0018038865,0.000077450975,0.0000132794585,0.0000981675,0.00020327301,0.009252327,0.004145532,0.96857977,0.0009345681,0.014763224],"study_design_scores_gemma":[0.00003186517,0.000044934306,0.0049905227,0.000080342375,0.00003558748,0.00035322204,0.00018665114,0.06731337,0.0029422275,0.9199976,0.0039868806,0.000036692887],"about_ca_topic_score_codex":0.0007784327,"about_ca_topic_score_gemma":0.0018355899,"teacher_disagreement_score":0.0027526466,"about_ca_system_score_codex":0.00166031,"about_ca_system_score_gemma":0.0005636208,"threshold_uncertainty_score":0.012046516},"labels":[],"label_agreement":null},{"id":"W4414796573","doi":"10.1007/s00220-025-05448-6","title":"Highest Weight Vectors, Shifted Topological Recursion and Quantum Curves","year":2025,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"Graph theory and applications","field":"Mathematics","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 Saskatchewan; University of Alberta","funders":"Gruppo Nazionale per la Fisica Matematica; Istituto Nazionale di Fisica Nucleare; University of Alberta","keywords":"Recursion (computer science); Topological quantum number; WKB approximation; Partition (number theory); Topology (electrical circuits); Topological algebra; Generalization","score_opus":0.07906118362918163,"score_gpt":0.3841040680437077,"score_spread":0.3050428844145261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414796573","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78103465,0.00060126197,0.14705652,0.0015114556,0.00022315394,0.000053903383,0.00010149442,0.00037363873,0.0690439],"genre_scores_gemma":[0.98014474,0.00020148234,0.012190137,0.00016503502,0.00009747975,0.000031249838,0.00004234511,0.00007236788,0.007055207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944586,0.00010371353,0.000023226185,0.00006953899,0.00019483098,0.00016287899],"domain_scores_gemma":[0.9994497,0.00013949035,0.00008307691,0.00010126618,0.000110472414,0.00011609417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006221549,0.00038110674,0.00052292494,0.0016184457,0.0011410313,0.0018727615,0.00094222673,0.0012363136,0.005642358],"category_scores_gemma":[0.0019082151,0.00026727098,0.00055660034,0.000841772,0.003167418,0.0037889834,0.0015173684,0.0017816231,0.00068333175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072132257,0.0000084984795,0.00007068701,0.000006316515,9.961655e-7,0.00003057112,0.00005806665,0.000702437,0.00081244035,0.9965837,0.00014361097,0.0015754842],"study_design_scores_gemma":[0.000007218159,0.000011275364,0.00013769914,0.000008847636,0.0000014933889,0.00006618284,0.00005075194,0.0138925845,0.00070054975,0.98403144,0.0010817728,0.000010208937],"about_ca_topic_score_codex":0.0010703304,"about_ca_topic_score_gemma":0.0007292479,"teacher_disagreement_score":0.005642358,"about_ca_system_score_codex":0.0012244042,"about_ca_system_score_gemma":0.0006790273,"threshold_uncertainty_score":0.01887554},"labels":[],"label_agreement":null},{"id":"W4415556773","doi":"10.61091/jcmcc128-07","title":"Cut vertex and unicyclic graphs with the maximum number of connected induced subgraphs","year":2025,"lang":"","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Wiener index; Connectivity; Graph; Vertex (graph theory); Real number; Topological index","score_opus":0.014070379590317605,"score_gpt":0.2755205080906672,"score_spread":0.2614501285003496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415556773","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6581607,0.0024585645,0.2816808,0.0011101335,0.00009539764,0.00027196755,0.004173507,0.000860641,0.05118833],"genre_scores_gemma":[0.91258955,0.0010255671,0.076224506,0.00021772328,0.00009424312,0.0002300452,0.0022290347,0.00020381165,0.0071856603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990609,0.00022916192,0.00005740538,0.00025312553,0.00019406067,0.00020537415],"domain_scores_gemma":[0.9940706,0.0030400688,0.001032097,0.0006069348,0.00059223996,0.0006579694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007786508,0.0006540658,0.0006513306,0.0018145484,0.0007948042,0.0014863004,0.0011513716,0.0008400201,0.0057452843],"category_scores_gemma":[0.007365686,0.00044618713,0.0006343654,0.0022505482,0.0009395731,0.0019541886,0.0009184014,0.00065500464,0.0005346169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009462432,0.00023592364,0.016233448,0.0015917838,0.00022703891,0.0011488962,0.00081869087,0.22285998,0.033754267,0.545934,0.024294643,0.15195511],"study_design_scores_gemma":[0.00012955758,0.00053473574,0.01483112,0.00026162915,0.0002583959,0.0038408998,0.0007927543,0.4098351,0.018109288,0.52257466,0.028715944,0.00011586815],"about_ca_topic_score_codex":0.0013077797,"about_ca_topic_score_gemma":0.002095821,"teacher_disagreement_score":0.0057452843,"about_ca_system_score_codex":0.0010628109,"about_ca_system_score_gemma":0.00069015956,"threshold_uncertainty_score":0.019219935},"labels":[],"label_agreement":null},{"id":"W4415667388","doi":"10.55016/ojs/cdm.v20i2.69074","title":"The asymmetric index of a graph","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation","keywords":"Edge-transitive graph; Complement graph; Circulant graph; Line graph; Bipartite graph; Graph power; Graph; Regular graph; Voltage graph","score_opus":0.011353924765340829,"score_gpt":0.3217568904941336,"score_spread":0.3104029657287928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667388","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6878321,0.001154183,0.2204131,0.001020927,0.0001710704,0.00012315805,0.0012970122,0.00031160013,0.087676935],"genre_scores_gemma":[0.9665758,0.0005578961,0.028170465,0.00016123187,0.0001709605,0.00008610062,0.0006352262,0.00007669495,0.0035655582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843675,0.00025634622,0.00010661416,0.00043728107,0.0005373734,0.00022562168],"domain_scores_gemma":[0.99492896,0.001831322,0.0009982805,0.0009935534,0.0007255394,0.0005223612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006820133,0.00051948853,0.00061428075,0.0018366675,0.0009871583,0.0017517563,0.00086286967,0.000698679,0.0024488205],"category_scores_gemma":[0.0048935725,0.00030799874,0.00034680977,0.0013662884,0.0019886098,0.0034462432,0.001292908,0.0011865936,0.0005461981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021123452,0.000076372715,0.006234986,0.00018645577,0.000044821183,0.00039333952,0.0004311597,0.015189991,0.026689436,0.90512717,0.0029590416,0.042456005],"study_design_scores_gemma":[0.000026146816,0.00010007721,0.0040808492,0.00006233201,0.00004320306,0.0011478227,0.0002752516,0.0503348,0.012915678,0.9121195,0.01884845,0.00004601881],"about_ca_topic_score_codex":0.0003757114,"about_ca_topic_score_gemma":0.0003840965,"teacher_disagreement_score":0.0024488205,"about_ca_system_score_codex":0.0010727452,"about_ca_system_score_gemma":0.000463683,"threshold_uncertainty_score":0.008192122},"labels":[],"label_agreement":null},{"id":"W4415682123","doi":"10.18280/mmep.120929","title":"Bond Additive Molecular Descriptors of Interconnection Networks","year":2025,"lang":"","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Interconnection; Measure (data warehouse); Feature (linguistics); Pattern recognition (psychology); Molecule","score_opus":0.01672977902582439,"score_gpt":0.22737421366193797,"score_spread":0.21064443463611357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415682123","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14955434,0.0008128962,0.830159,0.00033163436,0.00009357059,0.00007942331,0.00047431327,0.00018676383,0.018308086],"genre_scores_gemma":[0.9187297,0.00086506933,0.07531948,0.00009948434,0.00007164331,0.00014296117,0.00040224512,0.00006614824,0.0043032933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998267,0.00004021287,0.000010130965,0.000031852258,0.00007308277,0.000018092944],"domain_scores_gemma":[0.9994504,0.00025920846,0.00010366574,0.00007386962,0.00008330833,0.000029599023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040609782,0.0003159886,0.00036790458,0.0015023291,0.00036176143,0.0008552554,0.0006138661,0.00044261786,0.0027488559],"category_scores_gemma":[0.0014520468,0.00013970987,0.00035769452,0.0011198209,0.000947059,0.0016937194,0.00051688927,0.0005649751,0.00030300487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029389708,0.000029837045,0.00079795474,0.000103576356,0.000018849962,0.00006473692,0.00005920211,0.36740294,0.0057820687,0.6032506,0.00059462874,0.021866163],"study_design_scores_gemma":[0.0000068630343,0.000056632613,0.0008346869,0.0000139133,0.000010518708,0.00006826248,0.00005523459,0.7332876,0.0014821948,0.25985464,0.0043084747,0.000021036543],"about_ca_topic_score_codex":0.00066247454,"about_ca_topic_score_gemma":0.0006028679,"teacher_disagreement_score":0.0027488559,"about_ca_system_score_codex":0.00057946483,"about_ca_system_score_gemma":0.00035081245,"threshold_uncertainty_score":0.009195805},"labels":[],"label_agreement":null},{"id":"W4415875756","doi":"10.1016/j.disc.2025.114872","title":"Hermitian adjacency matrices with at most three distinct eigenvalues","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","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","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Hermitian matrix; Eigenvalues and eigenvectors; Adjacency matrix; Adjacency list; Characterization (materials science); Matrix (chemical analysis)","score_opus":0.02290136173924493,"score_gpt":0.29697962776304593,"score_spread":0.274078266023801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415875756","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9200771,0.00025319267,0.063767105,0.00022442432,0.00005783879,0.000024975043,0.00012314643,0.000107218744,0.015365027],"genre_scores_gemma":[0.99091387,0.00008866158,0.006680826,0.000042003325,0.00002734499,0.000023054277,0.000058802707,0.000018096807,0.0021472585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964964,0.000083351566,0.000015279269,0.00007184895,0.0000674171,0.00011247488],"domain_scores_gemma":[0.99842936,0.00065559905,0.0004586143,0.00013285494,0.00012908464,0.00019439872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002448516,0.00045481665,0.0003292588,0.0007384581,0.0006318541,0.0009657683,0.00044630302,0.0005565006,0.0030291968],"category_scores_gemma":[0.0017845988,0.0001933466,0.0002706915,0.0006827862,0.0011114262,0.0009492452,0.0006366407,0.0005640881,0.00038661106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023957236,0.00014223054,0.0075137406,0.00016147693,0.00008977042,0.0018794737,0.0005834625,0.020798225,0.042437155,0.8994698,0.0034705105,0.023214713],"study_design_scores_gemma":[0.00008877648,0.00018738859,0.006067889,0.00004169084,0.000049077833,0.0017785693,0.00085747516,0.13616708,0.014345039,0.8345175,0.0058263643,0.00007313468],"about_ca_topic_score_codex":0.00031646347,"about_ca_topic_score_gemma":0.0005143682,"teacher_disagreement_score":0.0030291968,"about_ca_system_score_codex":0.00024648677,"about_ca_system_score_gemma":0.00014994503,"threshold_uncertainty_score":0.010133684},"labels":[],"label_agreement":null},{"id":"W4416097310","doi":"10.48550/arxiv.2505.04882","title":"The Degree Polynomial","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Graph theory and applications","field":"Mathematics","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":"Degree (music); Multigraph; Polynomial; Order (exchange); Degree of a polynomial; Reciprocal polynomial","score_opus":0.17797767985189064,"score_gpt":0.3481721697215069,"score_spread":0.17019448986961624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416097310","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5308248,0.0049951277,0.27298477,0.005636488,0.0005982905,0.000094611954,0.0040252227,0.0006422486,0.18019848],"genre_scores_gemma":[0.9576745,0.001856531,0.014411358,0.00027344612,0.00036317564,0.00005316553,0.0006439422,0.000177199,0.02454673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994287,0.00005984365,0.000016277472,0.00022813179,0.00013402483,0.00013294049],"domain_scores_gemma":[0.998679,0.0006174704,0.00018121803,0.00019345127,0.00016729604,0.00016163505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041898817,0.00036473453,0.00042868976,0.0013817324,0.0006930864,0.0022502248,0.000640104,0.00049560657,0.010097223],"category_scores_gemma":[0.0035305996,0.00025233752,0.00038425435,0.0012567107,0.0017361679,0.0034645463,0.0014522776,0.0014346301,0.0020283174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010868582,0.000027284565,0.0020711434,0.00014729892,0.000023449138,0.00008002618,0.00026638605,0.005739933,0.0077904444,0.9250343,0.0069687734,0.051742304],"study_design_scores_gemma":[0.000024009847,0.000065359454,0.0049633556,0.00006890699,0.000030424899,0.0009037296,0.00015602043,0.024416132,0.0062790043,0.9097417,0.05329651,0.00005483527],"about_ca_topic_score_codex":0.000840597,"about_ca_topic_score_gemma":0.00061040843,"teacher_disagreement_score":0.010097223,"about_ca_system_score_codex":0.0013328608,"about_ca_system_score_gemma":0.00046091864,"threshold_uncertainty_score":0.033778608},"labels":[],"label_agreement":null},{"id":"W4416444787","doi":"10.1021/acsomega.5c07283","title":"Structural Exploration and Expected values of Topological Indices of Square-Hexagonal <i>T</i> <sub>2,3</sub> Kink Chains for Advanced Engineering Applications","year":2025,"lang":"en","type":"article","venue":"ACS Omega","topic":"Graph theory and applications","field":"Mathematics","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":"King Faisal University; Lahore College for Women University","keywords":"Topology (electrical circuits); Computation; Probabilistic logic; Dimension (graph theory); Chain (unit); Graph; Topological quantum number; Square (algebra)","score_opus":0.02437821758343897,"score_gpt":0.2952721329483853,"score_spread":0.27089391536494634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416444787","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9488206,0.0001052369,0.042732924,0.00007738709,0.000006128262,0.000012256952,0.0002525234,0.00015488306,0.00783816],"genre_scores_gemma":[0.98875284,0.000049939426,0.010585807,0.000005661947,0.000001957127,0.000013328863,0.00018440702,0.000025350633,0.00038063686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999269,0.000016673648,0.0000043356326,0.000017416733,0.000023471379,0.000011148495],"domain_scores_gemma":[0.9994287,0.00029754793,0.00009669302,0.000069625785,0.00007851774,0.000028795619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023785721,0.00017773293,0.00013506049,0.00080636825,0.00025240754,0.00049427495,0.00030241068,0.00031885837,0.0020388674],"category_scores_gemma":[0.0014833029,0.00012789301,0.0001517713,0.0006324777,0.0004125316,0.0007018192,0.00022076248,0.00025530395,0.00015074741],"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.00026976256,0.00014675662,0.029700032,0.00031766313,0.000043825825,0.00053630635,0.0004120412,0.5675196,0.09300642,0.23098907,0.001762033,0.07529647],"study_design_scores_gemma":[0.000007303191,0.00007771409,0.008728715,0.000016716376,0.0000127292815,0.00016476221,0.00018645929,0.9202816,0.019956794,0.049711708,0.00082651427,0.00002894264],"about_ca_topic_score_codex":0.00045286896,"about_ca_topic_score_gemma":0.0010295013,"teacher_disagreement_score":0.0020388674,"about_ca_system_score_codex":0.00035036693,"about_ca_system_score_gemma":0.00021726666,"threshold_uncertainty_score":0.0068206787},"labels":[],"label_agreement":null},{"id":"W4416920926","doi":"10.5206/mase/22837","title":"A new variant of the Sombor matrix: bounds on spectral radius and energy with applications to QSPR analysis of COVID-19 drugs","year":2025,"lang":"en","type":"article","venue":"Mathematics in Applied Sciences and Engineering","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Eigenvalues and eigenvectors; Spectral radius; Graph; Simple (philosophy); Energy (signal processing); Degree (music); Matrix (chemical analysis); Zero (linguistics); Linear regression","score_opus":0.014956453900518977,"score_gpt":0.28397872735466756,"score_spread":0.2690222734541486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416920926","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.048241545,0.0033707665,0.9259957,0.0012553459,0.00024584113,0.00007897839,0.00038969272,0.00040977454,0.020012375],"genre_scores_gemma":[0.63966304,0.0033979143,0.3451091,0.0015097398,0.000778129,0.0003688241,0.00075695984,0.0004774532,0.007938861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869424,0.00046667867,0.00005745161,0.00032895594,0.00035062688,0.000101995836],"domain_scores_gemma":[0.99518126,0.0031410458,0.0004120008,0.00066733983,0.00033682017,0.0002615512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021727164,0.0010266951,0.0010182967,0.0022630976,0.00094593264,0.0018841979,0.0015598016,0.0014659014,0.0048739165],"category_scores_gemma":[0.007277149,0.00044412268,0.00065664185,0.0013072522,0.0030132555,0.004202114,0.0020584466,0.0025516525,0.0013330062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001292339,0.00006671634,0.0009773631,0.00022708825,0.000046919107,0.00014146297,0.000195328,0.035798665,0.012860307,0.92215854,0.0029320235,0.024466332],"study_design_scores_gemma":[0.000021708736,0.0001623205,0.0009789646,0.00007552117,0.000033062275,0.00028439434,0.00010579111,0.35154846,0.005153048,0.6292593,0.012288414,0.000089064655],"about_ca_topic_score_codex":0.0009029653,"about_ca_topic_score_gemma":0.0016447823,"teacher_disagreement_score":0.0048739165,"about_ca_system_score_codex":0.0009781492,"about_ca_system_score_gemma":0.0007064325,"threshold_uncertainty_score":0.01630485},"labels":[],"label_agreement":null},{"id":"W4417272100","doi":"10.28924/2291-8639-23-2025-327","title":"QSPR Modeling of Anticancer Drugs Using Uphill Topological Indices","year":2025,"lang":"","type":"article","venue":"International Journal of Analysis and Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Quantitative structure–activity relationship; Multilinear map; Topological index; Molecular descriptor; Regression; Linear regression; Anticancer drug; Topology (electrical circuits)","score_opus":0.027895629584350653,"score_gpt":0.37642022655356433,"score_spread":0.3485245969692137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417272100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45495343,0.00092336163,0.5352391,0.0004653997,0.000041924617,0.00021696527,0.0007108426,0.0005858152,0.006863203],"genre_scores_gemma":[0.9467089,0.0005459359,0.050781444,0.0000827638,0.000016809787,0.00020989914,0.00048250842,0.000043368003,0.001128383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996922,0.00014003822,0.000016288424,0.000048726113,0.000068163325,0.000034535384],"domain_scores_gemma":[0.9991437,0.00060705846,0.00011627999,0.00003762658,0.00007937005,0.000015959988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070903427,0.0006752615,0.00063143147,0.001149271,0.0002690107,0.0007630876,0.00054233975,0.0005648938,0.0011473005],"category_scores_gemma":[0.0021171374,0.00030983918,0.0010580356,0.00076960307,0.00043017144,0.00081271806,0.0005078773,0.0006039551,0.00018423022],"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.00003310919,0.000029993704,0.0012016942,0.000046748435,0.000030514157,0.000026561393,0.000023526998,0.98686254,0.002119892,0.0033835724,0.00013044522,0.0061114603],"study_design_scores_gemma":[0.0000021782032,0.000016894868,0.00016253442,0.0000014159978,0.0000034974096,0.0000033086671,0.0000033532315,0.99874014,0.00024249704,0.00074786966,0.00007390116,0.0000025285149],"about_ca_topic_score_codex":0.00482738,"about_ca_topic_score_gemma":0.0045790407,"teacher_disagreement_score":0.00482738,"about_ca_system_score_codex":0.00067583774,"about_ca_system_score_gemma":0.00077487173,"threshold_uncertainty_score":0.009598553},"labels":[],"label_agreement":null},{"id":"W581385225","doi":"10.71781/15181","title":"Dimension métrique des graphes","year":2008,"lang":"fr","type":"dissertation","venue":"Open MIND","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.07588900501468837,"score_gpt":0.35492372613527867,"score_spread":0.2790347211205903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W581385225","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.52830464,0.0034828037,0.38005787,0.003328834,0.0007376187,0.00011867822,0.005079764,0.0009813437,0.07790852],"genre_scores_gemma":[0.8505307,0.0026735351,0.09481738,0.00032041312,0.0008218666,0.00036729765,0.003912129,0.00048739932,0.046069324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985676,0.0003810973,0.000044416418,0.00041312884,0.00042551107,0.0001681566],"domain_scores_gemma":[0.99450964,0.0032791113,0.0004935095,0.0003134962,0.00086714904,0.00053716754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015941306,0.0013934579,0.0014931507,0.0067723263,0.002234978,0.0071666315,0.0012360964,0.0016799881,0.009577466],"category_scores_gemma":[0.008371978,0.00069344544,0.0014788384,0.004093723,0.0038532545,0.0044248453,0.0016401175,0.005037036,0.001523819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032386088,0.0000688439,0.005031444,0.00026798923,0.00013919309,0.00023587525,0.001910393,0.013609577,0.005953306,0.92234015,0.009229876,0.04088946],"study_design_scores_gemma":[0.00018717432,0.00014224867,0.03207963,0.00020807015,0.000089977475,0.001392479,0.0027762286,0.15864187,0.0068505327,0.73269737,0.06472658,0.000207806],"about_ca_topic_score_codex":0.037598953,"about_ca_topic_score_gemma":0.02480501,"teacher_disagreement_score":0.037598953,"about_ca_system_score_codex":0.00605081,"about_ca_system_score_gemma":0.0015033467,"threshold_uncertainty_score":0.07476026},"labels":[],"label_agreement":null},{"id":"W62939430","doi":"","title":"Minor clique free extremal graphs","year":2004,"lang":"fr","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Contractible space; Graph; Clique; Block graph; Split graph; Discrete mathematics; Pathwidth; Line graph","score_opus":0.022213531092072424,"score_gpt":0.26927344698587985,"score_spread":0.24705991589380744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W62939430","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72566336,0.0010247384,0.10824041,0.002773963,0.00017310001,0.00016721121,0.0016634462,0.00056553556,0.15972833],"genre_scores_gemma":[0.96532613,0.00033414728,0.017543951,0.00026182362,0.00009495844,0.00006367709,0.00091408344,0.00009031114,0.0153708635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943274,0.00011503551,0.000019480898,0.00014989373,0.00012997446,0.00015279619],"domain_scores_gemma":[0.9978594,0.0010724637,0.00026469107,0.0002831192,0.00016323576,0.0003570848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003856088,0.00043639762,0.00049645576,0.0009737868,0.0013952778,0.001847294,0.0011991634,0.0009881915,0.011053734],"category_scores_gemma":[0.0025366913,0.0004916612,0.00039307633,0.0008653743,0.0011339108,0.0023894133,0.0015047322,0.0018803057,0.0008233955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022829811,0.000079693484,0.001623244,0.0002414804,0.00003719915,0.00061684416,0.0003786583,0.008947643,0.009443793,0.95342976,0.009981242,0.0149921095],"study_design_scores_gemma":[0.000055362652,0.00006214625,0.0031463332,0.00005096794,0.00004750436,0.001233962,0.0003265517,0.056309745,0.0063657397,0.91383344,0.018534584,0.000033797613],"about_ca_topic_score_codex":0.0010260654,"about_ca_topic_score_gemma":0.0024267987,"teacher_disagreement_score":0.011053734,"about_ca_system_score_codex":0.0008206544,"about_ca_system_score_gemma":0.00038806276,"threshold_uncertainty_score":0.036978424},"labels":[],"label_agreement":null},{"id":"W6738926","doi":"10.1016/0304-3940(84)90123-x","title":"Self-centered super graph of a graph and center number of a graph.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Windmill graph; Cubic graph; Butterfly graph; Graph; Combinatorics; Line graph; Voltage graph; Simplex graph; Discrete mathematics","score_opus":0.02317031662195031,"score_gpt":0.27043285598175565,"score_spread":0.24726253935980533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6738926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33361337,0.0019871935,0.5346749,0.002486445,0.0009728501,0.00026377666,0.0051297727,0.0010468968,0.11982489],"genre_scores_gemma":[0.8191393,0.0020843106,0.12627527,0.00094899815,0.0008064938,0.00038778118,0.0041073347,0.00044877437,0.045801792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993948,0.00016959014,0.000028476901,0.00021979354,0.00010978997,0.00007752689],"domain_scores_gemma":[0.9976102,0.0008375508,0.00056311296,0.0003518352,0.0003038336,0.0003334821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004690344,0.00056744006,0.00061528187,0.0025312917,0.0009292707,0.001517143,0.0007287022,0.00074376987,0.015544363],"category_scores_gemma":[0.002075258,0.0003092265,0.0007197024,0.0016803833,0.0016723115,0.002233341,0.00095370755,0.000986605,0.0022799887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009546253,0.00004832392,0.0011349974,0.00025374698,0.000055016866,0.00038546431,0.00033581443,0.0027896685,0.0064739003,0.95269555,0.007277295,0.0284548],"study_design_scores_gemma":[0.000025998941,0.0000779116,0.0026957286,0.000045569206,0.000044016568,0.0010549927,0.00016785468,0.014840796,0.0021074584,0.94138294,0.03752342,0.00003324006],"about_ca_topic_score_codex":0.00083471235,"about_ca_topic_score_gemma":0.0013373883,"teacher_disagreement_score":0.015544363,"about_ca_system_score_codex":0.0008086471,"about_ca_system_score_gemma":0.0004488086,"threshold_uncertainty_score":0.05200106},"labels":[],"label_agreement":null},{"id":"W68092451","doi":"","title":"Generalized Fibonacci polynomial of graph.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Combinatorics; Graph; Fibonacci polynomials; Discrete mathematics; Orthogonal polynomials; Difference polynomials","score_opus":0.02513507556700114,"score_gpt":0.2826466010507899,"score_spread":0.2575115254837888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W68092451","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19695848,0.0049548796,0.17780401,0.0054514464,0.002243939,0.00009706162,0.0015416911,0.0006618185,0.6102866],"genre_scores_gemma":[0.8710276,0.0023295814,0.0419801,0.0010989648,0.0010648124,0.000114020826,0.00076104235,0.00022418195,0.08139981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996007,0.00007289879,0.000011334883,0.00009057505,0.00012626027,0.00009825239],"domain_scores_gemma":[0.9994777,0.0002080263,0.00004878149,0.00008240018,0.000111810914,0.00007144006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035230693,0.00048788104,0.0007164454,0.0022268794,0.0016936903,0.002146222,0.0007556594,0.0008743897,0.015494969],"category_scores_gemma":[0.0018442237,0.0002640555,0.0007248241,0.0016305045,0.0021221177,0.0025123763,0.0011163901,0.002086536,0.0033862172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001361479,0.000004671986,0.00007462635,0.000028844399,0.0000030088356,0.000047965255,0.000069522655,0.00037534235,0.0003969861,0.98844725,0.0043636938,0.006174346],"study_design_scores_gemma":[0.000007516672,0.000007745291,0.00019787569,0.000012072221,0.0000046242853,0.00020108053,0.00004956639,0.0027692898,0.00029135926,0.9845083,0.011941281,0.000009443586],"about_ca_topic_score_codex":0.0023503934,"about_ca_topic_score_gemma":0.0032170957,"teacher_disagreement_score":0.015494969,"about_ca_system_score_codex":0.0016596707,"about_ca_system_score_gemma":0.0007639821,"threshold_uncertainty_score":0.051835835},"labels":[],"label_agreement":null},{"id":"W68153034","doi":"","title":"Szeged Index of armchair polyhex Nanotube.","year":2008,"lang":"hu","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Topological index; Nanotube; Molecular graph; Index (typography); Graph; Mathematics; Bond graph; Combinatorics; Materials science; Nanotechnology; Carbon nanotube; Computer science","score_opus":0.02537950164128944,"score_gpt":0.2624510424169788,"score_spread":0.23707154077568937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W68153034","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8285749,0.0018528474,0.07643358,0.00039547755,0.0003503471,0.0000610644,0.0012170366,0.00033470118,0.09078004],"genre_scores_gemma":[0.98274106,0.0004285899,0.007971247,0.00005328414,0.000046378245,0.000045049142,0.00034904244,0.000053941967,0.008311515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99989974,0.000012767905,0.000009229449,0.000020721274,0.000036315363,0.000021236812],"domain_scores_gemma":[0.99984825,0.000027320511,0.00003889751,0.000015164562,0.000032641976,0.00003768516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013098794,0.00028665943,0.00028009506,0.0022339202,0.00050028745,0.0008963861,0.00027487995,0.00035662862,0.0057210336],"category_scores_gemma":[0.00032081475,0.00007913434,0.00016817421,0.0008040285,0.0007838476,0.00092126813,0.0004783777,0.00025744273,0.0006757263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017618382,0.00004310535,0.0023515609,0.00017206938,0.000020217949,0.0004410331,0.00017999727,0.012899987,0.037437513,0.9186054,0.0031925477,0.02448041],"study_design_scores_gemma":[0.00003041432,0.0001718782,0.008698439,0.000065837994,0.000029430506,0.0011659907,0.0003108333,0.15742809,0.032192826,0.78405064,0.015750583,0.000105008636],"about_ca_topic_score_codex":0.00029099028,"about_ca_topic_score_gemma":0.0003853618,"teacher_disagreement_score":0.0057210336,"about_ca_system_score_codex":0.00047392433,"about_ca_system_score_gemma":0.00019874149,"threshold_uncertainty_score":0.019138753},"labels":[],"label_agreement":null},{"id":"W6929521966","doi":"10.4224/9174792","title":"NRC-IIT's ILT Group at the Cross-Language Evaluation Forum","year":2004,"lang":"en","type":"article","venue":"NPARC","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Clef; Query expansion; Information access; Document retrieval; Multilingualism; Search engine","score_opus":0.03566353617387028,"score_gpt":0.3574427293318692,"score_spread":0.3217791931579989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929521966","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04673279,0.024558056,0.257213,0.06327157,0.029188583,0.009861725,0.03976188,0.024526846,0.5048855],"genre_scores_gemma":[0.15584879,0.005158585,0.1985537,0.010452838,0.004841502,0.013374063,0.09423314,0.018898074,0.49863926],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9624726,0.020823287,0.001712653,0.003017761,0.009841004,0.002132708],"domain_scores_gemma":[0.9069298,0.022139402,0.0024199497,0.012612034,0.04503216,0.010866728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.075907715,0.002177935,0.0027698881,0.006025449,0.0030644333,0.008075887,0.003300469,0.0053953705,0.086399004],"category_scores_gemma":[0.06940189,0.00075659686,0.0012000747,0.0034160109,0.0017218309,0.0072601,0.006371925,0.005880818,0.04714279],"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.0012135329,0.00087301276,0.0013209975,0.00051621994,0.000089386354,0.00021976726,0.00078328606,0.0010272263,0.008432538,0.014788021,0.75679713,0.21393897],"study_design_scores_gemma":[0.0007086243,0.00071851094,0.0051699225,0.0004913323,0.000087746674,0.00038440747,0.00066404644,0.008090228,0.012784667,0.0110301245,0.95971745,0.00015297033],"about_ca_topic_score_codex":0.0072203455,"about_ca_topic_score_gemma":0.006240094,"teacher_disagreement_score":0.086399004,"about_ca_system_score_codex":0.00446659,"about_ca_system_score_gemma":0.006661746,"threshold_uncertainty_score":0.40144318},"labels":[],"label_agreement":null},{"id":"W6929748691","doi":"10.5064/f6buax58/0z6hwe","title":"Burke_EDI_NENA.MA004.ResearcherSurvey.2017.09.24.docx","year":2018,"lang":"en","type":"dataset","venue":"Syracuse University Qualitative Data Repository","topic":"Graph theory and applications","field":"Mathematics","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":"McGill University","funders":"","keywords":"Identifier; Survey data collection; Plan (archaeology); Survey methodology; Identification (biology); Scale (ratio); Data collection","score_opus":0.2616690984587361,"score_gpt":0.4376984976095272,"score_spread":0.17602939915079113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929748691","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044438555,0.000291921,0.006330532,0.0044731195,0.0014331234,0.008578587,0.77138484,0.01722362,0.18584037],"genre_scores_gemma":[0.03622055,0.0010940345,0.022180026,0.0058727534,0.00071315485,0.11486222,0.42124486,0.014630058,0.38318235],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963207,0.0019797115,0.00028648958,0.00023697241,0.00079273205,0.00038347216],"domain_scores_gemma":[0.9565936,0.020544602,0.0016776948,0.004940471,0.01445308,0.0017905808],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.009999045,0.00092932826,0.00090558804,0.003255422,0.0015601566,0.003275175,0.0016825125,0.0009977273,0.7335785],"category_scores_gemma":[0.05527521,0.0010788281,0.0005224628,0.0043883054,0.0005742405,0.002898532,0.0027330013,0.0015057621,0.44410276],"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.00004561019,0.000047566697,0.0004598723,0.0002767389,0.0000037921218,0.000008116048,0.00027512028,0.000020210198,0.000035348196,0.0008138565,0.9776488,0.020364976],"study_design_scores_gemma":[0.00010012193,0.00006501261,0.005687995,0.00051276805,0.000005603729,0.000016856966,0.0012558306,0.00012777196,0.00027727959,0.0013935767,0.99053216,0.000025001757],"about_ca_topic_score_codex":0.009527591,"about_ca_topic_score_gemma":0.011687495,"teacher_disagreement_score":0.2664215,"about_ca_system_score_codex":0.0017165182,"about_ca_system_score_gemma":0.00344285,"threshold_uncertainty_score":0.38001788},"labels":[],"label_agreement":null},{"id":"W6930170799","doi":"10.5281/zenodo.11822075","title":"discovering psychology the science of mind 1st canadian edition pdf","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Nature versus nurture; Psychology of science; Set (abstract data type); Psychological science; Psychology of learning; Key (lock); Science education; Behavioural sciences; Psychological research","score_opus":0.052791931080578135,"score_gpt":0.308876403006463,"score_spread":0.2560844719258849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930170799","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.0003886975,0.006905951,0.0015597777,0.003755764,0.005035144,0.0002021625,0.012707241,0.0025692915,0.966876],"genre_scores_gemma":[0.0013983917,0.006852718,0.001475479,0.00056060764,0.0004965141,0.0000664684,0.0033893194,0.0008809013,0.9848797],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986278,0.00003739771,0.000030434237,0.00008692907,0.0011171525,0.00010029138],"domain_scores_gemma":[0.9953366,0.00039749776,0.00008096751,0.00029240726,0.0032751122,0.0006175356],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00078307715,0.0014124224,0.0013940757,0.0038425913,0.0027761436,0.0091453325,0.0016895223,0.001656142,0.6522731],"category_scores_gemma":[0.0049007945,0.0008218282,0.0010725842,0.007293526,0.001743021,0.0040862397,0.001690919,0.0026777429,0.4108849],"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.000010160331,0.000007741421,0.000042724037,0.00015684258,0.000001844905,0.000015454701,0.000030641866,0.000059150832,0.000120067896,0.002857276,0.9545101,0.042188074],"study_design_scores_gemma":[0.0000029502858,0.000004887141,0.00043790092,0.00013357693,0.0000019627216,0.000026920787,0.00004910709,0.000029556888,0.00005943681,0.00074446417,0.9984999,0.00000927841],"about_ca_topic_score_codex":0.29701695,"about_ca_topic_score_gemma":0.39389142,"teacher_disagreement_score":0.34772688,"about_ca_system_score_codex":0.009855489,"about_ca_system_score_gemma":0.019465132,"threshold_uncertainty_score":0.59057623},"labels":[],"label_agreement":null},{"id":"W6930312719","doi":"10.5281/zenodo.11465770","title":"_%%(` [[[[WhatsApp ((( (+27) 736616875))) *____**)) TOP QUALITY COUNTERFEIT MONEY FOR SALE Bahamas Westport Namibia\\\\EUROPE USA 3","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Nucleofection; Hyporeflexia; Fusible alloy; Diafiltration; Pretext; Gestational period","score_opus":0.07487785241246812,"score_gpt":0.32867950343412183,"score_spread":0.2538016510216537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930312719","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.00071614055,0.00022295142,0.0005205469,0.0014366431,0.001150196,0.00006672252,0.00163586,0.0017591127,0.9924918],"genre_scores_gemma":[0.0023202463,0.00018397752,0.00029503333,0.000432917,0.00009061544,0.000015870604,0.0006170976,0.00058991445,0.9954543],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99957913,0.00003070948,0.000013197933,0.000066562185,0.00019516623,0.00011522442],"domain_scores_gemma":[0.99882275,0.00007994902,0.000055184475,0.00010320619,0.0005650742,0.00037389304],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004419317,0.0007006337,0.00039003068,0.00085948233,0.0021973858,0.0049098046,0.0005598374,0.0012413923,0.8988922],"category_scores_gemma":[0.0019400727,0.0003358214,0.0003821048,0.0008170818,0.000562582,0.0025764804,0.0020402535,0.0009889869,0.825914],"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.000016874194,0.0000143717425,0.00016076205,0.000038022667,0.0000010176819,0.0000313231,0.000046675817,0.000013155341,0.0003026825,0.0018830199,0.9613001,0.036192123],"study_design_scores_gemma":[0.0000027467258,0.000005657822,0.00032839287,0.000018672767,5.753564e-7,0.00003622538,0.000053857144,0.000015821954,0.000120668046,0.0001037315,0.99931026,0.0000033902402],"about_ca_topic_score_codex":0.009993883,"about_ca_topic_score_gemma":0.016282868,"teacher_disagreement_score":0.101107776,"about_ca_system_score_codex":0.0012342834,"about_ca_system_score_gemma":0.0010673846,"threshold_uncertainty_score":0.14421797},"labels":[],"label_agreement":null},{"id":"W6930356765","doi":"10.5281/zenodo.11730461","title":"what is private banking pdf","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Net worth; Investment banking; Retail banking; Telephone banking; Negotiation; Cash; Database transaction; Financial services","score_opus":0.04814260177196862,"score_gpt":0.2900112395310885,"score_spread":0.24186863775911988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930356765","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.00038681403,0.0006577469,0.00048574613,0.003003814,0.0031366514,0.000100419275,0.0027359363,0.002485061,0.9870078],"genre_scores_gemma":[0.0025564567,0.0008288257,0.00046186344,0.0015401748,0.0010366177,0.000043098527,0.0012960497,0.0013906745,0.9908462],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986487,0.00011792546,0.00006305657,0.00015137829,0.00081257714,0.00020632397],"domain_scores_gemma":[0.99359435,0.0005387731,0.00021574684,0.0007720318,0.0030347896,0.0018443541],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00092892634,0.00080698164,0.0010085774,0.0022513792,0.0031928988,0.013717803,0.0010441109,0.0024396065,0.8923964],"category_scores_gemma":[0.007162436,0.0006266094,0.0008604984,0.0027197525,0.0008900304,0.0098451935,0.003191864,0.0022894768,0.8628326],"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.000016509764,0.000023744038,0.000059188733,0.000057080248,0.0000011756275,0.00003319876,0.000023662049,0.000016905102,0.000115664196,0.0012889198,0.964664,0.03369991],"study_design_scores_gemma":[0.000004814228,0.00000814527,0.0002863636,0.000059110538,0.0000013662235,0.00005959943,0.000060278053,0.000018037343,0.00013247337,0.00053531944,0.9988275,0.0000070771653],"about_ca_topic_score_codex":0.0025213978,"about_ca_topic_score_gemma":0.0045605903,"teacher_disagreement_score":0.10760361,"about_ca_system_score_codex":0.0015532995,"about_ca_system_score_gemma":0.002235413,"threshold_uncertainty_score":0.15348351},"labels":[],"label_agreement":null},{"id":"W6931330411","doi":"10.5281/zenodo.6075213","title":"Dolichomitus imperator Kriechbaumer 1854","year":2016,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Ovipositor; Tarsus (eyelids); Dorsum; Wing; Mandible (arthropod mouthpart); Stridulation","score_opus":0.05214402308824361,"score_gpt":0.28317369881283494,"score_spread":0.23102967572459132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931330411","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.66794664,0.013899237,0.006018233,0.0004480948,0.0003157614,0.0003522284,0.0032058314,0.0007814185,0.30703256],"genre_scores_gemma":[0.9840544,0.0020837444,0.0021027569,0.00016824661,0.000055624994,0.000041779207,0.0011653263,0.000026303918,0.01030185],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99986386,0.0000096969225,0.000009496968,0.0000467352,0.000033816355,0.000036317662],"domain_scores_gemma":[0.9999249,0.000008961006,0.000032750253,0.000008919356,0.000015469386,0.000008918667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012502394,0.0004612463,0.00029019904,0.0008884871,0.0009802907,0.0002899609,0.00042402538,0.0002733834,0.010406743],"category_scores_gemma":[0.00023615608,0.00019338532,0.00011999061,0.0005254105,0.00064590963,0.0008913004,0.00095272943,0.00033950174,0.0020582215],"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.0005478808,0.00010535706,0.08920394,0.0012681901,0.000103684586,0.0014312423,0.0037829631,0.0006759047,0.03892552,0.0040013827,0.019953938,0.8399999],"study_design_scores_gemma":[0.000058870195,0.00020237142,0.70705986,0.00031880848,0.00013242585,0.0050881654,0.0016826974,0.0003345663,0.0020107222,0.0008994633,0.28217804,0.00003397732],"about_ca_topic_score_codex":0.011175511,"about_ca_topic_score_gemma":0.031761196,"teacher_disagreement_score":0.011175511,"about_ca_system_score_codex":0.00047534067,"about_ca_system_score_gemma":0.00035013104,"threshold_uncertainty_score":0.034814},"labels":[],"label_agreement":null},{"id":"W6931717919","doi":"10.5281/zenodo.8411241","title":"Mixed Methods DMP Example (2023)","year":2023,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Graph theory and applications","field":"Mathematics","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 Alberta","funders":"","keywords":"Expert system; Missing data; Group (periodic table); Work (physics); Data collection","score_opus":0.14230891647268976,"score_gpt":0.35105957015249295,"score_spread":0.2087506536798032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931717919","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.01684359,0.0008128122,0.6534121,0.0043030847,0.00054154545,0.00054967945,0.01598987,0.0021130017,0.3054343],"genre_scores_gemma":[0.1521154,0.00051959604,0.7158705,0.0008742254,0.00012927775,0.0010282676,0.0069825635,0.0010598804,0.12142029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992748,0.00036320122,0.000019911125,0.00007170484,0.00021677719,0.00005360548],"domain_scores_gemma":[0.99833834,0.0010618202,0.000038600156,0.00013008893,0.00036663274,0.00006452041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014348535,0.00050580985,0.00029534573,0.00071514485,0.0006684169,0.00095149525,0.0008351675,0.0010906205,0.054977186],"category_scores_gemma":[0.005013818,0.00023908202,0.0007459152,0.0013613559,0.00026514003,0.00063614576,0.00085291645,0.000943572,0.005498409],"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.00042457605,0.00018677107,0.0011724794,0.0006511184,0.00010442851,0.00070805644,0.00014845526,0.13875863,0.0017857676,0.36351264,0.22706527,0.26548183],"study_design_scores_gemma":[0.00026942368,0.000081101054,0.0010523711,0.0001378944,0.00004615749,0.0004037039,0.00017991768,0.4014104,0.004127855,0.17848171,0.4137701,0.000039454208],"about_ca_topic_score_codex":0.009454367,"about_ca_topic_score_gemma":0.017545786,"teacher_disagreement_score":0.054977186,"about_ca_system_score_codex":0.0007618571,"about_ca_system_score_gemma":0.0011556465,"threshold_uncertainty_score":0.18391699},"labels":[],"label_agreement":null},{"id":"W6931884166","doi":"10.5683/sp3/7flkhq","title":"Canadian Tobacco Use Monitoring Survey, 2010: Cycle 2, Person File","year":2023,"lang":"en","type":"dataset","venue":"Borealis","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Statistics Canada","funders":"","keywords":"Tobacco use; Data collection; Public health; Smoking epidemiology; National Health Interview Survey; Tobacco control; Smoking prevalence","score_opus":0.10016864236071714,"score_gpt":0.31596108966137976,"score_spread":0.2157924473006626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931884166","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014490353,0.000034892528,0.000025696554,0.000027241998,0.0000070114324,0.000013596308,0.9992508,0.000045579796,0.0004501809],"genre_scores_gemma":[0.00070993276,0.000058065085,0.00015246072,0.000033929256,0.000004296423,0.00006131924,0.99794155,0.00001775654,0.001020562],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986419,0.00009218353,0.00014417377,0.0002589642,0.0005921281,0.00027059205],"domain_scores_gemma":[0.9946919,0.00029971648,0.000361266,0.0004899711,0.0036931632,0.00046394925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012675117,0.0018153413,0.0016449358,0.0045513324,0.0016446093,0.0020310248,0.0040310477,0.0012692153,0.032341808],"category_scores_gemma":[0.007898341,0.0010555445,0.0012219946,0.013948894,0.0004305265,0.0008294707,0.0010913054,0.0016352782,0.026159942],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000052726107,0.000018166771,0.0031545842,0.00028384652,0.000030093443,0.0000145363565,0.00002024892,0.00020781373,0.000030914332,0.0003060823,0.99404895,0.0018320209],"study_design_scores_gemma":[0.00045370066,0.000027970527,0.12493741,0.0005784444,0.00011365625,0.000104239756,0.00021800875,0.0013574071,0.0004480631,0.0008313239,0.8708438,0.00008596668],"about_ca_topic_score_codex":0.9536105,"about_ca_topic_score_gemma":0.9737322,"teacher_disagreement_score":0.04638952,"about_ca_system_score_codex":0.0147360675,"about_ca_system_score_gemma":0.021591617,"threshold_uncertainty_score":0.10819411},"labels":[],"label_agreement":null},{"id":"W6936881913","doi":"10.58079/ouq6","title":"Advanced methods in trees","year":2013,"lang":"en","type":"article","venue":"OpenEdition (OpenEdition)","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Identification (biology); Set (abstract data type); Tree (set theory); Key (lock); Term (time)","score_opus":0.03767354039332666,"score_gpt":0.3515898659593891,"score_spread":0.31391632556606247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6936881913","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.006423884,0.048255708,0.8078435,0.0081498185,0.0068325084,0.00007565796,0.00081263523,0.0013400787,0.12026629],"genre_scores_gemma":[0.22005114,0.05598966,0.58130026,0.0060197143,0.014542102,0.0004984123,0.0020976358,0.0019146261,0.11758648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985734,0.0005190101,0.000076523844,0.0002623794,0.00047618643,0.00009244906],"domain_scores_gemma":[0.9982657,0.00095831975,0.00008852538,0.00029130233,0.00028714986,0.00010907589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019307248,0.0008611193,0.00080165145,0.002249805,0.0008983061,0.0026287956,0.00090287405,0.0011175766,0.018002033],"category_scores_gemma":[0.0052062576,0.00044319732,0.0015682434,0.00235346,0.001763652,0.0041859313,0.0019672494,0.0040660477,0.0068836994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013949615,0.000018510416,0.00015960487,0.00016085652,0.000031689964,0.000046771525,0.00019126682,0.0024525782,0.00063115737,0.9093224,0.030936817,0.05603453],"study_design_scores_gemma":[0.000007769194,0.000017834493,0.00016089005,0.00007577365,0.000009456583,0.000069094094,0.000030628522,0.008372454,0.00027694574,0.89481634,0.09615251,0.000010357092],"about_ca_topic_score_codex":0.0010799674,"about_ca_topic_score_gemma":0.0010710985,"teacher_disagreement_score":0.018002033,"about_ca_system_score_codex":0.0013094249,"about_ca_system_score_gemma":0.0007407657,"threshold_uncertainty_score":0.060222805},"labels":[],"label_agreement":null},{"id":"W6950751949","doi":"10.5284/1017334","title":"Report on a Level 2 Building Survey at Tarn, Fell End, near Ravenstonedale, Cumbria","year":2003,"lang":"en","type":"article","venue":"Archaeology Data Service","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Fell; Field (mathematics); Field survey; Period (music); Quarter (Canadian coin)","score_opus":0.17851341352527575,"score_gpt":0.3665310528129138,"score_spread":0.18801763928763807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6950751949","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82476985,0.0006168289,0.003062152,0.0009102692,0.00015741943,0.0010206657,0.10647757,0.00042136185,0.06256386],"genre_scores_gemma":[0.71751815,0.0014197669,0.012294108,0.0009275995,0.00010631903,0.0013196905,0.10638799,0.00028516585,0.15974125],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9993642,0.00007586594,0.000047870686,0.0000930368,0.0002660722,0.00015304105],"domain_scores_gemma":[0.99844766,0.00013731468,0.0002068413,0.0001223517,0.00079417735,0.00029169995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046823965,0.00037227428,0.0003308822,0.0037146995,0.0013726772,0.0006774831,0.00054828427,0.0005624654,0.017140394],"category_scores_gemma":[0.0018253748,0.00043671098,0.00032768174,0.0033375018,0.00024414295,0.00056753715,0.001693126,0.00042044633,0.0055902726],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040493,0.00043826335,0.71984303,0.0008727324,0.00011089834,0.0030790397,0.021712175,0.0014253039,0.01413284,0.0008000337,0.11343243,0.123748325],"study_design_scores_gemma":[0.0000080799755,0.00018150159,0.8959415,0.00005403534,0.000024628966,0.00027938676,0.01252585,0.0002522391,0.0010026295,0.00006478406,0.08964125,0.000024090947],"about_ca_topic_score_codex":0.1279632,"about_ca_topic_score_gemma":0.39820942,"teacher_disagreement_score":0.1279632,"about_ca_system_score_codex":0.0011068955,"about_ca_system_score_gemma":0.0020742537,"threshold_uncertainty_score":0.25443673},"labels":[],"label_agreement":null},{"id":"W69622806","doi":"","title":"Remarks on a general model of a random digraph.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Mathematics; Combinatorics","score_opus":0.03522067822346185,"score_gpt":0.2683219233748625,"score_spread":0.23310124515140063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W69622806","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031822797,0.0058803945,0.20611246,0.18433557,0.0050880406,0.00021533869,0.0019659584,0.00097071443,0.5636088],"genre_scores_gemma":[0.74502534,0.008589893,0.04559139,0.06557457,0.0114083085,0.0006907651,0.0009356663,0.0005982938,0.12158586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981628,0.00080336176,0.00005830165,0.00036674974,0.0003965957,0.00021215022],"domain_scores_gemma":[0.9944185,0.0035059936,0.00040971767,0.00074770453,0.00041098407,0.00050711585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025334214,0.0010584253,0.0014605799,0.0017284869,0.0027330662,0.0038692623,0.0035945144,0.006186121,0.04255652],"category_scores_gemma":[0.009919761,0.0005777541,0.0018629177,0.0014218477,0.0056653344,0.011202693,0.0033454213,0.0052974606,0.0042007836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006430511,0.000005674419,0.000039807634,0.000021126114,0.0000041941453,0.00008413408,0.000046578956,0.0006120018,0.00004625806,0.99033654,0.00820793,0.000589266],"study_design_scores_gemma":[0.000009381532,0.0000068642066,0.000064748754,0.000016189642,0.000003371154,0.00007856492,0.000036217443,0.0019436848,0.000020987029,0.99077374,0.0070395134,0.0000068030313],"about_ca_topic_score_codex":0.0029961886,"about_ca_topic_score_gemma":0.0029403863,"teacher_disagreement_score":0.04255652,"about_ca_system_score_codex":0.0022454092,"about_ca_system_score_gemma":0.0007098094,"threshold_uncertainty_score":0.14236575},"labels":[],"label_agreement":null},{"id":"W6967393897","doi":"10.4230/lipics.approx/random.2024.36","title":"On the Houdré-Tetali Conjecture About an Isoperimetric Constant of Graphs","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Graph theory and applications","field":"Mathematics","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","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Isoperimetric inequality; Conjecture; Counterexample; Constant (computer programming); Logarithm; Eigenvalues and eigenvectors","score_opus":0.038046834047651995,"score_gpt":0.3205532384181279,"score_spread":0.2825064043704759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6967393897","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6026363,0.0036240697,0.2192939,0.020376058,0.00070587295,0.00010065227,0.00055212446,0.0008324849,0.15187857],"genre_scores_gemma":[0.96803844,0.0012746868,0.018988807,0.001958917,0.0008363069,0.00011330797,0.00027120087,0.00024979573,0.008268517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973373,0.0005855027,0.000100777776,0.00080284395,0.0007652828,0.00040825998],"domain_scores_gemma":[0.964648,0.027119566,0.0017342503,0.0029961357,0.0016997997,0.0018021539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031067745,0.0008879208,0.001002918,0.0032666575,0.0023699033,0.0038946208,0.0022828465,0.0025606505,0.008083033],"category_scores_gemma":[0.035624065,0.0007586227,0.00103698,0.0026040236,0.0067044096,0.011709448,0.0038806335,0.006367902,0.0012713748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014203919,0.000048900678,0.0014210099,0.000104332285,0.000016948543,0.00012061219,0.00042108912,0.0045440886,0.0027877877,0.974797,0.004679871,0.010916307],"study_design_scores_gemma":[0.000032120155,0.000032119544,0.0013507353,0.000034472258,0.000016026272,0.00022741624,0.00017390243,0.023348127,0.0017506139,0.96913034,0.0038701023,0.000034004162],"about_ca_topic_score_codex":0.0018380824,"about_ca_topic_score_gemma":0.00080882857,"teacher_disagreement_score":0.008083033,"about_ca_system_score_codex":0.0023955295,"about_ca_system_score_gemma":0.0005073966,"threshold_uncertainty_score":0.027040482},"labels":[],"label_agreement":null},{"id":"W6994304677","doi":"","title":"Ramanujan graphs","year":2014,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Graph theory and applications","field":"Mathematics","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":"McGill University","funders":"","keywords":"Ramanujan's sum; Expander graph; Mathematical proof; Graph theory; Topological graph theory; Graph","score_opus":0.02535069051174987,"score_gpt":0.2787685394117108,"score_spread":0.25341784889996094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6994304677","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.062065307,0.015412192,0.21702209,0.004701746,0.0015499879,0.00024526616,0.0011826836,0.00050266687,0.69731814],"genre_scores_gemma":[0.6123173,0.02078469,0.12877093,0.0034906256,0.0026634487,0.0005656545,0.001581952,0.00044856247,0.22937681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991284,0.00021089907,0.000032707314,0.00018680988,0.0002958792,0.00014527362],"domain_scores_gemma":[0.99919385,0.0003728606,0.0000793272,0.00012584026,0.00016186544,0.00006628712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064575294,0.0007330232,0.0006311577,0.0020804903,0.0023793355,0.0021517188,0.0010586184,0.0010977753,0.02071527],"category_scores_gemma":[0.0018326106,0.00036313458,0.0009286374,0.0015540193,0.002210488,0.0038084523,0.0020107564,0.0024427103,0.004157416],"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.0000037361103,0.00000514432,0.0000408194,0.000024917726,0.0000022712752,0.000033678043,0.000105679435,0.0002792768,0.00028028726,0.992265,0.0017821046,0.005177091],"study_design_scores_gemma":[0.000003929829,0.000013068148,0.00015188644,0.000036581212,0.000004230574,0.00024662632,0.00010334488,0.0016860378,0.00032623982,0.9165164,0.08090102,0.000010664559],"about_ca_topic_score_codex":0.0012352243,"about_ca_topic_score_gemma":0.0011974428,"teacher_disagreement_score":0.02071527,"about_ca_system_score_codex":0.0013758898,"about_ca_system_score_gemma":0.00064765627,"threshold_uncertainty_score":0.06929946},"labels":[],"label_agreement":null},{"id":"W7024613932","doi":"","title":"Souveraineté journalistique. \\n II ne faut pas toujours croire les journalistes de Mario Cardinal, Bayard Canada, 284 p. \\n Nos ennemis les médias de Patrick Bourgeois, Éditions du Québécois, 207 p. \\n Le référendum volé de Robin Philpot, Les Éditions des intouchables, 205 p.","year":2006,"lang":"fr","type":"article","venue":"Érudit (Université de Montréal)","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Context (archaeology); Independence (probability theory); Identity (music)","score_opus":0.010730819184405877,"score_gpt":0.18475396197106497,"score_spread":0.1740231427866591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024613932","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.0017692415,0.52510065,0.0018613244,0.1130769,0.044360198,0.00005754778,0.0029022768,0.00063465437,0.3102373],"genre_scores_gemma":[0.015245177,0.118249476,0.0022829403,0.0070504006,0.011433464,0.000051331805,0.0009386156,0.0006515752,0.8440971],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974572,0.00028760327,0.00009712245,0.0003107818,0.0016030418,0.00024417628],"domain_scores_gemma":[0.99348336,0.0009587093,0.00029418,0.00030144246,0.0037096841,0.0012526048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002067536,0.0011564945,0.0010098428,0.0041730315,0.0055827145,0.012270292,0.0009646992,0.0021235552,0.06303831],"category_scores_gemma":[0.005522022,0.0006959312,0.00042972245,0.007414498,0.003732215,0.0047462108,0.0016065829,0.003924497,0.026597032],"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.00003383574,0.000010423418,0.00022114652,0.00024647915,0.000007719685,0.000050638155,0.00048698494,0.00003870691,0.00057220407,0.01685072,0.94714504,0.034336023],"study_design_scores_gemma":[0.0000023370833,0.0000020373518,0.00059609895,0.000090529546,0.0000018320899,0.00005124572,0.00017270115,0.000015713173,0.00006489914,0.0008355971,0.9981623,0.000004732492],"about_ca_topic_score_codex":0.30229753,"about_ca_topic_score_gemma":0.606648,"teacher_disagreement_score":0.69770247,"about_ca_system_score_codex":0.014339011,"about_ca_system_score_gemma":0.023934182,"threshold_uncertainty_score":0.6010759},"labels":[],"label_agreement":null},{"id":"W7034615730","doi":"","title":"Webroot Antivirus 1800-290-5189 tech Support phone number","year":2016,"lang":"en","type":"other","venue":"OSF Preprints (OSF Preprints)","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Phone; Service (business); Telephone number; Phone call; Phishing; Blacklist","score_opus":0.02131354989828236,"score_gpt":0.30121312711798626,"score_spread":0.2798995772197039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7034615730","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.0011960164,0.00010198047,0.00068474415,0.00019101235,0.00015461528,0.00012130975,0.00092109235,0.0024060428,0.9942232],"genre_scores_gemma":[0.001728381,0.0000859013,0.00025618088,0.00012299902,0.00003709677,0.000027444317,0.00073260796,0.00025622608,0.99675316],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99953616,0.00002427381,0.000014162083,0.000115423594,0.00022104708,0.00008900025],"domain_scores_gemma":[0.99902,0.00010317548,0.000046035857,0.00011964982,0.0003564604,0.00035468422],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002912706,0.001118645,0.0005094378,0.0015701319,0.0017741615,0.0023918913,0.0009488256,0.0014725197,0.9075864],"category_scores_gemma":[0.00077803707,0.0007081348,0.00043416466,0.0007790249,0.00033515037,0.0015958027,0.0014576571,0.0012478693,0.8860384],"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.00009144659,0.0003108468,0.0009045171,0.000103614766,0.000006372155,0.00011699991,0.00005938174,0.00011048821,0.0035333459,0.0017806258,0.8458768,0.1471056],"study_design_scores_gemma":[0.000053867876,0.00013001668,0.002856132,0.00007251052,0.000013693126,0.00022722498,0.0001324146,0.00043919266,0.0014688815,0.00036214796,0.9942293,0.000014708972],"about_ca_topic_score_codex":0.0051335166,"about_ca_topic_score_gemma":0.011759946,"teacher_disagreement_score":0.092413604,"about_ca_system_score_codex":0.0007177021,"about_ca_system_score_gemma":0.0015076351,"threshold_uncertainty_score":0.1318168},"labels":[],"label_agreement":null},{"id":"W7036318586","doi":"","title":"[Bourse] Le Ryerson Image Centre - Fellowships","year":2018,"lang":"en","type":"other","venue":"Industrias Culturais (Universidade de Coimbra)","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Stipend; Image (mathematics); Research centre; National library; Digital image","score_opus":0.03969357702870235,"score_gpt":0.27154145450557954,"score_spread":0.23184787747687718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7036318586","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.0024528073,0.004293428,0.0033064194,0.07142866,0.019120244,0.00018625632,0.0029127405,0.0013941663,0.8949053],"genre_scores_gemma":[0.0060462193,0.00095345115,0.0013152658,0.002871788,0.00073172624,0.000041045314,0.0005382457,0.00052664743,0.98697555],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99768424,0.00040143332,0.00008687328,0.00034938604,0.0010791657,0.0003988811],"domain_scores_gemma":[0.993929,0.00041904752,0.0001842627,0.00045757627,0.002426412,0.0025836807],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0026254673,0.0007250938,0.0005799068,0.0015909502,0.0047535617,0.005856295,0.0014850504,0.0023771543,0.3212246],"category_scores_gemma":[0.00939607,0.00037408652,0.0004701696,0.0013191566,0.0012687312,0.0043399152,0.0047329017,0.0039043669,0.15468867],"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.000019161738,0.000010555739,0.000092973685,0.000026887015,0.0000011790313,0.00006442766,0.00023576886,0.000015977743,0.00007868444,0.028921088,0.9551113,0.015421897],"study_design_scores_gemma":[0.0000014313082,0.0000022829918,0.000063703,0.000015193341,2.7315588e-7,0.000048521233,0.00006762208,0.0000118127655,0.000029428746,0.00054002635,0.9992173,0.0000023873445],"about_ca_topic_score_codex":0.020543234,"about_ca_topic_score_gemma":0.044327438,"teacher_disagreement_score":0.3212246,"about_ca_system_score_codex":0.0046962276,"about_ca_system_score_gemma":0.0059497235,"threshold_uncertainty_score":0.9681907},"labels":[],"label_agreement":null},{"id":"W7037287127","doi":"","title":"The effects of earthworm (Lumbricus terrestris) activity on phosphorus availability in an Ontario podzol","year":2007,"lang":"en","type":"dissertation","venue":"The Atrium (University of Guelph)","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Ontario","keywords":"Earthworm; Phosphorus; Podzol; Phosphate; Humus; Soil water","score_opus":0.016536138469162586,"score_gpt":0.2625499846386268,"score_spread":0.2460138461694642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7037287127","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9994325,0.0000513171,0.000030936026,0.000019372514,8.086574e-7,0.000003419866,0.000047935955,0.000003028877,0.0004106372],"genre_scores_gemma":[0.9982486,0.00011696668,0.00019499328,0.00002145551,9.65863e-7,0.000004944018,0.00014375105,0.000002346612,0.001266063],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998956,0.000015758182,0.0000046671007,0.000025715439,0.000021807846,0.000036442674],"domain_scores_gemma":[0.9996176,0.00010666963,0.000090192225,0.000014199631,0.00004193672,0.00012935973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001242597,0.00019628668,0.00015670748,0.00023370315,0.000443557,0.0004755045,0.00029635805,0.00019567955,0.0006889441],"category_scores_gemma":[0.00043417377,0.000154064,0.00010847438,0.00019423444,0.00044731417,0.0001351209,0.0002343594,0.00020614377,0.000101987775],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0032824574,0.00041685204,0.11204356,0.00022474682,0.00006440283,0.0006777847,0.0009458256,0.0009963625,0.86579984,0.00023690074,0.00041635582,0.014895017],"study_design_scores_gemma":[0.0000714735,0.001968308,0.9275153,0.0000125224815,0.000056696183,0.00011110201,0.00097642164,0.0020728686,0.06553037,0.00012743779,0.001536365,0.000021108717],"about_ca_topic_score_codex":0.33143324,"about_ca_topic_score_gemma":0.6282134,"teacher_disagreement_score":0.66856676,"about_ca_system_score_codex":0.0038722649,"about_ca_system_score_gemma":0.0012400174,"threshold_uncertainty_score":0.65900815},"labels":[],"label_agreement":null},{"id":"W7067833125","doi":"","title":"On the normalized Laplacian energy and general Randic index&#13;\\nR_{-1} of graphs&#13;\\n","year":2010,"lang":"en","type":"article","venue":"Maynooth University ePrints and eTheses Archive (Maynooth University)","topic":"Graph theory and applications","field":"Mathematics","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nucleofection; Gestational period; TSG101; Dysgeusia; Liquation; Fusible alloy; Diafiltration; Hyporeflexia; Demotion","score_opus":0.014001789267132464,"score_gpt":0.21097368138479528,"score_spread":0.1969718921176628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7067833125","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4552969,0.0063822293,0.23771349,0.0096113775,0.0015023212,0.00007381786,0.0011763432,0.00056787324,0.2876757],"genre_scores_gemma":[0.9241702,0.0027683133,0.029209582,0.0011728507,0.0013886784,0.00012630099,0.00072123297,0.00063767337,0.039805148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936026,0.00022787026,0.000025449788,0.000163568,0.00014262585,0.00008021764],"domain_scores_gemma":[0.9962835,0.0019382769,0.0004119296,0.00048300196,0.0004433091,0.00044003417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016833256,0.00072000147,0.00084001647,0.0041116667,0.0015766226,0.0028795511,0.0023347184,0.0015449336,0.010129982],"category_scores_gemma":[0.008198915,0.00046649663,0.0006027317,0.0018051903,0.0034951002,0.0063620475,0.001868947,0.0022144534,0.0011943182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001700337,0.000013433391,0.00025217928,0.000026017678,0.000005649127,0.00001993036,0.000066941284,0.0023843716,0.00031592988,0.98988134,0.0026828547,0.004334309],"study_design_scores_gemma":[0.0000038108353,0.000005664364,0.00031990232,0.00001793161,0.000003646639,0.00005066632,0.000039013466,0.016548397,0.0001372478,0.9814237,0.0014376836,0.000012364606],"about_ca_topic_score_codex":0.0013821563,"about_ca_topic_score_gemma":0.002171968,"teacher_disagreement_score":0.010129982,"about_ca_system_score_codex":0.0016538273,"about_ca_system_score_gemma":0.0005586226,"threshold_uncertainty_score":0.03388816},"labels":[],"label_agreement":null},{"id":"W7083422078","doi":"10.5281/zenodo.17208966","title":"Compendium of R code and data for \"Peatland Mid-Infrared Database 1.0.0\"","year":2025,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Compendium; Code (set theory); Directory; Set (abstract data type); Workflow; Section (typography); Data file; Source code","score_opus":0.0923939584193533,"score_gpt":0.32989461754613153,"score_spread":0.23750065912677823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7083422078","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064307585,0.0016300858,0.061563134,0.0010378005,0.0011322652,0.0005294673,0.8214942,0.100191936,0.011777948],"genre_scores_gemma":[0.007480466,0.0016442146,0.11563797,0.002505874,0.00039009005,0.004650704,0.7154135,0.1324364,0.019840818],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9918189,0.0020531164,0.0011391593,0.0020469932,0.00249806,0.00044371493],"domain_scores_gemma":[0.97901845,0.010515445,0.001470256,0.004280346,0.0041130935,0.0006023607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009427954,0.0033999537,0.003937228,0.0050478275,0.0015776694,0.00580851,0.00646405,0.0024819402,0.2628839],"category_scores_gemma":[0.047031797,0.0033329749,0.0040351157,0.0053494456,0.0012906607,0.0036966796,0.004529163,0.0046224855,0.31552997],"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.00012453948,0.00001482498,0.0009525195,0.0031257032,0.000272437,0.000101765574,0.000104638086,0.0010102579,0.0012202671,0.0028543135,0.97672325,0.013495455],"study_design_scores_gemma":[0.00028245378,0.000044435135,0.0036018526,0.0012938492,0.00031437058,0.00043356008,0.00006322768,0.0025929816,0.0026015455,0.016134704,0.9724067,0.00023038656],"about_ca_topic_score_codex":0.007919443,"about_ca_topic_score_gemma":0.0098864725,"teacher_disagreement_score":0.2628839,"about_ca_system_score_codex":0.0016751584,"about_ca_system_score_gemma":0.0068946807,"threshold_uncertainty_score":0.8794343},"labels":[],"label_agreement":null},{"id":"W7109661522","doi":"10.61091/jcmcc128-23","title":"Vulnerability analysis of comb product of graphs and related applications in chemical structures","year":2025,"lang":"","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vertex (graph theory); Graph; Graph theory; Product (mathematics); Set (abstract data type); Vulnerability (computing); Measure (data warehouse); Connectivity; Network analysis","score_opus":0.011618732874357367,"score_gpt":0.28926138331213824,"score_spread":0.27764265043778086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109661522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39818186,0.0017120896,0.5810041,0.0010486825,0.000060674338,0.00020080272,0.001421928,0.00051150174,0.015858397],"genre_scores_gemma":[0.9365253,0.001044716,0.056788146,0.00012211096,0.000078671685,0.00017289947,0.0009685024,0.000109547065,0.0041900976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987778,0.00034568174,0.00006281778,0.00033928122,0.0003572424,0.000117223826],"domain_scores_gemma":[0.99206513,0.0050725252,0.0012219871,0.00061901496,0.0006809508,0.00034038714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015898683,0.0010279057,0.000798405,0.0030303549,0.0007783975,0.001470121,0.0009497282,0.00088309427,0.0031466538],"category_scores_gemma":[0.009836624,0.00048741902,0.001088698,0.0021072237,0.001694738,0.0034149352,0.001844819,0.00096823054,0.0003302585],"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.00027606232,0.00012108789,0.018286413,0.0006292717,0.00029597964,0.0013316766,0.0008895909,0.6285302,0.009501575,0.25823706,0.0039584213,0.07794267],"study_design_scores_gemma":[0.00000841417,0.00013670116,0.0038533518,0.00006076429,0.000070505965,0.0007438904,0.00028714997,0.7673055,0.0033018142,0.22003625,0.0041730544,0.000022638886],"about_ca_topic_score_codex":0.0016194199,"about_ca_topic_score_gemma":0.00094042975,"teacher_disagreement_score":0.0031466538,"about_ca_system_score_codex":0.0013393691,"about_ca_system_score_gemma":0.0005825354,"threshold_uncertainty_score":0.0105265975},"labels":[],"label_agreement":null},{"id":"W7110586487","doi":"","title":"Ramanujan graphs","year":2012,"lang":"en","type":"dissertation","venue":"Mspace (University of Manitoba)","topic":"Graph theory and applications","field":"Mathematics","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 Manitoba","funders":"","keywords":"Ramanujan's sum; Graph; Ramanujan tau function; Expander graph; Graph theory","score_opus":0.027005710974684946,"score_gpt":0.24532926628739307,"score_spread":0.21832355531270814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110586487","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0753111,0.006168451,0.36233333,0.003864227,0.001391267,0.00019038939,0.0007616004,0.00053274503,0.54944694],"genre_scores_gemma":[0.6725429,0.009665144,0.18139812,0.0026127163,0.0017408411,0.0003889663,0.0011212837,0.00059264083,0.1299374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986658,0.00044490595,0.000041266205,0.00025949872,0.0004035553,0.00018487229],"domain_scores_gemma":[0.99872595,0.0005266304,0.000082169085,0.00025062126,0.00031688838,0.00009771844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009569114,0.00084321626,0.0006726531,0.0020657247,0.0030440772,0.00245701,0.0010187334,0.0009329483,0.013209328],"category_scores_gemma":[0.002481435,0.00049161573,0.0011258459,0.0015628143,0.002965863,0.0037380366,0.0020106195,0.002920545,0.0033473216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035975918,0.000004120193,0.000029556104,0.000019494448,0.0000031842026,0.000015668531,0.00006218711,0.00034530342,0.00032676855,0.9945485,0.0011347313,0.0035068265],"study_design_scores_gemma":[0.0000036651475,0.000008125872,0.0000737525,0.000023043569,0.000005307056,0.000079645826,0.000060723876,0.0018231825,0.00050468143,0.9723975,0.02501009,0.000010386808],"about_ca_topic_score_codex":0.0011741415,"about_ca_topic_score_gemma":0.0014011892,"teacher_disagreement_score":0.013209328,"about_ca_system_score_codex":0.0014282458,"about_ca_system_score_gemma":0.0010073377,"threshold_uncertainty_score":0.044189572},"labels":[],"label_agreement":null},{"id":"W7116751422","doi":"10.1016/j.disc.2025.114953","title":"A new conjecture on the inertia of graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","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":"Simon Fraser University","funders":"","keywords":"Conjecture; Adjacency matrix; Lonely runner conjecture; Graph; Collatz conjecture; Line graph","score_opus":0.025653915212671467,"score_gpt":0.30642017992593595,"score_spread":0.2807662647132645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116751422","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43931898,0.0039826185,0.18827114,0.047640722,0.0051035113,0.00009951244,0.0015241166,0.0012758637,0.3127835],"genre_scores_gemma":[0.94294536,0.001388925,0.01590956,0.0039835377,0.0066439486,0.000105337895,0.00096340047,0.000386824,0.027673012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830925,0.00034075175,0.00007792417,0.0006226987,0.00033868718,0.00031064646],"domain_scores_gemma":[0.9896287,0.005891049,0.00089405273,0.0016379686,0.00073583494,0.0012125071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017467579,0.0008146418,0.0015764056,0.0029990317,0.0020874,0.0041506956,0.0019419241,0.0030596314,0.017257659],"category_scores_gemma":[0.009112053,0.0007878138,0.0015529556,0.0019518704,0.008766027,0.012048443,0.004079738,0.0051111635,0.0016300428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056950652,0.000022050168,0.000377201,0.000047240817,0.0000062416157,0.00006539115,0.00031538287,0.0005001424,0.00046151306,0.98853123,0.0058379904,0.0037786565],"study_design_scores_gemma":[0.000027764063,0.000017688875,0.00037769426,0.000017330669,0.000006834989,0.00007123865,0.00008666706,0.0019150556,0.00016595265,0.9927735,0.004528674,0.0000117578265],"about_ca_topic_score_codex":0.0010879044,"about_ca_topic_score_gemma":0.0006582826,"teacher_disagreement_score":0.017257659,"about_ca_system_score_codex":0.0014056339,"about_ca_system_score_gemma":0.0006160664,"threshold_uncertainty_score":0.05773264},"labels":[],"label_agreement":null},{"id":"W7117414515","doi":"10.61091/um125-05","title":"The Gutman-Milovanović index and some Hamiltonian properties of a graph","year":2025,"lang":"","type":"article","venue":"Utilitas Mathematica","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Graph; Hamiltonian (control theory); Graph property; Quartic graph; Topological index; Upper and lower bounds; Hamiltonian path; Hamiltonian path problem","score_opus":0.02484511190113544,"score_gpt":0.2751132101049362,"score_spread":0.2502680982038008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117414515","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6766422,0.0017382329,0.10338415,0.0025465982,0.00048385037,0.00010698209,0.0021048211,0.0003924012,0.21260078],"genre_scores_gemma":[0.9685676,0.0006590043,0.01258687,0.00034396478,0.00023046174,0.000104977495,0.00073109317,0.00011987285,0.016656123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975175,0.00004491525,0.000010998195,0.00004946081,0.00005922468,0.00008362435],"domain_scores_gemma":[0.9992387,0.00027341887,0.00016649695,0.000056162105,0.000100026824,0.00016509401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027462898,0.0003903232,0.00040066548,0.0024271114,0.0010722771,0.0012317349,0.00065454753,0.0004486125,0.0112958895],"category_scores_gemma":[0.001488785,0.00017608576,0.0003826051,0.001799518,0.0012602359,0.0017574966,0.000767905,0.0008386644,0.0009021819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030296642,0.000021386031,0.0005418758,0.000050894927,0.000008631635,0.00007920438,0.00013576953,0.0023913833,0.0014680492,0.9795074,0.0038836917,0.0118814055],"study_design_scores_gemma":[0.000016951775,0.000026868262,0.001118957,0.000022900429,0.000010338681,0.0001036129,0.00011348179,0.010787368,0.00066209916,0.9794133,0.0077059036,0.000018333818],"about_ca_topic_score_codex":0.0017978417,"about_ca_topic_score_gemma":0.0022550581,"teacher_disagreement_score":0.0112958895,"about_ca_system_score_codex":0.0010583941,"about_ca_system_score_gemma":0.00045759804,"threshold_uncertainty_score":0.03778851},"labels":[],"label_agreement":null},{"id":"W7117415493","doi":"10.61091/um125-08","title":"Graph identification index","year":2025,"lang":"","type":"article","venue":"Utilitas Mathematica","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vertex (graph theory); Multipartite; Graph; Upper and lower bounds; Simple graph; String (physics)","score_opus":0.022351429636656997,"score_gpt":0.3182714606993722,"score_spread":0.2959200310627152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117415493","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047915727,0.0020264294,0.2884344,0.0028613042,0.004844149,0.0006899706,0.081123695,0.035621725,0.57960683],"genre_scores_gemma":[0.0741337,0.004071524,0.24322057,0.0031363496,0.0020623868,0.0013675411,0.19420582,0.028891671,0.44891044],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988733,0.00011181942,0.000076544056,0.00036838505,0.00043843914,0.00013142644],"domain_scores_gemma":[0.99819356,0.0002787203,0.00009340137,0.0005385684,0.0006991388,0.00019669103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005776676,0.0015841555,0.0009714794,0.0037859362,0.0018117505,0.0037637365,0.0018300549,0.0011012711,0.22229324],"category_scores_gemma":[0.00383258,0.0007046124,0.0009630421,0.005158544,0.00073872384,0.0058560977,0.0029747228,0.0023991559,0.14374761],"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.00006994547,0.00007632743,0.00035781707,0.0004206168,0.000016847856,0.00012886466,0.0001392246,0.0017483708,0.0023598268,0.19999245,0.627245,0.16744477],"study_design_scores_gemma":[0.0000126428995,0.000021807984,0.00026521768,0.00006756749,0.000010767808,0.00023731327,0.00006525642,0.0030763003,0.0018209467,0.10732598,0.8870703,0.000025877624],"about_ca_topic_score_codex":0.0027803301,"about_ca_topic_score_gemma":0.0034946166,"teacher_disagreement_score":0.22229324,"about_ca_system_score_codex":0.0019940217,"about_ca_system_score_gemma":0.0016134115,"threshold_uncertainty_score":0.74364495},"labels":[],"label_agreement":null},{"id":"W7117417567","doi":"10.61091/um125-09","title":"Spectral radius and the 2-power of Hamilton paths","year":2025,"lang":"","type":"article","venue":"Utilitas Mathematica","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Shanghai University of Electric Power; Science and Technology Commission of Shanghai Municipality; National Natural Science Foundation of China","keywords":"Spectral radius; Graph; Hamiltonian path; RADIUS; Spectral properties","score_opus":0.01389608018051692,"score_gpt":0.2770265766330506,"score_spread":0.26313049645253367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117417567","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77355176,0.0009409015,0.18342066,0.0005944917,0.00009494778,0.00006277647,0.00036827245,0.0002423102,0.04072376],"genre_scores_gemma":[0.9766332,0.000318011,0.020060241,0.00006491313,0.00007163171,0.000057573834,0.00013873103,0.000057192625,0.0025985406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953246,0.0001475581,0.000019911437,0.00011282609,0.00008932226,0.000097898504],"domain_scores_gemma":[0.99720407,0.0014908463,0.000492841,0.00017242203,0.00030787656,0.00033194164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042997568,0.0005378172,0.0004660064,0.0020140603,0.0005976324,0.00084847363,0.0007391537,0.00061613886,0.004811823],"category_scores_gemma":[0.004301552,0.00023663728,0.00033566647,0.00077797286,0.0015650808,0.0016496008,0.0009042137,0.00060947164,0.0007571854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002576035,0.0000684105,0.0024850606,0.00024845984,0.00004298296,0.00041689113,0.0004994213,0.04330841,0.027379723,0.8972776,0.0028862404,0.025129179],"study_design_scores_gemma":[0.000034673758,0.000097438045,0.0018729795,0.000054858636,0.000026483945,0.0004701816,0.0002918263,0.12218,0.007907981,0.86283535,0.0041828547,0.000045338493],"about_ca_topic_score_codex":0.00040994596,"about_ca_topic_score_gemma":0.00034106133,"teacher_disagreement_score":0.004811823,"about_ca_system_score_codex":0.00044495153,"about_ca_system_score_gemma":0.00022825236,"threshold_uncertainty_score":0.016097128},"labels":[],"label_agreement":null},{"id":"W7117419254","doi":"10.61091/ars165-01","title":"Signless Laplacian spectral determinations of the starlike trees &lt;span class=\"math inline\"&gt;\\(ST(n, d_1)\\)&lt;/span&gt; and the double starlike trees &lt;span class=\"math inline\"&gt;\\(H_n(p, p)\\)&lt;/span&gt;","year":2025,"lang":"","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vertex (graph theory); Graph; Degree (music); Tree (set theory); Path graph; Path (computing); Simple graph","score_opus":0.014179583689053027,"score_gpt":0.25874359812753456,"score_spread":0.24456401443848153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117419254","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5900009,0.00022230519,0.19367263,0.00092396536,0.00033381445,0.00006527108,0.0010657134,0.00065607525,0.21305932],"genre_scores_gemma":[0.94041824,0.00016885315,0.030084154,0.00020290978,0.0001305163,0.000041657393,0.00070379634,0.00027718957,0.02797273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997886,0.00002663331,0.000008494416,0.00006528551,0.00007331488,0.000037777256],"domain_scores_gemma":[0.99956197,0.00008106966,0.00006290776,0.00006028149,0.00012803232,0.00010582243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017874481,0.00034238893,0.00019744069,0.0013958957,0.00072075013,0.0010172616,0.00043885835,0.00043786984,0.009655614],"category_scores_gemma":[0.0010804455,0.0001740904,0.00027071522,0.00064852095,0.0010820518,0.0012104212,0.00054760557,0.0006550271,0.0014960114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007309581,0.00006568408,0.0010244183,0.000057584002,0.0000068035038,0.00020773394,0.0004710924,0.0034609581,0.027276611,0.9228448,0.008239463,0.036271688],"study_design_scores_gemma":[0.00001651062,0.000050929622,0.0033349632,0.000026693015,0.000012092578,0.0005109435,0.0004838609,0.051334217,0.01653808,0.909713,0.017917024,0.000061696825],"about_ca_topic_score_codex":0.00071492034,"about_ca_topic_score_gemma":0.0012545431,"teacher_disagreement_score":0.009655614,"about_ca_system_score_codex":0.0005355069,"about_ca_system_score_gemma":0.00033868145,"threshold_uncertainty_score":0.032301307},"labels":[],"label_agreement":null},{"id":"W7117419413","doi":"10.61091/ars165-04","title":"Combinatorial identities using the matrix tree theorem","year":2025,"lang":"","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Indian Institute of Science Education and Research Mohali; Indian Institute of Science","keywords":"Spanning tree; Bipartite graph; Minimum spanning tree; Complete bipartite graph; Trémaux tree; Graph; Tree (set theory); Combinatorial proof; Minimum degree spanning tree","score_opus":0.021477414684064017,"score_gpt":0.3131722221738988,"score_spread":0.2916948074898348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117419413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094663344,0.0018220303,0.73132354,0.0049888575,0.00075890747,0.00010411692,0.0010264111,0.00072303734,0.16458976],"genre_scores_gemma":[0.86951244,0.0018987812,0.09283656,0.0021352223,0.0021935436,0.00036869454,0.001164297,0.0006430435,0.029247455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983877,0.0003825101,0.000065372646,0.00044806648,0.0005274096,0.00018909204],"domain_scores_gemma":[0.9971662,0.0013729804,0.00034474992,0.0004402479,0.00042495443,0.00025085467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013611115,0.00059978705,0.00096591644,0.0022725305,0.0015455311,0.0035926516,0.0017512937,0.0012605734,0.01652132],"category_scores_gemma":[0.006536862,0.00048386524,0.0011713828,0.0028267133,0.0026736038,0.0061835293,0.0019787524,0.0024714072,0.0018548259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008132091,0.0000069928597,0.00012661473,0.00002263544,0.0000041002013,0.00004639869,0.0000529426,0.0010768021,0.00037075684,0.9912039,0.0020565079,0.0050242012],"study_design_scores_gemma":[0.000009301231,0.000010282906,0.0003028366,0.000010578052,0.000004880871,0.00014896199,0.000027095803,0.015930131,0.00031249376,0.97606933,0.007161586,0.000012574848],"about_ca_topic_score_codex":0.0011843002,"about_ca_topic_score_gemma":0.00081378955,"teacher_disagreement_score":0.01652132,"about_ca_system_score_codex":0.0016116258,"about_ca_system_score_gemma":0.0007482529,"threshold_uncertainty_score":0.05526924},"labels":[],"label_agreement":null},{"id":"W7124946790","doi":"10.1007/978-981-95-1869-2_6","title":"Hypercubes and Skeletons","year":2025,"lang":"en","type":"book-chapter","venue":"Sureys and tutorials in the applied mathematical sciences","topic":"Graph theory and applications","field":"Mathematics","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 Calgary","funders":"","keywords":"Hypercube; Dimension (graph theory); Notation; Base (topology); Embedding; Binary number","score_opus":0.052956497375928155,"score_gpt":0.3149971097525266,"score_spread":0.2620406123765984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124946790","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.010986069,0.04812007,0.14038621,0.0019124264,0.0031372781,0.00009413032,0.00042006365,0.0007128508,0.7942308],"genre_scores_gemma":[0.16103604,0.061708238,0.12341624,0.0018084656,0.004308369,0.000462703,0.0015277683,0.0013687777,0.64436334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997421,0.000066690845,0.0000123046775,0.00007027867,0.00008341112,0.000025213825],"domain_scores_gemma":[0.9998055,0.00007074593,0.000020305342,0.000032473356,0.000040353814,0.000030598374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026153144,0.0011167487,0.0007831604,0.0018169795,0.0010795647,0.00420543,0.0008494848,0.0009631917,0.025534192],"category_scores_gemma":[0.0010321145,0.00065093715,0.0005220581,0.0024723196,0.0024723974,0.0044503147,0.0018113418,0.0027288897,0.00765554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007453213,0.000008002828,0.00002797751,0.00007720957,0.0000035838882,0.00002736608,0.00017668003,0.00086121133,0.0003995266,0.9527285,0.014931012,0.030751433],"study_design_scores_gemma":[0.0000035999803,0.000009621835,0.0000955587,0.00006841312,0.0000039578904,0.00009754571,0.00011613994,0.0011615888,0.00022432764,0.8197709,0.1784402,0.00000830502],"about_ca_topic_score_codex":0.0008880605,"about_ca_topic_score_gemma":0.0011771304,"teacher_disagreement_score":0.025534192,"about_ca_system_score_codex":0.00089492125,"about_ca_system_score_gemma":0.00047504852,"threshold_uncertainty_score":0.08542037},"labels":[],"label_agreement":null},{"id":"W7128185748","doi":"10.55016/ojs/cdm.v8i2.62187","title":"The exact maximal energy of integral circulant graphs with prime power order","year":2014,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Circulant matrix; Circulant graph; Vertex (graph theory); Eigenvalues and eigenvectors; Adjacency list; Prime power; Graph energy; Prime (order theory)","score_opus":0.00858835654803806,"score_gpt":0.2641424108237592,"score_spread":0.25555405427572114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128185748","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90561306,0.00069995254,0.0747537,0.00030482086,0.000035187717,0.000011672526,0.00017458976,0.00010844454,0.018298464],"genre_scores_gemma":[0.98980254,0.00027002348,0.007871733,0.0000389916,0.000044393106,0.000013542981,0.00012298134,0.000045037184,0.00179085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998554,0.000029949491,0.00000496545,0.000033103264,0.000035925957,0.000040613195],"domain_scores_gemma":[0.9992773,0.00044398787,0.00008682855,0.000068797504,0.00005543106,0.0000677048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024373383,0.0003891217,0.00039374764,0.0013521146,0.00047701393,0.0008558085,0.00046344593,0.00048080957,0.0020918886],"category_scores_gemma":[0.0023504961,0.00021377216,0.00021173066,0.0007719977,0.0013873602,0.0012606268,0.0005491224,0.0004426634,0.00018473295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013914035,0.000043980563,0.0035301177,0.00015689121,0.00003002883,0.00035998377,0.0003049068,0.09256969,0.0122527145,0.8576851,0.002465334,0.03046211],"study_design_scores_gemma":[0.000010243504,0.00003003598,0.0022580803,0.000026430827,0.000012359361,0.0002478297,0.00013848158,0.13825297,0.0040547517,0.85304004,0.0019096894,0.000019096364],"about_ca_topic_score_codex":0.00046636857,"about_ca_topic_score_gemma":0.00063275924,"teacher_disagreement_score":0.0020918886,"about_ca_system_score_codex":0.00050693034,"about_ca_system_score_gemma":0.00020933448,"threshold_uncertainty_score":0.006998062},"labels":[],"label_agreement":null},{"id":"W7128612048","doi":"10.1109/focs63196.2025.00049","title":"Factorization norms and an inverse theorem for MaxCut","year":2025,"lang":"","type":"article","venue":"","topic":"Graph theory and applications","field":"Mathematics","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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education; National Science Foundation","keywords":"Bounded function; Conjecture; Inverse; Graph; Boolean function; Operator (biology); Norm (philosophy)","score_opus":0.030216127728483564,"score_gpt":0.33024595524262085,"score_spread":0.30002982751413726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128612048","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.1873418,0.0007564242,0.7604658,0.001881276,0.0002977971,0.00009487028,0.0005449883,0.0009146638,0.04770232],"genre_scores_gemma":[0.8511471,0.00043037877,0.13622658,0.0009744596,0.00036408973,0.00017457707,0.0007435133,0.00039710998,0.009542276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986192,0.00021277597,0.000052359555,0.00035325484,0.00050729554,0.00025511868],"domain_scores_gemma":[0.9940964,0.0031265595,0.0006070663,0.00096881465,0.0007625697,0.0004385286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012301169,0.00088539685,0.0007169689,0.0009769083,0.0011934043,0.0019235379,0.001265093,0.0009070336,0.009855089],"category_scores_gemma":[0.009656462,0.0004567043,0.0010121834,0.00087316177,0.00257271,0.0055759684,0.0019942904,0.002894446,0.0015313821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023772416,0.0000788604,0.00127962,0.00012490035,0.000019062172,0.00021664338,0.00030531982,0.011908293,0.009997728,0.93826425,0.005929511,0.03163811],"study_design_scores_gemma":[0.000028489085,0.000114718205,0.00048768488,0.000029402903,0.000015092049,0.0004202794,0.00009680587,0.06334464,0.009057217,0.92010415,0.0062700063,0.000031420954],"about_ca_topic_score_codex":0.00081995083,"about_ca_topic_score_gemma":0.0009295882,"teacher_disagreement_score":0.009855089,"about_ca_system_score_codex":0.0010253945,"about_ca_system_score_gemma":0.0007109244,"threshold_uncertainty_score":0.03296858},"labels":[],"label_agreement":null},{"id":"W76135770","doi":"","title":"The Index of Tricyclic Hamiltonian Graphs with D(G)=3.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tricyclic; Mathematics; Hamiltonian (control theory); Index (typography); Combinatorics; Discrete mathematics; Chemistry; Stereochemistry; Mathematical optimization; Computer science","score_opus":0.014731859839388418,"score_gpt":0.26141076746257247,"score_spread":0.24667890762318406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W76135770","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8420742,0.0011407847,0.015123424,0.00076028635,0.00026311114,0.000039499217,0.0019118398,0.00027226534,0.13841446],"genre_scores_gemma":[0.9854124,0.00052337366,0.0043871384,0.00015185414,0.00008830424,0.000032272124,0.0007486958,0.00008241472,0.008573514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976057,0.00004457164,0.000014797308,0.000040514187,0.00005785479,0.000081811406],"domain_scores_gemma":[0.99845266,0.00044296662,0.0004516973,0.00013534866,0.0001837332,0.00033354384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026384008,0.0002723763,0.0003730132,0.0021110715,0.00080792,0.0017679537,0.000709709,0.0006546551,0.0067604566],"category_scores_gemma":[0.0018295951,0.00018913113,0.00021455424,0.0013222699,0.00089469965,0.0013209651,0.0008944703,0.0005728072,0.0010673775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083301956,0.000114409566,0.0069528576,0.0003145281,0.000054950608,0.0007007319,0.0010235503,0.005583606,0.021631882,0.8888865,0.023332668,0.050571203],"study_design_scores_gemma":[0.000102844526,0.000120637145,0.011009385,0.00016013038,0.00008164679,0.0017125298,0.0009192301,0.032118604,0.012742047,0.9108273,0.03013663,0.00006902113],"about_ca_topic_score_codex":0.00090613693,"about_ca_topic_score_gemma":0.0011973224,"teacher_disagreement_score":0.0067604566,"about_ca_system_score_codex":0.000760542,"about_ca_system_score_gemma":0.0003720112,"threshold_uncertainty_score":0.02261597},"labels":[],"label_agreement":null},{"id":"W87985346","doi":"","title":"Some lower bounds on the spectral radius of graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; RADIUS; Combinatorics; Physics; Computer science; Eigenvalues and eigenvectors; Quantum mechanics","score_opus":0.022064633671120406,"score_gpt":0.2778792810301615,"score_spread":0.25581464735904114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W87985346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093122795,0.07102991,0.4485173,0.018363785,0.0031593714,0.00016228818,0.0034142304,0.0024383238,0.359792],"genre_scores_gemma":[0.75474066,0.03680942,0.14122401,0.006112603,0.008049321,0.00086633035,0.0037820956,0.0028016418,0.045613866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99628687,0.0011324674,0.00018488467,0.00074450456,0.0011083098,0.0005429489],"domain_scores_gemma":[0.9695686,0.023144735,0.0012754117,0.0024863156,0.0017329081,0.001791904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003906595,0.0029738264,0.0026706466,0.007344359,0.002731541,0.0053861383,0.0044625187,0.003469607,0.020144256],"category_scores_gemma":[0.03205678,0.0014237658,0.0020135178,0.004995158,0.004344046,0.009849973,0.0048151603,0.009028356,0.0074265837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002784428,0.00011193013,0.00093650224,0.00071600004,0.00012295581,0.00021204559,0.0004625031,0.010401265,0.004398089,0.8997169,0.03922125,0.043421987],"study_design_scores_gemma":[0.000023175555,0.000046654877,0.0010536369,0.00018509591,0.000094902854,0.00043147328,0.00016707419,0.02422979,0.0026326822,0.9526923,0.018395474,0.00004767994],"about_ca_topic_score_codex":0.0010921978,"about_ca_topic_score_gemma":0.0014069224,"teacher_disagreement_score":0.020144256,"about_ca_system_score_codex":0.0029678477,"about_ca_system_score_gemma":0.0006331731,"threshold_uncertainty_score":0.06738925},"labels":[],"label_agreement":null},{"id":"W92339428","doi":"","title":"PI and Szeged Indices of some Benzenoid Graphs Related to Nanostructures.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Statistics","score_opus":0.011424523319233175,"score_gpt":0.27565088236143764,"score_spread":0.2642263590422045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W92339428","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7393948,0.0010769662,0.03959313,0.0014664629,0.00056795496,0.000102535705,0.00090740336,0.0003896975,0.2165011],"genre_scores_gemma":[0.96375936,0.0005653485,0.012152754,0.00035900832,0.00019852546,0.0001454646,0.00047443362,0.000114432536,0.022230601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997694,0.00004153778,0.00001173208,0.000044128188,0.00007763536,0.00005564373],"domain_scores_gemma":[0.9995598,0.000100539524,0.00011576576,0.000052661184,0.000076849385,0.00009422853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025260402,0.00046539266,0.00044956285,0.0029269697,0.001675916,0.0018423139,0.0006756062,0.0010493491,0.010317075],"category_scores_gemma":[0.00094991416,0.00027844904,0.0003670284,0.0010201383,0.0013089217,0.0020598157,0.00091417594,0.0012193327,0.0013235069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004038684,0.000019781655,0.00029034933,0.000035142544,0.000005961401,0.00010365637,0.00012221093,0.0006852699,0.002297306,0.9900456,0.0018053346,0.004548889],"study_design_scores_gemma":[0.00002061748,0.000024360375,0.0010305276,0.000018898221,0.000009809281,0.00026353754,0.00015597697,0.007262567,0.0016343931,0.9838397,0.005719486,0.00002006285],"about_ca_topic_score_codex":0.00060891366,"about_ca_topic_score_gemma":0.000778403,"teacher_disagreement_score":0.010317075,"about_ca_system_score_codex":0.0009225084,"about_ca_system_score_gemma":0.00046540287,"threshold_uncertainty_score":0.03451407},"labels":[],"label_agreement":null},{"id":"W94353364","doi":"","title":"On computing the dissociation number and the induced matching number of bipartite graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Matching (statistics); Combinatorics; 3-dimensional matching; Graph; Statistics","score_opus":0.017702087213756906,"score_gpt":0.29802106200989636,"score_spread":0.28031897479613943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W94353364","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49823493,0.0025971134,0.42218184,0.0034554962,0.000559016,0.00027118297,0.0033958785,0.003722007,0.06558254],"genre_scores_gemma":[0.7958079,0.0008943502,0.18358406,0.0005127357,0.00039418731,0.00028524638,0.004880321,0.00067707617,0.012964143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998251,0.00051980506,0.00009181087,0.00043757932,0.0003740368,0.00032572728],"domain_scores_gemma":[0.9888877,0.0072477357,0.0009886216,0.0016672398,0.0004478098,0.00076086004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019966397,0.001289157,0.0016587322,0.0031149476,0.00167908,0.0028924332,0.003776922,0.0018078388,0.0128352465],"category_scores_gemma":[0.020687494,0.00069274666,0.0009159585,0.0033195743,0.0028794978,0.010272795,0.0031867612,0.002684803,0.003064831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026000172,0.0009467722,0.018395059,0.0008531244,0.00025070764,0.0003622459,0.0005443039,0.17410617,0.008549937,0.48770562,0.04471805,0.2609679],"study_design_scores_gemma":[0.00011229763,0.00009606021,0.0024960432,0.000048107468,0.000043808403,0.00022256318,0.00014660656,0.2512085,0.004062571,0.7366248,0.0048988913,0.00003972397],"about_ca_topic_score_codex":0.00159107,"about_ca_topic_score_gemma":0.0034173492,"teacher_disagreement_score":0.0128352465,"about_ca_system_score_codex":0.001975165,"about_ca_system_score_gemma":0.0013164913,"threshold_uncertainty_score":0.042938113},"labels":[],"label_agreement":null},{"id":"W98729622","doi":"","title":"INTERMEDIATE AND LIMITING BEHAVIOR OF POWERS OF SOME CIRCULANT MATRICES","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Circulant matrix; Aperiodic graph; Combinatorics; Matrix (chemical analysis); Tensor product; Sequence (biology); Markov chain; Binary number; Discrete mathematics; Pure mathematics; Arithmetic","score_opus":0.02841793501223058,"score_gpt":0.2771187826397894,"score_spread":0.2487008476275588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W98729622","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7693852,0.00046012457,0.18517269,0.0006167746,0.00012427651,0.00006314687,0.00024445224,0.0005718274,0.0433615],"genre_scores_gemma":[0.9775318,0.00022317824,0.014270957,0.000086396285,0.00010691964,0.000061093306,0.00014140824,0.00012676089,0.0074513354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994149,0.00015458908,0.000028799232,0.0000999388,0.00014617396,0.00015552304],"domain_scores_gemma":[0.99523205,0.002238296,0.00068394537,0.00041308315,0.00059347844,0.000839195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010557731,0.0006165848,0.00049242075,0.0019037048,0.0011692435,0.0018074207,0.0010067386,0.0006426763,0.005671282],"category_scores_gemma":[0.009641854,0.00041166085,0.00048343994,0.0005622175,0.0023804507,0.0020841875,0.0008939336,0.0011805828,0.0007575412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010971662,0.00007125446,0.0018244785,0.0000691908,0.000015863743,0.00067809486,0.0004914961,0.011335064,0.009289997,0.96865416,0.0015630972,0.005897585],"study_design_scores_gemma":[0.000028291253,0.000102029095,0.0019070535,0.00006976104,0.000022179645,0.0006499285,0.00028290227,0.30985746,0.008742001,0.675099,0.0031797765,0.000059577495],"about_ca_topic_score_codex":0.0015440367,"about_ca_topic_score_gemma":0.0014629456,"teacher_disagreement_score":0.005671282,"about_ca_system_score_codex":0.0009585306,"about_ca_system_score_gemma":0.00069942215,"threshold_uncertainty_score":0.018972337},"labels":[],"label_agreement":null},{"id":"W99733679","doi":"","title":"Resonance of Plane Bipartite Graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Plane (geometry); Combinatorics; Geometry; Graph","score_opus":0.024013511285043643,"score_gpt":0.2903899174885468,"score_spread":0.26637640620350317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W99733679","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3896057,0.0021309054,0.24746276,0.0043676603,0.0007118517,0.000090601054,0.0008311127,0.0007494974,0.35404998],"genre_scores_gemma":[0.95391065,0.00058703154,0.014971452,0.0006367842,0.00024228843,0.00006990442,0.00042442195,0.00015102133,0.0290064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995435,0.00014403528,0.0000141752,0.00008644735,0.00009538791,0.00011638221],"domain_scores_gemma":[0.99895394,0.00051078456,0.00014584023,0.00013368306,0.00011246845,0.00014331502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030877962,0.00030400837,0.00039547659,0.0013378431,0.0010357038,0.0014049486,0.00059532817,0.001256262,0.012734381],"category_scores_gemma":[0.0023231392,0.00026145866,0.00038749294,0.00060912065,0.0011327923,0.0020207614,0.0011776519,0.0011589957,0.0021969706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048592217,0.00001640492,0.00021202845,0.00004831068,0.00000706376,0.00007710518,0.00017511768,0.001468646,0.0029053593,0.98259497,0.005807785,0.0066387043],"study_design_scores_gemma":[0.000017780098,0.000016831835,0.00031096506,0.000021879114,0.0000076060514,0.00024025895,0.0002255234,0.014203935,0.0011472154,0.97639966,0.0073965536,0.000011777114],"about_ca_topic_score_codex":0.00085775356,"about_ca_topic_score_gemma":0.0008553361,"teacher_disagreement_score":0.012734381,"about_ca_system_score_codex":0.00059782946,"about_ca_system_score_gemma":0.0002495721,"threshold_uncertainty_score":0.04260075},"labels":[],"label_agreement":null}]}