{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99696517,0.00006705835,0.000014864712,0.000025043852,0.00018341852,0.00020215174,0.0000017547184,0.00004469616,0.002495851],"genre_scores_gemma":[0.99964714,0.0000041031344,0.00021374426,0.000008395003,0.0000016428163,0.000011422596,0.0000012667839,0.000013909909,0.00009837708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991873,0.000034439072,0.00031341272,0.00013194203,0.00013831788,0.00019459374],"domain_scores_gemma":[0.99935716,0.00017663684,0.00009703826,0.0002748896,0.00004883918,0.000045435987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049318955,0.000104806175,0.00018450685,0.00014245613,0.00004639387,0.0000061882747,0.00017598711,0.00006909521,0.00002211099],"category_scores_gemma":[0.00012806772,0.00008755636,0.0000672276,0.0003714947,0.00009593651,0.000068642556,0.000032808675,0.00011366697,0.0000051528236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015504407,0.00026061156,0.02255195,0.000039222086,0.0000103336,0.000001327944,0.00087967695,1.7015175e-7,0.012744064,0.96332043,0.00008815853,0.00008851898],"study_design_scores_gemma":[0.00029123048,0.00002486611,0.010792334,0.000040359264,0.000008679125,8.122057e-7,0.00043953373,0.000002297652,0.09849396,0.8897202,0.00009532474,0.0000904033],"about_ca_topic_score_codex":0.00002721797,"about_ca_topic_score_gemma":0.00003139001,"teacher_disagreement_score":0.085749894,"about_ca_system_score_codex":0.00001649803,"about_ca_system_score_gemma":0.000014447055,"threshold_uncertainty_score":0.35704446},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003718812,0.0001712267,0.808218,0.00025754544,0.00021736474,0.0017095996,0.00014401515,0.00006179861,0.18550162],"genre_scores_gemma":[0.39637226,0.00009614748,0.60078895,0.00009070285,0.00014481347,0.00011562668,0.000020363183,0.00013076799,0.0022403381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730235,0.000034924036,0.0008153719,0.00061066524,0.000665299,0.0005714107],"domain_scores_gemma":[0.9963578,0.0019670404,0.00029936005,0.00094769767,0.00027203487,0.00015604823],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0042080022,0.0004130149,0.0006844946,0.00034983366,0.00059852476,0.00022425772,0.0011204568,0.00021708194,0.00007046669],"category_scores_gemma":[0.00017970473,0.00028658786,0.00020651858,0.0004219431,0.0078583425,0.00018213927,0.00067177764,0.0004567556,0.0000010655135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031887164,0.00007250073,0.000005433967,0.00053545187,0.000033924927,0.000002721953,0.00086692267,0.0000034797915,0.00005862246,0.9976872,0.000008634521,0.0006931936],"study_design_scores_gemma":[0.00023079118,0.00014016936,0.000005416749,0.0004565449,0.00008316771,0.000054113636,0.00011595002,0.0073921583,0.00041905424,0.99058604,0.00019086932,0.0003257302],"about_ca_topic_score_codex":0.0000015454984,"about_ca_topic_score_gemma":0.0000027417411,"teacher_disagreement_score":0.39265347,"about_ca_system_score_codex":0.000031891534,"about_ca_system_score_gemma":0.00009485373,"threshold_uncertainty_score":0.99995863},"labels":[],"label_agreement":null},{"id":"W105752137","doi":"","title":"Second Order Randic Index of Benzenoid Systems.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Order (exchange); Topological index; Combinatorics; Computer science; Business; World Wide Web","score_opus":0.016136095966339675,"score_gpt":0.2634067333482611,"score_spread":0.24727063738192143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W105752137","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99005765,0.000122002304,0.00026550598,0.000056116507,0.00040707106,0.00030977812,0.000010820594,0.000063778665,0.008707278],"genre_scores_gemma":[0.9993518,0.0000043064147,0.00024701707,0.00001969652,0.000005340858,0.00004423547,0.0000037238876,0.000019387837,0.00030450063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924433,0.000039051065,0.00028061602,0.00014120842,0.00014489889,0.00014992076],"domain_scores_gemma":[0.99916786,0.0001433165,0.000143413,0.00038388663,0.0001060924,0.000055448392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002632685,0.00010653735,0.0002255801,0.00006820613,0.00008270346,0.0000141092205,0.00019061226,0.000082611296,0.00011714029],"category_scores_gemma":[0.00007182527,0.00010000235,0.000058106973,0.00030399775,0.00006133491,0.000061494444,0.000033131517,0.00011313712,0.00003958391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000102948125,0.00019211014,0.00026654205,0.00010073098,0.000034961773,0.0000011938338,0.0002727848,0.000016386713,0.0006719081,0.99788994,0.0005195234,0.00002361464],"study_design_scores_gemma":[0.0015295781,0.000038686445,0.00031523505,0.000043465872,0.000024510262,0.0000057402117,0.00012332287,0.000009602169,0.0032270432,0.9935999,0.0009775877,0.00010535735],"about_ca_topic_score_codex":0.000014085825,"about_ca_topic_score_gemma":0.000005261245,"teacher_disagreement_score":0.009294143,"about_ca_system_score_codex":0.000024617857,"about_ca_system_score_gemma":0.000044183977,"threshold_uncertainty_score":0.40779772},"labels":[],"label_agreement":null},{"id":"W117706154","doi":"","title":"PI Index of Armchair Polyhex Nanotubes.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Pure mathematics; Computer science; World Wide Web","score_opus":0.01437029627748487,"score_gpt":0.26014009830978607,"score_spread":0.2457698020323012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W117706154","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98235327,0.000059202765,0.00011570983,0.00013264744,0.00025912377,0.00017357724,0.000008212503,0.00009080373,0.016807467],"genre_scores_gemma":[0.99872434,0.0000025513639,0.00038062208,0.000024895844,0.000009197819,0.000028231294,0.000005272938,0.000019225348,0.00080565957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992142,0.00003784442,0.00027471446,0.0001471607,0.00015712503,0.00016896769],"domain_scores_gemma":[0.9991706,0.00019977665,0.00012354564,0.0004019858,0.00006684332,0.00003723653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019765907,0.000109755085,0.00018522228,0.00006926704,0.00007856883,0.000009340824,0.00020693785,0.00007715334,0.000068927075],"category_scores_gemma":[0.00004541977,0.00010659227,0.00008590676,0.0002740474,0.000088838584,0.000052993684,0.00004230217,0.00009686703,0.000030046744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065172576,0.00030288807,0.0029806031,0.000023882649,0.000013398887,9.785263e-7,0.000063029074,0.000001428583,0.0027106446,0.9893924,0.004364473,0.0001397305],"study_design_scores_gemma":[0.00043695702,0.000025489317,0.0029140003,0.000016490609,0.000017434542,0.0000023743576,0.00003893352,0.00002207405,0.018319657,0.97642374,0.001673924,0.000108949695],"about_ca_topic_score_codex":0.000054277178,"about_ca_topic_score_gemma":0.000006816008,"teacher_disagreement_score":0.016371088,"about_ca_system_score_codex":0.000015227464,"about_ca_system_score_gemma":0.000021535532,"threshold_uncertainty_score":0.43467066},"labels":[],"label_agreement":null},{"id":"W119157955","doi":"","title":"The bounds of spectral radius of graphs with a given size of independent set.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; RADIUS; Set (abstract data type); Combinatorics; Physics; Computer science; Quantum mechanics; Eigenvalues and eigenvectors","score_opus":0.019379539123824067,"score_gpt":0.25622385202278847,"score_spread":0.2368443128989644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W119157955","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99722874,0.00006824163,0.000011414328,0.00007039374,0.000084257445,0.00022738094,0.000011778278,0.000015458576,0.0022823547],"genre_scores_gemma":[0.9993086,0.000035083445,0.00046473977,0.000003950273,0.0000018216178,0.00001897621,0.0000010113037,0.000012800437,0.00015300208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991236,0.000062941814,0.00031644848,0.000108218104,0.00025084268,0.0001379691],"domain_scores_gemma":[0.99839914,0.00069195847,0.00030165154,0.0004530618,0.00011733175,0.000036882924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002840989,0.000097732394,0.0002430529,0.00003861998,0.000117678734,0.0000035408434,0.00028071512,0.00004748062,0.00001704412],"category_scores_gemma":[0.00009162398,0.00006720186,0.00009876494,0.00030950655,0.00041856288,0.00003716186,0.000032668213,0.000109148976,0.0000011043812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000687217,0.0002533335,0.005032563,0.000039847266,0.000093798706,0.0000018781795,0.0011474012,0.0000010846986,0.0020792393,0.9908631,0.0003958407,0.000023195524],"study_design_scores_gemma":[0.0007479711,0.00020125287,0.008791367,0.000027590659,0.000043240478,0.000015490199,0.00027133265,0.0000040016794,0.029932832,0.95977944,0.00011625878,0.00006921612],"about_ca_topic_score_codex":0.000024516268,"about_ca_topic_score_gemma":0.00000980462,"teacher_disagreement_score":0.031083649,"about_ca_system_score_codex":0.000010293812,"about_ca_system_score_gemma":0.000056320514,"threshold_uncertainty_score":0.2740412},"labels":[],"label_agreement":null},{"id":"W123155392","doi":"","title":"Hyper Wiener index of zigzag polyhex nanotorus.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Zigzag; Mathematics; Index (typography); Wiener index; Combinatorics; Geometry; Computer science; World Wide Web","score_opus":0.020621807279015122,"score_gpt":0.288662217977348,"score_spread":0.26804041069833284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W123155392","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9779563,0.000046024645,0.0002285199,0.00006708102,0.00040167652,0.00018178037,0.0000040267414,0.00006939166,0.021045174],"genre_scores_gemma":[0.99849457,0.0000034243387,0.00072486047,0.000064783366,0.000009551246,0.000013314255,0.0000023088562,0.000022331575,0.0006648458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999088,0.000029725632,0.00030339893,0.00015901208,0.0001919634,0.00022792429],"domain_scores_gemma":[0.99894214,0.00031270526,0.00013212192,0.00044988486,0.00008665865,0.00007647688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055677333,0.000115929084,0.00018788496,0.00009063424,0.000083974184,0.00000787245,0.00023067062,0.00010043061,0.000093827104],"category_scores_gemma":[0.00010762711,0.00010827756,0.00008650506,0.0003135651,0.00010064697,0.00006974173,0.000051571707,0.00011848915,0.00003501727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016471673,0.00023768496,0.004826014,0.000017429531,0.000020910738,0.000001256186,0.00022900604,1.919118e-7,0.0055967667,0.9872299,0.0012036382,0.0006207674],"study_design_scores_gemma":[0.00043756285,0.000031345724,0.0037664496,0.00001587362,0.000019886327,0.0000031710001,0.000115437295,0.000004393057,0.029278455,0.9622156,0.00399264,0.00011917898],"about_ca_topic_score_codex":0.00001528632,"about_ca_topic_score_gemma":0.0000051312545,"teacher_disagreement_score":0.025014257,"about_ca_system_score_codex":0.000018771134,"about_ca_system_score_gemma":0.000021887385,"threshold_uncertainty_score":0.44154307},"labels":[],"label_agreement":null},{"id":"W127273840","doi":"","title":"The Lattice Polynomial of a Graph.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Lattice (music); Discrete mathematics; Physics","score_opus":0.017642012168922992,"score_gpt":0.2738716593323168,"score_spread":0.2562296471633938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W127273840","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97795194,0.00006732622,0.000002323927,0.00029093318,0.00016130216,0.0001401681,0.0000039465244,0.000040310137,0.02134174],"genre_scores_gemma":[0.99838585,0.00003154319,0.00023160732,0.000028580329,0.000005270839,0.000026050799,8.442988e-7,0.000010146285,0.001280099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999433,0.000057736866,0.0001837074,0.00009055336,0.00010292054,0.00013207401],"domain_scores_gemma":[0.99891233,0.00057784707,0.000060537637,0.000381787,0.00003302743,0.000034474837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028771005,0.000068462534,0.000100658894,0.000018582701,0.00019809803,0.0000137646875,0.0002424829,0.000038245562,0.00014316264],"category_scores_gemma":[0.00005737477,0.00004967967,0.000074160474,0.0002025273,0.00012057984,0.000035042478,0.000016263151,0.0000850101,0.00005204841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018687133,0.00009020084,0.000092539565,0.0000056181357,0.00001995195,2.842723e-7,0.00016054708,2.0497352e-7,0.00016708145,0.9924167,0.0050254026,0.002002826],"study_design_scores_gemma":[0.00027848213,0.000025138923,0.00038389684,0.0000068764207,0.000022484739,0.0000018679146,0.000050130926,0.000006904432,0.0015124313,0.9832868,0.014368851,0.000056154262],"about_ca_topic_score_codex":0.000008724517,"about_ca_topic_score_gemma":0.0000031632617,"teacher_disagreement_score":0.020433906,"about_ca_system_score_codex":0.0000053715107,"about_ca_system_score_gemma":0.00001350952,"threshold_uncertainty_score":0.20258781},"labels":[],"label_agreement":null},{"id":"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012060703,0.000068011956,0.0011004878,0.000052768934,0.000030759777,0.00015826203,0.00012197613,0.000051130795,0.9972105],"genre_scores_gemma":[0.0025248365,0.00014881617,0.002403242,0.000045482124,0.000039714854,0.0000012010997,0.00007932704,0.000025834664,0.99473155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957067,0.000006459638,0.00009217536,0.00017006109,0.00007918879,0.00008143299],"domain_scores_gemma":[0.9994597,0.00013203848,0.00010476622,0.00019851146,0.000051513583,0.00005346574],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006403877,0.00012709123,0.000127933,0.00009379766,0.0001377542,0.000014028383,0.000106263484,0.0001236835,0.0032335052],"category_scores_gemma":[0.0000059854424,0.00013476552,0.00004897221,0.000014263837,0.00009960493,0.000055025885,0.00007516608,0.000120539284,0.00016259626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071390336,0.000011540677,0.0000055044957,0.0000209004,0.000059763435,0.0000036976874,0.00037230738,1.9733785e-7,0.0000030674598,0.99645966,0.0027324092,0.0003238056],"study_design_scores_gemma":[0.00007276513,0.00000867393,0.0000132271125,0.000016280537,0.000056106674,0.0000024002031,0.000015038661,0.0000046549235,0.0000030726853,0.6087035,0.3910157,0.000088578905],"about_ca_topic_score_codex":0.000003983751,"about_ca_topic_score_gemma":0.0000094044735,"teacher_disagreement_score":0.3882833,"about_ca_system_score_codex":0.000025370002,"about_ca_system_score_gemma":0.000026936143,"threshold_uncertainty_score":0.9976777},"labels":[],"label_agreement":null},{"id":"W128873098","doi":"","title":"The spectral radius of tricyclic graphs with n vertices and k pendant edges.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tricyclic; Mathematics; Combinatorics; RADIUS; Spectral radius; Stereochemistry; Chemistry; Physics; Quantum mechanics; Computer science; Computer network","score_opus":0.024983247294206985,"score_gpt":0.25476140904407985,"score_spread":0.22977816174987287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W128873098","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99746263,0.00032022252,0.000009747558,0.00018036319,0.000098457735,0.00018674626,0.0000021594362,0.00003195171,0.0017077299],"genre_scores_gemma":[0.99928004,0.00019784755,0.00033263338,0.0000103851635,0.0000029103842,0.000023040713,6.7137603e-7,0.000011369419,0.00014112415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938214,0.000046724173,0.00016649129,0.00012323476,0.00012976928,0.00015165962],"domain_scores_gemma":[0.99901116,0.00050739077,0.0000998058,0.00029256052,0.00003760347,0.00005146596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017987985,0.000093425035,0.00014633796,0.00003670713,0.00031293798,0.000011925873,0.00016394691,0.00002926605,0.0000059243657],"category_scores_gemma":[0.00005728935,0.000058291265,0.000040651517,0.0002378016,0.00031799293,0.00005412496,0.000023651479,0.00009573594,0.000002892649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003285947,0.00010329411,0.0032440599,0.0000134790325,0.00003619559,0.000003422393,0.00042577312,1.0585336e-7,0.00038991874,0.9950087,0.00054803444,0.0001941788],"study_design_scores_gemma":[0.0006127637,0.000106110165,0.010180248,0.000011543597,0.00003857255,0.000038539878,0.0001308424,0.0000076496935,0.0054734745,0.98257905,0.0007389356,0.00008229555],"about_ca_topic_score_codex":0.000009393045,"about_ca_topic_score_gemma":0.000005370671,"teacher_disagreement_score":0.012429654,"about_ca_system_score_codex":0.0000063197367,"about_ca_system_score_gemma":0.000021150696,"threshold_uncertainty_score":0.24068975},"labels":[],"label_agreement":null},{"id":"W142077717","doi":"","title":"Edge Zeta Functions Of Graph Coverings.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Enhanced Data Rates for GSM Evolution; Combinatorics; Artificial intelligence; Computer science","score_opus":0.01659559937668688,"score_gpt":0.25193790865813276,"score_spread":0.2353423092814459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W142077717","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96593523,0.0000500144,0.00034330777,0.00006761778,0.00040692976,0.00016020138,0.000019265897,0.00009809644,0.032919362],"genre_scores_gemma":[0.9979388,0.000003093959,0.00049018074,0.000012518406,0.000007920788,0.00003296942,0.000011083256,0.0000148771105,0.0014885155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936503,0.000026927815,0.00023022796,0.00013152036,0.000112904025,0.00013335902],"domain_scores_gemma":[0.99926805,0.00016250154,0.000109470486,0.00035629811,0.00007161313,0.00003205424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015595082,0.00009222627,0.00015029365,0.00006731409,0.00010859965,0.000010320723,0.00014600334,0.000054535667,0.000095376585],"category_scores_gemma":[0.000040238854,0.000091582464,0.00009922939,0.00032790162,0.00008150654,0.00006043155,0.00003237947,0.00008442241,0.000043836593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004448952,0.0002576555,0.0010590642,0.000021767522,0.000016802178,4.3334182e-7,0.00003381089,0.0000024998717,0.0021115032,0.9805619,0.015875876,0.000054242602],"study_design_scores_gemma":[0.0003141786,0.000026581623,0.0019738476,0.000011569843,0.000036827758,0.000002165641,0.000035571808,0.000006219994,0.0049685375,0.9869771,0.0055555124,0.0000918613],"about_ca_topic_score_codex":0.000030854662,"about_ca_topic_score_gemma":0.000006117079,"teacher_disagreement_score":0.032003634,"about_ca_system_score_codex":0.0000106748885,"about_ca_system_score_gemma":0.000014002369,"threshold_uncertainty_score":0.37346244},"labels":[],"label_agreement":null},{"id":"W143170565","doi":"","title":"Semi-regular Bipartite Graphs and an Extension of the Marriage Lemma.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Combinatorics; Mathematics; Lemma (botany); Hypercube; Matching (statistics); Discrete mathematics; Complete bipartite graph; Extension (predicate logic); Graph; Computer science","score_opus":0.022611245792453355,"score_gpt":0.27694563450556736,"score_spread":0.254334388713114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W143170565","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99786717,0.000088311834,0.0000124813905,0.0000718809,0.00022818593,0.00022229803,0.00000419366,0.00003669154,0.0014687624],"genre_scores_gemma":[0.9993318,0.000012629613,0.00040497095,0.00003892421,0.0000015012328,0.000018262064,0.0000011895847,0.000014895445,0.00017585768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992147,0.00016925714,0.00018690438,0.00017079942,0.00012652078,0.00013178852],"domain_scores_gemma":[0.9990034,0.00014637447,0.00010443064,0.00062905316,0.000057482932,0.000059271486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046021456,0.000099795936,0.00014427702,0.00003623157,0.00016267692,0.000013318408,0.00015022,0.000060308248,0.000027466514],"category_scores_gemma":[0.0001537811,0.00007321944,0.000059503043,0.00025845962,0.0001357641,0.00007438195,0.000037555477,0.00009230487,0.0000030922613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036758092,0.00012466419,0.001751649,0.000018780082,0.000011630118,4.6560015e-7,0.00018313841,4.726188e-7,0.011807026,0.9854717,0.00055950845,0.00006726277],"study_design_scores_gemma":[0.0003188518,0.000030888594,0.0023351347,0.00002424107,0.00003526308,0.0000057991697,0.00009433093,0.00001619292,0.025162088,0.9707857,0.0011068546,0.00008467167],"about_ca_topic_score_codex":0.0000036957915,"about_ca_topic_score_gemma":0.0000030456968,"teacher_disagreement_score":0.014686043,"about_ca_system_score_codex":0.0000051716684,"about_ca_system_score_gemma":0.00001300171,"threshold_uncertainty_score":0.2985802},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012613418,0.00017456092,0.98287016,0.00026821898,0.00014830755,0.00035624916,0.000011723932,0.00005096575,0.003506366],"genre_scores_gemma":[0.8386043,0.000017240498,0.16075218,0.00011689558,0.00015496626,0.000011674922,0.0000067924084,0.000025852441,0.00031011616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986822,0.00001718864,0.00035253572,0.00045723913,0.00030704,0.00018382334],"domain_scores_gemma":[0.9986057,0.0005599994,0.00021200976,0.0004669577,0.00011273421,0.0000425533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039782978,0.0002254377,0.00031023077,0.00031352305,0.00012879031,0.0000710015,0.00037977012,0.00016739365,0.000019581665],"category_scores_gemma":[0.00005353353,0.00019782156,0.00005962966,0.00018227733,0.00063563767,0.00011408533,0.00013115612,0.00024001117,0.0000030771707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008491041,0.000047239137,0.00006947011,0.00013380365,0.000011059815,0.000003854678,0.00063238875,0.0013971344,0.0014795747,0.9022562,0.00011468546,0.09384613],"study_design_scores_gemma":[0.00015498852,0.000050142706,0.00007220846,0.00016983939,0.000016961458,0.0000109338,1.429817e-7,0.006558689,0.005572068,0.9869436,0.00024515257,0.00020527859],"about_ca_topic_score_codex":0.000017323107,"about_ca_topic_score_gemma":0.000048008962,"teacher_disagreement_score":0.82599086,"about_ca_system_score_codex":0.00002814804,"about_ca_system_score_gemma":0.00006965002,"threshold_uncertainty_score":0.8066929},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9959312,0.0014522518,0.0004326826,0.0015519196,0.00017942149,0.00020631295,0.0000028647055,0.00002154981,0.00022180537],"genre_scores_gemma":[0.999037,0.00078475464,0.000014796874,0.000035594487,0.000012418388,0.000008887816,4.5049373e-7,0.000021135133,0.00008490518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859214,0.00016913627,0.00046586295,0.00010782725,0.00027734693,0.00038771043],"domain_scores_gemma":[0.99607986,0.0024901438,0.00068781804,0.00039713326,0.0002704265,0.00007462622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002134932,0.00016049595,0.0002975638,0.00008657202,0.00041363534,0.000037132584,0.00057340704,0.000087353736,0.000009563561],"category_scores_gemma":[0.0006534941,0.00009317643,0.0001447033,0.00058863795,0.0004394268,0.000094210234,0.00005203777,0.001062181,7.694227e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041043328,0.00014631008,0.00023290546,0.0000119313945,0.00012659996,3.4028326e-7,0.0002458816,1.1911623e-7,0.021911005,0.9761478,0.0008171256,0.00031894],"study_design_scores_gemma":[0.0006456913,0.00023383825,0.00030545177,0.000010830272,0.00010663148,0.000117033866,0.00017050692,0.000013848933,0.013868326,0.9813197,0.0031054064,0.000102701095],"about_ca_topic_score_codex":0.000007075556,"about_ca_topic_score_gemma":0.000023388704,"teacher_disagreement_score":0.008042678,"about_ca_system_score_codex":0.000021799966,"about_ca_system_score_gemma":0.00012166171,"threshold_uncertainty_score":0.46147066},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25155997,0.000014479717,0.7007381,0.01098268,0.00015276205,0.0007524822,0.000016046619,0.0002692412,0.03551428],"genre_scores_gemma":[0.8865399,0.00000181952,0.11213681,0.0010409564,0.00014588228,0.00004873838,0.000001175743,0.000024959281,0.00005976294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769264,0.00010935049,0.00042001967,0.00048793873,0.000746383,0.00054367614],"domain_scores_gemma":[0.99579984,0.0024909507,0.00014679888,0.0012631537,0.00010038844,0.00019886543],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0020460428,0.0002855568,0.0002806753,0.00010609584,0.0008583069,0.00026806933,0.0015942758,0.000073956406,0.00068542716],"category_scores_gemma":[0.0005055934,0.00016174765,0.00015718472,0.000685703,0.0033887702,0.0001551659,0.00033783625,0.00036998265,0.00032865017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004484814,0.00014609472,0.0000010691233,0.000016236012,0.000010949779,0.0000011574787,0.0012525435,0.000027573686,0.00023885141,0.99644166,0.0008949771,0.00096442667],"study_design_scores_gemma":[0.00012610122,0.00007705506,0.000007425866,0.000057733756,0.000026697642,0.000023276814,0.00009762202,0.067248486,0.0026950177,0.9290662,0.0003556041,0.00021882565],"about_ca_topic_score_codex":3.2976737e-7,"about_ca_topic_score_gemma":7.547932e-7,"teacher_disagreement_score":0.63497996,"about_ca_system_score_codex":0.00003657453,"about_ca_system_score_gemma":0.00004245321,"threshold_uncertainty_score":0.9993234},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91804206,0.00013889272,0.0397343,0.00028451602,0.0001435197,0.001268986,0.000031232277,0.00023327795,0.040123187],"genre_scores_gemma":[0.99266636,0.00001441219,0.005203276,0.000118391115,0.00009058358,0.00027722985,0.000028792847,0.000060181548,0.0015407512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998422,0.000103983235,0.0003618387,0.0005294935,0.0002635461,0.0003190829],"domain_scores_gemma":[0.99845624,0.00022455455,0.00019739357,0.0008911658,0.00011084241,0.000119833654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043966915,0.00035408096,0.00044487938,0.00009798411,0.00006661406,0.000059340247,0.00030689113,0.0003108437,0.00024939392],"category_scores_gemma":[0.00004955493,0.0002551224,0.000090126414,0.00017754472,0.000051384293,0.000027003403,0.0003581102,0.0007245287,0.000024459168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011101477,0.0018439423,0.0029719882,0.00095164834,0.0004950333,0.00020131773,0.004829161,0.1026341,0.00028148046,0.86937183,0.008241217,0.0070681195],"study_design_scores_gemma":[0.0008699033,0.000121421064,0.00012431477,0.00055801123,0.000059121478,0.000024143741,0.0001241705,0.018882556,0.00030396218,0.977818,0.00052344543,0.00059092086],"about_ca_topic_score_codex":0.000070457274,"about_ca_topic_score_gemma":0.0022153654,"teacher_disagreement_score":0.10844619,"about_ca_system_score_codex":0.00013558648,"about_ca_system_score_gemma":0.00010614916,"threshold_uncertainty_score":0.9999901},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9396651,0.00004046886,0.00033552837,0.000031387535,0.00017282976,0.00018440117,0.0000029158696,0.00019576013,0.05937164],"genre_scores_gemma":[0.9906936,6.8949294e-7,0.0065638092,0.000046503857,0.000118990865,0.000040038267,0.000001036916,0.000019753967,0.0025155405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990944,0.00008489587,0.00028673324,0.00024137038,0.00011289598,0.00017968852],"domain_scores_gemma":[0.9988427,0.00017190189,0.00013517345,0.0007112151,0.00006027666,0.0000787403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036396759,0.00011587838,0.00015666659,0.000032019056,0.000419381,0.000047232043,0.00020881962,0.00008563658,0.000052345797],"category_scores_gemma":[0.00010141708,0.00010331318,0.00010436832,0.00009864505,0.0002753322,0.00011111083,0.000050601833,0.00012511802,0.00003475585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020394463,0.0011148974,0.01876836,0.00025364765,0.00010231494,0.000038044665,0.024005376,0.0000015508224,0.25043023,0.6981961,0.0058326293,0.0010528917],"study_design_scores_gemma":[0.00030473917,0.00006562602,0.072621204,0.00006581074,0.00011504843,0.00007501195,0.00077504956,0.000028878083,0.3099496,0.6118396,0.0037649618,0.0003944923],"about_ca_topic_score_codex":0.000088463836,"about_ca_topic_score_gemma":0.0000023910625,"teacher_disagreement_score":0.08635655,"about_ca_system_score_codex":0.000029341501,"about_ca_system_score_gemma":0.00004336807,"threshold_uncertainty_score":0.42129892},"labels":[],"label_agreement":null},{"id":"W1537722183","doi":"","title":"On Theorems Equivalent with Kotzig's Result on Graphs with Unique 1-Factors","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.023767092404476397,"score_gpt":0.2714564342471568,"score_spread":0.24768934184268043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537722183","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98369116,0.000005326259,0.00010681509,0.00031516622,0.00014193828,0.00052551646,0.000013867614,0.00021489056,0.014985339],"genre_scores_gemma":[0.99896914,0.0000057112256,0.00052915455,0.00013791681,0.000004185707,0.00008992672,0.000013613979,0.000056540128,0.00019380689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866134,0.000083613304,0.00021369511,0.0003661192,0.00035678383,0.00031843723],"domain_scores_gemma":[0.9983097,0.00050274277,0.00015064857,0.00081187504,0.000088046305,0.00013701609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028103494,0.00028783135,0.00024958604,0.00012623302,0.0002469159,0.000039545423,0.00030185998,0.00009732522,0.000029416542],"category_scores_gemma":[0.000075514086,0.00018681906,0.00007372153,0.00045654582,0.00019345277,0.00007566671,0.000026397078,0.00032012098,0.00004162996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002741695,0.00071880285,0.00023984473,0.000018370925,0.000065318556,0.00001168222,0.0005804143,0.00007899412,0.00011865321,0.99766773,0.00019806731,0.000027956634],"study_design_scores_gemma":[0.001853212,0.0012929927,0.00068452116,0.00019794964,0.000043254873,0.0000059257895,0.00021213206,0.0000012674582,0.011004862,0.9842515,0.00017649835,0.00027585728],"about_ca_topic_score_codex":0.000020146716,"about_ca_topic_score_gemma":0.000013322074,"teacher_disagreement_score":0.015278004,"about_ca_system_score_codex":0.000077232224,"about_ca_system_score_gemma":0.000056662902,"threshold_uncertainty_score":0.761826},"labels":[],"label_agreement":null},{"id":"W153866119","doi":"","title":"A New s3 Type Condition for Heavy Cycles in Weighted Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Combinatorics; Biology","score_opus":0.03459558252301843,"score_gpt":0.3022723663448287,"score_spread":0.26767678382181026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W153866119","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9974642,0.00006270082,0.00015700638,0.00030610146,0.0003656835,0.00043264285,0.000008579972,0.00009351172,0.0011095693],"genre_scores_gemma":[0.99526364,0.000025381216,0.004110335,0.00005863546,0.000007556298,0.00007713482,0.000027967184,0.00001937649,0.000409955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935603,0.00003310186,0.0001981558,0.00015952413,0.00008568988,0.00016751111],"domain_scores_gemma":[0.99933964,0.0002389249,0.000066257315,0.00023359474,0.000056934634,0.000064674874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012830072,0.00010038837,0.00015902103,0.00009569598,0.00013035824,0.000008628908,0.00012602347,0.000075377924,0.000053269516],"category_scores_gemma":[0.00006991221,0.000101242826,0.00006302218,0.00036185666,0.000043262124,0.00007636636,0.000015169934,0.00008627341,0.000032571927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003395838,0.00014417403,0.0008624749,0.0000146928505,0.000012412914,0.0000019877496,0.00029223223,1.846683e-7,0.0002958615,0.975086,0.023101836,0.00015422564],"study_design_scores_gemma":[0.0009660229,0.00006433079,0.0016994275,0.000019681733,0.000013795242,0.0000069142275,0.000038151637,0.000030404084,0.0026323595,0.99116623,0.0032456357,0.00011704197],"about_ca_topic_score_codex":0.000020659112,"about_ca_topic_score_gemma":0.000012471335,"teacher_disagreement_score":0.0198562,"about_ca_system_score_codex":0.000020155718,"about_ca_system_score_gemma":0.0000554432,"threshold_uncertainty_score":0.41285625},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98785937,0.001559611,0.0030781506,0.0030781073,0.00013994702,0.0001397483,4.3799548e-7,0.000031133404,0.0041135005],"genre_scores_gemma":[0.9992415,0.0002573701,0.0000529194,0.00017354744,0.000044219967,0.0000015010286,1.9888563e-7,0.000010843102,0.00021792318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888825,0.00006839046,0.00034275418,0.000066545785,0.00027475326,0.00035929107],"domain_scores_gemma":[0.998937,0.00022157756,0.00032318206,0.0003137494,0.00014669873,0.000057778976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012274192,0.00011109916,0.00019848505,0.00005836383,0.00023315824,0.000038646933,0.0005539714,0.000049605613,0.000015651063],"category_scores_gemma":[0.00008281355,0.000070935785,0.00017107907,0.00043428963,0.00006548051,0.00009196839,0.000014246186,0.0006445088,0.0000072414114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023277022,0.00017986193,0.000032538,0.000002458287,0.000038043672,0.000001929025,0.00017227951,0.000007448667,0.00022265714,0.99752533,0.0015264319,0.00026773757],"study_design_scores_gemma":[0.00038880843,0.0003925025,0.00011896598,0.000011452195,0.00007362638,0.00013169773,0.00005729979,0.000021890455,0.0008429455,0.9937681,0.004113662,0.00007907602],"about_ca_topic_score_codex":2.88711e-7,"about_ca_topic_score_gemma":4.916558e-7,"teacher_disagreement_score":0.011382113,"about_ca_system_score_codex":0.00006668478,"about_ca_system_score_gemma":0.00015168102,"threshold_uncertainty_score":0.28926772},"labels":[],"label_agreement":null},{"id":"W1567844118","doi":"","title":"Copnumber of graphs with strong isometric dimension two","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Isometric exercise; Mathematics; Dimension (graph theory); Pure mathematics; Medicine; Physical therapy","score_opus":0.023717553742848507,"score_gpt":0.2910267428076806,"score_spread":0.2673091890648321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567844118","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99136573,0.000046002468,0.00010775576,0.000042419742,0.00011997323,0.00020659881,0.000002951787,0.000060888844,0.008047651],"genre_scores_gemma":[0.9985033,0.000013639343,0.0011621283,0.000015137889,0.0000023367538,0.000023830704,0.00000382905,0.000019580966,0.0002561652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992241,0.000045243745,0.00020290322,0.00016063223,0.00019447469,0.00017261688],"domain_scores_gemma":[0.999016,0.00028579042,0.00013375025,0.00039971515,0.000103910774,0.000060830695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020593453,0.000113901726,0.00019447836,0.00016079133,0.000088780405,0.000008949419,0.0001475147,0.0000402703,0.000082358645],"category_scores_gemma":[0.00004556896,0.000093658695,0.00005706191,0.0011340379,0.00008096117,0.000076249395,0.000033299057,0.000103617545,0.000022681741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024673554,0.00029819235,0.015495801,0.000014612351,0.0000327209,0.0000029543214,0.000086515895,0.0000022547324,0.00053917395,0.9827557,0.00054078276,0.00020660933],"study_design_scores_gemma":[0.0009924752,0.00010211532,0.002036856,0.000029513889,0.000048289752,0.000011631952,0.00008662229,0.000020879017,0.0026913153,0.99350405,0.00036129795,0.000114967326],"about_ca_topic_score_codex":0.000017243727,"about_ca_topic_score_gemma":0.0000054904654,"teacher_disagreement_score":0.013458945,"about_ca_system_score_codex":0.0000130706285,"about_ca_system_score_gemma":0.000014534677,"threshold_uncertainty_score":0.38192907},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95940024,0.0000025495185,0.03103494,0.0011592174,0.00006897129,0.00069337746,0.00056109147,0.0000419305,0.0070376857],"genre_scores_gemma":[0.98929864,0.00000110899,0.010342101,0.000048437945,0.000017824184,0.00011447061,0.000013711863,0.00001667724,0.00014703993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988855,0.00005282986,0.00050237955,0.0001296225,0.00024128788,0.00018834922],"domain_scores_gemma":[0.99661607,0.0018759307,0.00027540966,0.00085986627,0.00029172451,0.00008102063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065544085,0.00014210505,0.0003085886,0.000070730726,0.00016052686,0.00001293612,0.00041444696,0.00007682035,0.00032165096],"category_scores_gemma":[0.0019408148,0.000093700924,0.00018278474,0.0004118208,0.00023499802,0.000029775229,0.00007749765,0.00021696767,0.00008316444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008631991,0.00032247437,0.00005053089,0.00004771885,0.00004679575,1.5637809e-7,0.00042083728,0.0000018594213,0.023510268,0.9744146,0.0011561718,0.000019978046],"study_design_scores_gemma":[0.00020655117,0.000021969674,0.00020109737,0.00007077347,0.00007079672,0.0000053607655,0.00016673584,0.00014132072,0.018632168,0.9800066,0.00037737534,0.000099285564],"about_ca_topic_score_codex":0.0000040793093,"about_ca_topic_score_gemma":0.000005374117,"teacher_disagreement_score":0.029898394,"about_ca_system_score_codex":0.000008836122,"about_ca_system_score_gemma":0.000019581084,"threshold_uncertainty_score":0.38210127},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027080634,0.0020548755,0.10439973,0.00030172532,0.0005999628,0.0043740813,0.00065745594,0.00096492417,0.88637644],"genre_scores_gemma":[0.00096140255,0.0006697711,0.004770766,0.0009310515,0.0045110737,0.0033006882,0.0010144959,0.00031032093,0.9835304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970407,0.0003378245,0.0008177265,0.00085341814,0.00041757556,0.000532742],"domain_scores_gemma":[0.9958037,0.0018387984,0.0005853296,0.001305474,0.00016126489,0.0003054475],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013568932,0.00067569636,0.000802562,0.00030698755,0.00081719144,0.00012989454,0.0004653833,0.00086452975,0.0004465838],"category_scores_gemma":[0.00010562936,0.0006736513,0.00036419363,0.000117276155,0.0005401438,0.00007154583,0.00021915673,0.000991694,0.00012233795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119151686,0.000077528195,0.000005264869,0.00008145956,0.00024415585,0.0000045615175,0.00007733747,0.0000040755212,0.000024753366,0.7951466,0.18907964,0.015135503],"study_design_scores_gemma":[0.00040937346,0.000019600606,0.000010320023,0.000119833654,0.0003739771,0.000036560577,0.000033350912,0.000039780978,0.000008516634,0.55142957,0.4471414,0.0003777227],"about_ca_topic_score_codex":0.0000048267448,"about_ca_topic_score_gemma":0.000027650145,"teacher_disagreement_score":0.25806174,"about_ca_system_score_codex":0.00016846877,"about_ca_system_score_gemma":0.00039101217,"threshold_uncertainty_score":0.99957144},"labels":[],"label_agreement":null},{"id":"W162420740","doi":"","title":"On the spectral radius of graphs with k-vertex cut.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Vertex (graph theory); RADIUS; Combinatorics; Graph; Physics; Quantum mechanics; Computer science; Eigenvalues and eigenvectors","score_opus":0.023932100537675093,"score_gpt":0.24676897304798728,"score_spread":0.2228368725103122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W162420740","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9865501,0.000013482277,0.000014101416,0.00026218762,0.00011068757,0.0002199243,0.0000036876697,0.0000459365,0.012779874],"genre_scores_gemma":[0.9994052,0.000009860773,0.0002115674,0.00006517388,0.0000019056824,0.000029032908,0.0000012518065,0.000015210218,0.00026080583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993641,0.000053275427,0.0001439072,0.0001251135,0.000172196,0.00014141532],"domain_scores_gemma":[0.9988,0.00056934904,0.000089334986,0.00046194275,0.000041239582,0.00003817426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014912803,0.00010369733,0.00014574225,0.000041177693,0.00017791375,0.000005031337,0.00023012586,0.00003504449,0.00007658802],"category_scores_gemma":[0.000060547656,0.0000639175,0.00006916899,0.00028732672,0.00019963148,0.00003171044,0.000015435575,0.00013518672,0.00002539297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026165268,0.00023052297,0.0005094932,0.0000067816577,0.000035023197,0.0000040330615,0.00035342498,6.9654953e-7,0.0002090514,0.9929166,0.0056923795,0.000015864647],"study_design_scores_gemma":[0.00040228275,0.00014089732,0.0012774897,0.00001943167,0.000020954003,0.000019113962,0.0000614645,0.000009163395,0.0077844965,0.9900236,0.00015737362,0.000083720304],"about_ca_topic_score_codex":0.0000062844847,"about_ca_topic_score_gemma":0.0000025804459,"teacher_disagreement_score":0.0128550725,"about_ca_system_score_codex":0.000009338758,"about_ca_system_score_gemma":0.000021367794,"threshold_uncertainty_score":0.260648},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9573473,0.002995455,0.036955208,0.000845983,0.00014206793,0.00017315327,9.4981283e-7,0.000035107136,0.0015048091],"genre_scores_gemma":[0.9920556,0.006093895,0.00012113127,0.000019299086,0.00015514181,0.0000065506,5.5312967e-7,0.00001324774,0.0015345637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985104,0.00008328249,0.00025688045,0.00007331934,0.00014023596,0.00093586737],"domain_scores_gemma":[0.99922305,0.00026418347,0.00019822526,0.00021414805,0.00006282877,0.000037532423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010882787,0.00008112933,0.000114328825,0.00002867489,0.00058852014,0.000011230458,0.0002885463,0.00004090182,0.0000124830985],"category_scores_gemma":[0.00006841989,0.00005267485,0.000121528916,0.00013786618,0.00011805239,0.000047220346,0.00001934893,0.00092273206,0.00000699566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020470074,0.00004229363,0.00022757785,0.0000012341203,0.00006206605,5.7032696e-7,0.000078411125,0.000030310466,0.0001535116,0.9972477,0.00048458896,0.0016512651],"study_design_scores_gemma":[0.00019584021,0.00007987454,0.00014794972,0.0000057370416,0.000023464609,0.00039647432,0.00027723264,0.00016919633,0.00016809015,0.9959438,0.0025362705,0.000056081277],"about_ca_topic_score_codex":0.0000029030607,"about_ca_topic_score_gemma":0.000052691583,"teacher_disagreement_score":0.036834076,"about_ca_system_score_codex":0.00008154298,"about_ca_system_score_gemma":0.00028847935,"threshold_uncertainty_score":0.45264807},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99402326,0.0011645936,0.0027014005,0.00034307747,0.000150255,0.00013706398,0.000024995312,0.000022190621,0.0014331392],"genre_scores_gemma":[0.9967138,0.00057390187,0.002347733,0.000026677359,0.000039325798,0.0000048462807,2.4991328e-7,0.000023461911,0.00026998867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843854,0.00028078226,0.0007024696,0.00013338572,0.00024325226,0.00020159695],"domain_scores_gemma":[0.99730194,0.0012586891,0.00075988093,0.00032481388,0.00020643622,0.00014821709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016713706,0.00016750325,0.00040186816,0.00046537662,0.00009333948,0.0000125043125,0.00030387618,0.0000928345,0.00011668802],"category_scores_gemma":[0.00030635475,0.00010182563,0.00036251624,0.00036773045,0.0004303483,0.00020050531,0.000037341993,0.0001542573,0.000002870929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014627399,0.00016236574,0.0019086555,0.000056540222,0.00014746214,0.000007047422,0.00025252247,8.329993e-8,0.022582794,0.96432877,0.0006491457,0.009758319],"study_design_scores_gemma":[0.0007972067,0.00016833519,0.0034206752,0.00022849589,0.00014274371,0.00013888477,0.0003795004,1.3602819e-7,0.01221446,0.98188937,0.0004902221,0.0001299969],"about_ca_topic_score_codex":6.727452e-7,"about_ca_topic_score_gemma":0.000002360425,"teacher_disagreement_score":0.017560553,"about_ca_system_score_codex":0.0000074241984,"about_ca_system_score_gemma":0.000029634035,"threshold_uncertainty_score":0.41523287},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9691943,0.00007779681,0.0036878847,0.000150479,0.000029735647,0.00028269461,0.000020406069,0.00007537866,0.026481321],"genre_scores_gemma":[0.94950044,0.000011460647,0.049988355,0.000013642956,0.000019588282,0.00002673227,0.0000031177187,0.000022080965,0.0004145878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991863,0.000023144044,0.00031415053,0.00013361304,0.00017960448,0.00016318471],"domain_scores_gemma":[0.99906766,0.00025309494,0.00016716355,0.0003295909,0.00005746239,0.00012502982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003845573,0.00012972276,0.00026902516,0.00006686342,0.000046077075,0.000019709003,0.00015269485,0.000052250693,0.000018717343],"category_scores_gemma":[0.00023442344,0.000107446656,0.00006926574,0.000182121,0.00017471307,0.000070279624,0.000054483793,0.000081898084,0.000008681006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071281956,0.00008964012,0.0002586436,0.00014297692,0.000028406477,0.0000010996887,0.0027267602,7.01714e-7,0.00053573283,0.99564487,0.0005018159,0.00006224854],"study_design_scores_gemma":[0.00031918377,0.00006019779,0.000103715516,0.000045032553,0.00006465959,0.000018691875,0.0017315304,0.00023758042,0.004206747,0.9926,0.00048676127,0.00012586186],"about_ca_topic_score_codex":0.000003397538,"about_ca_topic_score_gemma":0.0000030819115,"teacher_disagreement_score":0.04630047,"about_ca_system_score_codex":0.000009464095,"about_ca_system_score_gemma":0.000018041193,"threshold_uncertainty_score":0.43815476},"labels":[],"label_agreement":null},{"id":"W169044707","doi":"","title":"Laplacian Eigenvalues and the Excess of a Graph.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Graph; Laplace operator; Laplacian matrix; Combinatorics; Mathematical analysis; Physics","score_opus":0.03011903369141844,"score_gpt":0.2670818628958165,"score_spread":0.23696282920439804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W169044707","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.990853,0.00036197336,0.000015750547,0.00038339527,0.0001067974,0.00019991824,0.0000034765148,0.000033420416,0.008042244],"genre_scores_gemma":[0.999438,0.00008144636,0.00017808963,0.000039102157,0.0000028300237,0.000035233832,4.5199403e-7,0.000008375981,0.00021650085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994707,0.0000838243,0.00015746176,0.00009593145,0.000096715834,0.00009532831],"domain_scores_gemma":[0.99909717,0.0004662333,0.000084464315,0.0002884222,0.00003406712,0.000029640903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032178327,0.00007149336,0.0001488407,0.000032806925,0.00012198633,0.000012991289,0.00015737534,0.00003521471,0.000057288515],"category_scores_gemma":[0.00009160248,0.000048467104,0.000054096527,0.0001797337,0.00027437924,0.00004015099,0.000034648583,0.00007231688,0.0000088568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007933692,0.00007995047,0.00033196376,0.000019686118,0.000022493929,3.0821832e-7,0.0010609719,7.740532e-8,0.000067673216,0.99698734,0.0011293931,0.00029220726],"study_design_scores_gemma":[0.0008021207,0.00001649016,0.0002649945,0.000012291537,0.00003350277,0.0000027873589,0.00016095077,0.000050912986,0.0009235943,0.9972598,0.00041592226,0.0000566111],"about_ca_topic_score_codex":0.000006432955,"about_ca_topic_score_gemma":0.0000020745033,"teacher_disagreement_score":0.008584945,"about_ca_system_score_codex":0.0000025826505,"about_ca_system_score_gemma":0.000002195048,"threshold_uncertainty_score":0.19764312},"labels":[],"label_agreement":null},{"id":"W172056098","doi":"","title":"Average degrees of critical graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.028509372284495956,"score_gpt":0.30911033749573535,"score_spread":0.2806009652112394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W172056098","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.990107,0.00006802774,0.00014723283,0.00046038767,0.0001764359,0.00011273237,0.0000073675888,0.00007478167,0.0088460455],"genre_scores_gemma":[0.99530715,0.000005329711,0.0044693523,0.000034402135,0.0000057421157,0.000020584177,0.0000015937007,0.000012931484,0.00014294569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993338,0.00004417067,0.00021716418,0.00012432029,0.00013163387,0.0001489327],"domain_scores_gemma":[0.99898857,0.00050481,0.000049161943,0.00032540588,0.00007183717,0.000060242543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021429975,0.0000865404,0.00015066634,0.000053468917,0.00007680816,0.0000086144455,0.00018175038,0.000057836456,0.00016439558],"category_scores_gemma":[0.00024369275,0.000082730585,0.00008419313,0.0001730539,0.00013916798,0.00007736024,0.00003462568,0.000099722936,0.00004884564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043452133,0.00035391236,0.0002854271,0.00002935399,0.00001131735,7.64557e-7,0.00019226254,0.0000028558625,0.0005414145,0.99679404,0.0014558539,0.00032842235],"study_design_scores_gemma":[0.00024570947,0.000028607843,0.00058343186,0.000013791884,0.000019492563,0.0000032874057,0.00003346081,0.000080415404,0.004904762,0.99298716,0.0010124089,0.000087450746],"about_ca_topic_score_codex":0.000002645713,"about_ca_topic_score_gemma":0.000002621499,"teacher_disagreement_score":0.0087031,"about_ca_system_score_codex":0.0000089653395,"about_ca_system_score_gemma":0.00001156038,"threshold_uncertainty_score":0.3373655},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98078024,0.0010981523,0.010584042,0.0024484617,0.000041433697,0.0012026617,0.0001850312,0.00008564523,0.003574317],"genre_scores_gemma":[0.9963935,0.00006520726,0.0027498978,0.00014722679,0.00005930135,0.00014011968,0.000009598094,0.000013051276,0.00042212027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943805,0.000030137327,0.00018695265,0.00014792844,0.00010098732,0.000095933254],"domain_scores_gemma":[0.99924254,0.00016910663,0.00009847093,0.00030536132,0.00009962393,0.00008486464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016899689,0.00008719329,0.0001277989,0.000034587094,0.0001518506,0.000012038985,0.00015000373,0.000045932895,0.000010547378],"category_scores_gemma":[0.000076485834,0.00006268747,0.000040988132,0.00026317194,0.00015541339,0.000045597713,0.00008233255,0.00007464707,0.0000074737222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003216883,0.00004571695,0.00020012616,0.000026602265,0.000016314605,3.4034105e-8,0.00024235211,0.000002635071,0.0031142335,0.9953974,0.0006440494,0.00030735353],"study_design_scores_gemma":[0.00033185046,0.000022210403,0.0005565594,0.00001568235,0.0000742807,0.000008133123,0.00034434476,0.0005336489,0.003634422,0.95384324,0.04052195,0.00011368854],"about_ca_topic_score_codex":0.000004503926,"about_ca_topic_score_gemma":0.0000048662696,"teacher_disagreement_score":0.041554134,"about_ca_system_score_codex":0.0000031256477,"about_ca_system_score_gemma":0.000018656217,"threshold_uncertainty_score":0.25563207},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92415166,0.0029062424,0.068551816,0.0019982953,0.00016007911,0.00046434454,0.000006581009,0.000024321187,0.00173667],"genre_scores_gemma":[0.9991796,0.00026197833,0.00007618024,0.00008239797,0.000028675282,0.000011646783,9.816292e-7,0.000022698903,0.00033582546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841446,0.00027574121,0.0005903737,0.000089181056,0.0002952921,0.00033495828],"domain_scores_gemma":[0.9980618,0.00056916324,0.00074323843,0.00029486473,0.00027730345,0.000053650925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022009243,0.00015601322,0.00033085738,0.000082203536,0.00012674723,0.000017838569,0.0005618539,0.00007477395,0.00001843445],"category_scores_gemma":[0.00021648333,0.00009748491,0.00017825108,0.00037171275,0.00015259194,0.00012723311,0.000039513896,0.00066764024,0.0000041078697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006509337,0.00035918909,0.000010657123,0.000020147663,0.00016051474,4.6019665e-7,0.0014604309,0.00003877362,0.0020143,0.99509037,0.0005658396,0.00021421855],"study_design_scores_gemma":[0.0011129248,0.0004907324,0.000007929389,0.00006556352,0.0001093608,0.00005748956,0.00044267427,0.0000038332687,0.024538955,0.97177416,0.0012990905,0.00009730332],"about_ca_topic_score_codex":0.0000026048415,"about_ca_topic_score_gemma":0.0000025803886,"teacher_disagreement_score":0.075027965,"about_ca_system_score_codex":0.00017476412,"about_ca_system_score_gemma":0.00025877162,"threshold_uncertainty_score":0.39753193},"labels":[],"label_agreement":null},{"id":"W175032106","doi":"","title":"On the Laplacian Spectra of Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Laplacian matrix; Eigenvalues and eigenvectors; Laplace operator; Combinatorics; Graph; Algebraic connectivity; Resistance distance; Degree matrix; Discrete mathematics; Line graph; Mathematical analysis; Graph power; Physics","score_opus":0.021342993373551822,"score_gpt":0.266556041425976,"score_spread":0.24521304805242417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W175032106","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98044354,0.000010888775,0.000022992246,0.0008706486,0.0001592394,0.00018202473,0.0000040792943,0.000043444856,0.018263131],"genre_scores_gemma":[0.99954087,0.000003954012,0.00024553452,0.00010119665,0.0000020943805,0.000023286988,9.811997e-7,0.0000107122905,0.000071359274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948955,0.000032800075,0.00014194872,0.000098872704,0.00012453581,0.00011228759],"domain_scores_gemma":[0.9991026,0.0003597154,0.00007440702,0.00040501385,0.000029227002,0.000029020239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023353644,0.000077599856,0.00010468005,0.000037463196,0.00010456733,0.000008088595,0.0002179853,0.000036678506,0.000060847706],"category_scores_gemma":[0.000109163244,0.000053917334,0.00007648154,0.00024225077,0.00008927018,0.000023350676,0.000017331373,0.00011385885,0.00004821875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006299057,0.00020629827,0.000043542153,0.0000071807544,0.000016832488,7.0849086e-7,0.0002496033,0.000001480619,0.0005451521,0.9980498,0.00084556354,0.000027546965],"study_design_scores_gemma":[0.00031682767,0.00005666599,0.00027869688,0.00002166992,0.000013486264,0.0000013141057,0.00007767437,6.959996e-7,0.01761373,0.9813769,0.00018326023,0.000059070993],"about_ca_topic_score_codex":0.000005309962,"about_ca_topic_score_gemma":0.000003120717,"teacher_disagreement_score":0.01909733,"about_ca_system_score_codex":0.000012617055,"about_ca_system_score_gemma":0.00001543982,"threshold_uncertainty_score":0.21986851},"labels":[],"label_agreement":null},{"id":"W175104714","doi":"","title":"Orientable embedding distributions by genus for certain type of non-planar graphs (II).","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Embedding; Genus; Type (biology); Combinatorics; Planar graph; Planar; Book embedding; Type species; Pure mathematics; Chordal graph; 1-planar graph; Graph; Botany; Biology; Computer science; Artificial intelligence; Paleontology","score_opus":0.017751290286212723,"score_gpt":0.29741306604122736,"score_spread":0.2796617757550146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W175104714","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99482274,0.00006946852,0.0021620328,0.00009122327,0.00034812183,0.00043933478,0.00036861666,0.000058645695,0.0016398289],"genre_scores_gemma":[0.99656284,0.000003436938,0.002354589,0.0000091324555,0.0000063752545,0.00009916398,0.00028867132,0.000019106828,0.0006567046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920267,0.000021761693,0.00027196645,0.00017105174,0.000105590865,0.00022695304],"domain_scores_gemma":[0.9991439,0.00023382736,0.00013606549,0.00030743465,0.00013300942,0.000045751676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021106697,0.000117137235,0.00019211603,0.00004761622,0.0003181812,0.000012572727,0.00017655811,0.00007312134,0.000026480437],"category_scores_gemma":[0.00007643499,0.00011894968,0.00009011592,0.00037192696,0.000059829337,0.000060440692,0.000024473393,0.00007201397,0.000006416106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000127114645,0.0003127737,0.00044249158,0.000032704418,0.00002254385,2.2692902e-7,0.000066522334,0.0000019447068,0.0077630864,0.9205502,0.070766576,0.00002817374],"study_design_scores_gemma":[0.0005103786,0.0000837504,0.00008577055,0.00001626892,0.000055634646,0.0000012876642,0.00007832975,0.00010925092,0.015066472,0.9729289,0.010939019,0.00012494199],"about_ca_topic_score_codex":0.000048239293,"about_ca_topic_score_gemma":0.000005126232,"teacher_disagreement_score":0.059827555,"about_ca_system_score_codex":0.000026789843,"about_ca_system_score_gemma":0.000023306144,"threshold_uncertainty_score":0.48506275},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97589684,0.00019209541,0.000012182998,0.0002562878,0.000061044666,0.000024383467,0.000005063338,0.000002805593,0.023549322],"genre_scores_gemma":[0.99923295,0.0000014753036,0.00035613016,0.000047027206,0.00016057123,0.000001158925,5.5014385e-7,0.000005561417,0.0001945496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946165,0.00001921739,0.0002300816,0.000050874416,0.0000989071,0.00013925963],"domain_scores_gemma":[0.999027,0.00012204496,0.00021848857,0.00013014968,0.0001011718,0.0004011363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003108379,0.0000621796,0.00015629259,0.000025738618,0.000030475605,0.000007686709,0.00019523884,0.00008208564,0.000098532095],"category_scores_gemma":[0.00034803723,0.00005169929,0.000060593982,0.00010431823,0.00010186814,0.000016140371,0.000005039291,0.0001699607,9.1203196e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029281047,0.0003713543,0.017773528,0.00040863449,0.0004695545,0.00054251845,0.0055194804,0.00076459214,0.022377195,0.8687127,0.080707036,0.0020605708],"study_design_scores_gemma":[0.00028072437,0.000064753905,0.000089769084,0.000094434465,0.000026413032,0.000105985084,0.00041830595,0.000004954454,0.02562695,0.9703023,0.0029028796,0.000082552164],"about_ca_topic_score_codex":0.00008594773,"about_ca_topic_score_gemma":0.0001964521,"teacher_disagreement_score":0.101589546,"about_ca_system_score_codex":0.00004234771,"about_ca_system_score_gemma":0.00044154061,"threshold_uncertainty_score":0.2108236},"labels":[],"label_agreement":null},{"id":"W176990240","doi":"","title":"Vertex and Edge Type Relations of Randic Index for Chemical Trees.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Type (biology); Index (typography); Enhanced Data Rates for GSM Evolution; Graph; Artificial intelligence; Computer science; Biology","score_opus":0.030343866383658387,"score_gpt":0.2724838222997454,"score_spread":0.242139955916087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W176990240","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9957901,0.00013310924,0.00010556524,0.00015587245,0.0001438769,0.0002609306,0.000007845918,0.000034042274,0.0033686215],"genre_scores_gemma":[0.99896175,0.0000111665495,0.0005006626,0.000013143809,0.000003363436,0.00003440171,0.0000042564766,0.0000111664485,0.0004601208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957657,0.000014965202,0.0001558597,0.00010351215,0.000058793183,0.00009031023],"domain_scores_gemma":[0.9992314,0.000429052,0.00006029174,0.00018465871,0.000054196364,0.000040379025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010677973,0.00006437306,0.00013197343,0.00003661536,0.00006456548,0.0000057148704,0.00007681068,0.00006829653,0.00008418424],"category_scores_gemma":[0.00020251391,0.0000623486,0.000041194293,0.0001554041,0.00006947923,0.00003855169,0.00001832363,0.000064053085,0.000011738984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013252651,0.00013635313,0.0006418035,0.000018813924,0.000018475142,9.363144e-8,0.00024878437,1.3059791e-7,0.0011702316,0.9900992,0.0073096734,0.00034322345],"study_design_scores_gemma":[0.0010420382,0.000034608383,0.0003975917,0.000013183475,0.000037565373,0.0000014978042,0.000026913689,0.0005005514,0.0014764853,0.99516565,0.0012369287,0.000066967135],"about_ca_topic_score_codex":0.0000010401433,"about_ca_topic_score_gemma":6.226815e-7,"teacher_disagreement_score":0.0060727443,"about_ca_system_score_codex":0.000008235319,"about_ca_system_score_gemma":0.0000056975177,"threshold_uncertainty_score":0.2542502},"labels":[],"label_agreement":null},{"id":"W178751288","doi":"","title":"A sk type condition for heavy cycles in weighted graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Combinatorics; Geology","score_opus":0.024735094740734483,"score_gpt":0.310158737922295,"score_spread":0.2854236431815605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W178751288","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99721235,0.00005732151,0.00004262515,0.0004776073,0.00024048824,0.00042587426,0.000012985647,0.00008712438,0.0014436478],"genre_scores_gemma":[0.99707186,0.00001222059,0.0024693657,0.000078143436,0.000008872201,0.00014731048,0.000028296725,0.000017774226,0.00016614734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936736,0.000035525663,0.00020175015,0.00015268619,0.00007493985,0.00016771784],"domain_scores_gemma":[0.9993681,0.00024229575,0.00006416387,0.00022239905,0.00006072363,0.00004236878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021715515,0.00009423879,0.00014021428,0.00009409117,0.00008966304,0.0000150700325,0.000119646415,0.000071812545,0.000050515482],"category_scores_gemma":[0.00006422434,0.00009445157,0.000056867262,0.00028727145,0.000039999875,0.00009006632,0.000014639765,0.00008347154,0.00004364736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028289252,0.00025788005,0.00036421436,0.000017950826,0.000011625115,3.7193746e-7,0.00018906969,5.565384e-7,0.00039848126,0.99323064,0.0049402076,0.0005607385],"study_design_scores_gemma":[0.00080921646,0.000047229994,0.00072261057,0.00002063091,0.00001625176,0.0000015568381,0.000051578805,0.00015119121,0.0036073169,0.9873379,0.007123145,0.0001113561],"about_ca_topic_score_codex":0.0000036657711,"about_ca_topic_score_gemma":0.0000178457,"teacher_disagreement_score":0.005892699,"about_ca_system_score_codex":0.000027130787,"about_ca_system_score_gemma":0.000016149574,"threshold_uncertainty_score":0.38516232},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98964113,0.00006377934,0.007826421,0.00040170783,0.00024797124,0.00042365724,0.000007944019,0.00019104159,0.00119637],"genre_scores_gemma":[0.9955347,0.000007779518,0.0043346365,0.000012817257,0.000023197394,0.000015452923,0.0000014415239,0.000020448717,0.000049494247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831545,0.00019021485,0.00058099726,0.00034400367,0.00025583405,0.0003134898],"domain_scores_gemma":[0.99708587,0.0015208959,0.00028849556,0.0007379941,0.00025383508,0.00011288987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014492646,0.00017243174,0.00032437214,0.00010868358,0.00017471293,0.000013016096,0.00040481347,0.000092999784,0.000030086792],"category_scores_gemma":[0.0010409481,0.0001274543,0.00016063963,0.00060579274,0.00028210378,0.000086237305,0.00016317738,0.00011439893,0.000016909426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059094245,0.0002978316,0.018331798,0.00012947858,0.000021611932,4.3960162e-7,0.0003179581,0.0000012986616,0.0021886965,0.97505033,0.00011414531,0.0035404842],"study_design_scores_gemma":[0.00035469077,0.000057764715,0.0021895606,0.00009275559,0.000024285411,0.0000021750157,0.000027394031,0.00009177059,0.012523366,0.9843035,0.00017199847,0.00016076618],"about_ca_topic_score_codex":0.000004742156,"about_ca_topic_score_gemma":0.0000030304786,"teacher_disagreement_score":0.016142238,"about_ca_system_score_codex":0.000056755533,"about_ca_system_score_gemma":0.000047940848,"threshold_uncertainty_score":0.51974356},"labels":[],"label_agreement":null},{"id":"W18057595","doi":"10.1107/s0108270107051104","title":"Graphs K1*4, 5, K1*5, 4, K1*4, 4, K2, 3, 4, have the property M(3).","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Property (philosophy); Combinatorics; Philosophy; Epistemology","score_opus":0.030689331042505236,"score_gpt":0.2913653033221387,"score_spread":0.26067597227963346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W18057595","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9325397,0.00019154257,0.00033309736,0.0015643144,0.0012511023,0.0012777833,0.000016061571,0.00040342635,0.06242299],"genre_scores_gemma":[0.99424154,0.000022747116,0.0007090105,0.00037118743,0.000030854317,0.00012602222,0.000010479688,0.000060479033,0.0044276672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979435,0.00014461417,0.00051650894,0.00040920428,0.00041094603,0.0005752053],"domain_scores_gemma":[0.99743927,0.00080145727,0.00021391289,0.0011811868,0.00018921262,0.00017499499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017432768,0.00030888445,0.00031070306,0.00011637143,0.00074915483,0.000082448045,0.0007623043,0.00017849052,0.00015186309],"category_scores_gemma":[0.00029883688,0.00018325422,0.00022357816,0.0005582138,0.00033609523,0.0001429724,0.00014831004,0.00046899696,0.00024182387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037890346,0.00036615154,0.00076347083,0.000027842621,0.00006227516,0.000009353103,0.00085048,5.1245155e-7,0.0005998581,0.9778213,0.018221265,0.0012395909],"study_design_scores_gemma":[0.0007746349,0.000067520166,0.0009966857,0.000031530803,0.0000723146,0.000019772482,0.0005386697,0.000026361085,0.003956016,0.95919746,0.03402933,0.00028968998],"about_ca_topic_score_codex":0.000036588885,"about_ca_topic_score_gemma":0.000048381633,"teacher_disagreement_score":0.06170187,"about_ca_system_score_codex":0.000046852438,"about_ca_system_score_gemma":0.000046300076,"threshold_uncertainty_score":0.74728906},"labels":[],"label_agreement":null},{"id":"W182726185","doi":"","title":"On the Spectral Radius of Unicyclic Graphs with n Vertices and Edge Independence Number q.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Combinatorics; Independence number; Enhanced Data Rates for GSM Evolution; Independence (probability theory); RADIUS; Graph; Eigenvalues and eigenvectors; Statistics; Physics; Computer science; Artificial intelligence; Quantum mechanics; Computer network","score_opus":0.017555822875046728,"score_gpt":0.2751346892003651,"score_spread":0.25757886632531835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W182726185","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99017894,0.000022087113,0.000041511583,0.00012304386,0.00007795386,0.0001890661,0.0000017151596,0.000027394712,0.009338267],"genre_scores_gemma":[0.9995241,0.000008367818,0.0003161762,0.000049323546,0.0000024358783,0.000009935506,4.977925e-7,0.00001141964,0.000077732715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993343,0.000042905795,0.00015239674,0.00013520196,0.00017653518,0.00015871365],"domain_scores_gemma":[0.99851674,0.0009696692,0.00009384248,0.00033139225,0.000038816343,0.00004952621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005192757,0.00009764552,0.000121561025,0.000034318353,0.00011546895,0.000013518167,0.0001846035,0.000050215203,0.000037283808],"category_scores_gemma":[0.00006889588,0.00006260645,0.00003071989,0.00026419046,0.00018903232,0.000052451207,0.000024978763,0.00016820536,0.000009661559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033224114,0.00013255027,0.0047751595,0.000011517019,0.000028193925,0.0000024456351,0.00033660943,1.2792333e-7,0.0003503337,0.9940103,0.0001812546,0.00013823966],"study_design_scores_gemma":[0.00036790167,0.000075474316,0.0077466527,0.000030351635,0.000029531346,0.000010023634,0.00020205844,0.00000585582,0.008312309,0.98306566,0.00007262851,0.00008153889],"about_ca_topic_score_codex":0.000011505842,"about_ca_topic_score_gemma":0.000015162754,"teacher_disagreement_score":0.01094467,"about_ca_system_score_codex":0.000008472147,"about_ca_system_score_gemma":0.0000128556185,"threshold_uncertainty_score":0.2553017},"labels":[],"label_agreement":null},{"id":"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042057043,0.0014077368,0.15379025,0.00008178426,0.00009640167,0.0022229336,0.00035216866,0.0007022465,0.84092593],"genre_scores_gemma":[0.0738701,0.0007029226,0.4944651,0.00013961362,0.0004787708,0.0010610677,0.00011172746,0.0025470986,0.42662358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99695724,0.00014366442,0.0013298617,0.0005889379,0.0005384037,0.0004419049],"domain_scores_gemma":[0.99449235,0.0018763695,0.0019873523,0.0012576118,0.000104633364,0.00028170677],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008631407,0.00070225535,0.001916772,0.00017869424,0.00011877452,0.00005524843,0.0005933677,0.0003690815,0.0010975957],"category_scores_gemma":[0.00045301334,0.0006020285,0.0005539247,0.00051731366,0.0017621856,0.000075770695,0.00021247531,0.00044274412,0.00013676156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031876316,0.0006285572,0.000008502695,0.0028214438,0.00059761415,0.0000019028486,0.0020614583,7.4018004e-8,0.00007565538,0.8264084,0.16731739,0.00007585332],"study_design_scores_gemma":[0.00042614463,0.00014273157,0.0000030149004,0.0015961212,0.00057597196,0.00002365711,0.004736189,0.001040946,0.00008448937,0.9781112,0.012418125,0.0008413775],"about_ca_topic_score_codex":0.00008506518,"about_ca_topic_score_gemma":0.0000042939887,"teacher_disagreement_score":0.41430232,"about_ca_system_score_codex":0.00003644497,"about_ca_system_score_gemma":0.00012906284,"threshold_uncertainty_score":0.9998155},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9503221,0.0036140434,0.03496797,0.0078266775,0.00024090125,0.00028483232,0.0000027961157,0.00006406058,0.0026766],"genre_scores_gemma":[0.99798733,0.00032682423,0.00023610234,0.0001255686,0.0002738887,0.000008206705,5.8785025e-7,0.0000330795,0.0010084363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982592,0.00013642138,0.0005556085,0.00010781369,0.00041299965,0.00052797096],"domain_scores_gemma":[0.9979386,0.00054733816,0.0006839742,0.00048610175,0.000253122,0.0000909129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017085939,0.00018351035,0.00033610896,0.00010717301,0.00027326265,0.000040495695,0.0007804202,0.00008297437,0.000086646534],"category_scores_gemma":[0.000203511,0.00012429115,0.000248075,0.00042685022,0.00008995585,0.0001473278,0.000048708145,0.0008975557,0.00006110366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004932132,0.00024264735,0.00013906379,0.000011388016,0.00010140168,0.0000012633336,0.00016994083,0.000019580155,0.00030175768,0.9927999,0.005699451,0.00046430246],"study_design_scores_gemma":[0.0008336258,0.00011857244,0.00014304952,0.000025879592,0.00013685891,0.00021388833,0.00007557659,0.000022787144,0.0010144925,0.9349856,0.062299207,0.00013047163],"about_ca_topic_score_codex":9.3996886e-7,"about_ca_topic_score_gemma":0.00002470933,"teacher_disagreement_score":0.057814293,"about_ca_system_score_codex":0.00022241005,"about_ca_system_score_gemma":0.0001809828,"threshold_uncertainty_score":0.50684464},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98786694,0.00020677544,0.0011438442,0.0003955638,0.00355378,0.00012672933,0.000008846968,0.000023455284,0.006674039],"genre_scores_gemma":[0.99729383,0.000011788081,0.002344823,0.000019529056,0.00021351237,0.0000036410154,3.741577e-7,0.000015378177,0.00009715127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985093,0.00030733433,0.00060355413,0.00007173032,0.0003632141,0.00014485359],"domain_scores_gemma":[0.9975667,0.0009290402,0.00039632508,0.00023682728,0.0006937583,0.00017732184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020846536,0.00011180445,0.00036142417,0.00011560532,0.000057707017,0.000020892248,0.0003128132,0.00007905279,0.00007226011],"category_scores_gemma":[0.0030084683,0.000090510155,0.00018715607,0.0002070833,0.00028467082,0.00032788544,0.000047725258,0.00019747448,0.0000035890823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008357843,0.0003595358,0.00006608885,0.000028117858,0.00005780964,0.000008255185,0.0007150035,5.6780686e-7,0.001058012,0.9950508,0.0016996289,0.00012043604],"study_design_scores_gemma":[0.00096506113,0.0005346301,0.000024947341,0.000054241096,0.000077019344,0.00008725712,0.001247582,4.623058e-7,0.008456351,0.98504156,0.003425002,0.00008589477],"about_ca_topic_score_codex":5.0763276e-7,"about_ca_topic_score_gemma":1.11415424e-7,"teacher_disagreement_score":0.010009209,"about_ca_system_score_codex":0.000019207828,"about_ca_system_score_gemma":0.00008789811,"threshold_uncertainty_score":0.36908972},"labels":[],"label_agreement":null},{"id":"W186627527","doi":"","title":"Extremal Trees with Respect to Dominance Order.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dominance (genetics); Order (exchange); Combinatorics; Mathematical economics; Biology; Business","score_opus":0.021152460912072353,"score_gpt":0.2829915776536043,"score_spread":0.26183911674153193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W186627527","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9852089,0.00003688625,0.00027730767,0.0013892227,0.000091768205,0.00030332702,0.0000037337597,0.00012540788,0.012563396],"genre_scores_gemma":[0.98247534,0.0000034573345,0.015038868,0.00013458022,0.000017199438,0.000102219776,0.0000013056024,0.000024740579,0.0022022582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919915,0.00003708866,0.0001665692,0.00022781128,0.00015235035,0.00021700912],"domain_scores_gemma":[0.999079,0.00020975346,0.00006041011,0.000483406,0.0000774033,0.000090019865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020346636,0.00013202624,0.00016768753,0.00005551163,0.00014259273,0.000027234782,0.00023060582,0.00004302254,0.000095237214],"category_scores_gemma":[0.00010474428,0.00010961463,0.000035395635,0.0004340076,0.000049261438,0.000087854314,0.000038218644,0.000101360325,0.00018827648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054511136,0.0001508937,0.00031266804,0.000005785112,0.000013447733,0.0000029212335,0.00037310732,0.0000069880525,0.00066380086,0.9911245,0.005992213,0.0012991532],"study_design_scores_gemma":[0.0006670372,0.000110037756,0.001082114,0.000033616605,0.000020782722,0.000008883661,0.00007686303,0.000020597696,0.005134117,0.97017884,0.022486942,0.00018016256],"about_ca_topic_score_codex":0.0000046449777,"about_ca_topic_score_gemma":0.00007540266,"teacher_disagreement_score":0.020945664,"about_ca_system_score_codex":0.000029515399,"about_ca_system_score_gemma":0.00002615133,"threshold_uncertainty_score":0.44699547},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.873841,0.00038925165,0.047478583,0.011695204,0.0010667739,0.0003540979,0.000080643505,0.00009575526,0.06499873],"genre_scores_gemma":[0.98920673,0.00024319778,0.0024742777,0.00021486433,0.00035802505,0.000010410606,2.3091216e-7,0.00002783192,0.0074644405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989344,0.00025600826,0.00039762465,0.00006528426,0.00018653016,0.00016017309],"domain_scores_gemma":[0.9946225,0.0044725672,0.00039157932,0.00029320124,0.00014393074,0.00007617416],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002086027,0.000088815985,0.00014467913,0.000034828496,0.00019868831,0.00002508497,0.00037361565,0.000045778594,0.0013234103],"category_scores_gemma":[0.0007171978,0.000038191512,0.00021617903,0.00011606511,0.00018572049,0.000104327475,0.00002819324,0.00014717302,0.00017367699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006667374,0.000059226142,0.00011479482,0.0000032292994,0.00006437467,0.0000042646984,0.00013711985,7.854275e-8,0.0008183865,0.9544017,0.035104126,0.009226076],"study_design_scores_gemma":[0.00026411554,0.000020090654,0.00011467525,0.000055980825,0.000036372472,0.00013640939,0.0002216189,1.7688987e-7,0.0011117344,0.9092432,0.088736705,0.000058902253],"about_ca_topic_score_codex":1.18316e-7,"about_ca_topic_score_gemma":0.0000015095324,"teacher_disagreement_score":0.11536576,"about_ca_system_score_codex":0.00001562616,"about_ca_system_score_gemma":0.000026725389,"threshold_uncertainty_score":0.9995895},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6961529,0.000048070422,0.09175059,0.0002239369,0.00025179095,0.005480914,0.00055980077,0.0009421651,0.2045898],"genre_scores_gemma":[0.87102056,0.00002169262,0.12540224,0.00011734756,0.000107398664,0.0013574443,0.00024345267,0.00031070458,0.001419185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965193,0.000051732524,0.0008980007,0.0010480385,0.0008356477,0.00064724276],"domain_scores_gemma":[0.9943957,0.0013450271,0.000945282,0.0029947492,0.000114815026,0.00020446241],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006559981,0.0010011914,0.0012447583,0.00024979838,0.00026265715,0.00019830326,0.0011177191,0.0005055167,0.00021862538],"category_scores_gemma":[0.000126542,0.00075721217,0.0003997123,0.00030915748,0.00027565676,0.000044511497,0.0006065278,0.001156966,0.0004941149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009460465,0.000374141,0.000023508555,0.0021758156,0.00031096325,0.0000052733344,0.001007795,0.00013844883,0.0000934111,0.9939651,0.0016203036,0.00019066033],"study_design_scores_gemma":[0.00054837577,0.0001061467,0.000064144806,0.0007127135,0.0005086874,0.000012214096,0.00045293977,0.0006873939,0.00064470293,0.99496585,0.0003272494,0.000969605],"about_ca_topic_score_codex":0.0000036653712,"about_ca_topic_score_gemma":0.000008892093,"teacher_disagreement_score":0.20317061,"about_ca_system_score_codex":0.000077234305,"about_ca_system_score_gemma":0.00011190683,"threshold_uncertainty_score":0.9994879},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9245759,0.0047869054,0.064705454,0.0032265885,0.00058687176,0.0005471267,0.000024664545,0.00004998354,0.0014964667],"genre_scores_gemma":[0.99658823,0.002627915,0.000043609456,0.00003371048,0.00014167193,0.000011662086,0.0000011843338,0.000050052127,0.0005019779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743986,0.0003206009,0.0008019094,0.00023974817,0.00050182623,0.0006960536],"domain_scores_gemma":[0.99791706,0.0006614165,0.00049593474,0.00057265715,0.00023670589,0.00011624717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021782448,0.00035116135,0.000604659,0.00012103772,0.00018616382,0.00009803073,0.00091736286,0.00016654181,0.000031475036],"category_scores_gemma":[0.00008932363,0.00021893164,0.00029428626,0.00015644333,0.0001993056,0.00012043737,0.00016461717,0.0019588843,0.0000033489866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010205314,0.00018164485,0.00007240364,0.00008875671,0.0003530242,0.000006987683,0.00040561668,0.0000056486247,0.0004179321,0.9977221,0.0003670421,0.0002767885],"study_design_scores_gemma":[0.0008565891,0.0002753846,0.00018968132,0.0001582841,0.0003847284,0.00015265324,0.0000530821,0.00001765581,0.0017504384,0.9949126,0.0009974864,0.00025137953],"about_ca_topic_score_codex":0.0000034639588,"about_ca_topic_score_gemma":0.000016736893,"teacher_disagreement_score":0.07201228,"about_ca_system_score_codex":0.0003026132,"about_ca_system_score_gemma":0.0005690469,"threshold_uncertainty_score":0.8927773},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98779064,0.0007361647,0.009070397,0.00087781897,0.00006959485,0.00008523328,0.0000033255485,0.000008521386,0.0013582857],"genre_scores_gemma":[0.9995275,0.00025505072,0.000042141284,0.000020001728,0.000028541224,0.000003469139,7.014147e-7,0.000007655105,0.000114912225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992223,0.00007569991,0.00031093854,0.000046650162,0.00017703384,0.00016739228],"domain_scores_gemma":[0.9987841,0.00052973843,0.0003759651,0.00012639268,0.00015760626,0.000026180202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006747337,0.00006831589,0.0001454692,0.0000752111,0.00012237113,0.000009543024,0.00014292171,0.000037207625,0.000014822291],"category_scores_gemma":[0.00006451752,0.00004853953,0.00009005315,0.00025982087,0.00010641907,0.00007860162,0.000012729535,0.0003079328,8.461842e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018757879,0.00017125148,0.00033026276,0.0000066048783,0.00004255525,4.3076912e-7,0.00003730254,0.000027457245,0.00085508573,0.9975432,0.0009496835,0.000017365668],"study_design_scores_gemma":[0.00035825424,0.00012915119,0.0006117152,0.000011466434,0.00007593106,0.000086866006,0.000070405215,0.000009033045,0.002629374,0.9937442,0.0022266163,0.000047007918],"about_ca_topic_score_codex":0.0000055624614,"about_ca_topic_score_gemma":0.0000056187673,"teacher_disagreement_score":0.011736869,"about_ca_system_score_codex":0.000040395174,"about_ca_system_score_gemma":0.00011669927,"threshold_uncertainty_score":0.19793846},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99120325,0.00012788702,0.0015449165,0.00071368867,0.0000679062,0.0004725518,0.00013728773,0.00020757668,0.0055249254],"genre_scores_gemma":[0.9804788,0.00008390905,0.018796947,0.00012270959,0.000040830146,0.000046416488,0.000026203023,0.000050580304,0.00035355505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988611,0.000030999203,0.00036887563,0.00028786634,0.0001354787,0.0003156933],"domain_scores_gemma":[0.9981602,0.000652491,0.00018474479,0.0006189488,0.00004636693,0.00033728793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032430992,0.00030017752,0.00034878653,0.00015540885,0.00036292413,0.00014877578,0.00021781224,0.00014415769,0.00010849203],"category_scores_gemma":[0.00023318423,0.00022640545,0.00010869515,0.00028147528,0.00038861882,0.00021044872,0.00010208971,0.00034029174,0.000012499998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030469178,0.000085793334,0.0005031488,0.000137589,0.00005763965,0.0000013160233,0.0032754133,8.518321e-8,0.011355042,0.9826133,0.001623344,0.00034426944],"study_design_scores_gemma":[0.0003424582,0.00003258202,0.0019010664,0.00008178957,0.000081752056,0.00008105601,0.0014731743,0.00018868122,0.0017868087,0.9930094,0.00073929003,0.00028194286],"about_ca_topic_score_codex":0.00001206852,"about_ca_topic_score_gemma":0.00010459562,"teacher_disagreement_score":0.01725203,"about_ca_system_score_codex":0.000004033236,"about_ca_system_score_gemma":0.000033699358,"threshold_uncertainty_score":0.9232546},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63374996,0.00007689369,0.3653853,0.00021139481,0.000015281363,0.00020226286,0.000022469365,0.000009223562,0.00032721634],"genre_scores_gemma":[0.8841238,0.000005518812,0.1157226,0.000035294193,0.00006929805,0.000013752466,0.000018145676,0.000005623398,0.0000059654585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872035,0.0000103733,0.000876568,0.000057570443,0.00018919563,0.00014593502],"domain_scores_gemma":[0.9986572,0.0003224514,0.0004129968,0.00008836408,0.00042705226,0.00009191405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006572507,0.00009599017,0.0003021064,0.00011346594,0.00006279198,0.000036872174,0.00014216693,0.00011653526,0.00002055928],"category_scores_gemma":[0.00019312948,0.000080890255,0.00013980971,0.00009684927,0.000045261844,0.00058565545,0.000024699399,0.00015050391,3.7896774e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008321312,0.00046156638,0.00007788299,0.000599879,0.00012920992,3.4322863e-8,0.0029369234,0.0035524243,0.07530315,0.899968,0.0011058223,0.015032951],"study_design_scores_gemma":[0.0014324781,0.000082065824,0.0000010738988,0.000081223465,0.00009514184,0.000015945672,0.00059990084,0.5789453,0.13688713,0.28081438,0.0009307605,0.000114601375],"about_ca_topic_score_codex":7.155e-7,"about_ca_topic_score_gemma":1.3878098e-7,"teacher_disagreement_score":0.6191536,"about_ca_system_score_codex":0.00001809593,"about_ca_system_score_gemma":0.00004438928,"threshold_uncertainty_score":0.3298609},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96224314,0.000032617652,0.023016041,0.0011165641,0.0000085622705,0.00089874404,0.000025312418,0.000053578606,0.012605424],"genre_scores_gemma":[0.9960727,0.000017333241,0.0032414286,0.00009743923,0.000040380644,0.0001749125,0.000009226531,0.000014684893,0.00033188422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935514,0.000022558126,0.000201789,0.00016101982,0.00012648468,0.00013298319],"domain_scores_gemma":[0.9987,0.0007660822,0.0001187981,0.0002871533,0.00007668011,0.00005125394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033963608,0.00010027121,0.00011278453,0.000050228893,0.00019859758,0.000010736251,0.0001338975,0.00004616282,0.000091506176],"category_scores_gemma":[0.000041112802,0.000064404696,0.00004286259,0.00037651346,0.000110156994,0.00004081084,0.00001501946,0.00011572875,0.00003271495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002306567,0.00013510243,0.00009257946,0.000015832853,0.000023267809,1.7358214e-7,0.00026094436,9.319312e-7,0.0011951694,0.99732834,0.00026804153,0.0006565381],"study_design_scores_gemma":[0.00026870306,0.000047879283,0.0014803313,0.000016758722,0.000051011266,0.000010880968,0.00024644946,0.00009702621,0.01578367,0.9791181,0.0027758635,0.00010330971],"about_ca_topic_score_codex":0.0000023608702,"about_ca_topic_score_gemma":0.000009329309,"teacher_disagreement_score":0.033829555,"about_ca_system_score_codex":0.000006407552,"about_ca_system_score_gemma":0.00001077986,"threshold_uncertainty_score":0.26263472},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78643066,0.00066466467,0.03949208,0.001010074,0.000097519194,0.0028783253,0.00019347484,0.0008226109,0.16841061],"genre_scores_gemma":[0.99020785,0.00011405401,0.006311125,0.00041492443,0.000059207927,0.0009624305,0.000024153967,0.000032955086,0.0018733179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992247,0.000025829124,0.00020576185,0.00026629466,0.00010022865,0.00017715637],"domain_scores_gemma":[0.99911934,0.00025057365,0.00007280096,0.00038338226,0.000058265672,0.0001156427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014208312,0.00013525743,0.00013682841,0.00007712981,0.0002827468,0.000014663579,0.00017763206,0.00007153,0.00037286893],"category_scores_gemma":[0.000046435915,0.00011994886,0.00006236749,0.00028173265,0.0000669721,0.000066278626,0.00003847496,0.00012077908,0.00026191835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071021873,0.00021205285,0.000045795136,0.000022448794,0.000019335359,2.553856e-7,0.0002052635,2.4468997e-7,0.00024218328,0.9970775,0.0015077882,0.0006600035],"study_design_scores_gemma":[0.00015331563,0.000036124184,0.0003169194,0.00000933499,0.000046725432,0.0000039502993,0.00005532537,0.00009324438,0.0028699264,0.97834826,0.017922793,0.00014407207],"about_ca_topic_score_codex":0.000003932875,"about_ca_topic_score_gemma":0.0000053418767,"teacher_disagreement_score":0.2037772,"about_ca_system_score_codex":0.000004959259,"about_ca_system_score_gemma":0.000012148274,"threshold_uncertainty_score":0.48913726},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9826304,0.000013899784,0.01656212,0.00013525816,0.000040194234,0.0004469981,0.000063130945,0.000036285106,0.00007174657],"genre_scores_gemma":[0.9692293,0.000019114725,0.030472115,0.000025866218,0.00008849915,0.000044757795,0.000050780134,0.000013842292,0.000055748646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993496,0.000027072165,0.00027561982,0.00015751811,0.000065272245,0.00012489915],"domain_scores_gemma":[0.99953973,0.00015133864,0.000115154304,0.00011374573,0.000046474157,0.00003354518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026562184,0.000098209035,0.00017066015,0.00010868435,0.000056598983,0.000013112992,0.000069085894,0.000048132275,0.0000104056935],"category_scores_gemma":[0.00012034509,0.000088151355,0.00004887862,0.0001708005,0.000039526767,0.00011028031,0.000014133676,0.000088623565,0.0000025995228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021112552,0.00039491884,0.0011537418,0.00020258944,0.000029236622,8.061254e-7,0.0041694203,0.000055536773,0.20329818,0.78873897,0.0000028613756,0.0017426292],"study_design_scores_gemma":[0.00694394,0.00023448518,0.01562987,0.00020278717,0.000116718686,0.0000106920625,0.00073999795,0.021857446,0.24111015,0.71222556,0.00048468614,0.00044366217],"about_ca_topic_score_codex":0.00005100224,"about_ca_topic_score_gemma":0.00013727097,"teacher_disagreement_score":0.07651339,"about_ca_system_score_codex":0.000011757414,"about_ca_system_score_gemma":0.000021037053,"threshold_uncertainty_score":0.35947078},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88838905,0.000035064975,0.090271264,0.00010094808,0.0000528645,0.00037683162,0.00006748016,0.0001459887,0.020560483],"genre_scores_gemma":[0.94100344,0.000005405788,0.058524054,0.000034124212,0.000023821372,0.000011081689,0.000023888766,0.000027167189,0.00034702657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987648,0.00002466666,0.00059834786,0.00015232904,0.00022053237,0.00023931505],"domain_scores_gemma":[0.9983857,0.00063126505,0.00027499834,0.0005144567,0.00010784361,0.00008569772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094416353,0.00016097908,0.00030659136,0.00012606473,0.00008507551,0.000015149865,0.00024320815,0.000094040406,0.000110054236],"category_scores_gemma":[0.0002506585,0.00013312815,0.0001339354,0.00041978434,0.00012464909,0.000058408055,0.000045193636,0.00013805322,0.000020565752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013007984,0.0002466566,0.000117543284,0.00023888347,0.000042868553,0.000003206086,0.0013189653,0.0000014697418,0.0026057137,0.9948771,0.00035330091,0.00018126804],"study_design_scores_gemma":[0.00022901747,0.00004028885,0.00010998188,0.0000783194,0.00006303388,0.000011873392,0.0006020984,0.00041963227,0.021615297,0.9764003,0.00027875503,0.00015137134],"about_ca_topic_score_codex":0.0000033530314,"about_ca_topic_score_gemma":0.000012779291,"teacher_disagreement_score":0.052614354,"about_ca_system_score_codex":0.000009399316,"about_ca_system_score_gemma":0.000011921961,"threshold_uncertainty_score":0.54288083},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9846083,0.00025957843,0.0076169325,0.00038989837,0.00021772491,0.00054974365,0.0000016842887,0.0001246005,0.006231516],"genre_scores_gemma":[0.99901414,0.0000091389,0.0007556573,0.000011875478,0.000023811546,0.000015431358,4.790236e-7,0.000012398376,0.00015709647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868804,0.0001924774,0.00046639808,0.00020984383,0.00021409192,0.0002291274],"domain_scores_gemma":[0.9964745,0.0024150666,0.00023461597,0.00064880535,0.00017693134,0.000050077953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013621786,0.00012530336,0.00023098792,0.000032497013,0.0004556183,0.000030759755,0.00041823488,0.000063242915,0.000015727655],"category_scores_gemma":[0.00096953317,0.000090180925,0.00012515332,0.00044232793,0.00023610891,0.000045714423,0.0001388923,0.00018909348,0.000006090098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008085162,0.0003073509,0.0038064662,0.000044422464,0.000018431498,1.8118408e-7,0.00045333736,0.000048618105,0.00004485809,0.99062073,0.00034049634,0.0043070395],"study_design_scores_gemma":[0.0006532516,0.000026305786,0.00085625105,0.000020089587,0.00001574932,0.0000018803782,0.000058008103,0.011198907,0.00041886177,0.9858222,0.00083055365,0.00009793676],"about_ca_topic_score_codex":0.0000033415201,"about_ca_topic_score_gemma":0.0000037446448,"teacher_disagreement_score":0.014405791,"about_ca_system_score_codex":0.000034624572,"about_ca_system_score_gemma":0.000010798842,"threshold_uncertainty_score":0.36774713},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94474155,0.0000854393,0.00008942509,0.0012569441,0.000082211496,0.00041609164,0.000049567767,0.00017981119,0.053098943],"genre_scores_gemma":[0.9974272,0.00005050082,0.00005128169,0.000591414,0.000011783435,0.00019836603,0.000029119776,0.000024390436,0.0016159113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904853,0.00014334627,0.00018412017,0.00022491797,0.00018881289,0.0002102759],"domain_scores_gemma":[0.99861985,0.00068769563,0.000047049125,0.00053425547,0.00003184879,0.00007926924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016445339,0.00015531058,0.00014062782,0.00010293896,0.0005022352,0.000036587193,0.0003050746,0.000065156346,0.0006093845],"category_scores_gemma":[0.000056984096,0.00011001264,0.0001054432,0.001365515,0.00006205685,0.000030567604,0.000008246109,0.00023723036,0.00032679047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009590682,0.00074071524,0.0000056333092,0.0000036720426,0.000022799097,0.0000010333351,0.00006375713,0.0000020702805,0.0002459147,0.92510164,0.07269318,0.0011099862],"study_design_scores_gemma":[0.00031560197,0.00016769096,0.00019816465,0.000011479661,0.000034185865,0.000002066681,0.000013665852,0.000048439695,0.0014034796,0.98591393,0.011745541,0.00014575054],"about_ca_topic_score_codex":0.0000053977747,"about_ca_topic_score_gemma":9.359989e-7,"teacher_disagreement_score":0.060947638,"about_ca_system_score_codex":0.0000340372,"about_ca_system_score_gemma":0.0000069457215,"threshold_uncertainty_score":0.6672333},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98902494,0.000010790491,0.0053897984,0.00049799134,0.00041290108,0.00019409457,0.00014855407,0.00019231421,0.004128622],"genre_scores_gemma":[0.93023884,0.00002183765,0.06748207,0.001036446,0.00036043025,0.0004760932,0.00012950922,0.00017770626,0.000077065415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99705523,0.000032249678,0.00093342544,0.0005568681,0.0008003812,0.0006218484],"domain_scores_gemma":[0.9965523,0.0010196043,0.00089596794,0.0012357502,0.000064364576,0.00023204663],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006010834,0.0004541805,0.0003867703,0.00016219309,0.00043735298,0.00013696971,0.00069428777,0.00045157564,0.00019481432],"category_scores_gemma":[0.00020525137,0.00050920394,0.0005268015,0.00034400236,0.000492713,0.00023289745,0.00023997817,0.00078708015,0.0005670907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059701677,0.00040381885,0.000008481789,0.00044678675,0.00029978695,0.0000144827845,0.0009904065,0.00008005155,0.09197394,0.9029164,0.0026736849,0.00013251357],"study_design_scores_gemma":[0.0023937393,0.00019053128,0.00013221348,0.00036781107,0.0010841312,0.0003581053,0.0013631337,0.27204952,0.12462868,0.5895637,0.006126946,0.0017414662],"about_ca_topic_score_codex":0.00003928115,"about_ca_topic_score_gemma":0.000044317436,"teacher_disagreement_score":0.3133526,"about_ca_system_score_codex":0.000013981831,"about_ca_system_score_gemma":0.00010692454,"threshold_uncertainty_score":0.99973595},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6542848,0.000012840829,0.062271874,0.024374211,0.000039526596,0.001088571,0.000030231955,0.000099898534,0.25779805],"genre_scores_gemma":[0.9928356,5.746579e-7,0.0055288733,0.00022594936,0.00003283961,0.00007004395,0.0000025558284,0.000022971031,0.001280612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991086,0.000097230666,0.0002529551,0.00014211978,0.00016910773,0.00022999491],"domain_scores_gemma":[0.998282,0.00094604614,0.000110608526,0.0004169249,0.00007753854,0.00016688238],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006224507,0.0001219342,0.00020585019,0.000056450477,0.00015275303,0.000026698355,0.0002593252,0.00006741791,0.003897257],"category_scores_gemma":[0.00047708725,0.0000772491,0.00006019175,0.00016559534,0.00021091636,0.000018420373,0.000017304015,0.00013082285,0.0008653749],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065920253,0.00003412643,0.0001699231,0.000057418994,0.000018978204,9.031069e-7,0.00036008045,0.0000038009073,0.000028531822,0.9931159,0.0054492764,0.0007544437],"study_design_scores_gemma":[0.00024814907,0.000022270833,0.00051836437,0.00009021772,0.000044620945,0.000022110133,0.00034078982,0.000333124,0.000281064,0.9650983,0.032875337,0.0001256601],"about_ca_topic_score_codex":0.00019146486,"about_ca_topic_score_gemma":0.0018496014,"teacher_disagreement_score":0.33855078,"about_ca_system_score_codex":0.000030863564,"about_ca_system_score_gemma":0.000045178593,"threshold_uncertainty_score":0.99991256},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98653495,0.00008193307,0.005692681,0.0009316047,0.000037685637,0.001071653,0.000021835065,0.0001017717,0.005525903],"genre_scores_gemma":[0.9637121,0.000025357866,0.0352504,0.0000353733,0.000017187524,0.00030791786,0.0000058112487,0.00004863261,0.0005972215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872106,0.000054217257,0.00043629858,0.00018297035,0.00030034856,0.00030508245],"domain_scores_gemma":[0.997717,0.0009331886,0.00032734295,0.0008393344,0.00009798238,0.00008511382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003167204,0.00021347817,0.00029927824,0.00005651064,0.00024299414,0.000076378055,0.00044752384,0.00006455616,0.000056673092],"category_scores_gemma":[0.00013663495,0.00011882627,0.0001464705,0.0002216618,0.00036096168,0.00016412695,0.00006509242,0.00014589529,0.00006197388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000088760125,0.00013347653,0.00012723243,0.00018465158,0.00010686116,5.987442e-7,0.0013366448,0.000008222402,0.0008506612,0.9957004,0.0010034913,0.00053888647],"study_design_scores_gemma":[0.0002129031,0.000080756254,0.00032431897,0.000093655,0.000087287306,0.0000079327165,0.0030356077,0.0005304231,0.0019288947,0.9932411,0.000278666,0.00017847016],"about_ca_topic_score_codex":0.000013365404,"about_ca_topic_score_gemma":0.000011272724,"teacher_disagreement_score":0.029557718,"about_ca_system_score_codex":0.0000116137935,"about_ca_system_score_gemma":0.000017300097,"threshold_uncertainty_score":0.48455945},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29563418,0.00050514116,0.67200875,0.002362505,0.0008662478,0.0022924172,0.00006646607,0.00013149377,0.026132803],"genre_scores_gemma":[0.9600061,0.00008026252,0.038366165,0.00014252753,0.00015486743,0.00007686936,0.0000024388246,0.000071341485,0.00109941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998205,0.00012355109,0.0007688411,0.00016346316,0.0004360495,0.0003030614],"domain_scores_gemma":[0.9945156,0.0037764832,0.0006842064,0.0007148694,0.00019172161,0.00011712218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025215659,0.00023899676,0.00048764294,0.0001926973,0.00046587017,0.00010112406,0.00059360306,0.00009506623,0.00010825937],"category_scores_gemma":[0.0014311394,0.0001404511,0.00056659424,0.00048431297,0.00022470542,0.00008897207,0.0000394675,0.00029852823,0.000015710222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010874022,0.00024381233,0.000009960366,0.0001534005,0.00017041372,5.862956e-7,0.000560912,0.00003639281,0.000491201,0.99384266,0.0037098823,0.0006720526],"study_design_scores_gemma":[0.0015119633,0.00025845863,0.0000137706975,0.00015977243,0.00025900203,0.000051244064,0.00054026465,0.0018759386,0.0022228,0.9843636,0.008559395,0.00018375905],"about_ca_topic_score_codex":7.421162e-7,"about_ca_topic_score_gemma":0.0000011227395,"teacher_disagreement_score":0.6643719,"about_ca_system_score_codex":0.000021791602,"about_ca_system_score_gemma":0.000029091038,"threshold_uncertainty_score":0.57274294},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9906661,0.0012404564,0.0020601293,0.0014222391,0.000016386588,0.00081902725,0.00013116696,0.00018953413,0.003454992],"genre_scores_gemma":[0.9959922,0.00017416543,0.0020321114,0.00041470747,0.00019594528,0.00037477634,0.000043598808,0.000021028485,0.0007515016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991309,0.000036001475,0.000258653,0.00030435596,0.00010686267,0.00016324538],"domain_scores_gemma":[0.9990303,0.00044614112,0.00010036801,0.00030235495,0.000045374745,0.00007547799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017318856,0.00015267049,0.00017558962,0.00006985134,0.00031002026,0.00004551178,0.000111520996,0.00008394869,0.000039552513],"category_scores_gemma":[0.000034609846,0.00012996163,0.000039235754,0.00018025706,0.000081881204,0.000087871274,0.000043556494,0.0001218261,0.00003889211],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063042216,0.00012720567,0.00013768068,0.000053982763,0.000011142429,1.8494192e-7,0.000051060248,0.0000017803111,0.00096750306,0.9966424,0.0011362826,0.00086443813],"study_design_scores_gemma":[0.00026107108,0.000032539163,0.0022595301,0.000012675914,0.000045375295,0.0000066113066,0.000051225714,0.00018756202,0.0031867842,0.9709987,0.022778144,0.00017980521],"about_ca_topic_score_codex":0.000017033106,"about_ca_topic_score_gemma":0.000009286771,"teacher_disagreement_score":0.025643758,"about_ca_system_score_codex":0.000006437449,"about_ca_system_score_gemma":0.00001052167,"threshold_uncertainty_score":0.52996814},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9960914,0.00015465239,0.0010339887,0.000538143,0.000031318057,0.0009241289,0.00030116877,0.00007417932,0.00085099955],"genre_scores_gemma":[0.9898803,0.0004608151,0.008521338,0.00006981104,0.00023717615,0.0004846218,0.000046909685,0.00002752871,0.00027146252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989213,0.00005536328,0.00045563412,0.0003016754,0.00009270401,0.00017336143],"domain_scores_gemma":[0.99848956,0.0005951679,0.00030249753,0.00035969913,0.00012099992,0.00013204747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029543022,0.00017443222,0.0003302934,0.00010307972,0.00024001415,0.00003204919,0.00016486559,0.00014460752,0.000096998134],"category_scores_gemma":[0.00012083122,0.00015671016,0.00006020715,0.00022780642,0.00016128673,0.00010260332,0.00006910589,0.00018083534,0.00001676377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017772802,0.00010730834,0.00029754528,0.00009320934,0.00003053369,1.5515674e-7,0.00037720255,9.8365334e-8,0.14775121,0.84996665,0.00012468819,0.0012336567],"study_design_scores_gemma":[0.0015617282,0.00014508843,0.018509585,0.00006803438,0.00040964864,0.00004361456,0.0005334973,0.0006328812,0.13455002,0.82872355,0.014024711,0.0007976415],"about_ca_topic_score_codex":0.00003473428,"about_ca_topic_score_gemma":0.000029464074,"teacher_disagreement_score":0.021243079,"about_ca_system_score_codex":0.00000441701,"about_ca_system_score_gemma":0.00003296823,"threshold_uncertainty_score":0.6390454},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7225436,0.00022128214,0.106809,0.0015132689,0.00041903538,0.0015571564,0.00008525294,0.0012359035,0.1656155],"genre_scores_gemma":[0.77934307,0.000010786252,0.21610709,0.0001456078,0.00010971127,0.00016236943,0.000026045374,0.0000883972,0.0040069153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987442,0.000055798722,0.00040621508,0.00020828037,0.00031243433,0.0002730716],"domain_scores_gemma":[0.99846315,0.00033620867,0.00016660121,0.00069588365,0.00012418236,0.00021399136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007043306,0.00020402278,0.0003083327,0.00008907514,0.00010356572,0.000057498026,0.00031436383,0.00009626969,0.00012199946],"category_scores_gemma":[0.000467007,0.00016383409,0.00015185287,0.0003188217,0.00011145286,0.000102697835,0.00008195865,0.00016467323,0.00032239515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007320761,0.00015755302,0.000026626461,0.00007384864,0.000035646466,0.000002446412,0.0020145837,0.0000024094684,0.00026260305,0.99090654,0.0063956454,0.000114775445],"study_design_scores_gemma":[0.00047825344,0.000029723737,0.0000056294293,0.000038127502,0.00007096825,0.000014068422,0.0011761126,0.001272773,0.0009317635,0.99103445,0.0047313576,0.0002167779],"about_ca_topic_score_codex":0.0000018224729,"about_ca_topic_score_gemma":0.0000027725605,"teacher_disagreement_score":0.16160859,"about_ca_system_score_codex":0.000018752844,"about_ca_system_score_gemma":0.000035160854,"threshold_uncertainty_score":0.66809607},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81817883,0.00007511004,0.016248884,0.0006397512,0.000085881395,0.0017015932,0.000010265896,0.00023030625,0.16282935],"genre_scores_gemma":[0.9923614,0.000014832961,0.006100045,0.00008254202,0.0003325601,0.00036336645,0.000019608375,0.000061005794,0.00066463114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973128,0.0005027585,0.00033524525,0.0005005005,0.00061604753,0.00073265313],"domain_scores_gemma":[0.99500245,0.0034529536,0.00008006304,0.0011462824,0.00013471721,0.00018355323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033313518,0.00018787304,0.0002945903,0.00016820634,0.00047262464,0.00006150618,0.00057267945,0.00008061335,0.00004179996],"category_scores_gemma":[0.00019116612,0.00018382516,0.0000770259,0.0012425696,0.00034746213,0.00007211929,0.0002759005,0.0009492339,0.00021945723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004318164,0.00027623348,0.000096729054,0.00003585157,0.000019485251,0.0000012745289,0.00033249764,0.00046947942,0.004018506,0.9892556,0.0021217864,0.0033293718],"study_design_scores_gemma":[0.0005882002,0.000020754896,0.00025935523,0.000037845308,0.000016027809,6.598225e-7,0.00014326273,0.007634832,0.0016640093,0.9834014,0.006035037,0.00019861928],"about_ca_topic_score_codex":0.000049703758,"about_ca_topic_score_gemma":0.000103052,"teacher_disagreement_score":0.17418255,"about_ca_system_score_codex":0.000062052706,"about_ca_system_score_gemma":0.000046967092,"threshold_uncertainty_score":0.7496173},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9121703,0.0063770358,0.042534783,0.026029008,0.000051181036,0.008027714,0.00043823596,0.00024199687,0.004129737],"genre_scores_gemma":[0.9917767,0.0022710864,0.0026773724,0.00017996888,0.000049674898,0.0023805192,0.000018959105,0.000022014969,0.00062368345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991477,0.000049710135,0.00036011523,0.00020906827,0.000069072266,0.00016429553],"domain_scores_gemma":[0.9966959,0.0023766672,0.00017505702,0.0005425699,0.00014518625,0.000064634056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003556418,0.00012379467,0.00018209808,0.00004145701,0.0012279762,0.000018618937,0.0002810374,0.000061023453,0.000004312675],"category_scores_gemma":[0.00013493339,0.000072821225,0.00009259273,0.00033326115,0.0006283607,0.000050452803,0.00006260411,0.00010569124,0.0000043500954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011557045,0.000054920118,0.000090663634,0.00001919694,0.00003645979,9.222041e-9,0.0002524918,4.806603e-7,0.00093331374,0.9946728,0.0007576611,0.0031704549],"study_design_scores_gemma":[0.0006514944,0.000016119757,0.002041574,0.0000055040377,0.00009120289,0.0000144405685,0.00012369531,0.00046395257,0.0011489881,0.966216,0.029128883,0.00009811339],"about_ca_topic_score_codex":0.0000038108724,"about_ca_topic_score_gemma":0.000008050066,"teacher_disagreement_score":0.079606414,"about_ca_system_score_codex":0.0000033565782,"about_ca_system_score_gemma":0.000024797657,"threshold_uncertainty_score":0.94447243},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99791837,0.00020168057,0.00005528287,0.000052318217,0.00075050973,0.00014036035,0.000041494266,0.000007394587,0.000832596],"genre_scores_gemma":[0.9974574,0.00017536772,0.0022526602,0.000007053203,0.00006136311,0.0000019529198,0.0000010286611,0.000015441563,0.00002776666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858284,0.00015686682,0.0007926335,0.000096678035,0.00023187176,0.00013910104],"domain_scores_gemma":[0.997059,0.0012449251,0.0010865189,0.00025759728,0.0002519352,0.000100018005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013299437,0.0001536502,0.0005724731,0.00026273497,0.0000764902,0.000015591473,0.0002226613,0.00012529679,0.000039972074],"category_scores_gemma":[0.0005248296,0.00012995054,0.0001674114,0.00025164604,0.0008265651,0.00020374704,0.00003539223,0.0003358924,1.3160866e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009775138,0.00019580768,0.0014775945,0.0001389818,0.00016453906,0.0000034720204,0.0011094204,3.5976396e-7,0.026477953,0.9691954,0.000048429956,0.00021050873],"study_design_scores_gemma":[0.0013619505,0.00061726355,0.0015027634,0.0000672948,0.00014457747,0.00009183533,0.00040821655,0.0000011281752,0.040935688,0.9542362,0.00052835536,0.00010473954],"about_ca_topic_score_codex":0.0000037257387,"about_ca_topic_score_gemma":0.0000037385753,"teacher_disagreement_score":0.01495923,"about_ca_system_score_codex":0.0000035603123,"about_ca_system_score_gemma":0.00005732297,"threshold_uncertainty_score":0.5299229},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9739165,0.00019765667,0.0011094126,0.00018144694,0.00016091851,0.000092399576,0.0000015631098,0.000009410304,0.02433071],"genre_scores_gemma":[0.99830747,0.000081638245,0.001362295,0.000028405457,0.000039205675,4.11971e-7,1.03041515e-7,0.000017542343,0.00016292324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987143,0.0004979428,0.0004526122,0.000067001216,0.00016637679,0.000101765734],"domain_scores_gemma":[0.9988617,0.00020739125,0.0004308739,0.00024049851,0.00018549137,0.00007409258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022688932,0.00009243521,0.00022450203,0.00005455726,0.00009262628,0.000016734788,0.00034788222,0.000016984037,0.00002017615],"category_scores_gemma":[0.000268065,0.000058540747,0.000107808795,0.00016629788,0.00023191607,0.00008126568,0.000047821755,0.0002490521,0.0000035074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006894613,0.00015129586,0.0006600295,0.000016255168,0.000044106397,0.000017201817,0.0015668342,2.2280875e-7,0.00014153155,0.99661773,0.0005161851,0.00019968263],"study_design_scores_gemma":[0.0017017589,0.00019469288,0.008385798,0.000042884425,0.00010037831,0.00012959578,0.00029141965,0.000006957551,0.0039791916,0.9841571,0.0009254317,0.00008482098],"about_ca_topic_score_codex":7.169941e-7,"about_ca_topic_score_gemma":2.1187098e-7,"teacher_disagreement_score":0.024390992,"about_ca_system_score_codex":0.000007546641,"about_ca_system_score_gemma":0.000019843017,"threshold_uncertainty_score":0.23872225},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98038745,0.000056249904,0.005762168,0.00006352748,0.000029691282,0.00034508336,0.00008495102,0.000020544665,0.013250363],"genre_scores_gemma":[0.97606313,0.0000038930943,0.02361689,0.0000029977923,0.000008212999,0.000013814296,0.0000029098405,0.000018255754,0.00026988628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988661,0.000039921284,0.00061754894,0.00009404934,0.00025813215,0.00012427046],"domain_scores_gemma":[0.9982068,0.00040460099,0.0006074558,0.00065998785,0.00010219117,0.000018953298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031681106,0.00012049824,0.0003317036,0.00006645325,0.000042394877,0.0000037672787,0.0003725466,0.00005772653,0.0000401758],"category_scores_gemma":[0.00014191188,0.00007771752,0.00026459194,0.00036402582,0.00033861704,0.00003122501,0.000067000205,0.00006806033,0.0000014857268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004105859,0.0001734321,0.00062213367,0.0004992514,0.000035766967,8.79998e-8,0.0008283194,0.000026591037,0.011727105,0.98573625,0.00032799,0.000018943403],"study_design_scores_gemma":[0.00016755208,0.000022224043,0.00080264197,0.00017049511,0.000105132705,0.0000023475488,0.00086235,0.00019032959,0.0680093,0.9295462,0.000040791056,0.00008068358],"about_ca_topic_score_codex":0.000024284445,"about_ca_topic_score_gemma":0.000021136046,"teacher_disagreement_score":0.056282192,"about_ca_system_score_codex":0.000004582121,"about_ca_system_score_gemma":0.000018170911,"threshold_uncertainty_score":0.31692287},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9363593,0.000053482276,0.05714161,0.0033118278,0.000014127574,0.001998083,0.00023474745,0.00007748498,0.0008093794],"genre_scores_gemma":[0.99565125,0.00006125336,0.0018053087,0.00057534385,0.00007644816,0.0015271361,0.000024299352,0.000021314574,0.0002576668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999202,0.000032877375,0.00020493136,0.00027155122,0.00010763419,0.00018099468],"domain_scores_gemma":[0.9977219,0.0016199317,0.000094379655,0.00043313755,0.00005731311,0.00007332842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022235877,0.00015916773,0.00015097541,0.000022107626,0.0007594974,0.000047769263,0.00022920697,0.00007503872,0.000019567888],"category_scores_gemma":[0.0000794376,0.00009071944,0.000069617534,0.00020606814,0.00016098015,0.000037761034,0.000056149504,0.00016914579,0.000038539718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064350647,0.00008649869,0.00037123056,0.000019391022,0.000027408001,3.104433e-8,0.0002576847,9.081578e-7,0.00030998417,0.99704707,0.0002484057,0.0016249652],"study_design_scores_gemma":[0.00036902208,0.000026464657,0.0057526445,0.000013676168,0.00007526284,0.0000024645433,0.00009361973,0.00012867745,0.0012092734,0.987914,0.004287987,0.00012690928],"about_ca_topic_score_codex":0.000006179507,"about_ca_topic_score_gemma":0.000007748706,"teacher_disagreement_score":0.05929197,"about_ca_system_score_codex":0.0000074250765,"about_ca_system_score_gemma":0.000014111751,"threshold_uncertainty_score":0.5841517},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93712944,0.0006690373,0.006439975,0.0019039852,0.00023472836,0.0014232,0.000044277018,0.00077234674,0.051382996],"genre_scores_gemma":[0.9884852,0.00011228046,0.008291407,0.00014070437,0.000034661844,0.0004099362,0.0000092717155,0.000086936874,0.002429559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972265,0.00045143705,0.0008335394,0.0005247392,0.00038463395,0.000579181],"domain_scores_gemma":[0.9972855,0.0011331907,0.00023915456,0.0010969702,0.0000506371,0.00019455959],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001275925,0.00041938995,0.00058575766,0.00060046255,0.00031713882,0.00005702257,0.00059127127,0.00018118837,0.0023553844],"category_scores_gemma":[0.00032016067,0.0002773395,0.0003632591,0.001245015,0.000378316,0.00023591095,0.00011289764,0.00034142745,0.0004032484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003206107,0.0011027276,0.0002572532,0.00015002638,0.000046178902,0.0000106882935,0.0027130442,4.534456e-7,0.0003444432,0.9905482,0.0017290303,0.0030658932],"study_design_scores_gemma":[0.00054439885,0.000029318293,0.0004273127,0.00026566905,0.000060490434,0.000026074085,0.0015863596,0.00021725045,0.00084017374,0.9951349,0.0004484725,0.00041961396],"about_ca_topic_score_codex":0.0000015421263,"about_ca_topic_score_gemma":0.000008299766,"teacher_disagreement_score":0.05135579,"about_ca_system_score_codex":0.000022394728,"about_ca_system_score_gemma":0.000007754203,"threshold_uncertainty_score":0.9999679},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98593974,0.0070148245,0.00046634075,0.0008432071,0.000049791703,0.0015778798,0.000018064264,0.000038025843,0.004052114],"genre_scores_gemma":[0.9799929,0.018000579,0.00113853,0.00040718328,0.00002712266,0.0002103845,0.000016834727,0.00002034834,0.00018608254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783576,0.00044618166,0.00055785454,0.0002902005,0.00067910366,0.00019090122],"domain_scores_gemma":[0.9950537,0.0028203314,0.0005309448,0.0011939435,0.0003389215,0.000062170104],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.005810315,0.00021138838,0.00036676275,0.00021662323,0.00025835892,0.000027484783,0.00040517506,0.00006271337,0.00018511657],"category_scores_gemma":[0.012778027,0.00012095773,0.00013792464,0.0020480298,0.000107478496,0.0001472989,0.000040575775,0.00019983877,0.000030344167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031553992,0.0003503271,0.0020849793,0.0021790792,0.00007200637,3.994847e-7,0.0001753508,0.00006604333,0.0001681808,0.86968,0.0101209385,0.114787176],"study_design_scores_gemma":[0.0017519918,0.001519524,0.0717343,0.009644893,0.00054339546,0.0000149024245,0.000045302488,0.00849752,0.0012081498,0.89283526,0.01140809,0.0007966716],"about_ca_topic_score_codex":0.0000022076981,"about_ca_topic_score_gemma":0.0000071016193,"teacher_disagreement_score":0.11399051,"about_ca_system_score_codex":0.00007919723,"about_ca_system_score_gemma":0.000063888314,"threshold_uncertainty_score":0.99553776},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7112714,0.000467497,0.0056668967,0.032659236,0.00012627868,0.0015958982,0.00011471859,0.00037423175,0.24772385],"genre_scores_gemma":[0.988419,0.00002631903,0.0060444307,0.0010072998,0.00006951199,0.000088525565,0.0000033256604,0.000045161163,0.0042964574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868345,0.000072971554,0.00030566525,0.00029778565,0.00023456039,0.00040555617],"domain_scores_gemma":[0.9978418,0.0010088152,0.00007152671,0.00041816034,0.00006653219,0.00059318886],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004054382,0.00021632893,0.00030074661,0.00035553658,0.00031205616,0.000037589536,0.00022818615,0.00014761963,0.0035825004],"category_scores_gemma":[0.0011515073,0.00018409992,0.000089053305,0.0004183216,0.00013404356,0.000023511824,0.000027269802,0.0002736039,0.005314574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007271344,0.00007392926,0.000024632063,0.00008210238,0.00001891945,0.00004562324,0.00032944046,3.3206499e-7,0.000017926446,0.96246976,0.03615428,0.0007757868],"study_design_scores_gemma":[0.0003190676,0.000061735605,0.0001361623,0.0001461536,0.000050918832,0.00023660979,0.00009751666,0.000098137054,0.00014461465,0.92543924,0.072932,0.0003378645],"about_ca_topic_score_codex":0.00023239237,"about_ca_topic_score_gemma":0.0003032146,"teacher_disagreement_score":0.27714756,"about_ca_system_score_codex":0.0001349467,"about_ca_system_score_gemma":0.00008918854,"threshold_uncertainty_score":0.99732834},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9777623,0.000040136125,0.0088810185,0.01119675,0.000014757606,0.00023369947,0.0000039239276,0.000078011275,0.0017894255],"genre_scores_gemma":[0.9884741,0.0000036576544,0.008685655,0.0027427485,0.000013785223,0.000012820644,0.0000023234718,0.000012501761,0.000052444204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991561,0.00004805786,0.00022433474,0.00018009824,0.00019794717,0.00019347374],"domain_scores_gemma":[0.99925476,0.00023986684,0.000101792364,0.0003329721,0.000035910074,0.00003470638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032288005,0.00013612218,0.0001613445,0.00003971771,0.00018863223,0.000030274745,0.0002702921,0.000038594848,0.000013727701],"category_scores_gemma":[0.0000550405,0.00009219437,0.00008497822,0.00024592574,0.00011538491,0.00006233176,0.000011290832,0.00016375094,0.0000078923495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018394316,0.00072166073,0.00048535218,0.00021453596,0.00007261964,0.000008441004,0.0048204437,0.0020290827,0.14018515,0.82389987,0.017827569,0.009551331],"study_design_scores_gemma":[0.00027903076,0.00007354665,0.0019223988,0.00022024618,0.00007336619,0.0000060528305,0.00024577722,0.0016561486,0.009067645,0.9853295,0.0007909249,0.00033532968],"about_ca_topic_score_codex":0.0000010575679,"about_ca_topic_score_gemma":6.5142933e-7,"teacher_disagreement_score":0.16142966,"about_ca_system_score_codex":0.000010291791,"about_ca_system_score_gemma":0.000012583845,"threshold_uncertainty_score":0.37595776},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99616724,0.00024166077,0.00025177348,0.00019949742,0.0012917338,0.000115464325,0.0000068749696,0.000028019693,0.0016977184],"genre_scores_gemma":[0.9965851,0.00014285151,0.0026859567,0.00004387433,0.0002936903,0.0000057794987,0.000001563982,0.000024565188,0.00021661828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983812,0.0003525503,0.0006576127,0.000119698365,0.0003066302,0.00018232242],"domain_scores_gemma":[0.9982625,0.00073795934,0.00047062192,0.00029448728,0.00014389657,0.00009051929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012901532,0.0001591595,0.0004193983,0.0001747275,0.00016666083,0.00002239416,0.00039240622,0.000108094966,0.00015249099],"category_scores_gemma":[0.00041047527,0.00013590248,0.00020494203,0.00028263597,0.0002241877,0.00039730303,0.00004480543,0.00034810044,0.0000072301696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005204166,0.00022660905,0.0005892123,0.0000085129595,0.000060369788,0.000058343205,0.0020744817,0.0000019934448,0.002195105,0.9933266,0.0008322029,0.00010617441],"study_design_scores_gemma":[0.0009852629,0.00014455247,0.0006666452,0.000061337916,0.00003591572,0.000114430106,0.0007064827,4.8800007e-7,0.009965921,0.9838684,0.0033121712,0.00013839788],"about_ca_topic_score_codex":0.0000064026276,"about_ca_topic_score_gemma":0.0000014361759,"teacher_disagreement_score":0.009458183,"about_ca_system_score_codex":0.00003394068,"about_ca_system_score_gemma":0.00006586299,"threshold_uncertainty_score":0.5541942},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84523374,0.00016455111,0.15179417,0.000584557,0.000012057132,0.0012846368,0.00015387943,0.000057824163,0.00071458786],"genre_scores_gemma":[0.9736887,0.000056217665,0.025557384,0.000071699076,0.000034775112,0.0004411854,0.000043938246,0.00001650908,0.00008954286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999364,0.00001377078,0.00024478033,0.00019500336,0.000069953094,0.000112453046],"domain_scores_gemma":[0.9993324,0.00025954613,0.00011116534,0.00013620379,0.00009845686,0.00006221018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001332555,0.00010173269,0.00015665172,0.000040354815,0.00016956721,0.000013257978,0.00006436109,0.0000640462,0.000012686793],"category_scores_gemma":[0.000038029397,0.00009567421,0.000050579853,0.00017637329,0.00008061339,0.000063339576,0.000021625005,0.000053971457,0.000010062864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014079172,0.00013111321,0.00009763869,0.000110411434,0.000021631946,4.438648e-8,0.0002815726,0.000012152555,0.0018655667,0.996446,0.0001433416,0.0008764362],"study_design_scores_gemma":[0.00083776074,0.000037936647,0.0005332395,0.000020872749,0.00007062,0.0000064555425,0.0001282015,0.0007691705,0.0029141083,0.9920221,0.0025397663,0.000119763135],"about_ca_topic_score_codex":0.0000033095057,"about_ca_topic_score_gemma":0.0000017629854,"teacher_disagreement_score":0.128455,"about_ca_system_score_codex":0.0000048957504,"about_ca_system_score_gemma":0.000018447246,"threshold_uncertainty_score":0.3901481},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9603971,0.000038691625,0.0018823256,0.0011106448,0.00087090244,0.000104270985,0.0000020524335,0.000025108748,0.03556886],"genre_scores_gemma":[0.99902743,0.000007838732,0.00018311407,0.00023312854,0.00015526952,8.13453e-7,2.3370325e-7,0.000027621601,0.0003645727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889374,0.00031496122,0.0003421579,0.000072376024,0.000250442,0.00012635218],"domain_scores_gemma":[0.99835944,0.0006229376,0.00040550542,0.000365562,0.00015928618,0.00008728622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001700548,0.00011070344,0.000148446,0.00006915663,0.00018826647,0.000051017953,0.0005527231,0.000028393759,0.00006775791],"category_scores_gemma":[0.00058374385,0.000065928776,0.00012770247,0.00021096332,0.00008763045,0.000046228513,0.00003571631,0.0010087233,0.000044059445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001877547,0.00013875704,0.00012814718,0.0000053515714,0.000024017623,0.000029944586,0.00030382982,0.000002819954,0.00051664474,0.9901883,0.008103821,0.0005395699],"study_design_scores_gemma":[0.00064001046,0.0001666734,0.00273219,0.000025976187,0.00003127618,0.00013788874,0.000057921672,0.000007033322,0.00041301904,0.9495197,0.046182465,0.000085832005],"about_ca_topic_score_codex":9.463214e-8,"about_ca_topic_score_gemma":4.1086935e-7,"teacher_disagreement_score":0.040668607,"about_ca_system_score_codex":0.000008492434,"about_ca_system_score_gemma":0.000028375172,"threshold_uncertainty_score":0.43824568},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99472344,0.000034937246,0.003245499,0.0001190866,0.00008763006,0.00032507337,0.00002395585,0.000114605966,0.001325775],"genre_scores_gemma":[0.99395365,0.000011091109,0.005501127,0.00017579377,0.00012129694,0.000027355154,0.000020160656,0.000027453763,0.00016205576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907655,0.000059872556,0.00024978167,0.00029759784,0.00014436824,0.00017182076],"domain_scores_gemma":[0.99904186,0.00027791408,0.000101728016,0.0003845138,0.00007276215,0.000121215504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002672494,0.0001679253,0.00023505547,0.00009016223,0.00013653614,0.0000126071145,0.00010315375,0.0001161098,0.000095783296],"category_scores_gemma":[0.00022431252,0.00014498242,0.00008636133,0.00017247436,0.0001249486,0.00011837563,0.00003111313,0.00017543427,0.000062968145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001809092,0.0006788464,0.000041019903,0.00005034113,0.000038362512,0.0000021967976,0.00039333745,0.00002397178,0.005779328,0.98766935,0.000025217572,0.005117134],"study_design_scores_gemma":[0.0016124445,0.0005248198,0.0011889312,0.000041152005,0.00006901238,0.000011126552,0.00011506119,0.0007891814,0.045107674,0.94966286,0.00068502664,0.00019269298],"about_ca_topic_score_codex":0.000029023038,"about_ca_topic_score_gemma":0.00002537352,"teacher_disagreement_score":0.039328344,"about_ca_system_score_codex":0.000011483095,"about_ca_system_score_gemma":0.000032969678,"threshold_uncertainty_score":0.59122115},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98934716,0.00006477205,0.0084738005,0.00085328973,0.0001537969,0.00006392579,0.0000092102355,0.000007576627,0.0010264709],"genre_scores_gemma":[0.9933579,0.00017403932,0.0061255503,0.00010540977,0.00010581786,0.0000027118133,0.000003978202,0.000005945576,0.00011863908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991041,0.000026025915,0.00043403398,0.00006133594,0.00030866763,0.000065849395],"domain_scores_gemma":[0.99838823,0.0002029377,0.0004847306,0.00008584202,0.00079163123,0.000046651097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028714232,0.00006788171,0.00013638468,0.00031118956,0.000057141897,0.000015694895,0.00018352113,0.00004667181,0.000059112306],"category_scores_gemma":[0.0003272136,0.000058842146,0.00007306759,0.00023622309,0.000087552944,0.00018178918,0.00002650294,0.000117853924,0.0000025459235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023832926,0.0010433085,0.02433889,0.000055743723,0.00038830156,0.000019545116,0.004585261,0.000024027917,0.0054638083,0.94947535,0.0020535984,0.012313822],"study_design_scores_gemma":[0.0025886064,0.0002650681,0.052077435,0.0001371513,0.0001013527,0.0014616116,0.00061325345,0.00070737326,0.01590523,0.91003674,0.015813773,0.00029239984],"about_ca_topic_score_codex":0.000005771251,"about_ca_topic_score_gemma":0.0000029216062,"teacher_disagreement_score":0.03943862,"about_ca_system_score_codex":0.00001807715,"about_ca_system_score_gemma":0.000052552627,"threshold_uncertainty_score":0.2399513},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.918571,0.00058255927,0.008363616,0.009911719,0.000030481744,0.0032677196,0.00080096547,0.00055813574,0.057913817],"genre_scores_gemma":[0.9753123,0.000335513,0.010542512,0.0019271953,0.00023421663,0.0013676817,0.000090999376,0.000045032073,0.01014455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990205,0.000024790052,0.00029793134,0.00031168349,0.00013293812,0.00021213961],"domain_scores_gemma":[0.999145,0.00016480892,0.00006333295,0.00044148858,0.00005623734,0.00012916425],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013352225,0.00015329373,0.0001697726,0.000048549868,0.00037462817,0.00003347946,0.00019831205,0.00006154213,0.0034163827],"category_scores_gemma":[0.000011516568,0.00014293258,0.0000706966,0.0002604966,0.000056991223,0.000067517685,0.00003618861,0.00011597194,0.00076694327],"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.000007980586,0.00018337152,0.00002145622,0.000026310328,0.000028377513,2.17824e-7,0.00041039134,4.3305116e-7,0.0010873313,0.96433574,0.0056121997,0.02828617],"study_design_scores_gemma":[0.00042049773,0.000032784465,0.00044781607,0.000013426898,0.00007968751,0.000009373147,0.00013861475,0.0011280066,0.006355708,0.49485373,0.49626252,0.00025781794],"about_ca_topic_score_codex":0.0000038715975,"about_ca_topic_score_gemma":0.000007268315,"teacher_disagreement_score":0.49065033,"about_ca_system_score_codex":0.000007096634,"about_ca_system_score_gemma":0.000014831539,"threshold_uncertainty_score":0.99749464},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23135385,0.0055612195,0.7513319,0.0028734906,0.000058958183,0.0043972395,0.00055284007,0.00022502773,0.0036454755],"genre_scores_gemma":[0.992052,0.00006278776,0.005631032,0.000035974816,0.00021799028,0.0010976286,0.000025029542,0.000018525543,0.0008590012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992841,0.000015434283,0.00030551877,0.00015896485,0.0000988136,0.00013717235],"domain_scores_gemma":[0.99766487,0.0017729397,0.00015424656,0.00027238927,0.00010622113,0.000029344093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022879346,0.00010332665,0.00014973602,0.00009806853,0.0002696561,0.000021579135,0.00018630487,0.000046773846,0.00002048971],"category_scores_gemma":[0.00006757896,0.000073850235,0.00007014808,0.0004951885,0.00007947824,0.00004903792,0.000027268248,0.00006591701,0.000009140506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005657593,0.00008897244,0.000007489839,0.00007734779,0.000019219042,1.2379255e-8,0.00007421526,0.00003011056,0.00049400376,0.9982111,0.00047377698,0.000518134],"study_design_scores_gemma":[0.00023805091,0.00002180988,0.00018695061,0.000008983116,0.00012764015,0.0000027765782,0.00021736546,0.0020604196,0.0020264685,0.987302,0.007702366,0.00010514775],"about_ca_topic_score_codex":0.000013931565,"about_ca_topic_score_gemma":0.000009239182,"teacher_disagreement_score":0.7606982,"about_ca_system_score_codex":0.000005094844,"about_ca_system_score_gemma":0.00001605866,"threshold_uncertainty_score":0.30115253},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78753597,0.0004162177,0.1951559,0.0035494827,0.00004120513,0.0020855071,0.00015303059,0.0005790315,0.010483642],"genre_scores_gemma":[0.9879276,0.00006984272,0.009834659,0.00031449177,0.00014502423,0.0008017444,0.00005768208,0.000040118262,0.0008088418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898845,0.000051482653,0.00023060094,0.00032335243,0.00014852708,0.0002575995],"domain_scores_gemma":[0.99887097,0.0002378164,0.00009977893,0.00052766956,0.00008953953,0.0001742138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033010758,0.00016287365,0.00018491498,0.000088081986,0.00040384752,0.000030194748,0.00018906507,0.00008298849,0.00008420175],"category_scores_gemma":[0.00005292704,0.00013137677,0.000050974915,0.00042808196,0.00009150623,0.000086982436,0.000042413107,0.00013675733,0.00012530129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046165464,0.000112973044,0.00014273911,0.000033654964,0.000024939915,1.4679082e-7,0.00021184633,0.0000011540013,0.0007892335,0.99743414,0.00044488822,0.0007996555],"study_design_scores_gemma":[0.0003608457,0.000045112614,0.00029414793,0.000016657259,0.000080120815,0.00000946318,0.00013428216,0.0011792403,0.0028226974,0.8648243,0.13002409,0.0002090161],"about_ca_topic_score_codex":0.0000015090121,"about_ca_topic_score_gemma":0.000020063626,"teacher_disagreement_score":0.2003916,"about_ca_system_score_codex":0.0000047977787,"about_ca_system_score_gemma":0.000015934935,"threshold_uncertainty_score":0.53573895},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9836611,0.00028039957,0.008347829,0.0032080926,0.00001327231,0.00065757305,0.0000936075,0.00005798993,0.0036801377],"genre_scores_gemma":[0.99759537,0.00006419408,0.0012350727,0.00021797304,0.00010834815,0.00016738226,0.000009360958,0.000010518441,0.0005917842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993048,0.000034057277,0.00025211732,0.0001652665,0.000117397736,0.00012638411],"domain_scores_gemma":[0.99879926,0.00045500102,0.00013106546,0.0005304264,0.000046792484,0.000037440346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019043508,0.00009831697,0.00015332125,0.00008946518,0.00031914286,0.00001717052,0.00028499283,0.000042154195,0.00015406519],"category_scores_gemma":[0.000047317197,0.000057959685,0.0001702395,0.0012936103,0.000103135695,0.000048258633,0.00006496054,0.00012866234,0.000010822604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017874477,0.00008185918,0.00038332114,0.000007935833,0.00018081987,1.27199336e-8,0.0002678848,0.00022422006,0.0010641925,0.99682915,0.00013529234,0.0008235009],"study_design_scores_gemma":[0.00048517255,0.000021627167,0.0657344,0.000021070075,0.0030345817,0.0000036885635,0.0003211939,0.036270596,0.010670493,0.81189704,0.07117145,0.000368698],"about_ca_topic_score_codex":0.000004253312,"about_ca_topic_score_gemma":0.000069428024,"teacher_disagreement_score":0.18493214,"about_ca_system_score_codex":0.0000055479045,"about_ca_system_score_gemma":0.000009828073,"threshold_uncertainty_score":0.2454621},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9685567,0.000062155945,0.012967581,0.0002528355,0.000048988826,0.00074155355,0.000058880407,0.00044249068,0.01686884],"genre_scores_gemma":[0.96776974,0.000013425803,0.030878872,0.00011682199,0.00003553042,0.00014833901,0.000014412525,0.000086094646,0.0009367527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820477,0.00009879442,0.0004766643,0.00040034752,0.000366212,0.00045318977],"domain_scores_gemma":[0.9972024,0.0013185048,0.00032765718,0.0008908857,0.00009950345,0.00016105089],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002931042,0.0003748819,0.00051514356,0.00014400299,0.00031250346,0.00009198099,0.00033863608,0.0001297423,0.0010393928],"category_scores_gemma":[0.00038833407,0.00029078833,0.00018095528,0.0005975541,0.00023088782,0.00018828572,0.00007058528,0.0002608058,0.000106342115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001432057,0.0004070736,0.0003790331,0.00023253645,0.00014685381,0.00000892591,0.0025387711,0.0000031990523,0.0012087125,0.992491,0.0023908988,0.0001786533],"study_design_scores_gemma":[0.0011967022,0.00013008885,0.00035828506,0.00020888475,0.00023617926,0.000060594375,0.0013387421,0.0045325235,0.0031221714,0.98750055,0.0006781109,0.00063715427],"about_ca_topic_score_codex":0.0000040462437,"about_ca_topic_score_gemma":0.00002752926,"teacher_disagreement_score":0.01791129,"about_ca_system_score_codex":0.000026302194,"about_ca_system_score_gemma":0.000011979481,"threshold_uncertainty_score":0.9999544},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8531373,0.00082666974,0.10496415,0.0055965804,0.00028084344,0.0019756982,0.00014648681,0.000025956326,0.0330463],"genre_scores_gemma":[0.98636705,0.000020921036,0.012262684,0.00012917427,0.00021757722,0.000010626657,0.000009031095,0.000040303752,0.0009426242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963825,0.0011077372,0.000837842,0.00019068997,0.0010528438,0.0004284134],"domain_scores_gemma":[0.99462074,0.0027580701,0.00016364145,0.00034033685,0.0019070868,0.00021010348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024383802,0.00012881374,0.00022689231,0.000515685,0.00058413134,0.00009222646,0.0007524376,0.000041462186,0.0002624534],"category_scores_gemma":[0.0017950658,0.000085735446,0.00018146976,0.00095857086,0.00021232772,0.00016721955,0.000109526474,0.0006506211,0.000026725153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027372217,0.00023636186,0.00023209528,0.000028898483,0.00010308178,0.000017560988,0.0007555925,0.00045031385,0.012255099,0.9785454,0.0065994696,0.0005023922],"study_design_scores_gemma":[0.0015563242,0.0011248807,0.0049313097,0.00015171281,0.00004727472,0.0002550799,0.0010957734,0.00013409286,0.016709775,0.9628754,0.010915498,0.00020284111],"about_ca_topic_score_codex":0.000004327893,"about_ca_topic_score_gemma":0.0000032719277,"teacher_disagreement_score":0.13322975,"about_ca_system_score_codex":0.000041361065,"about_ca_system_score_gemma":0.00025410994,"threshold_uncertainty_score":0.84509873},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95791805,0.007184503,0.013632319,0.002267462,0.00009394176,0.0017141615,0.00011050447,0.0001796716,0.016899414],"genre_scores_gemma":[0.99595696,0.00059457973,0.0022055255,0.00002793829,0.00013217641,0.00015682216,0.0000074163163,0.0000130468525,0.00090552936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993963,0.000032309887,0.0002069238,0.00010459802,0.00008951255,0.0001703419],"domain_scores_gemma":[0.9988346,0.0006139732,0.0001200607,0.00028615078,0.000065314,0.000079909594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024728815,0.00008513624,0.00010479425,0.000035847705,0.00033458005,0.000010912778,0.00018505736,0.00004897379,0.00003696934],"category_scores_gemma":[0.0000469632,0.00006083085,0.00004844668,0.00026916014,0.00009597242,0.000095495576,0.000046404904,0.000079309175,0.000042707103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004689631,0.00009173373,0.00014513597,0.000024904046,0.000018564539,1.48972275e-8,0.00026932094,1.5594597e-7,0.00143942,0.9956523,0.0006744439,0.001679301],"study_design_scores_gemma":[0.00045925908,0.000035411827,0.0012567962,0.000019655961,0.00020317629,0.000009427884,0.0015955252,0.0002956784,0.010488392,0.71032846,0.27504373,0.0002644792],"about_ca_topic_score_codex":0.0000017479804,"about_ca_topic_score_gemma":0.0000015656291,"teacher_disagreement_score":0.28532386,"about_ca_system_score_codex":0.000004572858,"about_ca_system_score_gemma":0.000013172502,"threshold_uncertainty_score":0.2573353},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7239698,0.0001809507,0.0772323,0.0022412178,0.00016757956,0.0017845092,0.00010356671,0.00048774667,0.19383234],"genre_scores_gemma":[0.99330515,0.0000033862618,0.0030996292,0.00020060263,0.00010946207,0.00013375835,0.0000130914095,0.000042861542,0.0030920538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988554,0.000059062495,0.00036173288,0.00018915256,0.0002784727,0.0002561747],"domain_scores_gemma":[0.99788564,0.0011096789,0.00018951975,0.0007380256,0.00003546276,0.000041691277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038778927,0.00021651125,0.0002479249,0.000052644085,0.00030738753,0.000079016914,0.00035877008,0.00009686993,0.00020148503],"category_scores_gemma":[0.0001613311,0.00012551839,0.00016793564,0.000228635,0.00015757387,0.000038536527,0.000044150936,0.00023720894,0.00013218519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009271897,0.00012992964,0.000027270851,0.000062520325,0.00002359058,0.0000018084048,0.0005614414,0.00002549641,0.00008887389,0.9900012,0.009004742,0.000063879575],"study_design_scores_gemma":[0.00040177378,0.000023695273,0.00013690026,0.000064357635,0.00005643158,0.000013957621,0.00027178667,0.0007218539,0.0005149591,0.993755,0.0038686616,0.00017064081],"about_ca_topic_score_codex":0.0000068210766,"about_ca_topic_score_gemma":0.000017353008,"teacher_disagreement_score":0.26933536,"about_ca_system_score_codex":0.000016232085,"about_ca_system_score_gemma":0.00001489565,"threshold_uncertainty_score":0.51184916},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9813399,0.000011534673,0.0027918024,0.0005690699,0.000032086053,0.0006768241,0.000015318305,0.00005818796,0.014505286],"genre_scores_gemma":[0.99134463,0.0000054599377,0.0077384617,0.00009507173,0.0000105726385,0.00023384357,0.000001943002,0.000026206551,0.00054380303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902445,0.000050303974,0.00038950366,0.00013025744,0.00021112726,0.00019435603],"domain_scores_gemma":[0.99754775,0.0013448591,0.00023253419,0.0007554429,0.000068425754,0.000051004692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034267158,0.00015049997,0.00022330771,0.000058931106,0.0001241866,0.000030959964,0.0003458424,0.000049684626,0.0005171057],"category_scores_gemma":[0.00034917664,0.00008390841,0.00015193959,0.00022314517,0.00017373762,0.000057286165,0.00005242011,0.00011259686,0.00023770872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014645384,0.00011761712,0.000020120506,0.00008575374,0.000022840024,2.6463437e-7,0.0008509175,9.35064e-7,0.0017775329,0.9943862,0.0025469079,0.00018946159],"study_design_scores_gemma":[0.00008101937,0.000038404727,0.00008560197,0.00009038027,0.000036097146,0.0000032720693,0.000580938,0.0007680202,0.009769496,0.9883056,0.00013426141,0.00010689209],"about_ca_topic_score_codex":0.0000040441005,"about_ca_topic_score_gemma":0.000001970174,"teacher_disagreement_score":0.013961483,"about_ca_system_score_codex":0.0000055117644,"about_ca_system_score_gemma":0.000008070241,"threshold_uncertainty_score":0.5661944},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8817435,0.0013980401,0.084818795,0.006667579,0.0001266131,0.0074142753,0.00062447996,0.00073204894,0.01647465],"genre_scores_gemma":[0.9884783,0.000029559007,0.008138407,0.00025590742,0.00013494988,0.0022408888,0.000050396786,0.000024961799,0.0006466318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991198,0.000023955621,0.000268781,0.0002893972,0.00010523934,0.00019282039],"domain_scores_gemma":[0.99864936,0.00046416157,0.000090699985,0.0003835559,0.00022541425,0.00018681683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038418244,0.00013706644,0.00020249464,0.00005362269,0.00024420428,0.000034011988,0.00016896341,0.00009041254,0.000015845357],"category_scores_gemma":[0.00018916011,0.00012104213,0.000078477744,0.00024645097,0.00008824634,0.000091234455,0.00003514051,0.00009275373,0.00003167236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019666013,0.00014121269,0.00020585957,0.000036998677,0.000022681614,4.3228e-8,0.00012172164,0.0000014376322,0.00041813875,0.9962564,0.0021729073,0.00060293835],"study_design_scores_gemma":[0.00061548647,0.00004171296,0.00009421874,0.000004496422,0.000060996263,0.0000026437065,0.00020080672,0.00084962824,0.0010113119,0.9212954,0.07568556,0.00013770696],"about_ca_topic_score_codex":0.0000015386357,"about_ca_topic_score_gemma":0.000013159751,"teacher_disagreement_score":0.10673478,"about_ca_system_score_codex":0.000010568997,"about_ca_system_score_gemma":0.000040137314,"threshold_uncertainty_score":0.4935955},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9937313,0.00027825488,0.00050048996,0.0012924526,0.00001131996,0.0007761869,0.000066449,0.000024475186,0.0033190565],"genre_scores_gemma":[0.9986036,0.000062314386,0.0007197868,0.000088831366,0.000013469448,0.00019466542,0.0000055997825,0.000011878417,0.00029988145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928665,0.000048841794,0.00028942272,0.00015748176,0.00011116754,0.000106454805],"domain_scores_gemma":[0.99855024,0.00075646146,0.00017253288,0.0004256552,0.000067002075,0.000028130324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021651424,0.000104088,0.00015372013,0.000050357943,0.00025744873,0.000009982108,0.00020116798,0.00005166631,0.000027264558],"category_scores_gemma":[0.000041192314,0.00006138661,0.000079286416,0.00039058982,0.00022484083,0.000027545682,0.000049153125,0.000099232384,0.0000036423114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005146821,0.00013525077,0.00020347348,0.000036867063,0.000016074897,1.3959077e-8,0.00007558524,0.0000022490046,0.0072989217,0.99102414,0.0010712891,0.00013096935],"study_design_scores_gemma":[0.00018279291,0.000018567574,0.0015599742,0.00002029412,0.000052779702,0.000002224724,0.00008107804,0.00019896196,0.021573355,0.9745776,0.001665146,0.000067212524],"about_ca_topic_score_codex":0.0000098245855,"about_ca_topic_score_gemma":0.000011419946,"teacher_disagreement_score":0.016446546,"about_ca_system_score_codex":0.0000018616884,"about_ca_system_score_gemma":0.000011291065,"threshold_uncertainty_score":0.25032732},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9509794,0.000036277346,0.03992648,0.0002529658,0.00003793527,0.0008477273,0.00006172164,0.000061815896,0.007795684],"genre_scores_gemma":[0.950095,0.000052493837,0.04949311,0.000013292145,0.000013041677,0.00008819188,0.000008460567,0.00005005054,0.00018637665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835724,0.000045617267,0.0007833011,0.00018074154,0.00034909952,0.0002840004],"domain_scores_gemma":[0.9973032,0.00082882575,0.00066436717,0.0009343778,0.00019857394,0.00007064996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056145404,0.0002431817,0.0005246498,0.00008157988,0.00018560147,0.0000266523,0.0004557212,0.00008959413,0.000027843977],"category_scores_gemma":[0.00025627355,0.00014224686,0.00016535561,0.00049485767,0.00044685364,0.00007460468,0.00006607008,0.00013919329,0.00001242384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024944682,0.00028991004,0.00010463544,0.00049604115,0.00014656334,0.000001049888,0.0021800753,0.000031089217,0.005554326,0.9909812,0.00015463341,0.000035526085],"study_design_scores_gemma":[0.0007423251,0.00013523559,0.00019444924,0.00040712216,0.00019211262,0.000013276743,0.0015007383,0.00012052326,0.028301682,0.96816313,0.000035256562,0.00019415181],"about_ca_topic_score_codex":0.00003933422,"about_ca_topic_score_gemma":0.00005075912,"teacher_disagreement_score":0.022818077,"about_ca_system_score_codex":0.000025097392,"about_ca_system_score_gemma":0.000082465995,"threshold_uncertainty_score":0.58006585},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96125776,0.00011132944,0.007236257,0.00028655192,0.000047444115,0.00035959404,0.00021616918,0.00013245286,0.030352447],"genre_scores_gemma":[0.980206,0.00003901309,0.018805873,0.000047493806,0.000037272417,0.00003692428,0.000015542122,0.00003663957,0.00077521213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988437,0.00004778054,0.00044692738,0.00019755644,0.00025531283,0.00020869912],"domain_scores_gemma":[0.9976826,0.0013195043,0.00023505122,0.0006614672,0.00003757198,0.00006385814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001421696,0.00020224822,0.00036787023,0.000080893,0.00009157786,0.000022026647,0.00029182492,0.00007825675,0.0006869264],"category_scores_gemma":[0.00033535078,0.00016236714,0.00017097725,0.00018228606,0.00013469892,0.000056584897,0.000040298415,0.00011427652,0.00012518994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006818399,0.00039017468,0.00006369041,0.00010417197,0.00006167615,9.841586e-7,0.004514455,0.000007982262,0.001944994,0.98991424,0.0023645516,0.0006262885],"study_design_scores_gemma":[0.00031642916,0.000045511275,0.00008541244,0.00013399024,0.00007300512,0.0000011580445,0.0017685527,0.0024438968,0.008467262,0.9859445,0.0005386899,0.00018159032],"about_ca_topic_score_codex":0.000007010908,"about_ca_topic_score_gemma":0.000017094648,"teacher_disagreement_score":0.029577235,"about_ca_system_score_codex":0.000012661787,"about_ca_system_score_gemma":0.000003899696,"threshold_uncertainty_score":0.75213623},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9927539,0.000509971,0.0037574698,0.00023163944,0.000008755704,0.00071035704,0.00012628267,0.0002254386,0.0016761355],"genre_scores_gemma":[0.99827975,0.00005928352,0.0012821603,0.00009838,0.000018866307,0.00012906601,0.0000453882,0.000010256144,0.00007682415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991492,0.00010757674,0.00031120307,0.00020007686,0.00007974259,0.00015218796],"domain_scores_gemma":[0.99894357,0.0005506361,0.00010345696,0.0002712409,0.00007431691,0.00005679756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000487533,0.000116102696,0.00020424354,0.0001268604,0.00008221789,0.000010232672,0.00015314516,0.000076079414,0.000046733356],"category_scores_gemma":[0.00013494988,0.00010333843,0.000041383162,0.00060677103,0.0000700646,0.000046188394,0.000015796822,0.0001168366,0.000011792677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014975744,0.00021174304,0.00039812096,0.000018683382,0.000012706552,1.9930751e-7,0.00022042354,0.000007521359,0.0022678266,0.9956827,0.00021340366,0.00095169095],"study_design_scores_gemma":[0.00028672206,0.000041294952,0.08743746,0.0000141976225,0.000022166787,0.0000035903045,0.00006552223,0.0012823283,0.0037443112,0.9067329,0.00023717452,0.00013230731],"about_ca_topic_score_codex":0.000013183422,"about_ca_topic_score_gemma":0.00004562532,"teacher_disagreement_score":0.088949785,"about_ca_system_score_codex":0.0000049927457,"about_ca_system_score_gemma":0.000022317581,"threshold_uncertainty_score":0.4214019},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99170065,0.0006288154,0.0050196433,0.0000930191,0.000002812343,0.0006671973,0.00014690086,0.000024945142,0.0017159894],"genre_scores_gemma":[0.99543107,0.000055193876,0.0042168233,0.000008813892,0.000015189955,0.00014027367,0.000019656984,0.000012597296,0.00010038708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992364,0.00002643025,0.00039073967,0.000155949,0.00009666138,0.000093830495],"domain_scores_gemma":[0.9990549,0.00026376022,0.00024333966,0.00027610268,0.00012710727,0.000034782963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017920854,0.000096040865,0.00023166047,0.000084379535,0.00006907756,0.0000032754333,0.00010743235,0.000056731948,0.00001983939],"category_scores_gemma":[0.00003026457,0.00008305418,0.00005787941,0.00030580364,0.000226408,0.000040969273,0.000041657353,0.000050538136,6.0905046e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074339623,0.00021230477,0.0006092709,0.00020366264,0.00002323596,2.70444e-8,0.00016378687,0.0000019341194,0.014755245,0.98287284,0.000071421666,0.0010788371],"study_design_scores_gemma":[0.00018153522,0.000039474075,0.0012107682,0.000017380204,0.00006747579,0.000002276963,0.00010303645,0.00022950461,0.09531887,0.90215087,0.0006085413,0.00007024403],"about_ca_topic_score_codex":0.000021669422,"about_ca_topic_score_gemma":0.000014464205,"teacher_disagreement_score":0.080721945,"about_ca_system_score_codex":0.000001528878,"about_ca_system_score_gemma":0.000014123592,"threshold_uncertainty_score":0.33868513},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89834785,0.00015268398,0.00036373734,0.0070760716,0.00005700158,0.00060935813,0.00006852918,0.000055511733,0.09326925],"genre_scores_gemma":[0.9910478,0.000002337498,0.006325376,0.0002200429,0.000043249485,0.000036458787,0.000003788308,0.000023385774,0.0022975586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907804,0.000051888892,0.0002846411,0.0001907976,0.00014080224,0.0002538316],"domain_scores_gemma":[0.99867487,0.00025130867,0.00007269926,0.00035067849,0.00008123096,0.00056923483],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00053249847,0.00012710596,0.00025298863,0.00011566424,0.00006166047,0.00001994928,0.0001562401,0.00006544769,0.0021440207],"category_scores_gemma":[0.00086918124,0.00011354211,0.00005403992,0.00014379747,0.00023179734,0.000020582178,0.000027467933,0.00010861152,0.0010538197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068410286,0.000046882567,0.000059812286,0.000083622275,0.000017615212,0.000003264806,0.00033199327,2.5334674e-7,0.000078262856,0.84681785,0.15234622,0.00020739791],"study_design_scores_gemma":[0.0002726194,0.0000318458,0.000065836546,0.00003844961,0.000034141685,0.000027161746,0.00014863226,0.000015984073,0.0006508766,0.9214289,0.077142075,0.00014348877],"about_ca_topic_score_codex":0.00019956633,"about_ca_topic_score_gemma":0.00012094949,"teacher_disagreement_score":0.092699945,"about_ca_system_score_codex":0.000030261821,"about_ca_system_score_gemma":0.00013478949,"threshold_uncertainty_score":0.999724},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9921864,0.00042181145,0.0029038717,0.0004955223,0.000009253231,0.000691916,0.00009333396,0.000040568222,0.0031572822],"genre_scores_gemma":[0.9969778,0.00020655968,0.0020320497,0.000051836578,0.00003842598,0.00021561937,0.000008871943,0.000014295835,0.0004545527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926883,0.000041532563,0.00029164721,0.00015056238,0.00013709234,0.00011034883],"domain_scores_gemma":[0.9982862,0.0009935898,0.0001683822,0.00040410037,0.00010408854,0.000043659365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022224506,0.00009742454,0.00017288809,0.00010370789,0.00021415568,0.0000037933262,0.00019986436,0.000043044503,0.00006259413],"category_scores_gemma":[0.0001337486,0.00006845164,0.00007166417,0.0006363094,0.00013585397,0.000029708192,0.00003812629,0.0000989909,0.000032226468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004006204,0.00021249885,0.00015647286,0.000034442957,0.000022350163,8.410896e-8,0.00014824202,0.000002819563,0.0021439497,0.99676234,0.00037211165,0.00014068035],"study_design_scores_gemma":[0.00026210837,0.000051344505,0.0007484028,0.000018641096,0.000063237116,0.000009023124,0.00009028773,0.0004955292,0.027113402,0.9684733,0.0025664945,0.00010823687],"about_ca_topic_score_codex":0.0000060583216,"about_ca_topic_score_gemma":0.0000014682392,"teacher_disagreement_score":0.02828905,"about_ca_system_score_codex":0.000003640823,"about_ca_system_score_gemma":0.000020380616,"threshold_uncertainty_score":0.2791377},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8711309,0.000068000365,0.00834313,0.0009174041,0.00008878492,0.002377095,0.00079540134,0.00033820383,0.11594107],"genre_scores_gemma":[0.8777715,0.00006197424,0.11124887,0.00016394148,0.00008408398,0.00076662336,0.00015003816,0.000105839485,0.009647146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827504,0.000041665346,0.0007314788,0.00033393427,0.00021056739,0.00040732694],"domain_scores_gemma":[0.9980557,0.0008928331,0.0001809019,0.0007300211,0.000049210004,0.0000913508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007170058,0.000247051,0.0003809446,0.00011476048,0.00016668544,0.000054774133,0.00037595854,0.00011849948,0.00017291748],"category_scores_gemma":[0.00029947903,0.0002221837,0.00018094172,0.0003790645,0.0001317875,0.00011849099,0.00001989969,0.00016553878,0.000121262245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008090494,0.00032125597,0.0000302414,0.00026374037,0.000025798863,0.000002037976,0.0025107258,0.000013674369,0.00017060332,0.98880446,0.0059916424,0.0017848888],"study_design_scores_gemma":[0.0010588312,0.00005159005,0.000090992304,0.00013918981,0.00003688643,0.0000075550774,0.0004912369,0.001252856,0.0009405278,0.9837532,0.011889544,0.00028761418],"about_ca_topic_score_codex":0.0000042466904,"about_ca_topic_score_gemma":0.000030437637,"teacher_disagreement_score":0.106293924,"about_ca_system_score_codex":0.000025748821,"about_ca_system_score_gemma":0.00002370467,"threshold_uncertainty_score":0.9060389},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99698126,0.00051732897,0.00018438936,0.000052182393,0.00012851394,0.00018859586,0.000010998677,0.00003970837,0.0018970178],"genre_scores_gemma":[0.99949145,0.000036026417,0.00024892407,0.0000744356,0.00006511864,0.000011798595,0.0000017141575,0.000018428585,0.00005208482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990979,0.00007569043,0.00028565494,0.00020551872,0.00014204014,0.00019322394],"domain_scores_gemma":[0.99919534,0.00018604932,0.00015695793,0.00036343868,0.000054207172,0.000043981163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015212598,0.00017094605,0.0002309586,0.000057459314,0.00014559276,0.000015427848,0.00024710898,0.0000891883,0.000072155606],"category_scores_gemma":[0.000037164955,0.00010447319,0.00008584605,0.0001544272,0.00021067233,0.00002553808,0.00010981249,0.00010651005,4.301437e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015922582,0.00020572236,0.08693183,0.00035427284,0.00038051695,0.0000057668635,0.015586496,0.000008619337,0.03163078,0.7864293,0.00050259795,0.0778049],"study_design_scores_gemma":[0.00066232163,0.00011649557,0.06806598,0.0000901757,0.0001425672,0.00004375774,0.0013339778,0.00041978466,0.06147095,0.8666138,0.0006817858,0.00035839734],"about_ca_topic_score_codex":0.00019145994,"about_ca_topic_score_gemma":0.00007090351,"teacher_disagreement_score":0.08018454,"about_ca_system_score_codex":0.000003806033,"about_ca_system_score_gemma":0.000016950988,"threshold_uncertainty_score":0.42602932},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73982316,0.0007219479,0.20288478,0.020501263,0.0001405217,0.008708144,0.00075362116,0.0010495934,0.02541698],"genre_scores_gemma":[0.9870258,0.00007614551,0.008397117,0.0007231225,0.00020757827,0.0020705394,0.00002474109,0.000040301784,0.001434658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903727,0.000031616873,0.00023807553,0.00036402253,0.00010306332,0.00022594829],"domain_scores_gemma":[0.99806726,0.0012064509,0.00010067849,0.0004185946,0.00008565971,0.00012134716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019455468,0.00016886802,0.00019476055,0.00007719474,0.00041517412,0.000029478872,0.00016665315,0.000101977166,0.00017896133],"category_scores_gemma":[0.00022666229,0.0001575467,0.00009492241,0.00024566447,0.00005901377,0.00007673928,0.00003377504,0.00013867268,0.0002581621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008447636,0.0003032519,0.000008718413,0.00004159571,0.00001929894,1.05414394e-7,0.00017519268,8.566975e-7,0.00082111236,0.99023014,0.0021535307,0.0062377616],"study_design_scores_gemma":[0.0005430896,0.00009529944,0.0001082088,0.000017033171,0.00006699893,0.0000063979023,0.000039761882,0.004991995,0.0046676067,0.89707774,0.09214612,0.00023972284],"about_ca_topic_score_codex":7.499267e-7,"about_ca_topic_score_gemma":0.0000040393097,"teacher_disagreement_score":0.24720265,"about_ca_system_score_codex":0.00001261051,"about_ca_system_score_gemma":0.00000709343,"threshold_uncertainty_score":0.6424568},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9677037,0.00008566531,0.02058605,0.0007559446,0.000019398545,0.00086468935,0.000044244884,0.0000703836,0.009869909],"genre_scores_gemma":[0.9985124,0.000023654962,0.0006932383,0.00024688986,0.00003087283,0.00012745179,0.000009359556,0.000013834666,0.00034232333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992759,0.000023333228,0.00025134784,0.00016811975,0.00012854768,0.00015271011],"domain_scores_gemma":[0.9983771,0.0010073348,0.00011067433,0.00037490155,0.00006525731,0.000064720516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004301523,0.00009859421,0.000114051734,0.000074536896,0.00026896526,0.000009717898,0.00020363793,0.000055821332,0.00005647688],"category_scores_gemma":[0.00009997636,0.000068882386,0.000056134286,0.00043496877,0.00010740059,0.000024959756,0.000032958804,0.000119490986,0.00005281981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067264987,0.00017015573,0.000040114486,0.000014219691,0.0000140592765,6.9298835e-8,0.00016130456,8.946606e-7,0.0019401592,0.99593484,0.00036814527,0.001349327],"study_design_scores_gemma":[0.00016398028,0.00003159629,0.0006415664,0.000014493074,0.00003396812,0.0000023460484,0.00022004396,0.00012002609,0.014478026,0.9715229,0.01266943,0.00010161861],"about_ca_topic_score_codex":0.0000012580539,"about_ca_topic_score_gemma":0.000004639737,"teacher_disagreement_score":0.03080866,"about_ca_system_score_codex":0.0000040664136,"about_ca_system_score_gemma":0.00000802131,"threshold_uncertainty_score":0.28089422},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9920767,0.00020321715,0.0029248998,0.00007869848,0.00010664902,0.00036324674,0.000020251593,0.00020567651,0.0040206686],"genre_scores_gemma":[0.9817433,0.000063580614,0.017222593,0.00023454397,0.000055760636,0.00003981159,0.000009094261,0.000046390207,0.0005849352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986266,0.00016064572,0.0003096192,0.0004089205,0.00015495127,0.0003392932],"domain_scores_gemma":[0.9985941,0.00059492316,0.00010187678,0.00048119403,0.000056820045,0.00017107096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000509566,0.00024582713,0.0003018225,0.000113559734,0.00028358397,0.000038670823,0.00013725192,0.00014181546,0.00021841298],"category_scores_gemma":[0.00046029707,0.00022334969,0.00014205211,0.00031376304,0.00016307514,0.00013158354,0.00005045104,0.00027231037,0.00004731098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013563461,0.00019859438,0.0016614681,0.000040083374,0.000052933334,0.0000039777565,0.00027755374,0.0000018840527,0.0022502302,0.99264294,0.00021092738,0.0026458304],"study_design_scores_gemma":[0.0016011157,0.000059352882,0.0020619496,0.00003546496,0.00010423625,0.00004271301,0.00025982247,0.003360286,0.016140694,0.958365,0.017477162,0.00049215293],"about_ca_topic_score_codex":0.000017427985,"about_ca_topic_score_gemma":0.00002458148,"teacher_disagreement_score":0.034277905,"about_ca_system_score_codex":0.000010929272,"about_ca_system_score_gemma":0.000025010844,"threshold_uncertainty_score":0.9107936},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98817736,0.0004224435,0.0013787905,0.00012912083,0.0015334975,0.00015750309,0.000009626728,0.000029024863,0.00816262],"genre_scores_gemma":[0.9964369,0.000028947525,0.0026445438,0.000009429322,0.0003775514,0.000003863167,0.0000013231952,0.000022699163,0.00047476328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833906,0.0002859559,0.00077779056,0.00009258593,0.00033779416,0.00016684277],"domain_scores_gemma":[0.9978877,0.00054788135,0.00082163356,0.00030740188,0.00037493257,0.000060464998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001714573,0.00015235816,0.00042545737,0.00015930629,0.000110309156,0.00002246607,0.00035845497,0.00009426469,0.00016404538],"category_scores_gemma":[0.00026170563,0.00012559806,0.0003066245,0.00027610958,0.0002720589,0.00026639822,0.000036477326,0.0001810612,0.0000025867141],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040634835,0.00034935688,0.00012617015,0.00003568661,0.0000771264,0.000006880567,0.00017402893,0.000004572728,0.011799576,0.9854619,0.0013571593,0.0002012074],"study_design_scores_gemma":[0.00072371785,0.00025236726,0.00020998403,0.00005095701,0.00010265635,0.000055489876,0.00027433314,6.022778e-7,0.045093417,0.94795716,0.005164393,0.000114914714],"about_ca_topic_score_codex":0.0000021460748,"about_ca_topic_score_gemma":7.293088e-7,"teacher_disagreement_score":0.037504718,"about_ca_system_score_codex":0.000018208315,"about_ca_system_score_gemma":0.00005545769,"threshold_uncertainty_score":0.512174},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.972388,0.00013795943,0.0015122901,0.0007557913,0.000028740697,0.0009997274,0.000100850404,0.000052617193,0.024023993],"genre_scores_gemma":[0.9959824,0.000016626876,0.000850197,0.00025739308,0.000051400402,0.00032744644,0.0000028120226,0.000016360384,0.0024953594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932617,0.000062889034,0.0002139869,0.0001688629,0.00010651988,0.00012154832],"domain_scores_gemma":[0.99872,0.00047839768,0.00012428756,0.0005753295,0.000061116996,0.000040876283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025715676,0.000105839135,0.00011050599,0.000025713141,0.00036292544,0.000008864077,0.0003284802,0.000055487555,0.00058083615],"category_scores_gemma":[0.00007619429,0.000058821162,0.000076568635,0.00023136594,0.00014230596,0.000034628007,0.000068087,0.00014134422,0.000054614044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003461952,0.00013572932,0.00008008164,0.000019821564,0.00001908225,2.9629268e-8,0.00051368686,1.705849e-7,0.0014073328,0.996906,0.0007521274,0.00016251166],"study_design_scores_gemma":[0.00008933229,0.000018948695,0.0015986605,0.000012585655,0.000039788523,0.0000028850066,0.00018708734,0.00010373099,0.031494368,0.9598182,0.0065536946,0.000080739424],"about_ca_topic_score_codex":0.000002063973,"about_ca_topic_score_gemma":0.000007626039,"teacher_disagreement_score":0.037087783,"about_ca_system_score_codex":0.0000034308746,"about_ca_system_score_gemma":0.00001617095,"threshold_uncertainty_score":0.6359749},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9760219,0.00004543843,0.008886139,0.00032935126,0.00015754679,0.00059582427,0.000017873537,0.00028202287,0.0136639355],"genre_scores_gemma":[0.8523414,0.0000080103255,0.1468198,0.000026296264,0.00014015565,0.00011012136,0.000012232504,0.000048685262,0.0004933047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987964,0.00004761355,0.00032135146,0.00020652202,0.00024103267,0.0003871035],"domain_scores_gemma":[0.99872726,0.00018930864,0.00023266999,0.0006330528,0.0000894331,0.00012828836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045962364,0.00022332996,0.00026206725,0.00010240869,0.00019619748,0.000039707924,0.00017725091,0.000080061065,0.00012368044],"category_scores_gemma":[0.000139242,0.00016550433,0.0000721121,0.00051798887,0.00019908178,0.000294103,0.00003344335,0.0001674536,0.00008410835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000088758825,0.00020399778,0.0010555852,0.00022381221,0.00006747145,4.5728606e-7,0.001384781,8.701927e-7,0.0005364051,0.99565107,0.0004403797,0.0004262759],"study_design_scores_gemma":[0.00033370618,0.00004607043,0.00042944943,0.00014342288,0.00020031404,0.00019311914,0.0017855718,0.00003480514,0.0076853675,0.9878637,0.0009044732,0.00037995473],"about_ca_topic_score_codex":0.0000043430555,"about_ca_topic_score_gemma":0.0000046737528,"teacher_disagreement_score":0.13793366,"about_ca_system_score_codex":0.000019173445,"about_ca_system_score_gemma":0.00001817824,"threshold_uncertainty_score":0.6749071},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9463667,0.0010514882,0.04840699,0.0004702933,0.000006791454,0.0020007088,0.00046348464,0.00007755303,0.0011559586],"genre_scores_gemma":[0.9757074,0.00006761092,0.02284065,0.00003434475,0.00006010853,0.0008231067,0.000069239664,0.000020562355,0.00037697132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993372,0.000017593939,0.00023825763,0.00021028641,0.00007140295,0.0001252407],"domain_scores_gemma":[0.99891084,0.00059094554,0.0001474901,0.0001718102,0.00013359291,0.000045345558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001097193,0.00011796177,0.000184861,0.000057391753,0.0001873262,0.000021579952,0.000073202726,0.00005536806,0.000008207985],"category_scores_gemma":[0.000020530906,0.000095818206,0.0000327389,0.00017103876,0.00010852826,0.00007516615,0.000024868319,0.000047408455,0.0000025020058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027479005,0.00012663443,0.0001830235,0.00010951367,0.000026393109,8.279665e-8,0.00018628644,0.000001879042,0.006871582,0.9919262,0.00018513914,0.00035576645],"study_design_scores_gemma":[0.0010459564,0.00014161144,0.0024317824,0.00005578176,0.0002881261,0.00001827998,0.00023799518,0.0007979687,0.04174245,0.94796395,0.0050028274,0.00027324207],"about_ca_topic_score_codex":0.000007129711,"about_ca_topic_score_gemma":0.0000069326957,"teacher_disagreement_score":0.04396224,"about_ca_system_score_codex":0.0000024858198,"about_ca_system_score_gemma":0.00001296392,"threshold_uncertainty_score":0.3907353},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8720897,0.000018049326,0.012699864,0.0013540959,0.00004382579,0.0014988007,0.000058022903,0.000077282864,0.11216036],"genre_scores_gemma":[0.99651617,0.000004097477,0.0030374178,0.00019882036,0.000019279916,0.00006987727,0.0000022293498,0.000022757698,0.00012933135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863726,0.00004010996,0.0005417942,0.00016719551,0.00040269637,0.0002109714],"domain_scores_gemma":[0.9974834,0.0007600628,0.0005097599,0.0011499185,0.000056984787,0.000039923216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055570755,0.00020605301,0.00035413637,0.00006569384,0.00018848147,0.00001929275,0.0007290948,0.000095264906,0.00004464396],"category_scores_gemma":[0.00011625236,0.00010987166,0.0002225743,0.00052576413,0.00031091648,0.000024267643,0.00006243277,0.00021774281,0.000008217869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016598193,0.00027898166,0.00001303645,0.00010156936,0.00003860539,1.1019651e-7,0.0018268549,0.000012046001,0.008505768,0.9884322,0.00052595156,0.00024822188],"study_design_scores_gemma":[0.00020253425,0.000037967977,0.00022373165,0.00009906184,0.00007309022,0.0000016316407,0.0014558615,0.00011486196,0.03292374,0.96461624,0.00012973495,0.0001215585],"about_ca_topic_score_codex":0.0000011219665,"about_ca_topic_score_gemma":0.0000032048963,"teacher_disagreement_score":0.12442649,"about_ca_system_score_codex":0.000010538663,"about_ca_system_score_gemma":0.000026408004,"threshold_uncertainty_score":0.4480436},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9270839,0.0011199126,0.020435693,0.002838963,0.00819155,0.0007500601,0.000009853377,0.00013138719,0.039438672],"genre_scores_gemma":[0.9533941,0.00007021072,0.045085948,0.00008357976,0.000612519,0.000012401452,5.450309e-7,0.0000359457,0.00070475007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977381,0.00077306485,0.00085740123,0.00012061647,0.00026589134,0.0002448903],"domain_scores_gemma":[0.9971295,0.0016163358,0.00058456726,0.00030346442,0.0002496907,0.000116430696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004756687,0.00017844813,0.00048400514,0.00021947296,0.00008215057,0.00004097346,0.00044277107,0.00013381522,0.00013884879],"category_scores_gemma":[0.0012774434,0.00015381494,0.00020418243,0.00048487578,0.00012887982,0.00035590757,0.00006369198,0.00048502098,0.0000066151756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039160994,0.00045447436,0.000057650283,0.000016975084,0.00004548464,0.000009517015,0.0007858121,0.0000075390712,0.0013374649,0.992825,0.00043353875,0.0036349369],"study_design_scores_gemma":[0.0013744627,0.00023871846,0.000055425306,0.000042570464,0.000043862416,0.00008973046,0.0005317902,0.000004686768,0.010243824,0.9393605,0.047863476,0.00015095861],"about_ca_topic_score_codex":6.7805587e-7,"about_ca_topic_score_gemma":0.0000018018849,"teacher_disagreement_score":0.053464502,"about_ca_system_score_codex":0.00010131069,"about_ca_system_score_gemma":0.000086316504,"threshold_uncertainty_score":0.62723917},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46422416,0.00018961409,0.5170193,0.002128881,0.00011493851,0.0007569846,0.000013174673,0.0003507573,0.015202206],"genre_scores_gemma":[0.9062754,0.000036651993,0.09319792,0.00014901112,0.00008648246,0.000016219252,0.00003992498,0.000010920285,0.00018749644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993386,0.000045894714,0.00018213667,0.000191499,0.00008182225,0.000160013],"domain_scores_gemma":[0.99951565,0.00008085041,0.000076580094,0.00024064914,0.00003059959,0.000055673805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002731769,0.000099523524,0.0001108173,0.000023106175,0.00019371072,0.000055203214,0.00007525214,0.00005812281,0.000043914857],"category_scores_gemma":[0.00008012222,0.00009127744,0.000036279078,0.00013771592,0.000047195106,0.00013796354,0.000019330175,0.000078147415,0.0000022966992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005411108,0.00010946682,0.0009762539,0.000045758912,0.000025903977,0.0000021425965,0.000658372,0.13008282,0.00010804138,0.8627055,0.001493843,0.0037377893],"study_design_scores_gemma":[0.00024593406,0.00005837865,0.0024612253,0.000037103146,0.00006817723,0.000010444177,0.000027713633,0.118007705,0.00007147535,0.87819946,0.00062440324,0.00018795488],"about_ca_topic_score_codex":9.772453e-7,"about_ca_topic_score_gemma":0.0000011850515,"teacher_disagreement_score":0.4420512,"about_ca_system_score_codex":0.00001162562,"about_ca_system_score_gemma":0.000006813739,"threshold_uncertainty_score":0.3722186},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64598894,0.000009809957,0.34820697,0.002147946,0.000060074603,0.0005074712,0.000036118803,0.000029086144,0.0030135731],"genre_scores_gemma":[0.9939156,0.000020355465,0.005675855,0.000046334593,0.000011967851,0.000015392545,1.5395929e-7,0.000017822176,0.00029648293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876994,0.00014825241,0.00044125883,0.00012722668,0.00032020535,0.00019311687],"domain_scores_gemma":[0.996602,0.0018292147,0.0005938324,0.0008661973,0.00007181287,0.00003692139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006099335,0.00013516466,0.00034845696,0.00001512684,0.00037170592,0.000008421792,0.0007761292,0.00004176746,0.000059315404],"category_scores_gemma":[0.000098386976,0.00006842176,0.00087770633,0.000711793,0.0021876106,0.000040161354,0.000033327062,0.00024417636,0.0000034569273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031299147,0.0005369975,0.0001572485,0.00023545534,0.00042828257,1.7780172e-8,0.0030667142,0.0003471065,0.009939175,0.9838187,0.000555304,0.0008836716],"study_design_scores_gemma":[0.00024630202,0.0000660635,0.001065925,0.000105195424,0.00038208216,0.0000035053827,0.002618762,0.002490468,0.029067544,0.96364653,0.00019677929,0.000110826935],"about_ca_topic_score_codex":0.00003144218,"about_ca_topic_score_gemma":0.00000743435,"teacher_disagreement_score":0.34792668,"about_ca_system_score_codex":0.000020589625,"about_ca_system_score_gemma":0.00003859708,"threshold_uncertainty_score":0.80603427},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98897743,0.000054311113,0.00009953355,0.0012689105,0.0012897903,0.00018979111,0.000011712228,0.0000068821187,0.008101637],"genre_scores_gemma":[0.99898887,0.000020163381,0.00013895736,0.000062260115,0.0002908515,0.000001679857,1.2712229e-7,0.000013785165,0.00048328898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860626,0.00035549028,0.0004843819,0.00007000889,0.00034739767,0.00013646815],"domain_scores_gemma":[0.9975052,0.0010915239,0.00077048456,0.00039777523,0.00019155913,0.00004346361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001307671,0.00012756756,0.00029645025,0.0000721392,0.00014525611,0.000017378676,0.0005722527,0.0000672266,0.0002842048],"category_scores_gemma":[0.00036943937,0.000069636226,0.00036516596,0.0002913086,0.0005252659,0.00016461665,0.000046406352,0.0003150927,0.000002719194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012290088,0.00037816504,0.000026967291,0.000012295519,0.0001376134,0.0000016464969,0.0008234981,0.000022932176,0.0022574351,0.9931049,0.0019498196,0.000055741857],"study_design_scores_gemma":[0.0008131483,0.00039378006,0.00010696175,0.000068120455,0.00010078099,0.000029111037,0.00052792364,0.0000014001575,0.03166702,0.9570611,0.009161448,0.00006922066],"about_ca_topic_score_codex":8.784949e-7,"about_ca_topic_score_gemma":9.790239e-7,"teacher_disagreement_score":0.036043793,"about_ca_system_score_codex":0.000035615947,"about_ca_system_score_gemma":0.0000982275,"threshold_uncertainty_score":0.31118435},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7842824,0.004569405,0.009567995,0.028812766,0.0002372278,0.0064215004,0.001136014,0.0021378372,0.16283488],"genre_scores_gemma":[0.9883781,0.00085134845,0.004047922,0.0006087041,0.0005376592,0.00060545665,0.0000382798,0.000039952854,0.004892595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904835,0.000026331269,0.00027786705,0.00032716373,0.00012437446,0.00019593495],"domain_scores_gemma":[0.998932,0.00034067594,0.000090647394,0.00047746935,0.000041057985,0.00011816414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001388636,0.00014671874,0.00014446267,0.00009451094,0.00032350095,0.000027450067,0.00017578558,0.000077386045,0.00011021871],"category_scores_gemma":[0.00006747112,0.00013188053,0.00006642593,0.00032755875,0.000063906715,0.0000835756,0.000027991848,0.00016886057,0.0005534385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058241867,0.0002638476,0.000003068239,0.000014057615,0.000014962358,3.3562384e-7,0.00014628933,0.0000013540005,0.0005453041,0.9933666,0.0044122436,0.0012261163],"study_design_scores_gemma":[0.00037040422,0.000048951333,0.000111206275,0.000011852215,0.000033149172,0.0000062821905,0.000047372214,0.0005322424,0.0029004985,0.9349124,0.060846224,0.00017943309],"about_ca_topic_score_codex":9.306248e-7,"about_ca_topic_score_gemma":0.0000013471795,"teacher_disagreement_score":0.20409572,"about_ca_system_score_codex":0.0000071091617,"about_ca_system_score_gemma":0.000003843544,"threshold_uncertainty_score":0.7113517},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9608058,0.0005678546,0.026660996,0.0009276804,0.0000150308715,0.0019808302,0.00012057212,0.00037711236,0.008544127],"genre_scores_gemma":[0.99048966,0.00015434308,0.007122988,0.00015387671,0.000055058328,0.0008953881,0.00001916549,0.00004461948,0.0010649051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891835,0.000027072681,0.00023565978,0.00038181653,0.00017232515,0.0002647575],"domain_scores_gemma":[0.99893606,0.00018033855,0.00012104948,0.0005027962,0.00010083274,0.00015892253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009590319,0.00021313477,0.0002217163,0.00008931209,0.00040625568,0.000040208564,0.0001989106,0.00007703038,0.00014112236],"category_scores_gemma":[0.000013107139,0.00015381187,0.000042757532,0.00048184276,0.00014422653,0.000112008405,0.000029835639,0.000162015,0.00011155687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013505978,0.00029954128,0.0004730846,0.00006848655,0.000056935274,0.000003360926,0.000394915,0.0000025509107,0.00080591365,0.9943441,0.00040272417,0.0031348874],"study_design_scores_gemma":[0.0035479567,0.00071523763,0.003744873,0.00027123326,0.000866553,0.000800403,0.0009355079,0.008677818,0.011970953,0.864868,0.10157327,0.0020282026],"about_ca_topic_score_codex":0.000002604063,"about_ca_topic_score_gemma":0.000017493969,"teacher_disagreement_score":0.1294761,"about_ca_system_score_codex":0.00000748161,"about_ca_system_score_gemma":0.000011711448,"threshold_uncertainty_score":0.6272266},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98658,0.0022210137,0.006720938,0.00023915211,0.0000073443343,0.00094171293,0.000032713837,0.000061540755,0.003195592],"genre_scores_gemma":[0.9901524,0.0012883246,0.007966829,0.000008706593,0.000014627561,0.0002056602,0.00001481953,0.00001699197,0.00033161076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911064,0.0000231769,0.00045245665,0.00019048904,0.00009623547,0.0001270318],"domain_scores_gemma":[0.9990985,0.00024034784,0.00025503497,0.00025752504,0.00008480179,0.00006383066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019879562,0.00011651643,0.00022803697,0.00009894073,0.00013863802,0.000009840211,0.00012102043,0.00007882436,0.00004351938],"category_scores_gemma":[0.000040398085,0.00009744821,0.000048523547,0.0004331398,0.000099867706,0.000110099514,0.00004168567,0.00008432991,0.000005244151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054486823,0.00016962651,0.00033654153,0.00020077922,0.000039902727,1.15899994e-7,0.001022177,0.000023555476,0.009024573,0.987508,0.00001958418,0.0016497255],"study_design_scores_gemma":[0.0004544111,0.00008855493,0.000884735,0.00009533387,0.00017118965,0.000024843674,0.0007147301,0.0033738401,0.007850863,0.9849332,0.0012115976,0.0001966977],"about_ca_topic_score_codex":0.0000041406147,"about_ca_topic_score_gemma":0.000009152866,"teacher_disagreement_score":0.0035724363,"about_ca_system_score_codex":0.0000038732856,"about_ca_system_score_gemma":0.000014778191,"threshold_uncertainty_score":0.39738226},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16007803,0.0020774752,0.81910056,0.0075140493,0.000050210867,0.007311083,0.0005563132,0.00019619409,0.003116088],"genre_scores_gemma":[0.9797865,0.00015380011,0.01402035,0.00011302229,0.00009647847,0.0043428717,0.000021657508,0.000021981468,0.0014433435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994077,0.000013829035,0.00022652357,0.00015488995,0.00006841641,0.00012864199],"domain_scores_gemma":[0.9985947,0.000786988,0.000109397086,0.0003429429,0.00011936103,0.000046610236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013366564,0.000091319154,0.00012431364,0.000031545107,0.00026845757,0.000019388457,0.00019599301,0.000035389858,0.00006596531],"category_scores_gemma":[0.000045375353,0.000063621555,0.000072032344,0.00023762012,0.00009551367,0.0000611049,0.000026391395,0.00006334291,0.000029015737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002934447,0.000062865074,0.000025806004,0.000046376816,0.000022345304,6.964153e-9,0.0001231399,0.0000025058687,0.0015777209,0.9958151,0.0009941204,0.0013270564],"study_design_scores_gemma":[0.00024914482,0.000015680771,0.00014636827,0.000008519872,0.00006901226,0.00000184747,0.00026741068,0.0016449158,0.0019883774,0.95422894,0.04128619,0.00009360564],"about_ca_topic_score_codex":0.000008692384,"about_ca_topic_score_gemma":0.000012593523,"teacher_disagreement_score":0.81970847,"about_ca_system_score_codex":0.0000028176248,"about_ca_system_score_gemma":0.0000103046095,"threshold_uncertainty_score":0.25944117},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9481041,0.00032379082,0.019784058,0.0014210101,0.000028845616,0.0011858909,0.000086605214,0.00038317157,0.028682536],"genre_scores_gemma":[0.9945898,0.000029931138,0.0030533778,0.00018396792,0.000100467514,0.0004542295,0.00004404011,0.00002357296,0.0015206038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927485,0.000022532326,0.00019970276,0.00024664108,0.000101638805,0.0001546343],"domain_scores_gemma":[0.9992188,0.00025710565,0.00006441747,0.00034609137,0.000051228584,0.00006235006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011183378,0.00012373773,0.00011973625,0.00008010246,0.00028865875,0.00002159906,0.00013420229,0.00006692697,0.000070653434],"category_scores_gemma":[0.000023962979,0.00011191624,0.000055013807,0.00031619807,0.000055946344,0.000047171055,0.000025226971,0.00011094058,0.00014816633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026758316,0.00015945664,0.00002466728,0.000014374403,0.000008099279,1.9005958e-7,0.000017710101,0.000004834005,0.0014096574,0.99622697,0.0016098316,0.00052155],"study_design_scores_gemma":[0.00015926553,0.000019112762,0.00030816274,0.0000066749562,0.000026571995,0.0000033301428,0.000019396573,0.00028446282,0.002770863,0.9655229,0.030752366,0.00012691057],"about_ca_topic_score_codex":0.000004470693,"about_ca_topic_score_gemma":0.0000044879757,"teacher_disagreement_score":0.046485715,"about_ca_system_score_codex":0.0000057156594,"about_ca_system_score_gemma":0.000008509021,"threshold_uncertainty_score":0.45638117},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92102027,0.00044554117,0.07329009,0.00006199996,0.000009441439,0.00032045727,0.00004467825,0.000049848335,0.0047576725],"genre_scores_gemma":[0.981429,0.000091427166,0.018085562,0.000025647076,0.000023149962,0.000098872224,0.000014342558,0.00002213314,0.00020986202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987362,0.000043332686,0.00048702015,0.00023165416,0.00018960111,0.00031216792],"domain_scores_gemma":[0.9984765,0.00046153538,0.00027856475,0.0005312531,0.000056021723,0.00019613378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006748852,0.00021358106,0.00063681573,0.00022754907,0.00016241246,0.000041088144,0.00015021907,0.00009573312,0.00007779034],"category_scores_gemma":[0.00004894522,0.00016966258,0.00018478205,0.0009651689,0.00021958096,0.00014175124,0.00010536003,0.00008532006,0.0000058478035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053934837,0.00023687702,0.012251461,0.00029654056,0.00048507925,2.0477012e-7,0.00096004293,0.0000025307363,0.0023941437,0.98274195,0.00008920364,0.000536556],"study_design_scores_gemma":[0.00028363516,0.000026429878,0.002386177,0.00004127809,0.003263626,0.000006947334,0.0017997106,0.0013978059,0.0097094225,0.98004913,0.00068702776,0.00034881706],"about_ca_topic_score_codex":0.000024724317,"about_ca_topic_score_gemma":0.000017274322,"teacher_disagreement_score":0.060408726,"about_ca_system_score_codex":0.000005010747,"about_ca_system_score_gemma":0.000006211345,"threshold_uncertainty_score":0.69186395},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95036787,0.0022455954,0.039660584,0.0018345283,0.00003496675,0.0012579458,0.000060164748,0.00018276782,0.0043555843],"genre_scores_gemma":[0.9951526,0.0005114885,0.0028257938,0.00028544653,0.00006381821,0.00034642423,0.0000117259115,0.000021884707,0.0007808462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999129,0.000056650413,0.00024817264,0.00030249462,0.00007988,0.00018378334],"domain_scores_gemma":[0.99897575,0.0005655031,0.00006635233,0.00028253003,0.00002274765,0.000087101966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021018907,0.0001441912,0.00017260324,0.00012692949,0.00019042066,0.00004824528,0.0001367827,0.00007167069,0.00005316244],"category_scores_gemma":[0.00003812488,0.00013256018,0.000040818228,0.00036559135,0.00012228914,0.00018147704,0.000065122294,0.00014980636,0.000033388904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029360053,0.00013191089,0.00016661973,0.00003392918,0.000013892336,4.3512418e-7,0.00036124943,0.0000011637259,0.0003167728,0.99467486,0.00028518858,0.004011054],"study_design_scores_gemma":[0.00032150952,0.000018036035,0.0009920358,0.00002086165,0.000029395887,0.000012683958,0.00016747593,0.0012488785,0.00028251993,0.9920414,0.004684373,0.00018080493],"about_ca_topic_score_codex":0.0000017600862,"about_ca_topic_score_gemma":0.0000058711116,"teacher_disagreement_score":0.044784706,"about_ca_system_score_codex":0.0000060746993,"about_ca_system_score_gemma":0.000004156913,"threshold_uncertainty_score":0.5405647},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9880353,0.0007127175,0.0048209275,0.0023828177,0.0000221365,0.0012114953,0.000056464258,0.00013403513,0.0026241043],"genre_scores_gemma":[0.99472404,0.00083000684,0.0016120849,0.0008290239,0.00008312039,0.0007940132,0.000016929958,0.000031843538,0.0010789455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895096,0.000075852935,0.00028791404,0.00033258344,0.00013645053,0.0002162532],"domain_scores_gemma":[0.99781185,0.0013486103,0.000107971384,0.0005672988,0.000042431802,0.0001218614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022124128,0.00018617521,0.00019956552,0.00008490485,0.0007612076,0.00002994592,0.00022797083,0.000090480185,0.000044627363],"category_scores_gemma":[0.000099720615,0.00013075264,0.00007551026,0.0003655117,0.000252513,0.00007717793,0.000054773718,0.00020142496,0.0000822711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065434906,0.00013794143,0.00006224587,0.000016055807,0.000031474363,4.1664765e-7,0.00048345744,4.5995725e-7,0.0015121188,0.9943163,0.0012080009,0.002225004],"study_design_scores_gemma":[0.0004692691,0.000054000968,0.0010879894,0.000016607133,0.00008025855,0.000033081073,0.00014643256,0.00037864954,0.0023020194,0.973887,0.021306168,0.00023850522],"about_ca_topic_score_codex":0.0000026696596,"about_ca_topic_score_gemma":0.000003642529,"teacher_disagreement_score":0.020429263,"about_ca_system_score_codex":0.00000489115,"about_ca_system_score_gemma":0.000013582828,"threshold_uncertainty_score":0.58546704},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97100645,0.000009552184,0.026356552,0.00010611983,0.000017863034,0.0003737729,0.00014612966,0.00004145301,0.0019420921],"genre_scores_gemma":[0.95655125,0.000016889036,0.043092206,0.000019093724,0.000022007534,0.00003403761,0.00006281163,0.000023015346,0.00017866668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988235,0.000031033534,0.00068132416,0.000116832976,0.00020715698,0.0001401574],"domain_scores_gemma":[0.99874836,0.00015837583,0.000526975,0.00043189907,0.000093668,0.00004070704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027117113,0.00012991256,0.00032968598,0.000099742145,0.000045220768,0.000006320107,0.0002065701,0.000047719142,0.00016015445],"category_scores_gemma":[0.00008095272,0.00011270984,0.00012230595,0.00025561368,0.00008918599,0.000079216086,0.000046914225,0.000060357368,0.000011710927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005487243,0.0002856531,0.00011175595,0.0003603016,0.000046248195,8.831285e-8,0.0015416223,0.0000022696815,0.114091225,0.88297874,0.00003001405,0.0005466062],"study_design_scores_gemma":[0.00039600016,0.000053232085,0.00033549438,0.00017001657,0.000109720066,0.0000026351524,0.00029235496,0.0017758847,0.12867756,0.86752015,0.00051374687,0.00015319558],"about_ca_topic_score_codex":0.0000011930106,"about_ca_topic_score_gemma":0.0000036817955,"teacher_disagreement_score":0.016735654,"about_ca_system_score_codex":0.000009611322,"about_ca_system_score_gemma":0.000012124134,"threshold_uncertainty_score":0.45961738},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19650862,0.0011756539,0.09301895,0.38564235,0.000499178,0.008471522,0.00030397598,0.0007973302,0.31358242],"genre_scores_gemma":[0.96112436,0.000010337575,0.024256459,0.002761785,0.00025558725,0.00034474224,0.00001225253,0.000059707687,0.011174743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986261,0.00006212919,0.00035192346,0.00023319716,0.00015728803,0.00056933507],"domain_scores_gemma":[0.9973594,0.0014174118,0.000077855846,0.00061072264,0.00009857448,0.00043603423],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00092874584,0.00018242386,0.00026025265,0.00006215551,0.00070701964,0.00011884874,0.00039773222,0.000107363136,0.0009378788],"category_scores_gemma":[0.0015574069,0.00013324367,0.00020746887,0.00014313062,0.00013648781,0.000017046996,0.000010825956,0.00015046727,0.0012581206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000509405,0.000027641216,0.0000011021425,0.000025355224,0.000017328824,0.0000030612778,0.000104164516,4.7225237e-7,0.0000678296,0.90937,0.08832353,0.002054434],"study_design_scores_gemma":[0.00011007423,0.000027923776,0.000011793971,0.000028070923,0.000033879453,0.000012684233,0.00009381192,0.00005123048,0.00018002588,0.6701313,0.32919917,0.00012001532],"about_ca_topic_score_codex":0.00003126892,"about_ca_topic_score_gemma":0.00015879342,"teacher_disagreement_score":0.7646158,"about_ca_system_score_codex":0.000074110045,"about_ca_system_score_gemma":0.00009925563,"threshold_uncertainty_score":0.9999754},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89363587,0.0027490107,0.004796771,0.0015745566,0.0026619965,0.00051376806,0.0029837228,0.0011928205,0.089891486],"genre_scores_gemma":[0.96960926,0.0027655447,0.013178967,0.0024862995,0.0027980204,0.0032594348,0.0031095927,0.0021710908,0.0006218012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9760638,0.0012007535,0.00625522,0.0046593896,0.005720107,0.006100724],"domain_scores_gemma":[0.9803551,0.00462032,0.005810221,0.005754959,0.00062433357,0.0028351],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.005528894,0.0033019695,0.0017775595,0.0017261006,0.00425829,0.003701576,0.006066701,0.005416116,0.016738342],"category_scores_gemma":[0.0038881297,0.005240978,0.005322746,0.003683086,0.0039625913,0.002849236,0.0035545144,0.004837895,0.004863516],"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.0015574732,0.0022172632,0.000032265747,0.0042790473,0.0034128001,0.0015665441,0.008218858,0.0016998785,0.0060588922,0.90915734,0.059200704,0.0025989634],"study_design_scores_gemma":[0.007127541,0.003946078,0.00022744575,0.008111108,0.007939702,0.0049022385,0.012087888,0.24542594,0.6020605,0.08960916,0.010346189,0.008216202],"about_ca_topic_score_codex":0.0013785756,"about_ca_topic_score_gemma":0.001607479,"teacher_disagreement_score":0.81954813,"about_ca_system_score_codex":0.00011600787,"about_ca_system_score_gemma":0.0020642644,"threshold_uncertainty_score":0.999311},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9914821,0.00026946035,0.0013062798,0.0008574757,0.0015265938,0.00021420438,0.0000042684137,0.000017387054,0.0043222276],"genre_scores_gemma":[0.9990761,0.00010495656,0.0004163018,0.000041014257,0.0002646162,0.00000581503,2.9706013e-7,0.000014951727,0.00007592195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983262,0.00064263894,0.00055206654,0.00007731456,0.0002726316,0.00012915453],"domain_scores_gemma":[0.9966423,0.0021025478,0.00065961684,0.0002859043,0.00022958225,0.00008003805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003976072,0.00012631205,0.0004252801,0.00010189086,0.00016345698,0.00003110006,0.00035373276,0.00007866747,0.000044446308],"category_scores_gemma":[0.0012262099,0.000077163604,0.00018051053,0.00018584698,0.0008525321,0.00017825364,0.000055227483,0.00024673977,9.3517815e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008204805,0.000077717414,0.00020028115,0.00002944753,0.00009693144,7.7659485e-7,0.0011963017,6.6675557e-7,0.0002719083,0.99627006,0.00023906045,0.0007963784],"study_design_scores_gemma":[0.0019623903,0.00021188972,0.00018447121,0.00004176723,0.00010799347,0.000048648784,0.00081305014,0.000004293912,0.0036387476,0.9906126,0.0022925262,0.00008161134],"about_ca_topic_score_codex":0.0000019822014,"about_ca_topic_score_gemma":0.0000015785229,"teacher_disagreement_score":0.0075940224,"about_ca_system_score_codex":0.0000070126157,"about_ca_system_score_gemma":0.000030023473,"threshold_uncertainty_score":0.31466404},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6125688,0.00084157655,0.13333799,0.014666414,0.0011632948,0.0038006015,0.00008021008,0.0024660358,0.23107506],"genre_scores_gemma":[0.9087009,0.00001758896,0.089307055,0.00024525577,0.00011034802,0.00036842067,0.000009290953,0.000056277415,0.0011848718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691886,0.00013943134,0.00079480116,0.0006882674,0.0007001463,0.0007584994],"domain_scores_gemma":[0.99752873,0.0006465395,0.00030777918,0.0010726652,0.0001692831,0.0002750268],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014878252,0.00037656486,0.0005206823,0.00030940698,0.0012146404,0.00020283552,0.00064788613,0.00011399224,0.00054639427],"category_scores_gemma":[0.0006243808,0.00033283787,0.00034245595,0.0011678846,0.00041833599,0.00033409716,0.00031668198,0.0003152856,0.0008757733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063230573,0.0006782356,0.000103667284,0.00010129911,0.00010401004,0.0000028677791,0.003805465,0.000009030514,0.0016719298,0.97761345,0.013805877,0.002097849],"study_design_scores_gemma":[0.00045187213,0.000053349406,0.00020501814,0.000118429234,0.00019108462,0.000019451893,0.0010226716,0.00094656995,0.0021579082,0.98386663,0.0105262,0.00044081276],"about_ca_topic_score_codex":0.0000060276952,"about_ca_topic_score_gemma":0.000056209647,"teacher_disagreement_score":0.2961321,"about_ca_system_score_codex":0.000086012195,"about_ca_system_score_gemma":0.000086180386,"threshold_uncertainty_score":0.9999124},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9943391,0.00017990034,0.0021934137,0.00060993806,0.00046588993,0.00008918847,0.0000023360783,0.000019707153,0.0021005245],"genre_scores_gemma":[0.99788976,0.00006412866,0.0018279206,0.00004072711,0.00006348917,0.0000024352037,4.957258e-7,0.000017370474,0.00009369404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998597,0.00012456556,0.00066747545,0.000085260144,0.00036681027,0.00015888785],"domain_scores_gemma":[0.99774134,0.0007327387,0.00075697,0.00030250635,0.00033014853,0.00013629242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012759115,0.00011721865,0.00035794993,0.00023517954,0.00007182131,0.000014013212,0.00035601069,0.000074609365,0.000052695053],"category_scores_gemma":[0.00070998643,0.00009675197,0.00022638655,0.00047747832,0.00010290522,0.000110849396,0.000035438887,0.00022099602,0.0000068375844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010861976,0.00024917108,0.0009867768,0.00004945195,0.000055859793,0.0000016492606,0.00035239905,0.000001441357,0.00097394676,0.99476415,0.0017032482,0.0008510599],"study_design_scores_gemma":[0.00047573922,0.0002249909,0.0008984094,0.000052937903,0.000085328735,0.000028064065,0.00009494095,0.000031274445,0.006231982,0.98796743,0.0038152316,0.00009366606],"about_ca_topic_score_codex":0.0000016177291,"about_ca_topic_score_gemma":0.0000015468852,"teacher_disagreement_score":0.0067966986,"about_ca_system_score_codex":0.000017930744,"about_ca_system_score_gemma":0.000045123976,"threshold_uncertainty_score":0.3945431},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98610026,0.0000017530418,0.0027175436,0.0007182474,0.00006021717,0.00011480568,0.00000646647,0.00011597177,0.010164746],"genre_scores_gemma":[0.9960955,5.7929276e-7,0.0033146515,0.00018463908,0.00009697201,0.000017899587,0.0000022214685,0.000007824636,0.00027970897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995646,0.000022040535,0.000100408935,0.0001280706,0.000054276483,0.00013061475],"domain_scores_gemma":[0.9989277,0.00072847767,0.000013798294,0.00023586034,0.000022563629,0.00007160433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024258613,0.000065407046,0.00009383461,0.000010886472,0.0001256219,0.000019274898,0.00006979002,0.000060349583,0.000301424],"category_scores_gemma":[0.00009294012,0.00005182155,0.000026585638,0.00006742867,0.00008325846,0.00002404167,0.00001756168,0.00015753448,0.000024375971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026834584,0.000056167828,0.000095682946,0.000011133035,0.0000041231538,2.7784506e-7,0.000027118378,0.0000015520036,0.000046696583,0.9959444,0.002626314,0.0011838974],"study_design_scores_gemma":[0.00008905049,0.000013244156,0.0010690354,0.0000054374723,0.000013458154,0.0000021563096,0.000033736305,0.00016636125,0.00018370534,0.99710935,0.0012394876,0.00007494992],"about_ca_topic_score_codex":9.864615e-7,"about_ca_topic_score_gemma":0.00003100622,"teacher_disagreement_score":0.009995255,"about_ca_system_score_codex":0.0000012833933,"about_ca_system_score_gemma":0.0000040239,"threshold_uncertainty_score":0.33003816},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98133624,0.00036716336,0.009981953,0.0010444126,0.0000129026985,0.00092871126,0.000054743283,0.00019461692,0.0060792775],"genre_scores_gemma":[0.9974553,0.00012116404,0.001232831,0.0002760439,0.0000307735,0.0004220071,0.000009315188,0.000025050467,0.00042751717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991479,0.000036429796,0.00016736185,0.0003449645,0.000118247786,0.00018512279],"domain_scores_gemma":[0.9987269,0.00068455504,0.00007355521,0.00033187153,0.000050379276,0.00013275101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011942057,0.00016794843,0.0001772099,0.00008002886,0.00037381717,0.00003373818,0.00010536589,0.00007391673,0.00013617231],"category_scores_gemma":[0.000056524314,0.00013646703,0.000032898515,0.00030379393,0.00012647046,0.00008858028,0.000033441196,0.00016231804,0.000078791476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000842142,0.00020202217,0.000057931356,0.000027580265,0.000027738299,4.0315172e-7,0.00018057987,9.0106437e-7,0.0003491025,0.99583626,0.00054165,0.0027673983],"study_design_scores_gemma":[0.00050017406,0.00013368495,0.00041669086,0.000020030722,0.000064768756,0.000022141305,0.00007864824,0.0014498986,0.00089411053,0.9910335,0.0051565776,0.00022978897],"about_ca_topic_score_codex":0.0000018707383,"about_ca_topic_score_gemma":0.000007571666,"teacher_disagreement_score":0.016119078,"about_ca_system_score_codex":0.0000057540224,"about_ca_system_score_gemma":0.0000055210153,"threshold_uncertainty_score":0.5564964},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97802734,0.00018573584,0.0017798888,0.00024328279,0.00025394163,0.00013502964,0.0000015986675,0.000022492453,0.019350672],"genre_scores_gemma":[0.99826527,0.000070731854,0.0011441434,0.00007407262,0.000040279716,0.0000021135158,4.6750614e-7,0.000030263747,0.00037266806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985143,0.0004096615,0.0005641244,0.00008870545,0.00021305794,0.00021014233],"domain_scores_gemma":[0.99892724,0.00017014805,0.00035917194,0.00024884223,0.00018010623,0.000114506714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016230287,0.000117386575,0.00021532354,0.00020862694,0.00007241086,0.000043187523,0.00038592715,0.000021305379,0.00014192756],"category_scores_gemma":[0.00019335886,0.00009964556,0.00012413083,0.00036768024,0.000036500514,0.00018449077,0.000054218573,0.0003243432,0.00017300237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050495146,0.00037414194,0.002708666,0.000014869853,0.00001725276,0.000057686575,0.0003721666,0.0000015815411,0.00019909932,0.9892684,0.0066281017,0.00035294742],"study_design_scores_gemma":[0.00079626,0.00010675871,0.0151028475,0.00005245152,0.000019158553,0.000045247907,0.0002505297,0.000019705605,0.00021276511,0.9760876,0.0071931174,0.00011351449],"about_ca_topic_score_codex":6.132306e-7,"about_ca_topic_score_gemma":3.2848848e-7,"teacher_disagreement_score":0.020237902,"about_ca_system_score_codex":0.00002149436,"about_ca_system_score_gemma":0.000016542963,"threshold_uncertainty_score":0.4063428},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9962069,0.000020457142,0.0014421581,0.0011378735,0.0000400581,0.00047512984,0.000033267526,0.00008695525,0.0005571925],"genre_scores_gemma":[0.98462015,0.0000121165995,0.014621854,0.00040146147,0.00004233008,0.000083322964,0.00001525299,0.000022774451,0.00018073892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991144,0.00003441862,0.00024502314,0.000290049,0.00011468642,0.00020142125],"domain_scores_gemma":[0.9993469,0.0001330579,0.00002812815,0.0003085481,0.000059532817,0.00012384592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018253548,0.00015413103,0.00019547742,0.0001685172,0.00014196096,0.000029928146,0.00012307138,0.00008287384,0.000038567337],"category_scores_gemma":[0.0002953936,0.00013555391,0.00004783033,0.00044455004,0.000036006488,0.00006243095,0.000038022037,0.0001790381,0.00010504832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047139518,0.00046243795,0.00045499482,0.000021170823,0.000015436588,0.00000416842,0.0014036796,0.0021242506,0.0014970128,0.9933607,0.00008989659,0.00051912834],"study_design_scores_gemma":[0.0029396743,0.00020845409,0.009095043,0.00018961898,0.000037050882,0.000010676771,0.0008007994,0.0041350042,0.011523787,0.9693653,0.0011911299,0.00050347537],"about_ca_topic_score_codex":0.000052029405,"about_ca_topic_score_gemma":0.0021816606,"teacher_disagreement_score":0.023995398,"about_ca_system_score_codex":0.0000141561995,"about_ca_system_score_gemma":0.000022175915,"threshold_uncertainty_score":0.5527728},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99079454,0.00033956766,0.0029393064,0.003119653,0.00003176806,0.0011928406,0.00012981637,0.00009732538,0.0013551723],"genre_scores_gemma":[0.991352,0.00007001517,0.0077531585,0.00009140361,0.000026215801,0.00014533947,0.000005196392,0.00003798453,0.00051864696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879014,0.00008056891,0.00039514914,0.00028553038,0.00018629502,0.00026230662],"domain_scores_gemma":[0.9985912,0.00023689448,0.0003526375,0.00057876646,0.0001443689,0.00009612202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029467753,0.00018840397,0.00040046152,0.00006723432,0.00020999975,0.00005066294,0.0003115256,0.000052166815,0.000036023936],"category_scores_gemma":[0.0003399648,0.00013692894,0.00015022105,0.00057984336,0.00027982856,0.000072759976,0.00008279443,0.00009229356,0.000011985489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029571169,0.00017901008,0.0007854034,0.00074658915,0.000094457835,4.1996475e-7,0.00039175327,0.0000068040495,0.0065128743,0.9895581,0.0015011844,0.00019382036],"study_design_scores_gemma":[0.00091145065,0.00017955725,0.0087511055,0.0007235503,0.0003965836,0.000025151152,0.00066028227,0.00014915223,0.009051192,0.97764313,0.0010326238,0.0004761998],"about_ca_topic_score_codex":0.00003366766,"about_ca_topic_score_gemma":0.0000033000165,"teacher_disagreement_score":0.01191496,"about_ca_system_score_codex":0.000024126346,"about_ca_system_score_gemma":0.000050326413,"threshold_uncertainty_score":0.55838},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75251406,0.000048205584,0.21144564,0.0006274105,0.0000987994,0.0008783054,0.00022447752,0.00030730225,0.033855774],"genre_scores_gemma":[0.9125691,0.0000069406406,0.08687901,0.000045680626,0.00006108793,0.000062689935,0.00007781477,0.000031510164,0.00026615942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988002,0.000050172188,0.00053639925,0.00016929331,0.0002395337,0.00020437007],"domain_scores_gemma":[0.99875075,0.00029617766,0.00031050824,0.00047087707,0.00010097193,0.00007071171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036360946,0.00018286347,0.00032162937,0.00012753923,0.000115436655,0.00001906285,0.00023572132,0.00008922057,0.00039047076],"category_scores_gemma":[0.00012104979,0.00015809527,0.000186712,0.00026818615,0.0001538825,0.00013012801,0.000042674004,0.00014461025,0.00008325446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007310928,0.0002599317,0.000032404572,0.00016911149,0.000032690918,2.972021e-7,0.0012832612,0.0000038007288,0.0026113945,0.9920799,0.0019954247,0.0015244485],"study_design_scores_gemma":[0.000261869,0.000041947795,0.00011385727,0.00011389198,0.000080198864,0.000012573601,0.00055631844,0.002413475,0.0075698094,0.9864716,0.0021780932,0.00018635848],"about_ca_topic_score_codex":0.0000026334017,"about_ca_topic_score_gemma":0.00001722498,"teacher_disagreement_score":0.16005503,"about_ca_system_score_codex":0.000024179113,"about_ca_system_score_gemma":0.000011036659,"threshold_uncertainty_score":0.64469373},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9489784,0.00058156316,0.04487905,0.0018919106,0.000050019826,0.0021802222,0.00021364982,0.00008182232,0.0011433328],"genre_scores_gemma":[0.9964525,0.00006353772,0.0024059957,0.000110058165,0.00006780555,0.0007120042,0.000010726058,0.00001413739,0.00016324742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948007,0.000011402955,0.00017931496,0.00015957757,0.00006183026,0.00010778035],"domain_scores_gemma":[0.99860233,0.00088758493,0.00009288014,0.0002789891,0.000085320964,0.000052902225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001984255,0.000093654075,0.00012502745,0.000043186188,0.00034915324,0.00002494881,0.0001483337,0.000079490135,0.000019634354],"category_scores_gemma":[0.000068236914,0.00006550728,0.00004464577,0.00015773014,0.00020135433,0.00003694899,0.000032227763,0.00013542676,0.0000016934107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006564256,0.000046187284,0.00015502596,0.000044422846,0.000024927476,1.224358e-8,0.00020820752,3.6843423e-7,0.0066412776,0.9899953,0.0002140036,0.0026636969],"study_design_scores_gemma":[0.00024750637,0.000020241967,0.0011452504,0.0000047533704,0.00007293716,0.000005065193,0.00019333343,0.00083808,0.005507178,0.95950955,0.032360062,0.000096032214],"about_ca_topic_score_codex":0.0000037961233,"about_ca_topic_score_gemma":0.00004202417,"teacher_disagreement_score":0.047474056,"about_ca_system_score_codex":9.579975e-7,"about_ca_system_score_gemma":0.000015017794,"threshold_uncertainty_score":0.26854396},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8473841,0.0014170815,0.0047019534,0.0063925884,0.0010459129,0.005154647,0.0006482899,0.0037484241,0.12950699],"genre_scores_gemma":[0.9565094,0.00012005903,0.03377404,0.00066670764,0.00018082395,0.0008100221,0.00012747665,0.00020298213,0.007608498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950127,0.00040437,0.0014920166,0.0009955373,0.0008170392,0.0012783528],"domain_scores_gemma":[0.99577963,0.000634017,0.0006447466,0.0021004786,0.0003417303,0.0004994062],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011874662,0.0008238186,0.0010973765,0.0005173532,0.0006602384,0.00052120193,0.0015251084,0.00032246308,0.0058120866],"category_scores_gemma":[0.00055143837,0.000730657,0.00060127873,0.0014875476,0.00038882782,0.0011058922,0.00028354477,0.00075852446,0.002498853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003077014,0.0004873846,0.000360443,0.00043231624,0.00018822664,0.000009548023,0.0005896805,0.0000031135532,0.0018237836,0.970639,0.02365334,0.0017823756],"study_design_scores_gemma":[0.0012542482,0.00017437813,0.0011651061,0.00019014126,0.00019318117,0.00018219886,0.0005650845,0.0015551368,0.0009930832,0.94397724,0.048604302,0.0011458934],"about_ca_topic_score_codex":0.000038645594,"about_ca_topic_score_gemma":0.000051074527,"teacher_disagreement_score":0.121898495,"about_ca_system_score_codex":0.00009831474,"about_ca_system_score_gemma":0.000028186645,"threshold_uncertainty_score":0.99951446},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98865086,0.0005888479,0.0091148745,0.00033948015,0.00011357264,0.000083047766,0.000009163145,0.000006654267,0.0010934863],"genre_scores_gemma":[0.9510042,0.00013625364,0.048645474,0.000014312226,0.00011269887,0.0000012067629,1.6650013e-7,0.000005826021,0.00007982889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949855,0.000030734416,0.00026984757,0.000041920313,0.00010711747,0.00005186361],"domain_scores_gemma":[0.99930257,0.00015484953,0.00029331472,0.000067972345,0.00014474244,0.000036567293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019030167,0.000049621012,0.00014777594,0.00007048688,0.00004200347,0.000009408009,0.000052920794,0.000032166685,0.00006978711],"category_scores_gemma":[0.00007125606,0.00003977074,0.000048701513,0.00008324373,0.0000730134,0.00009898776,0.000008999248,0.00008249567,0.0000012087945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035143607,0.00046323522,0.0010035753,0.00008975336,0.00025826466,0.000012452235,0.0055312826,0.000009280218,0.015080092,0.8953786,0.003373928,0.07876437],"study_design_scores_gemma":[0.0008278204,0.00025985978,0.0007936396,0.00006802083,0.00011740616,0.00047787593,0.001046924,0.0011381997,0.013453112,0.98050255,0.0012073667,0.00010721164],"about_ca_topic_score_codex":6.7327227e-7,"about_ca_topic_score_gemma":3.1650762e-7,"teacher_disagreement_score":0.08512394,"about_ca_system_score_codex":0.00000568025,"about_ca_system_score_gemma":0.0000061235014,"threshold_uncertainty_score":0.16218038},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9867264,0.00011078251,0.0031600269,0.00043716736,0.000027803579,0.00037785873,0.000012525773,0.00024991605,0.008897509],"genre_scores_gemma":[0.982273,0.000025667889,0.015629822,0.0000713076,0.0000269247,0.0000878026,0.000005707556,0.00003436608,0.0018453973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989739,0.000028319277,0.00031698224,0.00021604853,0.00017377512,0.0002909642],"domain_scores_gemma":[0.99882936,0.00049154373,0.00012859407,0.00040896944,0.000035446752,0.00010607884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024103881,0.00017815405,0.00029998875,0.00009591732,0.00034485274,0.000022350097,0.00016748213,0.000081898645,0.00010046708],"category_scores_gemma":[0.00011875553,0.00014626746,0.00009509535,0.00017951865,0.00017649417,0.00012086605,0.00007924074,0.000116422394,0.000072762836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002538774,0.00008892668,0.004175611,0.00012152949,0.000045953613,0.0000025157794,0.0013719215,5.5322968e-8,0.0003667682,0.9861428,0.007496979,0.00018440814],"study_design_scores_gemma":[0.00024476057,0.000027933682,0.0013386869,0.000050002403,0.000046975394,0.00006535792,0.00045090716,0.000010779887,0.0033628645,0.99293554,0.0012829266,0.00018323766],"about_ca_topic_score_codex":0.0000020225102,"about_ca_topic_score_gemma":0.0000013823815,"teacher_disagreement_score":0.012469796,"about_ca_system_score_codex":0.000007882421,"about_ca_system_score_gemma":0.000014851821,"threshold_uncertainty_score":0.59646136},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98556215,0.0004951652,0.009443598,0.0004064473,0.00001561733,0.0007395181,0.00006721302,0.000031691117,0.003238627],"genre_scores_gemma":[0.99696064,0.00006346708,0.0026798618,0.000029887997,0.000019313235,0.000076977376,0.000002589822,0.000007243913,0.00015999094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995648,0.000022444548,0.00018366273,0.00010805411,0.000054919197,0.00006609815],"domain_scores_gemma":[0.99943167,0.000108131964,0.0001278594,0.0002457563,0.000056361598,0.000030236528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010445897,0.00006353708,0.00010714529,0.000025009036,0.00010835372,0.0000024085352,0.000107417785,0.00005363568,0.000032017462],"category_scores_gemma":[0.000032568434,0.00004471563,0.000034482193,0.00016327824,0.00014437657,0.0000308683,0.00005053035,0.000065899854,0.000002165126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028795637,0.00007058988,0.0002452149,0.00005463295,0.000013672735,8.760504e-9,0.00062475906,1.1759637e-7,0.0062189023,0.9918859,0.00008213407,0.000801167],"study_design_scores_gemma":[0.00019254177,0.000030150319,0.0051462976,0.00002267924,0.00008838394,0.0000063400344,0.00018715783,0.00020785608,0.058044225,0.9333798,0.0026099943,0.000084539206],"about_ca_topic_score_codex":0.000006817126,"about_ca_topic_score_gemma":0.00000563949,"teacher_disagreement_score":0.058506086,"about_ca_system_score_codex":0.0000015246665,"about_ca_system_score_gemma":0.0000116209685,"threshold_uncertainty_score":0.18234505},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9952533,0.000197069,0.0007929094,0.00010079304,0.00052505813,0.00011299843,0.000010431756,0.000007858578,0.0029995623],"genre_scores_gemma":[0.99633044,0.00007914827,0.0034886643,0.000011235045,0.000033864966,0.0000030419378,4.4482502e-7,0.000012044336,0.000041136936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987334,0.000317015,0.00063568476,0.00006465477,0.00015091452,0.00009833841],"domain_scores_gemma":[0.9980844,0.0006867135,0.0006598498,0.00019179485,0.00030569045,0.0000715142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001168097,0.00010394912,0.00036860965,0.00015777476,0.000076553784,0.000009494819,0.00014439282,0.000071504655,0.00006432772],"category_scores_gemma":[0.00051755906,0.000086429005,0.0001508378,0.00024409484,0.000268869,0.00017917607,0.000020584304,0.00015636205,3.065783e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022188043,0.0002907278,0.00021591477,0.000052541774,0.00009381275,0.0000015991715,0.0004282584,0.0000015059134,0.021514373,0.97699946,0.00013204424,0.000047867314],"study_design_scores_gemma":[0.0006830707,0.00034504166,0.00015529752,0.00006555557,0.00009008112,0.00008155728,0.00039246905,2.804681e-7,0.09697126,0.90009695,0.0010495263,0.0000689222],"about_ca_topic_score_codex":7.101811e-7,"about_ca_topic_score_gemma":6.2719545e-7,"teacher_disagreement_score":0.07690253,"about_ca_system_score_codex":0.000008085489,"about_ca_system_score_gemma":0.00006038129,"threshold_uncertainty_score":0.35244724},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63984615,0.00023801881,0.06727857,0.0003373685,0.00009393965,0.001347303,0.00009087326,0.0005115406,0.2902562],"genre_scores_gemma":[0.8954109,0.000051779956,0.10343189,0.000048825445,0.00003967605,0.00015224084,0.000009154254,0.000059588026,0.0007959283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870086,0.000019284138,0.0005459803,0.000217505,0.00026291225,0.00025344052],"domain_scores_gemma":[0.9983417,0.00045022916,0.00029575717,0.00077134155,0.000060698476,0.0000802902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029543828,0.0002198189,0.00040452753,0.00009475268,0.00014289132,0.000027712467,0.00035846725,0.00010503027,0.00048890914],"category_scores_gemma":[0.00007075637,0.00019070225,0.00012973456,0.00032538912,0.00023498668,0.000060680482,0.00008038726,0.00013028158,0.00009049289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003995352,0.00027758634,0.000007669897,0.0003860083,0.000042749867,8.303926e-7,0.0016458519,0.000002306782,0.013352107,0.9821948,0.0010905993,0.0009955242],"study_design_scores_gemma":[0.00026006543,0.000017177208,0.000014300096,0.000052179694,0.00008148802,0.0000080376085,0.0008308739,0.00042342447,0.021595621,0.9744513,0.0020405937,0.0002249608],"about_ca_topic_score_codex":0.0000010927602,"about_ca_topic_score_gemma":0.0000016539932,"teacher_disagreement_score":0.2894603,"about_ca_system_score_codex":0.000013936055,"about_ca_system_score_gemma":0.000010467007,"threshold_uncertainty_score":0.7776612},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9818334,0.00031776767,0.0030048194,0.003963041,0.00000799779,0.0015219043,0.00008484262,0.00020035928,0.009065842],"genre_scores_gemma":[0.991678,0.00022131798,0.0030247956,0.00088105415,0.000071211856,0.0013194556,0.000026238353,0.000035165493,0.002742749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991413,0.00004088629,0.00019605996,0.000277946,0.00013291978,0.00021090842],"domain_scores_gemma":[0.9989608,0.00031201472,0.00007223482,0.0004985184,0.000056373745,0.00010007995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014432466,0.00016372968,0.00015939912,0.00004972704,0.0006237937,0.000042895645,0.00026253337,0.00005328407,0.00033801497],"category_scores_gemma":[0.00000962949,0.00010190759,0.00006498607,0.00046171364,0.00019268744,0.00006866052,0.000025201523,0.00015878012,0.00023008694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013373527,0.000089967354,0.00002231487,0.000016773914,0.000028604927,5.5719454e-7,0.00031160942,0.0000017090233,0.0005778025,0.99218714,0.00052077894,0.006229371],"study_design_scores_gemma":[0.0002860788,0.000065809225,0.00043030968,0.000015285452,0.00010388653,0.00006422223,0.0002142292,0.0002457743,0.0005906775,0.85850644,0.13926741,0.00020985595],"about_ca_topic_score_codex":0.000009010834,"about_ca_topic_score_gemma":0.0000246868,"teacher_disagreement_score":0.13874665,"about_ca_system_score_codex":0.0000036478152,"about_ca_system_score_gemma":0.000016702073,"threshold_uncertainty_score":0.479778},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87521976,0.001107236,0.06687058,0.004946697,0.0006079483,0.004558371,0.00063759764,0.0004675645,0.045584247],"genre_scores_gemma":[0.9574755,0.00012078843,0.039056875,0.00005027444,0.00008612033,0.00033544475,0.000008897374,0.0000625909,0.0028035264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988296,0.000033499124,0.00051221345,0.00015593854,0.00019621935,0.0002725206],"domain_scores_gemma":[0.99698025,0.0019095679,0.00032231104,0.0006371331,0.00009177941,0.00005898014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042951966,0.00017223285,0.0002875434,0.000056875255,0.0003455317,0.000043715365,0.00040907506,0.00007409987,0.0000712305],"category_scores_gemma":[0.0004057078,0.000114370065,0.00025533125,0.00020723612,0.0002768336,0.000059482558,0.00004922765,0.00009764188,0.000021309674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072578696,0.00012743814,0.000011363802,0.00014665174,0.00007011683,2.2028847e-7,0.0009104667,7.5129685e-7,0.0009239194,0.97995573,0.017410377,0.00043570864],"study_design_scores_gemma":[0.00034926995,0.00005271947,0.000012781146,0.0000446159,0.00010601692,0.0000063387834,0.0007357449,0.0017272756,0.003619015,0.9820374,0.01115193,0.00015687748],"about_ca_topic_score_codex":0.0000010034938,"about_ca_topic_score_gemma":0.0000054313623,"teacher_disagreement_score":0.08225571,"about_ca_system_score_codex":0.000009954093,"about_ca_system_score_gemma":0.000008363677,"threshold_uncertainty_score":0.46638757},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9228799,0.00012140152,0.007835014,0.0007712732,0.00021640581,0.000115660194,0.0000074160935,0.000019175484,0.0680338],"genre_scores_gemma":[0.9949475,0.000014548583,0.0038391685,0.00009581531,0.00016162453,0.0000024003705,2.0935644e-7,0.000015240466,0.00092348247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989843,0.00029183633,0.00038375927,0.00007449439,0.00016979274,0.00009584175],"domain_scores_gemma":[0.99700683,0.002182742,0.0004344241,0.00020733787,0.00009386512,0.000074776806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019830926,0.0000874646,0.00027424787,0.00006824912,0.000051799718,0.000007116287,0.00014973995,0.000057878948,0.00033153626],"category_scores_gemma":[0.0008693196,0.00006328484,0.00012638936,0.00008874706,0.0000824991,0.000051950443,0.000022196646,0.00019057967,0.000008671543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013979423,0.00015108126,0.00019995893,0.000031789426,0.000036127003,0.0000019773372,0.00036791316,4.865784e-7,0.00068821636,0.9874748,0.0071478435,0.0037599853],"study_design_scores_gemma":[0.0002881439,0.00010898577,0.00037298937,0.00010439449,0.000054199478,0.000107642336,0.00010157465,0.000004251625,0.00079845387,0.9808606,0.017134065,0.00006470997],"about_ca_topic_score_codex":5.052531e-7,"about_ca_topic_score_gemma":3.3093187e-7,"teacher_disagreement_score":0.072067656,"about_ca_system_score_codex":0.000038816223,"about_ca_system_score_gemma":0.000013309108,"threshold_uncertainty_score":0.36300898},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99648196,0.00059675175,0.000041184056,0.0001446811,0.00049753767,0.00012887822,0.000010354702,0.0000085398715,0.0020901212],"genre_scores_gemma":[0.998984,0.00056981674,0.0002763658,0.000015285863,0.000060375452,0.0000028507532,2.6723035e-7,0.0000124703065,0.00007856421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864346,0.00030523428,0.0005592103,0.00007118204,0.00030911263,0.00011182428],"domain_scores_gemma":[0.9958255,0.002772642,0.00084238517,0.00024068743,0.00026832247,0.000050407514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017066826,0.00011826565,0.00037221872,0.00023511049,0.00015950049,0.000009467258,0.0002999168,0.00006618621,0.00005065165],"category_scores_gemma":[0.0010144387,0.00007391548,0.00016589822,0.0005170728,0.00041507327,0.00014205146,0.000039285216,0.0001942671,7.798046e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041714608,0.00026731883,0.00042667222,0.000047970087,0.00010011911,0.0000032828382,0.0005300738,9.269247e-7,0.0007649731,0.99684846,0.00052463927,0.000068397196],"study_design_scores_gemma":[0.0004909744,0.0005330201,0.0005791791,0.000059293805,0.00007834933,0.00006836096,0.00046364425,5.5558877e-7,0.018685486,0.9785654,0.00040792604,0.00006783364],"about_ca_topic_score_codex":0.0000014607288,"about_ca_topic_score_gemma":1.7370367e-7,"teacher_disagreement_score":0.018283105,"about_ca_system_score_codex":0.000007717594,"about_ca_system_score_gemma":0.00004168467,"threshold_uncertainty_score":0.30141857},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94696414,0.005055892,0.04298107,0.0005403548,0.000037807007,0.0015599774,0.00030735182,0.0001250783,0.0024283181],"genre_scores_gemma":[0.9965568,0.0006254836,0.0019051833,0.00005835285,0.000044437507,0.00021845155,0.000045366865,0.000022415561,0.00052347634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988688,0.000070668815,0.0004420001,0.00022198352,0.00016276687,0.00023375057],"domain_scores_gemma":[0.99606895,0.0030461573,0.00021174832,0.00039933145,0.00017291537,0.00010088556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013767992,0.000133746,0.00018117414,0.00013266568,0.00042282257,0.000028560464,0.00029602938,0.000081823026,0.000012590192],"category_scores_gemma":[0.0002724455,0.00009799538,0.00007160094,0.0014148636,0.00013717818,0.000054918677,0.00005003939,0.00012320332,0.00001812476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022507409,0.00017188308,0.00050504203,0.000036442016,0.000043626012,7.930494e-8,0.000106331274,1.2085455e-7,0.0026445696,0.99073714,0.002430929,0.0033013525],"study_design_scores_gemma":[0.0007686998,0.00008046339,0.0073714666,0.0000227381,0.00017455287,0.000010130581,0.00051048555,0.00030044207,0.016452027,0.930431,0.043489266,0.00038869248],"about_ca_topic_score_codex":0.000019267118,"about_ca_topic_score_gemma":0.000051191753,"teacher_disagreement_score":0.060306083,"about_ca_system_score_codex":0.00000600762,"about_ca_system_score_gemma":0.000017156204,"threshold_uncertainty_score":0.39961353},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93181884,0.00025190235,0.0015005386,0.001189628,0.00006752989,0.00009915825,0.000095442585,0.00010370042,0.06487327],"genre_scores_gemma":[0.99589306,0.00025700036,0.0016652854,0.0008435067,0.0002504547,0.0007191264,0.000101643054,0.000066918015,0.00020300507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983587,0.000055444034,0.00046364096,0.00039613576,0.00036600657,0.00036002984],"domain_scores_gemma":[0.9978254,0.00066219806,0.00036900616,0.0009251019,0.00006236304,0.00015593928],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004482853,0.00020378522,0.0001271872,0.00009499371,0.00062161847,0.00012846514,0.00048379638,0.00029006874,0.0015714699],"category_scores_gemma":[0.00019660714,0.00023983709,0.00029104223,0.00044927894,0.00027763567,0.00016439856,0.0001369622,0.0003254139,0.00038815677],"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.000052268293,0.00022521548,0.000001935506,0.00009366763,0.00011797086,0.0000031919124,0.0005574027,0.000027915192,0.0025467249,0.9883587,0.007121332,0.0008936963],"study_design_scores_gemma":[0.001284934,0.00094845955,0.00035292603,0.00043819475,0.0009229539,0.00018305704,0.0014752724,0.13743785,0.5777402,0.2505932,0.027626729,0.000996255],"about_ca_topic_score_codex":0.000028830114,"about_ca_topic_score_gemma":0.00002740258,"teacher_disagreement_score":0.7377655,"about_ca_system_score_codex":0.0000027253107,"about_ca_system_score_gemma":0.00010079037,"threshold_uncertainty_score":0.99934125},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99267757,0.00006449862,0.00044315978,0.0025731116,0.000041210056,0.0009965836,0.00057704863,0.000026755724,0.002600092],"genre_scores_gemma":[0.99764466,0.000011287653,0.002050145,0.00003595335,0.00002289754,0.00001755966,0.0000096720405,0.00001611487,0.00019172985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980602,0.00022196765,0.00095208373,0.00015884938,0.00039511904,0.00021175783],"domain_scores_gemma":[0.99498034,0.0022074685,0.000996162,0.0015897192,0.0001912189,0.000035077384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011474894,0.00019275678,0.00046498672,0.00002477401,0.00024993843,0.000017930892,0.0009127954,0.00008910984,0.00007383538],"category_scores_gemma":[0.0007507584,0.00009019473,0.00030928495,0.00026393696,0.00058508746,0.000034706427,0.00010207793,0.00017630008,0.000002587824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041569547,0.00024048152,0.0004856679,0.00036075272,0.000120884615,1.08615446e-7,0.005369403,0.000019028303,0.011261784,0.9776661,0.004302255,0.00013201495],"study_design_scores_gemma":[0.0004066304,0.00010536261,0.008773052,0.0001790211,0.00025418124,0.000004255879,0.003793133,0.0006625374,0.036281522,0.9486419,0.00074978254,0.00014861973],"about_ca_topic_score_codex":0.00000968322,"about_ca_topic_score_gemma":0.000014514211,"teacher_disagreement_score":0.029024148,"about_ca_system_score_codex":0.000011545102,"about_ca_system_score_gemma":0.000040844774,"threshold_uncertainty_score":0.36780342},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96828187,0.0026885401,0.024673715,0.00044602755,0.00006516881,0.0014679851,0.0000780883,0.00007966772,0.002218957],"genre_scores_gemma":[0.99238527,0.00070381205,0.006541885,0.00003684461,0.000041030493,0.00004244551,0.000016842961,0.0000799044,0.0001519474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99554574,0.0002551683,0.0019429771,0.0005861706,0.0006324957,0.0010374434],"domain_scores_gemma":[0.9953274,0.0017191628,0.001260103,0.001349199,0.00018798346,0.000156122],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017001575,0.00066393014,0.0014736474,0.0005775193,0.00015609567,0.000050831404,0.00078147365,0.0004610046,0.00012410819],"category_scores_gemma":[0.0009096933,0.00063582696,0.00036164725,0.0012299657,0.0007010029,0.0001948201,0.00017524496,0.0009044903,0.000008398875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001388094,0.0014622834,0.0018433606,0.0016950145,0.0002501378,0.000002614865,0.0061106673,0.00007207365,0.006080598,0.9790674,0.000045557084,0.0032315236],"study_design_scores_gemma":[0.0015217332,0.00055952073,0.0018042695,0.0009545948,0.0003050914,0.0000217628,0.0010121472,0.0054601445,0.019266475,0.9685145,0.00002633564,0.0005534439],"about_ca_topic_score_codex":0.000021478467,"about_ca_topic_score_gemma":0.00007432753,"teacher_disagreement_score":0.024103438,"about_ca_system_score_codex":0.00010731522,"about_ca_system_score_gemma":0.00022587198,"threshold_uncertainty_score":0.9996093},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8108409,0.000013334986,0.0017314266,0.018987725,0.00008542499,0.00068688917,0.00010767881,0.00008127182,0.16746534],"genre_scores_gemma":[0.98542523,0.0000013870283,0.01260031,0.00059312553,0.000039372408,0.0000550106,0.000003201029,0.000020733423,0.0012616337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992525,0.000030200543,0.00024458393,0.00015923241,0.00010306348,0.00021042947],"domain_scores_gemma":[0.99844813,0.0007260854,0.00005879013,0.00039125732,0.000046428835,0.00032931176],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003184565,0.000111545654,0.00018395694,0.00009582621,0.00012053537,0.000019620798,0.00014065491,0.00010597742,0.0117485],"category_scores_gemma":[0.00084196695,0.00009796997,0.000051414758,0.00010263862,0.00015429393,0.000016001331,0.000016366053,0.00021661725,0.0010338924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020254479,0.000063703264,0.0000121729245,0.0000471709,0.000011816601,0.0000014282696,0.0001963193,1.09147635e-7,0.00090738025,0.9914988,0.006949183,0.0003098343],"study_design_scores_gemma":[0.00013555001,0.0000222255,0.00022217134,0.00003000563,0.000025161995,0.000012850767,0.000057270878,0.00003365255,0.0002906405,0.9497943,0.049269952,0.0001061993],"about_ca_topic_score_codex":0.00012787856,"about_ca_topic_score_gemma":0.0011444361,"teacher_disagreement_score":0.17458431,"about_ca_system_score_codex":0.000011713668,"about_ca_system_score_gemma":0.000060633858,"threshold_uncertainty_score":0.99974394},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89860564,0.00032210615,0.05375855,0.0007863577,0.000078160934,0.0012843204,0.0003696247,0.0001190059,0.044676214],"genre_scores_gemma":[0.9712452,0.00005627889,0.027699627,0.0000067439723,0.000008335295,0.000054438926,0.0000016779068,0.000021380443,0.0009062611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988649,0.00005013277,0.000546026,0.0001254805,0.00024052762,0.00017294579],"domain_scores_gemma":[0.9969622,0.0015603218,0.0004624152,0.00086578773,0.00010635737,0.000042921758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005139584,0.00013482715,0.00028715713,0.000045158406,0.000149834,0.000010648323,0.00042468612,0.00005629532,0.00007022577],"category_scores_gemma":[0.000459374,0.000087052744,0.00018689207,0.0002902405,0.00035801544,0.000044594588,0.00007060687,0.00010079044,0.000017032538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026618654,0.00024237228,0.000081982806,0.00018465679,0.00004690183,1.1449913e-7,0.0015256082,9.694977e-7,0.002830525,0.9933573,0.0008470528,0.0008798792],"study_design_scores_gemma":[0.000169837,0.000025375,0.00015747292,0.000054956163,0.0000560817,0.0000031493214,0.0006078429,0.0016670626,0.017328909,0.97940797,0.0004185807,0.00010279447],"about_ca_topic_score_codex":0.0000028771517,"about_ca_topic_score_gemma":0.000007678808,"teacher_disagreement_score":0.07263959,"about_ca_system_score_codex":0.0000056084987,"about_ca_system_score_gemma":0.0000051837305,"threshold_uncertainty_score":0.35499078},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9891684,0.00012179736,0.00046702666,0.0012136438,0.00070771313,0.00012021744,0.000007327001,0.000014238395,0.008179619],"genre_scores_gemma":[0.9991472,0.000027317008,0.00011482785,0.00021219447,0.00012031368,0.000003432107,6.1844236e-7,0.000014854706,0.00035928533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887544,0.00029341324,0.0003134841,0.000045405977,0.00029325808,0.00017902533],"domain_scores_gemma":[0.9966783,0.002370243,0.000391712,0.00025908943,0.00019521562,0.00010542658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023793904,0.00010382123,0.00020022251,0.000038134076,0.0001378935,0.000025411637,0.0002994545,0.0000722682,0.0001449151],"category_scores_gemma":[0.0008511991,0.000060666756,0.00011920008,0.00027835518,0.00004357864,0.00008736172,0.000023860692,0.00041337637,0.000053257903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018531546,0.00031579132,0.007621862,0.0000068123068,0.000040913226,0.0000011837575,0.00030373933,5.7069275e-7,0.00002560952,0.9525897,0.039030492,0.00004479813],"study_design_scores_gemma":[0.0003094661,0.00006929861,0.008769733,0.000022333503,0.00004182086,0.000079542246,0.0001086815,0.0000018190826,0.0007937201,0.9709722,0.01874922,0.00008221196],"about_ca_topic_score_codex":0.000001736224,"about_ca_topic_score_gemma":0.0000010922553,"teacher_disagreement_score":0.020281274,"about_ca_system_score_codex":0.000036114274,"about_ca_system_score_gemma":0.00003494607,"threshold_uncertainty_score":0.24739185},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9966105,0.0009912234,0.0010779487,0.0002237671,0.00002352357,0.00014245501,0.0000058126125,0.00001580482,0.0009089451],"genre_scores_gemma":[0.94112265,0.00026861392,0.05846711,0.000021807398,0.000031258754,0.000004883554,4.6137333e-7,0.000019234334,0.000063957144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989138,0.00003973641,0.0006236685,0.000091043534,0.00018119834,0.00015050313],"domain_scores_gemma":[0.9986658,0.0006049582,0.00045270423,0.00014487229,0.000075502794,0.000056134297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006960477,0.0001316884,0.00032123624,0.00023364121,0.000065057335,0.000053536947,0.00013821966,0.00006945674,0.0000071165],"category_scores_gemma":[0.00013185387,0.00010393182,0.000062090374,0.00019793186,0.000089178495,0.00011588943,0.00003796922,0.0001551422,0.0000014921092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009249609,0.00032097928,0.0046879114,0.00026316498,0.000025253239,0.000019213814,0.0007583625,0.0000028001643,0.0009689864,0.9913015,0.00034942274,0.0012931825],"study_design_scores_gemma":[0.000544799,0.00004228135,0.0024356793,0.00017343379,0.00006200376,0.00030180832,0.0017837548,0.00013352053,0.00036156084,0.9939093,0.00014059553,0.00011126502],"about_ca_topic_score_codex":0.0000113991355,"about_ca_topic_score_gemma":0.00005684774,"teacher_disagreement_score":0.05738916,"about_ca_system_score_codex":0.00000925593,"about_ca_system_score_gemma":0.000015631202,"threshold_uncertainty_score":0.42382166},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9226315,0.000045358185,0.0644826,0.00042621436,0.000022615131,0.0013294043,0.000043021013,0.00016864142,0.010850663],"genre_scores_gemma":[0.993682,0.00000945381,0.004515528,0.00055607257,0.000038409547,0.0007030862,0.00001229221,0.000032450916,0.00045070754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882233,0.00007867689,0.00022122657,0.0004552446,0.0001582941,0.00026425364],"domain_scores_gemma":[0.9983219,0.0007255866,0.000084400024,0.0005215051,0.000115449446,0.00023119141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027465384,0.0002127383,0.00022972863,0.00011383649,0.00043586342,0.00003371636,0.00015567837,0.00008867362,0.000052826465],"category_scores_gemma":[0.00018727119,0.00017965425,0.000057425255,0.0005782854,0.00008007125,0.00006968463,0.000031790587,0.000180079,0.00018051242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019289922,0.0003386951,0.0000769895,0.000022875392,0.000029609428,3.946673e-7,0.0001772688,0.0000027820104,0.0013952606,0.9969245,0.0006506405,0.00036165718],"study_design_scores_gemma":[0.00038643111,0.0001314088,0.00035688502,0.000017213339,0.000061154846,0.000016505977,0.00010573165,0.00005582942,0.011474476,0.97628325,0.010831237,0.00027984657],"about_ca_topic_score_codex":0.0000022054842,"about_ca_topic_score_gemma":0.000018190547,"teacher_disagreement_score":0.07105052,"about_ca_system_score_codex":0.000013307885,"about_ca_system_score_gemma":0.000034131986,"threshold_uncertainty_score":0.73260874},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97991484,0.0007503701,0.0043473523,0.0006134512,0.00020670908,0.00019407141,0.000021078278,0.000061422936,0.013890686],"genre_scores_gemma":[0.99577814,0.00011620472,0.0029029017,0.00028902618,0.00022521213,0.000009243113,0.0000015145858,0.000036469202,0.0006412934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981605,0.00033030973,0.00069956935,0.00017080484,0.0003700273,0.00026882722],"domain_scores_gemma":[0.9971018,0.0014668697,0.0006963515,0.00038757487,0.00017860252,0.00016881601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021658158,0.00023580859,0.0003813461,0.00055654586,0.0002322592,0.00005913577,0.0004905044,0.00010657084,0.00036558823],"category_scores_gemma":[0.00042947524,0.00017197877,0.0004991213,0.0003379367,0.00021924378,0.00024180986,0.00003512451,0.00048028104,0.000057873076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027061452,0.0004203965,0.00041949545,0.000024609744,0.00014382809,0.000013024693,0.0007929889,0.000013303042,0.0002653919,0.9875217,0.0048433035,0.005271314],"study_design_scores_gemma":[0.00046110872,0.00019942062,0.0006649034,0.00013435092,0.0001505717,0.00008784581,0.00064245664,0.000009851013,0.001685876,0.99179107,0.003980233,0.00019230136],"about_ca_topic_score_codex":8.500498e-7,"about_ca_topic_score_gemma":0.000009376056,"teacher_disagreement_score":0.015863277,"about_ca_system_score_codex":0.000033514327,"about_ca_system_score_gemma":0.0000313042,"threshold_uncertainty_score":0.7013091},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7419645,0.0003624521,0.24729422,0.00047182437,0.000027644539,0.0010156495,0.00020121409,0.00016747294,0.008495035],"genre_scores_gemma":[0.99404764,0.000059594782,0.005240505,0.00005426716,0.00004073432,0.00018760213,0.00003260179,0.000016036529,0.00032100952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992632,0.00006169387,0.00025335557,0.00020631707,0.000090183516,0.00012521814],"domain_scores_gemma":[0.9987512,0.0005940143,0.000117807525,0.00037537693,0.00009063976,0.00007095233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038415284,0.00010076276,0.00017115593,0.00005095984,0.00013492827,0.000010314636,0.00016291476,0.00004981128,0.000036918304],"category_scores_gemma":[0.00013640538,0.00009172514,0.00004765281,0.00036028508,0.00008836026,0.00004511872,0.000028774683,0.00008353324,0.00002467798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041040216,0.00009804831,0.0008190008,0.00004106826,0.000012523922,1.6326005e-8,0.0000676643,4.851343e-7,0.00095852476,0.99703664,0.00021745318,0.00074447977],"study_design_scores_gemma":[0.00016176887,0.000023044244,0.0070591625,0.000011197621,0.000028045883,0.0000017587873,0.000028710325,0.0005022453,0.0031088383,0.9776142,0.011338176,0.0001228225],"about_ca_topic_score_codex":0.000007131432,"about_ca_topic_score_gemma":0.000037358008,"teacher_disagreement_score":0.25208315,"about_ca_system_score_codex":0.00000295289,"about_ca_system_score_gemma":0.000009220508,"threshold_uncertainty_score":0.37404427},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9484182,0.0023447615,0.023900358,0.010099046,0.000092174036,0.0065224706,0.0012933705,0.0010374673,0.0062921676],"genre_scores_gemma":[0.9931842,0.00011465777,0.004434597,0.0004560485,0.00012671233,0.0010902205,0.000048942227,0.00002643382,0.0005181912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999249,0.000024726885,0.00026162306,0.00020125732,0.0001000832,0.00016334053],"domain_scores_gemma":[0.99848324,0.000866027,0.00011706042,0.00037948755,0.00009784237,0.00005631963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002287062,0.00013108572,0.00015653182,0.00006453603,0.00043608004,0.000022295719,0.00020368528,0.000082012986,0.000049390103],"category_scores_gemma":[0.00007331894,0.000091485505,0.00009402455,0.0002396811,0.00010700987,0.000042407286,0.000023716213,0.000100451245,0.000032377444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011651201,0.00015424074,0.000042148728,0.000033862758,0.000041896677,1.5890857e-8,0.00019836343,0.000024215293,0.0012049874,0.99435526,0.0026339293,0.0012994199],"study_design_scores_gemma":[0.00071836443,0.00010180401,0.0013715499,0.0000265329,0.00021480944,0.000006724346,0.00023869002,0.015348747,0.019064454,0.6523193,0.31030673,0.00028231097],"about_ca_topic_score_codex":0.0000023476766,"about_ca_topic_score_gemma":0.000012694015,"teacher_disagreement_score":0.34203598,"about_ca_system_score_codex":0.0000059997938,"about_ca_system_score_gemma":0.000021246462,"threshold_uncertainty_score":0.37306705},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56683695,0.00014626303,0.43126795,0.00031021718,0.00017803903,0.000296505,0.0000126234845,0.000025973884,0.0009255033],"genre_scores_gemma":[0.79999566,0.00011587945,0.19972414,0.000033686563,0.000053966476,0.0000075390963,0.000009918619,0.000025193638,0.000033991684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979992,0.00012611755,0.0012727254,0.00014061491,0.00034638742,0.0001149453],"domain_scores_gemma":[0.9954443,0.0008836169,0.002775476,0.00026922204,0.00052993343,0.000097455035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012022654,0.0002086797,0.0006443152,0.00029682255,0.000048374095,0.00004676989,0.0002567248,0.00019262165,0.000011929687],"category_scores_gemma":[0.0002671379,0.00017785946,0.00023602879,0.000115475494,0.00011937331,0.000060578517,0.000098355944,0.0003969649,0.0000021567234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016937212,0.00038099385,0.000036094774,0.0018284802,0.00021259846,0.0000013023384,0.0027735746,0.0005337662,0.0010041677,0.98922163,0.0013561297,0.0026343465],"study_design_scores_gemma":[0.0003709246,0.00007582497,0.0002093499,0.00053194107,0.00031256367,0.000073949355,0.00038152357,0.014814147,0.0002594897,0.9825259,0.00029542073,0.00014895895],"about_ca_topic_score_codex":6.2031256e-7,"about_ca_topic_score_gemma":8.330588e-7,"teacher_disagreement_score":0.23315875,"about_ca_system_score_codex":0.000016212043,"about_ca_system_score_gemma":0.00006125377,"threshold_uncertainty_score":0.7252898},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84977967,0.005608001,0.04239917,0.0037186197,0.00016270319,0.005708022,0.0005809703,0.0005770212,0.091465816],"genre_scores_gemma":[0.98655725,0.0006554122,0.009954957,0.00012281885,0.00010209097,0.0011559337,0.00001582778,0.00003746077,0.0013982382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990946,0.00004922178,0.00038079463,0.00019630899,0.000109714936,0.00016936897],"domain_scores_gemma":[0.9980965,0.00080032623,0.00018364374,0.00073370815,0.00010719306,0.000078574674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037957358,0.00012353167,0.00018314089,0.00006315188,0.00036198524,0.000013215779,0.00040814615,0.00007101485,0.00005245691],"category_scores_gemma":[0.00018850401,0.000088282446,0.0001044985,0.00039743,0.00017299312,0.000053552892,0.000084894105,0.000114962066,0.000031550117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018500039,0.000117035845,0.000035507335,0.000027366345,0.00003785989,9.423364e-8,0.00045948502,5.8254955e-8,0.0009821833,0.99571276,0.0010035847,0.0016055801],"study_design_scores_gemma":[0.00041117368,0.000030348949,0.00022319835,0.000011233637,0.0000824982,0.000004603101,0.00026968244,0.00006534731,0.0052965325,0.97516626,0.0183297,0.00010939545],"about_ca_topic_score_codex":0.000004511431,"about_ca_topic_score_gemma":0.000009783397,"teacher_disagreement_score":0.13677758,"about_ca_system_score_codex":0.0000028138275,"about_ca_system_score_gemma":0.000019163052,"threshold_uncertainty_score":0.36000538},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37814617,0.00029995595,0.6151431,0.0020006353,0.000020164482,0.0025488823,0.00014996542,0.00018561303,0.0015054769],"genre_scores_gemma":[0.9842152,0.00007170088,0.013140834,0.0003147848,0.00020794517,0.0016373392,0.000044648557,0.000027966631,0.00033960046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989016,0.000062236715,0.00039632432,0.0003443843,0.00013080757,0.00016461733],"domain_scores_gemma":[0.99861985,0.0004438406,0.00014840002,0.00047531936,0.00014602231,0.00016657155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003662386,0.00015134896,0.00024801388,0.00012171476,0.00025603783,0.000024350113,0.00016447557,0.0000938273,0.000032741707],"category_scores_gemma":[0.00010981547,0.0001464242,0.000040952793,0.0004661424,0.00008346491,0.00011395714,0.00009124662,0.000099409,0.00004429085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043104433,0.00012424808,0.00010888475,0.000113854796,0.000015019211,2.154676e-8,0.00021126134,0.0000025316604,0.0037938512,0.9903756,0.00012479509,0.0051256185],"study_design_scores_gemma":[0.0002638599,0.000040471463,0.001491835,0.000016451235,0.00007005092,0.000006041792,0.00012937952,0.0007876987,0.0048598107,0.9686068,0.023521164,0.00020639198],"about_ca_topic_score_codex":0.0000061333535,"about_ca_topic_score_gemma":0.000007800976,"teacher_disagreement_score":0.606069,"about_ca_system_score_codex":0.000008033009,"about_ca_system_score_gemma":0.000016154218,"threshold_uncertainty_score":0.59710056},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9803348,0.0000040331174,0.013383625,0.0007559912,0.000020299523,0.0007331498,0.000012226739,0.00018049603,0.004575334],"genre_scores_gemma":[0.9600335,0.0000022115378,0.03889872,0.00089688454,0.000012743123,0.00007107933,0.00003066855,0.000036008732,0.0000182248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841756,0.00002219531,0.00045471772,0.0003115254,0.00032866353,0.00046532787],"domain_scores_gemma":[0.99876696,0.00033273248,0.00020178202,0.0005791315,0.000017625056,0.00010175543],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003324358,0.0003083221,0.00042635968,0.0002159732,0.00013998932,0.000038610546,0.00033779646,0.00007319283,0.00003806707],"category_scores_gemma":[0.00001441976,0.00024563624,0.000083449246,0.00040622414,0.00007842139,0.00006517567,0.000033691696,0.0002566633,0.000038703485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017702203,0.0009115309,0.00029679635,0.00006264453,0.000029514867,0.0000067391443,0.0017094772,0.000012877454,0.037979595,0.95819986,0.00071994617,0.000053333995],"study_design_scores_gemma":[0.0014396785,0.0000410404,0.0055348463,0.00010632354,0.00006066444,0.0000097906095,0.000812793,0.00014368187,0.0056209676,0.98534715,0.0003861839,0.00049686787],"about_ca_topic_score_codex":0.000003294352,"about_ca_topic_score_gemma":0.000009928696,"teacher_disagreement_score":0.032358628,"about_ca_system_score_codex":0.000040810326,"about_ca_system_score_gemma":0.0000071735835,"threshold_uncertainty_score":0.9999996},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9819259,0.0005958188,0.010087926,0.00043867494,0.000061410974,0.0008464394,0.000053184962,0.00007082776,0.005919799],"genre_scores_gemma":[0.98427254,0.00009890476,0.015010736,0.000011727148,0.000013892961,0.00011226343,0.00000303599,0.000024101888,0.00045279285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879885,0.000039093975,0.00062218594,0.000114889976,0.00023851883,0.0001864511],"domain_scores_gemma":[0.9975929,0.001041166,0.0005097012,0.0006838487,0.00012717627,0.000045199333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034821616,0.0001400054,0.0002868328,0.000051651354,0.00012256276,0.000026091458,0.00045417884,0.000050123723,0.00005904794],"category_scores_gemma":[0.00024230812,0.000084681444,0.00015464779,0.0002860488,0.000300454,0.0001264781,0.000068163514,0.000085534244,0.000023249244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002357113,0.000096828815,0.00010314697,0.00034355538,0.000042846088,8.527331e-8,0.00083271146,0.0000010017096,0.002179389,0.99516165,0.0009255978,0.00031084416],"study_design_scores_gemma":[0.00010755409,0.000018420475,0.0001365363,0.0000854418,0.00005298848,0.000001419066,0.0011734609,0.00045455634,0.006960843,0.99054545,0.00036558203,0.00009777522],"about_ca_topic_score_codex":0.000008353823,"about_ca_topic_score_gemma":0.0000040264754,"teacher_disagreement_score":0.0054670065,"about_ca_system_score_codex":0.000005383523,"about_ca_system_score_gemma":0.000012064597,"threshold_uncertainty_score":0.3453209},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9809595,0.0007828889,0.0024655832,0.007216752,0.0000145523945,0.0012586353,0.000048998434,0.00004919407,0.0072039366],"genre_scores_gemma":[0.99848974,0.000112683934,0.00059658795,0.00029851077,0.00006226035,0.00024273041,0.0000064329806,0.0000069216912,0.00018413957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915093,0.000111416965,0.00032942367,0.00016644566,0.000088067965,0.00015373743],"domain_scores_gemma":[0.9982545,0.0010043185,0.0001152412,0.0005261707,0.00005988494,0.000039885075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008453519,0.000100454745,0.00012496329,0.000032212025,0.00047119716,0.0000414692,0.00026796086,0.000057074016,0.000013065583],"category_scores_gemma":[0.00009172118,0.000058706974,0.000052787356,0.00037551371,0.0001112002,0.000059334277,0.000024708721,0.00017575179,0.000013086471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004530727,0.00014574573,0.000012004005,0.000011676499,0.000006956127,0.0000013385226,0.00074978825,5.880725e-7,0.0004649176,0.9935268,0.0003346106,0.0047410554],"study_design_scores_gemma":[0.00015813585,0.000023868035,0.00055453746,0.0000063656485,0.00003281575,0.00006597568,0.0009860412,0.00023403058,0.00080873223,0.978073,0.018970255,0.00008622386],"about_ca_topic_score_codex":0.000012316739,"about_ca_topic_score_gemma":0.0000684352,"teacher_disagreement_score":0.018635644,"about_ca_system_score_codex":0.0000051540214,"about_ca_system_score_gemma":0.000016479187,"threshold_uncertainty_score":0.36241153},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9752012,0.0013939759,0.01985428,0.00009853447,0.000010064435,0.00059554336,0.00015200881,0.000045176977,0.002649197],"genre_scores_gemma":[0.9942162,0.000084763575,0.005204559,0.000025356483,0.00003316158,0.00024604207,0.000019708801,0.00001706474,0.00015313578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999239,0.000019870047,0.00026752063,0.0001493834,0.00013313099,0.00019105346],"domain_scores_gemma":[0.99902475,0.00023010543,0.00018800251,0.00037588604,0.00009274805,0.0000884999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019627328,0.000114384995,0.0001985486,0.00004703314,0.00016425682,0.0000040848354,0.00014811756,0.000051084997,0.00005678394],"category_scores_gemma":[0.000025018117,0.00008925797,0.00004997222,0.0002930072,0.00012993213,0.00010795199,0.00005206281,0.000061505045,0.0000140323955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001760069,0.00028465505,0.008647098,0.00012876968,0.000041846222,2.3910127e-8,0.00034674036,4.4906656e-7,0.0027164586,0.9874718,0.000086477754,0.0002580638],"study_design_scores_gemma":[0.0009137003,0.00012840577,0.025522804,0.00009971363,0.00044468034,0.000010727451,0.0005300863,0.0003866064,0.093760416,0.85205144,0.025705693,0.0004457467],"about_ca_topic_score_codex":0.0000023090058,"about_ca_topic_score_gemma":0.000041920404,"teacher_disagreement_score":0.1354204,"about_ca_system_score_codex":0.0000050656568,"about_ca_system_score_gemma":0.000010234644,"threshold_uncertainty_score":0.36398342},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64341354,0.000073823096,0.33576,0.0037403337,0.00017934316,0.0008226613,0.00018980539,0.0002855891,0.0155348815],"genre_scores_gemma":[0.9484652,0.000002002199,0.051005896,0.000101811514,0.000039605733,0.000046661597,0.00019968509,0.000015950587,0.00012314723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815166,0.00053568813,0.0005665285,0.00021678898,0.00032733163,0.00020197942],"domain_scores_gemma":[0.99479693,0.0035387839,0.00037011522,0.00076917757,0.00044499701,0.00008001884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010552728,0.00016312458,0.00026513461,0.00005856557,0.0012863317,0.000045464647,0.0005861529,0.000052437754,0.000083031875],"category_scores_gemma":[0.00034648858,0.00013169639,0.00015308005,0.00030855866,0.0016233636,0.0000858245,0.00015794246,0.00022172501,0.00005430101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003343007,0.00022433387,0.00049472315,0.000023467817,0.00003200972,3.2651982e-8,0.00015462005,0.0011855674,0.00011973299,0.9942731,0.0027899018,0.0006690655],"study_design_scores_gemma":[0.00044210497,0.00003264729,0.03267581,0.000016462764,0.000025357906,0.0000039842757,0.00008895978,0.06011128,0.000098991266,0.90159476,0.0047845854,0.00012506546],"about_ca_topic_score_codex":0.00003409198,"about_ca_topic_score_gemma":0.00013957528,"teacher_disagreement_score":0.30505168,"about_ca_system_score_codex":0.000032022668,"about_ca_system_score_gemma":0.000037710382,"threshold_uncertainty_score":0.9893553},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9670516,0.00005465316,0.0049277795,0.00016656413,0.00006127555,0.0004400739,0.000021696462,0.00009067189,0.027185656],"genre_scores_gemma":[0.98280346,0.00007208491,0.015880615,0.00001767633,0.000031316195,0.00007526484,0.0000038825483,0.00003325622,0.0010824694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986768,0.000054202697,0.0005583431,0.00013858822,0.00033189854,0.00024019492],"domain_scores_gemma":[0.9978437,0.00092467235,0.00031244667,0.0007803329,0.0000751926,0.000063657455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041762664,0.00016261527,0.00028834897,0.000025515472,0.0003840938,0.000015285488,0.00039339438,0.000057517784,0.00009557355],"category_scores_gemma":[0.00030995038,0.000103725186,0.00017561518,0.00020651447,0.00031956687,0.000050792813,0.00006924305,0.00011114126,0.00014575507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003157255,0.00016127246,0.00038835168,0.00023308505,0.000066803725,0.0000028276686,0.002418513,0.0000011228354,0.00045093964,0.99419093,0.0019898203,0.00009316813],"study_design_scores_gemma":[0.00020169187,0.000012534499,0.00039418915,0.0000884094,0.00006398911,0.00013904703,0.0007136024,0.0004738143,0.0029952514,0.9941901,0.0005777787,0.00014962378],"about_ca_topic_score_codex":0.0000019352515,"about_ca_topic_score_gemma":0.0000017476362,"teacher_disagreement_score":0.026103187,"about_ca_system_score_codex":0.000014963731,"about_ca_system_score_gemma":0.000027547727,"threshold_uncertainty_score":0.42297906},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34204185,0.0007211315,0.63585067,0.0054228455,0.0000527214,0.004404296,0.0008642913,0.00056764693,0.010074542],"genre_scores_gemma":[0.9743627,0.00008438231,0.019319244,0.00022948248,0.00045169008,0.0028943934,0.0004942563,0.000037776146,0.0021260853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991959,0.000019711712,0.00027077063,0.00025657116,0.000083441984,0.0001736407],"domain_scores_gemma":[0.9992268,0.00031100964,0.00009777705,0.00021857803,0.000088331326,0.000057520643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015492474,0.00013119647,0.0001441411,0.0000857521,0.00043315074,0.000031731917,0.00010762356,0.000085236454,0.00008942113],"category_scores_gemma":[0.000012975125,0.00012793501,0.00008064082,0.00025267134,0.00004785928,0.000102136444,0.000011545676,0.00006963375,0.000050850296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008415563,0.00015399336,0.0000053040585,0.000077876306,0.00001356871,7.6242216e-8,0.0000657075,0.0000055843198,0.002753464,0.9941301,0.0021708268,0.0006150934],"study_design_scores_gemma":[0.00046889947,0.000026979891,0.00015784126,0.00001157305,0.00010703059,0.0000069491966,0.00009941112,0.0029496956,0.0049899304,0.94448435,0.046499573,0.00019776804],"about_ca_topic_score_codex":0.0000045396278,"about_ca_topic_score_gemma":0.00000896566,"teacher_disagreement_score":0.6323208,"about_ca_system_score_codex":0.000008752198,"about_ca_system_score_gemma":0.000012213278,"threshold_uncertainty_score":0.52170384},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23678409,0.022830019,0.04139349,0.06134657,0.1639575,0.012137086,0.003273208,0.0043145157,0.45396352],"genre_scores_gemma":[0.06325648,0.0018250886,0.01599831,0.0030344485,0.0110262595,0.0012928449,0.004984817,0.00056266924,0.8980191],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99728984,0.00030310865,0.00069313275,0.0008471067,0.00026551142,0.00060127967],"domain_scores_gemma":[0.9975432,0.00033542558,0.0003809695,0.0011264612,0.0002532016,0.0003607115],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006607295,0.00053734385,0.0008254543,0.00031972083,0.0002728064,0.00005002831,0.0005318353,0.0010940027,0.00017965569],"category_scores_gemma":[0.00059108535,0.0005218679,0.00014144501,0.00038907354,0.0003416791,0.000080599,0.00019785162,0.0010536899,0.00047694007],"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.00001677537,0.000065787404,0.000010081431,0.0000644756,0.000040929554,0.0000057113552,0.00021830431,0.0000013653896,0.000048661757,0.48871568,0.51070315,0.00010905266],"study_design_scores_gemma":[0.00017757161,0.0001283116,0.000042179432,0.000024081031,0.00009829084,0.000034708384,0.00013588,0.00063809834,0.000030327667,0.5718371,0.42649502,0.00035842042],"about_ca_topic_score_codex":0.000107230604,"about_ca_topic_score_gemma":0.00014094643,"teacher_disagreement_score":0.44405556,"about_ca_system_score_codex":0.00007536236,"about_ca_system_score_gemma":0.0002355768,"threshold_uncertainty_score":0.9997233},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83013606,0.00071628037,0.12928434,0.0022836109,0.00004817823,0.0013272127,0.00018980319,0.0005453756,0.03546916],"genre_scores_gemma":[0.98955196,0.000027326156,0.008011362,0.00029154707,0.00006211062,0.0006162152,0.000033003882,0.00002988877,0.0013765856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920976,0.000025016197,0.00017187311,0.0002758583,0.00014995164,0.00016756059],"domain_scores_gemma":[0.9990643,0.00020673157,0.000079074176,0.0003694003,0.000097304684,0.0001831662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010933296,0.00014317308,0.00014275737,0.000043651005,0.00024021811,0.00003717769,0.00015170198,0.000057260684,0.000022150345],"category_scores_gemma":[0.000033702196,0.000113157286,0.00003365843,0.0003397893,0.00011652144,0.00006797809,0.000026566671,0.00009573504,0.000051892697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028692979,0.0001478307,0.000031608564,0.000010773501,0.000016597542,4.438871e-7,0.00013626937,0.000005162314,0.000073541596,0.9972575,0.0015497307,0.0007418536],"study_design_scores_gemma":[0.00038295562,0.00011049838,0.00005358188,0.000013718013,0.000037452854,0.000008820366,0.00011198755,0.00075933785,0.00084625516,0.88980085,0.10769459,0.00017997072],"about_ca_topic_score_codex":0.0000035490998,"about_ca_topic_score_gemma":0.000012328315,"teacher_disagreement_score":0.15941593,"about_ca_system_score_codex":0.000007671549,"about_ca_system_score_gemma":0.000034531633,"threshold_uncertainty_score":0.46144202},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9642108,0.000050335293,0.0049804,0.0003185583,0.000046469853,0.0007062986,0.000045817953,0.000103272956,0.029538035],"genre_scores_gemma":[0.9343656,0.000011673947,0.06474461,0.000078257195,0.000007968936,0.00006114727,0.0000033161232,0.000049419104,0.00067805534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986984,0.000111395784,0.0004195074,0.00019584766,0.00031491206,0.0002599186],"domain_scores_gemma":[0.99815136,0.00040522934,0.00032831077,0.00096814294,0.000077337034,0.00006959013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040495204,0.0002251611,0.00032377982,0.00006214324,0.00015888215,0.000025484072,0.00040183312,0.00007843847,0.00008678569],"category_scores_gemma":[0.00015812664,0.00012836093,0.00017316338,0.0003975245,0.0002891319,0.00006311852,0.00004374978,0.00016878048,0.0000134091015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044406006,0.00018719507,0.00029251154,0.00015994589,0.0000964398,6.4636015e-7,0.0020632148,0.0000020729985,0.000814944,0.99612635,0.00021094405,0.000041319272],"study_design_scores_gemma":[0.00030127168,0.000034783574,0.00023377492,0.00013288081,0.00016805566,0.000021202215,0.001237601,0.00011884652,0.010697206,0.98556536,0.0012949789,0.00019401895],"about_ca_topic_score_codex":0.0000034315274,"about_ca_topic_score_gemma":0.00002602102,"teacher_disagreement_score":0.05976421,"about_ca_system_score_codex":0.0000124920625,"about_ca_system_score_gemma":0.000033072996,"threshold_uncertainty_score":0.52344066},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99799025,0.00025563088,0.000098731514,0.00012629414,0.00004391632,0.00010090683,0.0000052853343,0.000012943429,0.0013660672],"genre_scores_gemma":[0.9997087,0.000052711082,0.00015091315,0.000011814406,0.0000017973617,0.0000061783358,7.4160477e-7,0.000004470505,0.00006264875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950165,0.00006585948,0.00018368,0.000084621315,0.000088112785,0.00007608917],"domain_scores_gemma":[0.9992565,0.00030195553,0.00013080722,0.00022257888,0.00005636659,0.00003180815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024199086,0.000059684196,0.00012538276,0.000033611082,0.00013590192,0.000008935057,0.0000897763,0.0000432754,0.0000028468537],"category_scores_gemma":[0.00013584603,0.000043400098,0.000043986904,0.00028468648,0.00016385836,0.000042196698,0.000043413096,0.00006713917,1.00885664e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027105593,0.00007321495,0.046669893,0.0000684912,0.000013191112,1.3991291e-8,0.00041888276,1.9093592e-7,0.0003515099,0.9520721,0.000073905365,0.00025592747],"study_design_scores_gemma":[0.00022869719,0.000025039202,0.09288661,0.000028181046,0.000057926998,6.759762e-7,0.00017129292,0.00016328707,0.0007586444,0.9054431,0.0001932017,0.000043372293],"about_ca_topic_score_codex":0.000017256998,"about_ca_topic_score_gemma":0.000019533158,"teacher_disagreement_score":0.046628997,"about_ca_system_score_codex":0.0000030370304,"about_ca_system_score_gemma":0.000008048056,"threshold_uncertainty_score":0.17698047},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7659401,0.00016643439,0.1710488,0.0022626896,0.00012690712,0.00080487813,0.000009755615,0.00015189235,0.059488483],"genre_scores_gemma":[0.9548179,0.000018265744,0.044461302,0.000046325502,0.00007582378,0.000018196515,5.155209e-7,0.000032264386,0.00052944396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981911,0.0002038183,0.0005982307,0.00015864991,0.00047012462,0.000378074],"domain_scores_gemma":[0.99704593,0.0016983262,0.00036765417,0.0005472742,0.00015240231,0.00018841981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001559053,0.00019561141,0.00033409233,0.000066552675,0.00043787344,0.00009803628,0.0005448466,0.00006525151,0.00014958515],"category_scores_gemma":[0.00058948394,0.00010382456,0.00018178113,0.00022763964,0.000498714,0.00011905633,0.000042826512,0.00042470274,0.000032304957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030032757,0.0001329754,0.00007622204,0.00006070572,0.0000766688,0.0000035109572,0.00039877906,0.000002728505,0.0014620776,0.9956584,0.0006689914,0.0014288846],"study_design_scores_gemma":[0.00041325137,0.00015608124,0.00020439508,0.00015613339,0.000105031584,0.00041855095,0.00016824437,0.0004465388,0.0025670682,0.994585,0.00063692516,0.0001428181],"about_ca_topic_score_codex":6.281052e-7,"about_ca_topic_score_gemma":0.000004322512,"teacher_disagreement_score":0.18887772,"about_ca_system_score_codex":0.000020517122,"about_ca_system_score_gemma":0.00004905243,"threshold_uncertainty_score":0.42338428},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9787527,0.00034150615,0.015899662,0.0006353879,0.0000054302327,0.0008509465,0.00006549158,0.00013028759,0.0033185978],"genre_scores_gemma":[0.9918508,0.00035965818,0.006215525,0.00015038959,0.00005101729,0.0007262622,0.00002601024,0.00002076902,0.00059956807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992729,0.000019587073,0.00016660518,0.00026681836,0.0000962416,0.00017784712],"domain_scores_gemma":[0.99928665,0.00019483843,0.00007072841,0.00025964598,0.00007010725,0.00011800483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000085417894,0.00013440076,0.00014413513,0.000057347144,0.0004987502,0.0000124506005,0.00009401249,0.000054520267,0.000036153768],"category_scores_gemma":[0.000019095574,0.000108611785,0.000030450796,0.0002238996,0.00012137991,0.00005772578,0.00004774087,0.00011600471,0.000027495526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070684137,0.00015269047,0.0008062274,0.00001935914,0.000024626175,9.0476954e-7,0.00053130696,1.8555424e-7,0.00045849592,0.9976361,0.00016226518,0.00020077576],"study_design_scores_gemma":[0.002275309,0.00025929156,0.03876901,0.0000802821,0.00027719256,0.00034818836,0.0019114728,0.0005583026,0.0075785737,0.84226733,0.10459845,0.001076595],"about_ca_topic_score_codex":0.000002116691,"about_ca_topic_score_gemma":0.000009237758,"teacher_disagreement_score":0.15536876,"about_ca_system_score_codex":0.0000043967743,"about_ca_system_score_gemma":0.000017665223,"threshold_uncertainty_score":0.442906},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98815966,0.0016550993,0.007127074,0.00039549186,0.000016610968,0.0008405059,0.00007312879,0.000030348425,0.0017020634],"genre_scores_gemma":[0.9982165,0.00014643058,0.0011647143,0.000036060996,0.000043149717,0.0002678471,0.0000071105283,0.000011821655,0.00010635587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993338,0.000057363824,0.000274191,0.00011339379,0.000089807596,0.00013146129],"domain_scores_gemma":[0.99897134,0.00044141445,0.00015798355,0.0002842049,0.000075834985,0.000069233174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040655507,0.000092760805,0.00019898635,0.000051226198,0.0001570509,0.000006533367,0.0001281318,0.000052267216,0.000020668034],"category_scores_gemma":[0.000045582947,0.000064158485,0.000052791685,0.00028062947,0.00031481628,0.000070491915,0.0000492002,0.000071812734,0.0000054605603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013170513,0.00011901837,0.0008431302,0.00008423513,0.000026054668,8.344308e-9,0.0006759047,7.4357155e-7,0.003088253,0.9943444,0.0000339032,0.00077114836],"study_design_scores_gemma":[0.00076818245,0.000020621577,0.003266198,0.000027992759,0.00020579228,0.000008381716,0.0008314188,0.00033680917,0.028625218,0.9608735,0.004873994,0.0001619201],"about_ca_topic_score_codex":0.00000509096,"about_ca_topic_score_gemma":0.0000023741077,"teacher_disagreement_score":0.03347096,"about_ca_system_score_codex":0.0000015574391,"about_ca_system_score_gemma":0.000009433559,"threshold_uncertainty_score":0.2616307},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9845983,0.0011359148,0.0036898898,0.0014227687,0.000015994872,0.0011286805,0.000083368395,0.0002934245,0.007631705],"genre_scores_gemma":[0.9862383,0.00043520663,0.011628412,0.00015650211,0.00005915715,0.00047565735,0.000018408069,0.00003935886,0.00094900024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889666,0.000027486763,0.0002488392,0.00040240638,0.00014066837,0.0002839694],"domain_scores_gemma":[0.9991248,0.00016678177,0.00009467756,0.00036782477,0.000057470144,0.00018841706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000113384376,0.00021819148,0.00021769493,0.00012200271,0.0004252038,0.00005562142,0.00015887358,0.00008875979,0.00019528327],"category_scores_gemma":[0.000015987525,0.00018305775,0.00005706689,0.00046137505,0.0002094496,0.0001323464,0.00004313293,0.00020102746,0.0000550094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000109612665,0.00017522367,0.00035822336,0.00003866707,0.000040520696,0.0000014080562,0.00022857719,4.280822e-7,0.00064026366,0.99594104,0.0005059489,0.0020587568],"study_design_scores_gemma":[0.0006532279,0.000116875555,0.0017817819,0.000017284634,0.00013740553,0.00013706165,0.00016682826,0.0009726295,0.0012059119,0.98190385,0.012551244,0.0003558764],"about_ca_topic_score_codex":0.00000321982,"about_ca_topic_score_gemma":0.000008029613,"teacher_disagreement_score":0.014037149,"about_ca_system_score_codex":0.0000059424146,"about_ca_system_score_gemma":0.0000071891063,"threshold_uncertainty_score":0.74648786},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9272263,0.00007548819,0.07109593,0.0002389313,0.00010490008,0.00011258204,0.000085320484,0.000011847449,0.0010487234],"genre_scores_gemma":[0.9910567,0.000008322578,0.008308405,0.00005591789,0.000050093782,0.000011213715,0.00000942043,0.0000076257074,0.0004923115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989378,0.000037752376,0.0005601639,0.0000881611,0.00027092674,0.000105196326],"domain_scores_gemma":[0.99801975,0.00039276938,0.0006854211,0.0001260128,0.00069285044,0.00008317603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008379353,0.00008198085,0.0003483025,0.0006704618,0.00009257359,0.000011754854,0.00015951242,0.000049229373,0.00046684782],"category_scores_gemma":[0.00032211433,0.00006425296,0.00074122765,0.0014249505,0.000028702862,0.00009586338,0.000013785974,0.00007618101,0.0000036841052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006569967,0.00166383,0.037406534,0.00006390204,0.013852002,0.000002523173,0.0009508536,0.00052114966,0.0050851563,0.9218599,0.017329989,0.0006071627],"study_design_scores_gemma":[0.00038185937,0.00023273572,0.054380357,0.00001740741,0.004741189,0.0000056653626,0.00025230495,0.0001868668,0.0013308862,0.9375784,0.00077945465,0.00011288786],"about_ca_topic_score_codex":0.000010362311,"about_ca_topic_score_gemma":0.000024077191,"teacher_disagreement_score":0.063830405,"about_ca_system_score_codex":0.000023554512,"about_ca_system_score_gemma":0.00003208352,"threshold_uncertainty_score":0.5111656},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9325132,0.00055749103,0.019168356,0.0014071405,0.00005572665,0.0014153317,0.00020165299,0.0005155079,0.04416559],"genre_scores_gemma":[0.9876962,0.000035154102,0.010062552,0.00012971158,0.00013978202,0.00043938277,0.000064766864,0.000024303537,0.001408185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991358,0.000025693793,0.00027668828,0.00026346752,0.000098509445,0.00019983898],"domain_scores_gemma":[0.9992474,0.00020118304,0.00009015905,0.0003012872,0.00007810504,0.00008188903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012121165,0.00014865857,0.00016173838,0.000088497145,0.00032480486,0.00003593289,0.00016007209,0.00008504089,0.00010298551],"category_scores_gemma":[0.000025068532,0.00013498784,0.00006773436,0.0003658446,0.00013263352,0.00008530984,0.000038321454,0.0001469934,0.00009515093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027278008,0.000084198444,0.00025288088,0.000018906632,0.0000111357085,2.3189935e-7,0.00003496643,4.3851028e-7,0.0016861855,0.9953222,0.0012658543,0.0013202685],"study_design_scores_gemma":[0.00020516766,0.000011780259,0.00046832883,0.000007791724,0.000040229424,0.000017393604,0.0001052267,0.00017142082,0.0027263714,0.9526781,0.04340601,0.00016219319],"about_ca_topic_score_codex":0.000012285251,"about_ca_topic_score_gemma":0.000024539675,"teacher_disagreement_score":0.05518296,"about_ca_system_score_codex":0.000006949601,"about_ca_system_score_gemma":0.00001813021,"threshold_uncertainty_score":0.55046445},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37974447,0.0016105867,0.6164439,0.00075197883,0.000016534925,0.0005795803,0.00010399102,0.000019531713,0.00072943914],"genre_scores_gemma":[0.97282004,0.0017015048,0.025214262,0.000012987827,0.000114424256,0.00007095094,0.000008617464,0.000015937616,0.00004129864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99765384,0.00012979118,0.0014232332,0.00027632093,0.00035694434,0.00015984403],"domain_scores_gemma":[0.9958211,0.0012385926,0.0018925252,0.00047107774,0.00041131995,0.00016539317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012106576,0.0002462851,0.0011917563,0.00036221472,0.00014341112,0.0000790872,0.00029452046,0.00020893059,0.000070870046],"category_scores_gemma":[0.00023559836,0.00016477193,0.0005674352,0.00056145055,0.00030012516,0.00010210581,0.00015360156,0.00031707378,0.0000014222786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025971613,0.000604681,0.0018484651,0.0008724607,0.0017871002,9.4037244e-7,0.00031283963,0.000007875583,0.0018743421,0.9891056,0.0000936584,0.003466064],"study_design_scores_gemma":[0.00046037705,0.000020479883,0.0010150077,0.0002626811,0.004990062,0.000017044838,0.00012789262,0.00025753846,0.0009361524,0.99158686,0.00015470451,0.00017117085],"about_ca_topic_score_codex":0.0000022168108,"about_ca_topic_score_gemma":0.0000021725534,"teacher_disagreement_score":0.5930755,"about_ca_system_score_codex":0.000014664075,"about_ca_system_score_gemma":0.00005034585,"threshold_uncertainty_score":0.6719205},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98296136,0.0039743707,0.00033329704,0.0006275332,0.0060340855,0.0003307547,0.0012920243,0.00037648078,0.0040701167],"genre_scores_gemma":[0.98668665,0.0055862316,0.0021647476,0.0005278798,0.002966533,0.00050119666,0.00040650187,0.00086019444,0.0003000934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9853115,0.0015622617,0.004583631,0.002101648,0.0035980034,0.0028429474],"domain_scores_gemma":[0.98492146,0.00399552,0.0057639205,0.0025712927,0.0010356915,0.0017121397],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity"],"category_scores_codex":[0.0054254374,0.0020166738,0.0017669126,0.0010225183,0.0032939024,0.0013680817,0.0033155775,0.0030116767,0.00141757],"category_scores_gemma":[0.0028135802,0.0026974056,0.0032489258,0.0017994776,0.004013768,0.0025388983,0.0018629433,0.003266511,0.00058899744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0057282643,0.0017329447,0.000053672014,0.0015607777,0.0037802155,0.0008022798,0.0060339654,0.00038210562,0.0039722566,0.9611637,0.013163599,0.0016261911],"study_design_scores_gemma":[0.0055936584,0.0045096944,0.0000824921,0.0022758432,0.0036153325,0.0032867629,0.008128688,0.0067544873,0.2600624,0.69218993,0.010798238,0.002702439],"about_ca_topic_score_codex":0.00046487458,"about_ca_topic_score_gemma":0.00022228695,"teacher_disagreement_score":0.26897377,"about_ca_system_score_codex":0.00008911343,"about_ca_system_score_gemma":0.0017946424,"threshold_uncertainty_score":0.9996686},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9483125,0.00022712824,0.021637086,0.0001979198,0.000028340874,0.00088313874,0.00007086522,0.00006274277,0.028580258],"genre_scores_gemma":[0.93718714,0.00015934453,0.062230498,0.000011857142,0.0000092329265,0.00009055663,0.000002532705,0.00002938455,0.0002794881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987896,0.000019437299,0.0005663967,0.00017237928,0.00025008133,0.00020211315],"domain_scores_gemma":[0.996753,0.0020167078,0.0004265443,0.0006479995,0.0000991953,0.000056602934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003312977,0.00017941085,0.000374353,0.000025902453,0.00024057028,0.000008964159,0.00031226364,0.00006973368,0.000017956341],"category_scores_gemma":[0.00026756912,0.00012136424,0.000089815694,0.00031271804,0.0007405842,0.000033189386,0.00008586489,0.00010766845,0.0000031970073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022131537,0.00011636602,0.000057232548,0.00029114148,0.000057668865,4.970389e-7,0.0022434602,7.666002e-7,0.005653867,0.99087155,0.00042196427,0.00026334514],"study_design_scores_gemma":[0.00034112943,0.000025435864,0.0002809832,0.000046844198,0.00007419045,0.000009691691,0.0015709528,0.00009743974,0.008286616,0.98867184,0.00045038565,0.00014451648],"about_ca_topic_score_codex":0.0000015696951,"about_ca_topic_score_gemma":0.000006547431,"teacher_disagreement_score":0.04059341,"about_ca_system_score_codex":0.0000052144583,"about_ca_system_score_gemma":0.000023291244,"threshold_uncertainty_score":0.49490902},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005368765,0.0006340649,0.0055697276,0.00064378366,0.0051363357,0.003837463,0.00028394078,0.0004448463,0.97808105],"genre_scores_gemma":[0.046621773,0.00017586397,0.039024726,0.00022000015,0.00070558354,0.002817288,0.00024105543,0.0005684303,0.9096253],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956985,0.00020155017,0.0018081489,0.0008685823,0.0006148668,0.0008083555],"domain_scores_gemma":[0.99543697,0.0011699568,0.000856166,0.0019308637,0.0003160915,0.00028996533],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00082054,0.00082316354,0.0017780828,0.0011027171,0.00028137682,0.00007486648,0.0010761039,0.0008976385,0.0015713855],"category_scores_gemma":[0.0017169608,0.00078135886,0.0005298488,0.0022262107,0.00023583473,0.00014326081,0.00032201712,0.0012919555,0.00039715163],"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.000042945656,0.0006685608,0.000007019218,0.0015415113,0.00013975217,0.000011378417,0.0032607017,3.8782755e-7,0.00057621713,0.26360944,0.73008376,0.00005829147],"study_design_scores_gemma":[0.0005130542,0.00017915214,0.00002062759,0.0023057577,0.00036195386,0.00005818266,0.0013942586,0.00020309458,0.00076443783,0.91692555,0.076318786,0.0009551757],"about_ca_topic_score_codex":0.00002454143,"about_ca_topic_score_gemma":0.00023921943,"teacher_disagreement_score":0.653765,"about_ca_system_score_codex":0.00022046256,"about_ca_system_score_gemma":0.00036608044,"threshold_uncertainty_score":0.99946374},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97688097,0.000051182426,0.000117902535,0.00038299515,0.00009147212,0.00015076829,0.000002484404,0.00008243895,0.022239776],"genre_scores_gemma":[0.9982013,0.0000029877178,0.00037532486,0.000021124011,0.000015067104,0.00004924836,0.000005098216,0.0000090536205,0.0013208053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936754,0.00004348802,0.00017238125,0.0001172635,0.0001522409,0.00014708351],"domain_scores_gemma":[0.9994714,0.0002076569,0.0000918425,0.00017061793,0.000037682898,0.000020747724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002862773,0.000066789515,0.00010522924,0.000064435095,0.00005807026,0.000016729427,0.000108804314,0.0000759755,0.000039718263],"category_scores_gemma":[0.00011383537,0.000068548215,0.000036171044,0.00028133445,0.000008137821,0.00004995404,0.000026684565,0.00011973114,0.000057788802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013591833,0.0002519947,0.038610075,0.0000072738803,0.000003921457,0.0000012294005,0.000033897828,5.5315525e-7,0.00018009525,0.95505285,0.0057311053,0.00012564991],"study_design_scores_gemma":[0.00032190955,0.0000073350566,0.022199102,0.0000067938495,0.0000064906576,5.727555e-7,0.000017588975,0.00002008724,0.0016206332,0.9666896,0.009033109,0.000076786615],"about_ca_topic_score_codex":0.000016723034,"about_ca_topic_score_gemma":0.000010064446,"teacher_disagreement_score":0.02132031,"about_ca_system_score_codex":0.00015526112,"about_ca_system_score_gemma":0.000012828586,"threshold_uncertainty_score":0.2795315},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97600764,0.00014718146,0.019708464,0.0010060784,0.000032693963,0.0011170022,0.000031989734,0.00014543773,0.001803538],"genre_scores_gemma":[0.9789301,0.00007316236,0.019526603,0.00013942913,0.00006554009,0.00070491206,0.000016174188,0.000024891222,0.00051915995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921775,0.000016161062,0.00022955996,0.00027955984,0.00007817691,0.00017877143],"domain_scores_gemma":[0.9990528,0.0003606412,0.00008508138,0.00032159392,0.000052446652,0.00012741885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020551131,0.0001341396,0.00015119878,0.000059254482,0.00032531706,0.000045155164,0.00012594005,0.00009706741,0.000027749296],"category_scores_gemma":[0.00007006133,0.00012049179,0.00003905524,0.00018496929,0.00010786852,0.0000935749,0.000052499385,0.0002153313,0.00002922108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002663531,0.000064522756,0.00010114151,0.00005832087,0.000016678552,9.086612e-8,0.00026830065,8.297654e-7,0.021038119,0.97507983,0.00025435837,0.0031151692],"study_design_scores_gemma":[0.0003286431,0.000022193777,0.00021209619,0.000013507333,0.000066833316,0.000019363284,0.000088294444,0.0015152545,0.0050857835,0.9685696,0.023873676,0.00020475712],"about_ca_topic_score_codex":0.0000031511665,"about_ca_topic_score_gemma":0.000011054624,"teacher_disagreement_score":0.023619318,"about_ca_system_score_codex":0.0000023589944,"about_ca_system_score_gemma":0.000011436762,"threshold_uncertainty_score":0.49135128},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1120127,0.00008869089,0.88346547,0.00041652904,0.000021181479,0.0013246648,0.0016655797,0.000017055525,0.0009881412],"genre_scores_gemma":[0.9717142,0.000043432738,0.02743855,0.000030599287,0.0000059134222,0.0004312467,0.00027576304,0.000015736809,0.000044550394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977691,0.0005493346,0.00094731356,0.00018622351,0.00034039916,0.00020761411],"domain_scores_gemma":[0.9936432,0.0037694906,0.00040527526,0.0019574733,0.00019652827,0.000028018112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011503365,0.00017045227,0.00028581894,0.00011793522,0.00022900519,0.000014776348,0.0013407165,0.00008563068,0.000027179807],"category_scores_gemma":[0.00061263895,0.00013256761,0.000066937166,0.00088783767,0.0006009454,0.00011019555,0.00015706292,0.00039188442,0.0000024435067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027237627,0.00051871926,0.00002570703,0.00004642868,0.000012040995,9.6753155e-8,0.003157618,0.10467918,0.000021929947,0.88922983,0.00007624075,0.0022049882],"study_design_scores_gemma":[0.0002921439,0.00001767154,0.0014254919,0.00009345519,0.00003578439,0.0000029323194,0.00038648292,0.40744254,0.0000066199414,0.5902051,0.000009631892,0.00008215622],"about_ca_topic_score_codex":0.00008982045,"about_ca_topic_score_gemma":0.00023026405,"teacher_disagreement_score":0.8597015,"about_ca_system_score_codex":0.000075602205,"about_ca_system_score_gemma":0.000114695176,"threshold_uncertainty_score":0.540595},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9979343,0.00055121386,0.00057259714,0.00028707494,0.000073398915,0.00009326818,0.0000013136427,0.000007354289,0.00047950356],"genre_scores_gemma":[0.9991688,0.00065985316,0.000021863267,0.000023215884,0.00001888843,0.000001336778,1.5726239e-7,0.000012242246,0.00009360387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990456,0.00010218022,0.00035271337,0.000059755366,0.0002192971,0.00022047186],"domain_scores_gemma":[0.9983519,0.0008298519,0.00045511356,0.00021043057,0.00010426901,0.000048445876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000723357,0.000102888174,0.00025781032,0.00010473529,0.00014937673,0.0000050052795,0.00025802714,0.00004711527,0.0000060991733],"category_scores_gemma":[0.00017682038,0.00006405486,0.00012051197,0.00025854938,0.00013244829,0.00004891605,0.000019205096,0.0003832041,8.429868e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004411788,0.00015849576,0.00034370204,0.000007806488,0.00005091258,0.0000011080747,0.00058796816,0.000002033749,0.0009570811,0.997564,0.0002318954,0.00005086843],"study_design_scores_gemma":[0.0004356248,0.000465049,0.0007725089,0.0000173893,0.0000590157,0.0001087017,0.00008259579,0.000003381965,0.011805877,0.9857165,0.0004717983,0.00006150779],"about_ca_topic_score_codex":0.0000019857018,"about_ca_topic_score_gemma":8.8308747e-7,"teacher_disagreement_score":0.011847461,"about_ca_system_score_codex":0.000043894877,"about_ca_system_score_gemma":0.00012739086,"threshold_uncertainty_score":0.26120815},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99804485,0.0007087574,0.00033847266,0.00039055513,0.00012705193,0.000036720598,0.000011038113,0.0000064294727,0.00033612392],"genre_scores_gemma":[0.99899614,0.00017579529,0.0005043012,0.00002512899,0.00022095484,0.000004321002,0.0000025995423,0.000011801806,0.00005893744],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998904,0.000039271934,0.00052004954,0.00007580511,0.00031377084,0.00014708987],"domain_scores_gemma":[0.99866307,0.0003608409,0.00047561617,0.00013124607,0.00027844685,0.000090804424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007524959,0.000103795624,0.00016835202,0.00004821431,0.00005162403,0.000026600459,0.00039357776,0.000061161925,0.000035343815],"category_scores_gemma":[0.00020742083,0.00007681686,0.00010260052,0.00011432456,0.00009817208,0.00024580903,0.0000442781,0.00021808333,8.4614015e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002324023,0.00082184636,0.035886858,0.000066421824,0.0002617595,0.000016293252,0.0012472175,0.00003848317,0.53013253,0.4298993,0.00028763973,0.0011092528],"study_design_scores_gemma":[0.00082463125,0.000022934317,0.004588012,0.00025118314,0.000054750944,0.00051519834,0.0009169425,0.000302636,0.31396672,0.6777464,0.0006428128,0.00016774898],"about_ca_topic_score_codex":0.000001838494,"about_ca_topic_score_gemma":0.0000013099313,"teacher_disagreement_score":0.24784712,"about_ca_system_score_codex":0.000015406311,"about_ca_system_score_gemma":0.000021518757,"threshold_uncertainty_score":0.31325006},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9837187,0.000714914,0.010808072,0.0008635425,0.00011352438,0.00016005682,9.587807e-7,0.00003260906,0.00358765],"genre_scores_gemma":[0.9989727,0.00032107107,0.00014891589,0.00005927231,0.00004065626,0.0000059999406,4.3587224e-7,0.000024478184,0.00042648526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867195,0.00011830647,0.0003436451,0.00008746277,0.00035101027,0.00042765212],"domain_scores_gemma":[0.9986395,0.00032413166,0.00039143115,0.00033095918,0.00023637265,0.0000775914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000813617,0.00015607348,0.00025895826,0.000110614536,0.0003137928,0.00001540299,0.0005755634,0.00005544386,0.000018003435],"category_scores_gemma":[0.00007785342,0.00008841034,0.00014905211,0.00055227504,0.00018407215,0.00011192325,0.000024889287,0.00084217504,0.0000073238325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008709852,0.00017989188,0.00038290542,0.000005841689,0.00010557883,0.0000139932245,0.00039796016,0.0000021713745,0.00005915883,0.9974687,0.0010835172,0.0002131586],"study_design_scores_gemma":[0.0007250605,0.000558699,0.00027268354,0.000021289676,0.00009182611,0.0015769002,0.00022808662,0.00000515339,0.00086348737,0.9925362,0.0030060958,0.00011450836],"about_ca_topic_score_codex":0.000002406806,"about_ca_topic_score_gemma":0.000011271495,"teacher_disagreement_score":0.015254013,"about_ca_system_score_codex":0.00010220287,"about_ca_system_score_gemma":0.000285003,"threshold_uncertainty_score":0.36588782},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55432713,0.0003719858,0.42678398,0.0035254436,0.00006206207,0.000363561,0.000024492869,0.00008619329,0.0144551415],"genre_scores_gemma":[0.8801581,0.000021247744,0.11894965,0.00009792315,0.00030802356,0.000012164326,0.0000015193516,0.000017482205,0.00043386358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986743,0.00001543088,0.00069092336,0.00012369792,0.0002793945,0.00021626372],"domain_scores_gemma":[0.9981718,0.0007761567,0.0004559477,0.00026102766,0.00017676217,0.00015829298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006063767,0.00015231023,0.00038838733,0.00003480421,0.000086152824,0.00003906993,0.00034569844,0.00011919328,0.00014751525],"category_scores_gemma":[0.0007308778,0.0001158313,0.00031631644,0.00017249656,0.00007797173,0.000087252614,0.000011421835,0.00024661337,0.000003984884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010560391,0.00088460586,0.000011678771,0.0005359331,0.000060776645,0.000013674406,0.0001561343,0.000002212314,0.025155634,0.9673022,0.004065878,0.0017056764],"study_design_scores_gemma":[0.00040905067,0.00007203754,0.0000106728185,0.00013002173,0.000099899626,0.00023054596,0.00012271115,0.00006996099,0.019507518,0.9777994,0.0014187469,0.00012944621],"about_ca_topic_score_codex":2.1444057e-8,"about_ca_topic_score_gemma":3.024146e-8,"teacher_disagreement_score":0.325831,"about_ca_system_score_codex":0.000021609914,"about_ca_system_score_gemma":0.000028845106,"threshold_uncertainty_score":0.47234634},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8937961,0.00004333835,0.018818673,0.0008201969,0.00004748998,0.0006145567,0.00006627881,0.00020729797,0.08558611],"genre_scores_gemma":[0.9044742,0.000008322614,0.09481972,0.00004948446,0.000020617126,0.000022152455,0.000012840012,0.000018480352,0.00057418476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987902,0.000039558294,0.00055561133,0.00018334226,0.00023337157,0.0001979121],"domain_scores_gemma":[0.99845177,0.0004294299,0.00028390915,0.0006730288,0.00008621888,0.00007564571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032172963,0.00015440486,0.00029472896,0.00011561463,0.00010757906,0.000021009873,0.0002825165,0.000063037485,0.00012489525],"category_scores_gemma":[0.00032895105,0.00013425294,0.00019457152,0.00036759465,0.00011312948,0.0000893612,0.000029905454,0.00010199663,0.000025120005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051339803,0.0002529774,0.00006413078,0.000070092254,0.000025848916,0.0000011677643,0.0017106695,0.0000022293598,0.0033433465,0.9929115,0.0013004803,0.00031240846],"study_design_scores_gemma":[0.0001981997,0.000058837737,0.00046744753,0.00005512614,0.000081697806,0.0000091407255,0.0011409174,0.0002465511,0.006539131,0.9908995,0.00016073973,0.00014271511],"about_ca_topic_score_codex":0.0000015433953,"about_ca_topic_score_gemma":0.0000017918017,"teacher_disagreement_score":0.08501193,"about_ca_system_score_codex":0.000007052797,"about_ca_system_score_gemma":0.000014904118,"threshold_uncertainty_score":0.54746765},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7456887,0.00014827038,0.17386903,0.004809423,0.0002140668,0.0014076871,0.0000534274,0.00064048124,0.07316895],"genre_scores_gemma":[0.94269866,0.000009481918,0.056483548,0.00019202029,0.00007770894,0.00009786566,0.00000687042,0.00004694078,0.0003868909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893796,0.000038118433,0.00032956374,0.00017748612,0.00024856065,0.00026830923],"domain_scores_gemma":[0.99860895,0.00037707394,0.00016941006,0.0007317311,0.000044024222,0.0000688364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043946973,0.00018272788,0.00020116057,0.000053582222,0.00039865644,0.00009210376,0.0004071841,0.000060414197,0.00005758851],"category_scores_gemma":[0.00019982913,0.000113596216,0.00017286268,0.00027819313,0.00020720839,0.00009083584,0.00007681164,0.00018703328,0.00010706432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019378076,0.000084532745,0.0000053886515,0.00007478281,0.000031082604,0.000002317371,0.003108258,0.000020469006,0.0006179959,0.9955714,0.00035023867,0.00013161563],"study_design_scores_gemma":[0.0002454423,0.000014076289,0.000034945013,0.00010991244,0.00007487358,0.000030674746,0.0020207143,0.00006516615,0.0017773899,0.9948415,0.0006234455,0.00016183083],"about_ca_topic_score_codex":0.000003374255,"about_ca_topic_score_gemma":0.000008180887,"teacher_disagreement_score":0.19701001,"about_ca_system_score_codex":0.000021009464,"about_ca_system_score_gemma":0.000023465656,"threshold_uncertainty_score":0.46323192},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.922454,0.000005653849,0.0019314883,0.019757118,0.000020470246,0.00028949845,0.0000063123885,0.000030942472,0.055504497],"genre_scores_gemma":[0.9964435,0.0000020590119,0.00053909176,0.001179843,0.000023307479,0.000042454143,9.84718e-7,0.000014162294,0.0017545765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991163,0.00008065563,0.00026283058,0.00013698854,0.0001396833,0.00026353516],"domain_scores_gemma":[0.99737513,0.0017651415,0.00006362149,0.0005365645,0.00004280246,0.00021671879],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004560625,0.00011207543,0.00018546966,0.000062369785,0.00015444732,0.000016359973,0.0002596487,0.00008359457,0.013342683],"category_scores_gemma":[0.0011694845,0.00007684471,0.00009730347,0.00016896668,0.00014183192,0.000007846272,0.000015347614,0.00017321177,0.003461264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044996164,0.00005773001,0.000044438013,0.000023738983,0.00001230385,0.0000063467155,0.00018485049,8.789257e-7,0.000038834685,0.97519076,0.024317902,0.00011772543],"study_design_scores_gemma":[0.00007512773,0.0000275929,0.0001292581,0.000046992962,0.00002241397,0.000016735641,0.00014260608,0.0000527183,0.0004503097,0.99076563,0.008182092,0.00008852472],"about_ca_topic_score_codex":0.00020521383,"about_ca_topic_score_gemma":0.0009448877,"teacher_disagreement_score":0.0739895,"about_ca_system_score_codex":0.000028539618,"about_ca_system_score_gemma":0.00004141186,"threshold_uncertainty_score":0.99731463},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9759313,0.00084268727,0.007323488,0.0050179427,0.00003648983,0.0013433666,0.00006171909,0.000053718824,0.009389323],"genre_scores_gemma":[0.9981571,0.00034371906,0.00047882332,0.000037824964,0.000042273256,0.00017225387,0.000001986188,0.000009859108,0.0007561759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993963,0.000031161886,0.0002517338,0.0001128624,0.000100642785,0.000107286],"domain_scores_gemma":[0.99884635,0.00041464015,0.00016106418,0.00049051514,0.000056147433,0.00003128461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018435055,0.00007397333,0.00010799038,0.000025468293,0.00028776817,0.0000074643117,0.00028624694,0.00003777677,0.000020707164],"category_scores_gemma":[0.00005350546,0.000042235362,0.000080054946,0.00043741983,0.00018322635,0.00002572544,0.000057951085,0.000085690604,0.000006609165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004074879,0.0000726766,0.0002645576,0.00001610626,0.000018537143,1.721935e-8,0.00010742616,9.798492e-7,0.0021154808,0.9963734,0.00020137466,0.00082532415],"study_design_scores_gemma":[0.000108684115,0.0000130663775,0.0015375856,0.0000117824875,0.000045789002,0.0000056554245,0.00014250287,0.00010730152,0.013654029,0.95928735,0.025031602,0.00005465017],"about_ca_topic_score_codex":0.00000504354,"about_ca_topic_score_gemma":0.000020174974,"teacher_disagreement_score":0.037086092,"about_ca_system_score_codex":0.0000023481057,"about_ca_system_score_gemma":0.000014780774,"threshold_uncertainty_score":0.22133093},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93343574,0.0008535172,0.05440338,0.001018515,0.000024361905,0.00075514993,0.0003890688,0.000343107,0.008777146],"genre_scores_gemma":[0.9875298,0.000045700344,0.009753379,0.00019356237,0.00032442942,0.00041533614,0.00016625518,0.000028553342,0.0015429702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999181,0.000023769186,0.0002426583,0.00026641425,0.00010225834,0.00018390536],"domain_scores_gemma":[0.9992309,0.00025483014,0.00008365182,0.00031822975,0.000048248192,0.00006412634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012921181,0.00012926041,0.00014338286,0.00004372087,0.00034619553,0.000034621215,0.00015585986,0.00007547386,0.00018578254],"category_scores_gemma":[0.000019276447,0.00011990579,0.00005452862,0.00018888504,0.000037752234,0.0000830766,0.000053670923,0.000111089656,0.00022387023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018503004,0.0001465727,0.00014385903,0.0000117554655,0.000014132106,1.6470281e-7,0.00013284635,5.8248094e-7,0.0026108301,0.99506205,0.0015872354,0.00028811098],"study_design_scores_gemma":[0.00017549456,0.00000553657,0.00091270485,0.000006559818,0.000050706498,0.0000018273419,0.00010042837,0.0003616928,0.003239638,0.9162763,0.07873209,0.0001370686],"about_ca_topic_score_codex":0.000027095743,"about_ca_topic_score_gemma":0.000021428232,"teacher_disagreement_score":0.07878581,"about_ca_system_score_codex":0.0000063007355,"about_ca_system_score_gemma":0.000010326413,"threshold_uncertainty_score":0.4889616},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99526936,0.00011260567,0.0007380049,0.00024351265,0.00001194619,0.000531923,0.000052780495,0.000020891435,0.0030189767],"genre_scores_gemma":[0.99893326,0.00012594939,0.0003912756,0.00006659236,0.000021276674,0.00021415818,0.000007968829,0.000012469126,0.00022702961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929965,0.000051747767,0.00026753114,0.00014668489,0.00012895901,0.00010542173],"domain_scores_gemma":[0.9988607,0.00052162976,0.00016081946,0.00035879706,0.000054232227,0.000043815424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014394926,0.00010433602,0.00016465127,0.000034664878,0.00012174546,0.000006524283,0.00015191194,0.000045796358,0.00016830565],"category_scores_gemma":[0.00006080602,0.00006753592,0.00006478423,0.00016647,0.00007492561,0.00003117666,0.00002250396,0.000085766864,0.00004207728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002849455,0.0002718288,0.00026308355,0.000055689907,0.000026040563,4.7701565e-8,0.00012510055,9.3484863e-7,0.0025143682,0.9965028,0.000151202,0.000086044936],"study_design_scores_gemma":[0.00015827686,0.000014097902,0.00067012926,0.000023005954,0.00006404491,0.000004911179,0.00013096012,0.00011560924,0.021374624,0.975655,0.0017015093,0.00008780649],"about_ca_topic_score_codex":0.000001345342,"about_ca_topic_score_gemma":4.7646935e-7,"teacher_disagreement_score":0.020847786,"about_ca_system_score_codex":0.0000039387564,"about_ca_system_score_gemma":0.0000090523135,"threshold_uncertainty_score":0.27540347},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.988298,0.0005269618,0.00095457316,0.00015222482,0.000036983412,0.00030149793,0.000040959367,0.00013943911,0.009549345],"genre_scores_gemma":[0.9856199,0.00007101811,0.013806487,0.000029184908,0.000027108907,0.0000513657,0.000018350855,0.00002601942,0.00035056876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989461,0.00008617456,0.0004233528,0.00021434031,0.00013754847,0.0001925405],"domain_scores_gemma":[0.9988642,0.00037108874,0.0002104305,0.00042670502,0.00007030264,0.00005732442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027512733,0.00017480373,0.0003124222,0.00012866243,0.00011738871,0.00002448722,0.00019017232,0.00011027065,0.00015352214],"category_scores_gemma":[0.000043669417,0.00015739715,0.00008744685,0.00022157785,0.00017450057,0.00006062587,0.000055537137,0.00014135602,0.000022645903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057229836,0.00015070866,0.0015628434,0.00014450151,0.000023140497,0.0000013884272,0.00031957065,0.0000028271668,0.011744648,0.97957295,0.0059329118,0.0005387602],"study_design_scores_gemma":[0.00025061643,0.0000311292,0.008289103,0.000074048214,0.00003803995,0.00001059579,0.00012592431,0.00014416163,0.02011139,0.9696347,0.0011190498,0.0001712198],"about_ca_topic_score_codex":0.00008372362,"about_ca_topic_score_gemma":0.000036068937,"teacher_disagreement_score":0.012851914,"about_ca_system_score_codex":0.000009485374,"about_ca_system_score_gemma":0.000016622475,"threshold_uncertainty_score":0.64184695},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5367399,0.00003573397,0.26907423,0.0017585923,0.00015139897,0.0005783911,0.000007833798,0.0002949572,0.19135897],"genre_scores_gemma":[0.95352596,0.0000043923837,0.0454476,0.00028377012,0.00006744939,0.000040785406,0.0000023734424,0.0000068052495,0.0006208614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996395,0.0000105924755,0.00009341829,0.00008192018,0.000062475716,0.00011205442],"domain_scores_gemma":[0.9997165,0.000056232588,0.000029335124,0.00015089712,0.000016635986,0.00003040502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012010888,0.000049422473,0.000054528453,0.0000104448645,0.00006910121,0.000008209758,0.00008242033,0.000014665296,0.00027969063],"category_scores_gemma":[0.000010855685,0.00003953856,0.000030253324,0.00007799455,0.000017180337,0.00002499409,0.000021536933,0.000039109116,0.00012878755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001394564,0.000048543894,0.000024692712,0.0000022870815,0.000013273708,6.0165087e-7,0.000112771566,0.00032428495,0.000029036415,0.9970261,0.0021262374,0.00029081802],"study_design_scores_gemma":[0.00017714442,0.000012851188,0.00004145725,0.000006894453,0.000007325669,0.0000014491417,0.000043255422,0.000029185148,0.0019472656,0.9941178,0.0035638893,0.0000514689],"about_ca_topic_score_codex":0.000007671425,"about_ca_topic_score_gemma":0.000015413265,"teacher_disagreement_score":0.41678607,"about_ca_system_score_codex":0.000013968355,"about_ca_system_score_gemma":0.000006955271,"threshold_uncertainty_score":0.30624163},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9369225,0.00012040628,0.02673077,0.0038577896,0.000015260317,0.0024218936,0.00004470853,0.0003625951,0.029524105],"genre_scores_gemma":[0.9832645,0.000052389045,0.012276708,0.00020928154,0.000098697405,0.0021142045,0.000024639381,0.000032085944,0.0019274651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918836,0.000026986383,0.00020955164,0.00027536284,0.00010286047,0.00019687672],"domain_scores_gemma":[0.9990753,0.00021956007,0.00008527503,0.00036773284,0.000118074095,0.00013406624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000851429,0.00015187777,0.00015458972,0.000042361633,0.0002595007,0.00004422973,0.00015857295,0.00007698285,0.0005801044],"category_scores_gemma":[0.000018812789,0.00011832821,0.000046633155,0.000303387,0.000087141605,0.00015401977,0.000039320683,0.00014201688,0.0004505482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035162116,0.00012719956,0.0010271785,0.000029287517,0.000027621662,1.9320741e-7,0.00013723163,4.7707624e-7,0.0009175523,0.9948401,0.0017811699,0.0011084604],"study_design_scores_gemma":[0.0003199448,0.000032808104,0.003498323,0.000019796391,0.00006406448,0.0000296796,0.00021282461,0.00030911437,0.0015178972,0.94747525,0.04624313,0.00027716235],"about_ca_topic_score_codex":0.000008211985,"about_ca_topic_score_gemma":0.000007792229,"teacher_disagreement_score":0.04736486,"about_ca_system_score_codex":0.000005100474,"about_ca_system_score_gemma":0.000015315763,"threshold_uncertainty_score":0.6351737},"labels":[],"label_agreement":null},{"id":"W2133707704","doi":"","title":"On the Chromatic Uniqueness of Edge-Gluing of Complete Bipartite Graphs and Cycles.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Uniqueness; Chromatic scale; Graph; Foster graph; Chromatic polynomial; Enhanced Data Rates for GSM Evolution; Complete bipartite graph; Friendship graph; Windmill graph; Discrete mathematics; Line graph; Voltage graph; Mathematical analysis; Computer science","score_opus":0.03988452569176727,"score_gpt":0.2837049346007079,"score_spread":0.24382040890894063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133707704","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99761444,0.000049814982,0.00003528518,0.00019316554,0.000073986586,0.00024041349,0.000006562345,0.000030212608,0.0017560923],"genre_scores_gemma":[0.99969274,0.000029245524,0.00017584318,0.00003316825,0.0000011327413,0.000027681424,0.0000016088767,0.00001270488,0.000025879179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992744,0.00009891228,0.00026893363,0.00011235763,0.00012706756,0.000118375756],"domain_scores_gemma":[0.9983138,0.0010079078,0.00018030671,0.00040515015,0.00005871023,0.000034136192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039352765,0.00009808413,0.00021088407,0.00006491926,0.00010074381,0.000008366774,0.00018725745,0.000039224364,0.000028048245],"category_scores_gemma":[0.0001226718,0.00007220999,0.0000577336,0.0003155903,0.00020463085,0.000036663572,0.0000417072,0.000082992025,0.0000037200273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000094363195,0.00013682088,0.0010516973,0.0000690976,0.000028418779,5.7732626e-7,0.00034267377,0.0000014524509,0.0055330563,0.99251795,0.00019703977,0.00011178417],"study_design_scores_gemma":[0.00027962972,0.00005191623,0.002717851,0.000114766684,0.000031789852,0.0000035705314,0.00011236399,0.00009558396,0.00827674,0.98816097,0.000082909915,0.0000719083],"about_ca_topic_score_codex":0.000009324175,"about_ca_topic_score_gemma":0.0000027087813,"teacher_disagreement_score":0.0043569757,"about_ca_system_score_codex":0.000006087536,"about_ca_system_score_gemma":0.000009532162,"threshold_uncertainty_score":0.29446378},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91316015,0.0011064594,0.0699707,0.0043315915,0.000024719095,0.0012421177,0.00015047623,0.00029603386,0.00971776],"genre_scores_gemma":[0.99405646,0.0003268196,0.0045345956,0.00023293485,0.00006380727,0.00031744887,0.000012087819,0.000016894106,0.0004389321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942625,0.000010230187,0.00014628636,0.00022135285,0.00007424034,0.00012164801],"domain_scores_gemma":[0.9994127,0.00020297695,0.000056878773,0.0002176859,0.00002935707,0.00008036644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007993645,0.000104088074,0.00010663136,0.000044644737,0.0002799759,0.000027499946,0.0000906985,0.000050644834,0.00002072099],"category_scores_gemma":[0.000032048003,0.00009194142,0.000024065164,0.00020012129,0.000062172156,0.00006024895,0.000024806643,0.00009042629,0.000061507446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041026424,0.00008883845,0.0000140737375,0.000029912944,0.000007868731,2.0826378e-7,0.00014486344,0.0000034000045,0.00030070043,0.9983715,0.00011166887,0.0009228612],"study_design_scores_gemma":[0.0002504392,0.000026377777,0.00017860967,0.000018316887,0.000026602102,0.00000642742,0.000081359445,0.000060312894,0.0010793828,0.9787042,0.019449072,0.00011888023],"about_ca_topic_score_codex":0.0000016861819,"about_ca_topic_score_gemma":0.000007783775,"teacher_disagreement_score":0.08089633,"about_ca_system_score_codex":0.0000075427297,"about_ca_system_score_gemma":0.000010107448,"threshold_uncertainty_score":0.37492624},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57831556,0.0011089664,0.0015903595,0.0010250432,0.0008758712,0.000091335794,0.00060732086,0.00020488675,0.41618064],"genre_scores_gemma":[0.9857825,0.002141213,0.0024924723,0.0020477774,0.0016497577,0.0032373655,0.0012758459,0.00068364735,0.0006894149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99184906,0.00046214365,0.0020139772,0.001784572,0.0018906619,0.0019995836],"domain_scores_gemma":[0.991246,0.0024881486,0.002138589,0.0027293472,0.00025715324,0.0011407977],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002036999,0.0009249045,0.00041344058,0.0006063473,0.0024495702,0.0011149879,0.002143396,0.002346403,0.36653012],"category_scores_gemma":[0.0011098387,0.0016010344,0.0015631329,0.0015986781,0.0021462846,0.001020353,0.0014580251,0.0018066898,0.0010278372],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092460716,0.0004692604,0.000013341233,0.0007558052,0.0012582083,0.00010608963,0.0016350155,0.00028502615,0.007047366,0.79941094,0.1864462,0.0016481605],"study_design_scores_gemma":[0.0025228313,0.00097183435,0.0001174354,0.00058707746,0.0017546108,0.0007164342,0.0013971365,0.03531241,0.93974465,0.0039328784,0.011393503,0.0015492262],"about_ca_topic_score_codex":0.0009994215,"about_ca_topic_score_gemma":0.0017198492,"teacher_disagreement_score":0.93269724,"about_ca_system_score_codex":0.000008336499,"about_ca_system_score_gemma":0.0009621494,"threshold_uncertainty_score":0.999922},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8544212,0.000009618613,0.118080765,0.00048565,0.000015850925,0.0000635116,0.000043482258,0.000040376122,0.026839573],"genre_scores_gemma":[0.9884053,0.000001426656,0.010880568,0.000047631285,0.0000038791018,0.0000021634528,0.00003567815,0.0000019240636,0.0006214644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972415,0.000009423694,0.00010933001,0.00008572051,0.000029173401,0.000042182855],"domain_scores_gemma":[0.99930316,0.00008025466,0.0000349423,0.0005559932,0.00001293925,0.000012705903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000117004725,0.00002648734,0.00010106192,0.00007415663,0.000008208754,0.000001949542,0.00025327757,0.00001877089,0.00062232],"category_scores_gemma":[0.000044705856,0.000021011652,0.00003306454,0.0002851808,0.00004219181,0.00002416714,0.000079101614,0.000021255515,0.0000130194785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011581675,0.000057566413,0.00039850667,0.0000029859843,0.0002201299,1.9224593e-7,0.00009356722,0.0000073235797,0.00013133483,0.9986099,0.00037094404,0.00010636309],"study_design_scores_gemma":[0.0000777329,0.000007824804,0.00058121886,0.0000014498011,0.00037835716,7.954671e-7,0.0001052746,0.00023208503,0.0021846492,0.9958393,0.0005610954,0.000030206986],"about_ca_topic_score_codex":0.000060536124,"about_ca_topic_score_gemma":0.00024695788,"teacher_disagreement_score":0.13398409,"about_ca_system_score_codex":0.0000026645914,"about_ca_system_score_gemma":0.0000050642825,"threshold_uncertainty_score":0.6813968},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9945125,0.00016153633,0.0034727359,0.00010751343,0.00006877539,0.00045719199,0.00003349779,0.000049119943,0.0011371583],"genre_scores_gemma":[0.9119396,0.0001002654,0.08749548,0.0000016151151,0.00006507704,8.6155717e-7,0.000006828288,0.000018973502,0.00037128318],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809563,0.0003016138,0.00032348122,0.00037131173,0.0005034472,0.00040452785],"domain_scores_gemma":[0.9976722,0.0006500412,0.00020793059,0.0004279237,0.0008546532,0.00018723022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010089051,0.00014814192,0.0003532698,0.0004301411,0.00069172325,0.00003433086,0.0003360228,0.00015375775,0.00011654185],"category_scores_gemma":[0.00014211886,0.00017226062,0.00010555998,0.0007522231,0.00095693575,0.00032636043,0.00019574068,0.0005603987,0.0000032270416],"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.00015905465,0.00079925195,0.009001179,0.0008347509,0.0002775957,0.000018388782,0.0023140924,0.0003721307,0.594216,0.38754377,0.00012555525,0.00433826],"study_design_scores_gemma":[0.002375946,0.000682773,0.019470962,0.0013093376,0.00029794752,0.00033648152,0.032320168,0.07735534,0.026670955,0.83836746,0.00008795745,0.000724674],"about_ca_topic_score_codex":0.0026807312,"about_ca_topic_score_gemma":0.000027927183,"teacher_disagreement_score":0.567545,"about_ca_system_score_codex":0.00006630198,"about_ca_system_score_gemma":0.00022287593,"threshold_uncertainty_score":0.70245844},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98937494,0.00020956226,0.00034223605,0.0013644069,0.0009648587,0.00018616213,0.0000056080453,0.000020667276,0.007531575],"genre_scores_gemma":[0.99818873,0.000048199603,0.0009403356,0.00007506749,0.00032633933,0.000005455937,3.1055524e-7,0.000018823484,0.00039671786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984156,0.0004096503,0.00059154077,0.000081484985,0.0003575643,0.00014416438],"domain_scores_gemma":[0.99703413,0.001570127,0.00067512767,0.00040707094,0.00025351808,0.0000600359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002495638,0.00013884045,0.00031147606,0.000104899766,0.00016389236,0.000022453061,0.0004772031,0.000073164185,0.00030812828],"category_scores_gemma":[0.00077743776,0.00008616905,0.00027191915,0.00022358225,0.0002808289,0.00019367212,0.0000345165,0.00025977448,0.000006477115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052553025,0.00026413414,0.000008757867,0.000012300785,0.00009951221,0.0000017122466,0.000566095,0.000006990078,0.003138472,0.9918642,0.0029862754,0.0005260243],"study_design_scores_gemma":[0.0004589449,0.0003217587,0.000024465282,0.000060737526,0.000068542155,0.00002574479,0.0004901686,0.0000012220621,0.041939445,0.94689554,0.009629836,0.00008360855],"about_ca_topic_score_codex":2.3553277e-7,"about_ca_topic_score_gemma":3.0258676e-7,"teacher_disagreement_score":0.04496867,"about_ca_system_score_codex":0.000020855226,"about_ca_system_score_gemma":0.00003780204,"threshold_uncertainty_score":0.3513872},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9686681,0.000057339665,0.027217865,0.000115634066,0.00017736698,0.00035140713,0.00029833903,0.00007586395,0.0030380643],"genre_scores_gemma":[0.99754107,0.00007617625,0.000067411704,0.0000065069344,0.00005737099,0.0000026670377,0.00010123415,0.000013243083,0.0021342945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990933,0.00011575538,0.00019619035,0.00032769365,0.00007640108,0.00019065845],"domain_scores_gemma":[0.99823624,0.00029234725,0.00031460047,0.0008102968,0.00025336898,0.00009312929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051635376,0.00017254465,0.00021671099,0.000043415228,0.00020808996,0.000020630057,0.00063089124,0.00018838655,0.00001604143],"category_scores_gemma":[0.00010903609,0.0001509777,0.00019279009,0.00025148335,0.00026445466,0.000042526553,0.00043599444,0.00034495236,0.000023172599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046421137,0.00009100399,0.00019929596,0.000045806137,0.00007783908,0.0000054905545,0.00009426142,0.002241475,0.0000114004015,0.9952018,0.0018650969,0.00012008379],"study_design_scores_gemma":[0.00025445712,0.000018389059,0.00026773763,0.000036065307,0.00014157487,0.0000018462875,0.00018909526,0.00423471,0.00013362616,0.9895805,0.0049752314,0.00016676911],"about_ca_topic_score_codex":0.000028421828,"about_ca_topic_score_gemma":0.000033877688,"teacher_disagreement_score":0.028872976,"about_ca_system_score_codex":0.000104318984,"about_ca_system_score_gemma":0.00013929841,"threshold_uncertainty_score":0.61566925},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98275846,0.00090840075,0.011834534,0.0009948994,0.00002504916,0.0006354881,0.00003958859,0.00009862583,0.0027049538],"genre_scores_gemma":[0.99455243,0.00016512437,0.0048298934,0.00003952501,0.000048758648,0.00014529747,0.000008360296,0.000017299903,0.00019330795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991822,0.000033635137,0.0002703285,0.00023887724,0.00011727734,0.00015762923],"domain_scores_gemma":[0.99914753,0.00018857724,0.00012471176,0.00030387516,0.000070682465,0.00016461818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026004112,0.0001229251,0.00017899257,0.00007669113,0.00014710418,0.000017099155,0.00014616273,0.00006194752,0.000016298804],"category_scores_gemma":[0.000073881856,0.00011408251,0.000038660477,0.00029099855,0.000080414175,0.0001007811,0.000071951246,0.00011320887,0.000013284649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043314108,0.00008324997,0.00032614468,0.0000621396,0.000014686888,1.8461748e-7,0.00033451684,5.382194e-7,0.0032040284,0.99394494,0.00012424574,0.001901016],"study_design_scores_gemma":[0.00027083227,0.000038789014,0.00083861087,0.000025749709,0.000051724022,0.000014153932,0.00037137495,0.00031610532,0.006243427,0.9893798,0.0023058,0.00014361525],"about_ca_topic_score_codex":0.0000062203667,"about_ca_topic_score_gemma":0.00000922248,"teacher_disagreement_score":0.011793973,"about_ca_system_score_codex":0.0000051021275,"about_ca_system_score_gemma":0.000025222733,"threshold_uncertainty_score":0.46521497},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87589866,0.0022774057,0.107077755,0.0012077594,0.0001490057,0.007406359,0.002301633,0.00041240212,0.0032689983],"genre_scores_gemma":[0.97026205,0.00033159877,0.02389913,0.00007270026,0.00016590871,0.004563446,0.0003267797,0.00007547869,0.00030290845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983286,0.000072249895,0.00058246957,0.00058208534,0.00017412011,0.00026043638],"domain_scores_gemma":[0.99708855,0.0010604494,0.00045737487,0.00079003326,0.0004523496,0.00015124294],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006296278,0.00033001238,0.0005913549,0.00020612597,0.00024299674,0.000034048677,0.00039915118,0.0003296182,0.000016493455],"category_scores_gemma":[0.0003308671,0.0003241709,0.00022910407,0.00029218284,0.00016638967,0.00006440133,0.0003209862,0.00034274536,0.00000794619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018370856,0.00021078416,0.000041536925,0.00073839823,0.0001115643,7.46174e-8,0.00046275734,0.000018974486,0.0008795033,0.99463195,0.0008640992,0.0020220024],"study_design_scores_gemma":[0.00036790525,0.000037451216,0.00007063147,0.00007093724,0.00023581448,0.0000028813151,0.00039369563,0.0017611482,0.003339527,0.986236,0.0071648406,0.00031918177],"about_ca_topic_score_codex":0.000015168956,"about_ca_topic_score_gemma":0.000019331806,"teacher_disagreement_score":0.09436337,"about_ca_system_score_codex":0.000021014488,"about_ca_system_score_gemma":0.000121071214,"threshold_uncertainty_score":0.999921},"labels":[],"label_agreement":null},{"id":"W214563378","doi":"","title":"Mutually Independent Hamiltonian Cycles in Some Graphs","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hamiltonian path; Hamiltonian (control theory); Combinatorics; Pure mathematics; Graph; Mathematical optimization","score_opus":0.026747679570385416,"score_gpt":0.29026433268558555,"score_spread":0.2635166531152001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W214563378","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9951627,0.00015677405,0.0000050398016,0.00014080359,0.00055807194,0.00024571916,0.000004373239,0.000097427095,0.0036290688],"genre_scores_gemma":[0.9991788,0.000016665404,0.00043984884,0.0000925295,0.000011355647,0.00008602843,0.0000042804836,0.00002518438,0.00014526353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989145,0.00008977007,0.00026673562,0.00016487372,0.00018958993,0.00037457893],"domain_scores_gemma":[0.9991238,0.00022886753,0.00008394684,0.00041083392,0.000025992713,0.00012654542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005747367,0.00014458214,0.0001866204,0.00014264233,0.0001012594,0.000021348771,0.00025518294,0.000105276435,0.0000567728],"category_scores_gemma":[0.000085837164,0.0001422921,0.00007659365,0.0002813016,0.000061461564,0.00026293163,0.0000720603,0.00021395963,0.000120187484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005515175,0.0004691282,0.023112698,0.000015203282,0.000015404505,0.000001805004,0.00087818905,2.7105187e-7,0.00052045286,0.97424906,0.0004968976,0.00023538788],"study_design_scores_gemma":[0.000491191,0.000016790911,0.04296425,0.000018788392,0.000014183662,0.0000042923284,0.00020624901,0.0000034956918,0.0012457318,0.9542221,0.0006512973,0.00016162178],"about_ca_topic_score_codex":0.00001534889,"about_ca_topic_score_gemma":0.000014897453,"teacher_disagreement_score":0.020026939,"about_ca_system_score_codex":0.000038180304,"about_ca_system_score_gemma":0.00001808155,"threshold_uncertainty_score":0.5802503},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9706006,0.0037616966,0.01293881,0.00045203735,0.000045844215,0.0010487452,0.000104096376,0.000174795,0.010873377],"genre_scores_gemma":[0.9887189,0.0003209318,0.0101329,0.000045502926,0.00010063307,0.00030400767,0.000015068037,0.000017030665,0.0003450047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929,0.000024455288,0.00026241862,0.00013981003,0.000098887256,0.00018444122],"domain_scores_gemma":[0.9991449,0.00024625502,0.00013269932,0.00029548278,0.00006820355,0.00011246629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019965232,0.00010671986,0.00015238118,0.0000822853,0.0001613876,0.000007862726,0.00014799944,0.0000664922,0.00010780301],"category_scores_gemma":[0.00003825863,0.00009384001,0.0000614376,0.0003916797,0.000063230094,0.00012656121,0.00004316019,0.0000862386,0.000064569394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018862652,0.0001979863,0.0006713214,0.000064637024,0.000017547725,1.5912013e-8,0.00024830113,9.641992e-8,0.0028746002,0.99426734,0.00039935845,0.001256911],"study_design_scores_gemma":[0.00015816417,0.000017159331,0.0015203739,0.00001342439,0.00009269781,0.0000059508716,0.00017467543,0.000039558054,0.011016391,0.95241165,0.034390062,0.00015987655],"about_ca_topic_score_codex":0.0000023945786,"about_ca_topic_score_gemma":9.0423225e-7,"teacher_disagreement_score":0.04185567,"about_ca_system_score_codex":0.0000032724877,"about_ca_system_score_gemma":0.000009060683,"threshold_uncertainty_score":0.38266847},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7103602,0.0059742285,0.23386757,0.006548024,0.00007019357,0.003486943,0.00007837455,0.0004632864,0.039151125],"genre_scores_gemma":[0.99518585,0.00010948501,0.003066715,0.00018473744,0.00013083756,0.00046145826,0.000009851137,0.000019410256,0.0008316616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924296,0.00004616899,0.00023781523,0.00019460933,0.000117274685,0.00016119206],"domain_scores_gemma":[0.99897337,0.0004486523,0.000090391695,0.0002778578,0.000078879624,0.00013085983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005156513,0.0001181252,0.00015057481,0.000035117686,0.00041041945,0.000037769525,0.00013718168,0.000066388326,0.00001336224],"category_scores_gemma":[0.00012274495,0.000080489925,0.000038527563,0.00019964323,0.00029294373,0.00010978275,0.00008416822,0.0001640037,0.00004898397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011821832,0.000029545228,0.00009123602,0.000019470708,0.000016629834,8.2330374e-8,0.0009141859,0.00000295784,0.00003235248,0.99477285,0.00046513634,0.0036437453],"study_design_scores_gemma":[0.00075650634,0.000022188244,0.00015965135,0.000010985319,0.00008009144,0.000024325323,0.0011632292,0.006921009,0.00043339116,0.9732801,0.017019412,0.00012915592],"about_ca_topic_score_codex":0.0000075912626,"about_ca_topic_score_gemma":0.0000055501446,"teacher_disagreement_score":0.2848256,"about_ca_system_score_codex":0.000008322348,"about_ca_system_score_gemma":0.00002886994,"threshold_uncertainty_score":0.32822838},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9576033,0.00030617486,0.035961337,0.0008164503,0.00029427264,0.000297763,0.000005743,0.000016839147,0.0046981224],"genre_scores_gemma":[0.9961345,0.00002875216,0.0034862466,0.00008171201,0.000055982327,0.0000010894155,2.8835163e-7,0.000020371623,0.00019105621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990813,0.00013305311,0.0003840049,0.00007043189,0.00019188631,0.00013932404],"domain_scores_gemma":[0.998476,0.00052211544,0.0004649566,0.00026431042,0.00021073093,0.00006187615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009062562,0.00010701929,0.00020413418,0.00007492931,0.00010856421,0.00003093124,0.00036079463,0.000013460452,0.000010949789],"category_scores_gemma":[0.00013580028,0.00006255206,0.00018687395,0.00024599626,0.00008709912,0.00007080885,0.000010212717,0.00018448236,0.0000016149348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018250613,0.0003934016,0.0001316989,0.000015434782,0.00009350094,0.000020346106,0.00035050692,0.0000074557042,0.00061555963,0.9928461,0.004483544,0.00085997616],"study_design_scores_gemma":[0.0014724762,0.0017022548,0.0039253524,0.00005828823,0.00018085392,0.000095477735,0.00010124428,0.000011549462,0.0015042506,0.9844508,0.0063857785,0.00011165331],"about_ca_topic_score_codex":7.8832024e-8,"about_ca_topic_score_gemma":1.4718012e-7,"teacher_disagreement_score":0.038531203,"about_ca_system_score_codex":0.000011349782,"about_ca_system_score_gemma":0.000024428886,"threshold_uncertainty_score":0.25507993},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90475106,0.005558937,0.009859469,0.05351044,0.00013704985,0.007019178,0.0014043011,0.00027360543,0.017485974],"genre_scores_gemma":[0.9953751,0.0003428937,0.00037266893,0.0002900654,0.000055896384,0.00040597003,0.000006466164,0.000015935462,0.003134998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921876,0.000036673602,0.00028065988,0.0001692943,0.00013433701,0.00016027893],"domain_scores_gemma":[0.9989381,0.00032299355,0.00014894543,0.000490221,0.00004868564,0.00005106019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014360857,0.00010720618,0.000113789,0.000015172711,0.0005835613,0.000022426933,0.00032944928,0.0000374823,0.00018329766],"category_scores_gemma":[0.000031416625,0.000064149426,0.00006865149,0.00023907375,0.0000921535,0.000032055086,0.000080119986,0.000100250465,0.000050272407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014323692,0.000117525604,0.000039824812,0.00002038369,0.000021647056,2.117209e-8,0.0002802984,1.695479e-7,0.002849883,0.9819611,0.013413433,0.0012943028],"study_design_scores_gemma":[0.00037491682,0.000038704067,0.0003056306,0.000019833342,0.00009636681,0.0000062810154,0.00021919738,0.004433302,0.04313388,0.5390035,0.41216505,0.00020336267],"about_ca_topic_score_codex":0.000001523946,"about_ca_topic_score_gemma":0.0000048947277,"teacher_disagreement_score":0.4429576,"about_ca_system_score_codex":0.0000061496585,"about_ca_system_score_gemma":0.00000585039,"threshold_uncertainty_score":0.4488341},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9844561,0.00004914178,0.010987629,0.000057369853,0.00022136248,0.00040244134,0.00007348126,0.0001586228,0.0035938327],"genre_scores_gemma":[0.9978371,0.000056756133,0.00064091105,0.000016359652,0.00037448228,0.0000022568638,0.000046040102,0.00003609974,0.0009899632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987482,0.00012361421,0.00023152785,0.0005382637,0.000058115522,0.00030030753],"domain_scores_gemma":[0.998564,0.0003184226,0.00028095045,0.0006088723,0.00004400527,0.00018376647],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003305431,0.00028001357,0.00035470343,0.00017459551,0.00023868667,0.000044465058,0.00032252152,0.00045833612,0.000059000162],"category_scores_gemma":[0.000053384607,0.00033954874,0.00016446851,0.00019048594,0.00014731691,0.00020315341,0.0005986407,0.0006315402,0.000048692786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001396352,0.00016427683,0.063850395,0.00029023192,0.0003670478,0.000018540872,0.0009071735,0.0013549533,0.0003566236,0.92993075,0.0020760817,0.00054427475],"study_design_scores_gemma":[0.0014339986,0.000044544657,0.033724576,0.00019284498,0.0012869694,0.000008261751,0.00026703704,0.0025533226,0.0004580596,0.95320296,0.0056931223,0.0011343143],"about_ca_topic_score_codex":0.00006359154,"about_ca_topic_score_gemma":0.000013828955,"teacher_disagreement_score":0.03012582,"about_ca_system_score_codex":0.00011601742,"about_ca_system_score_gemma":0.000056571964,"threshold_uncertainty_score":0.99990565},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9321264,0.000035537687,0.005812573,0.0011489742,0.000019078743,0.0004204706,0.0001463672,0.0005230595,0.05976755],"genre_scores_gemma":[0.9981307,0.00003717565,0.0012332655,0.00008567598,0.000033714397,3.5073413e-8,0.000057088513,0.0003520164,0.00007033188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990422,0.00014081612,0.00019292328,0.00023966744,0.00021250042,0.0001718673],"domain_scores_gemma":[0.9992691,0.00004792404,0.000091041664,0.00023265611,0.00021233704,0.00014689213],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003125357,0.000090627844,0.0001260693,0.00006772702,0.00060533884,0.00012123008,0.00042215627,0.000044963283,0.0037150963],"category_scores_gemma":[0.00044628617,0.000093585426,0.000044211232,0.0005221723,0.0002082844,0.000110677785,0.00032857087,0.00018474123,0.00063720386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006155573,0.00012929487,0.0001154806,0.00014161426,0.000044891192,0.0000063905127,0.0023897935,0.000002159968,0.009639192,0.96173996,0.020665195,0.0050644716],"study_design_scores_gemma":[0.0015177451,0.00044660535,0.0042583724,0.00008689437,0.00010929988,0.00045855265,0.0019653488,0.0002468971,0.0109806545,0.6278934,0.3514414,0.0005947983],"about_ca_topic_score_codex":0.000003896851,"about_ca_topic_score_gemma":1.9056985e-7,"teacher_disagreement_score":0.33384654,"about_ca_system_score_codex":0.000009331195,"about_ca_system_score_gemma":0.000001748763,"threshold_uncertainty_score":0.99719566},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75796026,0.000069702946,0.09711335,0.0027052765,0.00006935128,0.0015023191,0.00010928275,0.00015634662,0.1403141],"genre_scores_gemma":[0.9831024,0.000034739132,0.012222642,0.000029025674,0.00007455264,0.00009754186,0.000028253127,0.000020895108,0.004389995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985018,0.00017847147,0.00035118885,0.00020032012,0.0004814214,0.00028680766],"domain_scores_gemma":[0.99752456,0.0013831872,0.000027473716,0.00055443094,0.0004147272,0.00009559408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002428816,0.00008538553,0.00013117367,0.000518323,0.00056111976,0.000043431253,0.00028464542,0.00008503963,0.00021270814],"category_scores_gemma":[0.0010067932,0.00007504214,0.00006129838,0.00124432,0.00018334597,0.0000953016,0.000052289473,0.00025710728,0.0001171184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019325142,0.00033604837,0.000046660192,0.00002336763,0.00001107492,0.000001053534,0.000710519,0.00020009058,0.0074046734,0.98588026,0.0028421828,0.002524749],"study_design_scores_gemma":[0.0011679173,0.0005206734,0.0035626045,0.00018226987,0.000050582636,0.0000118416865,0.0022227245,0.0048645614,0.11924378,0.83420837,0.03351362,0.00045103353],"about_ca_topic_score_codex":0.00007375297,"about_ca_topic_score_gemma":0.000997015,"teacher_disagreement_score":0.22514209,"about_ca_system_score_codex":0.00004616448,"about_ca_system_score_gemma":0.00009004313,"threshold_uncertainty_score":0.4315736},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94778764,0.0005420474,0.045856655,0.00044450743,0.00020821772,0.001031843,0.0038637246,0.000102149585,0.00016322764],"genre_scores_gemma":[0.99185777,0.000084513464,0.006670718,0.00035635717,0.0000754996,0.00022548373,0.0004239435,0.000059102935,0.00024664274],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981297,0.00025285376,0.000510146,0.00037469738,0.00008268032,0.0006498893],"domain_scores_gemma":[0.99825674,0.00051194796,0.00039095143,0.00061802834,0.000086452,0.00013587509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009036174,0.0003224936,0.0005875739,0.0001130978,0.00016856233,0.000013728509,0.0004158045,0.00029554163,0.00007021544],"category_scores_gemma":[0.00014876005,0.00023510879,0.00033500718,0.00019738637,0.00022009696,0.00008820268,0.0001622436,0.00016225257,0.0000077913155],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002278925,0.001108298,0.0004760757,0.00009466494,0.00051490485,0.0000044928897,0.00049416325,2.371981e-7,0.6436481,0.34976277,0.0023019374,0.0013664481],"study_design_scores_gemma":[0.0008811026,0.00030451376,0.0006957148,0.00003079764,0.00016085936,0.000036276615,0.0004565895,0.00009646119,0.7934501,0.19379796,0.009691183,0.0003984014],"about_ca_topic_score_codex":0.000039683466,"about_ca_topic_score_gemma":0.000042019456,"teacher_disagreement_score":0.15596482,"about_ca_system_score_codex":0.000028285185,"about_ca_system_score_gemma":0.00003410821,"threshold_uncertainty_score":0.9587458},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9621551,0.00007129377,0.03566542,0.0008693539,0.00030611837,0.0001399412,0.000009854943,0.0000063915318,0.00077654864],"genre_scores_gemma":[0.9621565,0.000021662081,0.03769597,0.000033883818,0.00006888083,0.000004268751,5.3374805e-7,0.000009298997,0.000009023954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985412,0.00021444546,0.0008285284,0.00007694125,0.00017866831,0.00016026651],"domain_scores_gemma":[0.99585146,0.002296026,0.0010944959,0.00037447005,0.00032219637,0.00006137679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001329401,0.00010173045,0.00050122256,0.00012988115,0.00011935728,0.00000766465,0.00048437793,0.00009139061,0.00010737874],"category_scores_gemma":[0.0006782974,0.000063747415,0.00032139284,0.00018892573,0.0009904968,0.00005459577,0.000039431703,0.00042662845,0.0000018296577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025975256,0.00019841485,0.0012295997,0.000028400946,0.0001111753,0.0000017090728,0.00033034437,6.330842e-7,0.037355147,0.95937926,0.0006758333,0.0004297507],"study_design_scores_gemma":[0.0011639115,0.00014688798,0.0039375797,0.000013776305,0.0000772907,0.00017003003,0.00016499635,0.000015952339,0.007933402,0.98531467,0.0010047087,0.00005681775],"about_ca_topic_score_codex":0.000007132237,"about_ca_topic_score_gemma":0.00011715802,"teacher_disagreement_score":0.029421747,"about_ca_system_score_codex":0.000004252505,"about_ca_system_score_gemma":0.00003514808,"threshold_uncertainty_score":0.36495268},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.836641,0.0009714217,0.0008272163,0.0012432834,0.012562659,0.00011372189,0.00033863515,0.00020641205,0.14709564],"genre_scores_gemma":[0.98824173,0.0010405767,0.0022547955,0.0009044633,0.0052285674,0.00075292983,0.00025599814,0.00076165533,0.00055926637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9901335,0.000911337,0.002739214,0.0013423347,0.0025290232,0.002344543],"domain_scores_gemma":[0.9863508,0.005089802,0.0040566544,0.002663885,0.00056942704,0.0012694593],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.006199726,0.0010422685,0.0005956627,0.00050013524,0.0036401418,0.0019146566,0.003265577,0.0025927331,0.075143896],"category_scores_gemma":[0.004615697,0.001655442,0.0028827304,0.0011175413,0.0028918397,0.0018463787,0.0016420876,0.0029830614,0.0010718269],"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.004526382,0.0005847458,0.0000070028423,0.0007899318,0.0019033434,0.00039896482,0.002470749,0.00014027051,0.004302559,0.790733,0.19281292,0.0013301698],"study_design_scores_gemma":[0.003115276,0.0024710246,0.00002772729,0.00085757644,0.0022808297,0.0019141095,0.0036091653,0.002040497,0.8045479,0.15745772,0.020202726,0.0014754547],"about_ca_topic_score_codex":0.00025001366,"about_ca_topic_score_gemma":0.0005140413,"teacher_disagreement_score":0.80024534,"about_ca_system_score_codex":0.000026100084,"about_ca_system_score_gemma":0.0018190574,"threshold_uncertainty_score":0.9998217},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9929118,0.00017205246,0.005549201,0.00032002287,0.000037079426,0.00016881431,0.000003611104,0.000025024423,0.0008123657],"genre_scores_gemma":[0.9984138,0.00009517515,0.0011156017,0.00010333759,0.000110801375,0.00000494671,0.0000019839986,0.000036559002,0.00011776392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837387,0.000161359,0.0004934683,0.00017802983,0.00035324527,0.0004400364],"domain_scores_gemma":[0.9983747,0.00032492136,0.00055006274,0.00040865617,0.00021696369,0.00012467935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010195561,0.00019192978,0.00039711848,0.0002309972,0.00013447765,0.000020242778,0.0003439918,0.000081125814,0.00017291111],"category_scores_gemma":[0.00009608793,0.0001438585,0.00018475653,0.00041359305,0.00013070101,0.00021986169,0.000013262685,0.00059359166,0.000012308822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042895667,0.0007767447,0.0014539628,0.000017017195,0.00020830947,0.000012335232,0.00024188467,0.000014379202,0.003547108,0.9924508,0.00011885317,0.00072965946],"study_design_scores_gemma":[0.0011165442,0.0023679328,0.001556213,0.00007920119,0.00013044005,0.000499459,0.00018988577,0.00007401551,0.014184394,0.9788792,0.00074039714,0.00018228803],"about_ca_topic_score_codex":0.0000047562394,"about_ca_topic_score_gemma":0.00003035645,"teacher_disagreement_score":0.013571559,"about_ca_system_score_codex":0.000062775456,"about_ca_system_score_gemma":0.00021544316,"threshold_uncertainty_score":0.5866379},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98623157,0.000018575689,0.0067655803,0.00064265914,0.000059724287,0.0008475882,0.000058713562,0.00014293246,0.0052326717],"genre_scores_gemma":[0.99205804,0.000010758496,0.0064213746,0.00022093148,0.00025306887,0.0004209589,0.000028928845,0.000034511642,0.0005514197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989579,0.000038111903,0.00025702475,0.00038143797,0.00014950593,0.00021605624],"domain_scores_gemma":[0.9986237,0.00054245867,0.00012771242,0.00046125625,0.000118566364,0.00012628145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030470706,0.00018418166,0.00018540029,0.00007886046,0.00054743525,0.00006536572,0.00017054484,0.00014929731,0.00046447097],"category_scores_gemma":[0.0001633593,0.00017342139,0.00007568487,0.00032301585,0.00010523782,0.0001576735,0.0000518648,0.0003333033,0.00020997722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007589879,0.00022513501,0.00019690802,0.000021111164,0.000019006118,1.861553e-7,0.0001510666,8.9403727e-7,0.024087254,0.97369903,0.00020382422,0.0013879846],"study_design_scores_gemma":[0.00042674987,0.000021198935,0.0011664877,0.000016059828,0.00008065803,0.00003252188,0.00008517061,0.0031864236,0.01443545,0.9630065,0.017242078,0.0003007331],"about_ca_topic_score_codex":0.0000062208965,"about_ca_topic_score_gemma":0.000017197563,"teacher_disagreement_score":0.017038254,"about_ca_system_score_codex":0.000013916301,"about_ca_system_score_gemma":0.000031385567,"threshold_uncertainty_score":0.7071919},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9971233,0.00064564735,0.00018440651,0.0006087111,0.00013964063,0.00028202636,0.000014879906,0.000015863725,0.0009855153],"genre_scores_gemma":[0.9987825,0.00010994871,0.0009171207,0.000031434607,0.00003728812,0.0000039956076,6.078269e-7,0.000014492547,0.00010260762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830383,0.00046860028,0.0007040468,0.00009667626,0.0003024705,0.00012436433],"domain_scores_gemma":[0.9968274,0.0010396264,0.0012861466,0.00043532197,0.0003676186,0.00004389139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015397307,0.00012860534,0.00034551238,0.00021683132,0.00015123449,0.0000060984544,0.00033518375,0.000064411994,0.000047764774],"category_scores_gemma":[0.0006464043,0.00007082647,0.0002606902,0.0009557799,0.00060991145,0.00011450957,0.000044773707,0.00022598416,5.312407e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031615922,0.00051280303,0.0012815243,0.00023367452,0.0005299219,3.1287797e-7,0.0025569643,0.000019044506,0.06746142,0.92393124,0.0016153719,0.0015415533],"study_design_scores_gemma":[0.00059819274,0.00013737488,0.017589094,0.0002918839,0.0005977481,0.00004282602,0.0014515785,0.000015005276,0.033112083,0.94578475,0.00029295497,0.0000865379],"about_ca_topic_score_codex":0.000005030285,"about_ca_topic_score_gemma":0.000009055237,"teacher_disagreement_score":0.03434934,"about_ca_system_score_codex":0.000012091082,"about_ca_system_score_gemma":0.00005863986,"threshold_uncertainty_score":0.28882197},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9873777,0.0012096165,0.008002955,0.0016244868,0.000008474293,0.00076255127,0.000033365322,0.00004111989,0.000939705],"genre_scores_gemma":[0.99599606,0.0007386146,0.0027515576,0.00006486728,0.000023982138,0.00033075747,0.00000372243,0.000010252889,0.00008017187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948317,0.00001676891,0.00017785569,0.00015908365,0.00006349651,0.00009960423],"domain_scores_gemma":[0.999211,0.00039705643,0.0000767547,0.00020659891,0.00004867265,0.000059924078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013418151,0.000081745995,0.000101888094,0.000032177413,0.00028439076,0.00001831509,0.00007657899,0.000039105817,0.0000032365328],"category_scores_gemma":[0.00004446854,0.000058783324,0.000027606762,0.00013137973,0.00019378922,0.00004364226,0.000046390953,0.00007246736,0.0000034090172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002473284,0.000048230606,0.000049567043,0.000022375641,0.000018521207,3.9533916e-8,0.0004148068,2.1952935e-7,0.0028063213,0.99389845,0.000014214956,0.00272476],"study_design_scores_gemma":[0.00022940105,0.000025506082,0.002226886,0.000014282573,0.000045739558,0.0000068606814,0.00039264234,0.000024898723,0.0069625173,0.9855723,0.00441353,0.00008544775],"about_ca_topic_score_codex":0.0000032421754,"about_ca_topic_score_gemma":0.0000047077074,"teacher_disagreement_score":0.008618347,"about_ca_system_score_codex":0.0000032044618,"about_ca_system_score_gemma":0.000010403683,"threshold_uncertainty_score":0.23971145},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8345313,0.00002829245,0.012210096,0.00055314327,0.000039046987,0.003212273,0.000022205026,0.00019945465,0.1492042],"genre_scores_gemma":[0.62888545,0.000014125592,0.36084494,0.00021521044,0.000038018854,0.0010375102,0.000011169292,0.00009710658,0.008856481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985234,0.000082352206,0.00045671596,0.0003006083,0.00027495422,0.0003619751],"domain_scores_gemma":[0.9978646,0.00063420716,0.00027235397,0.0009819866,0.000093861716,0.00015299625],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006150701,0.00026875557,0.00041805822,0.000105658895,0.00027384295,0.0003603684,0.0009741324,0.000067505876,0.0014488093],"category_scores_gemma":[0.00012695156,0.00019258441,0.00008975022,0.0004910767,0.00012961765,0.00038897962,0.00020332492,0.00017125257,0.0008756722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005591364,0.0004277634,0.00008889936,0.00008504014,0.0000655385,0.0000028770207,0.0009445714,0.0000018656146,0.00082047173,0.9901836,0.0064734374,0.0009003721],"study_design_scores_gemma":[0.0006493607,0.00006241118,0.000119885575,0.000088969755,0.00008435962,0.000042657943,0.0011276401,0.0002520725,0.001594882,0.99469703,0.0009808225,0.0002998937],"about_ca_topic_score_codex":0.000051852337,"about_ca_topic_score_gemma":0.0000311703,"teacher_disagreement_score":0.34863484,"about_ca_system_score_codex":0.000023761775,"about_ca_system_score_gemma":0.000040641855,"threshold_uncertainty_score":0.99990225},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9882129,0.0030735112,0.0045186663,0.0013161682,0.00028311103,0.00080361083,0.00003217667,0.0000070281762,0.0017528485],"genre_scores_gemma":[0.9981223,0.0012796662,0.00005381286,0.0000070493347,0.000046782494,0.0000202909,0.0000013430588,0.000025654806,0.00044314703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99766845,0.00053489377,0.0009354933,0.0001282426,0.0004724805,0.0002604295],"domain_scores_gemma":[0.99418163,0.00067294075,0.0033820202,0.0011489345,0.00057952676,0.000034943896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024271817,0.00022259499,0.0006836304,0.00006160582,0.0003050458,0.000027879749,0.0016175883,0.00013225674,0.000009290333],"category_scores_gemma":[0.0005404435,0.000091049,0.0004602425,0.00020516338,0.0009690871,0.000047798057,0.00041860988,0.0009590544,1.8609471e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007692674,0.0002270751,0.00091618166,0.00019237003,0.00043391786,1.4611497e-7,0.0009043875,0.000053196567,0.00015706972,0.996726,0.00024380528,0.00006892564],"study_design_scores_gemma":[0.0008197812,0.00006579345,0.0004948239,0.0002531029,0.00075334054,0.00003790609,0.00017853583,0.00013467582,0.0024246979,0.9945486,0.00019043163,0.00009826242],"about_ca_topic_score_codex":0.0000352696,"about_ca_topic_score_gemma":0.000015683658,"teacher_disagreement_score":0.009909374,"about_ca_system_score_codex":0.00004979403,"about_ca_system_score_gemma":0.0005277137,"threshold_uncertainty_score":0.41666675},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8910322,0.00188724,0.0655704,0.005513418,0.00015101237,0.0019601455,0.000022491686,0.0005073208,0.03335578],"genre_scores_gemma":[0.99109125,0.0000871381,0.007976567,0.000113193404,0.000059569647,0.00013294644,0.0000028756908,0.00004827971,0.00048818154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982991,0.00010745562,0.00045523033,0.000248817,0.00026039506,0.00062895997],"domain_scores_gemma":[0.9973967,0.0015460906,0.0001846115,0.00079503685,0.000027256809,0.000050282128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007094926,0.0002325392,0.0002737418,0.000107527456,0.00025231138,0.000073928415,0.0005295541,0.00008480987,0.00032650903],"category_scores_gemma":[0.00051103137,0.00016024717,0.00015343435,0.00051746663,0.00019087821,0.00010312177,0.00008206641,0.00046866856,0.00008846458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002614771,0.00015963672,0.000041981355,0.00007118297,0.00003251283,0.0000022818697,0.0023417566,0.000016893346,0.00045307633,0.9952924,0.00043608644,0.0011495316],"study_design_scores_gemma":[0.00024906435,0.00003134097,0.000028201537,0.000096131276,0.0000475699,0.000028808365,0.0003396507,0.004344674,0.0011087831,0.99276257,0.00074755185,0.0002156305],"about_ca_topic_score_codex":0.0000039340384,"about_ca_topic_score_gemma":0.00005474568,"teacher_disagreement_score":0.100059055,"about_ca_system_score_codex":0.00006550883,"about_ca_system_score_gemma":0.000016442735,"threshold_uncertainty_score":0.653469},"labels":[],"label_agreement":null},{"id":"W2177700890","doi":"","title":"Extremal bipartite graphs with high girth","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Girth (graph theory); Complete bipartite graph; Graph; Degree (music); Odd graph; Pancyclic graph; Discrete mathematics; Triangle-free graph; Foster graph; 1-planar graph; Graph power; Line graph; Physics","score_opus":0.02002632650413408,"score_gpt":0.26915747818237873,"score_spread":0.24913115167824465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177700890","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9918917,0.000026806205,0.00033457525,0.00011467903,0.00025016433,0.00021873502,0.000003947822,0.00017840644,0.006981026],"genre_scores_gemma":[0.99648345,0.0000034920824,0.002890914,0.00006391318,0.000007734082,0.00002758901,0.000005296548,0.00002778556,0.0004898491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990436,0.000030741947,0.00021499449,0.00021378908,0.0001956178,0.0003012641],"domain_scores_gemma":[0.9989528,0.0003025554,0.0000975563,0.00045827107,0.000073693765,0.00011512622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047402724,0.00014608087,0.0001669784,0.0000941262,0.0001689378,0.000024019393,0.0001954882,0.00006743855,0.00008678363],"category_scores_gemma":[0.000041413554,0.00012009819,0.000056507328,0.00046708464,0.000106910484,0.00009035509,0.00003090419,0.00014621942,0.00006836592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037187154,0.000205077,0.003673819,0.000013668852,0.000030326572,0.000010732494,0.00014033036,3.7974232e-7,0.00060869905,0.9939909,0.0010172685,0.00027161368],"study_design_scores_gemma":[0.00063548423,0.00008474268,0.0050514527,0.00001792413,0.000029746967,0.000010244753,0.00007718092,0.0000026368114,0.0053658974,0.9865778,0.0019772393,0.00016963584],"about_ca_topic_score_codex":0.000010433746,"about_ca_topic_score_gemma":0.000024264897,"teacher_disagreement_score":0.0074130837,"about_ca_system_score_codex":0.000015659833,"about_ca_system_score_gemma":0.000016486074,"threshold_uncertainty_score":0.48974624},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99502605,0.00021755726,0.0002652404,0.00026788583,0.0000401833,0.00003173016,0.000002301105,0.0000031242182,0.004145923],"genre_scores_gemma":[0.99913937,0.000001367445,0.00056740345,0.00003654849,0.00008789558,0.0000017853806,3.9035734e-7,0.0000061837777,0.00015903071],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994804,0.000021333204,0.00024419642,0.000049967723,0.00007972585,0.00012435175],"domain_scores_gemma":[0.99912286,0.00007554268,0.00020290182,0.00011689265,0.00016069334,0.0003210883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029554623,0.00006327465,0.00014971857,0.000023116194,0.00004636323,0.000011540934,0.0001810537,0.00006945686,0.00006985536],"category_scores_gemma":[0.0006925354,0.00004891729,0.00005933823,0.00006311783,0.00012974457,0.000028026132,0.0000062975855,0.00018088098,7.9743177e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005096091,0.0005425984,0.003020125,0.00079296913,0.00049208524,0.0004192734,0.0119878445,0.00292975,0.61127067,0.33316982,0.02720802,0.0076572453],"study_design_scores_gemma":[0.00078074937,0.0001010437,0.00006810418,0.0004205597,0.00004898357,0.00026063394,0.0024662497,0.00015540978,0.537614,0.4569899,0.00089320453,0.00020118951],"about_ca_topic_score_codex":0.000034195935,"about_ca_topic_score_gemma":0.00006184152,"teacher_disagreement_score":0.12382009,"about_ca_system_score_codex":0.000045321027,"about_ca_system_score_gemma":0.00029292895,"threshold_uncertainty_score":0.19947892},"labels":[],"label_agreement":null},{"id":"W2181133991","doi":"","title":"Independent Cycles in a Bipartite Graph.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Graph; Complete bipartite graph; Combinatorics","score_opus":0.025259145208541306,"score_gpt":0.29056747833971486,"score_spread":0.2653083331311735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2181133991","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99619156,0.000043661676,0.00004174651,0.00027982797,0.0001967652,0.00020787773,0.0000025726897,0.00008782328,0.0029481566],"genre_scores_gemma":[0.99922454,0.000011502369,0.00057575817,0.000053366166,0.0000032410808,0.00008181476,0.000002347937,0.000015396174,0.00003204218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992374,0.000036572972,0.00021343917,0.0001749858,0.00013871079,0.00019885712],"domain_scores_gemma":[0.9994393,0.000098990844,0.00005901059,0.00031765012,0.00002461854,0.000060453658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026944975,0.000103507075,0.00013961647,0.000114970244,0.000072763854,0.000020052059,0.00018677865,0.00006751181,0.000034351255],"category_scores_gemma":[0.0000619903,0.00010199609,0.000060594568,0.00039255334,0.000050327213,0.00008194642,0.00004136102,0.0001519963,0.00007929773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005813999,0.00031843595,0.0029205268,0.000010663817,0.000009256714,0.000006736554,0.00047715337,0.000005618791,0.00089664117,0.99517554,0.00009738987,0.000076204524],"study_design_scores_gemma":[0.0008924505,0.00002250841,0.0041936683,0.00003185068,0.000008936864,0.000004047941,0.00012491076,0.000002142353,0.0070989514,0.9873426,0.00016186501,0.00011608954],"about_ca_topic_score_codex":0.000029919238,"about_ca_topic_score_gemma":0.00005927109,"teacher_disagreement_score":0.00783298,"about_ca_system_score_codex":0.000037956415,"about_ca_system_score_gemma":0.000024196444,"threshold_uncertainty_score":0.41592798},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7777288,0.00006602676,0.014056157,0.017793242,0.000092576105,0.0010017996,0.00018968918,0.00019698856,0.18887474],"genre_scores_gemma":[0.99176705,0.0000049801706,0.0033642289,0.00022687113,0.000027464717,0.00007647596,0.00000159066,0.000036841233,0.0044945087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985997,0.00007263229,0.00045787496,0.00023985375,0.00019676915,0.0004331684],"domain_scores_gemma":[0.99758935,0.0010489818,0.00012134821,0.00064073666,0.000083290346,0.0005162936],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00046004404,0.00018061927,0.00032366117,0.0002439831,0.000100195146,0.000013720915,0.000386729,0.00014020737,0.019516379],"category_scores_gemma":[0.001004696,0.00012426045,0.0001575811,0.0002636291,0.0003138099,0.00002520425,0.000033423516,0.00010875813,0.005032033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046645073,0.00005962799,0.00019744478,0.00007537309,0.000025989228,0.0000050963804,0.0000760367,2.766041e-8,0.0006416867,0.97744215,0.018850144,0.002621746],"study_design_scores_gemma":[0.0002753654,0.000022792574,0.0003416268,0.00015143391,0.00002808224,0.000015953954,0.000039128583,0.0000040529717,0.001049897,0.9648544,0.03304147,0.00017574946],"about_ca_topic_score_codex":0.00018919891,"about_ca_topic_score_gemma":0.00058779115,"teacher_disagreement_score":0.21403825,"about_ca_system_score_codex":0.000053913933,"about_ca_system_score_gemma":0.000103494676,"threshold_uncertainty_score":0.9957427},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72333306,0.000006833644,0.004861014,0.000073024465,0.0001963258,0.00022704405,0.00002478164,0.00008081716,0.2711971],"genre_scores_gemma":[0.99643236,0.0000036601562,0.0012108433,0.00003186363,0.00004026931,0.0000027482463,0.0000037526463,0.0000090209305,0.0022654491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905175,0.000095051044,0.00019978362,0.00023165836,0.00026143013,0.00016034728],"domain_scores_gemma":[0.99895257,0.00026322267,0.0001736504,0.0004232362,0.00010838029,0.000078915415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001585493,0.0001475186,0.00014970718,0.0001988101,0.0007390574,0.000013531,0.00041961076,0.000097489516,0.000059946226],"category_scores_gemma":[0.00006456044,0.00012688339,0.00015172503,0.00046527814,0.00068815326,0.0001541519,0.000059715363,0.00022378248,0.000018915756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008201318,0.00021265057,0.0024150813,0.000018604247,0.000052340074,0.00009091449,0.00024606104,0.000026961026,0.0009918079,0.99562055,0.00015711594,0.000085915075],"study_design_scores_gemma":[0.0015042361,0.0002947099,0.075069964,0.00047216794,0.00035531368,0.00028508407,0.0016160654,0.00023352978,0.03329069,0.85459423,0.031383567,0.0009004138],"about_ca_topic_score_codex":0.000090098634,"about_ca_topic_score_gemma":0.000039499588,"teacher_disagreement_score":0.27309933,"about_ca_system_score_codex":0.00007698659,"about_ca_system_score_gemma":0.00014996887,"threshold_uncertainty_score":0.56843066},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99662197,0.00029558083,0.0020181541,0.00011784085,0.00019537467,0.000027191467,0.000005854736,0.0000029046498,0.00071510277],"genre_scores_gemma":[0.9991256,0.00033425074,0.00048155562,0.000022701737,0.000012432759,9.613198e-7,8.134082e-7,0.000005561527,0.000016140308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989353,0.000029163806,0.00058465265,0.000061006554,0.00030711538,0.00008274995],"domain_scores_gemma":[0.9984959,0.00044509425,0.0005229521,0.000082728344,0.0004077915,0.00004554297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006910587,0.00007053342,0.00019746611,0.00045215464,0.000015432117,0.0000072699218,0.0002634755,0.00004692235,0.0000074152645],"category_scores_gemma":[0.00009366277,0.000061505205,0.00010695909,0.00032850634,0.00008341539,0.00009998706,0.000032476084,0.00010081455,6.6209815e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000972247,0.00025716325,0.016379295,0.00001798666,0.0000786477,0.000011822064,0.0003468155,0.0000010163616,0.0010579742,0.98018193,0.00007431899,0.0014958325],"study_design_scores_gemma":[0.0006575619,0.00014542603,0.0058572246,0.00008705099,0.00002546799,0.00003927459,0.0003751112,0.00001368619,0.006640827,0.98578805,0.00031699144,0.000053359945],"about_ca_topic_score_codex":0.000024570623,"about_ca_topic_score_gemma":0.000020156993,"teacher_disagreement_score":0.01052207,"about_ca_system_score_codex":0.000011527982,"about_ca_system_score_gemma":0.000021896874,"threshold_uncertainty_score":0.25081092},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25251877,0.00044766234,0.7249562,0.0019440369,0.00004580842,0.003634387,0.00048209287,0.00014955427,0.015821476],"genre_scores_gemma":[0.9024959,0.000079404614,0.09622406,0.0000383489,0.00005218758,0.00080524996,0.000025071988,0.000041942494,0.0002377932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998704,0.00004408493,0.00055736705,0.00020783233,0.00032422828,0.00016246256],"domain_scores_gemma":[0.9977614,0.00083152024,0.00040707385,0.00073645636,0.00015740236,0.00010611323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007442113,0.00017197261,0.00033053348,0.0000919033,0.00013884864,0.000020615156,0.0003245401,0.00006787305,0.000023425719],"category_scores_gemma":[0.00012558016,0.00011835329,0.00011893751,0.00039267272,0.00029606483,0.000042655774,0.00008342219,0.00013017376,0.000008902775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046034,0.00047051263,0.000006471703,0.00012344307,0.000058543086,6.854024e-8,0.0006915197,0.000008457019,0.00061135035,0.9968733,0.0002933371,0.0008583566],"study_design_scores_gemma":[0.00026015457,0.000077745666,0.00002690563,0.00006472132,0.000109049535,0.0000034211398,0.0017872078,0.0013004255,0.0019809224,0.99366534,0.00059481844,0.00012929806],"about_ca_topic_score_codex":0.000008547667,"about_ca_topic_score_gemma":0.000002228671,"teacher_disagreement_score":0.6499772,"about_ca_system_score_codex":0.000009736374,"about_ca_system_score_gemma":0.000019667932,"threshold_uncertainty_score":0.4826307},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98180556,0.000054390337,0.012117205,0.0008961634,0.0000608812,0.0004376475,0.000025174799,0.000019351359,0.004583605],"genre_scores_gemma":[0.9925338,0.00003632417,0.0068874145,0.00003828986,0.000018989653,0.00004951165,0.00000145801,0.000018979845,0.00041523352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998754,0.0001685623,0.00046306182,0.00012881185,0.0003412986,0.00014424711],"domain_scores_gemma":[0.9963905,0.0024980074,0.00044618075,0.00051594776,0.00010013784,0.000049213155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011726265,0.00015488942,0.0002808173,0.000014081944,0.0003747849,0.00006467678,0.0003148326,0.000054947683,0.000015916823],"category_scores_gemma":[0.00035888082,0.000069800175,0.000103160586,0.00015901479,0.0007221587,0.00007385004,0.00018517891,0.00020547032,0.000003551148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016279695,0.000038906113,0.0010234779,0.00010968158,0.000056493685,8.0244035e-8,0.0092152525,0.0000027205858,0.00024194554,0.98910576,0.00009209524,0.000097302844],"study_design_scores_gemma":[0.00041604662,0.0000038321596,0.001380628,0.00009788441,0.00009822149,0.000037155613,0.006153596,0.0005348118,0.00043161435,0.99071014,0.00005065697,0.00008543377],"about_ca_topic_score_codex":0.00003158051,"about_ca_topic_score_gemma":0.000018441637,"teacher_disagreement_score":0.010728219,"about_ca_system_score_codex":0.0000069751245,"about_ca_system_score_gemma":0.000027018361,"threshold_uncertainty_score":0.28825802},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9212407,0.00030341954,0.06994024,0.0015462018,0.00041791733,0.0009198689,0.0009410585,0.00022858566,0.0044620307],"genre_scores_gemma":[0.97208554,0.00001941219,0.026766788,0.000085924374,0.00018735793,0.00006751053,0.00047241227,0.000049600494,0.00026543395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979057,0.0001288804,0.00044084777,0.00075000565,0.0004588192,0.00031578704],"domain_scores_gemma":[0.9970676,0.0011820577,0.00049854716,0.0008130881,0.0002467953,0.00019193756],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050512515,0.00040452112,0.00056704675,0.00024447648,0.0006172174,0.0002841275,0.0006858275,0.00053162395,0.0001879539],"category_scores_gemma":[0.00040336954,0.00042642636,0.00023478799,0.00017097805,0.0005728087,0.00012617666,0.0011859774,0.0013391307,0.00003938539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034463887,0.00011695957,0.0030054883,0.0003408853,0.00019812219,0.000005515651,0.0003228942,0.0031236052,0.000009481022,0.9916811,0.00058055494,0.0005809287],"study_design_scores_gemma":[0.0003002856,0.000029017097,0.045704603,0.00017566721,0.00013232317,0.000011264957,0.00015342607,0.0060103107,0.000009469296,0.94584626,0.001199274,0.0004280881],"about_ca_topic_score_codex":0.0000485319,"about_ca_topic_score_gemma":0.000009017452,"teacher_disagreement_score":0.050844885,"about_ca_system_score_codex":0.00008492056,"about_ca_system_score_gemma":0.00015111128,"threshold_uncertainty_score":0.99981874},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9903089,0.000194882,0.000058945552,0.00031582746,0.000026656728,0.000023164179,0.0000032504076,0.000002231067,0.009066171],"genre_scores_gemma":[0.99927247,7.263959e-7,0.00045251896,0.00005201681,0.000025538751,0.0000010272702,2.6863677e-7,0.0000051559014,0.0001902766],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995815,0.000014461924,0.00017769003,0.000041897376,0.000088353285,0.000096077245],"domain_scores_gemma":[0.99927527,0.00002458984,0.00012063345,0.000115746596,0.00012848894,0.00033527164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016431096,0.000052116317,0.00011601208,0.000026301472,0.000021478352,0.0000066262355,0.00016294626,0.000051189527,0.00008229311],"category_scores_gemma":[0.00042495676,0.000040698997,0.00006148976,0.00005518019,0.000119012606,0.000018361368,0.0000037436594,0.00011919715,0.0000022360719],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008679834,0.00013914838,0.00039755373,0.0001865251,0.00016006504,0.00024363295,0.0016126322,0.00008267167,0.5300389,0.45616412,0.010398625,0.0004893622],"study_design_scores_gemma":[0.00015481026,0.000029572084,0.000005024722,0.000055896457,0.000015106774,0.000085472246,0.0004753735,0.0000015242352,0.63116616,0.36724278,0.00071898464,0.000049284783],"about_ca_topic_score_codex":0.000038398157,"about_ca_topic_score_gemma":0.000027462247,"teacher_disagreement_score":0.1011273,"about_ca_system_score_codex":0.000036850197,"about_ca_system_score_gemma":0.00041586015,"threshold_uncertainty_score":0.16596569},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9822739,0.00011152839,0.004976293,0.00056180527,0.000054154814,0.00043607756,0.0000355789,0.00008137343,0.011469306],"genre_scores_gemma":[0.93454313,0.000031034862,0.06489004,0.000018154025,0.000008693875,0.000029801968,0.0000021720944,0.000025446041,0.00045153312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990134,0.00002242666,0.00038903242,0.00017204382,0.00019006293,0.00021302637],"domain_scores_gemma":[0.9976799,0.0007033404,0.00047508927,0.0009936149,0.00007072304,0.000077322955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046023287,0.00015904878,0.00040458748,0.00010430516,0.00043614474,0.000068360954,0.00046060645,0.000073356176,0.00007812717],"category_scores_gemma":[0.0006912351,0.0001335911,0.0001207459,0.00007260139,0.0003435152,0.00011506773,0.00015853623,0.00009302244,0.000014930656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005312784,0.00020866383,0.0004356101,0.0002695871,0.000053902517,6.9029414e-7,0.00034130862,2.3522247e-7,0.004706747,0.9928916,0.00069651386,0.00038982902],"study_design_scores_gemma":[0.00045716087,0.000045195164,0.00029948898,0.00008886226,0.00008785428,0.000012207391,0.0005850848,0.00034636192,0.008220188,0.98933256,0.00038171856,0.00014331218],"about_ca_topic_score_codex":0.000008327285,"about_ca_topic_score_gemma":0.000012308108,"teacher_disagreement_score":0.05991375,"about_ca_system_score_codex":0.0000049772807,"about_ca_system_score_gemma":0.000010175876,"threshold_uncertainty_score":0.5447687},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045719618,0.0002651289,0.8899913,0.0032608027,0.00016478944,0.0017465131,0.0004156293,0.00010945254,0.103589185],"genre_scores_gemma":[0.98842305,0.000033423792,0.008066222,0.0027712893,0.000078251374,0.00018989127,0.00009431789,0.000011949602,0.0003316341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901515,0.0000110050905,0.00041999784,0.00016453043,0.00020620863,0.00018309921],"domain_scores_gemma":[0.99811167,0.0012815907,0.00032570728,0.00013721344,0.000099650606,0.00004414598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005891504,0.00019793112,0.0002683843,0.00037247856,0.0003638623,0.00014291768,0.00016891805,0.0001981777,0.00007429157],"category_scores_gemma":[0.0003537668,0.00015840784,0.0001020323,0.00010259556,0.00036905217,0.0005163467,0.000011147912,0.00017225381,0.0000047701014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018069419,0.0000055589326,0.000016883168,0.000081347775,0.000009699605,9.832079e-8,0.00017306242,0.000586407,0.000007538829,0.9897497,0.000030067322,0.009321549],"study_design_scores_gemma":[0.0009831572,0.00008198946,0.00003556725,0.00017633235,0.000030648185,0.0000020700934,0.000010093424,0.004743941,0.000062896026,0.9841612,0.009508034,0.00020409311],"about_ca_topic_score_codex":0.0000050268136,"about_ca_topic_score_gemma":0.000034056284,"teacher_disagreement_score":0.9879658,"about_ca_system_score_codex":0.00002655157,"about_ca_system_score_gemma":0.000115200935,"threshold_uncertainty_score":0.64596844},"labels":[],"label_agreement":null},{"id":"W2236526535","doi":"","title":"Hamiltonicity of the Inner Power of a Cycle","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Power (physics)","score_opus":0.01242643194636564,"score_gpt":0.2568757387617923,"score_spread":0.24444930681542668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2236526535","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98823255,0.000008385135,0.000037678336,0.000119698765,0.00018951953,0.000117527365,0.000003648915,0.000015758744,0.011275219],"genre_scores_gemma":[0.9995935,7.9255955e-7,0.00024155671,0.0000321185,0.0000013288374,0.000009532219,3.0147424e-7,0.000007951293,0.00011290931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946105,0.00007696709,0.0001884544,0.00007776483,0.00011419603,0.00008154459],"domain_scores_gemma":[0.9989915,0.00026543252,0.00014449014,0.0005113355,0.00006783394,0.000019436993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032272108,0.0000576832,0.0001343523,0.00001909896,0.000049789945,0.0000025685122,0.00025211883,0.000041433785,0.000036763093],"category_scores_gemma":[0.00022733473,0.00004013361,0.00008094271,0.0001846163,0.0001120483,0.000023574905,0.00006743559,0.0000736519,0.00000574212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033074427,0.0001524864,0.0011352092,0.000019488032,0.000011915432,1.7980376e-8,0.0002989639,0.0000010699827,0.0021831847,0.99556965,0.0005793121,0.000045395813],"study_design_scores_gemma":[0.00023528279,0.000023464827,0.0043831742,0.000021739826,0.000015524276,4.3200978e-7,0.00003677307,0.000031621745,0.025893137,0.9687857,0.000530751,0.0000423958],"about_ca_topic_score_codex":0.000007888974,"about_ca_topic_score_gemma":0.0000017705086,"teacher_disagreement_score":0.026783945,"about_ca_system_score_codex":0.000005330529,"about_ca_system_score_gemma":0.000011766608,"threshold_uncertainty_score":0.16366012},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96675986,0.000024115334,0.020825762,0.00010510696,0.00018043134,0.001012489,0.0001892608,0.00013490678,0.010768037],"genre_scores_gemma":[0.995607,0.000021967786,0.0013566358,0.000021208161,0.00007231953,0.000017613955,0.00008641788,0.000027173097,0.0027896161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883056,0.000078992874,0.00021931839,0.0005491032,0.00004385098,0.00027820177],"domain_scores_gemma":[0.99865806,0.00022472831,0.0001753094,0.00069746247,0.0001187081,0.0001257352],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003542538,0.00023237288,0.0003080826,0.00026958634,0.00013908614,0.00005120185,0.00046979156,0.00024826793,0.000046124274],"category_scores_gemma":[0.00008259802,0.000279629,0.0002295601,0.000414983,0.00012492036,0.0001096087,0.0001867339,0.00033874364,0.00002875782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044523895,0.00018014363,0.00060524885,0.00006914286,0.000053300013,0.000010830517,0.00031746007,0.004891714,0.000031643893,0.9915992,0.002185354,0.000011451201],"study_design_scores_gemma":[0.000533824,0.000027038532,0.0002689034,0.000044403918,0.00011441915,0.0000012824946,0.00025582142,0.0071137883,0.00006781538,0.98952836,0.0017541199,0.00029021254],"about_ca_topic_score_codex":0.000041299583,"about_ca_topic_score_gemma":0.00066368084,"teacher_disagreement_score":0.028847158,"about_ca_system_score_codex":0.00013235486,"about_ca_system_score_gemma":0.00016433776,"threshold_uncertainty_score":0.9999656},"labels":[],"label_agreement":null},{"id":"W2239631536","doi":"","title":"Maximum Wiener Index of Unicyclic Graphs with Fixed Maximum Degree","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Wiener index; Degree (music); Statistics; Combinatorics; Discrete mathematics; Graph; Computer science; Physics","score_opus":0.03673490465704366,"score_gpt":0.2754255899989676,"score_spread":0.23869068534192395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2239631536","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.990249,0.00009233412,0.000248628,0.00006931801,0.00028370883,0.00029295744,0.000008403872,0.00009376937,0.008661915],"genre_scores_gemma":[0.9978907,0.000008025398,0.0017097193,0.000041809253,0.0000074437958,0.00006898463,0.000006575808,0.000039068866,0.00022763236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882275,0.00008340017,0.00029308692,0.00018307078,0.00024695418,0.00037071013],"domain_scores_gemma":[0.99859273,0.00025647477,0.00020480585,0.00070279837,0.00009697726,0.00014623792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032794048,0.00019305013,0.00027952317,0.00012241153,0.00011450508,0.000012088572,0.00031820705,0.00011333236,0.0000822464],"category_scores_gemma":[0.000054069376,0.00015814554,0.00009376574,0.0005438207,0.00017522024,0.00018792151,0.00007142709,0.00018126992,0.000031426716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025260912,0.00046691962,0.030318117,0.000034277695,0.00006679166,8.776866e-7,0.0002828538,4.3570128e-7,0.00054705486,0.9665511,0.00078466954,0.0009215902],"study_design_scores_gemma":[0.0008438912,0.00007118728,0.011195496,0.000034126744,0.00007046651,0.000009485627,0.00016512908,0.000006951951,0.004053378,0.982328,0.0010203923,0.00020151048],"about_ca_topic_score_codex":0.000016395783,"about_ca_topic_score_gemma":0.000008225861,"teacher_disagreement_score":0.019122621,"about_ca_system_score_codex":0.000019051658,"about_ca_system_score_gemma":0.000025226691,"threshold_uncertainty_score":0.64489883},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89502335,0.00070618873,0.094129816,0.0010996475,0.0022718478,0.0009809344,0.0002089869,0.000041408457,0.005537852],"genre_scores_gemma":[0.9962581,0.00021039869,0.0024717955,0.00015490997,0.0002535973,0.00006742618,0.0000019614256,0.0000706978,0.000511104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977202,0.00032518446,0.0010436946,0.00022244379,0.00041869417,0.0002698134],"domain_scores_gemma":[0.9891795,0.00741062,0.0020173222,0.0008916869,0.00041189248,0.00008900338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043776734,0.00033013377,0.00067772344,0.00030019533,0.00024147805,0.000052400774,0.0010621989,0.00027007997,0.00021663643],"category_scores_gemma":[0.00047126433,0.00018128387,0.0014956011,0.00017696603,0.0003791891,0.00007695483,0.00015427372,0.0008276923,0.000007491096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005933905,0.00028022716,0.000045975332,0.0002111344,0.00067312125,0.000002863738,0.0005776905,0.000016402177,0.00043727577,0.99306554,0.003209459,0.00088690926],"study_design_scores_gemma":[0.0005528851,0.0000996977,0.00011510529,0.0008150109,0.0004875776,0.00005262934,0.00026150575,0.0000019103927,0.0006125081,0.99604124,0.0007556816,0.00020422951],"about_ca_topic_score_codex":0.0000011135322,"about_ca_topic_score_gemma":0.0000011066638,"teacher_disagreement_score":0.101234786,"about_ca_system_score_codex":0.000030450246,"about_ca_system_score_gemma":0.000106091924,"threshold_uncertainty_score":0.73925424},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90752125,0.00020801887,0.08443434,0.0029739744,0.00011037329,0.0008530004,0.00010086803,0.0009206102,0.0028775462],"genre_scores_gemma":[0.9828742,0.000043538756,0.014631182,0.0009866672,0.00021640887,0.0005817678,0.000025408366,0.00007266185,0.00056814204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975955,0.00028428805,0.0005154938,0.00047081296,0.0004712916,0.0006626084],"domain_scores_gemma":[0.997358,0.0006348229,0.0002597139,0.0011357156,0.00010694356,0.0005047945],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012187165,0.0003916231,0.00048513277,0.0004316571,0.00032149616,0.00018127012,0.0007913547,0.000297985,0.000039362676],"category_scores_gemma":[0.0005812167,0.00033923666,0.00019410107,0.00059528433,0.00026214038,0.0002736068,0.00016041743,0.00048434964,0.000072941766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051949602,0.00025131973,0.017,0.000021983064,0.00005440476,0.000008859822,0.00041671188,0.000010795353,0.00023536409,0.9770177,0.003665238,0.0012656446],"study_design_scores_gemma":[0.00046144653,0.00021956876,0.018351717,0.000058984373,0.00007546191,0.00001655072,0.00022572002,0.00049912947,0.0031080425,0.97615,0.00044692942,0.0003864518],"about_ca_topic_score_codex":0.00053746096,"about_ca_topic_score_gemma":0.00024218706,"teacher_disagreement_score":0.07535295,"about_ca_system_score_codex":0.00016162418,"about_ca_system_score_gemma":0.00015073983,"threshold_uncertainty_score":0.99990594},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9892901,0.00008196471,0.0002255044,0.00039174297,0.0000931634,0.00016964562,0.000016305681,0.000053674154,0.009677907],"genre_scores_gemma":[0.99931926,0.00017399278,0.00014114767,0.00003538702,0.000003373614,0.000036838715,9.850515e-7,0.000011610848,0.00027741792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993352,0.000033507895,0.0002009047,0.00015877353,0.00013873329,0.00013283503],"domain_scores_gemma":[0.9991895,0.0002844551,0.00009739539,0.0003222038,0.000049053448,0.000057389396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022522423,0.00010948422,0.000166249,0.000079743855,0.000084396626,0.0000076627575,0.00011548832,0.000047856298,0.000053624914],"category_scores_gemma":[0.00006436038,0.00006767275,0.00007069684,0.00018185866,0.00010655876,0.000026396328,0.000035843565,0.00005010406,0.000005077047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019802099,0.0002524368,0.00050775066,0.000024505098,0.000023000146,4.5939547e-7,0.00008255816,3.0038418e-8,0.0016230937,0.9924758,0.0009193465,0.0040712105],"study_design_scores_gemma":[0.00059996423,0.00015105156,0.001343891,0.00006607785,0.000022078957,0.0000012964366,0.000065088054,0.0000029475968,0.0057844063,0.99065113,0.0012124927,0.000099578254],"about_ca_topic_score_codex":0.0000031860054,"about_ca_topic_score_gemma":0.0000011568184,"teacher_disagreement_score":0.010029155,"about_ca_system_score_codex":0.00000867394,"about_ca_system_score_gemma":0.0000075372404,"threshold_uncertainty_score":0.2759615},"labels":[],"label_agreement":null},{"id":"W2274512402","doi":"","title":"A Note on Eigenvalues of the Derangement Graph","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Derangement; Mathematics; Eigenvalues and eigenvectors; Combinatorics; Graph; Pure mathematics; Physics; Quantum mechanics","score_opus":0.0482777693190106,"score_gpt":0.2858767769068373,"score_spread":0.23759900758782673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274512402","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98022884,0.000016318369,0.00003325313,0.000088459456,0.00033816567,0.0002554822,0.0000039386528,0.000034342367,0.0190012],"genre_scores_gemma":[0.9991036,0.000004817447,0.00063793006,0.00007161703,0.0000022072995,0.000040239458,3.8873463e-7,0.000010506421,0.00012866582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994459,0.000060649276,0.00015365474,0.000103068174,0.00013327689,0.00010344027],"domain_scores_gemma":[0.99923277,0.00012420588,0.000094728915,0.0004841793,0.00003854783,0.000025580965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020711598,0.00007765943,0.000100443205,0.00003150446,0.00010115701,0.0000036468969,0.0002587599,0.000035120287,0.00007039281],"category_scores_gemma":[0.000054367498,0.0000529157,0.00009566697,0.000175528,0.000075290096,0.000021173335,0.000044252763,0.00007701329,0.000021959302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009968956,0.00027696387,0.0006087712,0.000013244383,0.000019616295,2.2416992e-7,0.00106305,1.201904e-7,0.00041132662,0.9965021,0.0009116929,0.00018290103],"study_design_scores_gemma":[0.00021945962,0.000046459514,0.0038351787,0.00002374173,0.000028991617,4.351815e-7,0.000055564746,0.000002296729,0.035849825,0.9595453,0.00033501827,0.000057693473],"about_ca_topic_score_codex":0.000009462369,"about_ca_topic_score_gemma":0.0000031062564,"teacher_disagreement_score":0.036956783,"about_ca_system_score_codex":0.000008348249,"about_ca_system_score_gemma":0.000009910365,"threshold_uncertainty_score":0.21578395},"labels":[],"label_agreement":null},{"id":"W2279781878","doi":"","title":"The Laplacian spectral radius of graphs with given matching number","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Matching (statistics); Combinatorics; Laplace operator; RADIUS; Mathematical analysis; Statistics; Computer science; Eigenvalues and eigenvectors; Physics; Computer network","score_opus":0.009841915676796955,"score_gpt":0.2601583011360572,"score_spread":0.25031638545926027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2279781878","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98613256,0.000006013558,0.000015622047,0.00030096748,0.00033548893,0.0001862732,0.000004151813,0.000051931773,0.0129670035],"genre_scores_gemma":[0.9981443,0.0000036736799,0.0015067562,0.000014342464,0.0000064997103,0.000027396545,0.0000015263249,0.00001910417,0.00027636357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933696,0.000040669045,0.00017186718,0.00012291153,0.00014662299,0.00018096832],"domain_scores_gemma":[0.9988869,0.00043377528,0.0001210104,0.00045454054,0.000051267303,0.000052550316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033223903,0.000103350874,0.00013485749,0.000021453348,0.0002545626,0.000028110126,0.0002845912,0.000051970423,0.00005072133],"category_scores_gemma":[0.000041217274,0.000068002446,0.00006418951,0.00019797802,0.00017928096,0.00005835462,0.000027485188,0.00027179316,0.000023692668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001825729,0.00009037272,0.002579899,0.000010490024,0.000035127865,0.0000013689285,0.00043320315,1.8195783e-7,0.0018462683,0.9941995,0.0006590667,0.00012625605],"study_design_scores_gemma":[0.0003507877,0.000026305615,0.0023296205,0.000011733891,0.000026692705,0.000015044786,0.00017657432,0.0000034098987,0.0037442623,0.99174225,0.0014812541,0.000092074464],"about_ca_topic_score_codex":0.000016350434,"about_ca_topic_score_gemma":0.000065477514,"teacher_disagreement_score":0.012690639,"about_ca_system_score_codex":0.000005265775,"about_ca_system_score_gemma":0.0000207281,"threshold_uncertainty_score":0.27730593},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5136207,0.000074764925,0.4689388,0.00028808092,0.000026642649,0.00091737875,0.00008204825,0.00016858708,0.015883021],"genre_scores_gemma":[0.90887195,0.000060688257,0.090655625,0.000016329857,0.00002011538,0.00010184425,0.0000024086526,0.000039007886,0.00023201416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878234,0.000018981444,0.00046486896,0.00026752122,0.00023296235,0.00023332151],"domain_scores_gemma":[0.9983507,0.0005738607,0.0002966931,0.00063606305,0.000058344154,0.00008438371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004072666,0.00020815717,0.00038224028,0.000073339266,0.00010444857,0.000017059161,0.0002518003,0.000083932544,0.000031804568],"category_scores_gemma":[0.00012293199,0.00013201039,0.000084169296,0.00020872733,0.0003584144,0.00008600146,0.00010699796,0.00006452538,0.00001015236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014867428,0.00010994198,0.000045657594,0.00042199882,0.000036579746,4.5701952e-7,0.00067908084,1.2637473e-7,0.028891042,0.9671736,0.00008829619,0.0025383693],"study_design_scores_gemma":[0.0003642237,0.000018461727,0.00008561414,0.00016475713,0.00007166714,0.0000058850123,0.00038342713,0.000031733303,0.029333774,0.96915656,0.00018942087,0.00019445048],"about_ca_topic_score_codex":8.852378e-7,"about_ca_topic_score_gemma":0.0000033911035,"teacher_disagreement_score":0.3952513,"about_ca_system_score_codex":0.000010743558,"about_ca_system_score_gemma":0.000015003716,"threshold_uncertainty_score":0.53832275},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9822732,0.00032709818,0.0056788926,0.0009816582,0.00001805386,0.0006657554,0.00002946009,0.00005996091,0.0099658985],"genre_scores_gemma":[0.9972647,0.00015929014,0.0019037145,0.00010224116,0.00012677882,0.00016137426,0.0000041969215,0.000011283439,0.0002664548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939966,0.00002842891,0.00021997862,0.00016144161,0.00006589029,0.00012459651],"domain_scores_gemma":[0.9991914,0.000336606,0.00008937633,0.00026520365,0.000067122135,0.00005029321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021270734,0.000094696254,0.00015036661,0.000051673884,0.00026969647,0.000019469595,0.00013194878,0.000040049657,0.000028728244],"category_scores_gemma":[0.000046815785,0.000064831795,0.000046599394,0.00022610032,0.0005336614,0.000056004686,0.000053795593,0.00008607257,0.000011633531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012363243,0.000034389293,0.000117816206,0.000029651244,0.000023163164,3.1694654e-8,0.0013493828,5.019896e-8,0.0011244017,0.99514145,0.00008022894,0.002087059],"study_design_scores_gemma":[0.0005331577,0.000041702457,0.0010410866,0.000023760318,0.00008118857,0.000011714379,0.0012460425,0.0005733852,0.009416517,0.9805719,0.0063375384,0.00012199703],"about_ca_topic_score_codex":0.000008297879,"about_ca_topic_score_gemma":0.000036363013,"teacher_disagreement_score":0.014991444,"about_ca_system_score_codex":0.000002522118,"about_ca_system_score_gemma":0.00000915914,"threshold_uncertainty_score":0.26437637},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20204432,0.012474669,0.75946397,0.006658462,0.0011611972,0.0023584946,0.0013223434,0.00012612785,0.014390424],"genre_scores_gemma":[0.8879237,0.0008374506,0.086873576,0.00025479821,0.00025931426,0.00044637264,0.000016534235,0.00007256667,0.023315651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989299,0.00008569337,0.0003599322,0.00020685741,0.000116182964,0.00030142936],"domain_scores_gemma":[0.99802095,0.0009887102,0.00024737662,0.0005788128,0.000097334676,0.00006681283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045983004,0.00018821066,0.00025535276,0.000053553,0.00042694688,0.000018786563,0.00039888467,0.00014610907,0.00023218288],"category_scores_gemma":[0.00011162201,0.00014985586,0.00030704372,0.000292743,0.0010274682,0.000073167124,0.000023466506,0.00022110173,0.000024780029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007782281,0.00024081381,0.0001990154,0.00027513603,0.00014855228,0.000001846812,0.010099599,0.0000033506676,0.00020173591,0.98282963,0.0029165568,0.0030059258],"study_design_scores_gemma":[0.0005057967,0.00005579523,0.00013827659,0.000057226076,0.0003059428,0.0000120167115,0.0021906148,0.00014292622,0.0017766472,0.92084527,0.07380312,0.00016638616],"about_ca_topic_score_codex":0.00009918779,"about_ca_topic_score_gemma":0.00016173677,"teacher_disagreement_score":0.6858794,"about_ca_system_score_codex":0.000028405348,"about_ca_system_score_gemma":0.000027190525,"threshold_uncertainty_score":0.6110945},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9541438,0.0034950487,0.0005893121,0.0007528431,0.0012084466,0.0018356004,0.00012261563,0.00055586913,0.037296433],"genre_scores_gemma":[0.9978159,0.0005049328,0.0006582987,0.000024471434,0.00002654649,0.00036493913,0.000015740208,0.000050313676,0.000538856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828184,0.00009444086,0.00033720708,0.0006920543,0.00026250098,0.00033196167],"domain_scores_gemma":[0.99748164,0.00029572166,0.000481291,0.0012374686,0.00034073147,0.00016314123],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050710666,0.00041394503,0.0005472704,0.00022718387,0.0007707943,0.00027110605,0.0006122411,0.0003668901,0.000013730472],"category_scores_gemma":[0.00046026014,0.00039204527,0.00028152898,0.000187922,0.00034464037,0.000068585345,0.0006033794,0.00092179416,0.0000048047887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008836215,0.00022126641,0.00048288415,0.00030193618,0.00011605164,0.0000076059614,0.0011072578,0.000001567519,0.000006966855,0.9968097,0.0007076976,0.00022822143],"study_design_scores_gemma":[0.0003248135,0.000054005915,0.0005972008,0.00020853379,0.00023169216,0.000011948135,0.00056643045,0.00007855305,0.000017961023,0.9968793,0.0005877379,0.0004418606],"about_ca_topic_score_codex":0.000062260784,"about_ca_topic_score_gemma":0.000010142841,"teacher_disagreement_score":0.04367207,"about_ca_system_score_codex":0.00005798151,"about_ca_system_score_gemma":0.00008355294,"threshold_uncertainty_score":0.99985313},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98983735,0.0000952663,0.0033989863,0.00089380535,0.00018653636,0.00004276852,0.0000016862804,0.000012071582,0.005531506],"genre_scores_gemma":[0.9986396,0.00009919213,0.000951779,0.00003482164,0.000045225166,3.844164e-7,9.399075e-8,0.000016585425,0.00021233666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991201,0.00019743398,0.0003418845,0.000074011776,0.00015396359,0.0001126015],"domain_scores_gemma":[0.99915713,0.00034257967,0.00025025904,0.0001051613,0.000063471074,0.0000814267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010661789,0.00008055852,0.0001401801,0.00014848959,0.000051321902,0.000018669924,0.00015542726,0.000014480645,0.00003225692],"category_scores_gemma":[0.00016423003,0.00005475525,0.000060352297,0.00015658258,0.00005436055,0.00015202917,0.00002436723,0.00018268394,0.000011325462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021610289,0.00011680102,0.0034485396,0.0000068401087,0.000013585951,0.00006100911,0.00015611797,3.028902e-7,0.0009476237,0.9930551,0.0011109408,0.0010614998],"study_design_scores_gemma":[0.0009363933,0.00009162936,0.021762196,0.00006480411,0.000012341387,0.00021199627,0.000041815005,0.0000011800714,0.00024981482,0.9720635,0.004489222,0.00007510052],"about_ca_topic_score_codex":2.0865207e-7,"about_ca_topic_score_gemma":2.1329056e-7,"teacher_disagreement_score":0.020991622,"about_ca_system_score_codex":0.000023742881,"about_ca_system_score_gemma":0.000015141169,"threshold_uncertainty_score":0.22328544},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9958496,0.000029944838,0.000043711752,0.001118339,0.00003853195,0.000038140788,0.000015962036,0.0000014716352,0.0028642938],"genre_scores_gemma":[0.9995128,0.0000015374138,0.000091291615,0.000033193875,0.000045779983,0.0000017934219,1.6013567e-7,0.000007873086,0.00030558152],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993514,0.000023289118,0.00031271979,0.00006171762,0.000096804004,0.00015407911],"domain_scores_gemma":[0.9991478,0.00014836669,0.0002157338,0.00022118878,0.000077035605,0.00018992019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025132482,0.00006762185,0.00014419212,0.000034164845,0.000029282095,0.000005639507,0.00036968064,0.000087961096,0.00026519323],"category_scores_gemma":[0.00055061147,0.00004073843,0.000085607404,0.00014698356,0.0001276912,0.000036142053,0.000010839022,0.00015223096,0.0000011157939],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017461634,0.000046479083,0.013764747,0.00006503063,0.000035288766,0.00002339137,0.00035909293,0.0000011521913,0.96970826,0.012509045,0.00248684,0.0009832316],"study_design_scores_gemma":[0.0006258616,0.0000041408684,0.00519578,0.00034131025,0.000014264169,0.00012231221,0.000121185636,0.0000018678229,0.6520765,0.34048113,0.000921789,0.00009386931],"about_ca_topic_score_codex":0.00007225451,"about_ca_topic_score_gemma":0.0003735568,"teacher_disagreement_score":0.32797208,"about_ca_system_score_codex":0.000074911215,"about_ca_system_score_gemma":0.00054161256,"threshold_uncertainty_score":0.290368},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9838887,0.000013432788,0.00018283662,0.0016011007,0.00018214453,0.0002466119,0.00003252207,0.0000336475,0.013819016],"genre_scores_gemma":[0.9940135,0.0000019931456,0.001217539,0.0003882834,0.00008406993,0.000035479225,0.0000012336363,0.000016924718,0.0042409617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992974,0.000108213404,0.0001691903,0.00013290718,0.0001496337,0.00014266622],"domain_scores_gemma":[0.9981522,0.0009935158,0.00011676749,0.0006685629,0.000037059213,0.000031923624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047994356,0.000108710745,0.00011661492,0.000025716445,0.0004217637,0.000018574061,0.00040845908,0.00010807533,0.00070079754],"category_scores_gemma":[0.00030727094,0.000058116948,0.00013550448,0.00014124486,0.00044598608,0.00002788055,0.000034183573,0.00045467986,0.000026531026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053425197,0.00007203866,0.00029689635,0.000014550259,0.000020087982,3.4565952e-7,0.0011198326,4.823777e-7,0.012656734,0.9820719,0.003588201,0.00015358719],"study_design_scores_gemma":[0.000106864914,0.00001242614,0.0016134573,0.000008252549,0.000021418928,0.0000061591363,0.00024427378,0.000020144525,0.029437037,0.9613963,0.0070592994,0.000074360854],"about_ca_topic_score_codex":0.0000035393618,"about_ca_topic_score_gemma":0.000047167538,"teacher_disagreement_score":0.020675596,"about_ca_system_score_codex":0.000007995345,"about_ca_system_score_gemma":0.000017212751,"threshold_uncertainty_score":0.7673242},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96968496,0.00018929387,0.0024329966,0.000699481,0.00008915319,0.0011884706,0.000016927686,0.00022693782,0.025471766],"genre_scores_gemma":[0.9821451,0.00004852639,0.015924357,0.00030818314,0.00009567548,0.00043200538,0.0000102170925,0.00004380039,0.0009921661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887586,0.000105622385,0.00020334503,0.00024860023,0.00019422763,0.00037237265],"domain_scores_gemma":[0.99893385,0.0002479702,0.00012932258,0.0005035661,0.000046159046,0.00013912657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054580695,0.0002117725,0.0002509661,0.00012966404,0.0005510862,0.0000743376,0.00046629357,0.00009786461,0.00006023355],"category_scores_gemma":[0.00004242817,0.00015503343,0.00008790114,0.00045704402,0.0002987794,0.00018923647,0.000069858994,0.00024369064,0.00004272332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036444457,0.0004089262,0.004464209,0.000034083718,0.00013553162,0.000001197801,0.0034829099,0.0000028965349,0.0001546782,0.9878852,0.0026359153,0.00075804786],"study_design_scores_gemma":[0.00067524187,0.0001689465,0.004437484,0.00005156773,0.000108985856,0.000012511678,0.0010092058,0.0000034302293,0.0008495376,0.9757013,0.01665032,0.00033148582],"about_ca_topic_score_codex":0.00002007219,"about_ca_topic_score_gemma":0.00002136594,"teacher_disagreement_score":0.0244796,"about_ca_system_score_codex":0.00002648959,"about_ca_system_score_gemma":0.000012769347,"threshold_uncertainty_score":0.632208},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9965656,0.00013269292,0.00011905676,0.0006457618,0.000022155646,0.000025510431,0.000011098453,0.000002562431,0.002475562],"genre_scores_gemma":[0.9994222,0.000002089763,0.00029544072,0.000049014274,0.00003589792,0.000001039018,1.3591104e-7,0.000006154559,0.00018800693],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999547,0.000013530473,0.00019781271,0.000052675754,0.00007913223,0.000109838795],"domain_scores_gemma":[0.9993829,0.00005138569,0.00014238438,0.00014248308,0.000089329405,0.0001915136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009353253,0.00006277332,0.00012538345,0.000027836348,0.000034731573,0.0000060800967,0.00019219068,0.0000610917,0.0004088542],"category_scores_gemma":[0.00035021303,0.000036163605,0.00007482171,0.000038964583,0.00014399114,0.00002052115,0.0000044656476,0.000086058244,0.000001309697],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013684866,0.000012031321,0.000054586853,0.000039083967,0.000026786747,0.000021193067,0.00008193046,0.00000140558,0.759241,0.23949318,0.00057388545,0.00044124562],"study_design_scores_gemma":[0.00008678737,0.000014347585,0.000020539788,0.000058955502,0.000007029633,0.00003677642,0.000041550647,7.438443e-8,0.5431018,0.45634955,0.00025104184,0.00003158316],"about_ca_topic_score_codex":0.000014334377,"about_ca_topic_score_gemma":0.000023962639,"teacher_disagreement_score":0.21685638,"about_ca_system_score_codex":0.000028566397,"about_ca_system_score_gemma":0.00018926218,"threshold_uncertainty_score":0.44766667},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9609403,0.00033704512,0.00392323,0.0007813401,0.00023947244,0.00038345484,0.000037074056,0.000028134167,0.03332995],"genre_scores_gemma":[0.9607184,0.000010482252,0.038424514,0.00004167877,0.00007090267,0.0000066312914,2.8428167e-7,0.000026633996,0.00070045865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990193,0.00003956544,0.00045222547,0.00007718463,0.0001602697,0.00025142898],"domain_scores_gemma":[0.99846447,0.00032346544,0.00035648196,0.00025551577,0.0002179125,0.0003821462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004290648,0.00012466854,0.000249364,0.0002953147,0.00015486834,0.000044955894,0.00031135627,0.00006608807,0.0005655352],"category_scores_gemma":[0.00058431685,0.00010545326,0.00015577994,0.0002798216,0.0001256529,0.000114285904,0.0000063210637,0.00023393932,0.00004913418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.242448e-7,0.00010073133,0.00022020072,0.00005448851,0.00007043498,0.000032452277,0.0034921218,0.0000039579304,0.000043118813,0.9801234,0.015346775,0.00051149173],"study_design_scores_gemma":[0.00023103211,0.00007266463,0.000069834714,0.0000915957,0.00007991858,0.00031366938,0.0018222149,0.000174942,0.0002216361,0.9933028,0.0034889944,0.00013068921],"about_ca_topic_score_codex":0.000040554947,"about_ca_topic_score_gemma":0.0012196364,"teacher_disagreement_score":0.034501284,"about_ca_system_score_codex":0.000060706767,"about_ca_system_score_gemma":0.00013399504,"threshold_uncertainty_score":0.61922145},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9957964,0.00019617991,0.0033665684,0.00040671,0.000015694544,0.000065996675,0.000011615133,0.000004403184,0.00013646441],"genre_scores_gemma":[0.996589,0.000016734522,0.0033250463,0.000026825608,0.000020113614,7.5787307e-7,0.0000010293902,0.0000032519458,0.000017241433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991083,0.00011356516,0.0003441909,0.00008913745,0.00026155985,0.00008321269],"domain_scores_gemma":[0.99624884,0.0031813865,0.0002851367,0.00003287351,0.00015122323,0.00010056219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007506516,0.00006566051,0.00019582381,0.000107107604,0.00018829528,0.000014169429,0.00008013257,0.000047087753,0.000009566735],"category_scores_gemma":[0.0012353966,0.000048758448,0.000031039206,0.00021433468,0.0007582253,0.000117075695,0.000029070734,0.00012231526,3.8418648e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019308829,0.00004844979,0.030870926,0.000012518545,0.000011706151,0.0000024117853,0.00041469105,0.0000067085975,0.00018183213,0.9683194,0.000010701699,0.00010133005],"study_design_scores_gemma":[0.00036032512,0.00009533523,0.25688472,0.000028002372,0.00003250823,0.00010668196,0.000032260657,0.00027090244,0.00024925848,0.74189335,0.0000044658645,0.000042194355],"about_ca_topic_score_codex":3.18032e-7,"about_ca_topic_score_gemma":1.11773595e-7,"teacher_disagreement_score":0.22642608,"about_ca_system_score_codex":0.0000047979343,"about_ca_system_score_gemma":0.00004350287,"threshold_uncertainty_score":0.27937126},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9928701,0.000027661099,0.0026745328,0.0001547247,0.000025034273,0.000050491493,0.000019801106,0.000007549706,0.004170111],"genre_scores_gemma":[0.9929409,0.000018867666,0.006225823,0.000014885714,0.00002583627,1.6861954e-8,7.9139903e-7,0.0000050657354,0.00076780765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994081,0.000048282258,0.0002135046,0.00006973745,0.00014789034,0.00011247076],"domain_scores_gemma":[0.99911594,0.0002242451,0.00028732378,0.00012437909,0.00014607026,0.00010201486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005635567,0.000071560855,0.0001870483,0.00019818537,0.00007711923,0.0000069905286,0.00016534964,0.000045603043,0.000095411684],"category_scores_gemma":[0.00004795383,0.00006906451,0.000086920554,0.00017221773,0.00014927826,0.00017818474,0.000044395612,0.00013518539,7.87917e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000563896,0.0004876925,0.048329357,0.000056167,0.00019917026,0.00016109037,0.0007972247,0.0000071154163,0.005819817,0.93633646,0.0021502401,0.0050918013],"study_design_scores_gemma":[0.0034198703,0.00028956792,0.2209189,0.00014156858,0.00032150638,0.00019389292,0.005049838,0.000049049188,0.004298976,0.75352645,0.011507499,0.00028291089],"about_ca_topic_score_codex":0.000023007471,"about_ca_topic_score_gemma":0.00015169661,"teacher_disagreement_score":0.18281,"about_ca_system_score_codex":0.000026572861,"about_ca_system_score_gemma":0.00002805988,"threshold_uncertainty_score":0.2816369},"labels":[],"label_agreement":null},{"id":"W2394743037","doi":"","title":"Schultz and Zagreb indices in corona of two graphs","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Corona (planetary geology); Combinatorics; Physics; Astrobiology","score_opus":0.019386026211507246,"score_gpt":0.28585721840116823,"score_spread":0.266471192189661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394743037","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99722564,0.00008447321,0.0000022001375,0.00007617626,0.000086871005,0.00025610288,0.0000028889717,0.000024709887,0.0022409423],"genre_scores_gemma":[0.999258,0.000016911556,0.0006100954,0.000021258253,0.0000011811369,0.000024647445,0.0000019289962,0.000008964123,0.00005701506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942297,0.000043017993,0.00020225832,0.00012306623,0.00008755677,0.00012111224],"domain_scores_gemma":[0.99934375,0.00026281987,0.00009962591,0.00020877205,0.000040986728,0.000044053613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018849687,0.00008057158,0.00015446554,0.000091221016,0.000041291794,0.000013762086,0.00012834699,0.00004362853,0.000083437364],"category_scores_gemma":[0.000055653592,0.00007411073,0.00002729528,0.00022956678,0.00010257998,0.000111958245,0.000042369167,0.00009396346,0.000019388266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021450214,0.000121876714,0.025341736,0.000026029698,0.000009891952,3.7251266e-7,0.0004856616,8.414264e-8,0.0013641329,0.97184116,0.00028772722,0.00051918963],"study_design_scores_gemma":[0.00062519166,0.00002839659,0.026799425,0.000026367217,0.000009489988,0.0000015753812,0.00022519522,0.000019848678,0.0016777435,0.9704687,0.000042064305,0.00007597653],"about_ca_topic_score_codex":0.000080367055,"about_ca_topic_score_gemma":0.000015872529,"teacher_disagreement_score":0.0021839275,"about_ca_system_score_codex":0.000005824428,"about_ca_system_score_gemma":0.000009079622,"threshold_uncertainty_score":0.30221477},"labels":[],"label_agreement":null},{"id":"W2394758262","doi":"","title":"Extremal Wiener-Hosoya Index Of Acyclic Graphs With Short Diameter.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Combinatorics; Index (typography); Statistics; Graph; Computer science","score_opus":0.021298899970551743,"score_gpt":0.2618156374354236,"score_spread":0.24051673746487184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394758262","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9942654,0.0000269708,0.00020214605,0.000081336344,0.00013819248,0.00044047248,0.000003937481,0.000085091975,0.004756491],"genre_scores_gemma":[0.9977625,0.0000060898096,0.0017776474,0.00003314406,0.0000039350434,0.00019021679,0.0000041245034,0.000031656284,0.00019068859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989616,0.000056742847,0.00028981798,0.0002307107,0.00022286222,0.00023822211],"domain_scores_gemma":[0.99876297,0.00028146905,0.00011361043,0.0006242904,0.0001191834,0.00009848677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017286287,0.00017016438,0.00027017857,0.00010091556,0.00008797306,0.000024199177,0.000302342,0.00008447278,0.00013866795],"category_scores_gemma":[0.000051974617,0.00013708317,0.00008942629,0.0004045286,0.00017645769,0.00017284162,0.00005653631,0.0001459359,0.00003134115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001044881,0.0003005919,0.022273868,0.000030579275,0.00005419893,0.0000010791789,0.00018443205,7.810359e-7,0.002773385,0.9727929,0.0009249027,0.0006528094],"study_design_scores_gemma":[0.00038897523,0.00010487651,0.011713173,0.000036534533,0.000039583865,0.000004457693,0.00011632502,0.00003307596,0.007114163,0.98013467,0.00014353973,0.00017060505],"about_ca_topic_score_codex":0.00003526128,"about_ca_topic_score_gemma":0.0000075671205,"teacher_disagreement_score":0.010560694,"about_ca_system_score_codex":0.000011770819,"about_ca_system_score_gemma":0.00002012398,"threshold_uncertainty_score":0.55900896},"labels":[],"label_agreement":null},{"id":"W2394775218","doi":"","title":"The Hamiltonian Numbers in Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.037516865956538636,"score_gpt":0.29962870786811097,"score_spread":0.26211184191157233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394775218","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9743498,0.00007050728,0.0000034835534,0.0006853624,0.00049428974,0.00019123712,0.0000013121764,0.00006494397,0.02413905],"genre_scores_gemma":[0.999124,0.0000099693625,0.00022002024,0.000052712356,0.0000026996372,0.000064221735,0.0000012200328,0.0000131642055,0.00051202346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928814,0.00008439137,0.00017488727,0.00012087324,0.00013985841,0.00019182634],"domain_scores_gemma":[0.99907565,0.00034073825,0.000053808413,0.00040038093,0.000046880286,0.000082523846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068888214,0.00008377693,0.00009886009,0.000037270594,0.00013196171,0.000032337106,0.0002720816,0.000047579742,0.0000058731725],"category_scores_gemma":[0.0002188864,0.00006251062,0.000044290704,0.00034216142,0.00009511435,0.000055263346,0.0000408778,0.00013983244,0.00007023309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006763862,0.00007202919,0.0023616469,0.0000024809003,0.0000073119404,0.0000017254299,0.00055513467,3.9085938e-7,0.000015528278,0.98806053,0.008676021,0.00024046144],"study_design_scores_gemma":[0.0004577362,0.000016216354,0.00090487016,0.0000075608714,0.0000059278627,0.0000024020455,0.0004516411,0.000012674043,0.00013475928,0.9850169,0.012909757,0.00007955557],"about_ca_topic_score_codex":0.00003073422,"about_ca_topic_score_gemma":0.00009884856,"teacher_disagreement_score":0.024774155,"about_ca_system_score_codex":0.000029971445,"about_ca_system_score_gemma":0.000032070584,"threshold_uncertainty_score":0.2549109},"labels":[],"label_agreement":null},{"id":"W2394955060","doi":"","title":"On the normalized Laplacian eigenvalues of graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Laplace operator; Pure mathematics; Combinatorics; Mathematical analysis; Physics; Quantum mechanics","score_opus":0.054764152892298634,"score_gpt":0.30030683028246385,"score_spread":0.24554267739016522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394955060","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97601384,0.000028203602,0.000010216811,0.00035255658,0.00025485444,0.0002151203,0.0000058709898,0.00005217944,0.023067186],"genre_scores_gemma":[0.9994179,0.0000036593208,0.00019934963,0.000099733115,0.0000025200907,0.00004118934,0.0000022470692,0.000012579584,0.0002208338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927163,0.00011925128,0.0001855951,0.000102985236,0.00019547812,0.0001250675],"domain_scores_gemma":[0.9987219,0.00055342773,0.00010848153,0.0004631353,0.00009117789,0.00006188032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063943746,0.000091469956,0.00014363087,0.00004451831,0.00008875828,0.000010908537,0.00026987732,0.000045573095,0.000047101483],"category_scores_gemma":[0.00034440673,0.00006178164,0.000076437456,0.00024673436,0.00010306874,0.000037566886,0.000034819946,0.000099528275,0.000055361917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021180465,0.00015383073,0.00024325603,0.0000071261634,0.000023168132,4.5750758e-7,0.0005470868,6.352751e-7,0.00015538678,0.9883187,0.010485976,0.000043243654],"study_design_scores_gemma":[0.000434884,0.00007027324,0.00012289494,0.000014540398,0.000021141503,0.0000010385609,0.00023634435,0.0000119972965,0.0065205866,0.9914181,0.0010769117,0.00007128887],"about_ca_topic_score_codex":0.000007837091,"about_ca_topic_score_gemma":0.000002090166,"teacher_disagreement_score":0.023404075,"about_ca_system_score_codex":0.000010275521,"about_ca_system_score_gemma":0.00002383874,"threshold_uncertainty_score":0.2519382},"labels":[],"label_agreement":null},{"id":"W2395139503","doi":"","title":"The scrambling indices of primitive digraphs with exactly two cycles.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Scrambling; Mathematics; Combinatorics; Algorithm","score_opus":0.02042772827843531,"score_gpt":0.2831502540776327,"score_spread":0.2627225257991974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395139503","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9951777,0.000083116596,0.000021313235,0.00018239228,0.000053930715,0.0003449784,0.0000017826968,0.000038957747,0.0040958277],"genre_scores_gemma":[0.99909365,0.000023922728,0.00068420393,0.000023219698,0.0000024861085,0.00009853739,9.145235e-7,0.000013317217,0.000059739425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993782,0.000050934166,0.00016721965,0.00012430096,0.0001323093,0.00014702475],"domain_scores_gemma":[0.99859786,0.0008232532,0.0001571257,0.00027778037,0.000095938616,0.000048050093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024086334,0.000094120864,0.0001267965,0.00004056529,0.00022576933,0.000045975066,0.00018079308,0.000030224088,0.000009983141],"category_scores_gemma":[0.00006897874,0.000058638994,0.000031636486,0.00020259173,0.00024956785,0.00011639493,0.000043857483,0.00011163041,0.000008483618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058990045,0.00006196779,0.00424057,0.000013297749,0.000039601546,2.1987624e-7,0.00049567374,2.0693996e-7,0.00049619953,0.99368584,0.00010694339,0.0008535804],"study_design_scores_gemma":[0.00036616134,0.000046985162,0.011809358,0.000035428136,0.000027477256,0.0000020900566,0.00073609746,0.000016164471,0.0030923411,0.98368406,0.00010504364,0.00007880759],"about_ca_topic_score_codex":0.000044223314,"about_ca_topic_score_gemma":0.00000961448,"teacher_disagreement_score":0.010001794,"about_ca_system_score_codex":0.0000055886335,"about_ca_system_score_gemma":0.00001532964,"threshold_uncertainty_score":0.23912287},"labels":[],"label_agreement":null},{"id":"W2395214934","doi":"","title":"PI Index of Some Simple Pericondensed Hexagonal Systems.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hexagonal crystal system; Simple (philosophy); Index (typography); Combinatorics; Pure mathematics; Crystallography; Chemistry; Computer science","score_opus":0.022692968910457936,"score_gpt":0.28351152684656555,"score_spread":0.26081855793610764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395214934","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9964036,0.000099480734,0.000046375102,0.00012358562,0.00024392667,0.00024029979,0.000011006526,0.000081348335,0.002750376],"genre_scores_gemma":[0.9995078,0.00000370909,0.000096641335,0.00006961228,0.000010909357,0.000020643576,0.000005508254,0.000012549023,0.0002726395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910593,0.00006216263,0.00030258085,0.00015803018,0.00018968432,0.00018162945],"domain_scores_gemma":[0.99907404,0.00021920873,0.00015248988,0.00039987676,0.000085721535,0.00006864279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002522553,0.00011892704,0.00024854872,0.00006633161,0.00009067731,0.000018905741,0.00021915988,0.000080148806,0.00004686246],"category_scores_gemma":[0.00008163955,0.00011465715,0.00008348379,0.0002084588,0.000054260076,0.00008876186,0.000022819715,0.000115360825,0.00002315289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011352001,0.0002587089,0.0005205964,0.000031099487,0.000019658688,0.0000015108704,0.00015236024,0.000003971452,0.0020658935,0.9941261,0.0027015822,0.000107203596],"study_design_scores_gemma":[0.0005132186,0.00007917437,0.0027525781,0.00001818545,0.000020841697,0.000005122751,0.00013075539,0.00011037905,0.0017379911,0.9937123,0.0007998409,0.0001195924],"about_ca_topic_score_codex":0.000007671955,"about_ca_topic_score_gemma":3.3985737e-7,"teacher_disagreement_score":0.0031041864,"about_ca_system_score_codex":0.000020497922,"about_ca_system_score_gemma":0.000032137246,"threshold_uncertainty_score":0.4675583},"labels":[],"label_agreement":null},{"id":"W2395452549","doi":"","title":"The Wiener Polarity Index of Graph Products.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Polarity (international relations); Index (typography); Graph; Statistics; Combinatorics; Chemistry; Computer science","score_opus":0.01753218901229056,"score_gpt":0.26449621598101075,"score_spread":0.2469640269687202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395452549","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9945451,0.000060139446,0.00012078535,0.00084973173,0.000515426,0.00018550832,0.0000016867651,0.000042564672,0.0036790306],"genre_scores_gemma":[0.9994525,0.000005178989,0.00026147498,0.000042136657,0.000011354503,0.000017767348,8.7551643e-7,0.000011340765,0.00019740358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927616,0.00010641117,0.00021371376,0.00011762224,0.00015245618,0.00013365265],"domain_scores_gemma":[0.9985802,0.0004976264,0.00015528231,0.00057670043,0.00015591024,0.000034279816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008780154,0.000080923244,0.00013001359,0.000032521046,0.00015204889,0.00001698951,0.00031474134,0.00004781073,0.000004526706],"category_scores_gemma":[0.0006318356,0.000054756936,0.00005740122,0.00029472704,0.00013075015,0.000055786455,0.000045428504,0.000119298624,0.000010403778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007832375,0.00011076211,0.0015346991,0.000014563705,0.000017902437,9.5052506e-8,0.00009805111,2.1017335e-7,0.00057500246,0.99532515,0.0018540191,0.0004617283],"study_design_scores_gemma":[0.00023815615,0.000033430297,0.0025516397,0.0000072541866,0.00001936637,0.0000010262941,0.00003088888,0.000011059982,0.003964701,0.9804858,0.0125910025,0.000065683045],"about_ca_topic_score_codex":0.000008842341,"about_ca_topic_score_gemma":0.000004342249,"teacher_disagreement_score":0.014839342,"about_ca_system_score_codex":0.000006996019,"about_ca_system_score_gemma":0.00001863258,"threshold_uncertainty_score":0.2232923},"labels":[],"label_agreement":null},{"id":"W2395566361","doi":"","title":"Calculation of the Wiener, Szeged, and PI indices of a certain nanostar dendrimer.","year":2011,"lang":"hu","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Dendrimer; Mathematics; Pi; Pure mathematics; Chemistry; Polymer chemistry; Geometry","score_opus":0.029903053051812418,"score_gpt":0.25670870922202754,"score_spread":0.22680565617021511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395566361","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9965496,0.000779583,0.000013714371,0.00007827597,0.00038726232,0.00044671408,0.000026492427,0.000014158994,0.001704181],"genre_scores_gemma":[0.99927014,0.000076516095,0.00037703884,0.000016284539,0.0000033398733,0.000018309578,0.0000025873844,0.000021452808,0.000214333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868494,0.00021117977,0.0004903314,0.00020683964,0.00022623224,0.00018047584],"domain_scores_gemma":[0.99833506,0.00028481486,0.00058342173,0.0006003531,0.00013507891,0.000061284605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004208725,0.00017243765,0.0003046795,0.000078302335,0.00016402472,0.000009018542,0.00032592547,0.00015299115,0.00006443776],"category_scores_gemma":[0.0001503515,0.00013715144,0.00011976121,0.00039498296,0.00039758123,0.00009838859,0.00014100461,0.0001554562,0.0000058347655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030339743,0.00042677263,0.011639471,0.00017773434,0.0000776511,4.4855128e-7,0.007226789,5.886547e-7,0.005060109,0.97483826,0.00014484132,0.00037699152],"study_design_scores_gemma":[0.0006268514,0.000095440075,0.016353007,0.00017515435,0.00020677179,0.000002978163,0.0006062002,0.000060231854,0.07290198,0.9085738,0.0002643935,0.00013318307],"about_ca_topic_score_codex":0.00020318653,"about_ca_topic_score_gemma":0.000023069822,"teacher_disagreement_score":0.067841865,"about_ca_system_score_codex":0.000013770688,"about_ca_system_score_gemma":0.00005530219,"threshold_uncertainty_score":0.55928737},"labels":[],"label_agreement":null},{"id":"W2395698093","doi":"","title":"The hyper-Wiener index of trees with given parameters.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Index (typography); Statistics; Combinatorics; Computer science; Graph","score_opus":0.015507102631195598,"score_gpt":0.2561871999893441,"score_spread":0.2406800973581485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395698093","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9962066,0.000011089706,0.000022519705,0.0003193138,0.0002161721,0.00016402024,0.0000028036932,0.000034633405,0.0030228428],"genre_scores_gemma":[0.998787,0.0000033161234,0.0008694109,0.000017537131,0.0000034929058,0.000049300277,9.88718e-7,0.000014123218,0.00025486853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943584,0.000035077235,0.00014781402,0.00011187356,0.00013519466,0.00013417877],"domain_scores_gemma":[0.99866444,0.0006099237,0.000106511565,0.0005099501,0.000068891655,0.000040294683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002541799,0.000086442225,0.00012042476,0.000027985041,0.00015517182,0.000019678026,0.00027678185,0.00005440445,0.000014892832],"category_scores_gemma":[0.000105513434,0.000051694886,0.000046135145,0.00018266155,0.00022146845,0.000046132467,0.00003253991,0.0001806758,0.000008716191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015963493,0.000103697734,0.0056101736,0.000005251792,0.000025438223,2.5336564e-7,0.00015711575,7.162359e-7,0.001673262,0.99108577,0.0006839265,0.00063843984],"study_design_scores_gemma":[0.00033251903,0.000053486656,0.0037553073,0.000007676162,0.00002303081,0.0000033540748,0.00011282729,0.000022588722,0.0070591588,0.9852849,0.0032700377,0.00007511745],"about_ca_topic_score_codex":0.000010376634,"about_ca_topic_score_gemma":0.00007572608,"teacher_disagreement_score":0.005800866,"about_ca_system_score_codex":0.0000035650612,"about_ca_system_score_gemma":0.00001890441,"threshold_uncertainty_score":0.21080562},"labels":[],"label_agreement":null},{"id":"W2395713685","doi":"","title":"On Szeged polynomial of graphs with even number of vertices.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.012713214060469302,"score_gpt":0.27015730312837455,"score_spread":0.2574440890679052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395713685","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.988396,0.0000031549546,0.000028619745,0.000045047833,0.00011762495,0.00013996131,0.0000048396273,0.000025797011,0.011238991],"genre_scores_gemma":[0.9992645,0.0000010009638,0.00058976444,0.000021472,0.0000025739528,0.000017446053,0.0000020497062,0.000015680549,0.00008551369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993226,0.000069021895,0.00021220825,0.00012199507,0.00016065594,0.00011350837],"domain_scores_gemma":[0.9988357,0.0004810831,0.0001685596,0.0004013414,0.000070741735,0.000042596377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002443932,0.00009391714,0.00021267323,0.000041514213,0.00004276498,0.000003827064,0.00017713278,0.000051107854,0.000055295735],"category_scores_gemma":[0.000111204936,0.00007676498,0.00006175998,0.0001991275,0.000102916594,0.00003704396,0.000020416257,0.00008323431,0.000017667806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007575277,0.00030533026,0.0026446425,0.000041411906,0.000038114093,1.6311037e-7,0.00018664997,0.0000010782228,0.0011185657,0.994508,0.0009826432,0.0000975958],"study_design_scores_gemma":[0.0009116965,0.00014464151,0.0015986805,0.000048200644,0.000045709003,0.0000013125947,0.000028960292,0.00001536256,0.01769739,0.9792492,0.00017381967,0.000085035135],"about_ca_topic_score_codex":0.000013231355,"about_ca_topic_score_gemma":0.000002941626,"teacher_disagreement_score":0.016578825,"about_ca_system_score_codex":0.000006651207,"about_ca_system_score_gemma":0.000015755288,"threshold_uncertainty_score":0.31303853},"labels":[],"label_agreement":null},{"id":"W2395905535","doi":"","title":"A Unified Approach to the Extremal Trees without Perfect Matching for Different Indices.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Matching (statistics); Statistics; Combinatorics","score_opus":0.048556711760604915,"score_gpt":0.3000654741873985,"score_spread":0.25150876242679354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395905535","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99098665,0.00005324992,0.0033169787,0.00024125002,0.00038447874,0.0010344189,0.000010212798,0.00009566631,0.0038771154],"genre_scores_gemma":[0.9964882,0.0000014267206,0.0022584405,0.00009065385,0.000042155072,0.0006829135,0.000009656138,0.000033156204,0.00039339464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990256,0.000100400066,0.00019482641,0.00018088565,0.00015802846,0.00034026444],"domain_scores_gemma":[0.9987877,0.0005019196,0.00009159448,0.0004648321,0.000031875123,0.00012205621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062148436,0.00016959466,0.00020998485,0.000053559117,0.0003460991,0.00004749418,0.00034249166,0.00006420026,0.000011363078],"category_scores_gemma":[0.000092242226,0.000109609915,0.000107994565,0.00016688203,0.000036702542,0.00008777793,0.00007680004,0.00014489256,0.0000202721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022139,0.0004433494,0.00196007,0.000035279812,0.000038775026,3.4154727e-8,0.003936927,0.0000019380323,0.00041012574,0.99171925,0.001131526,0.0003006179],"study_design_scores_gemma":[0.0004992261,0.000040768045,0.004366066,0.000017899447,0.000080566984,0.0000036385452,0.0008061907,0.000079048965,0.0008751039,0.99109995,0.0019603923,0.00017113694],"about_ca_topic_score_codex":0.000006459132,"about_ca_topic_score_gemma":0.000005908127,"teacher_disagreement_score":0.0055015744,"about_ca_system_score_codex":0.000026953265,"about_ca_system_score_gemma":0.000010138783,"threshold_uncertainty_score":0.44697627},"labels":[],"label_agreement":null},{"id":"W2396029996","doi":"","title":"Clique number and distance spectral radii of graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Clique; Clique number; Combinatorics; Graph","score_opus":0.017840797435686263,"score_gpt":0.28660204694632035,"score_spread":0.26876124951063407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396029996","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99182737,0.0001012446,0.00007571409,0.000072141134,0.0002122762,0.0001267411,0.000007201672,0.000035394547,0.007541936],"genre_scores_gemma":[0.99863386,0.000019511463,0.0011463377,0.000017336608,0.0000058894384,0.000018567755,0.000002122591,0.000012081006,0.00014429542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946433,0.000040968273,0.00015908168,0.0000899992,0.000076833174,0.00016877905],"domain_scores_gemma":[0.9993971,0.00018732488,0.000079492704,0.00023671964,0.000024160863,0.00007518986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024680656,0.000081817176,0.00014245702,0.000019922105,0.000058779257,0.000006130368,0.00008842993,0.000045966684,0.00005113724],"category_scores_gemma":[0.000045250254,0.00007666497,0.000046381512,0.00014080247,0.00010318823,0.00009510763,0.00002369831,0.00008473373,0.000012387687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000618189,0.00016644146,0.037369717,0.00002994597,0.000015472813,2.1099457e-7,0.0003490013,1.3928079e-8,0.00033436934,0.960718,0.0009506265,0.000060069808],"study_design_scores_gemma":[0.00025543463,0.000011781016,0.009828232,0.000012753433,0.000021291567,0.0000058286687,0.000051119943,0.000002061367,0.004618795,0.9838465,0.0012616271,0.00008461802],"about_ca_topic_score_codex":0.0000036451163,"about_ca_topic_score_gemma":0.0000010969475,"teacher_disagreement_score":0.027541483,"about_ca_system_score_codex":0.0000075052044,"about_ca_system_score_gemma":0.000005856491,"threshold_uncertainty_score":0.31263068},"labels":[],"label_agreement":null},{"id":"W2396061165","doi":"","title":"On the Domination Number of the Circulant Graphs C(n;{1, 2}), C(n;{1, 3}) and C(n;{1, 4}).","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Circulant matrix; Mathematics; Combinatorics","score_opus":0.03301400109676463,"score_gpt":0.26581661696177394,"score_spread":0.2328026158650093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396061165","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9806034,0.000012919527,0.000009208854,0.00028942878,0.00027213703,0.00035848346,0.0000063222346,0.00003451569,0.018413564],"genre_scores_gemma":[0.9995123,0.0000083115965,0.00013275196,0.000114668015,0.0000017580185,0.00006324026,7.693986e-7,0.000015634461,0.00015057655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991341,0.00014828998,0.00022511421,0.00016132485,0.00019160648,0.00013956212],"domain_scores_gemma":[0.99846834,0.0006403484,0.00017422797,0.0006071196,0.000074562944,0.000035407564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005052236,0.00012368504,0.00014331107,0.000029889534,0.00023723413,0.000011880892,0.00032856077,0.00006397432,0.0001494066],"category_scores_gemma":[0.00023124518,0.00006905042,0.00009638942,0.00027580862,0.0002486269,0.000047755937,0.00007486603,0.00015393515,0.000019347124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011701545,0.00016686207,0.0022510649,0.0000142945955,0.000028010076,3.3640836e-7,0.0010518078,3.6072546e-8,0.00032748145,0.99477917,0.0012474381,0.00012181436],"study_design_scores_gemma":[0.00028027242,0.000021128182,0.010358139,0.00003292216,0.00004176795,0.000008464541,0.00016784908,0.000010296098,0.006164608,0.9827405,0.00008881982,0.00008521706],"about_ca_topic_score_codex":0.000018749904,"about_ca_topic_score_gemma":0.0000031288346,"teacher_disagreement_score":0.01890887,"about_ca_system_score_codex":0.00001031877,"about_ca_system_score_gemma":0.000014259294,"threshold_uncertainty_score":0.28157943},"labels":[],"label_agreement":null},{"id":"W2396228699","doi":"","title":"Extremal Values for the Maximum Degree in a Twin-Free Graph.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Graph; Combinatorics; Physics","score_opus":0.06866065517937235,"score_gpt":0.3091354455956739,"score_spread":0.24047479041630154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396228699","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9902558,0.000572692,0.000755755,0.0008111629,0.0010321524,0.0010066662,0.000018104609,0.00010852304,0.005439179],"genre_scores_gemma":[0.99701905,0.000011328555,0.0022007267,0.00008239337,0.000026497833,0.00042316693,0.0000028032896,0.000026165284,0.00020784483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990718,0.00006751594,0.00022603168,0.00014313233,0.00013813957,0.00035342592],"domain_scores_gemma":[0.9976682,0.001409515,0.00008026564,0.00073176646,0.000043493063,0.00006676042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009041855,0.00013481901,0.00016233054,0.000068171816,0.0001931698,0.000022699498,0.0004900527,0.00007415829,0.000034422214],"category_scores_gemma":[0.00038281994,0.00009887034,0.00012194686,0.00028359776,0.00008816391,0.00012423651,0.00009075618,0.00013837205,0.00002055474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001734932,0.00026190613,0.0024471935,0.000021511854,0.00002422738,2.781999e-7,0.0006988852,2.3597204e-7,0.0001072334,0.98912513,0.006259487,0.001036559],"study_design_scores_gemma":[0.0008221375,0.000025968084,0.0049702185,0.000015639276,0.000046962454,0.0000033560095,0.0003392401,0.0000228399,0.000561136,0.9901945,0.0028705809,0.00012741034],"about_ca_topic_score_codex":0.000012336676,"about_ca_topic_score_gemma":0.00001603287,"teacher_disagreement_score":0.006763309,"about_ca_system_score_codex":0.000020294441,"about_ca_system_score_gemma":0.000013646113,"threshold_uncertainty_score":0.40318155},"labels":[],"label_agreement":null},{"id":"W2396269925","doi":"","title":"Atom-bond connectivity index of unicyclic graphs with perfect matchings.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Atom (system on chip); Index (typography); Topological index; Computer science; World Wide Web","score_opus":0.013613071246342158,"score_gpt":0.2545618158380783,"score_spread":0.24094874459173615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396269925","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9942747,0.000021539337,0.00016920977,0.00010073559,0.00009923003,0.00047337293,0.0000045852767,0.00009763179,0.004759004],"genre_scores_gemma":[0.9989115,0.000003894179,0.00078340556,0.000033327215,0.0000022855318,0.00011655281,0.0000027377953,0.000028723047,0.00011758235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990577,0.00008360251,0.00023036455,0.00022293192,0.00019101586,0.00021434824],"domain_scores_gemma":[0.99856496,0.0004898479,0.00018667958,0.0005475535,0.00012538812,0.00008558613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028326781,0.0001679862,0.00028867615,0.0000913609,0.00012960871,0.000025003821,0.0002498488,0.00008541837,0.000113776936],"category_scores_gemma":[0.000052922474,0.00013681398,0.00008591006,0.00041086593,0.0001597205,0.0001676417,0.000056780722,0.00019944926,0.000042694282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009669666,0.00027670187,0.01596013,0.000041904845,0.00005774013,7.689544e-7,0.00031137883,4.679793e-7,0.0012214292,0.98104477,0.000760838,0.0003142108],"study_design_scores_gemma":[0.000686294,0.000100705525,0.0122251455,0.000038508744,0.000036461108,0.0000072041034,0.00018352129,0.00004585875,0.0048927935,0.9815,0.00011536242,0.0001680907],"about_ca_topic_score_codex":0.00012343943,"about_ca_topic_score_gemma":0.000014720384,"teacher_disagreement_score":0.0046414216,"about_ca_system_score_codex":0.000017257553,"about_ca_system_score_gemma":0.000027423612,"threshold_uncertainty_score":0.5579112},"labels":[],"label_agreement":null},{"id":"W2396433490","doi":"","title":"Asymptotic behavior of Laplacian-energy-like invariant of some graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Invariant (physics); Laplace operator; Pure mathematics; Mathematical analysis; Mathematical physics","score_opus":0.01712936372317403,"score_gpt":0.25606075154094093,"score_spread":0.2389313878177669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396433490","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9967992,0.000035859794,0.00012223265,0.000044304456,0.00039544218,0.00016358492,0.0000123376285,0.000049788847,0.0023772847],"genre_scores_gemma":[0.99901736,0.000009140285,0.00067766226,0.000041296968,0.00000456436,0.0000625401,0.000007286585,0.000023155659,0.00015701438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892807,0.00010737983,0.00041003685,0.00017750038,0.00020249156,0.00017450746],"domain_scores_gemma":[0.9985833,0.00037523624,0.00027262486,0.00059256837,0.000105092244,0.000071170325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040531435,0.00013656709,0.00032467922,0.00011885489,0.000065386586,0.000007299147,0.00030790726,0.00009856358,0.000043269934],"category_scores_gemma":[0.00010934696,0.000131264,0.00013506795,0.0002876197,0.00014206686,0.00008635975,0.000061902494,0.00009292508,0.000008927036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008708089,0.0005131526,0.001400303,0.000052828702,0.000031017313,6.2992643e-7,0.00011352799,5.618837e-7,0.005019448,0.9920856,0.0005451869,0.00022903598],"study_design_scores_gemma":[0.0005552091,0.000102218604,0.0017308267,0.000036765105,0.0001080209,0.0000024979613,0.00003235822,0.00002818437,0.019888386,0.977046,0.00034303273,0.00012650416],"about_ca_topic_score_codex":0.000023125507,"about_ca_topic_score_gemma":0.000004866488,"teacher_disagreement_score":0.015039602,"about_ca_system_score_codex":0.000009643328,"about_ca_system_score_gemma":0.00002337935,"threshold_uncertainty_score":0.53527904},"labels":[],"label_agreement":null},{"id":"W2396457618","doi":"","title":"Maximum Randic Index on Unicyclic Graphs with k Pendant Vertices.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Index (typography); Topological index; Computer science; World Wide Web","score_opus":0.016064164616172733,"score_gpt":0.25934707514566663,"score_spread":0.24328291052949388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396457618","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98421943,0.000014876018,0.00024747627,0.00022870093,0.00023999158,0.00028699488,0.0000026211635,0.00015291333,0.014606965],"genre_scores_gemma":[0.99927896,0.0000063986695,0.00023223896,0.00017432788,0.0000058470505,0.00006842933,0.000004767357,0.000034110402,0.00019489106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989126,0.00011771789,0.00020280489,0.00026422148,0.00024197741,0.00026070004],"domain_scores_gemma":[0.99861,0.00046546763,0.00011457115,0.0006489357,0.000047504112,0.00011353026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038839836,0.00018076101,0.00022858538,0.00010593324,0.00020614221,0.000034636476,0.00029500652,0.0000764806,0.00006240118],"category_scores_gemma":[0.000082889506,0.00014164802,0.000071797855,0.00034106546,0.000110277164,0.000072864044,0.000035569272,0.00021687386,0.00011664428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005998323,0.00025889478,0.0014713036,0.000018561985,0.000037237493,0.000002211541,0.00012816305,0.0000019060715,0.00010461145,0.9962799,0.00073356874,0.00090365787],"study_design_scores_gemma":[0.0018591969,0.0002072771,0.001820449,0.00004832185,0.00004992031,0.0000055442974,0.00004397558,0.00013112932,0.001073749,0.99193287,0.0026299988,0.00019754184],"about_ca_topic_score_codex":0.000009450035,"about_ca_topic_score_gemma":0.000008887413,"teacher_disagreement_score":0.015059529,"about_ca_system_score_codex":0.000019580628,"about_ca_system_score_gemma":0.000018046452,"threshold_uncertainty_score":0.5776239},"labels":[],"label_agreement":null},{"id":"W2396468862","doi":"","title":"On the Laplacian-Energy-Like of graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Laplace operator; Mathematical analysis","score_opus":0.018393152521764877,"score_gpt":0.24685145570362318,"score_spread":0.2284583031818583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396468862","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97718084,0.000018192717,0.000021486741,0.0006324921,0.0002648689,0.00019002939,0.0000032574067,0.000049848306,0.021638984],"genre_scores_gemma":[0.9988205,0.0000055615315,0.000103641716,0.00025273702,0.0000020838288,0.00012400701,0.0000017420484,0.000013729749,0.0006760342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993715,0.000069386275,0.00017365853,0.0001138487,0.00014012276,0.00013143725],"domain_scores_gemma":[0.9985232,0.0007671148,0.0000980636,0.00050247257,0.00007053852,0.000038629456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018647229,0.00009378439,0.00012391532,0.00004282666,0.00011331481,0.000015535315,0.00027320406,0.000049785067,0.00030877758],"category_scores_gemma":[0.000088862136,0.000062629064,0.00008258208,0.00023934485,0.000094235096,0.000046216348,0.000033403605,0.00009383562,0.000104744824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027059784,0.00014273629,0.00007684656,0.0000064299975,0.000020861098,1.5866712e-7,0.0000935609,2.0410913e-7,0.0004359866,0.9660035,0.03305882,0.00015822143],"study_design_scores_gemma":[0.00016493576,0.000038454316,0.00029023533,0.000014830492,0.00001262957,6.4037954e-7,0.000075408294,0.000017653208,0.0035761145,0.9944679,0.001269937,0.00007127533],"about_ca_topic_score_codex":0.000023316934,"about_ca_topic_score_gemma":0.0000022549652,"teacher_disagreement_score":0.031788882,"about_ca_system_score_codex":0.0000064031715,"about_ca_system_score_gemma":0.000009044313,"threshold_uncertainty_score":0.3380898},"labels":[],"label_agreement":null},{"id":"W2396610418","doi":"","title":"On the Laplacian spectral radii of tricyclic graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tricyclic; Mathematics; Laplace operator; Combinatorics; Chemistry; Mathematical analysis; Stereochemistry","score_opus":0.01987101167511251,"score_gpt":0.2626211146724926,"score_spread":0.2427501029973801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396610418","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97400934,0.000009221678,0.00003233069,0.00065034226,0.00022879659,0.0001985395,0.0000030882206,0.000049773687,0.024818582],"genre_scores_gemma":[0.99949473,0.000003541103,0.00013119321,0.000120367644,0.0000054961088,0.000029445206,0.0000014502549,0.000014133284,0.00019962854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992555,0.00012951673,0.00019168723,0.00012789071,0.00014443167,0.00015102419],"domain_scores_gemma":[0.9980872,0.001219827,0.000112962625,0.0005101398,0.000027656846,0.00004220644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049939356,0.00009996301,0.00015923877,0.00006040891,0.00012775662,0.000011205038,0.00028767536,0.00004790978,0.000072140625],"category_scores_gemma":[0.00030002277,0.0000693498,0.00010689385,0.00030642288,0.000097593314,0.000025663634,0.000020792182,0.00013971161,0.000047034733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009574088,0.00016463311,0.00019296387,0.000009178201,0.000018786679,1.8686129e-7,0.00014666766,3.4052482e-7,0.00036833898,0.99472135,0.004189808,0.00017819495],"study_design_scores_gemma":[0.00034769232,0.00008544842,0.00083818485,0.000013486576,0.000021559028,0.0000011106977,0.000034558514,0.00002549323,0.0056140674,0.99169856,0.0012417645,0.000078054414],"about_ca_topic_score_codex":0.0000035683017,"about_ca_topic_score_gemma":0.0000017249596,"teacher_disagreement_score":0.02548542,"about_ca_system_score_codex":0.000008660236,"about_ca_system_score_gemma":0.000007801034,"threshold_uncertainty_score":0.2828003},"labels":[],"label_agreement":null},{"id":"W2396799827","doi":"","title":"On minimal energy of bipartite unicyclic graphs of a given bipartition.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Complete bipartite graph; Graph","score_opus":0.027103618686472843,"score_gpt":0.28228496899505096,"score_spread":0.25518135030857814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396799827","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9946313,0.000094425035,0.000044906366,0.000057967092,0.00021739362,0.00009523544,0.000018253078,0.000033298198,0.004807222],"genre_scores_gemma":[0.9993611,0.000014382892,0.00040391457,0.000027285885,0.0000050590597,0.000044224103,0.0000062442114,0.000016378284,0.000121398385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991172,0.00008841628,0.00031946058,0.000110936584,0.00016272815,0.00020123829],"domain_scores_gemma":[0.99877757,0.00044672185,0.00021825937,0.0004069138,0.00006739338,0.000083158404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026961375,0.00010843513,0.0002237009,0.00012568964,0.00005175784,0.000003300329,0.00017014625,0.00006780887,0.00008636908],"category_scores_gemma":[0.00009543923,0.000102232974,0.00011868063,0.00037433728,0.00012334921,0.00008415041,0.000036178084,0.00006543194,0.000015200356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001992547,0.0007625097,0.0012162492,0.000028237891,0.00004190719,1.7867829e-7,0.00024699402,5.528015e-7,0.004441971,0.9910238,0.002046874,0.00017082397],"study_design_scores_gemma":[0.000371651,0.000109104236,0.0011084178,0.000037074657,0.000041632058,0.0000010983442,0.000048890524,0.000010331804,0.05450972,0.9426123,0.0010591556,0.00009063401],"about_ca_topic_score_codex":0.0000121557805,"about_ca_topic_score_gemma":0.0000017917542,"teacher_disagreement_score":0.050067753,"about_ca_system_score_codex":0.000009470461,"about_ca_system_score_gemma":0.000012548772,"threshold_uncertainty_score":0.416894},"labels":[],"label_agreement":null},{"id":"W2397005811","doi":"","title":"The Signless Laplacian specttral radius of bicyclic graphs with order n and girth g.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Girth (graph theory); Combinatorics; Discrete mathematics","score_opus":0.026843991954859456,"score_gpt":0.2695828428488755,"score_spread":0.24273885089401606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397005811","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9942121,0.00013722912,0.00002308137,0.00029607036,0.00013176323,0.00023189445,0.0000032840092,0.000041212126,0.00492336],"genre_scores_gemma":[0.99915224,0.0000172009,0.00048764917,0.000017836172,0.0000037533594,0.000027876305,0.0000015703775,0.000016595804,0.00027529144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999302,0.00007083025,0.00016492071,0.00013569687,0.0001605621,0.00016595807],"domain_scores_gemma":[0.9990285,0.0003153782,0.000105741776,0.00034661227,0.00010764723,0.00009614636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036540514,0.00010944925,0.00015875608,0.000040357692,0.000148989,0.000024990613,0.00018110909,0.0000427555,0.00000523942],"category_scores_gemma":[0.00008661581,0.00007000579,0.00002816648,0.00035146278,0.00025268673,0.0000551208,0.000031626678,0.00010646457,0.000005521769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037639053,0.000090691996,0.0030366345,0.000010347508,0.00003680363,0.000001445102,0.0005442169,3.9637425e-7,0.000102557446,0.9948677,0.0010496639,0.0002219259],"study_design_scores_gemma":[0.00082179304,0.0001183683,0.00083095324,0.000014313482,0.000034183824,0.0000097771335,0.0004701698,0.0000135612045,0.0012687951,0.99485844,0.0014600313,0.00009959527],"about_ca_topic_score_codex":0.000014938876,"about_ca_topic_score_gemma":0.00003331316,"teacher_disagreement_score":0.0049401214,"about_ca_system_score_codex":0.000008712657,"about_ca_system_score_gemma":0.00003807546,"threshold_uncertainty_score":0.2854753},"labels":[],"label_agreement":null},{"id":"W2397010240","doi":"","title":"On the signless Laplacian spectra of bicyclic and tricyclic graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tricyclic; Combinatorics; Mathematics; Bicyclic molecule; Stereochemistry; Chemistry","score_opus":0.045852315010755845,"score_gpt":0.28717936069790356,"score_spread":0.24132704568714772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397010240","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98807603,0.000055663826,0.000012807499,0.00060615723,0.00015001727,0.00025668854,0.0000050867397,0.00004270736,0.010794826],"genre_scores_gemma":[0.99962395,0.000009922844,0.00011235721,0.00007998305,0.0000036620831,0.000034572964,0.0000012943502,0.000014766308,0.000119478784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992438,0.000109142275,0.00019200887,0.00014579097,0.00016849482,0.00014079583],"domain_scores_gemma":[0.99852747,0.00082644896,0.00011218866,0.000404156,0.000045758658,0.000083964835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005102433,0.000110457266,0.00017361138,0.0000774422,0.000092454844,0.000017069506,0.00021009667,0.00005469648,0.000016027197],"category_scores_gemma":[0.00027010252,0.00007706925,0.000054616692,0.00036316144,0.00013761572,0.000038180086,0.00003432291,0.00013158054,0.000018029214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016732083,0.00016586311,0.00038984994,0.0000103642,0.000021110382,8.498014e-7,0.0004501575,1.7580086e-7,0.00029255575,0.9955771,0.002898247,0.00017696944],"study_design_scores_gemma":[0.0005049852,0.000096771706,0.0007852011,0.000016394704,0.000025962823,0.000002766199,0.00025916763,0.000009094199,0.0033848302,0.9944465,0.00038088582,0.00008743977],"about_ca_topic_score_codex":0.000007274156,"about_ca_topic_score_gemma":0.0000027523654,"teacher_disagreement_score":0.011547917,"about_ca_system_score_codex":0.0000109165485,"about_ca_system_score_gemma":0.000017385224,"threshold_uncertainty_score":0.3142793},"labels":[],"label_agreement":null},{"id":"W2397111251","doi":"","title":"On the spectral radius of quasi-unicycle graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; RADIUS; Pure mathematics; Combinatorics; Computer science; Physics; Eigenvalues and eigenvectors; Computer security; Quantum mechanics","score_opus":0.02091164492999859,"score_gpt":0.2614589640855233,"score_spread":0.24054731915552474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397111251","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9859101,0.000016817674,0.000011432936,0.0008677507,0.00018375911,0.00034840783,0.0000029639398,0.00004889285,0.012609835],"genre_scores_gemma":[0.99933505,0.0000051596567,0.00020890067,0.00009340448,0.0000030860704,0.000079381345,0.000001187356,0.000014483532,0.00025934636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999312,0.000080771104,0.00019001309,0.00012087901,0.00013798934,0.00015834837],"domain_scores_gemma":[0.99844825,0.0008080588,0.00009919497,0.0005519352,0.00004774625,0.00004478632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024142672,0.00009794389,0.00014119883,0.00004256105,0.00011562833,0.000016982574,0.000278675,0.000044612578,0.00038397263],"category_scores_gemma":[0.00014006851,0.000067128785,0.00009798119,0.00023525272,0.00011694179,0.000050540864,0.000028308317,0.0001372471,0.00016452231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036167776,0.00028793304,0.00014820886,0.000008194407,0.000022284798,2.4023478e-7,0.00019627008,2.5179358e-7,0.0008855015,0.9882187,0.010117608,0.00011115802],"study_design_scores_gemma":[0.00022661277,0.00007857027,0.001275621,0.000013878651,0.000014016335,0.000001226402,0.000116415446,0.00002945009,0.005990643,0.9919981,0.00017886382,0.00007663089],"about_ca_topic_score_codex":0.000024044686,"about_ca_topic_score_gemma":0.0000015302548,"teacher_disagreement_score":0.013424911,"about_ca_system_score_codex":0.000009784189,"about_ca_system_score_gemma":0.00001062438,"threshold_uncertainty_score":0.4204231},"labels":[],"label_agreement":null},{"id":"W2397155156","doi":"","title":"PI Index of Extremal Simple Pericondensed Hexagonal Systems.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Simple (philosophy); Hexagonal crystal system; Index (typography); Combinatorics; Pure mathematics; Discrete mathematics; Crystallography; Computer science; Chemistry","score_opus":0.03641791523662894,"score_gpt":0.29244438985618293,"score_spread":0.25602647461955397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397155156","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9946537,0.0001641026,0.0001151866,0.00002470297,0.0005189549,0.00022749919,0.000012690096,0.00006372535,0.004219448],"genre_scores_gemma":[0.9994413,0.0000019188708,0.00015501695,0.000016583386,0.000019413023,0.000051570718,0.0000055985606,0.00002133662,0.00028722564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903667,0.00008923597,0.00029493225,0.00012028184,0.0001970447,0.00026180662],"domain_scores_gemma":[0.9989103,0.0003514663,0.0001610643,0.00038640545,0.00008305079,0.000107714746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042311483,0.00012231279,0.00023567709,0.0000587085,0.00009283324,0.000013424235,0.00018635708,0.000084662264,0.00014153727],"category_scores_gemma":[0.0001051598,0.00011563456,0.00008315459,0.00020591587,0.000074909025,0.000113728376,0.000051062536,0.00011394077,0.000041660245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010101334,0.00032356064,0.016192924,0.00006507911,0.000031718926,4.213483e-7,0.00036921498,0.0000010219394,0.0014901041,0.97931427,0.002149904,0.000051663712],"study_design_scores_gemma":[0.00046875034,0.000027983406,0.0067121033,0.00001742415,0.000033981643,0.000009793658,0.00037954678,0.000067662986,0.001763335,0.9882904,0.0020889577,0.00014006198],"about_ca_topic_score_codex":0.000014470934,"about_ca_topic_score_gemma":6.4041376e-7,"teacher_disagreement_score":0.009480822,"about_ca_system_score_codex":0.000022016604,"about_ca_system_score_gemma":0.00002469708,"threshold_uncertainty_score":0.47154406},"labels":[],"label_agreement":null},{"id":"W2397175735","doi":"","title":"Distance in the non-commuting graph of groups.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.037561555992187724,"score_gpt":0.2741475088030474,"score_spread":0.23658595281085967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397175735","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98135954,0.000026866144,0.0001391808,0.00004642373,0.00011040435,0.00018769427,0.0000017819796,0.000018281433,0.018109836],"genre_scores_gemma":[0.9992379,0.0000046326395,0.00065526296,0.00002946406,0.0000017315026,0.000045094774,0.0000010632741,0.0000085822885,0.000016294814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938875,0.00007538303,0.00021549362,0.00009484052,0.000098181285,0.00012733795],"domain_scores_gemma":[0.9990899,0.0003086765,0.00010742889,0.00045082482,0.000026336202,0.00001683378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005820934,0.00007384087,0.00012625841,0.000040978717,0.00007155633,0.000005412166,0.00038764047,0.0000354035,0.000017440947],"category_scores_gemma":[0.00006444433,0.0000551335,0.000055683642,0.0003463309,0.00008624505,0.000049109065,0.00003310804,0.00013008024,0.0000061535334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056676868,0.00024525056,0.0056066695,0.000021333019,0.0000064557817,0.0000011361956,0.0045023253,4.8481702e-8,0.00015101071,0.98919696,0.00019184759,0.00007129587],"study_design_scores_gemma":[0.00023597038,0.000022142862,0.010106845,0.000027515774,0.000010526686,0.0000012769003,0.000945471,0.000006732512,0.0018787907,0.9866448,0.00005810709,0.00006179897],"about_ca_topic_score_codex":0.000027361963,"about_ca_topic_score_gemma":0.000015178303,"teacher_disagreement_score":0.01809354,"about_ca_system_score_codex":0.000005653893,"about_ca_system_score_gemma":0.000006058253,"threshold_uncertainty_score":0.22482789},"labels":[],"label_agreement":null},{"id":"W2397289802","doi":"","title":"The hyper-Wiener index of unicyclic graphs with given matching number.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Matching (statistics); Index (typography); Combinatorics; Statistics; Graph; Computer science; World Wide Web","score_opus":0.02673195540462121,"score_gpt":0.26354293707610066,"score_spread":0.23681098167147946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397289802","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97707474,0.000022067534,0.000068179295,0.00006170483,0.00013485496,0.00018834608,0.000002562564,0.00005506802,0.022392476],"genre_scores_gemma":[0.9987474,0.00001498458,0.0008885048,0.000020386646,0.0000022411325,0.00004854872,0.0000010703451,0.000023633438,0.00025321232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999222,0.00007658714,0.0002149928,0.00014264205,0.00015901179,0.00018476196],"domain_scores_gemma":[0.9988169,0.0003431138,0.00016103608,0.0005540351,0.000073701725,0.000051201223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032125125,0.000117916796,0.00015607843,0.000033523585,0.00023448003,0.000013903356,0.00036878945,0.000054752694,0.000042016327],"category_scores_gemma":[0.000029521707,0.000076226126,0.0000649093,0.00032204282,0.00018569296,0.00007662851,0.000058172063,0.0001486513,0.00002117962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000187775,0.0001485914,0.00904467,0.000011281203,0.00004681814,6.495225e-7,0.00096593023,2.2854665e-7,0.00012164703,0.98897636,0.0002477601,0.00041729596],"study_design_scores_gemma":[0.00036098727,0.000037529844,0.0045706336,0.000026358302,0.000034412245,0.0000069711,0.000454076,0.0000064984083,0.0015552461,0.9922968,0.00054602115,0.00010444108],"about_ca_topic_score_codex":0.000053281034,"about_ca_topic_score_gemma":0.000020058334,"teacher_disagreement_score":0.022139264,"about_ca_system_score_codex":0.000008537061,"about_ca_system_score_gemma":0.000019953424,"threshold_uncertainty_score":0.3108411},"labels":[],"label_agreement":null},{"id":"W2397655904","doi":"","title":"Tree with minimal Laplacian spectral radius and diameter n-4.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tree (set theory); Spectral radius; RADIUS; Laplace operator; Combinatorics; Mathematical analysis; Physics; Computer science; Eigenvalues and eigenvectors","score_opus":0.014148617903686848,"score_gpt":0.2384438058623373,"score_spread":0.22429518795865044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397655904","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98819166,0.000026249147,0.000024344221,0.00038307803,0.000083253406,0.0002834488,0.0000024272576,0.00007030084,0.010935227],"genre_scores_gemma":[0.9942309,0.0000038549597,0.004922555,0.00006254201,0.0000076248393,0.000087568376,0.000002028806,0.00001966892,0.0006632522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993851,0.000033268698,0.0001236213,0.00017390569,0.000092844995,0.00019121634],"domain_scores_gemma":[0.99936914,0.0001994025,0.00005050553,0.0002575423,0.000029379938,0.00009400357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009110332,0.00011878075,0.00014689112,0.00004083647,0.00009477155,0.00004932117,0.00011012861,0.000047208552,0.00015012707],"category_scores_gemma":[0.00002829956,0.00009338992,0.00003110989,0.00012002865,0.00010556658,0.00011825178,0.000024600473,0.00010187266,0.0000750069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009769417,0.00009675217,0.0034047018,0.000011825527,0.000025213327,0.0000022939394,0.0002657684,1.8233157e-8,0.000492161,0.9914746,0.0033600617,0.0008568163],"study_design_scores_gemma":[0.00063340063,0.00011969208,0.0093513625,0.000011756725,0.000027982218,0.000014619436,0.00013129397,0.00002210146,0.001318936,0.9875334,0.00069622946,0.00013921523],"about_ca_topic_score_codex":0.000012400245,"about_ca_topic_score_gemma":0.00001174009,"teacher_disagreement_score":0.010271976,"about_ca_system_score_codex":0.000008348245,"about_ca_system_score_gemma":0.000009935511,"threshold_uncertainty_score":0.38083306},"labels":[],"label_agreement":null},{"id":"W2397803124","doi":"","title":"Flexibility of Circular Graphs C(2n, 2) on the Projective Plane.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Projective plane; Projective test; Flexibility (engineering); Plane (geometry); Real projective plane; Combinatorics; Pure mathematics; Geometry; Projective space; Collineation; Statistics","score_opus":0.08205620202908284,"score_gpt":0.29191591265374855,"score_spread":0.2098597106246657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397803124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96711934,0.000012080861,0.000014583305,0.000046925095,0.00016058059,0.00049305847,0.00001143879,0.000056027508,0.032085992],"genre_scores_gemma":[0.99960226,0.0000023452405,0.00018780943,0.000041991407,0.0000018238505,0.00009272833,0.000001966603,0.000012379155,0.00005669706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991824,0.00014247544,0.00020408368,0.00018439161,0.00014990072,0.00013673847],"domain_scores_gemma":[0.9986021,0.00046831873,0.0001269171,0.00068750535,0.00008140118,0.000033788354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005766827,0.00010897096,0.00015560782,0.000044401037,0.00011793988,0.000005197566,0.0002893174,0.000060467934,0.00013065209],"category_scores_gemma":[0.00020752249,0.00007430961,0.00009812366,0.0002522915,0.00016569377,0.000034908688,0.000035677836,0.00015352172,0.000028219862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000276413,0.0004501453,0.0009355523,0.000023414634,0.00004530207,7.5527754e-7,0.0013854209,6.707017e-8,0.0003562706,0.99603903,0.00068194675,0.00005442537],"study_design_scores_gemma":[0.0001923016,0.00009616049,0.002975088,0.000017657014,0.000028465267,0.0000014426862,0.00031545377,0.000003849006,0.021850957,0.9743154,0.00012167872,0.0000815444],"about_ca_topic_score_codex":0.000028638227,"about_ca_topic_score_gemma":0.0000019410527,"teacher_disagreement_score":0.03248295,"about_ca_system_score_codex":0.000013329029,"about_ca_system_score_gemma":0.000021618267,"threshold_uncertainty_score":0.30302578},"labels":[],"label_agreement":null},{"id":"W2398008903","doi":"","title":"Subtrees, BC-Subtrees of Generalized Bethe Trees and Related Questions","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.03613497431998955,"score_gpt":0.29382354678114747,"score_spread":0.25768857246115795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398008903","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99357295,0.00034883452,0.000017199107,0.00036816314,0.00025184147,0.0002190786,0.00001779483,0.00011797872,0.0050861854],"genre_scores_gemma":[0.9974009,0.000036247187,0.0018049965,0.000014470457,0.000004850794,0.000038467202,0.000015300147,0.000022253354,0.0006625618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901026,0.00015074718,0.0003287232,0.000187521,0.00016265758,0.00016008146],"domain_scores_gemma":[0.9988488,0.00029524253,0.0001578794,0.0004243577,0.00013909522,0.00013462773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004857929,0.00013893528,0.0002590715,0.00008327151,0.00009841386,0.000017357022,0.00017665919,0.000108787106,0.000036684378],"category_scores_gemma":[0.00030853905,0.0001250214,0.000064995285,0.00029132832,0.00017833311,0.000092357324,0.000061279476,0.00012451225,0.00001711966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001439197,0.00018959395,0.0026698972,0.0000131186025,0.00004832288,0.0000015634479,0.00070239557,0.0000026577995,0.0006899507,0.9926481,0.002812071,0.00020791139],"study_design_scores_gemma":[0.0010223805,0.00007149695,0.0016402793,0.000029759874,0.00007919172,0.0000084918665,0.00018528248,0.0000898578,0.0015810785,0.99393713,0.0012204393,0.00013462047],"about_ca_topic_score_codex":0.00009421435,"about_ca_topic_score_gemma":0.000040814142,"teacher_disagreement_score":0.004423624,"about_ca_system_score_codex":0.000018560626,"about_ca_system_score_gemma":0.000040499046,"threshold_uncertainty_score":0.5098225},"labels":[],"label_agreement":null},{"id":"W2398184112","doi":"","title":"Estimates of the choice numbers and the Ohba numbers of some complete multipartite graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multipartite; Mathematics; Combinatorics; Graph; Integer (computer science); Discrete mathematics; Computer science; Physics","score_opus":0.042139634510755676,"score_gpt":0.2935929708367545,"score_spread":0.2514533363259988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398184112","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9969445,0.00013120436,0.000006809347,0.0005107766,0.0002809869,0.00038420237,0.000018167497,0.000028143479,0.0016951987],"genre_scores_gemma":[0.9992953,0.0000090015765,0.00052533275,0.00006037062,0.00000337573,0.000036663674,0.0000017748008,0.000014420145,0.00005374661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908346,0.00013380148,0.00030175765,0.00013112495,0.00020555848,0.00014432169],"domain_scores_gemma":[0.997768,0.0012588858,0.0002660029,0.00053299655,0.00011195133,0.00006217309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060227246,0.00012017762,0.00026595962,0.000026673586,0.00011995366,0.000012998002,0.00035436958,0.00004829545,0.000006303497],"category_scores_gemma":[0.00052963255,0.000071934366,0.00010616318,0.00025929342,0.0007718157,0.00008181589,0.000116111776,0.00012160749,0.0000043593695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026683514,0.00009165774,0.008201376,0.000040554958,0.000056059213,1.01768656e-7,0.001210177,0.0000043388227,0.00038549243,0.9885828,0.0013716639,0.00002911155],"study_design_scores_gemma":[0.0017743219,0.000017439259,0.0022907453,0.000037471247,0.00008547588,0.0000028925833,0.0002610118,0.00019298964,0.0023556792,0.992394,0.00050859083,0.00007942604],"about_ca_topic_score_codex":0.00017663793,"about_ca_topic_score_gemma":0.00002014213,"teacher_disagreement_score":0.0059106303,"about_ca_system_score_codex":0.000008698659,"about_ca_system_score_gemma":0.000022789398,"threshold_uncertainty_score":0.29333982},"labels":[],"label_agreement":null},{"id":"W2398226296","doi":"","title":"Semi-regular harmonic graph and equi-bipartite harmonic graph.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Complete bipartite graph; Edge-transitive graph; Graph; Combinatorics; Voltage graph; Discrete mathematics; Line graph","score_opus":0.02500176969467907,"score_gpt":0.27860292816519927,"score_spread":0.2536011584705202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398226296","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9952669,0.0008595846,0.00012427152,0.0010289055,0.00028266624,0.0004058805,0.000009969691,0.00026441048,0.0017573765],"genre_scores_gemma":[0.9984488,0.00017203834,0.00061943993,0.00026362308,0.000012097012,0.00005737616,0.000010338344,0.00003100033,0.00038526964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984376,0.00009952715,0.00036563096,0.0004133585,0.00023767535,0.00044620287],"domain_scores_gemma":[0.9986442,0.00021461901,0.00015097776,0.0007113413,0.000078697,0.00020016341],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047675226,0.0002717888,0.00032761303,0.00015672932,0.00032725575,0.0000805571,0.0003276348,0.00014166995,0.000055702847],"category_scores_gemma":[0.00007790459,0.00026768414,0.00016005531,0.0005742074,0.00016004418,0.00018838464,0.00006546814,0.00027015115,0.00005423954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014906717,0.0002446405,0.00030635478,0.000023933524,0.000046404875,0.0000060112247,0.00022500377,4.773654e-7,0.006357346,0.98699063,0.0049662394,0.0008180472],"study_design_scores_gemma":[0.00083431404,0.00013129272,0.0021017883,0.000043819637,0.00009642313,0.000016055235,0.000060081726,0.000029814613,0.010333447,0.9839391,0.0021140566,0.00029980682],"about_ca_topic_score_codex":0.000004604957,"about_ca_topic_score_gemma":0.000002029064,"teacher_disagreement_score":0.0039761006,"about_ca_system_score_codex":0.000023678744,"about_ca_system_score_gemma":0.000025664363,"threshold_uncertainty_score":0.9999775},"labels":[],"label_agreement":null},{"id":"W2398284551","doi":"","title":"On The Energy Of 3-Circulant Graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Circulant matrix; Mathematics; Energy (signal processing); Combinatorics; Statistics","score_opus":0.020081729769971135,"score_gpt":0.2460463901696723,"score_spread":0.22596466039970117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398284551","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9889394,0.000016541311,0.000033213277,0.0004239141,0.00015156675,0.00014564025,0.0000022589625,0.00003490804,0.010252533],"genre_scores_gemma":[0.9994757,0.0000054054926,0.00006211412,0.00015286631,0.0000016791159,0.00010749216,0.0000014238724,0.000010571013,0.00018270542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994637,0.00006093147,0.00015135443,0.00009583411,0.00011913506,0.00010906643],"domain_scores_gemma":[0.99873483,0.0006541785,0.00008230982,0.00044059232,0.000056435394,0.000031655214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015414908,0.00007599807,0.0001071669,0.000034618843,0.0000839894,0.000011002136,0.00022532794,0.000037121063,0.0002372194],"category_scores_gemma":[0.00008950404,0.00004879485,0.00007268668,0.00017743626,0.00007402096,0.000029184775,0.000025679692,0.0000671039,0.00005936151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014423514,0.00012965105,0.00006410111,0.0000054956554,0.000019940231,1.7134515e-7,0.00007960976,1.940476e-7,0.0014634484,0.98693645,0.011163104,0.00013636932],"study_design_scores_gemma":[0.00012481373,0.000028023538,0.00036003863,0.000012658052,0.000010395761,9.2199946e-7,0.000053640964,0.00001929406,0.008322924,0.99066585,0.0003439624,0.000057462206],"about_ca_topic_score_codex":0.00003391016,"about_ca_topic_score_gemma":9.456385e-7,"teacher_disagreement_score":0.010819143,"about_ca_system_score_codex":0.0000054560014,"about_ca_system_score_gemma":0.0000075081157,"threshold_uncertainty_score":0.2597386},"labels":[],"label_agreement":null},{"id":"W2398376000","doi":"","title":"A note on the LEL-equienergetic graphs","year":2014,"lang":"es","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics; Eigenvalues and eigenvectors","score_opus":0.016671470542905343,"score_gpt":0.2666490869492172,"score_spread":0.24997761640631183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398376000","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96005696,0.00006768341,0.000083399704,0.0042492994,0.0013131535,0.0004981101,0.000013012362,0.0001366485,0.033581737],"genre_scores_gemma":[0.9982872,0.00004307895,0.00013656759,0.00070047466,0.000024785842,0.00012809107,0.0000051825937,0.00005617307,0.0006184307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806374,0.0004252587,0.0003767744,0.00037616288,0.00033894132,0.00041914833],"domain_scores_gemma":[0.9959244,0.0022721442,0.00022439533,0.0013568545,0.00009497704,0.00012720258],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010508123,0.0003150296,0.00031455985,0.000100271776,0.0005677747,0.00014006428,0.00069484016,0.00017475423,0.00017380164],"category_scores_gemma":[0.000581508,0.0002276511,0.0002422909,0.00051981886,0.00026851645,0.00005859623,0.00011438993,0.00042100257,0.0010228581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016544001,0.00041323042,0.00014631361,0.000052748688,0.00004801404,0.0000010452646,0.00036842184,0.0000042027527,0.0006300906,0.9920959,0.0055096243,0.0007138862],"study_design_scores_gemma":[0.00047082425,0.00018585636,0.00048250717,0.00012936548,0.0001105331,0.0000024307433,0.000057634734,0.00037886415,0.0028373597,0.96986353,0.025210302,0.00027077357],"about_ca_topic_score_codex":0.000007804398,"about_ca_topic_score_gemma":0.0000015878368,"teacher_disagreement_score":0.03823026,"about_ca_system_score_codex":0.000029261244,"about_ca_system_score_gemma":0.000030038691,"threshold_uncertainty_score":0.99975497},"labels":[],"label_agreement":null},{"id":"W2398394717","doi":"","title":"On Maximum Merrifield-Simmons Index of Unicyclic Graphs with Prescribed Pendent Vertices.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Discrete mathematics; Computer science; World Wide Web","score_opus":0.03815823998358468,"score_gpt":0.26338456369090923,"score_spread":0.22522632370732454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398394717","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97507685,0.000027403605,0.00011009404,0.000051012637,0.0001930474,0.00035851006,0.000006232917,0.0000805151,0.024096338],"genre_scores_gemma":[0.9992332,0.0000070255896,0.0004327091,0.000054843884,0.0000015627265,0.00007308565,0.0000028198629,0.000026488779,0.00016828501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989601,0.00007768157,0.0002726826,0.00023351153,0.0002372618,0.00021879081],"domain_scores_gemma":[0.99869204,0.0002528376,0.00017312108,0.000708608,0.0000807702,0.00009262887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020304795,0.0001670919,0.00023548289,0.000110733716,0.00009568277,0.000009675301,0.00036466628,0.00009532575,0.00016519164],"category_scores_gemma":[0.000055463697,0.00013770931,0.00008498387,0.00030900253,0.00012737898,0.000082510735,0.000051447343,0.0002014774,0.000021443975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009644296,0.0007090192,0.0016432559,0.0000280389,0.000088390705,0.0000039942024,0.0009924946,6.308977e-7,0.00022282875,0.9953493,0.00068032043,0.00018528407],"study_design_scores_gemma":[0.0008551319,0.0002720871,0.0027568655,0.000051119256,0.00008157789,0.00000258007,0.00018814948,0.0000194454,0.010954558,0.9845259,0.00013205715,0.00016053254],"about_ca_topic_score_codex":0.00006851079,"about_ca_topic_score_gemma":0.00002561992,"teacher_disagreement_score":0.024156334,"about_ca_system_score_codex":0.000012802329,"about_ca_system_score_gemma":0.000027959075,"threshold_uncertainty_score":0.56156224},"labels":[],"label_agreement":null},{"id":"W2398402683","doi":"","title":"The γ-spectrum of a graph","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectrum (functional analysis); Graph; Combinatorics; Physics","score_opus":0.03627350356025675,"score_gpt":0.2660037752074153,"score_spread":0.22973027164715856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398402683","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96962607,0.00006393279,0.00004429145,0.00012570557,0.00029137105,0.0001597382,0.00000212876,0.00005240129,0.029634373],"genre_scores_gemma":[0.9993712,0.000016589027,0.00035455835,0.000010886967,0.0000017034725,0.00003117778,3.3599005e-7,0.000009095917,0.00020450135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995165,0.000040360857,0.00015965215,0.000079723075,0.00008251169,0.00012125629],"domain_scores_gemma":[0.99918324,0.00025932342,0.00008949162,0.00040731253,0.00003118922,0.000029432129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028613734,0.000060828752,0.000087805674,0.000024542313,0.00014430056,0.0000055691257,0.00025518294,0.000030433308,0.00004185206],"category_scores_gemma":[0.00006188352,0.000041830666,0.00006783003,0.00018935413,0.00012033353,0.000027835891,0.000034044235,0.00007154761,0.000019487488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000082857005,0.00010612622,0.00039806668,0.000005675775,0.00002050089,3.248903e-7,0.00046425214,7.2614053e-9,0.00013251798,0.9977122,0.0010268266,0.00012521833],"study_design_scores_gemma":[0.00015107807,0.00003425796,0.0010957448,0.000005836326,0.000015679037,0.0000013904427,0.00012175423,0.0000014593003,0.009454419,0.9883002,0.0007692451,0.000048960654],"about_ca_topic_score_codex":0.000009611246,"about_ca_topic_score_gemma":0.0000055540218,"teacher_disagreement_score":0.029745094,"about_ca_system_score_codex":0.000003951434,"about_ca_system_score_gemma":0.000009605935,"threshold_uncertainty_score":0.1705805},"labels":[],"label_agreement":null},{"id":"W2398599938","doi":"","title":"PI Indices For Some Classes Of Bicyclic Graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Bicyclic molecule; Stereochemistry; Chemistry","score_opus":0.02429378601142765,"score_gpt":0.30401232204167267,"score_spread":0.279718536030245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398599938","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99733335,0.000026950283,0.000011574607,0.0001541007,0.00064656034,0.00033382833,0.000021014104,0.00006757652,0.0014050376],"genre_scores_gemma":[0.9979064,0.0000072876683,0.0017307274,0.000036413305,0.00000974461,0.00013115144,0.00000663236,0.000019382856,0.00015229211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993364,0.00002068748,0.00023203301,0.00014778359,0.00010453999,0.00015854252],"domain_scores_gemma":[0.9986533,0.0006793487,0.00016963332,0.00037864107,0.00006512111,0.000053986747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028452682,0.00010083572,0.00018485318,0.000098507655,0.000110016386,0.000014153189,0.00026437748,0.00008093216,0.00003972555],"category_scores_gemma":[0.00021755113,0.000092468545,0.00011045316,0.00019966603,0.00012151566,0.00010616326,0.00003106384,0.00014107156,0.000012515638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007648118,0.00022394514,0.0012318543,0.00006018992,0.000028034818,1.7093532e-7,0.00011862533,2.3003501e-8,0.01528479,0.9808959,0.0019056266,0.00024318982],"study_design_scores_gemma":[0.00044045984,0.00005186649,0.00081707933,0.000010333623,0.000037460624,0.0000013434179,0.000042161024,0.000005308203,0.035671867,0.95952636,0.0032975525,0.00009822034],"about_ca_topic_score_codex":0.0000043902155,"about_ca_topic_score_gemma":0.0000063935795,"teacher_disagreement_score":0.021369556,"about_ca_system_score_codex":0.0000032348705,"about_ca_system_score_gemma":0.000021522646,"threshold_uncertainty_score":0.37707576},"labels":[],"label_agreement":null},{"id":"W2398676038","doi":"","title":"Spectral Invariants and Some Stable Properties of a Graph.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral properties; Pure mathematics; Graph; Discrete mathematics; Computational chemistry; Chemistry","score_opus":0.05804052671812582,"score_gpt":0.26579291548942047,"score_spread":0.20775238877129465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398676038","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9979071,0.00023705374,0.0000064623755,0.00010930683,0.0001423201,0.00017662597,0.0000036948643,0.000039885355,0.0013775715],"genre_scores_gemma":[0.9992766,0.000011910413,0.0005037357,0.000017149749,0.0000039743536,0.000022035727,7.9576347e-7,0.0000108447375,0.00015298747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994438,0.00004239991,0.00015901671,0.000112520174,0.0001132898,0.00012896139],"domain_scores_gemma":[0.99952084,0.000043904267,0.00006871043,0.00022480312,0.000062616884,0.00007914091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029805538,0.00007869872,0.00015478369,0.00004895572,0.000048669055,0.000015208648,0.000110543704,0.000038730024,0.0000067382225],"category_scores_gemma":[0.000113328046,0.00006617137,0.00002610167,0.00013932296,0.00008297634,0.00014061951,0.0000462143,0.00006657778,0.0000068439745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016349786,0.00013888885,0.0005361071,0.000037971786,0.000019827185,6.990697e-7,0.0007202817,2.7270818e-7,0.0038757403,0.9938482,0.000783338,0.000022292663],"study_design_scores_gemma":[0.0005193984,0.00005648388,0.00018467623,0.00002726217,0.000019682951,0.0000035735288,0.00027477538,0.000016756583,0.024600113,0.9740825,0.00013609779,0.000078655314],"about_ca_topic_score_codex":0.000022234432,"about_ca_topic_score_gemma":0.0000033286055,"teacher_disagreement_score":0.020724371,"about_ca_system_score_codex":0.000008833709,"about_ca_system_score_gemma":0.000034256256,"threshold_uncertainty_score":0.26983902},"labels":[],"label_agreement":null},{"id":"W2398764523","doi":"","title":"On Schwenk-like formulas for Q-characteristic polynomials of graphs","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics; Pure mathematics","score_opus":0.05451344267431975,"score_gpt":0.3164697697947031,"score_spread":0.26195632712038336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398764523","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9965307,0.00001889332,0.00028344232,0.000097593416,0.0007073917,0.00053762377,0.00004688232,0.00006389806,0.0017135751],"genre_scores_gemma":[0.99795735,0.000002028669,0.0015784362,0.000064720756,0.0000064601127,0.00008469583,0.000014776947,0.000025454417,0.00026609117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915916,0.000040171453,0.00030453666,0.00016679757,0.00014593922,0.00018342155],"domain_scores_gemma":[0.9984181,0.0006934311,0.00019682135,0.00043402018,0.00015015852,0.00010748068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047041813,0.00012790631,0.00025969133,0.00009047211,0.00007349022,0.000013789484,0.00021580035,0.00007745485,0.000014858337],"category_scores_gemma":[0.0005068672,0.00011880213,0.00011815815,0.00016306191,0.00005935354,0.00006335507,0.000031213895,0.00007450896,0.000026656298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008553016,0.00021576497,0.000058418274,0.000041144256,0.000030423278,3.4777938e-7,0.00018472163,4.2864866e-7,0.00076553674,0.9912188,0.0071172337,0.00028164324],"study_design_scores_gemma":[0.001118903,0.00024095882,0.00012072898,0.00003148857,0.00004425036,0.0000013806396,0.00006005522,0.000039283408,0.0053309216,0.9913042,0.0015843055,0.00012348527],"about_ca_topic_score_codex":0.0000054270395,"about_ca_topic_score_gemma":0.0000011337502,"teacher_disagreement_score":0.0055329283,"about_ca_system_score_codex":0.000021851494,"about_ca_system_score_gemma":0.000040120267,"threshold_uncertainty_score":0.484461},"labels":[],"label_agreement":null},{"id":"W2398841770","doi":"","title":"A note on circumferences in k-connected graphs with given independence number.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Independence (probability theory); Independence number; Combinatorics; Statistics; Graph","score_opus":0.018288032115619066,"score_gpt":0.27367901067847084,"score_spread":0.25539097856285176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398841770","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9884829,0.000004489187,0.000021009622,0.00037467288,0.0001152729,0.00045730814,0.0000029257728,0.00009652183,0.010444892],"genre_scores_gemma":[0.9990809,0.000004061522,0.00045071318,0.00007995948,0.0000023852724,0.00025681677,0.0000032618454,0.000018133818,0.00010375542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896884,0.00008976098,0.00020524232,0.00026500397,0.0002308848,0.00024024099],"domain_scores_gemma":[0.9987997,0.0005318696,0.000099219455,0.00040087808,0.00009402153,0.00007435157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019740591,0.0001561817,0.00020007836,0.0000871961,0.00009786395,0.000043769032,0.0002902839,0.00010086783,0.00027090163],"category_scores_gemma":[0.00011692641,0.00012780611,0.000039409962,0.00052809156,0.000086884174,0.00015284088,0.00003072108,0.00027644428,0.0003198153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013583318,0.00023287325,0.0109963855,0.00001398151,0.000013419201,0.0000041064045,0.00047268448,0.0000010397118,0.0002811604,0.98708355,0.000579162,0.00030803296],"study_design_scores_gemma":[0.0006394709,0.00008619976,0.014896625,0.000076856835,0.0000101209625,0.000005460884,0.00017266908,0.000031746364,0.0011426983,0.98269254,0.0000684321,0.00017715551],"about_ca_topic_score_codex":0.00014201822,"about_ca_topic_score_gemma":0.00006520063,"teacher_disagreement_score":0.010598005,"about_ca_system_score_codex":0.000024468643,"about_ca_system_score_gemma":0.00003385336,"threshold_uncertainty_score":0.5211782},"labels":[],"label_agreement":null},{"id":"W2398858628","doi":"","title":"The Randic index and girth of triangle-free graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Girth (graph theory); Combinatorics; Index (typography); Discrete mathematics; Computer science; World Wide Web","score_opus":0.014485845876847715,"score_gpt":0.2531955796723751,"score_spread":0.2387097337955274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398858628","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9937699,0.00014640667,0.00008351111,0.0003551446,0.00021768746,0.00021967954,0.0000036977033,0.000039081544,0.0051649148],"genre_scores_gemma":[0.999638,0.000035639085,0.000095428855,0.000024045048,0.0000037659515,0.000031374624,8.424271e-7,0.000011097745,0.00015976485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993215,0.00011110246,0.00020897435,0.00011095433,0.00012200267,0.00012545809],"domain_scores_gemma":[0.99804676,0.0011748427,0.00012507652,0.0005627123,0.000044407385,0.000046221307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007527462,0.00008348146,0.00017053548,0.0000409349,0.00019866756,0.000017396525,0.00028280084,0.000049812596,0.000008269463],"category_scores_gemma":[0.0004928296,0.000057891426,0.00006308129,0.00018408426,0.00017777986,0.00003459474,0.00006560527,0.00009362015,0.0000033974472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027236314,0.000050544415,0.0013348978,0.0000165743,0.000022965363,1.0097614e-7,0.00013793612,6.345268e-8,0.00008056419,0.9950454,0.0016684344,0.0016152388],"study_design_scores_gemma":[0.0016934988,0.000045373356,0.0015513285,0.000011937151,0.000026123327,0.0000013150402,0.000067421024,0.000033861168,0.0005435902,0.99257016,0.003389068,0.000066326975],"about_ca_topic_score_codex":0.0000052487076,"about_ca_topic_score_gemma":0.0000066558905,"teacher_disagreement_score":0.005868165,"about_ca_system_score_codex":0.000003510306,"about_ca_system_score_gemma":0.000008798852,"threshold_uncertainty_score":0.23607437},"labels":[],"label_agreement":null},{"id":"W2398865451","doi":"","title":"A note on the eigenvalues of graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Combinatorics; Physics","score_opus":0.024036333562208394,"score_gpt":0.29163706322232924,"score_spread":0.26760072966012083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398865451","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98842645,0.0000051244815,0.000006995536,0.0005314678,0.0003986514,0.0001825291,0.0000048416364,0.000042121996,0.010401845],"genre_scores_gemma":[0.9993478,0.0000027350122,0.00040429874,0.00007638769,0.0000040465516,0.00003743608,8.778088e-7,0.000011601472,0.00011478303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947435,0.000044355013,0.00014608544,0.00010153306,0.00012878599,0.000104918174],"domain_scores_gemma":[0.9985166,0.0007721761,0.000087112196,0.0005435809,0.0000502204,0.000030299501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039717232,0.00007781688,0.000104349456,0.000035833702,0.00011839982,0.000009154029,0.00026951148,0.00005434127,0.00009801212],"category_scores_gemma":[0.0002594443,0.0000515209,0.000079965124,0.00018578842,0.00012670258,0.00002294906,0.00002828376,0.00020994653,0.00004186267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039862375,0.00014372113,0.00017860567,0.000006624941,0.000011369125,2.26374e-7,0.00026367384,6.316813e-8,0.007577336,0.98991656,0.0017066011,0.00019123987],"study_design_scores_gemma":[0.00013000725,0.00003145844,0.00052015204,0.000008324665,0.000015079608,9.019233e-7,0.000035994803,0.000008642273,0.03416164,0.96354425,0.0014865542,0.000056969886],"about_ca_topic_score_codex":0.0000043459213,"about_ca_topic_score_gemma":0.00000425101,"teacher_disagreement_score":0.026584303,"about_ca_system_score_codex":0.0000026165467,"about_ca_system_score_gemma":0.00001238334,"threshold_uncertainty_score":0.21009614},"labels":[],"label_agreement":null},{"id":"W2399040079","doi":"","title":"An implicit σ3 type condition for heavy cycles in weighted graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Combinatorics; Discrete mathematics","score_opus":0.02015552652005673,"score_gpt":0.31311620029136245,"score_spread":0.2929606737713057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399040079","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99774814,0.000011677385,0.00029409854,0.00012902897,0.0003116958,0.0003996162,0.000012897595,0.000105220264,0.0009876325],"genre_scores_gemma":[0.99813867,0.000003877982,0.0015236036,0.000075174015,0.000008620423,0.00013361315,0.00005794058,0.000023408591,0.000035098783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924755,0.00007744034,0.00021071002,0.00019766166,0.000077513774,0.00018914777],"domain_scores_gemma":[0.9991078,0.00030772545,0.00007743231,0.00036538547,0.00007711076,0.00006455295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036363633,0.00010996157,0.00017169477,0.00009839909,0.00011829746,0.000023244209,0.00017432951,0.000086524,0.000026081785],"category_scores_gemma":[0.00007861114,0.00010919105,0.000051632873,0.00026556113,0.000043628144,0.00010286737,0.000013158858,0.00008611298,0.000020738655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002701902,0.00024348829,0.0008680779,0.000023006793,0.00000896988,1.7803907e-7,0.00013498202,4.866749e-7,0.002686962,0.99428654,0.0013378813,0.00038239622],"study_design_scores_gemma":[0.0007295935,0.0001477357,0.0024570185,0.000017042768,0.000017642109,0.0000012917882,0.000052556243,0.0003544493,0.004830542,0.9896943,0.0015630962,0.00013472978],"about_ca_topic_score_codex":0.000009884358,"about_ca_topic_score_gemma":0.000015256269,"teacher_disagreement_score":0.0045922496,"about_ca_system_score_codex":0.000016981801,"about_ca_system_score_gemma":0.000011773965,"threshold_uncertainty_score":0.44526818},"labels":[],"label_agreement":null},{"id":"W2399054797","doi":"","title":"Isolated toughness and fractional (g, f)-factors of graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Toughness; Combinatorics; Composite material; Materials science","score_opus":0.019546276796687002,"score_gpt":0.2792752380993891,"score_spread":0.25972896130270207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399054797","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9980203,0.000036706,0.00008556869,0.0001343854,0.00014410671,0.00011010978,0.0000053833332,0.000051255174,0.0014121684],"genre_scores_gemma":[0.9996222,0.00000971072,0.00025429923,0.00002801748,0.0000018942742,0.0000044354924,0.000005011674,0.0000066657444,0.000067759334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946994,0.000028888579,0.00017579652,0.00012082032,0.00010320297,0.00010137844],"domain_scores_gemma":[0.9993793,0.00022798053,0.00009539211,0.00018866362,0.00005999201,0.000048671685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001162837,0.00008839721,0.000147,0.00005983279,0.00008698179,0.000009309851,0.00008945264,0.00006354692,0.000042053176],"category_scores_gemma":[0.00006164487,0.00008088951,0.000047191166,0.00021827876,0.000053865948,0.000082575854,0.000012739601,0.00009338933,0.000002633763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010828465,0.00018624177,0.0025381432,0.000008616111,0.000016687658,3.950591e-7,0.00017023517,1.7842918e-7,0.0013768639,0.9949842,0.0004758312,0.00023179682],"study_design_scores_gemma":[0.00027439135,0.00007059468,0.018207172,0.000011769386,0.000021760781,0.0000026554717,0.00006818173,0.000021234124,0.0022973043,0.9787233,0.00021903294,0.000082629325],"about_ca_topic_score_codex":0.0000037493523,"about_ca_topic_score_gemma":4.9210445e-7,"teacher_disagreement_score":0.016260907,"about_ca_system_score_codex":0.0000061126066,"about_ca_system_score_gemma":0.000009964202,"threshold_uncertainty_score":0.32985786},"labels":[],"label_agreement":null},{"id":"W2399073212","doi":"","title":"Small Randic Index Ordering of Trees with k Pendant Vertices","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Index (typography); Topological index; Computer science","score_opus":0.03309090112862159,"score_gpt":0.26681670660905,"score_spread":0.2337258054804284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399073212","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9968478,0.00010114551,0.00017660408,0.000033624623,0.00013804935,0.00015542521,0.0000018332166,0.000047799556,0.0024977361],"genre_scores_gemma":[0.999108,0.000005574745,0.0007438537,0.000009651478,0.0000055578253,0.0000309862,0.0000013917838,0.000016358266,0.00007863883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994079,0.000038416998,0.00016478106,0.00009006417,0.00010996948,0.00018887913],"domain_scores_gemma":[0.9992879,0.00023481832,0.00010636784,0.0002655418,0.000039420967,0.00006597168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002570016,0.00009587868,0.00016819859,0.000047669942,0.00007431959,0.000008816901,0.00014540966,0.000038632603,0.000043594893],"category_scores_gemma":[0.000050605635,0.00007488248,0.00003830712,0.00017763487,0.00006566175,0.00009611236,0.00003277477,0.000081298116,0.000010058636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003828878,0.00025600032,0.034024853,0.000045213583,0.00004019827,4.183875e-7,0.0007289744,0.0000011885813,0.000977336,0.9636527,0.000060508723,0.00017435067],"study_design_scores_gemma":[0.0010404879,0.00006689088,0.015276539,0.00005184609,0.000068056004,0.000005300506,0.0003097537,0.000025239504,0.010270047,0.9722296,0.0005220314,0.0001342213],"about_ca_topic_score_codex":0.00001286334,"about_ca_topic_score_gemma":0.000020701447,"teacher_disagreement_score":0.018748313,"about_ca_system_score_codex":0.000008767861,"about_ca_system_score_gemma":0.0000137462175,"threshold_uncertainty_score":0.3053619},"labels":[],"label_agreement":null},{"id":"W2399076206","doi":"","title":"The harmonic index on bicyclic graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Bicyclic molecule; Harmonic; Combinatorics; Discrete mathematics; Computer science; Chemistry; Physics; Stereochemistry; Acoustics; World Wide Web","score_opus":0.022356351551239044,"score_gpt":0.272689249318243,"score_spread":0.25033289776700396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399076206","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98494625,0.00004781915,0.000005300735,0.0013833323,0.00043379367,0.0004099208,0.0000012993612,0.00012097646,0.01265128],"genre_scores_gemma":[0.9981635,0.000024628094,0.00004741551,0.0001738432,0.0000052328382,0.00028241618,0.0000013411369,0.000021000516,0.0012805854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917185,0.00007434058,0.00018857846,0.000163693,0.00016193718,0.00023959052],"domain_scores_gemma":[0.99841046,0.0007621806,0.000084169274,0.0006157883,0.000055241904,0.00007217136],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025090584,0.0001219101,0.000110315465,0.00004677191,0.0004258121,0.00007835963,0.00036505458,0.00006243377,0.000122873],"category_scores_gemma":[0.00012428776,0.00008208788,0.00008697726,0.0002771435,0.00010805363,0.00006844059,0.000045190518,0.000201706,0.0009303414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003439072,0.00010357785,0.00047634044,0.000003777231,0.00002116415,2.999831e-7,0.0000646455,9.003886e-8,0.0001911326,0.97483623,0.023054847,0.0012444606],"study_design_scores_gemma":[0.0002731652,0.000036886762,0.0038659307,0.000009494171,0.000010120463,0.0000012543268,0.000051997104,0.000027928683,0.0010172277,0.9886739,0.005928797,0.000103269835],"about_ca_topic_score_codex":0.000015188535,"about_ca_topic_score_gemma":0.0000022979066,"teacher_disagreement_score":0.017126052,"about_ca_system_score_codex":0.00001669175,"about_ca_system_score_gemma":0.000012586015,"threshold_uncertainty_score":0.99984753},"labels":[],"label_agreement":null},{"id":"W2399130979","doi":"","title":"Erratum to: A note on the eigenvalues of graphs.","year":2011,"lang":"en","type":"erratum","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Pure mathematics; Physics; Quantum mechanics","score_opus":0.04054091030955258,"score_gpt":0.2947746094875079,"score_spread":0.2542336991779553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399130979","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062325507,0.0005091679,0.0000321172,0.0016515533,0.05984919,0.002951995,0.0002482387,0.0003751405,0.8720571],"genre_scores_gemma":[0.73860854,0.00032094782,0.0011915605,0.0012615822,0.00019560795,0.0011015122,0.00014455608,0.00039294522,0.25678277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822694,0.00019142352,0.0004744954,0.00039096538,0.00039379884,0.0003224025],"domain_scores_gemma":[0.9970749,0.0006382409,0.00039852952,0.0015977875,0.0001800901,0.00011043844],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064894045,0.0003765482,0.000535662,0.00019234218,0.00021654982,0.000025981906,0.001047082,0.00042281472,0.00017559777],"category_scores_gemma":[0.00047828193,0.00026942042,0.00032253473,0.00054506754,0.00017501085,0.000032041782,0.00015142815,0.00090377516,0.00019523416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008152621,0.00015372974,0.0000028306245,0.000046804576,0.00004959858,8.69546e-7,0.00044532088,2.9626282e-8,0.000021208449,0.51802194,0.48120287,0.000046639358],"study_design_scores_gemma":[0.00012237897,0.00015070016,0.000060700822,0.00025049818,0.00011036237,0.0000012192653,0.000057637477,0.0000015678492,0.0008301903,0.8899541,0.108209096,0.00025157476],"about_ca_topic_score_codex":0.000024624283,"about_ca_topic_score_gemma":0.000009882046,"teacher_disagreement_score":0.676283,"about_ca_system_score_codex":0.000028620861,"about_ca_system_score_gemma":0.000107827575,"threshold_uncertainty_score":0.9999758},"labels":[],"label_agreement":null},{"id":"W2399152850","doi":"","title":"On the diameter of integral circulant graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Circulant matrix; Combinatorics; Pure mathematics","score_opus":0.03791610771237618,"score_gpt":0.28301306312267793,"score_spread":0.24509695541030174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399152850","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99316204,0.00003071811,0.00006809422,0.00018933727,0.00036430568,0.00017014563,0.000004957481,0.0000304633,0.0059799175],"genre_scores_gemma":[0.9995336,0.0000027187234,0.00023888383,0.000100568286,0.000004051435,0.000044853954,0.0000015315422,0.000011748295,0.00006202081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994148,0.00008085228,0.00015023419,0.000073912706,0.00011984262,0.00016036327],"domain_scores_gemma":[0.9986088,0.00082976464,0.00007982423,0.0004073552,0.000030248124,0.00004400655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043397196,0.00008327696,0.000117928226,0.000038901635,0.0000721207,0.0000064277624,0.00019378099,0.00003946642,0.000099370416],"category_scores_gemma":[0.0001911272,0.00005134954,0.00009827398,0.00017167868,0.00008550449,0.000041544474,0.00002035919,0.00012263416,0.00004507854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042259944,0.00023544303,0.001427581,0.0000082994775,0.000024972025,1.02337516e-7,0.00040935332,3.717815e-8,0.0008124124,0.99390954,0.0030689833,0.00009906858],"study_design_scores_gemma":[0.00012677751,0.000026176294,0.0015530281,0.000016673252,0.000022048285,0.0000014242648,0.00010615337,0.0000026015134,0.008520059,0.98924357,0.00031909818,0.00006239123],"about_ca_topic_score_codex":0.0000037254888,"about_ca_topic_score_gemma":3.716017e-7,"teacher_disagreement_score":0.0077076466,"about_ca_system_score_codex":0.0000081423605,"about_ca_system_score_gemma":0.0000053031467,"threshold_uncertainty_score":0.20939735},"labels":[],"label_agreement":null},{"id":"W2399212034","doi":"","title":"The distance spectral radius of graphs with given independence number.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Independence number; Spectral radius; Independence (probability theory); RADIUS; Combinatorics; Statistics; Graph; Computer science; Computer security; Physics; Eigenvalues and eigenvectors; Quantum mechanics","score_opus":0.021968393292283225,"score_gpt":0.27668511697224774,"score_spread":0.2547167236799645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399212034","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9864639,0.00006965443,0.00016012207,0.00025090427,0.00021748141,0.0002317377,0.000006333664,0.000050400933,0.012549472],"genre_scores_gemma":[0.99884784,0.000010048986,0.00071874267,0.000009230275,0.0000034860109,0.000035278037,0.0000012918669,0.0000138099995,0.00036029337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991696,0.00006470942,0.00017854756,0.00013795914,0.000274132,0.00017506046],"domain_scores_gemma":[0.9988627,0.00031890106,0.00014161531,0.00046862956,0.00012609207,0.00008208685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004315721,0.00010119158,0.00014140172,0.000015063224,0.00013564648,0.000021574953,0.0003486462,0.000043097374,0.000009251964],"category_scores_gemma":[0.000102674996,0.00006684602,0.000044468037,0.00029059852,0.00023138372,0.00007434583,0.00003177948,0.00015177118,0.000017652312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004500934,0.00009692997,0.005619011,0.000009065178,0.000026534375,0.000002290028,0.00040591974,8.5227254e-7,0.000038159204,0.9917071,0.0019710334,0.00007809707],"study_design_scores_gemma":[0.0005196808,0.000061988176,0.0009199799,0.000019905103,0.000021446001,0.000010753606,0.00033119906,0.000009977842,0.0016435237,0.99482137,0.0015476396,0.00009254663],"about_ca_topic_score_codex":0.000013934038,"about_ca_topic_score_gemma":0.00002437869,"teacher_disagreement_score":0.012383926,"about_ca_system_score_codex":0.000020719483,"about_ca_system_score_gemma":0.000051995456,"threshold_uncertainty_score":0.27259016},"labels":[],"label_agreement":null},{"id":"W2399231126","doi":"","title":"The extremal generalized θ-graphs with respect to Hosoya index.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Discrete mathematics; Computer science","score_opus":0.041818750121829305,"score_gpt":0.29623188556539204,"score_spread":0.25441313544356275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399231126","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9895921,0.00006865104,0.00012698812,0.0011565476,0.00033024562,0.00043774117,0.0000031839936,0.00013384192,0.008150723],"genre_scores_gemma":[0.99703556,0.0000044039907,0.0014813747,0.00013072848,0.00001111099,0.00013408682,0.0000023185607,0.000029527142,0.0011708718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989065,0.0001219385,0.00019653808,0.00021650012,0.00028936093,0.00026914393],"domain_scores_gemma":[0.9985349,0.00032964683,0.0000815749,0.0006973378,0.00015375987,0.0002027347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064079463,0.00014917934,0.00016573952,0.000059679027,0.00028320053,0.00007655819,0.00038786864,0.000054406,0.0000113617725],"category_scores_gemma":[0.00021187878,0.00009495186,0.000055459685,0.00050660374,0.00009838947,0.000059464717,0.00007237832,0.00014254682,0.000056165016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117018135,0.000082579536,0.00089991087,0.000002975289,0.000032746106,0.0000036062968,0.0005333453,0.0000029043492,0.00010584932,0.98114127,0.016907142,0.00017066396],"study_design_scores_gemma":[0.00093274296,0.00012550353,0.00045282065,0.000013034501,0.000022674943,0.000007474095,0.00030703295,0.000017243303,0.00071717973,0.98137325,0.015878504,0.00015252504],"about_ca_topic_score_codex":0.000016805228,"about_ca_topic_score_gemma":0.000038961323,"teacher_disagreement_score":0.0074435,"about_ca_system_score_codex":0.000032062188,"about_ca_system_score_gemma":0.000060660474,"threshold_uncertainty_score":0.38720244},"labels":[],"label_agreement":null},{"id":"W2399302252","doi":"","title":"The Minimal Limit Point of the Third Largest Laplacian Eigenvalues of Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Limit (mathematics); Laplace operator; Point (geometry); Pure mathematics; Combinatorics; Mathematical analysis; Geometry; Physics; Quantum mechanics","score_opus":0.024939416277588812,"score_gpt":0.2732886954738027,"score_spread":0.24834927919621388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399302252","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9920125,0.00028746593,0.000002949406,0.00042322217,0.0005391388,0.0002636315,0.000012615504,0.000024783672,0.0064337025],"genre_scores_gemma":[0.99948543,0.000029876901,0.00019036393,0.000031366846,0.000007789014,0.00003143835,9.909944e-7,0.000014592507,0.00020813124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990012,0.00015004977,0.0003166189,0.000090249836,0.00021093352,0.00023095746],"domain_scores_gemma":[0.9981844,0.00076016266,0.00025928597,0.00065902784,0.00008653507,0.000050635386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000893488,0.00010868198,0.00017418175,0.000028074339,0.00024593956,0.000009430402,0.00045872672,0.000066410415,0.000015638234],"category_scores_gemma":[0.00027741355,0.000063173415,0.00017263474,0.0002776583,0.00026247706,0.000071192655,0.00010711541,0.00013895235,0.000010305587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011664379,0.0002653502,0.013642419,0.000024827472,0.000042861415,5.21414e-8,0.00079674344,8.206372e-8,0.0011160366,0.9816818,0.0023336315,0.00008449692],"study_design_scores_gemma":[0.00020699951,0.000031550804,0.014951357,0.000024124089,0.00005443489,0.0000018518732,0.0004123806,0.0000026482194,0.02663045,0.95568204,0.0019314867,0.00007069378],"about_ca_topic_score_codex":0.000008384204,"about_ca_topic_score_gemma":0.000006237539,"teacher_disagreement_score":0.025999812,"about_ca_system_score_codex":0.000008778345,"about_ca_system_score_gemma":0.000021055257,"threshold_uncertainty_score":0.25761372},"labels":[],"label_agreement":null},{"id":"W2399542805","doi":"","title":"The minimal positive index of inertia of signed unicyclic graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Inertia; Index (typography); Combinatorics; Discrete mathematics; Computer science; Physics; World Wide Web","score_opus":0.0122693109654104,"score_gpt":0.26219302744891565,"score_spread":0.24992371648350525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399542805","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9954529,0.000033572545,0.00010771907,0.00012511003,0.00011839283,0.000184336,0.000006295235,0.000022185202,0.0039495034],"genre_scores_gemma":[0.99967057,0.000006645329,0.00018501814,0.000018186727,0.0000026183898,0.000021640883,0.00000229192,0.000012988601,0.00008003706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914116,0.0001473037,0.00031192528,0.00011418846,0.00014777282,0.00013764758],"domain_scores_gemma":[0.99784243,0.0013155184,0.0002375489,0.00044035574,0.00012553933,0.0000386053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047540423,0.000096096934,0.00019593952,0.0000509701,0.00011235195,0.000007050342,0.0003080268,0.00006197579,0.000008392635],"category_scores_gemma":[0.00023855192,0.00007102512,0.00009775185,0.00029618666,0.00023248118,0.000036529043,0.000056198023,0.0000915707,0.000003881724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020768524,0.00015340782,0.0012643031,0.000014856523,0.000044253124,1.0637044e-7,0.00026548599,3.23588e-7,0.006603855,0.99064183,0.00033633204,0.0006544532],"study_design_scores_gemma":[0.00044271236,0.000093846465,0.0056869336,0.000022531152,0.00003487088,7.511573e-7,0.000121898,0.000087806526,0.024810227,0.9684854,0.0001408313,0.000072201205],"about_ca_topic_score_codex":0.000015141139,"about_ca_topic_score_gemma":0.0000059565264,"teacher_disagreement_score":0.022156462,"about_ca_system_score_codex":0.0000061413966,"about_ca_system_score_gemma":0.00001588034,"threshold_uncertainty_score":0.28963205},"labels":[],"label_agreement":null},{"id":"W2399973576","doi":"","title":"Extremal Tricyclic Graphs With Respect To Schultz Index.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tricyclic; Mathematics; Index (typography); Combinatorics; Computer science; Chemistry; Stereochemistry; World Wide Web","score_opus":0.0485138608039807,"score_gpt":0.30325052075040443,"score_spread":0.25473665994642375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399973576","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9852516,0.000030401692,0.0001871454,0.0004538344,0.00023265868,0.00041873255,0.0000041518815,0.0001891858,0.0132322665],"genre_scores_gemma":[0.9970123,0.0000013397632,0.0019964147,0.00011187813,0.00000917131,0.00009566179,0.0000026478995,0.0000329107,0.0007376666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885255,0.0000824772,0.00021463106,0.00027704166,0.00030167852,0.00027163085],"domain_scores_gemma":[0.9986704,0.00021544333,0.00008484581,0.0005994906,0.00014303956,0.00028677835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000457421,0.00016781274,0.00021813392,0.00017300494,0.0001208564,0.000044432163,0.0003095248,0.000073365314,0.00002467467],"category_scores_gemma":[0.00026979562,0.00013865434,0.000056184643,0.0009227142,0.00006251754,0.0001025037,0.000062914616,0.00017209804,0.00015039022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009755959,0.00020657282,0.0028212992,0.0000072440566,0.000026730764,0.000007695337,0.0005951554,0.0000020898053,0.00012898953,0.986836,0.009052559,0.00021810495],"study_design_scores_gemma":[0.0011802544,0.00020488954,0.0013906461,0.000023942945,0.000028024966,0.00001241893,0.00033654197,0.000009138584,0.0008721657,0.9917858,0.003953201,0.00020296784],"about_ca_topic_score_codex":0.000015152792,"about_ca_topic_score_gemma":0.000014832075,"teacher_disagreement_score":0.012494599,"about_ca_system_score_codex":0.00004109442,"about_ca_system_score_gemma":0.000060076065,"threshold_uncertainty_score":0.565416},"labels":[],"label_agreement":null},{"id":"W2400049355","doi":"","title":"On the spectral radius of unicyclic graphs with fixed maximum degree.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Degree (music); Combinatorics; RADIUS; Eigenvalues and eigenvectors; Physics; Computer science; Quantum mechanics; Computer network","score_opus":0.057575284925403335,"score_gpt":0.25557179738454866,"score_spread":0.19799651245914532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400049355","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9699764,0.000014035269,0.00003531921,0.00009498217,0.00012055825,0.00028926664,0.000004608763,0.00005510981,0.029409697],"genre_scores_gemma":[0.99882305,0.0000047911485,0.00089321577,0.000048650407,0.0000019609529,0.00004512563,0.0000014124145,0.000020940051,0.00016086159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925023,0.00008266818,0.00018283426,0.00015276804,0.00015082545,0.0001806485],"domain_scores_gemma":[0.9987107,0.00042566925,0.00013237116,0.00063703343,0.000044229633,0.00005003164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022166898,0.00013110637,0.00016664113,0.00005695414,0.00011568299,0.0000074891,0.00035045145,0.00005004672,0.00015994834],"category_scores_gemma":[0.000054081254,0.000081713995,0.00007924084,0.0003241592,0.00018115914,0.000037972633,0.000026539406,0.00016237923,0.000028041164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040334755,0.00030077435,0.00065283244,0.000008909518,0.000053013606,0.000002342801,0.0004969344,8.2402146e-8,0.00022259846,0.99712676,0.0009452378,0.00015018556],"study_design_scores_gemma":[0.00045031702,0.00020001171,0.0028080803,0.00002715426,0.000044227454,0.0000050709837,0.00015726518,0.000004499012,0.012347369,0.9837836,0.00006720553,0.00010521136],"about_ca_topic_score_codex":0.000016844435,"about_ca_topic_score_gemma":0.000009758717,"teacher_disagreement_score":0.029248836,"about_ca_system_score_codex":0.000010099881,"about_ca_system_score_gemma":0.000017777738,"threshold_uncertainty_score":0.33322},"labels":[],"label_agreement":null},{"id":"W2400107404","doi":"","title":"Chromaticity of Turán Graphs with Certain Matching or Star Deleted.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chromaticity; Mathematics; Star (game theory); Matching (statistics); Combinatorics; Computer science; Artificial intelligence; Statistics; Mathematical analysis","score_opus":0.01853201430150369,"score_gpt":0.27499117706498644,"score_spread":0.25645916276348274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400107404","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99780333,0.0000054339903,0.0000919219,0.00008612815,0.00017412599,0.00030699553,0.000011512125,0.00009870872,0.0014218526],"genre_scores_gemma":[0.98915756,0.0000021578232,0.010633961,0.000028371565,0.000003946983,0.000045950444,0.0000044951894,0.000027468062,0.000096102456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990848,0.00005272338,0.00028114414,0.00017856268,0.00019952821,0.00020325618],"domain_scores_gemma":[0.9985884,0.00050637533,0.00018977036,0.00053610007,0.000098435456,0.00008096534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035727888,0.00015166517,0.0002545313,0.000074327356,0.00013852662,0.00001901729,0.0002824452,0.000087635264,0.0001476433],"category_scores_gemma":[0.00012264783,0.00010911308,0.00006314752,0.0003444115,0.00013302483,0.00009293292,0.000041475665,0.00027578571,0.000011073541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003759121,0.0002567824,0.00053518405,0.00008868468,0.00004532151,0.0000032138212,0.00058554916,6.248785e-7,0.013159862,0.98491627,0.00029351123,0.000077386045],"study_design_scores_gemma":[0.00055739685,0.00010091319,0.00096882175,0.00004420564,0.000047544145,0.000011915615,0.00022112203,0.00003371044,0.012006762,0.98570174,0.0001559506,0.00014990289],"about_ca_topic_score_codex":0.000042367363,"about_ca_topic_score_gemma":0.000097673605,"teacher_disagreement_score":0.01054204,"about_ca_system_score_codex":0.000008352658,"about_ca_system_score_gemma":0.000043498912,"threshold_uncertainty_score":0.44495025},"labels":[],"label_agreement":null},{"id":"W2400134062","doi":"","title":"Double hexagonal chains with the extremal third order Randic index.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hexagonal crystal system; Index (typography); Order (exchange); Combinatorics; Pure mathematics; Crystallography; Chemistry; Computer science; Business","score_opus":0.019736589355187253,"score_gpt":0.26059800711887743,"score_spread":0.2408614177636902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400134062","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9766891,0.000021715625,0.0016663673,0.0015222805,0.00022227403,0.00036866104,0.0000019948054,0.00012468305,0.019382928],"genre_scores_gemma":[0.99761605,0.0000020389307,0.0002920121,0.00022025197,0.000022170034,0.00009735407,0.0000040250266,0.000025771153,0.0017203237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907297,0.00009113072,0.00015734372,0.00020291172,0.0002347072,0.00024091206],"domain_scores_gemma":[0.99876845,0.00043130448,0.0001018637,0.000536565,0.00009292265,0.00006891713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005881406,0.0001544912,0.00017974124,0.00004052092,0.00034415396,0.000046488833,0.000326113,0.00007138878,0.000085403284],"category_scores_gemma":[0.000044391665,0.000094496616,0.000055571832,0.00033944647,0.00015410005,0.000069490205,0.000051909446,0.00022970923,0.000063813444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008428215,0.00013902347,0.00081093004,0.000012535796,0.000035553818,7.0660786e-7,0.0005545324,0.0000041645458,0.00006867433,0.9945199,0.0036466587,0.00012302767],"study_design_scores_gemma":[0.0023508614,0.00006706688,0.000837995,0.000016320731,0.000040265775,0.000009266704,0.00017247822,0.00019436833,0.00034987216,0.9875046,0.00830158,0.00015531576],"about_ca_topic_score_codex":0.000011082974,"about_ca_topic_score_gemma":0.000025688165,"teacher_disagreement_score":0.020926956,"about_ca_system_score_codex":0.000013826908,"about_ca_system_score_gemma":0.000035075194,"threshold_uncertainty_score":0.385346},"labels":[],"label_agreement":null},{"id":"W2400149291","doi":"","title":"Vertex PI indices of some sums of graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Pi; Combinatorics; Discrete mathematics; Graph; Geometry","score_opus":0.04150821381278157,"score_gpt":0.27329420567182866,"score_spread":0.23178599185904708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400149291","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9928141,0.00007098031,0.000004597309,0.000011109887,0.00023379123,0.00013839688,0.0000090744925,0.000032366464,0.0066855424],"genre_scores_gemma":[0.99934644,0.00001612957,0.0005378639,0.000011450766,0.0000011713513,0.000017512506,0.000002117471,0.000012236324,0.000055079345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993339,0.000040096253,0.0002726955,0.00011033746,0.00012619635,0.00011675255],"domain_scores_gemma":[0.99912995,0.00017704723,0.00021292672,0.0003740397,0.00006442761,0.000041611296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023561133,0.000085465574,0.00020795148,0.00009113495,0.00003929119,0.0000023402088,0.00026109195,0.00006321206,0.000094202034],"category_scores_gemma":[0.000062554056,0.00007907089,0.0000890537,0.00022866309,0.00014114956,0.00008769202,0.000042403208,0.00007398576,0.000012515592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011873085,0.000290504,0.004018571,0.00006569409,0.00004443557,4.6328395e-7,0.0010693455,1.3291511e-8,0.0021788613,0.99178076,0.0004266026,0.00011285857],"study_design_scores_gemma":[0.00031571725,0.00007096541,0.004149761,0.000027133461,0.000038909664,7.013123e-7,0.00013759185,0.0000015950551,0.06544764,0.9296795,0.00005880659,0.000071655966],"about_ca_topic_score_codex":0.000026139525,"about_ca_topic_score_gemma":0.0000018883595,"teacher_disagreement_score":0.06326878,"about_ca_system_score_codex":0.0000040758177,"about_ca_system_score_gemma":0.000015834094,"threshold_uncertainty_score":0.32244173},"labels":[],"label_agreement":null},{"id":"W2400212675","doi":"","title":"Some Results On Q-Integral Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Cograph; Spectrum (functional analysis); Integral graph; Discrete mathematics; 1-planar graph; Laplace operator; Graph; Chordal graph; Line graph; Mathematical analysis; Voltage graph; Physics","score_opus":0.026300480505964258,"score_gpt":0.29257539447563224,"score_spread":0.26627491396966796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400212675","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9759428,0.000031931355,0.0000034921895,0.0017586605,0.00048214965,0.00022388897,0.000014271436,0.0002351677,0.021307632],"genre_scores_gemma":[0.99841726,0.000011811106,0.00039093225,0.0004270464,0.000014322699,0.000016458533,0.000009942853,0.00001256515,0.00069964584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909467,0.000052969946,0.0002367939,0.00022882406,0.00016765062,0.00021909468],"domain_scores_gemma":[0.99899197,0.00026004095,0.00008713851,0.0005352747,0.000041856587,0.00008369573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029345244,0.00014137726,0.00016321229,0.00008607223,0.00014793288,0.00002599531,0.00024646622,0.000077589946,0.000012649248],"category_scores_gemma":[0.0001891609,0.00012372927,0.000107565604,0.00024361906,0.000044106648,0.000084631734,0.00001442263,0.00019903174,0.00014123014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050017436,0.00032770875,0.000013491939,0.000002877352,0.000009903345,0.0000032379464,0.00012702112,3.2782074e-7,0.00027568135,0.9806371,0.017859925,0.00069271185],"study_design_scores_gemma":[0.00079233496,0.00020905469,0.00076729583,0.00002465209,0.00001451553,0.00000228242,0.000030870207,0.000007767847,0.0032747053,0.99246114,0.0022732175,0.00014213411],"about_ca_topic_score_codex":0.0000022454687,"about_ca_topic_score_gemma":5.765102e-7,"teacher_disagreement_score":0.02247447,"about_ca_system_score_codex":0.000019608193,"about_ca_system_score_gemma":0.000011909206,"threshold_uncertainty_score":0.5045533},"labels":[],"label_agreement":null},{"id":"W2400380025","doi":"","title":"Harmonic index of dense graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Harmonic; Acoustics; Physics; Computer science; World Wide Web","score_opus":0.04523533579060618,"score_gpt":0.2955165771363827,"score_spread":0.2502812413457765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400380025","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9947528,0.00009730886,0.000044763005,0.000090599395,0.00027769324,0.00014433157,0.0000032083187,0.00006317878,0.0045260848],"genre_scores_gemma":[0.99931896,0.000005608658,0.0004195777,0.000025442543,0.000002255728,0.000025370711,0.0000015443453,0.000014173963,0.00018708583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993282,0.000053199117,0.00021015533,0.00011745242,0.00016017145,0.00013079827],"domain_scores_gemma":[0.9991325,0.00015291687,0.00011067131,0.0003837839,0.00012413927,0.000095968055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003742582,0.000085214684,0.00016271403,0.000068151145,0.0000401072,0.000007917016,0.00019692496,0.000059425816,0.00002190161],"category_scores_gemma":[0.0001750849,0.0000811345,0.000069156304,0.0002836665,0.0000792581,0.000053805965,0.000044595363,0.00009508101,0.000035525427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012330084,0.00016815518,0.0028163353,0.000014229401,0.00002134117,0.0000012129975,0.00029572617,3.700315e-7,0.00029330293,0.99148476,0.0047357283,0.00015648085],"study_design_scores_gemma":[0.0006177941,0.00004237168,0.00082415785,0.000014696569,0.000022995671,0.0000033980364,0.00013035048,0.00001804588,0.0047128485,0.992882,0.0006460109,0.00008529809],"about_ca_topic_score_codex":0.000010006285,"about_ca_topic_score_gemma":0.0000021178835,"teacher_disagreement_score":0.0045661083,"about_ca_system_score_codex":0.000014241526,"about_ca_system_score_gemma":0.000039268773,"threshold_uncertainty_score":0.3308569},"labels":[],"label_agreement":null},{"id":"W2400448798","doi":"","title":"The Laplacian spectral radius of graphs with given connectivity.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Laplace operator; RADIUS; Mathematical analysis; Computer science; Physics; Eigenvalues and eigenvectors; Computer network; Quantum mechanics","score_opus":0.017640763127289433,"score_gpt":0.2621161787030781,"score_spread":0.24447541557578864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400448798","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99105436,0.00010086996,0.000026746897,0.00022839059,0.00025394472,0.00023403633,0.000004691258,0.00004730313,0.00804966],"genre_scores_gemma":[0.9994226,0.000008555534,0.0003353062,0.000013290643,0.0000074730574,0.00003812983,0.0000012552983,0.00001583103,0.00015756415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928516,0.00008655704,0.00014752353,0.00009412515,0.00013684579,0.00024978668],"domain_scores_gemma":[0.99866,0.00072008115,0.000119774224,0.00038260175,0.000045753924,0.000071767776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004582973,0.000101919446,0.00014940172,0.00003202808,0.00021735414,0.000013678058,0.00019664649,0.000040656843,0.000017906017],"category_scores_gemma":[0.000078035664,0.000066715125,0.00006298001,0.00024169097,0.0001782235,0.00009352327,0.000024635492,0.00012186763,0.000012492761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027194976,0.00020329354,0.008780681,0.000011341104,0.000052015042,3.8621482e-7,0.0004755825,1.10921356e-7,0.00030096105,0.9890823,0.00089823414,0.00016793277],"study_design_scores_gemma":[0.00040206453,0.00007195528,0.0061475853,0.000011933366,0.00003955371,0.000007863836,0.00023599391,0.0000030989806,0.006361799,0.9846361,0.0019881856,0.0000938185],"about_ca_topic_score_codex":0.000007814313,"about_ca_topic_score_gemma":0.000011551954,"teacher_disagreement_score":0.008368238,"about_ca_system_score_codex":0.000013286481,"about_ca_system_score_gemma":0.000015796777,"threshold_uncertainty_score":0.27205637},"labels":[],"label_agreement":null},{"id":"W2400630495","doi":"","title":"Ordering graphs with maximum degree 3 by their indices.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Statistics; Discrete mathematics; Physics","score_opus":0.02415026922201394,"score_gpt":0.2552164991330755,"score_spread":0.23106622991106154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400630495","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9887537,0.000092482325,0.00016680341,0.00033000836,0.00010574181,0.00024728075,0.00001031211,0.00019753957,0.010096153],"genre_scores_gemma":[0.99864787,0.000012947996,0.000986572,0.00015086742,0.0000031264158,0.000031996005,0.000009991536,0.000021062608,0.00013555851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918866,0.00003481929,0.00017101337,0.00021512508,0.00014350704,0.00024688916],"domain_scores_gemma":[0.9992055,0.00013325039,0.00010202128,0.00042720104,0.000046727022,0.00008524226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001851859,0.00016976696,0.00018099867,0.000063496525,0.00018989688,0.000038134967,0.0002787242,0.00007141207,0.000037386675],"category_scores_gemma":[0.00002529476,0.00013303792,0.0000525546,0.00038740368,0.000062095954,0.00010632009,0.000022627328,0.00017409153,0.00001727383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001266845,0.00021272397,0.00047247487,0.000009191322,0.000025888407,0.0000021698409,0.00029695217,2.5185943e-7,0.0007223906,0.9919695,0.0036301033,0.002645648],"study_design_scores_gemma":[0.00056086056,0.00012080852,0.0007331485,0.000025355701,0.000022204049,0.00000772546,0.00012988882,0.0000057008133,0.0041976147,0.9914708,0.0025416599,0.00018424865],"about_ca_topic_score_codex":0.0000047574713,"about_ca_topic_score_gemma":0.000003793592,"teacher_disagreement_score":0.009960595,"about_ca_system_score_codex":0.000014704707,"about_ca_system_score_gemma":0.000016259164,"threshold_uncertainty_score":0.5425129},"labels":[],"label_agreement":null},{"id":"W2400831820","doi":"","title":"New Classes of Integral Trees of Diameter 4.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.0210714781534549,"score_gpt":0.2901142003455186,"score_spread":0.2690427221920637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400831820","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99578893,0.000009509232,0.00013634675,0.00007286966,0.00036291758,0.00009750689,0.0000053983504,0.00002586037,0.0035006653],"genre_scores_gemma":[0.9904192,0.0000021231654,0.0092233885,0.000007270631,0.0000054507213,0.0000074452346,0.0000015551717,0.000010603971,0.00032295924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994912,0.000022107455,0.00021698797,0.00008884977,0.00009362917,0.00008719753],"domain_scores_gemma":[0.99902207,0.00038710193,0.00012810585,0.0003552404,0.000061675484,0.000045810004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014423521,0.000073856,0.0001772036,0.000051221406,0.000021225484,0.000004712477,0.000202912,0.0000636081,0.00015278395],"category_scores_gemma":[0.00020020636,0.000062378254,0.000085851214,0.00015354587,0.00008242296,0.000047430884,0.00003157294,0.00013341784,0.0000071752534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062280533,0.0001278451,0.0032798045,0.000017306415,0.00001914929,1.300468e-7,0.00020083961,3.385077e-8,0.03394319,0.95962113,0.001839652,0.0009447031],"study_design_scores_gemma":[0.00025096707,0.000041759897,0.002585903,0.000013378992,0.000023965653,6.777917e-7,0.00005556263,0.000003426769,0.09232624,0.90404207,0.00060189946,0.00005417635],"about_ca_topic_score_codex":0.000026126818,"about_ca_topic_score_gemma":0.000033956927,"teacher_disagreement_score":0.058383048,"about_ca_system_score_codex":0.0000025240142,"about_ca_system_score_gemma":0.000028572416,"threshold_uncertainty_score":0.25437114},"labels":[],"label_agreement":null},{"id":"W2400834481","doi":"","title":"Wiener index of a type of composite graph.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Composite number; Type (biology); Index (typography); Graph; Statistics; Combinatorics; Algorithm; Computer science; Geology; Programming language","score_opus":0.033276809688583646,"score_gpt":0.3019251897283568,"score_spread":0.26864838003977315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400834481","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99553907,0.0000969639,0.000039989936,0.000017786246,0.0002738898,0.00010619121,0.000004235847,0.00002174564,0.003900144],"genre_scores_gemma":[0.99926037,0.000005274837,0.00063072133,0.000011439564,0.000003666657,0.0000075653716,0.0000024549502,0.000010656159,0.000067837216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945617,0.000040764782,0.00020294817,0.000063213985,0.00011097672,0.00012595368],"domain_scores_gemma":[0.99926335,0.0001644747,0.00013666028,0.00029566686,0.000091324415,0.00004850915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023212691,0.00006883284,0.00016622375,0.00006114218,0.00003100359,0.0000020052366,0.00013636121,0.000050063143,0.000038815157],"category_scores_gemma":[0.00004331213,0.000062887106,0.000058698428,0.0003196592,0.00008161082,0.00006521313,0.00003612873,0.00006302643,0.000009374229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013409427,0.00035559072,0.029483931,0.000037942347,0.00003073614,6.7615616e-8,0.00033850496,4.7280238e-7,0.0073968163,0.96178615,0.0004988758,0.000057525936],"study_design_scores_gemma":[0.00026057102,0.000031415315,0.008348885,0.000019449777,0.000030932526,0.0000012145908,0.000043536456,0.000006401496,0.018115506,0.972753,0.00032623383,0.00006287214],"about_ca_topic_score_codex":0.0000072953294,"about_ca_topic_score_gemma":3.9038684e-7,"teacher_disagreement_score":0.021135045,"about_ca_system_score_codex":0.000004788418,"about_ca_system_score_gemma":0.000009010814,"threshold_uncertainty_score":0.25644618},"labels":[],"label_agreement":null},{"id":"W2401099273","doi":"","title":"The sum numbers and the integral sum numbers of the graph K n \\E(C n-1 ).","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.02287627913084229,"score_gpt":0.25440049601957365,"score_spread":0.23152421688873137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401099273","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9729276,0.00011537899,0.000011661664,0.0008410453,0.0007438019,0.0004890617,0.000006627703,0.00004085429,0.024823986],"genre_scores_gemma":[0.99907696,0.000052048443,0.00011630837,0.00007886711,0.0000050463705,0.00007200774,6.595367e-7,0.00001828633,0.0005798022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998922,0.00024585918,0.00028122382,0.00015341764,0.00018291004,0.00021459434],"domain_scores_gemma":[0.99788076,0.0010118928,0.00020031551,0.00078529754,0.00007525244,0.00004647857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093411875,0.00014474675,0.0001858559,0.000019903027,0.0005217035,0.000029437299,0.00065751176,0.00006765953,0.000025017587],"category_scores_gemma":[0.00023511793,0.00006623662,0.00017289563,0.00030218545,0.0011425907,0.000057795616,0.00014443383,0.00026175738,0.000009031115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044165143,0.00007131917,0.0029643972,0.000010624512,0.000064756685,2.0681459e-7,0.0026072215,3.1208764e-8,0.000032973407,0.9909161,0.0031688977,0.000119323995],"study_design_scores_gemma":[0.0007502048,0.00001561537,0.0018930513,0.000020140596,0.00007593332,0.000005326965,0.0016598109,0.000006341882,0.0013241321,0.9927457,0.0014168984,0.00008682031],"about_ca_topic_score_codex":0.00021816755,"about_ca_topic_score_gemma":0.00012892473,"teacher_disagreement_score":0.026149392,"about_ca_system_score_codex":0.000010175432,"about_ca_system_score_gemma":0.000023601902,"threshold_uncertainty_score":0.4209923},"labels":[],"label_agreement":null},{"id":"W2401120393","doi":"","title":"Enumeration of Highly Irregular Trees by Automorphism Group.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enumeration; Mathematics; Combinatorics; Automorphism; Automorphism group; Group (periodic table); Physics","score_opus":0.010890429732252231,"score_gpt":0.252166731711059,"score_spread":0.24127630197880678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401120393","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9973972,0.000029439268,0.00012554468,0.0002495919,0.00050528464,0.0001937572,0.000018193765,0.000099004086,0.0013820218],"genre_scores_gemma":[0.9980576,0.000003581527,0.001482387,0.000025324232,0.000008094373,0.000045704342,0.000028703396,0.000018348404,0.00033022367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992778,0.00004350359,0.00024055761,0.00015505879,0.00015374154,0.000129363],"domain_scores_gemma":[0.9991166,0.00019827126,0.00013842506,0.00042692086,0.000064841515,0.000054943554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028731604,0.000107143016,0.00016527365,0.00004540377,0.000113071306,0.00001596748,0.0002022926,0.00010346577,0.00009144022],"category_scores_gemma":[0.00008366398,0.000104392886,0.000065918626,0.00016779952,0.00010739419,0.0000954738,0.000027348799,0.00016350103,0.000024893578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029389098,0.00021603025,0.00017387126,0.000009850264,0.000014255905,3.0020286e-7,0.000107999,7.405851e-8,0.19535546,0.7963982,0.0074176886,0.00030331712],"study_design_scores_gemma":[0.0003681663,0.00003839933,0.00048050788,0.0000067779374,0.00002659286,0.0000018425461,0.000017690923,0.000046957135,0.07327261,0.9192232,0.006416673,0.0001006207],"about_ca_topic_score_codex":0.000012825045,"about_ca_topic_score_gemma":0.0000107367405,"teacher_disagreement_score":0.12282495,"about_ca_system_score_codex":0.0000071546997,"about_ca_system_score_gemma":0.0000121116955,"threshold_uncertainty_score":0.42570183},"labels":[],"label_agreement":null},{"id":"W2401120511","doi":"","title":"On the least signless Laplacian eigenvalue of non-bipartite unicyclic graphs with both given order and diameter","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Order (exchange); Eigenvalues and eigenvectors; Laplacian matrix; Discrete mathematics; Graph; Physics; Quantum mechanics","score_opus":0.015044048639272542,"score_gpt":0.2484579200891741,"score_spread":0.23341387144990156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401120511","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99471444,0.000011798646,0.00040866292,0.0002816768,0.00006659478,0.0003146336,0.000006220182,0.000028462007,0.004167486],"genre_scores_gemma":[0.99912924,0.000005634005,0.0005129475,0.00012345596,0.0000034515551,0.00006256658,0.0000021139215,0.000025131067,0.00013546963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917054,0.0001380506,0.00017531193,0.00019047994,0.00015420103,0.00017139308],"domain_scores_gemma":[0.99835795,0.00087253505,0.00012988769,0.0005215578,0.000057959172,0.000060136834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041263908,0.00014433493,0.00020618021,0.000055881133,0.00015887393,0.000022535416,0.00020970462,0.00005555602,0.000028140783],"category_scores_gemma":[0.0000891226,0.00009251309,0.000044062817,0.00029219312,0.00022040051,0.000046597514,0.000038909104,0.00013988992,0.000012695778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020226462,0.0001453112,0.0016148103,0.000023162487,0.000040452807,3.4184743e-7,0.00041718237,0.0000029774997,0.0005232877,0.99645,0.00049356255,0.00026864908],"study_design_scores_gemma":[0.0005365914,0.00018394679,0.0022165081,0.000058980608,0.000048219827,0.0000016756297,0.00012245911,0.00023376114,0.0022549885,0.9938224,0.00039202717,0.00012841739],"about_ca_topic_score_codex":0.000010203499,"about_ca_topic_score_gemma":0.000014260471,"teacher_disagreement_score":0.0044147642,"about_ca_system_score_codex":0.0000060479906,"about_ca_system_score_gemma":0.000012907762,"threshold_uncertainty_score":0.37725744},"labels":[],"label_agreement":null},{"id":"W2401132194","doi":"","title":"The Extremal Matching Energy of Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Matching (statistics); Combinatorics; Statistics","score_opus":0.01598578697707676,"score_gpt":0.25710696701035235,"score_spread":0.2411211800332756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401132194","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9843687,0.000059452825,0.00095681596,0.00021945864,0.0003800549,0.00007216511,0.0000015083132,0.00006110474,0.013880757],"genre_scores_gemma":[0.99912155,0.000011579322,0.0005159559,0.00003060618,0.000004525988,0.000024177338,0.0000010378958,0.000012851818,0.0002777058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993499,0.00009511165,0.0001967176,0.000100894846,0.00012212315,0.00013523368],"domain_scores_gemma":[0.9985004,0.00088595337,0.000114967756,0.00041813817,0.000045651086,0.000034861292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046656988,0.0000775245,0.00011778953,0.00002750682,0.00021789149,0.000016270818,0.0002632888,0.000038722665,0.0000113905835],"category_scores_gemma":[0.00009892548,0.00005534064,0.000076809556,0.00015148963,0.00009016619,0.000034825418,0.00004444952,0.00006871921,0.0000058320575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044368644,0.00005460551,0.00009993286,0.000008206301,0.0000151143895,1.0592983e-7,0.00011754975,3.3965776e-7,0.00072134676,0.9961354,0.00087677257,0.0019661963],"study_design_scores_gemma":[0.0001766424,0.000020566342,0.00017777091,0.000011372044,0.000014515707,0.000001396684,0.00005349835,0.000038152037,0.0028022514,0.992259,0.004381731,0.000063081476],"about_ca_topic_score_codex":0.000014007387,"about_ca_topic_score_gemma":0.000007775262,"teacher_disagreement_score":0.014752877,"about_ca_system_score_codex":0.0000047034196,"about_ca_system_score_gemma":0.000007453723,"threshold_uncertainty_score":0.22567257},"labels":[],"label_agreement":null},{"id":"W2401182739","doi":"","title":"Sharp upper bounds for the largest Laplacian eigenvalue of mixed graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Laplace operator; Combinatorics; Mathematical analysis; Physics","score_opus":0.026181749821378244,"score_gpt":0.2799468822940065,"score_spread":0.2537651324726283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401182739","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9956385,0.00013325842,0.00012203032,0.00073496404,0.0005700847,0.00096195424,0.000033644075,0.00006237866,0.0017431906],"genre_scores_gemma":[0.9977676,0.00001425647,0.00095234823,0.000076346325,0.0000080278105,0.0005587442,0.000010237182,0.00002688315,0.000585502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915224,0.00005049081,0.00026677398,0.00016411235,0.00013865903,0.00022772924],"domain_scores_gemma":[0.998159,0.0009361847,0.00013335019,0.0005604232,0.00015424815,0.000056781508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042038603,0.00012933616,0.0001900676,0.00004992622,0.0002688894,0.000038246173,0.0003827416,0.00008113348,0.0001735095],"category_scores_gemma":[0.00017948599,0.00009342614,0.0001682945,0.00023162666,0.00012906936,0.00009180664,0.000048283848,0.00010546854,0.000058877715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005775924,0.0001684921,0.001713215,0.000035413435,0.000053063726,7.5087456e-8,0.00018935878,2.743577e-7,0.00070494524,0.97958785,0.017285787,0.00025576827],"study_design_scores_gemma":[0.00047811502,0.00004541936,0.0050736694,0.000014459365,0.000059245605,0.0000012221782,0.00016030861,0.00006781764,0.0039209365,0.98407054,0.0059957346,0.000112514346],"about_ca_topic_score_codex":0.00002848314,"about_ca_topic_score_gemma":0.000007435735,"teacher_disagreement_score":0.011290051,"about_ca_system_score_codex":0.000010349616,"about_ca_system_score_gemma":0.00002185988,"threshold_uncertainty_score":0.38098073},"labels":[],"label_agreement":null},{"id":"W2401274613","doi":"","title":"Note on the nullity of bicyclic graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.027926279225377024,"score_gpt":0.2971773291335698,"score_spread":0.26925104990819276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401274613","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9810464,0.000014185222,0.000013307944,0.001647745,0.00013926883,0.00021307156,0.0000046775513,0.000052410724,0.01686894],"genre_scores_gemma":[0.9994303,0.000006313568,0.00017319812,0.00025197788,0.0000028700802,0.000014333717,0.0000012656917,0.0000068037434,0.00011295498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934816,0.00007636497,0.00018697855,0.000121282894,0.00014218819,0.00012499833],"domain_scores_gemma":[0.99867254,0.0005819764,0.00010365149,0.00056610175,0.000041823874,0.00003392755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037350695,0.00009012477,0.0001338552,0.00003917457,0.000117952215,0.00000899438,0.00026489003,0.00004923907,0.000054540305],"category_scores_gemma":[0.00017793078,0.00006169556,0.00009609831,0.00029168077,0.000074426986,0.000027371741,0.000014973728,0.00013390325,0.000044485867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012023329,0.00026914268,0.00008089843,0.00000487321,0.000008040352,3.040503e-7,0.0001605225,1.5594811e-7,0.0011583085,0.9950767,0.0026949216,0.00053410773],"study_design_scores_gemma":[0.00018092971,0.000074175405,0.0031549532,0.00001547118,0.000015644922,6.163967e-7,0.000017912984,0.000007146839,0.011245734,0.9843762,0.0008454942,0.00006570257],"about_ca_topic_score_codex":0.0000027097215,"about_ca_topic_score_gemma":5.746385e-7,"teacher_disagreement_score":0.018383889,"about_ca_system_score_codex":0.000008560013,"about_ca_system_score_gemma":0.000009449889,"threshold_uncertainty_score":0.25158718},"labels":[],"label_agreement":null},{"id":"W2401418612","doi":"","title":"The Spectral Radius of Maximum Weighted Unicyclic Graph.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Graph; Combinatorics; Eigenvalues and eigenvectors; Physics; Quantum mechanics","score_opus":0.01432290461623151,"score_gpt":0.2584619999347652,"score_spread":0.2441390953185337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401418612","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9850447,0.0000679515,0.00012531121,0.0004472328,0.0004360619,0.00020649812,0.0000030344936,0.00007796714,0.013591236],"genre_scores_gemma":[0.99906415,0.000026295116,0.0005634652,0.000025772515,0.000009089795,0.000026836728,0.0000024421524,0.000017968803,0.0002639638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990952,0.0001331263,0.00026599583,0.00014232124,0.00015163684,0.00021171237],"domain_scores_gemma":[0.9982422,0.00085203635,0.00014673454,0.0006458033,0.000054591226,0.00005864267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053944066,0.000112591,0.00017185898,0.00004609166,0.00023589049,0.00001928463,0.00039685096,0.000058333433,0.000023767425],"category_scores_gemma":[0.0001304044,0.0000808401,0.00011236064,0.0003198,0.00017992304,0.00003880315,0.00004125695,0.0001390043,0.000026771606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010294433,0.00010310867,0.00027637932,0.000010999317,0.000030977906,2.6324565e-7,0.000099276935,1.3408105e-7,0.0006387705,0.9963641,0.0017972214,0.0006684335],"study_design_scores_gemma":[0.00043914476,0.000051544168,0.00073019107,0.00001078564,0.000031050222,0.000002702518,0.00004374352,0.0000469932,0.006398789,0.9853681,0.0067827078,0.00009427766],"about_ca_topic_score_codex":0.0000064740757,"about_ca_topic_score_gemma":0.0000052477735,"teacher_disagreement_score":0.0140194595,"about_ca_system_score_codex":0.000010663759,"about_ca_system_score_gemma":0.000012938958,"threshold_uncertainty_score":0.3296564},"labels":[],"label_agreement":null},{"id":"W2401547246","doi":"","title":"On the spectra of tricyclic graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tricyclic; Mathematics; Spectral line; Combinatorics; Stereochemistry; Chemistry; Physics; Astronomy","score_opus":0.05034851632161588,"score_gpt":0.2708962132307848,"score_spread":0.2205476969091689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401547246","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.941535,0.000012890448,0.000013739876,0.000105572064,0.0001606878,0.00018788298,0.0000026377477,0.000040665844,0.057940915],"genre_scores_gemma":[0.99948394,0.000005790353,0.00026555493,0.000053853542,0.000001560898,0.00003405985,5.031004e-7,0.000011268975,0.00014348912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945134,0.00006112565,0.00016530514,0.000102308506,0.00010761474,0.00011228019],"domain_scores_gemma":[0.9988388,0.0005348414,0.0000979004,0.00046940826,0.000029630683,0.00002945792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028615847,0.000079228266,0.00011512549,0.000050274524,0.00008259081,0.000004181495,0.00026606576,0.000037259146,0.0002366708],"category_scores_gemma":[0.00013521174,0.000052909138,0.0000870145,0.00028838834,0.00008814329,0.000023326418,0.000020787547,0.00010759313,0.000051281426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010727384,0.0002787652,0.00017762532,0.000006366606,0.00002136136,5.240046e-7,0.000493486,1.38839304e-8,0.00028799803,0.9964223,0.002231177,0.00006964828],"study_design_scores_gemma":[0.00018691662,0.000066818146,0.001323991,0.000010038868,0.000020595728,9.560146e-7,0.000079704885,0.0000016323913,0.017040558,0.98108953,0.00012034816,0.000058881607],"about_ca_topic_score_codex":0.0000064634996,"about_ca_topic_score_gemma":8.4809e-7,"teacher_disagreement_score":0.057948913,"about_ca_system_score_codex":0.0000053533067,"about_ca_system_score_gemma":0.00000765031,"threshold_uncertainty_score":0.25913793},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80020547,0.000007860512,0.0024306546,0.0001728594,0.0005970661,0.00022363549,0.000029433406,0.00029920042,0.19603379],"genre_scores_gemma":[0.96972835,0.0000026167809,0.0060402383,0.000032239932,0.00018976955,0.000003734155,0.000025704037,0.000016548323,0.023960812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987489,0.00006054791,0.00023843086,0.0003755061,0.0003052446,0.0002713947],"domain_scores_gemma":[0.9987508,0.00020192713,0.00014821501,0.0005318039,0.00016733866,0.00019991108],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00018895992,0.00021138553,0.00019442024,0.00025794609,0.0013352333,0.000059032314,0.00046086,0.00018965839,0.00012692192],"category_scores_gemma":[0.0001035571,0.00022968683,0.00017918741,0.0004966099,0.00066132616,0.0004175056,0.0001042473,0.00046119024,0.000085987405],"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.000034134606,0.00018317757,0.0030273115,0.000017527049,0.000047314414,0.00020149475,0.000050690458,0.000022229397,0.0218285,0.9734669,0.00094633875,0.00017438657],"study_design_scores_gemma":[0.002074656,0.00010384261,0.029635957,0.00012366439,0.0003140072,0.0008204801,0.0005918141,0.00044683594,0.021625305,0.30933544,0.6337499,0.0011780952],"about_ca_topic_score_codex":0.000046672343,"about_ca_topic_score_gemma":0.00015766721,"teacher_disagreement_score":0.66413146,"about_ca_system_score_codex":0.00011644885,"about_ca_system_score_gemma":0.00029394665,"threshold_uncertainty_score":0.9999649},"labels":[],"label_agreement":null},{"id":"W2401673825","doi":"","title":"The m-competition indices of symmetric primitive digraphs with loop.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Competition (biology); Loop (graph theory); Combinatorics; Biology; Ecology","score_opus":0.012258816917804234,"score_gpt":0.24319798529310113,"score_spread":0.2309391683752969,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401673825","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9939282,0.000096007825,0.000018054092,0.00018978142,0.000055585846,0.00033496745,0.0000020731402,0.000030768482,0.0053445953],"genre_scores_gemma":[0.99929917,0.00004064628,0.00043081594,0.000015941834,0.0000013659569,0.00011039796,0.0000015789573,0.000009109747,0.000090963615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946934,0.000049271282,0.00014245047,0.00010345179,0.00012376749,0.00011170497],"domain_scores_gemma":[0.9986885,0.00081303547,0.00013877531,0.00022025526,0.00010314785,0.000036247606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017956826,0.0000770502,0.000106251304,0.00006917774,0.00017251182,0.000029339115,0.00013468521,0.00003285709,0.000013768197],"category_scores_gemma":[0.000077477576,0.00004770351,0.000027345433,0.00040763666,0.0001878976,0.00009156252,0.000028333674,0.000084111285,0.000012065354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044488866,0.00007604063,0.0022400124,0.000017411632,0.000030146393,1.3330694e-7,0.00017691542,5.5987197e-8,0.00018736557,0.9965909,0.00012226001,0.0005543272],"study_design_scores_gemma":[0.00024466903,0.00007629051,0.018914709,0.000025405261,0.000026179945,0.000002205258,0.00040270254,0.000011055841,0.0016762518,0.9784241,0.00013360874,0.000062821855],"about_ca_topic_score_codex":0.000021542079,"about_ca_topic_score_gemma":0.000004244305,"teacher_disagreement_score":0.018166782,"about_ca_system_score_codex":0.000005943738,"about_ca_system_score_gemma":0.000010552151,"threshold_uncertainty_score":0.19452927},"labels":[],"label_agreement":null},{"id":"W2401709832","doi":"","title":"The characterization of graphs with the largest Laplacian eigenvalue at most 5+sqrt(13)/2.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Characterization (materials science); Eigenvalues and eigenvectors; Combinatorics; Laplace operator; Mathematical analysis; Physics; Nanotechnology; Materials science","score_opus":0.009557073857486125,"score_gpt":0.23715632355056915,"score_spread":0.227599249693083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401709832","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99641544,0.000010171159,0.000017536633,0.00096927944,0.00038301598,0.00038138955,0.000021946678,0.00004890718,0.0017523039],"genre_scores_gemma":[0.99900717,0.000014988883,0.000060372902,0.000060893184,0.000008608494,0.00009113661,0.000021232421,0.0000242295,0.0007113442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991868,0.0000814211,0.00019760757,0.00014929584,0.00019816613,0.00018668322],"domain_scores_gemma":[0.9984721,0.00044077274,0.00021982862,0.0006940856,0.00012593437,0.00004728228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005246574,0.00012750394,0.00013235323,0.000029121904,0.00066774624,0.00003565623,0.00038780188,0.00007339065,0.0000360493],"category_scores_gemma":[0.00008058434,0.000069625785,0.000053656164,0.00036127114,0.00026986486,0.00006894236,0.000062436484,0.00022810843,0.000021831005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021883858,0.00008994666,0.002627928,0.000009484801,0.000029026138,3.9003888e-7,0.00034748495,1.1396897e-7,0.049395207,0.94680506,0.00052290026,0.00015056109],"study_design_scores_gemma":[0.00035689786,0.000046341185,0.011826412,0.000010964173,0.00004748289,0.0000066726093,0.00008953942,0.000018487335,0.022750432,0.95289963,0.011830596,0.000116540854],"about_ca_topic_score_codex":0.000007654746,"about_ca_topic_score_gemma":0.00014344932,"teacher_disagreement_score":0.026644776,"about_ca_system_score_codex":0.0000087915905,"about_ca_system_score_gemma":0.000026766475,"threshold_uncertainty_score":0.5135832},"labels":[],"label_agreement":null},{"id":"W2401911466","doi":"","title":"On the matching polynomial of theta graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Matching (statistics); Polynomial; Discrete mathematics; Statistics; Mathematical analysis","score_opus":0.029502958017314864,"score_gpt":0.2819413303422619,"score_spread":0.25243837232494704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401911466","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9860589,0.000030460724,0.000010149657,0.00030108268,0.00040786227,0.00016560167,0.0000043823534,0.000035508325,0.012986057],"genre_scores_gemma":[0.99962395,0.000002519412,0.00010783057,0.00007646441,0.000007576094,0.000026778127,9.749349e-7,0.000013828809,0.00014007208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993917,0.000085520354,0.00015790999,0.00007366853,0.00012332424,0.00016789518],"domain_scores_gemma":[0.9985501,0.0008757818,0.00010038037,0.00041082318,0.000020868074,0.000042018495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005433366,0.00008530169,0.00011589489,0.0000349014,0.00013373449,0.0000086384225,0.00022953506,0.00004093562,0.00008443963],"category_scores_gemma":[0.000091879025,0.00005597338,0.0000873964,0.000148348,0.00006841786,0.000055386212,0.00003919543,0.00012626356,0.000043645003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006505129,0.00020289782,0.00033990282,0.0000073765023,0.000021837424,6.16292e-8,0.0008319363,1.7805316e-7,0.0008922502,0.9936822,0.0039568753,0.000057984562],"study_design_scores_gemma":[0.00015462276,0.00001605346,0.0007225545,0.000013559655,0.00002071824,0.00000119681,0.00018579289,0.0000015611153,0.0056274915,0.99279094,0.0004023589,0.0000631605],"about_ca_topic_score_codex":0.0000063104494,"about_ca_topic_score_gemma":3.702551e-7,"teacher_disagreement_score":0.013565061,"about_ca_system_score_codex":0.0000073671977,"about_ca_system_score_gemma":0.00000682559,"threshold_uncertainty_score":0.22825283},"labels":[],"label_agreement":null},{"id":"W2402033281","doi":"","title":"On the Wiener index of unicyclic graphs with given girth.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Girth (graph theory); Wiener index; Index (typography); Combinatorics; Discrete mathematics; Graph; Computer science; World Wide Web","score_opus":0.014489646453789804,"score_gpt":0.2546082013446283,"score_spread":0.2401185548908385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402033281","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98998356,0.0000035752482,0.000018188206,0.00044908954,0.00017625833,0.00022872914,0.0000044445205,0.00004033495,0.009095821],"genre_scores_gemma":[0.9994764,0.0000016710123,0.00017688655,0.00007744545,0.0000029384655,0.000052978357,0.0000014480192,0.000018035893,0.00019224275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936205,0.00005239187,0.00014749664,0.00013625364,0.00016792066,0.00013386825],"domain_scores_gemma":[0.99843395,0.0006681623,0.00011990808,0.00066905963,0.00006611234,0.000042811986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028596824,0.000106683045,0.00013289685,0.000053293807,0.00012437135,0.00001164164,0.00032345168,0.000065456356,0.00008958275],"category_scores_gemma":[0.00009763266,0.00006413273,0.000055999953,0.00031676513,0.00020336645,0.000039572828,0.00003289894,0.0002814776,0.000017368839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013865271,0.00019254684,0.0011783995,0.0000064089804,0.000029221132,5.558183e-7,0.00017122341,6.296415e-7,0.001420577,0.9957832,0.0010593494,0.00014401856],"study_design_scores_gemma":[0.0003569586,0.00007384316,0.0016547961,0.000016852278,0.000020651045,0.0000022135737,0.00006878408,0.000020070993,0.0051086545,0.9918233,0.0007678516,0.00008599011],"about_ca_topic_score_codex":0.000009132754,"about_ca_topic_score_gemma":0.000020617801,"teacher_disagreement_score":0.009492794,"about_ca_system_score_codex":0.0000038169046,"about_ca_system_score_gemma":0.000018764827,"threshold_uncertainty_score":0.26152566},"labels":[],"label_agreement":null},{"id":"W2402045463","doi":"","title":"On α - Incidence Energy and α - Distance Energy of a Graph.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Energy (signal processing); Incidence (geometry); Graph; Combinatorics; Statistics; Geometry","score_opus":0.022492839148709625,"score_gpt":0.2670354058054746,"score_spread":0.24454256665676496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402045463","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99082,0.00021011771,0.0014701437,0.00008327013,0.00020592431,0.000050740433,0.0000075322487,0.00004991511,0.007102359],"genre_scores_gemma":[0.999275,0.000023419894,0.00031657846,0.000063010746,0.0000026502978,0.000028988323,0.0000022733973,0.0000110592555,0.00027697082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993776,0.00005193088,0.00016365905,0.00014834583,0.00015038275,0.00010805506],"domain_scores_gemma":[0.99912035,0.0002998482,0.000100956306,0.0003180175,0.000070748916,0.000090070476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018061095,0.0000910435,0.00015041274,0.000051370935,0.00004748503,0.000008933641,0.00014360077,0.000045937777,0.0000056356903],"category_scores_gemma":[0.00013759929,0.00008404989,0.000032174503,0.000211852,0.0001089718,0.000055912304,0.00004128769,0.000039623486,0.0000012809179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021029287,0.00012481326,0.00019130654,0.000009079517,0.000010795937,0.0000014009221,0.00013973482,6.4973875e-7,0.0001670175,0.996142,0.0029251846,0.0002669629],"study_design_scores_gemma":[0.0003515489,0.00008960959,0.00006618706,0.000028961502,0.0000117714035,0.0000025179102,0.000046160087,0.000027637641,0.0036180264,0.99355745,0.0021122368,0.00008786125],"about_ca_topic_score_codex":0.000043504268,"about_ca_topic_score_gemma":0.000021872973,"teacher_disagreement_score":0.008455051,"about_ca_system_score_codex":0.000010283424,"about_ca_system_score_gemma":0.000019901352,"threshold_uncertainty_score":0.3427455},"labels":[],"label_agreement":null},{"id":"W2402096899","doi":"","title":"Bounds of eigenvalues of a nontrivial bipartite graph.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Eigenvalues and eigenvectors; Combinatorics; Complete bipartite graph; Graph; Discrete mathematics","score_opus":0.020848365783589142,"score_gpt":0.2834701295530812,"score_spread":0.2626217637694921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402096899","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99486893,0.000034837863,0.00023944341,0.000042234857,0.00023823627,0.00014140493,0.000008322874,0.00003636286,0.004390221],"genre_scores_gemma":[0.9988815,0.000006812633,0.0009718786,0.000011855077,0.0000065357426,0.000020675654,0.0000026722687,0.00001326301,0.000084780295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917597,0.000085918924,0.00031813962,0.00012175638,0.00016128617,0.00013690941],"domain_scores_gemma":[0.9988303,0.00038431332,0.00020849785,0.00042590522,0.00010492501,0.00004602005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050242216,0.00009169726,0.00025174723,0.00008527458,0.00005950924,0.000006301455,0.0002078813,0.000059879643,0.000033073713],"category_scores_gemma":[0.00022170773,0.00008574429,0.000118125856,0.00028762993,0.00015010548,0.00004683134,0.0000384192,0.00006684365,0.000010647557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013443615,0.00023849861,0.0019343538,0.000053562642,0.000032143656,1.07109244e-7,0.0002783788,6.7410735e-7,0.0051392596,0.9914362,0.0006735993,0.00019978035],"study_design_scores_gemma":[0.00046928355,0.00009735115,0.0010514684,0.000027413333,0.000043842632,7.1673287e-7,0.000026879972,0.000036196656,0.035327226,0.9619938,0.0008467326,0.00007910425],"about_ca_topic_score_codex":0.0000126477435,"about_ca_topic_score_gemma":0.000003853712,"teacher_disagreement_score":0.030187964,"about_ca_system_score_codex":0.000005343881,"about_ca_system_score_gemma":0.000016016993,"threshold_uncertainty_score":0.34965503},"labels":[],"label_agreement":null},{"id":"W2402245199","doi":"","title":"Super connectivity of Kronecker products of some graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Kronecker product; Kronecker delta; Combinatorics","score_opus":0.04984769336719136,"score_gpt":0.2914925227622639,"score_spread":0.24164482939507254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402245199","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99751323,0.00008125817,0.000006397856,0.00015918724,0.00031865746,0.00024743343,0.0000110279525,0.000028299793,0.0016345175],"genre_scores_gemma":[0.9991053,0.0000036960666,0.0007383481,0.000009977398,0.0000042512993,0.000021787717,0.0000031704542,0.000014063719,0.000099451536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991894,0.00008187619,0.00025293042,0.00016116803,0.00018557262,0.00012906059],"domain_scores_gemma":[0.998774,0.00024070298,0.00014487044,0.0005027652,0.0002739021,0.00006375093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058076467,0.00009722561,0.00025530232,0.000067613764,0.000029484108,0.0000037145503,0.00017339227,0.00005842362,0.000016347456],"category_scores_gemma":[0.00063280493,0.00008948833,0.00006147182,0.00030537543,0.00014721727,0.00011930271,0.00004961596,0.00008419104,0.000012577934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017300825,0.00049422286,0.0022293457,0.000061426,0.000033379292,3.8222308e-7,0.0006281681,4.2226551e-7,0.00550634,0.9888844,0.0020851123,0.000059528942],"study_design_scores_gemma":[0.00053799147,0.00007542225,0.0009000832,0.000016697377,0.000031258274,0.0000015474055,0.00015478082,0.0000040960563,0.08898764,0.9088759,0.00033093384,0.000083663785],"about_ca_topic_score_codex":0.000012963115,"about_ca_topic_score_gemma":0.0000013086343,"teacher_disagreement_score":0.083481304,"about_ca_system_score_codex":0.000011593943,"about_ca_system_score_gemma":0.000055715744,"threshold_uncertainty_score":0.3649228},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9070917,0.000009532656,0.001345687,0.00016794109,0.00008659531,0.00035540527,0.000012710038,0.0000745405,0.09085592],"genre_scores_gemma":[0.99307156,0.0000046064088,0.001515853,0.000035231275,0.0000326752,0.0000067287515,0.000006599425,0.000011329113,0.005315406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896103,0.000107115484,0.00018857923,0.00025512805,0.00029317866,0.00019497292],"domain_scores_gemma":[0.9986908,0.00044401814,0.00017307913,0.00046220887,0.00013687841,0.00009304391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009217272,0.00017086601,0.00017498955,0.00018985708,0.00077408034,0.000034474728,0.00040350022,0.000073112904,0.00011258628],"category_scores_gemma":[0.00004496951,0.00012784345,0.00012611995,0.00054614636,0.000827399,0.00022189236,0.00004709895,0.00022494943,0.00003631857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040625015,0.00016697464,0.0016329933,0.000015705933,0.000088688605,0.000044596567,0.000058086476,0.00011886439,0.00267864,0.99448705,0.0006047854,0.00006298634],"study_design_scores_gemma":[0.002630776,0.00057542406,0.08304527,0.00055837835,0.00043411762,0.00048909674,0.0016263577,0.00061846315,0.02519373,0.870866,0.0128547475,0.0011076401],"about_ca_topic_score_codex":0.0000901992,"about_ca_topic_score_gemma":0.000025303225,"teacher_disagreement_score":0.12362105,"about_ca_system_score_codex":0.00009677478,"about_ca_system_score_gemma":0.0001336504,"threshold_uncertainty_score":0.59536785},"labels":[],"label_agreement":null},{"id":"W2402992720","doi":"","title":"The Sharp Lower Bound of the Least Eigenvalue of a Bicyclic Graph.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Bicyclic molecule; Graph; Combinatorics; Upper and lower bounds; Mathematical analysis; Medicinal chemistry; Chemistry; Physics","score_opus":0.016761976517218325,"score_gpt":0.2709001636376991,"score_spread":0.25413818712048075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402992720","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9944475,0.000043371605,0.000004461888,0.0002943534,0.0010341062,0.00028252302,0.000012067741,0.000020444853,0.0038611642],"genre_scores_gemma":[0.9994661,0.000007911179,0.00010875813,0.000020940905,0.0000072636226,0.000036243277,6.6404965e-7,0.00001594924,0.00033616295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991586,0.000070993185,0.00028987468,0.00012263352,0.000200369,0.00015750948],"domain_scores_gemma":[0.9981328,0.0005556095,0.00023245515,0.0009377133,0.00010461759,0.000036802314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052021956,0.000102223974,0.00015248319,0.000030377618,0.0002818835,0.000017459237,0.0006248548,0.00007370605,0.000044855748],"category_scores_gemma":[0.00026634234,0.00005947459,0.0001731252,0.00036441293,0.00044861084,0.000038462123,0.00009729051,0.00024625522,0.000010652067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009208393,0.00020648443,0.0010649276,0.000016377011,0.000029568999,1.2712911e-7,0.00020831337,1.4029943e-7,0.019109946,0.97811973,0.0010574828,0.00017768994],"study_design_scores_gemma":[0.0002368174,0.000023707216,0.0049736756,0.000016295575,0.000035964516,0.0000030054496,0.00007849884,0.0000059257827,0.017056067,0.9750076,0.002497336,0.000065111926],"about_ca_topic_score_codex":0.000015480937,"about_ca_topic_score_gemma":0.000035873552,"teacher_disagreement_score":0.0050186,"about_ca_system_score_codex":0.000004384817,"about_ca_system_score_gemma":0.00003607423,"threshold_uncertainty_score":0.24253035},"labels":[],"label_agreement":null},{"id":"W2403011525","doi":"","title":"A note on the Kirchhoff index of bicyclic graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Resistance distance; Combinatorics; Generalization; Graph; Index (typography); Topological index; Discrete mathematics; Mathematical analysis; Graph power; Line graph; Computer science","score_opus":0.021453317542698594,"score_gpt":0.2789878806951229,"score_spread":0.25753456315242435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403011525","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9807018,0.0000062868776,0.0000990588,0.0007673031,0.00022422247,0.00022133447,0.0000032706357,0.000055282937,0.017921418],"genre_scores_gemma":[0.999467,0.0000026436032,0.00011313791,0.0001837786,0.000004831721,0.000048778173,0.0000011877364,0.000016391243,0.00016223996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921167,0.00013091128,0.00020217622,0.00013858228,0.00017150158,0.00014517536],"domain_scores_gemma":[0.9978424,0.0013020941,0.00012859117,0.0006378819,0.000047532456,0.00004154114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005532738,0.00010461205,0.00015702024,0.00006519437,0.00012515098,0.000011237951,0.00032227868,0.00006245115,0.00005513207],"category_scores_gemma":[0.00036464565,0.00007213514,0.000097476426,0.00031387588,0.000119674434,0.000026799062,0.0000406412,0.00016120859,0.00006819306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008713196,0.00015693321,0.0005108883,0.000013088608,0.000015134868,1.279634e-7,0.00019669716,5.01438e-7,0.00068047544,0.9956172,0.0023409645,0.00045925853],"study_design_scores_gemma":[0.0002856777,0.000060936167,0.0014349887,0.00002449048,0.000017076709,7.195516e-7,0.000021645488,0.00008009604,0.0046922388,0.9904962,0.002804996,0.00008092718],"about_ca_topic_score_codex":0.0000073864076,"about_ca_topic_score_gemma":0.0000020575962,"teacher_disagreement_score":0.018765189,"about_ca_system_score_codex":0.000007605666,"about_ca_system_score_gemma":0.000010239579,"threshold_uncertainty_score":0.29415858},"labels":[],"label_agreement":null},{"id":"W2403014172","doi":"","title":"The Modified Zagreb Indices About Disjunction And Symmetric Difference Of Graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Statistics","score_opus":0.017133518864651084,"score_gpt":0.2640155511588824,"score_spread":0.24688203229423134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403014172","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9968649,0.000100953526,0.000028511373,0.00008304522,0.00053488696,0.00018406103,0.000004052571,0.00003660092,0.0021630032],"genre_scores_gemma":[0.999682,0.000068273206,0.000083552586,0.000008409052,0.0000038248168,0.000018271614,0.0000016402471,0.000008899202,0.0001251231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993661,0.00004256582,0.00019324939,0.00013389495,0.0001369553,0.0001272268],"domain_scores_gemma":[0.9985541,0.0008284119,0.00015926085,0.0003484498,0.000061039376,0.0000487146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034920283,0.00009224106,0.00012655038,0.000083086976,0.0002671865,0.00003335024,0.00020480796,0.00007143965,0.0000053910276],"category_scores_gemma":[0.0002506218,0.00006239063,0.000043989075,0.00044337858,0.00021182383,0.000049153427,0.00004696887,0.00020149272,0.0000026117693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000079755455,0.00008286403,0.002493822,0.00001823522,0.00001775107,1.044684e-7,0.00019333034,5.2991076e-8,0.0022111963,0.9923987,0.000066962144,0.0025090028],"study_design_scores_gemma":[0.00024804345,0.000029695917,0.0422623,0.000008623103,0.000028760067,0.0000017662064,0.000084327,0.00006793917,0.001693853,0.95540965,0.00009603427,0.00006903498],"about_ca_topic_score_codex":0.000013511607,"about_ca_topic_score_gemma":0.000015536843,"teacher_disagreement_score":0.03976848,"about_ca_system_score_codex":0.0000031654113,"about_ca_system_score_gemma":0.000010094166,"threshold_uncertainty_score":0.25442162},"labels":[],"label_agreement":null},{"id":"W2403023109","doi":"","title":"Tricyclic Graphs With Minimum Modified Schultz Index And Maximum Zagreb Indices.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Tricyclic; Statistics; Combinatorics; Chemistry; Computer science; Stereochemistry; World Wide Web","score_opus":0.0348977643886674,"score_gpt":0.27573520183857586,"score_spread":0.24083743744990846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403023109","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9925422,0.00010972822,0.0000920074,0.00020845963,0.00019546293,0.0003896318,0.0000064825167,0.00014172695,0.0063142637],"genre_scores_gemma":[0.99894834,0.000010798174,0.00059315213,0.00007234761,0.0000063302414,0.000040209867,0.000006678612,0.000032357933,0.00028979126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988254,0.00007536023,0.00024592582,0.0003030597,0.0002759321,0.00027437363],"domain_scores_gemma":[0.9987883,0.0002300848,0.00016474848,0.0004613514,0.00010703118,0.0002484604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003850867,0.00020553883,0.00026670942,0.00016991269,0.0001489499,0.000059470127,0.00024506226,0.00012770036,0.000009424526],"category_scores_gemma":[0.00011556443,0.0001698701,0.000043975535,0.0005700613,0.00017583428,0.00015966801,0.00007105191,0.00022050829,0.000023086784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075517855,0.0002231629,0.0041946853,0.000024192783,0.00005059678,0.000006439299,0.0009556661,0.0000011120774,0.000058990223,0.99235094,0.0016029224,0.00045577955],"study_design_scores_gemma":[0.002512986,0.00013896565,0.0016037293,0.000023973009,0.00005682097,0.000019577266,0.00054167886,0.00007725492,0.000302291,0.9939178,0.0005712031,0.00023370891],"about_ca_topic_score_codex":0.00001827196,"about_ca_topic_score_gemma":0.000007694493,"teacher_disagreement_score":0.0064060977,"about_ca_system_score_codex":0.000022668808,"about_ca_system_score_gemma":0.000053962678,"threshold_uncertainty_score":0.6927101},"labels":[],"label_agreement":null},{"id":"W2403094376","doi":"","title":"On the Balaban Index of Trees.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Tree (set theory); Combinatorics; Computer science; World Wide Web","score_opus":0.04439641874231101,"score_gpt":0.2655193361685936,"score_spread":0.22112291742628257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403094376","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9502831,0.0000059059003,0.000019548395,0.00009167417,0.00014246296,0.00014656915,0.0000028975142,0.000032517466,0.049275305],"genre_scores_gemma":[0.9995696,0.0000013660174,0.00008706754,0.000052726013,0.0000016488722,0.000029500523,5.3114053e-7,0.000010098905,0.00024743786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953485,0.000050056467,0.00013754562,0.00008654479,0.00009846232,0.000092526454],"domain_scores_gemma":[0.999033,0.00038844446,0.00008206351,0.0004347059,0.00003557751,0.00002620905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002434014,0.000068602574,0.00009590256,0.000028161725,0.00006934529,0.000003750276,0.00023873156,0.000039170638,0.00026947042],"category_scores_gemma":[0.00011986715,0.00004588824,0.00005481651,0.00015461862,0.000082031846,0.000022984159,0.00002784494,0.00009375047,0.00004338192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009451469,0.0002180742,0.00085022673,0.000004505239,0.000016949189,3.359921e-7,0.000568098,4.310476e-8,0.00013443238,0.99523526,0.0028699134,0.00009269808],"study_design_scores_gemma":[0.00017689656,0.000046693323,0.0037866342,0.000011934205,0.000012315033,5.3260686e-7,0.00010636287,0.000007933323,0.0064506037,0.98915684,0.00019191994,0.000051319745],"about_ca_topic_score_codex":0.0000082287315,"about_ca_topic_score_gemma":0.000003803869,"teacher_disagreement_score":0.049286503,"about_ca_system_score_codex":0.0000057254733,"about_ca_system_score_gemma":0.000009399355,"threshold_uncertainty_score":0.29505122},"labels":[],"label_agreement":null},{"id":"W2403172418","doi":"","title":"On Sum-Balaban Index","year":2012,"lang":"fr","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Connectivity; Graph; Cyclomatic complexity; Discrete mathematics; Computer science","score_opus":0.022360903716578572,"score_gpt":0.2815170547368369,"score_spread":0.25915615102025835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403172418","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9489908,0.001508279,0.00005777022,0.0015106194,0.006566084,0.00037654897,0.000029335615,0.00011586455,0.04084468],"genre_scores_gemma":[0.98701,0.00004508828,0.00019344487,0.0002800493,0.000064167274,0.000046990972,0.000010029947,0.0000531172,0.012297125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984064,0.0001873029,0.0003125326,0.00022109677,0.0002474074,0.0006252442],"domain_scores_gemma":[0.99800324,0.00075850426,0.00014829055,0.00072960247,0.000068890906,0.00029145574],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00063328573,0.00025802685,0.0002642409,0.00008300282,0.00024854002,0.0000434303,0.00029760707,0.00025444053,0.0010682642],"category_scores_gemma":[0.00022060904,0.00027657396,0.00014770906,0.00038065726,0.00017796518,0.00022028777,0.000078597666,0.0004128277,0.0031332467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000151281265,0.0016515818,0.0035176706,0.00007737342,0.00006503336,0.000001962069,0.0010169077,0.0000012457649,0.00006742358,0.9601006,0.03215568,0.0013294008],"study_design_scores_gemma":[0.0006127353,0.000080442456,0.002402894,0.00010114663,0.000081186576,0.000009209003,0.00017190893,0.000033341923,0.0011283715,0.94962806,0.04547101,0.0002796838],"about_ca_topic_score_codex":0.000019979614,"about_ca_topic_score_gemma":0.0000020843406,"teacher_disagreement_score":0.03801917,"about_ca_system_score_codex":0.00008880022,"about_ca_system_score_gemma":0.000033924567,"threshold_uncertainty_score":0.99996865},"labels":[],"label_agreement":null},{"id":"W2403255421","doi":"","title":"Some new results on the sum of squares of eccentricity in graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eccentricity (behavior); Explained sum of squares; Combinatorics; Statistics; Political science; Law","score_opus":0.028747296946464208,"score_gpt":0.2705013273307387,"score_spread":0.24175403038427445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403255421","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.996924,0.00003808921,0.0000019151269,0.00089508924,0.00012332141,0.0003758928,0.000009684721,0.000016737442,0.0016152716],"genre_scores_gemma":[0.99971414,0.000017014658,0.00008499601,0.000038493377,0.0000032948763,0.000024179893,0.0000019108713,0.00000801868,0.00010797206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917704,0.00008873142,0.00033931754,0.000116520256,0.00014937024,0.00012899992],"domain_scores_gemma":[0.9982714,0.0009866576,0.00018580483,0.00046042138,0.000058576763,0.000037136775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034001246,0.00008320832,0.00017327857,0.000084053085,0.000035663666,0.000006846982,0.0002694205,0.00005102353,0.000035131125],"category_scores_gemma":[0.0003862318,0.000058483838,0.00006853535,0.00036103264,0.00007607122,0.00006151272,0.000036378984,0.000114418595,0.000018643412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019565527,0.00028515368,0.0008448247,0.000017920906,0.000011433618,1.7351752e-7,0.0003681665,0.00000251395,0.00052557024,0.9900268,0.007791048,0.00010682962],"study_design_scores_gemma":[0.00058726774,0.000056724137,0.005547093,0.00004153037,0.000008111199,1.5813897e-7,0.000117417745,0.000020247804,0.018702505,0.97477037,0.000093462775,0.000055090848],"about_ca_topic_score_codex":0.00021576493,"about_ca_topic_score_gemma":0.000007917496,"teacher_disagreement_score":0.018176936,"about_ca_system_score_codex":0.00000968342,"about_ca_system_score_gemma":0.000021186244,"threshold_uncertainty_score":0.23849018},"labels":[],"label_agreement":null},{"id":"W2403306657","doi":"","title":"Perfect state transfer between non-antipodal vertices in integral circulant graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Antipodal point; Circulant matrix; Mathematics; Combinatorics; Transfer (computing); Discrete mathematics; Geometry; Computer science","score_opus":0.047146575354170626,"score_gpt":0.3005098139403286,"score_spread":0.253363238586158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403306657","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9975636,0.0000390002,0.00012576305,0.00013272518,0.0003000691,0.00032714175,0.000017865452,0.0000835563,0.0014103034],"genre_scores_gemma":[0.9996662,0.000007644907,0.00014715573,0.000027038765,0.0000068581044,0.00005768269,0.000013983536,0.000028381779,0.000045013316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872506,0.00013177673,0.0003386846,0.0002567804,0.00022812004,0.00031957676],"domain_scores_gemma":[0.9990914,0.0002714299,0.00003998522,0.00036411753,0.00007049651,0.0001626055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007187148,0.00018641561,0.00031845237,0.00014751534,0.00007025257,0.00003707966,0.000303467,0.00008491781,0.000013690557],"category_scores_gemma":[0.00009043427,0.00016762652,0.00010756369,0.0004417222,0.000092842696,0.0001520572,0.000034091336,0.0002805715,0.00005346806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028855631,0.00021718226,0.0648484,0.00003205562,0.000046332163,0.000008965067,0.0024384847,0.0000018933059,0.00041717294,0.9311507,0.0003843416,0.00042564297],"study_design_scores_gemma":[0.0013171742,0.00010059866,0.014508279,0.000041637548,0.00004845131,0.0000030315437,0.00027657585,0.00005471917,0.0033267364,0.97988236,0.0002301521,0.00021028206],"about_ca_topic_score_codex":0.00008524159,"about_ca_topic_score_gemma":0.000035469217,"teacher_disagreement_score":0.050340123,"about_ca_system_score_codex":0.00004335505,"about_ca_system_score_gemma":0.00005691088,"threshold_uncertainty_score":0.6835611},"labels":[],"label_agreement":null},{"id":"W2403442490","doi":"","title":"On the signless Laplacian spectral radius of digraphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Combinatorics; Physics; Eigenvalues and eigenvectors; Quantum mechanics","score_opus":0.019904453225804947,"score_gpt":0.25328674069135465,"score_spread":0.2333822874655497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403442490","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9809178,0.000013893948,0.000014067093,0.00070715515,0.00018109247,0.0003805437,0.00000407347,0.000047906364,0.017733475],"genre_scores_gemma":[0.99940395,0.000003223771,0.00012137898,0.00009210191,0.0000044320464,0.000090606176,0.0000015005247,0.000014422025,0.00026836293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930876,0.0000754012,0.00018547574,0.00012380554,0.00014302428,0.00016354569],"domain_scores_gemma":[0.99853843,0.0007965024,0.000099608864,0.00047087306,0.000047884776,0.00004670496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021270842,0.00010489892,0.00014603755,0.000043890625,0.00011600363,0.000021503494,0.00029932254,0.00004819838,0.00031703548],"category_scores_gemma":[0.00010287257,0.00007110082,0.00009373979,0.00023298948,0.000116109375,0.000049984355,0.000024133378,0.00013712466,0.00012676493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043248065,0.00018090759,0.00021317942,0.000009750175,0.000024362762,3.6681726e-7,0.00024551185,3.5239006e-7,0.0010875838,0.989289,0.008835556,0.00010914095],"study_design_scores_gemma":[0.00021835565,0.000054662556,0.0012801538,0.000016856184,0.000014830107,0.0000010843899,0.00013360365,0.000016197511,0.009904773,0.98805517,0.00022184348,0.000082453014],"about_ca_topic_score_codex":0.000015893114,"about_ca_topic_score_gemma":0.0000020945872,"teacher_disagreement_score":0.01848618,"about_ca_system_score_codex":0.000009500632,"about_ca_system_score_gemma":0.0000105892,"threshold_uncertainty_score":0.3471316},"labels":[],"label_agreement":null},{"id":"W2403450736","doi":"","title":"An Inequality on Laplacian Eigenvalues of Connected Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Inequality; Laplace operator; Laplacian matrix; Pure mathematics; Combinatorics; Mathematical analysis","score_opus":0.04934705980718329,"score_gpt":0.3339834472392321,"score_spread":0.28463638743204883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403450736","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9958789,0.000026176904,0.00001760693,0.00003851202,0.00031201093,0.00019489009,0.000018869137,0.00010674876,0.003406337],"genre_scores_gemma":[0.99948066,0.0000033160734,0.00036785385,0.00005381433,0.000007718148,0.000029782519,0.000014468386,0.000017703163,0.000024670948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990294,0.00020309695,0.00025862598,0.000132157,0.00016157946,0.00021514892],"domain_scores_gemma":[0.9987127,0.00038445764,0.00014336548,0.0005654884,0.00007456483,0.000119417695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006671722,0.000118705575,0.00020505185,0.000072620554,0.00009889714,0.000008279119,0.00020255236,0.000080011705,0.000076945245],"category_scores_gemma":[0.00017826307,0.00010958505,0.000071606955,0.00026980255,0.00007969795,0.00012655099,0.000020144098,0.00011043149,0.00002981947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019539688,0.00092280627,0.01072426,0.000025872456,0.000025188618,1.7294248e-7,0.0007460248,2.0590645e-7,0.0026527266,0.9843618,0.00038199578,0.00013936151],"study_design_scores_gemma":[0.00033275055,0.0001097585,0.011186579,0.000015400032,0.000027280097,7.515526e-7,0.00017795117,0.000006170948,0.027359398,0.9604489,0.00021387667,0.00012115711],"about_ca_topic_score_codex":0.000010779397,"about_ca_topic_score_gemma":0.00000221553,"teacher_disagreement_score":0.024706671,"about_ca_system_score_codex":0.000012312534,"about_ca_system_score_gemma":0.00001119519,"threshold_uncertainty_score":0.44687486},"labels":[],"label_agreement":null},{"id":"W2403512408","doi":"","title":"The extremal fully loaded graphs with respect to Merrifield-Simmons index.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Discrete mathematics; Computer science","score_opus":0.041253746329207336,"score_gpt":0.2898768608766027,"score_spread":0.24862311454739536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403512408","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9795764,0.00006539166,0.0002665808,0.0019849783,0.00041644793,0.00052302255,0.000004061314,0.00015566533,0.017007431],"genre_scores_gemma":[0.99814457,0.0000023726514,0.00053614785,0.00012981653,0.0000102748245,0.0001237657,0.0000016772505,0.000028129862,0.0010232405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877876,0.00011683391,0.0002295558,0.00024795337,0.00031591163,0.0003109886],"domain_scores_gemma":[0.99821067,0.0005237751,0.000093123155,0.0007795341,0.0001628188,0.00023010191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062963896,0.00016985367,0.00018048217,0.00007221934,0.00033360368,0.00007992078,0.00045971217,0.00007778507,0.00001530849],"category_scores_gemma":[0.00029785532,0.00011226009,0.00006475706,0.00057101814,0.000113546404,0.000074898766,0.00008123795,0.0002277364,0.000081079816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000122018864,0.00010629685,0.00056096,0.000003942575,0.000040356736,0.0000055915043,0.0007716249,0.000002431162,0.00019213039,0.97982013,0.018174537,0.00020000056],"study_design_scores_gemma":[0.00067167595,0.00018209357,0.0004295852,0.000018338918,0.000031310497,0.0000103687225,0.0009256092,0.000009101791,0.001861225,0.9862866,0.009401492,0.00017264452],"about_ca_topic_score_codex":0.000022698583,"about_ca_topic_score_gemma":0.000070999005,"teacher_disagreement_score":0.018568154,"about_ca_system_score_codex":0.000029269431,"about_ca_system_score_gemma":0.000080431506,"threshold_uncertainty_score":0.45778337},"labels":[],"label_agreement":null},{"id":"W2403887512","doi":"","title":"The Harmonic Index on Unicyclic Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Harmonic; Combinatorics; Statistics; Computer science; Acoustics; Physics; World Wide Web","score_opus":0.0319056874760969,"score_gpt":0.29515694169507284,"score_spread":0.26325125421897594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403887512","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98596466,0.0001718512,0.000011461794,0.00046457484,0.0007765111,0.0002225121,0.0000019639938,0.00010698737,0.01227948],"genre_scores_gemma":[0.99907565,0.00003556707,0.0000478859,0.00012217459,0.000011001447,0.00008584813,0.0000015526009,0.000021218799,0.0005991085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913824,0.00009853285,0.00016820822,0.000113535374,0.0001612009,0.00032027683],"domain_scores_gemma":[0.99838674,0.0008054457,0.00008304594,0.00059791567,0.000029213426,0.00009762513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005550175,0.00011690907,0.000105093786,0.0000401887,0.0004321639,0.00003078784,0.00031740384,0.00006359928,0.000027514649],"category_scores_gemma":[0.00011417009,0.00008139486,0.00008530293,0.00027125276,0.00009651739,0.00007606471,0.000048774786,0.00021000653,0.00020200515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059378413,0.00018467222,0.0017771374,0.000003146311,0.000023924951,1.8846465e-7,0.00013437694,6.3380924e-8,0.00006537778,0.99120426,0.0053722523,0.001228655],"study_design_scores_gemma":[0.000261075,0.00002357252,0.004012501,0.000008060835,0.000017603075,0.0000019342826,0.00007814869,0.000008703224,0.0011448474,0.97782326,0.016518852,0.000101418176],"about_ca_topic_score_codex":0.000002834753,"about_ca_topic_score_gemma":0.0000015286656,"teacher_disagreement_score":0.013380984,"about_ca_system_score_codex":0.000021966835,"about_ca_system_score_gemma":0.000011104093,"threshold_uncertainty_score":0.33238992},"labels":[],"label_agreement":null},{"id":"W2403935035","doi":"","title":"On the second maximal and minimal Wiener index of unicyclic graphs with given girth.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Girth (graph theory); Wiener index; Index (typography); Combinatorics; Discrete mathematics; Graph; Computer science","score_opus":0.018829465834408907,"score_gpt":0.25018057202563876,"score_spread":0.23135110619122984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403935035","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9935993,0.00004661152,0.000008748994,0.00016866582,0.000078777775,0.00020915903,0.000011875572,0.000021698537,0.0058551696],"genre_scores_gemma":[0.9994041,0.000002646501,0.00016735659,0.00007119175,0.0000040385744,0.00004043353,0.0000013944884,0.00001684128,0.00029199955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999343,0.00007244996,0.00014714818,0.000117386226,0.00013135569,0.0001886646],"domain_scores_gemma":[0.9988818,0.0005542062,0.000110356224,0.00035188269,0.000034732173,0.000067025656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003078707,0.00011638864,0.00014911912,0.0000505653,0.00011145007,0.000010891056,0.000155832,0.00005516062,0.00015130057],"category_scores_gemma":[0.000036523616,0.000073893694,0.000038603186,0.00019543906,0.00019827823,0.00008529596,0.00004290398,0.00013787819,0.0000063352554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031126867,0.00020795548,0.0076140915,0.000018540197,0.00004101432,3.4048432e-7,0.0004649125,7.981188e-8,0.00032862704,0.9903453,0.0008356261,0.000112363115],"study_design_scores_gemma":[0.00046837147,0.000113354195,0.012539386,0.000019951183,0.00002719196,0.0000060000216,0.00020992676,0.000008124717,0.0029362007,0.98259926,0.00097282045,0.00009939813],"about_ca_topic_score_codex":0.0000032725975,"about_ca_topic_score_gemma":0.0000059750137,"teacher_disagreement_score":0.007746048,"about_ca_system_score_codex":0.0000062013723,"about_ca_system_score_gemma":0.000009922302,"threshold_uncertainty_score":0.30132973},"labels":[],"label_agreement":null},{"id":"W2404017857","doi":"","title":"The Modified Zagreb Indices About Join And Composition Of Graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Join (topology); Mathematics; Composition (language); Combinatorics; Linguistics","score_opus":0.015590429664716224,"score_gpt":0.27046048959017605,"score_spread":0.2548700599254598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404017857","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.997199,0.00005962796,0.000014005233,0.0001750361,0.00029489945,0.00018233816,0.0000058768633,0.000033438686,0.0020357757],"genre_scores_gemma":[0.99962544,0.000026463027,0.00026674775,0.000016222977,0.0000033619851,0.000012588883,0.0000031131485,0.000008568178,0.000037479796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994585,0.000043735497,0.00018270183,0.00010303839,0.00010581122,0.0001062072],"domain_scores_gemma":[0.99900097,0.0004766124,0.0001373717,0.0002908458,0.00005369036,0.000040496318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035494752,0.00007638085,0.0001118862,0.0000378521,0.00026108374,0.000028443004,0.00016231048,0.00006265922,0.0000072881603],"category_scores_gemma":[0.000049069324,0.000055709064,0.00004041839,0.00014827515,0.00021431908,0.00005308603,0.00003612953,0.00016894091,0.000003250986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008831621,0.00007713927,0.00041855767,0.00001566277,0.00001729266,1.8147037e-7,0.000350506,8.263577e-8,0.015960032,0.9824625,0.00022787353,0.00046128512],"study_design_scores_gemma":[0.00029745285,0.000022685655,0.00497604,0.000011139402,0.000022702938,0.0000031296868,0.00007421554,0.000040628925,0.011218178,0.98309916,0.00017183402,0.00006285487],"about_ca_topic_score_codex":0.0000074678815,"about_ca_topic_score_gemma":0.000009897156,"teacher_disagreement_score":0.004741854,"about_ca_system_score_codex":0.0000022773233,"about_ca_system_score_gemma":0.000008479025,"threshold_uncertainty_score":0.22717497},"labels":[],"label_agreement":null},{"id":"W2404057724","doi":"","title":"On Vertex Matching Polynomial of Graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Matching (statistics); Graph; Statistics","score_opus":0.023183009138926524,"score_gpt":0.2858983258116701,"score_spread":0.26271531667274356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404057724","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98999214,0.000028770988,0.000016030832,0.000049823466,0.00067057175,0.00012022579,0.0000049280484,0.000049628605,0.0090678865],"genre_scores_gemma":[0.9994458,0.0000022532818,0.00037181465,0.000044518394,0.0000054981188,0.000016991045,0.0000022136924,0.000015913149,0.00009502981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938405,0.000046444544,0.00017558577,0.00008707652,0.00012154302,0.00018530464],"domain_scores_gemma":[0.99910176,0.0004075602,0.00009035841,0.0003086589,0.000022319251,0.00006934174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028648495,0.000090175534,0.00014588851,0.00006130633,0.00007980366,0.000005978063,0.0001506084,0.000053854095,0.00006648293],"category_scores_gemma":[0.00007271602,0.00008390692,0.00008028845,0.00015028061,0.000043614084,0.00007734776,0.000030096178,0.00010554845,0.000056066026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013519121,0.0003239109,0.000646296,0.000016555801,0.000019853409,1.4629967e-7,0.0004559534,2.0823865e-7,0.0014784179,0.99275416,0.0041253516,0.00016563598],"study_design_scores_gemma":[0.00032244858,0.000033241533,0.0012802043,0.000019865587,0.000021059259,0.00000140953,0.00006678567,0.0000018109238,0.00663902,0.99121946,0.00030914604,0.00008552114],"about_ca_topic_score_codex":0.0000070245223,"about_ca_topic_score_gemma":4.1222037e-7,"teacher_disagreement_score":0.009453634,"about_ca_system_score_codex":0.000011826038,"about_ca_system_score_gemma":0.0000079436895,"threshold_uncertainty_score":0.3421625},"labels":[],"label_agreement":null},{"id":"W2404108205","doi":"","title":"On the spectrum of unitary Euclidean graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Unitary state; Mathematics; Spectrum (functional analysis); Euclidean geometry; Euclidean distance; Pure mathematics; Political science; Geometry; Quantum mechanics; Physics","score_opus":0.021164296380712818,"score_gpt":0.25253617238281845,"score_spread":0.23137187600210563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404108205","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98107296,0.000012175177,0.0000054218344,0.0016472037,0.00017598871,0.0003176028,0.0000033602066,0.000047816357,0.016717475],"genre_scores_gemma":[0.9994119,0.0000046008076,0.00010300774,0.00015772569,0.0000025343022,0.00005802615,0.0000018630814,0.000014418862,0.00024595807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936,0.00008101551,0.00018216124,0.00010890901,0.00012874056,0.00013916225],"domain_scores_gemma":[0.99837214,0.0009206711,0.00009000019,0.00053419225,0.00004318481,0.000039832856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002511382,0.000093478215,0.00012259347,0.00005007234,0.00011538864,0.000012510253,0.00028831657,0.000039278635,0.00044756336],"category_scores_gemma":[0.00013141417,0.000062889194,0.000077861776,0.00026785533,0.000104318526,0.00004597502,0.00003734463,0.00013734003,0.00018195008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025730274,0.00014593216,0.00022095791,0.000008561599,0.000022063969,2.8000207e-7,0.00013571365,2.4469216e-7,0.0002915709,0.98540044,0.013715878,0.000055796365],"study_design_scores_gemma":[0.00015494003,0.000055478184,0.001309747,0.000016710119,0.000014158071,9.521291e-7,0.0001399158,0.000012129726,0.004311476,0.9937074,0.00020593648,0.000071146445],"about_ca_topic_score_codex":0.000029198744,"about_ca_topic_score_gemma":0.0000021311037,"teacher_disagreement_score":0.01833891,"about_ca_system_score_codex":0.0000071039453,"about_ca_system_score_gemma":0.00000911428,"threshold_uncertainty_score":0.4900505},"labels":[],"label_agreement":null},{"id":"W2404118109","doi":"","title":"Hamiltonian graphs involving neighborhood conditions.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Graph; Hamiltonian (control theory); Independence number; Connectivity; Quartic graph; Graph power; Hamiltonian path; Discrete mathematics; Line graph","score_opus":0.029270861985529723,"score_gpt":0.2944553543768425,"score_spread":0.2651844923913128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404118109","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.977644,0.00022623407,0.000031854743,0.00017774446,0.00083267124,0.00024915286,0.000013418985,0.00022619935,0.020598698],"genre_scores_gemma":[0.99889463,0.000013439376,0.00060233014,0.00014692856,0.00001473045,0.0000987029,0.00001585556,0.000028810115,0.0001845453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999043,0.00007796476,0.00022650343,0.00014985466,0.00014945876,0.00035324585],"domain_scores_gemma":[0.99887836,0.00033908986,0.000098903816,0.0004591416,0.00005883456,0.0001656865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036141922,0.00014573308,0.00016588203,0.00009149794,0.00029165493,0.000029296612,0.00020947069,0.00008566832,0.00021096521],"category_scores_gemma":[0.00014357663,0.00014532612,0.00009896393,0.0003466022,0.00008561056,0.00026103825,0.000053237796,0.00016896836,0.00020465616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019188035,0.00029675226,0.01021591,0.000016273194,0.000029752902,5.4996565e-7,0.00039589911,6.708323e-8,0.0008596998,0.98329693,0.0048195915,0.00006666775],"study_design_scores_gemma":[0.00033553442,0.000017058741,0.007571464,0.000018872528,0.000041708117,0.0000067095366,0.00018380133,0.000008427168,0.0012887856,0.98855835,0.0017941453,0.00017514372],"about_ca_topic_score_codex":0.0000043098275,"about_ca_topic_score_gemma":0.0000015752345,"teacher_disagreement_score":0.021250632,"about_ca_system_score_codex":0.000026054091,"about_ca_system_score_gemma":0.000017032793,"threshold_uncertainty_score":0.5926227},"labels":[],"label_agreement":null},{"id":"W2404135439","doi":"","title":"A Note on Wiener Indices of Unicyclic Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Combinatorics; Statistics; Graph","score_opus":0.021139481878837577,"score_gpt":0.299635073351355,"score_spread":0.2784955914725174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404135439","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98635733,0.000024059285,0.000013545248,0.00026299182,0.00013769523,0.00014931087,0.000004193752,0.00006372864,0.012987169],"genre_scores_gemma":[0.99915826,0.000009896815,0.0005341297,0.00015525283,0.0000029725534,0.000011406257,0.0000026886855,0.000009445728,0.00011593485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993105,0.000046389054,0.00020463551,0.00014561796,0.00015180986,0.0001410767],"domain_scores_gemma":[0.9991246,0.00024227865,0.00013457348,0.0004107571,0.00003774362,0.000050066745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020201558,0.0001028795,0.00016845496,0.0001054997,0.00007501279,0.000008537998,0.00022613966,0.00006821457,0.00002354399],"category_scores_gemma":[0.0000706225,0.00009160401,0.000081666374,0.0003544113,0.000058079622,0.00005402301,0.000015518362,0.000115179195,0.000023190967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009419805,0.0003495893,0.00013847057,0.0000072091143,0.000010992112,9.00836e-7,0.00024118686,5.6303855e-7,0.001422894,0.99546206,0.0006333001,0.0017234351],"study_design_scores_gemma":[0.00038786372,0.00015125907,0.0020356318,0.000030630355,0.000022258642,0.0000010139038,0.000024552179,0.000010533641,0.010862329,0.985755,0.000623993,0.000094893636],"about_ca_topic_score_codex":0.0000030196443,"about_ca_topic_score_gemma":0.0000012328865,"teacher_disagreement_score":0.012871235,"about_ca_system_score_codex":0.0000093908075,"about_ca_system_score_gemma":0.0000123396485,"threshold_uncertainty_score":0.3735503},"labels":[],"label_agreement":null},{"id":"W2404318628","doi":"","title":"On Regular Graphs with Complete Tripartite Star Complements.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Star (game theory); Combinatorics; Mathematical analysis","score_opus":0.06989763830698675,"score_gpt":0.3015556413172234,"score_spread":0.23165800301023665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404318628","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99178106,0.000019726014,0.0000845647,0.00028556862,0.00023446635,0.00045180312,0.00003120159,0.00016036407,0.0069512245],"genre_scores_gemma":[0.9973585,0.000001507381,0.0020079177,0.00017525845,0.0000042426686,0.00008508018,0.000031900654,0.000032290678,0.00030332577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987568,0.00011596561,0.00024727924,0.00025651144,0.0003487927,0.00027462485],"domain_scores_gemma":[0.99866796,0.0002304277,0.00013095439,0.0006470295,0.00013488099,0.0001887318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045600743,0.00018157484,0.00024471103,0.000087057146,0.00016455793,0.000033402765,0.00027103967,0.000044959455,0.00005958845],"category_scores_gemma":[0.000054440017,0.00015087219,0.00006052439,0.00035253778,0.00011457508,0.00007948905,0.000044326578,0.00014905051,0.00013204903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000848986,0.00032305898,0.00027210618,0.000012051265,0.000054255674,0.000005015605,0.0003069185,0.0000026601854,0.00011796458,0.9805448,0.018238936,0.000037304242],"study_design_scores_gemma":[0.0021694226,0.00036800303,0.00017684266,0.000032108743,0.000043138967,0.0000038042633,0.00021771461,0.00004186511,0.00060542714,0.98328066,0.01286534,0.00019570308],"about_ca_topic_score_codex":0.000011827392,"about_ca_topic_score_gemma":0.000009019967,"teacher_disagreement_score":0.006647899,"about_ca_system_score_codex":0.000037375637,"about_ca_system_score_gemma":0.00003293027,"threshold_uncertainty_score":0.61523896},"labels":[],"label_agreement":null},{"id":"W2404741992","doi":"","title":"The Maximal Total Irregularity of Unicyclic Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01675135721819802,"score_gpt":0.2652470835438106,"score_spread":0.2484957263256126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404741992","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9924453,0.00003604765,0.00008279274,0.00026114198,0.00031349887,0.00015458882,0.0000031712339,0.000052974105,0.006650479],"genre_scores_gemma":[0.99923384,0.0000058334176,0.00042781373,0.000016657013,0.0000042608867,0.000026456646,0.0000018467816,0.000012599609,0.00027066408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992044,0.00012361651,0.00022368915,0.00012790607,0.00015096209,0.00016942635],"domain_scores_gemma":[0.9984817,0.0006951432,0.000120838085,0.00059057854,0.000063003405,0.00004873408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000642211,0.00009396893,0.00014745498,0.000028914827,0.00023969909,0.000018133916,0.00029799822,0.00005858727,0.0000139413005],"category_scores_gemma":[0.0001948915,0.000069467394,0.00010447781,0.00021671873,0.00019617175,0.00004091688,0.000067150606,0.0001256939,0.00001516271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005956731,0.00010897118,0.0004100407,0.000010099395,0.000020889922,1.2780266e-7,0.000066900546,1.7818917e-7,0.00042165126,0.99666625,0.0007513656,0.0015375479],"study_design_scores_gemma":[0.00030021157,0.000040242117,0.0031457331,0.000008144196,0.000023732226,0.0000031468933,0.00004291128,0.00008482561,0.0023687668,0.99213916,0.0017643084,0.00007880307],"about_ca_topic_score_codex":0.000006857985,"about_ca_topic_score_gemma":0.0000036767663,"teacher_disagreement_score":0.006788562,"about_ca_system_score_codex":0.0000075526973,"about_ca_system_score_gemma":0.000011406896,"threshold_uncertainty_score":0.2832798},"labels":[],"label_agreement":null},{"id":"W2404800073","doi":"","title":"Extremal Zeroth-Order General Randic Index Of Thorn Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Order (exchange); Topological index; Combinatorics; Discrete mathematics; Statistics; Computer science; Business","score_opus":0.04256496288708617,"score_gpt":0.27728302598257365,"score_spread":0.23471806309548748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404800073","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9833133,0.000053248885,0.00035723022,0.000021409376,0.00034906773,0.00026844494,0.0000057909133,0.000080069745,0.015551422],"genre_scores_gemma":[0.99679303,0.000010349027,0.002645222,0.000029270941,0.000005596854,0.00005928155,0.0000032911182,0.000025741492,0.00042819488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905694,0.00007907044,0.00030604532,0.00019036134,0.00016055904,0.00020705651],"domain_scores_gemma":[0.99907357,0.00011175657,0.00015552077,0.00048087141,0.00010422816,0.00007405646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031132274,0.00014387195,0.00024174874,0.00010417426,0.00009602575,0.0000075355388,0.00026879745,0.000101669255,0.00032562533],"category_scores_gemma":[0.00006359121,0.00013169055,0.0001165166,0.00037843443,0.00013577071,0.000077255136,0.000052987114,0.00013758667,0.000026651718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039083017,0.00033327378,0.0074630463,0.00002606035,0.00004781961,0.0000016794755,0.0006536215,1.8188405e-7,0.00087624724,0.989345,0.00094316824,0.00027082168],"study_design_scores_gemma":[0.00088402466,0.000051524392,0.004952658,0.000015829724,0.00004340359,0.000004164458,0.0000667515,0.000026951822,0.006541946,0.9870161,0.00025613906,0.00014051927],"about_ca_topic_score_codex":0.000027440694,"about_ca_topic_score_gemma":0.0000041173844,"teacher_disagreement_score":0.015123227,"about_ca_system_score_codex":0.000008169205,"about_ca_system_score_gemma":0.000024274268,"threshold_uncertainty_score":0.5370185},"labels":[],"label_agreement":null},{"id":"W2404828447","doi":"","title":"On Transitive Cayley Graphs of Strong Semilatttices of Rectangular Groups.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cayley graph; Mathematics; Transitive relation; Combinatorics; Vertex-transitive graph; Pure mathematics; Graph; Voltage graph; Line graph","score_opus":0.023982158909415057,"score_gpt":0.28700531360345893,"score_spread":0.26302315469404386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404828447","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9928366,0.00011441699,0.000067072644,0.00002917895,0.00022156075,0.00021053352,0.000023538889,0.000030184374,0.006466904],"genre_scores_gemma":[0.9994854,0.000007910366,0.0004212344,0.000011379862,0.0000037965656,0.00002154157,0.0000048978372,0.000016735752,0.000027111242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991694,0.00009455112,0.00026483522,0.00011358668,0.00017289356,0.00018473704],"domain_scores_gemma":[0.99877775,0.0005777512,0.00018135861,0.00033022577,0.000069123205,0.00006376859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004255259,0.00011361642,0.00024469328,0.00008010705,0.00005119583,0.0000028541067,0.00015072299,0.00007164071,0.00004676403],"category_scores_gemma":[0.00008575122,0.000106207954,0.000115185234,0.0002533378,0.00010157348,0.000094835974,0.000015476608,0.00011003887,0.000005535452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002648154,0.00047300642,0.0012061937,0.00006589949,0.000062660154,2.5700862e-7,0.0018853439,6.865287e-7,0.0047524087,0.9912601,0.00017531142,0.00009165046],"study_design_scores_gemma":[0.00035714376,0.000093864015,0.0013317325,0.000059280635,0.00007565247,0.0000010053096,0.00051415386,0.0000058791397,0.052285336,0.9451545,0.000028455677,0.00009300209],"about_ca_topic_score_codex":0.000009028747,"about_ca_topic_score_gemma":0.0000015139087,"teacher_disagreement_score":0.047532927,"about_ca_system_score_codex":0.000011155072,"about_ca_system_score_gemma":0.00000967806,"threshold_uncertainty_score":0.43310347},"labels":[],"label_agreement":null},{"id":"W2405072688","doi":"","title":"On the Szeged Index of some Benzenoid Graphs Applicable in Nanostructures.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Computer science; World Wide Web","score_opus":0.014286796395551563,"score_gpt":0.2590999318885012,"score_spread":0.24481313549294967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405072688","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9951863,0.00004165752,0.000005615739,0.00056733907,0.00011187884,0.0004257841,0.000005373442,0.000041001542,0.0036150087],"genre_scores_gemma":[0.99949944,0.0000072618186,0.00006871355,0.0003022055,0.0000030696292,0.000045146335,0.0000022803272,0.0000123341,0.00005956424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990868,0.000073043106,0.00027024266,0.00018386522,0.00018787086,0.00019820392],"domain_scores_gemma":[0.9987583,0.00045970242,0.00012536484,0.00058360706,0.00003347224,0.00003954298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035265833,0.00013361423,0.00020952662,0.00010130973,0.00010372307,0.000012712497,0.0003676088,0.00009217444,0.000042635955],"category_scores_gemma":[0.00011805464,0.000097385804,0.000078624056,0.00044714802,0.00007152958,0.000051331303,0.000026382808,0.00023738151,0.000010672534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022339664,0.00023470496,0.0002517242,0.0000087346825,0.000009501504,7.9570907e-7,0.00017485773,0.000005132447,0.003230768,0.9942057,0.0016365113,0.00021922396],"study_design_scores_gemma":[0.0004778543,0.00007216307,0.00358374,0.000023395678,0.000008943034,0.0000010084381,0.00005451365,0.000016937458,0.014383069,0.9811175,0.00015999435,0.000100870915],"about_ca_topic_score_codex":0.000008441253,"about_ca_topic_score_gemma":0.0000030883366,"teacher_disagreement_score":0.0130881965,"about_ca_system_score_codex":0.000016852064,"about_ca_system_score_gemma":0.000016715116,"threshold_uncertainty_score":0.39712778},"labels":[],"label_agreement":null},{"id":"W2405125483","doi":"","title":"On the Laplacian Spectral Radius of Unicyclic Graphs with Fixed Diameter.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Combinatorics; RADIUS; Laplace operator; Mathematical analysis; Eigenvalues and eigenvectors; Physics; Computer science; Computer network; Quantum mechanics","score_opus":0.02509817658149875,"score_gpt":0.26372755145711074,"score_spread":0.238629374875612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405125483","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9914114,0.00003061247,0.000025495938,0.00019502477,0.00018672834,0.0002655774,0.00000620829,0.000046047753,0.007832922],"genre_scores_gemma":[0.9992246,0.00000432129,0.0004686075,0.00007414103,0.0000056969516,0.000045240064,0.0000022413242,0.000020117339,0.00015500831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992298,0.000107285035,0.00016295597,0.00010773745,0.00015624489,0.0002360106],"domain_scores_gemma":[0.99836737,0.000884148,0.00011915432,0.0005323381,0.000026627857,0.000070375085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003132298,0.00012254721,0.00016418613,0.000051823634,0.0001181407,0.0000104008805,0.0002443564,0.000046147554,0.00007115769],"category_scores_gemma":[0.0000845052,0.00007664344,0.000076143944,0.0003162691,0.00013929402,0.00006341341,0.000022243188,0.00015393959,0.000027359993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018117105,0.00030803564,0.0026961914,0.000009088461,0.00004627124,3.6987245e-7,0.0003881038,1.8793205e-7,0.0004186087,0.9946747,0.0013526449,0.00008768248],"study_design_scores_gemma":[0.00037154436,0.00010725735,0.0032298071,0.000023765931,0.00004223642,0.0000034384977,0.00012981049,0.0000037859206,0.009841032,0.9858537,0.00029139826,0.00010227536],"about_ca_topic_score_codex":0.000005056704,"about_ca_topic_score_gemma":0.0000036650536,"teacher_disagreement_score":0.009422423,"about_ca_system_score_codex":0.000013041439,"about_ca_system_score_gemma":0.000010738888,"threshold_uncertainty_score":0.31254286},"labels":[],"label_agreement":null},{"id":"W2405149775","doi":"","title":"On the Laplacian integral (k-1)-cyclic graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.05150404660088367,"score_gpt":0.2963380189424615,"score_spread":0.2448339723415778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405149775","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9605716,0.000018241963,0.0000133651365,0.0015079177,0.00054700277,0.00024188776,0.000004139162,0.00012605304,0.036969777],"genre_scores_gemma":[0.9987567,0.0000020080315,0.00013375755,0.00038653408,0.000006128421,0.000081666796,0.000003390061,0.000019560486,0.00061024795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991607,0.00012274296,0.00016440717,0.00016042379,0.00019935322,0.00019236653],"domain_scores_gemma":[0.9985646,0.0006321131,0.000071928844,0.00055887783,0.000064493484,0.000107994376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005714814,0.00012964194,0.00013233967,0.00005346364,0.00016113548,0.000036083093,0.0003602635,0.00006287001,0.00005667492],"category_scores_gemma":[0.0004673363,0.0000847716,0.00008630655,0.00030932258,0.000104864164,0.0000503829,0.00004512242,0.00023222898,0.00029083775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012180757,0.00013909978,0.0001750503,0.0000026834587,0.00001722246,0.000001259285,0.0003982279,2.238422e-7,0.000034931494,0.95574105,0.043344766,0.00013331663],"study_design_scores_gemma":[0.0003464864,0.00006882318,0.00011323587,0.000014612854,0.000016487043,0.0000028724721,0.00033641275,0.000012282416,0.00077206024,0.9932349,0.0049745217,0.000107335254],"about_ca_topic_score_codex":0.000007955513,"about_ca_topic_score_gemma":0.000006048118,"teacher_disagreement_score":0.038370244,"about_ca_system_score_codex":0.000025492689,"about_ca_system_score_gemma":0.000024402378,"threshold_uncertainty_score":0.3738228},"labels":[],"label_agreement":null},{"id":"W2405162587","doi":"","title":"Double hexagonal chains with the extremal PI indices.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pi; Hexagonal crystal system; Combinatorics; Geometry; Crystallography; Chemistry","score_opus":0.02565695033797098,"score_gpt":0.26077115085330893,"score_spread":0.23511420051533796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405162587","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9844218,0.00002978079,0.000058520312,0.0018522755,0.00014465007,0.0004982245,0.0000022909232,0.00009736066,0.012895097],"genre_scores_gemma":[0.9969776,0.000002190353,0.0003349767,0.00017903434,0.000013922093,0.00030385313,0.0000040367268,0.000022085074,0.00216225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921954,0.000042348765,0.00013802621,0.00017309227,0.00019680402,0.00023016783],"domain_scores_gemma":[0.9990472,0.00025283985,0.00009818588,0.00045375983,0.00007467,0.00007334839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023084077,0.0001322435,0.00013109183,0.00003548415,0.00028313987,0.00006702561,0.00033419224,0.000055191238,0.000354596],"category_scores_gemma":[0.0000137459565,0.000080335245,0.000048769973,0.00025053104,0.00013990329,0.0001277697,0.00005462617,0.00018895612,0.00024803946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010934623,0.00013871306,0.0006164079,0.000009502442,0.0000310874,9.277321e-7,0.0005650407,5.2456005e-7,0.00019451186,0.98925203,0.009021761,0.00015856352],"study_design_scores_gemma":[0.0008063903,0.00004594374,0.001971471,0.00001204652,0.000026799064,0.000008302688,0.00033534088,0.000028833167,0.000792802,0.9921946,0.0036468257,0.00013064538],"about_ca_topic_score_codex":0.000036830843,"about_ca_topic_score_gemma":0.000014703193,"teacher_disagreement_score":0.012555852,"about_ca_system_score_codex":0.000015724205,"about_ca_system_score_gemma":0.000029953282,"threshold_uncertainty_score":0.38825777},"labels":[],"label_agreement":null},{"id":"W2405171052","doi":"","title":"A Zeta Function Of A Semiregular Weighted Bipartite Graph.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Graph; Complete bipartite graph; Riemann zeta function; Combinatorics; Function (biology); Prime zeta function; Discrete mathematics; Arithmetic zeta function; Pure mathematics","score_opus":0.034916556048798,"score_gpt":0.2531361223333386,"score_spread":0.2182195662845406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405171052","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99097556,0.000060457874,0.00028272436,0.000022719063,0.0003035458,0.00021254152,0.000005389893,0.000078917874,0.008058145],"genre_scores_gemma":[0.99842185,0.000007477482,0.0012350221,0.000015510172,0.0000034259365,0.000053836215,0.000004753286,0.00001733721,0.00024079271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924266,0.00006240343,0.0002546635,0.000161163,0.00012846332,0.00015064642],"domain_scores_gemma":[0.99914753,0.000091431735,0.0001469193,0.00046158503,0.000092981376,0.000059577855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026159198,0.00011050191,0.00017940819,0.000097314514,0.00007865268,0.000005378686,0.0001661299,0.00007532103,0.0002710357],"category_scores_gemma":[0.00003459779,0.0001026151,0.00010651015,0.00041459085,0.000088927525,0.000083094164,0.00003383998,0.00008629122,0.000049542607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003231021,0.00032079368,0.00088607176,0.000025594285,0.000060967748,8.0680974e-7,0.00045832686,2.3832174e-8,0.0034216926,0.9935284,0.0009355805,0.00032941834],"study_design_scores_gemma":[0.00038383077,0.0000844342,0.0019558342,0.000024323685,0.00008503921,0.000001798865,0.00006191841,0.000013198687,0.021974325,0.97446054,0.00084974384,0.00010503974],"about_ca_topic_score_codex":0.000010097678,"about_ca_topic_score_gemma":0.0000022597374,"teacher_disagreement_score":0.0190679,"about_ca_system_score_codex":0.0000071496224,"about_ca_system_score_gemma":0.000013267143,"threshold_uncertainty_score":0.41845223},"labels":[],"label_agreement":null},{"id":"W2405294156","doi":"","title":"On the zeroth-order general Randic index of unicycle graphs with k pendant vertices.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Topological index; Combinatorics; Order (exchange); Index (typography); Computer science","score_opus":0.015121232968081134,"score_gpt":0.24849435882436374,"score_spread":0.23337312585628261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405294156","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9946217,0.000019520883,0.00005577826,0.000487018,0.00009960646,0.00052362826,0.0000028983861,0.000040455347,0.0041493857],"genre_scores_gemma":[0.99919426,0.0000059045165,0.00022683122,0.00014284879,0.0000025911922,0.0001564848,0.0000019961647,0.000021451167,0.0002476351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991644,0.00009397774,0.0002002067,0.00015410481,0.00020566638,0.00018166433],"domain_scores_gemma":[0.99867165,0.00048579316,0.00012802816,0.0005517083,0.000108595064,0.000054196345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023353372,0.00012972897,0.00017307185,0.000053916403,0.00014978569,0.000024443583,0.00029518275,0.00005033136,0.00031006872],"category_scores_gemma":[0.00007685581,0.00007748691,0.000057354326,0.0003530831,0.00015749376,0.000075981894,0.000036906407,0.00015685848,0.00005568697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027076469,0.00021190576,0.0010095616,0.000014323201,0.00005046726,4.762534e-7,0.00023621324,0.000006159525,0.0006304138,0.9954835,0.002249257,0.000080646874],"study_design_scores_gemma":[0.0009074272,0.00009572026,0.0026343868,0.000028506582,0.000031593223,0.0000018667686,0.000109723514,0.00018404766,0.0031056982,0.99265444,0.00013946589,0.00010711506],"about_ca_topic_score_codex":0.000063811225,"about_ca_topic_score_gemma":0.000006365578,"teacher_disagreement_score":0.0045725484,"about_ca_system_score_codex":0.0000100541965,"about_ca_system_score_gemma":0.000025203099,"threshold_uncertainty_score":0.3395035},"labels":[],"label_agreement":null},{"id":"W2405309804","doi":"","title":"On the harmonic index and the matching number of a tree.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Matching (statistics); Harmonic; Index (typography); Tree (set theory); Graph; Discrete mathematics; Mathematical analysis; Statistics; Physics; Quantum mechanics","score_opus":0.016207131169212588,"score_gpt":0.2697401001770398,"score_spread":0.25353296900782724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405309804","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98584896,0.000009123159,0.00009895494,0.001263346,0.00008359637,0.0001840418,7.742058e-7,0.000020019708,0.012491157],"genre_scores_gemma":[0.99953276,0.0000041379194,0.000058494603,0.00016421398,0.0000033031247,0.00004268709,2.8815916e-7,0.000009580352,0.00018453327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994361,0.00015952306,0.00013144736,0.00008515582,0.00010225046,0.0000855165],"domain_scores_gemma":[0.9972065,0.0023103193,0.00008836133,0.0003544508,0.000021628024,0.000018736726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074235175,0.00006989551,0.00011989867,0.000011132539,0.00015092536,0.000017430377,0.00018350579,0.000030756197,0.00003077944],"category_scores_gemma":[0.00018874038,0.00003605738,0.000047592406,0.00009341761,0.00015993665,0.000021015438,0.000043942266,0.00013132721,0.000017162432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016700445,0.000045458866,0.000201541,0.000008759006,0.000017370849,5.159867e-8,0.0006983738,3.0000987e-7,0.00004223902,0.9981658,0.0005673325,0.00023606041],"study_design_scores_gemma":[0.0007066363,0.000008820027,0.00075792306,0.000018933584,0.000020212878,0.0000020696114,0.00013859019,0.00014931528,0.00029161037,0.9976228,0.00023951968,0.000043578333],"about_ca_topic_score_codex":0.000009185118,"about_ca_topic_score_gemma":0.0000019178235,"teacher_disagreement_score":0.013683775,"about_ca_system_score_codex":0.0000040189207,"about_ca_system_score_gemma":0.0000051494226,"threshold_uncertainty_score":0.14703771},"labels":[],"label_agreement":null},{"id":"W2405476814","doi":"","title":"Strict lower bounds on the multiplicative Zagreb indices of graph operations.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Multiplicative function; Graph; Combinatorics; Mathematical analysis","score_opus":0.024062053785271917,"score_gpt":0.28137397878235254,"score_spread":0.2573119249970806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405476814","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99118054,0.000013841119,0.00016945458,0.00055628817,0.0002135407,0.00036486884,0.0000113790275,0.000050827322,0.007439264],"genre_scores_gemma":[0.99922174,0.0000069683324,0.00038154246,0.00014070453,0.0000075991666,0.00005843932,0.0000049541745,0.000015533715,0.00016249178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990409,0.00020360222,0.0002477939,0.00018116375,0.00018645273,0.00014007531],"domain_scores_gemma":[0.99746156,0.0016195544,0.00012889395,0.00063467934,0.000111676825,0.000043638316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006799442,0.00012659079,0.00016684252,0.00007403446,0.0002812651,0.000030809817,0.0003732132,0.00006472892,0.0000644458],"category_scores_gemma":[0.00052339846,0.00008612978,0.000089473055,0.00039139795,0.0001729912,0.00006321378,0.00004492975,0.00016361043,0.000046803434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012523376,0.0003170736,0.0002461588,0.000008259848,0.00003443115,9.406023e-8,0.0006269152,0.000005687503,0.0005842943,0.9964918,0.0014889368,0.00018385793],"study_design_scores_gemma":[0.00031973305,0.00012380975,0.0015151185,0.00002151228,0.000026604139,5.007184e-7,0.0002145824,0.00013596608,0.006566678,0.9898631,0.0011115216,0.00010087441],"about_ca_topic_score_codex":0.000011135892,"about_ca_topic_score_gemma":0.0000059636895,"teacher_disagreement_score":0.008041231,"about_ca_system_score_codex":0.000012174705,"about_ca_system_score_gemma":0.000017443896,"threshold_uncertainty_score":0.35122707},"labels":[],"label_agreement":null},{"id":"W2405660549","doi":"","title":"Graphs with fourth largest signless-Laplacian eigenvalue less than two.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Combinatorics; Physics","score_opus":0.024470155320361172,"score_gpt":0.26557758174876084,"score_spread":0.24110742642839966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405660549","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98894584,0.00003341216,0.00021639281,0.00034259207,0.00026024622,0.00066133105,0.000009960535,0.00021765607,0.009312559],"genre_scores_gemma":[0.9969326,0.000007525237,0.0019670054,0.000093616596,0.0000110377205,0.00032039647,0.000013378926,0.000054766562,0.0005996358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986333,0.00011362832,0.0002599059,0.0003308736,0.00026241137,0.0003998791],"domain_scores_gemma":[0.9985431,0.0002771656,0.00015173809,0.0007051526,0.00014756093,0.00017532396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028707812,0.00025146408,0.0002826109,0.000099969715,0.00031112751,0.00008932985,0.0004002551,0.00009223134,0.0001534731],"category_scores_gemma":[0.000041448297,0.00020591484,0.000097679156,0.00043472767,0.0001451684,0.00021477722,0.000061534374,0.00023838693,0.00028704625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010000951,0.0002959467,0.007680143,0.000026768215,0.00005938851,0.0000042353377,0.00028426156,0.0000024934259,0.00044463895,0.98904014,0.001853714,0.00029827823],"study_design_scores_gemma":[0.0009778246,0.00009175627,0.0030827958,0.000040287156,0.000052843512,0.000011126312,0.00039571992,0.000054396376,0.0018630708,0.9926592,0.00047349473,0.0002974964],"about_ca_topic_score_codex":0.00009408446,"about_ca_topic_score_gemma":0.00005589414,"teacher_disagreement_score":0.008712923,"about_ca_system_score_codex":0.000022434273,"about_ca_system_score_gemma":0.000037409285,"threshold_uncertainty_score":0.83969635},"labels":[],"label_agreement":null},{"id":"W2405688950","doi":"","title":"The Harary index of digraphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Computer science; World Wide Web","score_opus":0.03885242831579169,"score_gpt":0.2925452513961638,"score_spread":0.2536928230803721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405688950","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9837986,0.00015198304,0.000024450312,0.00030828427,0.0003845966,0.00016027901,0.0000031978063,0.000051867726,0.015116732],"genre_scores_gemma":[0.9994487,0.000008940013,0.00011428416,0.000021806829,0.000003534087,0.000029573093,0.0000012189128,0.0000095376445,0.0003623719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994261,0.000054937966,0.00017336375,0.000082580926,0.00014953541,0.00011347987],"domain_scores_gemma":[0.99896824,0.00038012723,0.000093876406,0.00040894223,0.000087013985,0.00006180688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043831574,0.000066035485,0.00010106278,0.000026543139,0.00010156378,0.000014086878,0.00026407937,0.000039849492,0.000005803388],"category_scores_gemma":[0.00018656156,0.000045920424,0.000054907945,0.00022008092,0.00011950472,0.00004901761,0.000046673722,0.0000869122,0.000017678085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010230586,0.00008032384,0.0020449953,0.000005386844,0.000017838678,3.482044e-7,0.00022576671,2.1392393e-7,0.000059226182,0.9857615,0.011455989,0.00033818532],"study_design_scores_gemma":[0.00025519473,0.000026289386,0.0007690966,0.0000070414944,0.00001108782,0.0000013413465,0.00019851576,0.000015072837,0.0014088417,0.9901809,0.007072624,0.00005397143],"about_ca_topic_score_codex":0.0000058614496,"about_ca_topic_score_gemma":0.0000022565978,"teacher_disagreement_score":0.015650123,"about_ca_system_score_codex":0.0000072574967,"about_ca_system_score_gemma":0.000030312682,"threshold_uncertainty_score":0.18725805},"labels":[],"label_agreement":null},{"id":"W2405742734","doi":"","title":"A kind of conditional vertex connectivity of recursive circulants.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.057658729856271594,"score_gpt":0.31222086328666004,"score_spread":0.25456213343038847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405742734","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99491024,0.000025755266,0.00010473414,0.000062963874,0.00021594367,0.00017032695,0.000060520626,0.000018608594,0.0044309176],"genre_scores_gemma":[0.9996099,0.0000012761055,0.00030154313,0.0000120648065,0.000002387601,0.000018611332,0.000015685451,0.000008342448,0.000030196397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993303,0.00007752558,0.00020638476,0.00011247456,0.00017984312,0.0000935004],"domain_scores_gemma":[0.9987812,0.00047551846,0.00018598571,0.00025680347,0.00023619202,0.00006431751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034447835,0.00007362098,0.00021122384,0.000048551356,0.000029584584,0.0000027348478,0.00013546502,0.000057355417,0.000039859064],"category_scores_gemma":[0.00045723756,0.00007406111,0.00006424274,0.00016987194,0.00013451905,0.000054729982,0.000029759836,0.00007253307,0.000011981134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020709535,0.00033906745,0.0016716917,0.000027953802,0.000044895023,8.814879e-7,0.0004250829,9.974823e-7,0.0011655556,0.9936946,0.0025706731,0.00003788787],"study_design_scores_gemma":[0.0008146749,0.00007572455,0.0027144228,0.000025480005,0.00003272526,0.0000049021196,0.00021534092,0.000013644264,0.013684079,0.9821813,0.00016585077,0.00007185062],"about_ca_topic_score_codex":0.000010764278,"about_ca_topic_score_gemma":0.0000019586735,"teacher_disagreement_score":0.012518524,"about_ca_system_score_codex":0.00001986006,"about_ca_system_score_gemma":0.000065933884,"threshold_uncertainty_score":0.3020124},"labels":[],"label_agreement":null},{"id":"W2405767764","doi":"","title":"On the lexicographical ordering by spectral moments of bicyclic graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Lexicographical order; Mathematics; Combinatorics","score_opus":0.017958184928951345,"score_gpt":0.2663089914562024,"score_spread":0.24835080652725106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405767764","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9927466,0.000012346151,0.00006115453,0.000513385,0.00017824679,0.0001955704,0.0000049464948,0.000057246914,0.0062305126],"genre_scores_gemma":[0.9996264,0.0000067794813,0.00010597881,0.00009838897,0.0000031318468,0.000043803168,0.0000028303339,0.00001798943,0.00009470373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912935,0.000106141226,0.00021793145,0.00016449008,0.00019272733,0.00018932889],"domain_scores_gemma":[0.99859166,0.0007551469,0.00010632069,0.000465365,0.00002810177,0.000053393305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040888935,0.00012166309,0.00016517642,0.00006878508,0.00014238626,0.000015525678,0.00030386169,0.000058554553,0.00007072443],"category_scores_gemma":[0.00017871721,0.00008795308,0.00010851599,0.00039175246,0.00014102811,0.00003130306,0.000036294052,0.00017394384,0.000021890914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008256602,0.00026281996,0.0006281326,0.000011194405,0.000030670497,1.1482365e-7,0.000081563245,2.9159392e-7,0.002611936,0.9911918,0.005080503,0.00009271317],"study_design_scores_gemma":[0.00032482954,0.000092520495,0.0004624436,0.000020078569,0.000018769751,6.8318417e-7,0.000023711935,0.000035053217,0.009176248,0.98894143,0.0008102903,0.00009395618],"about_ca_topic_score_codex":0.0000055421974,"about_ca_topic_score_gemma":8.6779414e-7,"teacher_disagreement_score":0.0068798033,"about_ca_system_score_codex":0.0000072604553,"about_ca_system_score_gemma":0.000004640007,"threshold_uncertainty_score":0.35866225},"labels":[],"label_agreement":null},{"id":"W2405828630","doi":"","title":"On the Hosoya index of unicyclic graphs with a new given diameter.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Index (typography); Computer science; World Wide Web","score_opus":0.018651515790496523,"score_gpt":0.2531056592473146,"score_spread":0.2344541434568181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405828630","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99191755,0.000008447026,0.000479862,0.00063977443,0.00008764216,0.0002584172,0.0000022935685,0.000046854464,0.0065591545],"genre_scores_gemma":[0.9992837,0.0000026520788,0.0002873331,0.00012599307,0.0000035946796,0.000032666198,0.0000011805109,0.000019598863,0.00024332211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992919,0.00009627201,0.00016066628,0.00014597407,0.00016581795,0.00013939156],"domain_scores_gemma":[0.9979034,0.0012144013,0.00013816553,0.00064462476,0.00003915847,0.000060240338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002961839,0.00011563185,0.0001712078,0.000054059696,0.000093990035,0.000013641986,0.00031745664,0.000049467373,0.00004247856],"category_scores_gemma":[0.00016308315,0.000072090304,0.00006675104,0.0003182134,0.00011522425,0.000032167827,0.00003371629,0.00014432074,0.000019673469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001575304,0.00012850802,0.0010733601,0.000009205388,0.00003622635,1.7016482e-7,0.00022905419,0.0000012510366,0.00012143787,0.9951141,0.0028007962,0.00047015137],"study_design_scores_gemma":[0.0005071886,0.00018212719,0.0015177837,0.000045194305,0.000029390922,0.0000010853394,0.000050647748,0.000040152696,0.0018903725,0.9949927,0.00065025105,0.00009313975],"about_ca_topic_score_codex":0.000023070716,"about_ca_topic_score_gemma":0.00000915047,"teacher_disagreement_score":0.007366105,"about_ca_system_score_codex":0.000007381801,"about_ca_system_score_gemma":0.000019759753,"threshold_uncertainty_score":0.29397574},"labels":[],"label_agreement":null},{"id":"W2405999666","doi":"","title":"On the average eccentricity of unicyclic graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eccentricity (behavior); Combinatorics; Psychology","score_opus":0.030527434356021697,"score_gpt":0.2790060066540664,"score_spread":0.24847857229804468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405999666","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9880867,0.000038691134,0.000039800405,0.00017436351,0.00028775464,0.00020646161,0.0000052816263,0.00003820705,0.011122715],"genre_scores_gemma":[0.9996481,0.000009261284,0.00007403939,0.00009959527,0.0000039452143,0.0000251059,0.000001427023,0.000011397655,0.00012712207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930507,0.0001125716,0.00016740322,0.00008159468,0.00014430883,0.00018905995],"domain_scores_gemma":[0.9982851,0.0010427753,0.00010890872,0.00047472742,0.000033198998,0.00005528187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048795567,0.00008856533,0.00012299091,0.000043141503,0.0001239611,0.0000065555696,0.00024154806,0.00004624651,0.00012554061],"category_scores_gemma":[0.0001977043,0.000060472885,0.00008612087,0.00030463559,0.00007387135,0.0000513972,0.000040802715,0.00013289301,0.000053130727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000405549,0.0003631822,0.0012376505,0.000007783678,0.000020852372,1.2943525e-7,0.00024115996,4.967262e-7,0.00013785681,0.99521106,0.002664426,0.00011131444],"study_design_scores_gemma":[0.00018966658,0.000019983121,0.0011509686,0.000010653831,0.000019118916,8.798504e-7,0.000039695107,0.000014163896,0.00646763,0.9913536,0.0006676095,0.00006608405],"about_ca_topic_score_codex":0.0000038165203,"about_ca_topic_score_gemma":3.4680858e-7,"teacher_disagreement_score":0.011561382,"about_ca_system_score_codex":0.000011904199,"about_ca_system_score_gemma":0.0000067320043,"threshold_uncertainty_score":0.24660127},"labels":[],"label_agreement":null},{"id":"W2406155186","doi":"","title":"On the Merrifield-Simmons index and Hosoya index of bicyclic graphs with a given girth.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Girth (graph theory); Mathematics; Combinatorics; Index (typography); Discrete mathematics; Computer science","score_opus":0.019514727435922315,"score_gpt":0.25834961748710167,"score_spread":0.23883489005117936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406155186","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99362737,0.000065949884,0.00004856257,0.0004729107,0.00011131016,0.00032021335,0.000005815233,0.00003727828,0.0053106085],"genre_scores_gemma":[0.9996051,0.000009896922,0.00007656712,0.000092862516,0.000004563468,0.00007731214,0.0000012676154,0.000019259947,0.00011313414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921054,0.00008894152,0.00017539208,0.00013529044,0.00017535141,0.00021446648],"domain_scores_gemma":[0.99842334,0.0008442735,0.00013725783,0.00047037276,0.000042489217,0.000082244194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032825436,0.00013902092,0.00018482796,0.0000779853,0.00015425062,0.00001393998,0.00019427584,0.00008182404,0.00005042519],"category_scores_gemma":[0.000097224365,0.00008877261,0.0000512815,0.00031627022,0.00018622958,0.00007743153,0.000047423655,0.00021041206,0.000009431245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000327124,0.00025441998,0.0230746,0.000018266986,0.00005925393,3.4776292e-7,0.0007405743,2.822306e-7,0.00015467465,0.9742472,0.0013044792,0.00011315358],"study_design_scores_gemma":[0.0004582106,0.00009557497,0.012290602,0.00003858319,0.000040256768,0.0000039519805,0.000254784,0.000011403684,0.0011584734,0.9849921,0.00054044544,0.00011563752],"about_ca_topic_score_codex":0.000022132383,"about_ca_topic_score_gemma":0.0000060696466,"teacher_disagreement_score":0.010784,"about_ca_system_score_codex":0.0000066022963,"about_ca_system_score_gemma":0.000013416158,"threshold_uncertainty_score":0.36200422},"labels":[],"label_agreement":null},{"id":"W2406159111","doi":"","title":"Extremal Trees of the Eccentric Connectivity Index","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eccentric; Index (typography); Statistics; Topological index; Combinatorics; Computer science; World Wide Web; Structural engineering","score_opus":0.043572902612251094,"score_gpt":0.28565826364942415,"score_spread":0.24208536103717304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406159111","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99347246,0.00003457947,0.0000541782,0.00017711773,0.0004076933,0.00019741572,0.000004454175,0.00003850691,0.0056135864],"genre_scores_gemma":[0.9996596,0.0000010800534,0.000070913535,0.00001855262,0.0000050211115,0.000014151377,5.362845e-7,0.000009643533,0.00022051703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931806,0.00011425651,0.0001584338,0.000112036,0.00017663471,0.000120600984],"domain_scores_gemma":[0.99896365,0.00031898433,0.00012318614,0.00044429942,0.00009212091,0.000057746598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037326742,0.0000802006,0.00014093536,0.000032085452,0.00007058968,0.000008618556,0.00026729246,0.000052430878,0.00001950851],"category_scores_gemma":[0.00041357422,0.000057013116,0.00007413682,0.00034183628,0.000092520946,0.000052545794,0.00008114924,0.00010234795,0.00001056281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000968146,0.00022246427,0.016246052,0.00000764504,0.000014555215,3.2383787e-7,0.0003309067,0.000002402144,0.00015324289,0.980839,0.0020143804,0.00015934359],"study_design_scores_gemma":[0.00055041554,0.00002151082,0.009685539,0.000010537352,0.000021524558,0.0000025109905,0.00019793256,0.00007441188,0.0033471505,0.9855396,0.00048298534,0.000065844746],"about_ca_topic_score_codex":0.000014250212,"about_ca_topic_score_gemma":0.000012093611,"teacher_disagreement_score":0.0065605137,"about_ca_system_score_codex":0.000022834141,"about_ca_system_score_gemma":0.00004570835,"threshold_uncertainty_score":0.23249273},"labels":[],"label_agreement":null},{"id":"W2406187070","doi":"","title":"The spectral characterization of graphs of index less than 2 with no Z n as a component.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Characterization (materials science); Index (typography); Component (thermodynamics); Combinatorics; Physics; Computer science; Materials science; Nanotechnology; World Wide Web; Thermodynamics","score_opus":0.011045731583445876,"score_gpt":0.24482581669248316,"score_spread":0.23378008510903728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406187070","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9974455,0.0000020482967,0.000026957918,0.00008656412,0.00027683348,0.0002484537,0.000008687265,0.000024766878,0.0018801396],"genre_scores_gemma":[0.99970573,0.0000055944747,0.00012276496,0.000006416054,0.00000463554,0.000025848554,0.000009514756,0.000013917651,0.00010556869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935675,0.000041848478,0.00021467642,0.000105840976,0.00016394,0.00011695738],"domain_scores_gemma":[0.9989768,0.00019967301,0.00023864619,0.00041327052,0.0001368605,0.000034723224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002510062,0.00009000962,0.00015304633,0.000040867955,0.00011318225,0.000012513187,0.00024141249,0.00005233114,0.000017793838],"category_scores_gemma":[0.000043187738,0.00006146716,0.00005378833,0.00021745863,0.00020197297,0.000055174834,0.000026538046,0.00015721649,0.0000058934875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046919682,0.00017919303,0.0063464744,0.000020377565,0.000030058922,2.6133367e-7,0.00019197387,5.0673243e-8,0.13609633,0.85699636,0.000016302769,0.000075724434],"study_design_scores_gemma":[0.00039378103,0.00007639093,0.029621901,0.000019820174,0.000021115311,0.000003434773,0.00006823215,0.00002082379,0.047373448,0.92212284,0.00020802097,0.00007017685],"about_ca_topic_score_codex":0.00001832685,"about_ca_topic_score_gemma":0.000020109102,"teacher_disagreement_score":0.08872288,"about_ca_system_score_codex":0.000003298649,"about_ca_system_score_gemma":0.000024064133,"threshold_uncertainty_score":0.2506558},"labels":[],"label_agreement":null},{"id":"W2406243916","doi":"","title":"Defensive alliances in circulant graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Circulant matrix; Mathematics; Combinatorics","score_opus":0.02530739306303901,"score_gpt":0.27995575678977586,"score_spread":0.2546483637267368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406243916","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99156,0.000041890893,0.000051562776,0.00019100847,0.0002771104,0.00016504867,0.0000017094344,0.000067194625,0.0076444806],"genre_scores_gemma":[0.9992463,0.000012101449,0.0004911584,0.00011345024,0.0000036882548,0.000052542426,0.0000029865853,0.000012950711,0.0000647993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992694,0.00008438448,0.00018315321,0.00017627781,0.0001070712,0.00017971022],"domain_scores_gemma":[0.99916255,0.0003589146,0.00006769661,0.00031899466,0.000042450425,0.000049371894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033535037,0.000097943586,0.00016363358,0.00006442799,0.00006900702,0.000015148755,0.00018121945,0.00005555069,0.000023654697],"category_scores_gemma":[0.0001834896,0.00009282339,0.000057789723,0.00026054773,0.00005718704,0.00005102872,0.00002659234,0.000114512564,0.0000660381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030811075,0.0000949258,0.003743967,0.000015005666,0.000008373354,0.0000015521507,0.00020481003,0.0000011988269,0.00026175956,0.99449295,0.00089957117,0.00027278552],"study_design_scores_gemma":[0.00038053055,0.000021743726,0.003743373,0.000025985259,0.000009847558,0.000002616972,0.0000758466,0.00005531724,0.00076744717,0.992922,0.0018795552,0.00011575066],"about_ca_topic_score_codex":0.000010714123,"about_ca_topic_score_gemma":0.00001516587,"teacher_disagreement_score":0.0076863286,"about_ca_system_score_codex":0.000012995778,"about_ca_system_score_gemma":0.000009277257,"threshold_uncertainty_score":0.3785228},"labels":[],"label_agreement":null},{"id":"W2406309141","doi":"","title":"On the (Laplacian) spectral radius of bipartite graphs with given number of blocks.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Spectral radius; Combinatorics; RADIUS; Laplace operator; Graph; Mathematical analysis; Eigenvalues and eigenvectors; Computer science; Physics; Computer network","score_opus":0.02758121325164764,"score_gpt":0.25775508451875734,"score_spread":0.2301738712671097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406309141","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97087187,0.000008216152,0.000010835138,0.000073785915,0.000088756875,0.00022898678,0.000008227605,0.000026759815,0.028682567],"genre_scores_gemma":[0.9991542,0.0000035893652,0.00058492564,0.000020657828,0.0000018424763,0.00003161425,0.0000010105106,0.000015660822,0.0001864806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992899,0.000062688174,0.00021759162,0.00012645205,0.00015739894,0.00014601242],"domain_scores_gemma":[0.99888015,0.00033481923,0.00018727541,0.0004915682,0.00006633659,0.000039844384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024582667,0.00011170512,0.00019183071,0.000039883926,0.00006582487,0.000003953971,0.00025375455,0.000044568926,0.00033548658],"category_scores_gemma":[0.000049832746,0.000072069866,0.000083604544,0.0003011671,0.00021260073,0.000035447385,0.00002217186,0.00011714989,0.000022222051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068091744,0.00039744604,0.004208555,0.000018169476,0.00007272251,0.0000013121609,0.0010935466,2.0742894e-7,0.00032562471,0.99271286,0.0010793202,0.00002213944],"study_design_scores_gemma":[0.00039106782,0.00013412462,0.0018479736,0.000042083266,0.00005280719,0.0000045546517,0.00012752766,0.0000035682976,0.03744078,0.9597843,0.0000880141,0.00008319027],"about_ca_topic_score_codex":0.000017647519,"about_ca_topic_score_gemma":0.0000053941803,"teacher_disagreement_score":0.037115157,"about_ca_system_score_codex":0.000006166392,"about_ca_system_score_gemma":0.000016693584,"threshold_uncertainty_score":0.36733428},"labels":[],"label_agreement":null},{"id":"W2406396761","doi":"","title":"Computation of the edge Wiener indices of the sum of graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Computation; Enhanced Data Rates for GSM Evolution; Wiener index; Combinatorics; Graph; Algorithm; Computer science; Artificial intelligence","score_opus":0.03589183753706476,"score_gpt":0.26737686522212983,"score_spread":0.23148502768506507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406396761","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9959864,0.000027685259,0.000018441799,0.000032486427,0.0003027008,0.00020322473,0.0000074750565,0.000008580261,0.0034130309],"genre_scores_gemma":[0.9997336,0.0000022502102,0.0002065084,0.000010071596,0.0000010853599,0.000009557912,5.1777437e-7,0.000007082205,0.000029300718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999369,0.000092115544,0.00025569825,0.00007179003,0.0001432955,0.00006808114],"domain_scores_gemma":[0.99899334,0.00014385927,0.00038620725,0.00036319726,0.00010002754,0.000013355684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025166673,0.000062010295,0.00013474352,0.000033644013,0.00006061472,0.000001621825,0.00034968922,0.000043338514,0.000012321717],"category_scores_gemma":[0.00006349926,0.0000365554,0.00010867745,0.00035438294,0.00024705735,0.000036774614,0.000073606185,0.00006910276,8.754362e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005154899,0.00021920544,0.012472569,0.000053019485,0.000026243748,1.8627109e-8,0.0016950544,8.4948687e-7,0.0018405836,0.9834268,0.00018762276,0.00007285236],"study_design_scores_gemma":[0.00019004832,0.000020673719,0.036862727,0.000042982316,0.000040601575,3.5281613e-7,0.00015592632,0.000009118485,0.08006825,0.88255733,0.000018635208,0.000033362827],"about_ca_topic_score_codex":0.000025854779,"about_ca_topic_score_gemma":0.0000054617744,"teacher_disagreement_score":0.10086951,"about_ca_system_score_codex":0.0000035484095,"about_ca_system_score_gemma":0.000019841562,"threshold_uncertainty_score":0.14906861},"labels":[],"label_agreement":null},{"id":"W2406417745","doi":"","title":"On the Wiener index of rooted product of graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Index (typography); Combinatorics; Product (mathematics); Statistics; Discrete mathematics; Graph; Computer science; Geometry; World Wide Web","score_opus":0.019957228077385876,"score_gpt":0.2559265809331849,"score_spread":0.235969352855799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406417745","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99572486,0.000016034292,0.00000748771,0.0004079385,0.00012419632,0.00040067462,0.0000027608567,0.000022582526,0.0032934844],"genre_scores_gemma":[0.9996387,0.000002161805,0.00008280431,0.000031457646,0.0000017353332,0.00007899212,0.0000011144994,0.000010971733,0.00015210957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935865,0.000066692424,0.0002149463,0.000111951565,0.00014717724,0.00010055756],"domain_scores_gemma":[0.99870217,0.00042331527,0.00015817289,0.0005626278,0.00013014041,0.00002357213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002560273,0.0000799627,0.00014353932,0.000050317853,0.000052055635,0.000005515899,0.00024088673,0.000034449615,0.00013647154],"category_scores_gemma":[0.00023841824,0.000051823677,0.00006519753,0.00031792265,0.00012322863,0.000042656753,0.000031644493,0.0000961669,0.000020833188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048449187,0.00024347022,0.00091817364,0.000020367817,0.000025682044,5.3208755e-8,0.00016246634,0.0000010532546,0.0033624966,0.9907145,0.004398654,0.00014826929],"study_design_scores_gemma":[0.00017948727,0.00004004683,0.0051576905,0.000023035294,0.00001295956,3.5151385e-7,0.000042404154,0.000017828099,0.031074377,0.96332276,0.00007577132,0.00005328406],"about_ca_topic_score_codex":0.000023982226,"about_ca_topic_score_gemma":0.0000011039816,"teacher_disagreement_score":0.02771188,"about_ca_system_score_codex":0.0000042976444,"about_ca_system_score_gemma":0.00001228925,"threshold_uncertainty_score":0.21133082},"labels":[],"label_agreement":null},{"id":"W2406440815","doi":"","title":"Minimizing the least eigenvalue of bicyclic graphs with k pendant vertices.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Combinatorics; Bicyclic molecule; Chemistry; Medicinal chemistry; Physics","score_opus":0.03411369322353293,"score_gpt":0.2815135971341634,"score_spread":0.2473999039106305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406440815","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.994579,0.00020252253,0.000023498682,0.00014242485,0.00023977089,0.00025460578,0.000004313677,0.00004444155,0.0045094215],"genre_scores_gemma":[0.999071,0.000010649231,0.0006918726,0.00003935279,0.000007476011,0.000051343955,0.0000018422568,0.000022340528,0.000104134546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991059,0.00009323821,0.00022113942,0.00011897132,0.00019662417,0.00026417346],"domain_scores_gemma":[0.9987688,0.00043170477,0.00015817618,0.00050856435,0.00005511626,0.00007762359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047959885,0.00012654027,0.00017559172,0.000050125986,0.00018901734,0.000013493579,0.0002814777,0.000043911234,0.00005291783],"category_scores_gemma":[0.00007457305,0.0000797199,0.0000755726,0.00034133348,0.00017064507,0.00012202487,0.000048921,0.00013386887,0.000032321015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001683194,0.00025665932,0.0077602514,0.000030347284,0.00004842778,3.3775754e-7,0.0012319506,4.101251e-7,0.0012521079,0.98875725,0.00051724893,0.00012817349],"study_design_scores_gemma":[0.00042675284,0.00004810573,0.0052735214,0.00003755644,0.000113785245,0.0000100642355,0.0005685231,0.000011984278,0.010152795,0.9821341,0.0010932046,0.00012959812],"about_ca_topic_score_codex":0.000013599568,"about_ca_topic_score_gemma":0.000002949318,"teacher_disagreement_score":0.008900687,"about_ca_system_score_codex":0.000010678651,"about_ca_system_score_gemma":0.000018980307,"threshold_uncertainty_score":0.32508832},"labels":[],"label_agreement":null},{"id":"W2406468902","doi":"","title":"A function on bounds of the spectral radius of graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; RADIUS; Function (biology); Combinatorics; Computer science; Physics; Eigenvalues and eigenvectors; Computer network","score_opus":0.014209811686800767,"score_gpt":0.2554356070726158,"score_spread":0.24122579538581504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406468902","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9919047,0.0000052587966,0.0000061482383,0.00010607867,0.0009581392,0.00015888884,0.0000047767553,0.000021749076,0.0068342937],"genre_scores_gemma":[0.99968356,0.0000011515016,0.00012685091,0.000019215828,0.0000048985003,0.000013471786,8.6847507e-7,0.000009212081,0.00014079857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947256,0.000034750105,0.00017613146,0.00009147925,0.00013534735,0.00008971474],"domain_scores_gemma":[0.99913055,0.00017683339,0.0001435894,0.00047709068,0.00004809534,0.00002386671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022418251,0.00006989518,0.00011868055,0.00004242875,0.00007659741,0.0000050281315,0.0001983432,0.000057526133,0.000051938172],"category_scores_gemma":[0.000091907124,0.000050334922,0.00011262882,0.00025841044,0.0001405385,0.000027214792,0.000021379297,0.00018407522,0.00000487253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001893289,0.00023263658,0.0013348565,0.000015564088,0.00002056433,6.603125e-8,0.00012017315,2.0206336e-7,0.024163144,0.9732221,0.0007678213,0.00010396194],"study_design_scores_gemma":[0.00029671082,0.00007615774,0.009784748,0.0000115948005,0.00003326222,0.0000012743909,0.000026088837,0.00000471906,0.045442406,0.943819,0.00045770252,0.000046338864],"about_ca_topic_score_codex":0.000006431055,"about_ca_topic_score_gemma":0.000007639889,"teacher_disagreement_score":0.029403081,"about_ca_system_score_codex":0.0000045802235,"about_ca_system_score_gemma":0.000017744544,"threshold_uncertainty_score":0.20525984},"labels":[],"label_agreement":null},{"id":"W2406485966","doi":"","title":"On Randic index and the matching number.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Matching (statistics); Index (typography); Statistics; Combinatorics; Computer science; World Wide Web","score_opus":0.010943963129212479,"score_gpt":0.2666375419769148,"score_spread":0.25569357884770233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406485966","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9795995,0.000008164565,0.00027187917,0.0005478113,0.00018219979,0.00017569918,6.7321463e-7,0.000054523603,0.019159595],"genre_scores_gemma":[0.99940175,0.0000042354654,0.000089738714,0.00022474986,0.0000062046765,0.000038818973,6.857965e-7,0.000011736771,0.00022207906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999445,0.00012851499,0.00011447757,0.00011023533,0.00009818793,0.00010358074],"domain_scores_gemma":[0.9981452,0.0014637872,0.00005670539,0.0002854737,0.000014665973,0.00003412534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006405629,0.00007839111,0.00012739415,0.000015444151,0.00021813091,0.000032030603,0.00013135433,0.000038470058,0.000035628003],"category_scores_gemma":[0.00016377265,0.00005111647,0.0000386411,0.00008147865,0.00010763664,0.000029695004,0.000034559165,0.00013553633,0.00006473337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032049757,0.00003716113,0.0002113075,0.00000883521,0.000011302346,1.4693477e-7,0.00045105198,5.597913e-7,0.00000988156,0.9981398,0.00082646904,0.00027144994],"study_design_scores_gemma":[0.002008556,0.000009351755,0.00046628527,0.000015935639,0.000016190119,0.000003470007,0.00005830971,0.00010235463,0.000049742703,0.99658394,0.00062127295,0.0000646187],"about_ca_topic_score_codex":0.0000075300104,"about_ca_topic_score_gemma":0.0000011025969,"teacher_disagreement_score":0.019802295,"about_ca_system_score_codex":0.0000052937253,"about_ca_system_score_gemma":0.000003706989,"threshold_uncertainty_score":0.2084469},"labels":[],"label_agreement":null},{"id":"W2406672015","doi":"","title":"The Generalized Pell p-Sequences in Groups.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.05178874408818458,"score_gpt":0.3084652999284593,"score_spread":0.2566765558402747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406672015","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9899874,0.00018417697,0.000008829906,0.000779023,0.00062771543,0.00018946122,0.0000012181462,0.000052106807,0.008170099],"genre_scores_gemma":[0.99873406,0.0000242766,0.00040543516,0.000048924143,0.0000072861303,0.000067735506,0.0000017372511,0.000010417896,0.00070015417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992463,0.00012214668,0.00019024793,0.00012326712,0.00014305994,0.00017499442],"domain_scores_gemma":[0.9991371,0.00035036218,0.00006481332,0.00033344707,0.000049826394,0.000064468586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007872832,0.000082524275,0.00011036992,0.000028741995,0.000113611095,0.000037841193,0.00029245004,0.00004418068,0.000009938143],"category_scores_gemma":[0.00022585716,0.0000573501,0.00003821729,0.00024261887,0.00009288579,0.000062423926,0.000042642434,0.00010866678,0.0000670594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000836242,0.000059836457,0.0007893176,0.0000026733019,0.0000056647546,0.0000018478836,0.0004116697,0.0000011064934,0.000082102066,0.9930036,0.00551293,0.000120879355],"study_design_scores_gemma":[0.0005282421,0.000020203453,0.00018278773,0.000006085006,0.000006170086,0.0000024279598,0.00035235594,0.00005156388,0.00045703308,0.9913745,0.006940406,0.000078244026],"about_ca_topic_score_codex":0.000029567142,"about_ca_topic_score_gemma":0.00004616395,"teacher_disagreement_score":0.008746663,"about_ca_system_score_codex":0.000029664112,"about_ca_system_score_gemma":0.000034416436,"threshold_uncertainty_score":0.23386692},"labels":[],"label_agreement":null},{"id":"W2406793730","doi":"","title":"The minimal Kirchhoff index of graphs with k edge-disjoint cycles.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Disjoint sets; Enhanced Data Rates for GSM Evolution; Index (typography); Combinatorics; Computer science; Telecommunications","score_opus":0.014301038652346413,"score_gpt":0.25554152942606795,"score_spread":0.24124049077372153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406793730","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9905215,0.000031773867,0.00019181764,0.00028006182,0.00019017862,0.00023642283,0.0000031041725,0.000060699487,0.008484424],"genre_scores_gemma":[0.9992887,0.000005965672,0.00042948924,0.000027511265,0.000005619061,0.000056743094,0.0000016994485,0.00002187499,0.00016239074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990742,0.000100329,0.0002542648,0.0001646763,0.00020195353,0.0002045695],"domain_scores_gemma":[0.99828345,0.000769712,0.00017432602,0.0006085365,0.000098536126,0.00006546607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000550617,0.00012800893,0.00018840883,0.00004476832,0.00022820383,0.000023077204,0.00033297305,0.000057637524,0.000012590392],"category_scores_gemma":[0.00014491241,0.00008271916,0.00007973824,0.00026335006,0.0002873427,0.00004684127,0.000054528376,0.00014709901,0.000014572869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003293619,0.00014117341,0.003001148,0.000021653039,0.00003647008,3.1703254e-7,0.00018381397,8.0931864e-7,0.0002686981,0.99415946,0.0013162553,0.0008372776],"study_design_scores_gemma":[0.0005479926,0.00011041264,0.0053625004,0.000026854656,0.00003159504,0.000003409096,0.00015070269,0.0000617732,0.0026825324,0.98863477,0.0022753507,0.000112104724],"about_ca_topic_score_codex":0.000008360908,"about_ca_topic_score_gemma":0.00001140621,"teacher_disagreement_score":0.0087671885,"about_ca_system_score_codex":0.000009377416,"about_ca_system_score_gemma":0.000024008094,"threshold_uncertainty_score":0.33731896},"labels":[],"label_agreement":null},{"id":"W2406858909","doi":"","title":"The maximum Sum-Balaban index of trees with given diameter.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Statistics; Computer science","score_opus":0.014088627495174292,"score_gpt":0.24614539956981885,"score_spread":0.23205677207464456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406858909","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9949679,0.00003532641,0.000075153956,0.00048595114,0.000116635354,0.00037505577,0.0000039223955,0.00004780786,0.0038922823],"genre_scores_gemma":[0.9990201,0.0000075764146,0.00037760125,0.000018959363,0.0000035173184,0.00013313105,0.0000016462545,0.000018461002,0.00041901396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992911,0.00006256245,0.00019300065,0.0001260017,0.00015377872,0.00017353035],"domain_scores_gemma":[0.99859697,0.00060881855,0.00013419005,0.00050908263,0.00010016012,0.00005081088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019370508,0.000107304535,0.00015128615,0.000029904795,0.000161205,0.00003468391,0.00030442807,0.00004601871,0.000055937857],"category_scores_gemma":[0.00007028654,0.0000659911,0.000053435622,0.00020520393,0.00018882792,0.00008132721,0.000044081702,0.000106280146,0.000039271963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000943304,0.000119623626,0.0064772526,0.000011911293,0.00004459501,3.4342176e-7,0.00022837702,4.3920622e-7,0.0003720899,0.9889706,0.0027689359,0.0009964221],"study_design_scores_gemma":[0.00037644905,0.00008038838,0.010488637,0.000018750274,0.000021032727,0.0000017430898,0.00028580782,0.000023512743,0.0021433108,0.9853834,0.0010877242,0.00008927718],"about_ca_topic_score_codex":0.000040055562,"about_ca_topic_score_gemma":0.00003408301,"teacher_disagreement_score":0.0040522283,"about_ca_system_score_codex":0.000010249626,"about_ca_system_score_gemma":0.000017317321,"threshold_uncertainty_score":0.2691039},"labels":[],"label_agreement":null},{"id":"W2406975124","doi":"","title":"The exponents of double vertex graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.027384973600296222,"score_gpt":0.29142627137063637,"score_spread":0.26404129777034013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406975124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98911744,0.00007861835,0.000006767775,0.0003843484,0.0002954253,0.00018940568,0.0000015042382,0.00004806216,0.009878395],"genre_scores_gemma":[0.99945277,0.000022773911,0.00017382775,0.000035207202,0.0000012271114,0.000017964687,0.0000014457656,0.000006856934,0.00028791782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939066,0.000030471167,0.00019549787,0.000100257894,0.00013911413,0.00014399864],"domain_scores_gemma":[0.9991352,0.00023938727,0.00009366546,0.0004383861,0.000054310978,0.000039026414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027087764,0.00007752421,0.00011345228,0.000027828562,0.0001901016,0.000015046018,0.00028153975,0.00003982547,0.000013392853],"category_scores_gemma":[0.000042470023,0.000055962486,0.00007678126,0.00021425846,0.00006535226,0.000045978588,0.000020313908,0.000080124446,0.000019071218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023078128,0.00016288963,0.00014039896,0.000004029073,0.000014112775,3.1925185e-7,0.00012628309,1.1464568e-7,0.0010522391,0.99431944,0.0035559514,0.00060113514],"study_design_scores_gemma":[0.0006031056,0.000047776583,0.0013937592,0.000010837206,0.000016048165,0.0000010772252,0.00005433326,0.000006353486,0.00693744,0.9894499,0.001417366,0.00006200098],"about_ca_topic_score_codex":0.0000028534762,"about_ca_topic_score_gemma":8.687667e-7,"teacher_disagreement_score":0.010335306,"about_ca_system_score_codex":0.0000072193284,"about_ca_system_score_gemma":0.000010214952,"threshold_uncertainty_score":0.2282084},"labels":[],"label_agreement":null},{"id":"W2407019363","doi":"","title":"The Wiener-type indices of the corona of two graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Corona (planetary geology); Combinatorics; Physics; Geology; Astrobiology","score_opus":0.02840760911434877,"score_gpt":0.3027431880251227,"score_spread":0.2743355789107739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407019363","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9955014,0.00029843618,0.0000016718624,0.00009246779,0.0007172969,0.00017334576,0.0000038063206,0.000014474346,0.0031970826],"genre_scores_gemma":[0.999709,0.000020454207,0.000095304786,0.000017598803,0.0000048455872,0.000014289546,6.778795e-7,0.000009552095,0.00012824961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930865,0.00009869497,0.00021321148,0.00006246737,0.00016484284,0.00015214538],"domain_scores_gemma":[0.9985561,0.0005884715,0.00023931489,0.000507963,0.000075719465,0.000032449043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052964577,0.000073403025,0.000118402815,0.000020711257,0.00017444078,0.000005639562,0.00040166973,0.000034899844,0.000016324551],"category_scores_gemma":[0.00013431637,0.000041060117,0.00007994147,0.00033371442,0.00024229403,0.000060002134,0.00007886685,0.00009368642,0.00000536738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007030989,0.00014047485,0.013939308,0.00001379559,0.000029769888,2.1066308e-8,0.00042408484,2.0753556e-7,0.001517504,0.9831044,0.00063557184,0.00018782356],"study_design_scores_gemma":[0.00020636096,0.000023204051,0.007892274,0.000014481378,0.00003958408,0.000001196022,0.00014104498,0.0000020873144,0.016106974,0.9740837,0.0014422294,0.00004686265],"about_ca_topic_score_codex":0.000011806699,"about_ca_topic_score_gemma":0.0000051635498,"teacher_disagreement_score":0.01458947,"about_ca_system_score_codex":0.0000057826924,"about_ca_system_score_gemma":0.000017903832,"threshold_uncertainty_score":0.1674383},"labels":[],"label_agreement":null},{"id":"W2407122695","doi":"","title":"Unit distance representations of the Petersen graph in the plane.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Unit (ring theory); Combinatorics; Graph; Plane (geometry); Geometry; Mathematics education","score_opus":0.036970490430902496,"score_gpt":0.30514793856466876,"score_spread":0.26817744813376626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407122695","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9899111,0.000046243567,0.000021961314,0.00043365353,0.00024287515,0.00026280532,0.000011557761,0.000014136722,0.009055715],"genre_scores_gemma":[0.99965054,0.0000048554816,0.00009405072,0.0000496487,0.0000047127296,0.00005558791,0.0000032782566,0.000006543789,0.00013077114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931985,0.00016990761,0.00016831206,0.000069931324,0.00013654985,0.00013543785],"domain_scores_gemma":[0.99869156,0.0006184176,0.00009488048,0.00055188546,0.000022196364,0.000021047592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042305185,0.00006234935,0.000081801045,0.00002831831,0.000113795315,0.000008294461,0.0003435929,0.000027668633,0.000015171242],"category_scores_gemma":[0.00012034927,0.000037501217,0.00005619056,0.0004175305,0.000104078266,0.000067419875,0.00003431593,0.000121670986,0.000007430751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028122688,0.0001614809,0.029773979,0.0000094800835,0.000007247681,1.5485995e-7,0.002096417,6.639414e-7,0.00012364045,0.96679085,0.0010162592,0.000016997396],"study_design_scores_gemma":[0.00016550528,0.000004981724,0.060836833,0.000013253602,0.000017224602,0.0000026225584,0.0011203565,0.0000020999967,0.0005137906,0.936048,0.0012316597,0.00004368425],"about_ca_topic_score_codex":0.000016784088,"about_ca_topic_score_gemma":0.00002020251,"teacher_disagreement_score":0.031062854,"about_ca_system_score_codex":0.0000055775117,"about_ca_system_score_gemma":0.000008145891,"threshold_uncertainty_score":0.15292552},"labels":[],"label_agreement":null},{"id":"W2407188313","doi":"","title":"On the number of 5-matchings in boron-nitrogen fullerene graphs","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Boron; Fullerene; Combinatorics; Mathematics; Nitrogen; Chemistry; Organic chemistry","score_opus":0.03511994836403767,"score_gpt":0.2989461793533954,"score_spread":0.26382623098935776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407188313","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9842102,0.000016451397,0.0000052320183,0.0004068191,0.0001574026,0.00020116808,0.000005016442,0.000032001008,0.014965733],"genre_scores_gemma":[0.99952084,0.000002843369,0.00024588662,0.00008502363,0.0000021183455,0.000057759775,0.0000024581498,0.000015561765,0.00006749201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991992,0.000111814436,0.00022915292,0.00012697231,0.00018615977,0.00014670558],"domain_scores_gemma":[0.9987332,0.0006131268,0.00010656952,0.00042784403,0.000063642896,0.00005559108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063772284,0.00010397984,0.0001670468,0.00004273616,0.0000500588,0.0000100391435,0.00027590676,0.000055157743,0.000069129404],"category_scores_gemma":[0.00025050368,0.00007530246,0.00006547049,0.00029814272,0.00007045846,0.000042325846,0.00004696245,0.00014999806,0.00007582706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001890381,0.0002465569,0.0035893184,0.000008210293,0.000017005936,8.4504376e-7,0.0007702573,9.797353e-7,0.00007494423,0.99105734,0.0041758562,0.0000397947],"study_design_scores_gemma":[0.000496332,0.000026565822,0.00028132278,0.000025923791,0.000011474335,0.0000022571405,0.00030590405,0.000011931785,0.0017938945,0.99668574,0.00027770855,0.000080940816],"about_ca_topic_score_codex":0.000037130267,"about_ca_topic_score_gemma":0.0000062496783,"teacher_disagreement_score":0.01531068,"about_ca_system_score_codex":0.00001993718,"about_ca_system_score_gemma":0.00002715563,"threshold_uncertainty_score":0.30707452},"labels":[],"label_agreement":null},{"id":"W2407434981","doi":"","title":"A note on the Merrifield-Simmons index of connected graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Discrete mathematics; Computer science; World Wide Web","score_opus":0.031073673351009412,"score_gpt":0.289381530602243,"score_spread":0.25830785725123356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407434981","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98679394,0.000030306166,0.000048758237,0.00055650034,0.00038409603,0.00027161947,0.000007166149,0.00005837113,0.01184922],"genre_scores_gemma":[0.9996023,0.0000040414548,0.00007739407,0.0001379979,0.0000060804823,0.00006120896,0.0000020703653,0.00001525688,0.00009360324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999221,0.000111919835,0.00020512317,0.00010021712,0.00015515323,0.00020653656],"domain_scores_gemma":[0.9978553,0.0013697494,0.00012791817,0.0005270254,0.00005791671,0.00006210678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044056194,0.00010981879,0.00015804697,0.000055342593,0.00013407852,0.000007778566,0.00024613063,0.000082157596,0.000117804586],"category_scores_gemma":[0.00033268266,0.00007671587,0.00009550225,0.00032705857,0.00009689817,0.000051904342,0.0000375727,0.00019008169,0.000037271064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012770965,0.0003020645,0.0013955747,0.00000985774,0.00003183129,1.6542336e-7,0.0006158024,2.0335987e-7,0.00105398,0.9933445,0.0031376523,0.00009558293],"study_design_scores_gemma":[0.00025871492,0.000035832803,0.002205413,0.000018949084,0.000031015257,0.0000012653146,0.00014770473,0.000012817241,0.013475237,0.98258835,0.0011353192,0.00008940696],"about_ca_topic_score_codex":0.000010711877,"about_ca_topic_score_gemma":0.000002716754,"teacher_disagreement_score":0.012808384,"about_ca_system_score_codex":0.00000824204,"about_ca_system_score_gemma":0.000012991559,"threshold_uncertainty_score":0.31283823},"labels":[],"label_agreement":null},{"id":"W2407758378","doi":"","title":"On Optimal Orientations Of Tensor Product Of Graphs And Circulant Graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Circulant matrix; Tensor product; Combinatorics; Product (mathematics); Indifference graph; Discrete mathematics; Pure mathematics; Graph; Geometry","score_opus":0.02012450017543241,"score_gpt":0.28443272586301593,"score_spread":0.2643082256875835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407758378","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99831486,0.000046106474,0.000016637527,0.00014016441,0.00009502881,0.00028071098,0.00001616715,0.000034243138,0.0010560584],"genre_scores_gemma":[0.9986082,0.000015179046,0.0012907116,0.000022592627,0.0000011182541,0.000015934784,0.0000054663506,0.000008143116,0.000032672306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992726,0.000038957547,0.0002601527,0.00017262224,0.00014186643,0.00011381742],"domain_scores_gemma":[0.9991565,0.00019173656,0.0001539951,0.00034451386,0.00010779601,0.000045465607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018965449,0.00009919149,0.00020135372,0.00012199782,0.00007219302,0.0000056368935,0.00011290651,0.00003479581,0.000011457069],"category_scores_gemma":[0.00013594388,0.00008973334,0.00006861325,0.00035741838,0.00011359276,0.000046514946,0.000012357637,0.00007851755,0.0000016689036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019137511,0.0004627233,0.00075802556,0.000030482395,0.000025343992,7.8187526e-7,0.00039206218,0.0000030551864,0.004943768,0.99270123,0.00043253324,0.00023083687],"study_design_scores_gemma":[0.00044475574,0.00019852577,0.008069553,0.000031800584,0.00004639305,0.0000045756783,0.00009675769,0.000009707219,0.014995946,0.9759966,0.00002086991,0.00008451978],"about_ca_topic_score_codex":0.0000031746602,"about_ca_topic_score_gemma":3.2390133e-7,"teacher_disagreement_score":0.016704654,"about_ca_system_score_codex":0.0000046134974,"about_ca_system_score_gemma":0.000013883514,"threshold_uncertainty_score":0.36592194},"labels":[],"label_agreement":null},{"id":"W2407866540","doi":"","title":"The Second-minimum Gutman Index of The Unicyclic Graphs With Given Girth","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Girth (graph theory); Combinatorics","score_opus":0.023401138733837396,"score_gpt":0.2644847689060365,"score_spread":0.2410836301721991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407866540","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9866538,0.000055062374,0.000010999435,0.0005217451,0.00029377828,0.0003351738,0.000007666103,0.000040610103,0.012081161],"genre_scores_gemma":[0.9980653,0.0000034505563,0.00006437737,0.00005308841,0.000004200222,0.000051052386,0.0000011116972,0.000020435418,0.001736983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990144,0.00017914915,0.00022601438,0.00014578701,0.00024557326,0.0001891082],"domain_scores_gemma":[0.9982048,0.0005017946,0.00020934382,0.00087792124,0.00012954265,0.00007657891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059309136,0.00012655681,0.00015867659,0.000031677904,0.00029043521,0.000024814964,0.00062251056,0.0000602146,0.000017831439],"category_scores_gemma":[0.000089435125,0.00006683574,0.00007988822,0.00043084566,0.00030746282,0.00005822008,0.000105104446,0.00023074285,0.00001116646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018190405,0.00009785479,0.003229766,0.000010686751,0.00004781092,3.9882653e-7,0.0005411717,6.777686e-7,0.000075995216,0.9908199,0.005029389,0.00012821663],"study_design_scores_gemma":[0.000688437,0.00007073076,0.0024375075,0.000020798954,0.000028360535,0.0000045132883,0.00079257594,0.000023263883,0.0014779234,0.98517984,0.009180913,0.000095115596],"about_ca_topic_score_codex":0.000007992755,"about_ca_topic_score_gemma":0.00007750761,"teacher_disagreement_score":0.011411497,"about_ca_system_score_codex":0.000016980403,"about_ca_system_score_gemma":0.0000687957,"threshold_uncertainty_score":0.27254823},"labels":[],"label_agreement":null},{"id":"W2408410163","doi":"","title":"The extremal primitive digraph with both Lewin index n-2 and girth 2 or 3.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Mathematics; Index (typography); Girth (graph theory); Combinatorics; Discrete mathematics; Computer science","score_opus":0.017387574524466425,"score_gpt":0.2572090345658944,"score_spread":0.23982146004142796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408410163","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.992211,0.000046142355,0.0003406723,0.00027395322,0.000103491046,0.0003155036,0.0000030981507,0.00008217912,0.006623961],"genre_scores_gemma":[0.9987126,0.000019200923,0.0002971981,0.000063976455,0.000007904007,0.0000766705,0.0000013614871,0.000020941816,0.00080015353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920785,0.0000980659,0.00014702919,0.00019376636,0.00014768742,0.00020559994],"domain_scores_gemma":[0.99837244,0.0010246563,0.00009537099,0.00038484362,0.000049009792,0.000073693795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003700941,0.00013599388,0.00014955385,0.00003208871,0.00040676928,0.00006085913,0.0001832327,0.00005251408,0.000011710258],"category_scores_gemma":[0.00013722059,0.00007600046,0.000031637737,0.0002016733,0.0002314214,0.00007494073,0.000048926977,0.00014705831,0.0000063497478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007275194,0.000075504126,0.0029200707,0.000011750979,0.00003312261,0.0000011014279,0.00032763323,1.5547614e-7,0.00004993827,0.99462044,0.0005567377,0.001330819],"study_design_scores_gemma":[0.00077458494,0.00014000584,0.0078222975,0.000025532812,0.000031520183,0.000010750871,0.00029963301,0.0000561835,0.00029968112,0.98441935,0.0059861164,0.00013433564],"about_ca_topic_score_codex":0.0000062655113,"about_ca_topic_score_gemma":0.000041686275,"teacher_disagreement_score":0.0102010565,"about_ca_system_score_codex":0.000008207217,"about_ca_system_score_gemma":0.000022905295,"threshold_uncertainty_score":0.31285816},"labels":[],"label_agreement":null},{"id":"W2408455752","doi":"","title":"Spectral radius of graph with given diameter.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Graph; Combinatorics; Physics; Eigenvalues and eigenvectors; Quantum mechanics","score_opus":0.03305815472178219,"score_gpt":0.2529730904398955,"score_spread":0.21991493571811332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408455752","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98355526,0.000020900165,0.00016439585,0.000026107626,0.00012182691,0.00018650014,0.000005467265,0.00005914401,0.015860379],"genre_scores_gemma":[0.99311304,0.0000043602067,0.006707937,0.000010892626,0.0000025779595,0.000027477667,0.0000015293339,0.000017426977,0.00011474135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940914,0.000038729555,0.00016473529,0.00013519291,0.00010430284,0.0001478818],"domain_scores_gemma":[0.9992933,0.000118881624,0.00010860727,0.00037945842,0.000044653556,0.00005505221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014534543,0.00009951499,0.00017156561,0.000059336875,0.000050911058,0.000004693646,0.0001988693,0.000040309453,0.00011317062],"category_scores_gemma":[0.000025597872,0.00008134871,0.00006611535,0.0002353993,0.00012888199,0.00005766701,0.000020918249,0.00008671307,0.000014148507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028078939,0.00027443923,0.0029779852,0.00002058492,0.0000490956,0.000002869642,0.0008570329,6.389473e-8,0.00047729668,0.99476105,0.00046897944,0.00008253467],"study_design_scores_gemma":[0.00045114852,0.00016994376,0.0039423993,0.000019311869,0.000045735527,0.000005523928,0.000098024444,0.0000016680264,0.022301102,0.9727702,0.00009287389,0.00010206556],"about_ca_topic_score_codex":0.00001658434,"about_ca_topic_score_gemma":0.0000042768984,"teacher_disagreement_score":0.021990834,"about_ca_system_score_codex":0.000007023883,"about_ca_system_score_gemma":0.000013205778,"threshold_uncertainty_score":0.33173043},"labels":[],"label_agreement":null},{"id":"W2408639442","doi":"","title":"Extremal Zagreb indices of unicyclic graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Statistics","score_opus":0.021593084862577064,"score_gpt":0.2880633975609883,"score_spread":0.26647031269841126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408639442","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9911183,0.000020873877,0.0000077853065,0.000074825315,0.00052045233,0.00015638054,0.00000647229,0.000072398514,0.008022485],"genre_scores_gemma":[0.9985101,0.000005446315,0.0012546798,0.000019303821,0.000005269466,0.00001030218,0.0000035519251,0.00001658691,0.00017471258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992547,0.000038747232,0.00024409305,0.00015471528,0.00014893645,0.00015879763],"domain_scores_gemma":[0.99885887,0.0003338316,0.00016956385,0.00050852407,0.00006126846,0.00006794383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003117522,0.00010838058,0.00017931491,0.00009747361,0.00009393707,0.000011905183,0.0003239287,0.000102853315,0.00015345488],"category_scores_gemma":[0.00012026151,0.00009994581,0.00009166566,0.00032439313,0.00015648743,0.00007728273,0.000052879026,0.00023745948,0.000028683286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036915953,0.00021416419,0.00264364,0.00001892123,0.000021918058,8.066075e-7,0.00028917604,2.7035389e-8,0.013086868,0.9825301,0.0005161006,0.00067457376],"study_design_scores_gemma":[0.00033179234,0.000028645909,0.0027701003,0.000010980868,0.000029246145,0.000003933481,0.000093429146,0.000008806237,0.014144712,0.98165524,0.00081910583,0.00010402924],"about_ca_topic_score_codex":0.000009012728,"about_ca_topic_score_gemma":0.000015832573,"teacher_disagreement_score":0.007847773,"about_ca_system_score_codex":0.0000034063776,"about_ca_system_score_gemma":0.000019975325,"threshold_uncertainty_score":0.4075672},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7801078,0.000023809853,0.20759942,0.00602022,0.00029289923,0.0016716067,0.00050861906,0.000121307894,0.003654344],"genre_scores_gemma":[0.9881105,0.00006175653,0.010709742,0.00022284768,0.00004071043,0.00021198759,0.0000022982715,0.00005481806,0.0005853527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764156,0.00033076532,0.0008113108,0.00035610926,0.00057429075,0.0002859312],"domain_scores_gemma":[0.99543476,0.0011891007,0.001293262,0.0018660519,0.00014374676,0.000073106436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069648196,0.0003492827,0.00071002834,0.000045922847,0.00032563615,0.000018075167,0.0011917682,0.00016762242,0.00019809078],"category_scores_gemma":[0.00013447586,0.00017783526,0.0020419606,0.0005570946,0.0022451596,0.00004012207,0.00012290881,0.0006076426,0.000009831577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033262782,0.00060336513,0.000055895678,0.00041880013,0.00058545655,3.0199487e-8,0.0017308058,0.00023236225,0.0053028897,0.98872954,0.0010886897,0.0012188945],"study_design_scores_gemma":[0.00017770156,0.000042168933,0.00026717485,0.00042042191,0.000542193,0.000002014503,0.00043819394,0.00040221078,0.024341274,0.97307783,0.00008746809,0.00020136482],"about_ca_topic_score_codex":0.000022339475,"about_ca_topic_score_gemma":0.00000446683,"teacher_disagreement_score":0.20800272,"about_ca_system_score_codex":0.00006655128,"about_ca_system_score_gemma":0.00008677574,"threshold_uncertainty_score":0.8272384},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97828615,0.0011169147,0.01747794,0.0012061539,0.00013492363,0.00015137828,0.000003350764,0.000039413215,0.001583753],"genre_scores_gemma":[0.9929096,0.000054135646,0.0060777073,0.000118219556,0.0002635407,0.000005359547,0.000004434174,0.000021483436,0.0005455009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866503,0.0001101504,0.00046666607,0.00008965817,0.0003529121,0.00031559702],"domain_scores_gemma":[0.9988353,0.00015752082,0.00034689927,0.00018558705,0.0003290146,0.00014567797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014772911,0.000115172006,0.00022898716,0.0001291719,0.00008519606,0.000018387145,0.00026316612,0.000061678315,0.000097593045],"category_scores_gemma":[0.00026251463,0.00009489631,0.00017702306,0.00027218103,0.00005428202,0.00017762366,0.000020475709,0.00038312934,0.000029354278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007112478,0.0001151791,0.000097644166,0.0000053929853,0.00009984632,0.000003832359,0.00021323904,0.000018456545,0.0011081015,0.99426156,0.003822086,0.00018353976],"study_design_scores_gemma":[0.0009812728,0.0001966146,0.000028662998,0.000014187003,0.00006622722,0.00027246954,0.000121446305,0.00010139352,0.0044209133,0.9773978,0.016297057,0.000101945116],"about_ca_topic_score_codex":0.0000011349154,"about_ca_topic_score_gemma":0.0000045588417,"teacher_disagreement_score":0.016863748,"about_ca_system_score_codex":0.00007055825,"about_ca_system_score_gemma":0.00046720175,"threshold_uncertainty_score":0.38697594},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9542826,0.000636618,0.044013485,0.0007111652,0.000030168501,0.00016863414,0.00002585049,0.000010259658,0.00012124696],"genre_scores_gemma":[0.99489444,0.000249053,0.0046242634,0.000028397093,0.00011685152,0.0000052571218,0.0000012168376,0.0000146212815,0.000065878114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905044,0.00005862107,0.00043129493,0.00009503431,0.00011598943,0.00024862887],"domain_scores_gemma":[0.9987225,0.00050395867,0.00039053854,0.00016338596,0.00014630961,0.00007331843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008181944,0.00009433736,0.0002640275,0.000086929926,0.000061537954,0.0000072430416,0.00016112559,0.000047127058,0.000031131443],"category_scores_gemma":[0.00015513,0.000059376394,0.000102106285,0.00008891628,0.00011224446,0.00012760797,0.000012057069,0.00011158175,8.7424587e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010769539,0.00012140667,0.00019194922,0.000016270224,0.00009887463,7.0685144e-7,0.00011134063,3.5736625e-7,0.018258933,0.97734576,0.00014888891,0.0035977918],"study_design_scores_gemma":[0.0010804828,0.0007969387,0.00009939147,0.000061205596,0.000090449124,0.000050788334,0.00011724886,0.00002559228,0.015443522,0.9804503,0.0017010786,0.00008304485],"about_ca_topic_score_codex":9.764931e-7,"about_ca_topic_score_gemma":0.000026968428,"teacher_disagreement_score":0.04061189,"about_ca_system_score_codex":0.000023222628,"about_ca_system_score_gemma":0.00014190315,"threshold_uncertainty_score":0.2421299},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83986074,0.00005606204,0.036557335,0.00047796374,0.00033254878,0.00060204737,0.000049425544,0.00018505412,0.1218788],"genre_scores_gemma":[0.9714683,0.0000038266567,0.0071124216,0.0001160615,0.0001499331,0.000010804706,0.00001393313,0.00002141418,0.021103295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983675,0.00019736678,0.00020921219,0.0004467353,0.00044366083,0.00033551254],"domain_scores_gemma":[0.99869496,0.00017788321,0.000121049045,0.0005844399,0.00020686918,0.00021479862],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003173147,0.00024185286,0.00019967106,0.0001969696,0.0018749859,0.00007358718,0.00044814052,0.00010520962,0.00006631772],"category_scores_gemma":[0.000117638854,0.00019973703,0.0001344452,0.0007157381,0.00044148095,0.00022897108,0.00007391397,0.0002706362,0.00006516338],"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.000074188785,0.0001742061,0.002672235,0.000017769526,0.00008430588,0.0003482523,0.000146751,0.00070268643,0.001147816,0.99387854,0.00070620375,0.00004702876],"study_design_scores_gemma":[0.001894856,0.00029778737,0.017813332,0.00029519366,0.0004377854,0.0020801525,0.0017558524,0.00020402078,0.0069632796,0.03489854,0.93211514,0.0012440793],"about_ca_topic_score_codex":0.000031912,"about_ca_topic_score_gemma":0.0001236947,"teacher_disagreement_score":0.95898,"about_ca_system_score_codex":0.00022516564,"about_ca_system_score_gemma":0.00039367596,"threshold_uncertainty_score":0.99942446},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76177394,0.000011377838,0.0924602,0.0004481905,0.000097916636,0.0012440282,0.000051565836,0.0004041247,0.14350866],"genre_scores_gemma":[0.8910044,0.0000049524187,0.10790801,0.00006858047,0.0000740385,0.000248891,0.000010832879,0.0000889505,0.00059137825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984266,0.000013494925,0.00043714754,0.00037510679,0.0003268931,0.00042076447],"domain_scores_gemma":[0.99712604,0.0002795551,0.00055669225,0.0018385332,0.000051689993,0.00014748173],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004231134,0.0003552029,0.0004624708,0.000086815824,0.0010389116,0.0003245966,0.0009070519,0.00012573857,0.0001011755],"category_scores_gemma":[0.00007814147,0.00026498025,0.00013994491,0.00009281097,0.00036990407,0.0001855718,0.00020652394,0.00030982573,0.00012328624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000326166,0.00014204164,0.000028878398,0.00015547597,0.000084096835,0.0000035631801,0.001657678,0.000002853605,0.005776608,0.9907922,0.00089558086,0.00042840498],"study_design_scores_gemma":[0.00063500815,0.00002835812,0.00008966835,0.00010423791,0.00013806157,0.000019474663,0.00137978,0.00008421278,0.0069921967,0.98953927,0.00058579433,0.00040392426],"about_ca_topic_score_codex":0.000009342534,"about_ca_topic_score_gemma":0.000015988517,"teacher_disagreement_score":0.14291728,"about_ca_system_score_codex":0.000022076136,"about_ca_system_score_gemma":0.00003056436,"threshold_uncertainty_score":0.9999802},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011682547,0.00051202223,0.00023307835,0.0001281195,0.00042336984,0.0008813174,0.00012494961,0.00019748311,0.98581713],"genre_scores_gemma":[0.22585796,7.621261e-7,0.0005845131,0.000095510324,0.00006719734,0.000018375236,0.000036715195,0.000067126275,0.77327186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982329,0.000020010679,0.00033275204,0.0006853416,0.0003274078,0.00040156834],"domain_scores_gemma":[0.9986416,0.000081146136,0.00023152912,0.00083533156,0.0000865426,0.00012385666],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033127883,0.00036111983,0.0003934625,0.0003324665,0.0003905581,0.00020968083,0.00033275093,0.0001871032,0.00044706897],"category_scores_gemma":[0.000009694539,0.00034493662,0.00015977459,0.0000527854,0.0006386659,0.000025837187,0.000106510925,0.00057899265,0.00004106388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003802468,0.0000074445193,4.809446e-7,0.000054639273,0.000052217263,0.000010719129,0.00016363263,2.8212025e-7,0.0026169594,0.99322885,0.0032394084,0.0006215516],"study_design_scores_gemma":[0.00014985885,0.0000118464895,6.1660285e-7,0.00009971868,0.00009979496,0.000013799201,0.0000060404095,9.3016e-7,0.0015666226,0.7292926,0.26850435,0.00025383782],"about_ca_topic_score_codex":7.1973125e-7,"about_ca_topic_score_gemma":0.00044325774,"teacher_disagreement_score":0.26526493,"about_ca_system_score_codex":0.000076162214,"about_ca_system_score_gemma":0.0001276893,"threshold_uncertainty_score":0.9999003},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003145387,0.00012832359,0.003319951,0.0003751498,0.000018256416,0.000843931,0.000038001286,0.00043493128,0.99169606],"genre_scores_gemma":[0.005471216,0.00010752021,0.12244275,0.0016798998,0.0004423348,0.00020620922,0.000031155367,0.00023955353,0.86937934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979851,0.00007160684,0.00056301506,0.0005665547,0.00037132416,0.0004423913],"domain_scores_gemma":[0.99697655,0.0015620145,0.00046893183,0.00068723847,0.00006051207,0.0002447608],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037268264,0.0005479147,0.001010542,0.000046781723,0.00026269807,0.00007687874,0.00036145258,0.0002709228,0.00011461011],"category_scores_gemma":[0.00012357588,0.0004761078,0.00059144036,0.000064377375,0.0018992302,0.000034542045,0.00014694524,0.00060598203,0.00009266952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003087774,0.000074160496,9.086344e-7,0.00024157824,0.00017976327,0.0000019303163,0.0013541756,2.6147841e-8,0.000030334397,0.95061314,0.038531672,0.008969193],"study_design_scores_gemma":[0.00014804526,0.00009231325,0.000014732675,0.00023094271,0.0002733659,0.00002251589,0.00059170445,0.000030895724,0.000044125376,0.9830778,0.014984174,0.00048938487],"about_ca_topic_score_codex":0.0000014559072,"about_ca_topic_score_gemma":0.0000010384463,"teacher_disagreement_score":0.12231671,"about_ca_system_score_codex":0.00007519016,"about_ca_system_score_gemma":0.00010456645,"threshold_uncertainty_score":0.99976903},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009777973,0.020465704,0.00027164049,0.004521594,0.0009416096,0.0047156285,0.00016303732,0.0003841369,0.95875865],"genre_scores_gemma":[0.21183655,0.0899882,0.025080115,0.0010085682,0.0015547276,0.0015067805,0.00005446566,0.00088855845,0.66808206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981642,0.00008028223,0.0007534168,0.00030435197,0.00034082864,0.00035695377],"domain_scores_gemma":[0.9947117,0.00372799,0.00055486895,0.000824955,0.000120261066,0.000060217164],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020787737,0.00052030425,0.0010483075,0.00013876501,0.0002596381,0.00003131463,0.00036657567,0.0001778934,0.000031318683],"category_scores_gemma":[0.0006014174,0.0003172786,0.00020895261,0.000069804984,0.0018385807,0.00006117425,0.00036089678,0.0006054452,0.00008550877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014636492,0.000046791123,0.0000015274996,0.0005322188,0.00035446318,0.0000036392219,0.012335221,6.5098e-8,0.0000012231357,0.98390883,0.0021836772,0.00061768456],"study_design_scores_gemma":[0.0005359253,0.000010301756,0.000007455489,0.000528508,0.00041691842,0.000023117122,0.0011821183,0.000012675767,0.000006212918,0.99062836,0.0063067493,0.00034162807],"about_ca_topic_score_codex":6.0866e-7,"about_ca_topic_score_gemma":0.000005332982,"teacher_disagreement_score":0.29067662,"about_ca_system_score_codex":0.000048443362,"about_ca_system_score_gemma":0.000010770652,"threshold_uncertainty_score":0.99992794},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073313937,0.00073476706,0.0023139205,0.00090298854,0.000129364,0.0025369334,0.00027724457,0.00025073616,0.9855226],"genre_scores_gemma":[0.05504103,0.009588151,0.08868624,0.00020706233,0.00023648991,0.00054923375,0.00027171595,0.00033730248,0.84508276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983484,0.00003444938,0.0005548067,0.00038231205,0.0004675162,0.000212473],"domain_scores_gemma":[0.99830556,0.00052064017,0.00038774585,0.00041259988,0.0002972986,0.0000761409],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023447728,0.00039721763,0.0005442895,0.00022065136,0.00016163112,0.000033590037,0.0002515683,0.00029392238,0.00011414117],"category_scores_gemma":[0.00015543951,0.00037590475,0.00009492334,0.000059399514,0.00063527055,0.00016171619,0.00010290261,0.00041790455,0.000026889384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024239527,0.000081046106,0.0000076253023,0.0003019027,0.000059681068,0.000012949347,0.0033851555,5.1698623e-7,0.000008940304,0.99316335,0.0023565455,0.0005980308],"study_design_scores_gemma":[0.00017970178,0.0000571117,0.00003065099,0.0006212333,0.000043641023,0.00015445208,0.00057431863,0.00002796921,0.000022966091,0.9715101,0.026415309,0.00036255966],"about_ca_topic_score_codex":0.0000025556715,"about_ca_topic_score_gemma":0.00004141821,"teacher_disagreement_score":0.14043988,"about_ca_system_score_codex":0.00006326154,"about_ca_system_score_gemma":0.00021054734,"threshold_uncertainty_score":0.9998693},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9784232,0.000011325654,0.005233396,0.00507373,0.00017284014,0.00028732608,0.0000076170445,0.000030098663,0.0107605],"genre_scores_gemma":[0.9990272,0.0000026593298,0.0000773771,0.00020407814,0.000092423244,0.000026146214,1.330098e-7,0.000006952686,0.00056304235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949574,0.00010203233,0.00012954549,0.00009093245,0.00007993879,0.000101801656],"domain_scores_gemma":[0.9977008,0.001527467,0.00007799051,0.00065495825,0.00002257511,0.000016202299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004001069,0.00005607272,0.00007124217,0.0000054111238,0.00010911679,0.0000041346498,0.00026258783,0.00005136408,0.00011737425],"category_scores_gemma":[0.00024541863,0.000020597161,0.00008140253,0.00009173997,0.00013525618,0.000012927074,0.00004566007,0.000095015435,0.0000126602845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018031078,0.00005179729,0.0005559642,0.0000025154752,0.000006774497,2.5983407e-8,0.000029612596,0.000087263405,0.00033396337,0.9719217,0.025826791,0.0011655875],"study_design_scores_gemma":[0.00014377656,0.0000124055705,0.005782986,0.000049407754,0.000015615566,4.7145176e-7,0.000010805807,0.00026765664,0.0012448101,0.9887306,0.0036914633,0.00005000899],"about_ca_topic_score_codex":0.0000025362374,"about_ca_topic_score_gemma":0.000008360234,"teacher_disagreement_score":0.022135327,"about_ca_system_score_codex":0.000009848398,"about_ca_system_score_gemma":0.000008317102,"threshold_uncertainty_score":0.12851657},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010825444,0.00008051708,0.00016156105,0.000098951175,0.000025044208,0.00025715542,0.000018451032,0.00014056715,0.9883923],"genre_scores_gemma":[0.060531713,0.00016530327,0.0036854292,0.00020647873,0.000026804113,0.000010373077,0.000025907108,0.00005777351,0.9352902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943876,0.0000056966182,0.00016683563,0.00020328505,0.00008625636,0.00009919248],"domain_scores_gemma":[0.99927956,0.0002472705,0.000087794106,0.00030192244,0.000017294125,0.00006618746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006806385,0.00022157107,0.00024498394,0.00010723049,0.00006764698,0.000019838077,0.00009463466,0.00018967167,0.00026921523],"category_scores_gemma":[0.000014200152,0.00016025748,0.00012354416,0.000016310918,0.00009461677,0.000023351957,0.000018765699,0.00017191246,0.000018961071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.900999e-7,0.000007422636,0.00001140487,0.0000144515625,0.000032743228,5.052788e-7,0.000035375684,1.4926414e-8,0.0000036946283,0.99715745,0.0012095976,0.001526432],"study_design_scores_gemma":[0.00004365278,0.000021011854,0.000039733353,0.000027925973,0.00007511102,0.000001751639,0.000014598476,6.034749e-7,0.000044734454,0.9663072,0.033243567,0.00018006617],"about_ca_topic_score_codex":0.000001013592,"about_ca_topic_score_gemma":0.000007671941,"teacher_disagreement_score":0.05310209,"about_ca_system_score_codex":0.0000048250517,"about_ca_system_score_gemma":0.0000055801115,"threshold_uncertainty_score":0.65351105},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97447854,0.00011957421,0.014778473,0.002997303,0.0000842478,0.00035457255,0.00004572561,0.0003159137,0.0068256743],"genre_scores_gemma":[0.9784185,0.00008756981,0.0051132464,0.00019894702,0.00010521214,0.00008327551,0.0000032921146,0.000027037033,0.015962912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988694,0.00010477351,0.00031895246,0.00026488892,0.00015728874,0.0002846966],"domain_scores_gemma":[0.9984364,0.0008705464,0.000099558165,0.0003975445,0.00007163885,0.0001243269],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00031021234,0.00018640532,0.00024497203,0.00006958702,0.00016188799,0.0000447818,0.0001475628,0.000076785574,0.0015501211],"category_scores_gemma":[0.00021811113,0.0001116074,0.00007551581,0.00010039405,0.00022307491,0.00017051987,0.00007862951,0.00006670899,0.0001487072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027642916,0.000089201414,0.0017384709,0.000041913336,0.000030313327,0.0000027433052,0.0002554996,2.5849758e-8,0.010568884,0.9811387,0.0052694133,0.00083721324],"study_design_scores_gemma":[0.000775224,0.000053324384,0.00041505214,0.000054834243,0.0000437616,0.000017976508,0.00067093887,0.000020786083,0.010417946,0.9739986,0.01329566,0.00023590095],"about_ca_topic_score_codex":0.000011570332,"about_ca_topic_score_gemma":0.000015671834,"teacher_disagreement_score":0.0096652275,"about_ca_system_score_codex":0.000015557796,"about_ca_system_score_gemma":0.0000194478,"threshold_uncertainty_score":0.9993626},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9960032,0.00009169705,0.0002492428,0.002091038,0.000025325782,0.000027790531,0.000025255278,0.0000016753577,0.0014847856],"genre_scores_gemma":[0.99952286,0.0000018955926,0.0001384257,0.000094001436,0.00004285723,9.4868193e-7,1.7483356e-7,0.0000062403046,0.0001925792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995763,0.000018031256,0.00017227595,0.000044037683,0.0000892486,0.00010015489],"domain_scores_gemma":[0.9991875,0.0001937673,0.00017001046,0.00022029883,0.000067959234,0.00016045052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017903454,0.000056982684,0.000098487224,0.000021178992,0.000047614958,0.0000072629405,0.00025679552,0.000047123078,0.00042609996],"category_scores_gemma":[0.00035591007,0.00003063038,0.0000871082,0.00004662424,0.00013766516,0.000024640267,0.0000043330474,0.00010269659,0.0000011369748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044340677,0.0000072235757,0.000039342187,0.00001976497,0.000034069697,0.000011730287,0.000056668243,0.0000010185772,0.22466776,0.77300996,0.001552136,0.0005959182],"study_design_scores_gemma":[0.000069001166,0.0000046070973,0.00005304134,0.00004191395,0.0000087755525,0.000022838705,0.000026963757,1.1967677e-7,0.3703179,0.62897253,0.00045651043,0.000025795567],"about_ca_topic_score_codex":0.000016172298,"about_ca_topic_score_gemma":0.000026377986,"teacher_disagreement_score":0.14565013,"about_ca_system_score_codex":0.000027038994,"about_ca_system_score_gemma":0.00022167282,"threshold_uncertainty_score":0.46654958},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98797524,0.00005611652,0.0005495443,0.001921178,0.000029068631,0.00005803073,0.000034438104,0.000005248432,0.0093711605],"genre_scores_gemma":[0.9966203,0.0000019311851,0.0011980365,0.00010947653,0.00019461811,0.0000050834155,6.604497e-7,0.000014723833,0.0018551786],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992361,0.0000116713745,0.00024751565,0.00010540345,0.00017029847,0.00022899556],"domain_scores_gemma":[0.99862546,0.00011707002,0.00020867183,0.00020329529,0.00012223644,0.0007232972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000256046,0.00010573487,0.00015409214,0.00008161527,0.000101622434,0.000031113377,0.00031294583,0.000052481595,0.00068301],"category_scores_gemma":[0.00018032675,0.00006921497,0.00006335985,0.00012576538,0.000093960065,0.0000757688,0.000010843958,0.00013072598,0.000013271581],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005560874,0.000271899,0.06429972,0.00035940137,0.0006851222,0.0026170788,0.006408578,0.000007346639,0.5970123,0.21884365,0.091262266,0.017676584],"study_design_scores_gemma":[0.0031090102,0.00033393517,0.016452642,0.0016348005,0.00020025764,0.004965224,0.0026813718,0.0000013780946,0.5672155,0.34874108,0.053641655,0.0010231324],"about_ca_topic_score_codex":0.00006214981,"about_ca_topic_score_gemma":0.0036655157,"teacher_disagreement_score":0.12989742,"about_ca_system_score_codex":0.00013641556,"about_ca_system_score_gemma":0.0006887714,"threshold_uncertainty_score":0.74784803},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027586235,0.000054217457,0.0005840451,0.000027526481,0.00004804937,0.00040000235,0.00022112769,0.00023617716,0.998153],"genre_scores_gemma":[0.0010556031,0.000045427543,0.00050702837,0.000084406645,0.00008823826,0.0000012803121,0.00004856811,0.00004292325,0.9981265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99898756,0.000042990894,0.00020404211,0.00032954672,0.00018735915,0.0002485031],"domain_scores_gemma":[0.9987314,0.00023317663,0.00022887082,0.00059131376,0.00010587838,0.00010940455],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000120373195,0.00031620575,0.0003804453,0.00015100493,0.00020412642,0.000029491608,0.0003926009,0.0002545514,0.000010320739],"category_scores_gemma":[0.000017694863,0.00037030745,0.00021560602,0.000008115354,0.00016948952,0.000048246322,0.00009561055,0.00039639111,0.000020078067],"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.000028576947,0.000012697258,7.493692e-8,0.00008240828,0.00007902973,0.00003767653,0.00006510041,1.02361625e-7,0.000043060034,0.94928694,0.049684428,0.0006799288],"study_design_scores_gemma":[0.0002640116,0.000051444953,0.0000011665944,0.00011645285,0.0002687986,0.000011236227,0.000040254745,0.000004443994,0.00040221887,0.106128,0.89231837,0.00039360856],"about_ca_topic_score_codex":0.000010979034,"about_ca_topic_score_gemma":0.0000011957436,"teacher_disagreement_score":0.8431589,"about_ca_system_score_codex":0.00009261977,"about_ca_system_score_gemma":0.00006221042,"threshold_uncertainty_score":0.9998749},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76577914,0.000021680598,0.076597,0.004087519,0.00006388036,0.00022777669,0.000017306726,0.0004091694,0.15279654],"genre_scores_gemma":[0.9781627,0.000010841141,0.0064069103,0.00016682624,0.00004290356,0.000035259898,5.066226e-7,0.00000867636,0.015165379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950397,0.00003429122,0.00015011465,0.00010004733,0.000086692395,0.00012485754],"domain_scores_gemma":[0.998815,0.0008308092,0.000035154128,0.00024261355,0.000029862493,0.00004659019],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017458567,0.00006002279,0.000084294916,0.00006945711,0.000047147238,0.000010012848,0.000116950134,0.000030678053,0.00096095464],"category_scores_gemma":[0.00031921885,0.00003211843,0.000049199163,0.00017696302,0.000042548716,0.000049384387,0.00002618789,0.000024801308,0.0003818889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025676768,0.000043616652,0.00026230415,0.0000052481723,0.000007996145,2.2640057e-7,0.000030463445,4.3001296e-9,0.003728353,0.98991174,0.003283973,0.0027235353],"study_design_scores_gemma":[0.0001585024,0.000013310791,0.000291117,0.0000075182734,0.0000074851932,0.0000016332446,0.00003461495,0.0000014824459,0.0053816903,0.98096997,0.013066306,0.00006639872],"about_ca_topic_score_codex":0.0000029499906,"about_ca_topic_score_gemma":0.0000023573655,"teacher_disagreement_score":0.21238355,"about_ca_system_score_codex":0.0000091362745,"about_ca_system_score_gemma":0.0000064680107,"threshold_uncertainty_score":0.9999523},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9415482,0.0021338644,0.010914459,0.032128673,0.0070326123,0.0022622047,0.00019006398,0.00008804619,0.0037018636],"genre_scores_gemma":[0.99632597,0.00031503904,0.0012298963,0.0003216668,0.0004526681,0.000092101465,0.000005617475,0.00006777518,0.0011892833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977581,0.0001160757,0.0009819422,0.00027462363,0.0005575559,0.00031170182],"domain_scores_gemma":[0.9932601,0.0012855763,0.002564328,0.0014288354,0.0013105264,0.00015063841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002049784,0.00035929278,0.000727015,0.0002202778,0.0006843469,0.00034707153,0.00196646,0.00038141973,0.000042185693],"category_scores_gemma":[0.0013815572,0.00024420116,0.0007361557,0.00022299902,0.00015420184,0.0001236439,0.00043295737,0.0014041075,0.0000067222472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005569161,0.00030571656,0.000057392062,0.00027532785,0.0003993308,0.0000040407617,0.0009136027,0.0000028506763,0.00007961791,0.93855405,0.058975182,0.00037722196],"study_design_scores_gemma":[0.0007442667,0.000119973134,0.00030003648,0.00023155083,0.0005253991,0.00005339127,0.0000682209,0.000055262364,0.00096071244,0.969853,0.02682481,0.0002633763],"about_ca_topic_score_codex":0.000004545339,"about_ca_topic_score_gemma":0.000007603187,"teacher_disagreement_score":0.054777738,"about_ca_system_score_codex":0.00008386598,"about_ca_system_score_gemma":0.0004178194,"threshold_uncertainty_score":0.99582344},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6112973,0.0039824583,0.19995366,0.002823671,0.0013336675,0.014886084,0.0016280812,0.0026850915,0.16140994],"genre_scores_gemma":[0.7718594,0.00033280172,0.22495408,0.00005154464,0.00023506337,0.001353466,0.00022039945,0.0002658797,0.00072735443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968668,0.000043402622,0.00086735754,0.0010885323,0.00054423657,0.00058965833],"domain_scores_gemma":[0.99466014,0.0003484149,0.0013093675,0.0033171342,0.00015289876,0.00021204342],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008870071,0.00082226796,0.0011483396,0.00022009312,0.0008549818,0.0005306139,0.0011159793,0.0005077894,0.000024862917],"category_scores_gemma":[0.00031728603,0.0007353064,0.00026095027,0.00017707655,0.00080184627,0.00010868626,0.0011222726,0.00092695776,0.000019682402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015037772,0.00018315094,0.000009771077,0.0043102126,0.0001949932,0.0000050415188,0.0017751916,0.0000047838157,0.0017253831,0.9893027,0.0014959468,0.0009778109],"study_design_scores_gemma":[0.00035655574,0.000010995178,0.0000329256,0.0008897156,0.00048888306,0.00001216227,0.00052162685,0.00016266566,0.0034355565,0.99220693,0.0010637677,0.0008182147],"about_ca_topic_score_codex":0.0000039508504,"about_ca_topic_score_gemma":0.000007814204,"teacher_disagreement_score":0.16068259,"about_ca_system_score_codex":0.00003374072,"about_ca_system_score_gemma":0.00008813252,"threshold_uncertainty_score":0.9995098},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3997599,0.000040291114,0.59934974,0.00031674703,0.00013585316,0.0002524876,0.000015738533,0.0000147480305,0.000114526854],"genre_scores_gemma":[0.6890214,0.0000042970987,0.31089804,0.0000075344224,0.00001678713,5.197145e-8,0.000009747719,0.0000046184364,0.000037536804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979376,0.00071363983,0.00061628886,0.00024792828,0.00025447833,0.00023007361],"domain_scores_gemma":[0.9946403,0.002473816,0.0012034045,0.0004769336,0.0010690774,0.00013647098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006078652,0.00012199046,0.0004833444,0.00019443636,0.00023408698,0.000019774425,0.00057394564,0.00013663493,0.000065553606],"category_scores_gemma":[0.00040323878,0.000122057354,0.00020899154,0.00042616113,0.0015881151,0.00013124262,0.00018968232,0.00018527034,7.040126e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030252826,0.0008990138,0.0023183639,0.00014863382,0.00024097641,0.000003992864,0.0050787646,0.048523176,0.0026201094,0.9296514,0.003417561,0.0067954906],"study_design_scores_gemma":[0.0023784398,0.00023129872,0.0046504214,0.00034623838,0.0003339346,0.000043720444,0.009298705,0.13840288,0.0028025159,0.8410384,0.00014076538,0.0003326986],"about_ca_topic_score_codex":0.000013520074,"about_ca_topic_score_gemma":0.0000065145396,"teacher_disagreement_score":0.28926152,"about_ca_system_score_codex":0.000028981583,"about_ca_system_score_gemma":0.00013864067,"threshold_uncertainty_score":0.5851476},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99598247,0.00036379645,0.0003622104,0.0005149892,0.00043518323,0.00006639059,0.000004097697,0.000014382653,0.0022564677],"genre_scores_gemma":[0.9991316,0.0002241443,0.0004933914,0.00005691011,0.00003593256,0.0000047654075,0.0000020626785,0.000010967128,0.00004017949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988288,0.0000498039,0.0005358655,0.0001135529,0.0003360375,0.00013593798],"domain_scores_gemma":[0.9988603,0.00039409014,0.00033463343,0.0000976511,0.0002584907,0.00005483477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004441092,0.00011734517,0.00021420608,0.00036495226,0.000060949507,0.000071351176,0.0002959502,0.000054812273,0.000015506952],"category_scores_gemma":[0.00009715889,0.00010377773,0.0001206403,0.00024260873,0.00007404457,0.00020173802,0.000041548603,0.00021088222,0.000001216951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097022086,0.00030357228,0.023221027,0.000007366105,0.000048075035,0.000045770965,0.00016058738,0.000005517046,0.0002623013,0.97486645,0.00038294084,0.0005993768],"study_design_scores_gemma":[0.0010401838,0.00010764269,0.02940234,0.00008389283,0.000025282505,0.00008331155,0.0003706855,0.000046911064,0.00044460225,0.96769863,0.00058910483,0.000107407024],"about_ca_topic_score_codex":0.000036392183,"about_ca_topic_score_gemma":0.000032279546,"teacher_disagreement_score":0.0071678064,"about_ca_system_score_codex":0.00003443041,"about_ca_system_score_gemma":0.000024228832,"threshold_uncertainty_score":0.4231933},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9968003,0.00006595255,0.00012961816,0.0011161787,0.000047482372,0.00007772868,0.00003789693,0.0000023429589,0.0017224906],"genre_scores_gemma":[0.9996873,0.000008525228,0.00002271167,0.00010061865,0.00004572691,0.00000282718,2.0920223e-7,0.0000137790685,0.000118289376],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991661,0.000048609607,0.0003645723,0.00008854098,0.00017320664,0.0001590189],"domain_scores_gemma":[0.99837625,0.0004347577,0.00050587975,0.00033777393,0.00017518987,0.00017016742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003560566,0.000111208494,0.000199622,0.00003829628,0.00010530095,0.0000133653875,0.0003609333,0.0000963556,0.000076878016],"category_scores_gemma":[0.00064979756,0.000057474314,0.00010298699,0.00015102353,0.00032784892,0.0000486576,0.000018752913,0.00016435493,9.142003e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002715148,0.000041356067,0.0012585736,0.0000455243,0.00007261652,0.0000037150046,0.00022712267,0.0000019232077,0.9776586,0.018876674,0.001318728,0.00046796552],"study_design_scores_gemma":[0.00046398534,0.000021504136,0.001630896,0.00034733582,0.000037894893,0.00006097817,0.00013386937,0.000002139,0.763961,0.23305698,0.00020148842,0.000081944956],"about_ca_topic_score_codex":0.000025669358,"about_ca_topic_score_gemma":0.00034353766,"teacher_disagreement_score":0.2141803,"about_ca_system_score_codex":0.000044766857,"about_ca_system_score_gemma":0.00035523387,"threshold_uncertainty_score":0.23437345},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99395066,0.00021612796,0.000063568164,0.00043194593,0.000033753375,0.000015230812,0.000020148893,0.0000020570728,0.005266516],"genre_scores_gemma":[0.9993077,0.0000069046196,0.00019636701,0.00007407326,0.00006036115,6.837916e-7,5.596548e-7,0.000007892774,0.00034546942],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961114,0.0000074408067,0.000118956836,0.00007194061,0.00007476624,0.00011577838],"domain_scores_gemma":[0.9991182,0.000028673141,0.00019825745,0.00024577355,0.00007450417,0.00033457894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000069781694,0.00007079115,0.00010009252,0.000021527656,0.00020930481,0.000061793915,0.00030032673,0.00006752234,0.0001634153],"category_scores_gemma":[0.00025985157,0.00006483354,0.00003827268,0.000016067605,0.000060066694,0.00005342746,0.000008291402,0.00012757556,3.9478954e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018371456,0.000019837424,0.00017545054,0.000095667136,0.000091956594,0.00053764007,0.00019305866,0.000006345515,0.51223886,0.48087412,0.0017080888,0.004040567],"study_design_scores_gemma":[0.00014120172,0.000008632947,0.00016934166,0.000052511397,0.000015547206,0.00025529985,0.000031622432,0.000006007185,0.49508286,0.5027915,0.0013743826,0.00007106677],"about_ca_topic_score_codex":0.000032186428,"about_ca_topic_score_gemma":0.00031175662,"teacher_disagreement_score":0.021917405,"about_ca_system_score_codex":0.000020251266,"about_ca_system_score_gemma":0.00018987269,"threshold_uncertainty_score":0.26438352},"labels":[],"label_agreement":null},{"id":"W2571762197","doi":"","title":"The smallest Merrifield-Simmons index of trees with exactly six leaves.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Tree (set theory); Discrete mathematics; Arithmetic; Computer science","score_opus":0.020273262348202488,"score_gpt":0.25779202593832057,"score_spread":0.2375187635901181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571762197","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9895366,0.00004571583,0.00019234783,0.0009691453,0.0001513455,0.00022436667,0.0000064856195,0.00004995167,0.008824041],"genre_scores_gemma":[0.99847746,0.000024167211,0.00012746542,0.000018633104,0.0000056392823,0.000054708275,5.140782e-7,0.000018361618,0.0012730666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921095,0.00006069246,0.00022267112,0.00015177649,0.0001650314,0.00018889112],"domain_scores_gemma":[0.99782956,0.0012840187,0.00015464368,0.00059420103,0.000082146165,0.00005544521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002776158,0.00012086423,0.00016380995,0.00003278954,0.0001912154,0.00001623127,0.00033809728,0.00006536217,0.000041161533],"category_scores_gemma":[0.0001416761,0.000059949056,0.00006209891,0.00016893259,0.00023113846,0.000051458937,0.000045296765,0.000093140676,0.000017011189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033697008,0.00009973724,0.0058645117,0.00000636179,0.000048946767,9.0620966e-7,0.00013554604,2.1059296e-7,0.0013340292,0.9899496,0.0016214274,0.0009050669],"study_design_scores_gemma":[0.00061791297,0.00008950383,0.0054811006,0.000046908808,0.000029159275,0.0000028752388,0.00019261584,0.0000020902933,0.008864803,0.9821205,0.0024465998,0.00010591182],"about_ca_topic_score_codex":0.000013542454,"about_ca_topic_score_gemma":0.00015855875,"teacher_disagreement_score":0.008940844,"about_ca_system_score_codex":0.000011475425,"about_ca_system_score_gemma":0.000036032056,"threshold_uncertainty_score":0.24446516},"labels":[],"label_agreement":null},{"id":"W2572097019","doi":"","title":"A list for vertex-primitive symmetric graphs of order 6p.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Order (exchange); Discrete mathematics; Graph","score_opus":0.028408068193046202,"score_gpt":0.29263988191171486,"score_spread":0.26423181371866866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572097019","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9924414,0.000052678064,0.00054983294,0.00033347428,0.00040446065,0.0005394434,0.000061396146,0.00007120104,0.0055461214],"genre_scores_gemma":[0.9977367,0.000016161363,0.0014900819,0.000036033358,0.0000028405507,0.00014747257,0.0000029141809,0.000022382228,0.0005454417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999243,0.000039433784,0.00023756397,0.00017894832,0.00011966591,0.00018136419],"domain_scores_gemma":[0.9976456,0.0015535398,0.00013810898,0.00035853634,0.00024766268,0.000056509278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026890534,0.000111807036,0.00020883986,0.00013967098,0.00008682807,0.0000074364657,0.00021003139,0.0000706516,0.000050633596],"category_scores_gemma":[0.00080926367,0.00008098197,0.00011863895,0.0005990797,0.00010371712,0.00006927868,0.00003704004,0.000045643137,0.000016821508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022545957,0.00023011501,0.00036971737,0.000037978898,0.000049301198,2.4423815e-7,0.000084013176,1.1598702e-8,0.003005963,0.99202514,0.0029103055,0.0012646554],"study_design_scores_gemma":[0.0011268846,0.000098347584,0.0005366567,0.00004895859,0.000052979383,0.000001121134,0.00004443111,0.0000045219413,0.010774452,0.985617,0.0015789862,0.00011569969],"about_ca_topic_score_codex":0.0000050465787,"about_ca_topic_score_gemma":0.0000020130717,"teacher_disagreement_score":0.0077684894,"about_ca_system_score_codex":0.000019232637,"about_ca_system_score_gemma":0.000028468801,"threshold_uncertainty_score":0.3302349},"labels":[],"label_agreement":null},{"id":"W2572358194","doi":"","title":"The maximal (signless Laplacian) spectral radius of connected graphs with given matching number.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Combinatorics; Matching (statistics); Discrete mathematics; Statistics; Physics; Eigenvalues and eigenvectors","score_opus":0.013732656318069084,"score_gpt":0.255352390205756,"score_spread":0.24161973388768693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572358194","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9939734,0.00001970064,0.0002212674,0.00060145784,0.00019213164,0.00029223412,0.000015482765,0.00009343874,0.0045908964],"genre_scores_gemma":[0.99892133,0.000014675749,0.0006323539,0.000013540899,0.0000060290686,0.000047825826,0.0000016782477,0.000028322811,0.00033421651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989529,0.0001161692,0.00026362448,0.00019171998,0.00020097224,0.00027457692],"domain_scores_gemma":[0.99802196,0.0011382479,0.00019659009,0.0004831376,0.00009155659,0.00006849537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035748945,0.00015572355,0.00022012187,0.000032049924,0.00026494847,0.000026392807,0.0003582387,0.000060816947,0.00006480781],"category_scores_gemma":[0.00007283434,0.0000849364,0.000084825646,0.00026508377,0.0002564626,0.00009424352,0.00004049558,0.000118092124,0.000033357825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008967946,0.00011609389,0.0016828836,0.000016692258,0.00007871384,0.0000038609887,0.00032211794,1.487092e-7,0.0033533112,0.9934089,0.00058375864,0.00034382625],"study_design_scores_gemma":[0.0010482685,0.00007056065,0.0018216023,0.00007131558,0.00004159687,0.000018801089,0.00024030029,0.0000019603062,0.009553569,0.9865374,0.00044847326,0.0001461551],"about_ca_topic_score_codex":0.00001199854,"about_ca_topic_score_gemma":0.000019470208,"teacher_disagreement_score":0.0068715164,"about_ca_system_score_codex":0.000022622204,"about_ca_system_score_gemma":0.00003253148,"threshold_uncertainty_score":0.3463606},"labels":[],"label_agreement":null},{"id":"W2572372762","doi":"","title":"Some indices of graphs with more than one cut-edge.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Artificial intelligence; Computer science","score_opus":0.022409743689004853,"score_gpt":0.26996969887154476,"score_spread":0.2475599551825399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572372762","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99806184,0.000059233014,0.000024631776,0.00038406276,0.000117173244,0.00020577594,0.000015050609,0.00007459393,0.001057619],"genre_scores_gemma":[0.99908423,0.000027677657,0.00050883833,0.000023691811,0.000006526637,0.000048120197,0.000001984521,0.000021883343,0.00027706154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992312,0.000039640352,0.00019587264,0.00017143946,0.00019123597,0.00017061114],"domain_scores_gemma":[0.99893284,0.0002918098,0.00017391932,0.0004619887,0.00007325233,0.000066208995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018184735,0.00011852944,0.00020661706,0.00008733047,0.0000784334,0.000008129057,0.0002531652,0.000061743915,0.00003714736],"category_scores_gemma":[0.000048407303,0.000075579934,0.00005917651,0.00024224471,0.00021347242,0.00013895553,0.00004155231,0.000068924535,0.00002452141],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022813285,0.00028937045,0.004634457,0.000037207657,0.00006595616,0.0000010767677,0.00030085864,2.7304806e-8,0.0033024866,0.9907473,0.00036426526,0.00023420918],"study_design_scores_gemma":[0.00073106075,0.00010790565,0.0036655923,0.00011130956,0.00004957631,0.0000020610032,0.00010106618,4.19236e-7,0.029242063,0.9657064,0.00016167488,0.00012087902],"about_ca_topic_score_codex":0.000006100789,"about_ca_topic_score_gemma":0.00000411355,"teacher_disagreement_score":0.025939576,"about_ca_system_score_codex":0.000010200138,"about_ca_system_score_gemma":0.00002259257,"threshold_uncertainty_score":0.30820602},"labels":[],"label_agreement":null},{"id":"W2572611632","doi":"","title":"Two-parameters generalization of Pell numbers in graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Generalization; Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.02380493085105344,"score_gpt":0.2857457099138408,"score_spread":0.26194077906278734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572611632","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99686086,0.000021654441,0.00017336116,0.000112175745,0.0001980972,0.0001359532,0.000004326933,0.000028496854,0.0024650686],"genre_scores_gemma":[0.99748766,0.000019920108,0.0022708415,0.000024366576,0.0000012636134,0.000022178747,0.0000030215374,0.000013167827,0.00015757882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992965,0.00008362308,0.00024176735,0.00014354236,0.0001053864,0.0001291744],"domain_scores_gemma":[0.9992325,0.00026387308,0.00010728523,0.0003029806,0.000057566485,0.000035839344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022841821,0.00008150179,0.00015015743,0.00008271892,0.00002524345,0.0000055508526,0.00012889036,0.000045521167,0.000045989746],"category_scores_gemma":[0.000117438525,0.00006502206,0.000061707746,0.0003341782,0.00006868705,0.00007190778,0.000023560155,0.00003924423,0.0000116560705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056587273,0.0001351335,0.008870085,0.000012927378,0.000011450108,8.6502826e-7,0.00015071066,0.000002342443,0.008718976,0.98145896,0.00043125768,0.00020162875],"study_design_scores_gemma":[0.00078667764,0.000014483196,0.0007808894,0.00004392163,0.0000116947895,0.0000012536149,0.000051667612,0.000010571335,0.02868568,0.96945095,0.00007671087,0.00008547281],"about_ca_topic_score_codex":0.00002481669,"about_ca_topic_score_gemma":0.000020475822,"teacher_disagreement_score":0.019966705,"about_ca_system_score_codex":0.000019904826,"about_ca_system_score_gemma":0.000015927399,"threshold_uncertainty_score":0.26515228},"labels":[],"label_agreement":null},{"id":"W2572795963","doi":"","title":"Total Embedding distributions for two graph families obtained from the dipole D 3 .","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Embedding; Combinatorics; Graph; Dipole; Discrete mathematics; Artificial intelligence; Computer science; Physics; Quantum mechanics","score_opus":0.02090109328123276,"score_gpt":0.2972660110128225,"score_spread":0.2763649177315898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572795963","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98589694,0.000047781185,0.010196688,0.001561072,0.00050277135,0.00046545343,0.00056547,0.00014595043,0.0006178522],"genre_scores_gemma":[0.9982614,0.000006309394,0.0010018188,0.000036771828,0.000026527774,0.0002576203,0.000036335816,0.000018849527,0.00035434728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919665,0.00005986686,0.00020590003,0.00019880485,0.000106360785,0.00023241455],"domain_scores_gemma":[0.99678105,0.0025110363,0.00008827586,0.00048338677,0.00008037518,0.00005589803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024548464,0.00013040547,0.0001487073,0.000023150982,0.00047830696,0.00003528223,0.0002676827,0.000047380974,0.000052106625],"category_scores_gemma":[0.00042995368,0.00007627707,0.00014551658,0.00017829138,0.00014010213,0.00009011467,0.00006169275,0.00006740514,0.000043280765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011538735,0.00008413457,0.00045255126,0.0000035367686,0.00004721249,1.91611e-7,0.00015284822,3.108471e-7,0.0032850143,0.98900586,0.006444517,0.0005122811],"study_design_scores_gemma":[0.0009074569,0.000023160801,0.00082321075,0.00003055654,0.00006117443,9.86144e-7,0.00023410405,0.000030777708,0.004380364,0.9906773,0.0027038383,0.00012705514],"about_ca_topic_score_codex":0.00002319327,"about_ca_topic_score_gemma":0.000008526224,"teacher_disagreement_score":0.012364457,"about_ca_system_score_codex":0.000028018503,"about_ca_system_score_gemma":0.00002024329,"threshold_uncertainty_score":0.36787987},"labels":[],"label_agreement":null},{"id":"W2573057482","doi":"","title":"On the sum-connectivity spectral radius and sum-connectivity Estrada index of graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Spectral radius; Combinatorics; RADIUS; Eigenvalues and eigenvectors; Computer science; Computer network; World Wide Web; Physics","score_opus":0.020144723359750545,"score_gpt":0.25683203031813007,"score_spread":0.23668730695837953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573057482","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99614733,0.000025931799,0.00010233832,0.0009705095,0.0002627668,0.0003972857,0.000023505301,0.0000736091,0.0019967316],"genre_scores_gemma":[0.99974084,0.000016723308,0.000047925518,0.00004022421,0.0000069695902,0.00004864585,6.4094445e-7,0.00002279706,0.00007521046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876493,0.00021646076,0.00024177994,0.00030741768,0.00020475981,0.00026466366],"domain_scores_gemma":[0.99519295,0.0038362078,0.00017744908,0.00065147714,0.00005719191,0.00008472167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076665095,0.00020002617,0.00029187676,0.00007956666,0.00020481487,0.000020932823,0.00026647447,0.00010094452,0.00006544141],"category_scores_gemma":[0.0006181845,0.00012227624,0.00011798269,0.00028145174,0.00032380834,0.00011710629,0.000058672493,0.00019542173,0.000009965445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047382153,0.00032230045,0.010099187,0.000019395036,0.000056550714,0.0000017888638,0.00015267487,1.3758167e-7,0.0029046969,0.98509926,0.0005930155,0.00070359895],"study_design_scores_gemma":[0.000803768,0.00012236246,0.0273219,0.000046996367,0.000031250427,0.000007104168,0.00005373551,0.000009393445,0.021805862,0.94956475,0.00007046602,0.00016241286],"about_ca_topic_score_codex":0.000042519372,"about_ca_topic_score_gemma":0.000039308026,"teacher_disagreement_score":0.035534523,"about_ca_system_score_codex":0.000031716325,"about_ca_system_score_gemma":0.000031717092,"threshold_uncertainty_score":0.49862805},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06163309,0.0012414514,0.27425152,0.0006025809,0.0009918994,0.0030928163,0.00008846868,0.00031780437,0.6577804],"genre_scores_gemma":[0.87059003,0.0006743227,0.12473091,0.00033450685,0.0001673158,0.00008038529,0.000018096329,0.0001853126,0.003219096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99687755,0.000044996883,0.0009898039,0.000836391,0.00058126834,0.00067000417],"domain_scores_gemma":[0.9966777,0.0017778683,0.00033329692,0.0008760894,0.00012652183,0.00020853883],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0035048581,0.00059226586,0.00080092734,0.00067146297,0.00028899545,0.0007180146,0.0010329853,0.0002891051,0.00013498092],"category_scores_gemma":[0.00034268052,0.00045149555,0.00015641676,0.00028154478,0.006378499,0.0005847146,0.00094146875,0.0007662623,0.0000065957456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033449018,0.000054936463,0.000009148039,0.00025445843,0.000016149866,0.000032128755,0.0028281123,0.000005088125,0.0000115185685,0.9923188,0.000004478647,0.004431749],"study_design_scores_gemma":[0.00025491265,0.00011291272,0.000009134367,0.001898755,0.000032220498,0.0000876067,0.0007560275,0.0021713313,0.00018924956,0.9937746,0.00016571443,0.00054754404],"about_ca_topic_score_codex":9.195852e-7,"about_ca_topic_score_gemma":0.00002875405,"teacher_disagreement_score":0.808957,"about_ca_system_score_codex":0.000064495034,"about_ca_system_score_gemma":0.000050012863,"threshold_uncertainty_score":0.9997937},"labels":[],"label_agreement":null},{"id":"W2573432259","doi":"","title":"On the distance and distance Laplacian spectral radius of graphs with cut edges.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; RADIUS; Combinatorics; Laplace operator; Resistance distance; Mathematical analysis; Graph; Eigenvalues and eigenvectors; Physics; Line graph; Computer science","score_opus":0.014132119586703318,"score_gpt":0.23720389303816228,"score_spread":0.22307177345145895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573432259","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99338365,0.000056887202,0.0006730392,0.00092737295,0.000099852536,0.00023977361,0.00002385218,0.00003715411,0.0045584366],"genre_scores_gemma":[0.9993333,0.000024752104,0.00014555224,0.000033259654,0.0000029256905,0.00003684644,6.199267e-7,0.000014771328,0.00040793366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993568,0.00004787831,0.00014113415,0.00016882292,0.00013253938,0.0001528152],"domain_scores_gemma":[0.99865407,0.0007237133,0.00010867637,0.00043148894,0.000034905544,0.000047166115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001812913,0.00011491102,0.00014905477,0.000024686684,0.00012124905,0.000012168638,0.00018259256,0.00003145576,0.000023242865],"category_scores_gemma":[0.00007490123,0.00005808185,0.000037061585,0.00017403615,0.00031305,0.000051947005,0.00001730961,0.00007745525,0.0000058326846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053740132,0.00009795677,0.0015997142,0.000015808924,0.000022609704,0.0000012783868,0.00016176014,4.8571696e-8,0.0002894338,0.9963827,0.001152074,0.00022286763],"study_design_scores_gemma":[0.00051186956,0.00008880605,0.001331273,0.00009784674,0.000018936744,0.000002609933,0.00005092029,0.0000017883415,0.006313332,0.9905617,0.00092209043,0.00009882842],"about_ca_topic_score_codex":0.0000016473296,"about_ca_topic_score_gemma":0.000017591325,"teacher_disagreement_score":0.006023898,"about_ca_system_score_codex":0.00001385261,"about_ca_system_score_gemma":0.0000118766175,"threshold_uncertainty_score":0.2368509},"labels":[],"label_agreement":null},{"id":"W2573967999","doi":"","title":"A sharp upper bound on the spectral radius of generalized weighted digraphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Upper and lower bounds; RADIUS; Combinatorics; Mathematical analysis; Eigenvalues and eigenvectors; Physics; Quantum mechanics; Computer science","score_opus":0.02471284038092588,"score_gpt":0.26853317870645754,"score_spread":0.24382033832553165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573967999","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99151826,0.00003998512,0.00002466484,0.0019238951,0.0002764752,0.00030857316,0.00002096762,0.00006705771,0.0058201095],"genre_scores_gemma":[0.99866474,0.00001843212,0.00026749508,0.00010542244,0.000011266936,0.00006953933,0.00000195969,0.00002216333,0.0008390064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904025,0.00011461748,0.00025256322,0.00018868003,0.00018837502,0.00021549912],"domain_scores_gemma":[0.99838096,0.00074468285,0.00013248244,0.0006307309,0.000054156248,0.00005696523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003140847,0.00014315937,0.00019944707,0.00006477268,0.0001458746,0.000018329352,0.00034185086,0.000063599866,0.00041445927],"category_scores_gemma":[0.00011019478,0.00007524276,0.00015595615,0.00025407772,0.00017419255,0.00005291553,0.000034006356,0.00009241017,0.000068847454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000331676,0.0002065562,0.00044644572,0.0000079577685,0.000051391467,9.340466e-7,0.00015824901,1.5886807e-8,0.008552138,0.9843299,0.006050114,0.00016313784],"study_design_scores_gemma":[0.0008298321,0.000062443236,0.0009134712,0.00003512696,0.000032781387,0.0000022903575,0.000020033724,0.000004868227,0.037956662,0.9576544,0.002374899,0.00011317923],"about_ca_topic_score_codex":0.0000066418665,"about_ca_topic_score_gemma":0.000002042444,"teacher_disagreement_score":0.029404525,"about_ca_system_score_codex":0.000020839574,"about_ca_system_score_gemma":0.000020877766,"threshold_uncertainty_score":0.45380384},"labels":[],"label_agreement":null},{"id":"W2574114580","doi":"","title":"On the extremal Merrifield-Simmons index of quasi-unicyclic graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Index (typography); Discrete mathematics; Computer science; World Wide Web","score_opus":0.031197686055073615,"score_gpt":0.2782636524007888,"score_spread":0.2470659663457152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574114580","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9881484,0.000020235284,0.00024324754,0.0014396261,0.0002518465,0.00025077132,0.000009257803,0.000059782964,0.009576821],"genre_scores_gemma":[0.9992621,0.0000125627585,0.000059057882,0.00009063429,0.0000038379903,0.00006500953,6.0946616e-7,0.000018445016,0.00048776818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990496,0.0001310819,0.0002603264,0.00017674171,0.00019418681,0.00018803186],"domain_scores_gemma":[0.9968112,0.0021596393,0.0001531923,0.0007666429,0.000056016146,0.000053283136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040578042,0.00013102485,0.00018500525,0.00007023731,0.00013788804,0.000009021043,0.00040104685,0.00008802844,0.00020843024],"category_scores_gemma":[0.00032990836,0.00007179178,0.00013198108,0.0002634472,0.0001707291,0.00005050246,0.00005256346,0.0001299881,0.0000530253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013382182,0.00030098605,0.0006147181,0.000006559436,0.000035730587,6.4383363e-7,0.00012946856,4.8622812e-8,0.0018632892,0.9921223,0.003853772,0.0010591311],"study_design_scores_gemma":[0.0004093179,0.00008191673,0.00069528475,0.000054025924,0.000022088327,0.0000013636354,0.00007969105,0.000007359402,0.0068875477,0.99107087,0.00058878853,0.000101732585],"about_ca_topic_score_codex":0.000008550663,"about_ca_topic_score_gemma":0.000006412387,"teacher_disagreement_score":0.011113663,"about_ca_system_score_codex":0.000011221888,"about_ca_system_score_gemma":0.000019125293,"threshold_uncertainty_score":0.29275838},"labels":[],"label_agreement":null},{"id":"W2574323604","doi":"","title":"Minimizing the least eigenvalue of bicyclic graphs with fixed diameter.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Bicyclic molecule; Combinatorics; Chemistry; Medicinal chemistry; Physics","score_opus":0.028359972070274707,"score_gpt":0.2663913660209277,"score_spread":0.238031393950653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574323604","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9967883,0.000038902184,0.00016749241,0.000405934,0.00014631735,0.0002648647,0.000010120558,0.000054883887,0.0021231403],"genre_scores_gemma":[0.9984256,0.000012501685,0.0010804217,0.000033215412,0.0000040471205,0.000070173264,8.0471074e-7,0.000023268269,0.00034993826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991494,0.00010096683,0.00022561014,0.00017031112,0.00016791091,0.00018579634],"domain_scores_gemma":[0.9981533,0.00096003624,0.0001666588,0.00060485484,0.00006620707,0.000048921378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002766983,0.00012604412,0.00018375341,0.000055466608,0.00013736436,0.000011585447,0.00031660922,0.0000471485,0.00005408882],"category_scores_gemma":[0.00013190827,0.00006228062,0.000087282424,0.0003047581,0.00023950129,0.0000682669,0.000045007913,0.000074000556,0.00002843535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019906496,0.00011446965,0.003502207,0.000015928252,0.000046694753,6.326829e-7,0.00026080292,8.566578e-8,0.0070801126,0.98741317,0.00083697686,0.00070899026],"study_design_scores_gemma":[0.0006149008,0.00007498651,0.0020757497,0.00007560836,0.000051263978,0.0000044300837,0.00012450379,0.0000019073514,0.018442547,0.977908,0.0005165441,0.00010954603],"about_ca_topic_score_codex":0.000006157734,"about_ca_topic_score_gemma":0.0000043128807,"teacher_disagreement_score":0.011362434,"about_ca_system_score_codex":0.0000103427155,"about_ca_system_score_gemma":0.000019875093,"threshold_uncertainty_score":0.25397298},"labels":[],"label_agreement":null},{"id":"W2574479152","doi":"","title":"Tricyclic graphs with minimum Kirchhoff Index.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tricyclic; Index (typography); Combinatorics; Computer science; Chemistry; Stereochemistry","score_opus":0.01987593969212487,"score_gpt":0.26699556923841367,"score_spread":0.2471196295462888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574479152","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99181074,0.000021025795,0.0002561802,0.00058729976,0.00020955694,0.0002673092,0.000006946692,0.00016946309,0.0066714757],"genre_scores_gemma":[0.9981302,0.00000921786,0.00039549972,0.000060304803,0.000005836154,0.00008228013,0.0000013356054,0.000030951524,0.0012843561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999027,0.00006412841,0.00020620844,0.00024725814,0.00019336198,0.000262029],"domain_scores_gemma":[0.9985816,0.00057125394,0.00011069052,0.0005588214,0.00006823739,0.00010943033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022713021,0.00015726172,0.00019178994,0.00010793689,0.0001335119,0.000018956443,0.00027223476,0.00007991867,0.00009186846],"category_scores_gemma":[0.00010677161,0.00009627421,0.00007261855,0.00042205476,0.00013456159,0.000110120396,0.000039805946,0.00009512533,0.00011371371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003215211,0.00018879735,0.004032069,0.00001056731,0.00003703107,0.0000035057512,0.00011194581,2.7533751e-8,0.001127722,0.9904176,0.0030346313,0.0010039747],"study_design_scores_gemma":[0.0013616902,0.000092696304,0.002339993,0.000042544438,0.000030997377,0.000008279017,0.00005056362,0.0000015562903,0.0023313768,0.9910978,0.0024607077,0.00018180315],"about_ca_topic_score_codex":0.0000034938334,"about_ca_topic_score_gemma":0.0000036263145,"teacher_disagreement_score":0.0063194754,"about_ca_system_score_codex":0.000021788543,"about_ca_system_score_gemma":0.000027940845,"threshold_uncertainty_score":0.39259484},"labels":[],"label_agreement":null},{"id":"W2574613064","doi":"","title":"On the Laplacian coefficients and Laplacian-like energy of unicyclic graphs with fixed diameter.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Laplace operator; Laplacian matrix; Combinatorics; Pure mathematics; Mathematical analysis","score_opus":0.01578594659760281,"score_gpt":0.24070237171787448,"score_spread":0.22491642512027166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574613064","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99681205,0.000021382783,0.00033463212,0.0003133396,0.00013149195,0.00016991352,0.000017915801,0.000043025226,0.0021562714],"genre_scores_gemma":[0.99915904,0.000019596624,0.000115662646,0.00013481958,0.0000017269489,0.000049358554,0.0000016249451,0.0000209961,0.0004971711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991456,0.0001164322,0.00018186728,0.00019902101,0.00017810671,0.00017891974],"domain_scores_gemma":[0.9978355,0.0013949284,0.00013629823,0.0005160369,0.000054484437,0.00006276268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021511398,0.000140805,0.00018275206,0.00006997405,0.0001421148,0.000013918675,0.00023274877,0.00005866961,0.000029721949],"category_scores_gemma":[0.00009757244,0.00007307675,0.000047899208,0.00027771905,0.0002572973,0.00004350684,0.000045607452,0.00006614947,0.0000075746057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033493405,0.00018656268,0.0007389006,0.000007858617,0.00004128946,8.9354967e-7,0.0001137105,1.08255485e-7,0.000964904,0.995694,0.0011630299,0.001055269],"study_design_scores_gemma":[0.0008099189,0.00017250473,0.00053639297,0.000086396714,0.000031395677,0.0000025240051,0.00006263632,0.0000063871457,0.0060786763,0.99098957,0.0011060345,0.000117549214],"about_ca_topic_score_codex":0.000007400663,"about_ca_topic_score_gemma":0.00001630865,"teacher_disagreement_score":0.005113772,"about_ca_system_score_codex":0.00001081494,"about_ca_system_score_gemma":0.000013988606,"threshold_uncertainty_score":0.29799834},"labels":[],"label_agreement":null},{"id":"W2574688825","doi":"","title":"The Co-PI index of some compound graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Pi; Combinatorics; Geometry; Computer science; Programming language","score_opus":0.023316806246669375,"score_gpt":0.2892115971260703,"score_spread":0.26589479087940093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574688825","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99501514,0.00007133253,0.000038453083,0.0006124513,0.00032797415,0.00020083594,0.000011926691,0.00005622296,0.003665672],"genre_scores_gemma":[0.99936676,0.00004069486,0.00004800287,0.000029642051,0.000004793032,0.0000372512,9.3126056e-7,0.000014458263,0.00045747144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922365,0.00007406707,0.00024192457,0.00012261998,0.00016577261,0.00017196585],"domain_scores_gemma":[0.99794745,0.0012677603,0.0001450554,0.00052340236,0.000067936206,0.00004841289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041353633,0.000095525495,0.00014643105,0.000038700713,0.00021293541,0.000014723261,0.00033965803,0.00005421107,0.000028402248],"category_scores_gemma":[0.00011800147,0.000053095515,0.00008582126,0.00014621239,0.00027940437,0.0000777278,0.00004020186,0.00007248982,0.000043057393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012226233,0.00010289941,0.001966929,0.000009038355,0.000033431188,4.634408e-7,0.00006654438,1.9280126e-8,0.0021834844,0.99027693,0.004776786,0.0005712559],"study_design_scores_gemma":[0.00052765326,0.000028969125,0.0015423882,0.000022528777,0.000013884796,0.000001967603,0.000044896027,0.0000015966972,0.0072482764,0.9847091,0.005778384,0.00008039076],"about_ca_topic_score_codex":0.0000033315437,"about_ca_topic_score_gemma":0.0000019621498,"teacher_disagreement_score":0.005567858,"about_ca_system_score_codex":0.000012950597,"about_ca_system_score_gemma":0.00001954219,"threshold_uncertainty_score":0.21651722},"labels":[],"label_agreement":null},{"id":"W2575667298","doi":"","title":"Some sharp bounds for the spectral radius and energy of digraphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; RADIUS; Energy (signal processing); Combinatorics; Physics; Quantum mechanics; Eigenvalues and eigenvectors; Statistics; Computer science","score_opus":0.01940909777052949,"score_gpt":0.26244325084206804,"score_spread":0.24303415307153856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575667298","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99578017,0.0006717445,0.00056965085,0.001446678,0.0004366965,0.0002091315,0.0000395824,0.000052617408,0.0007937163],"genre_scores_gemma":[0.9988346,0.00011937876,0.00023326829,0.000039504328,0.000016349446,0.00008807762,0.0000010028623,0.00001334696,0.00065443234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948853,0.000021368858,0.00015354669,0.00012228759,0.00007378963,0.00014044513],"domain_scores_gemma":[0.9984976,0.0010506874,0.000080682265,0.0002991725,0.000034289522,0.00003756832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020021726,0.00008246825,0.00012859334,0.00003259269,0.00012585816,0.000013309517,0.0001738381,0.000040239112,0.000014110064],"category_scores_gemma":[0.000078652345,0.000046359037,0.00007632705,0.000086922664,0.00016287991,0.00006949455,0.000028853017,0.000029310386,0.0000012179446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014643428,0.00006335044,0.00018499902,0.000012868539,0.0000404931,1.3713587e-7,0.000083599654,1.3374824e-8,0.0025964251,0.9935091,0.0022264034,0.0012679506],"study_design_scores_gemma":[0.00061094796,0.000055615666,0.0005544575,0.000015850494,0.00003893553,0.000002153073,0.000024635152,0.00000767406,0.009249353,0.98310536,0.006263619,0.00007141819],"about_ca_topic_score_codex":0.0000066853067,"about_ca_topic_score_gemma":0.000003583406,"teacher_disagreement_score":0.010403775,"about_ca_system_score_codex":0.000007312041,"about_ca_system_score_gemma":0.000012136751,"threshold_uncertainty_score":0.18904667},"labels":[],"label_agreement":null},{"id":"W2575764447","doi":"","title":"Zagreb Eccentricity Indices Of Cycles Related Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eccentricity (behavior); Combinatorics; Political science","score_opus":0.019348562338452426,"score_gpt":0.27305533675254573,"score_spread":0.2537067744140933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575764447","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99577165,0.00005550706,0.000025292517,0.00021729356,0.00024104475,0.00016991857,0.000013602574,0.00009592377,0.0034097892],"genre_scores_gemma":[0.9994766,0.000037884256,0.00023343223,0.000011781646,0.0000016770225,0.0000067377855,0.0000016319611,0.000014114719,0.00021614585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991438,0.00007505999,0.00029949052,0.00016179647,0.00015341406,0.0001664883],"domain_scores_gemma":[0.9987139,0.00056741224,0.00022171937,0.00036839145,0.00006869621,0.00005988195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029859247,0.00010484662,0.00018734028,0.000099128985,0.000082624676,0.0000065688087,0.0002470685,0.000089564805,0.00013138489],"category_scores_gemma":[0.00020306547,0.0000723376,0.00009310195,0.0003570617,0.0001402933,0.00009448283,0.00004918083,0.00007239349,0.00004749969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008045169,0.0001964244,0.008302725,0.000018305498,0.00004186466,9.763546e-7,0.00021988658,6.527731e-8,0.0021556092,0.98736113,0.0008106187,0.000884372],"study_design_scores_gemma":[0.00060025544,0.000031026873,0.004792524,0.000049732633,0.00003297908,0.0000021225915,0.000050572704,0.0000019098254,0.017571572,0.9765281,0.00023916269,0.000100007484],"about_ca_topic_score_codex":0.000005684573,"about_ca_topic_score_gemma":0.0000013535049,"teacher_disagreement_score":0.015415964,"about_ca_system_score_codex":0.000013954928,"about_ca_system_score_gemma":0.000015419753,"threshold_uncertainty_score":0.2949842},"labels":[],"label_agreement":null},{"id":"W2576293399","doi":"","title":"The Randic Indices of Trees, Unicyclic Graphs and Bicyclic Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.01795614051698622,"score_gpt":0.2702494665088186,"score_spread":0.25229332599183235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576293399","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.996407,0.0005142918,0.0000075172775,0.0005047014,0.00019166365,0.00025346616,0.000010535782,0.00006631276,0.0020445536],"genre_scores_gemma":[0.9989306,0.0005460331,0.00007491204,0.000020293035,0.0000020921777,0.00005738186,0.0000010315543,0.00001798954,0.0003496978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989969,0.0001263341,0.00030729652,0.00018925245,0.00016594576,0.00021423075],"domain_scores_gemma":[0.9974892,0.0016583969,0.00021661645,0.00051502004,0.000043949945,0.000076806595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005456547,0.00013845804,0.00020978504,0.000109181914,0.0002900637,0.00002146504,0.00032146313,0.000075924305,0.00001931444],"category_scores_gemma":[0.00016033981,0.000075572294,0.00009624436,0.000379727,0.0004541959,0.00008801099,0.000065666536,0.00008682249,0.000011208518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016813137,0.00007732108,0.0054895175,0.000011413523,0.000055869827,4.807557e-7,0.00014407841,3.8288843e-9,0.0016405586,0.9858611,0.0009966402,0.0057061673],"study_design_scores_gemma":[0.0011120947,0.000055267174,0.005837292,0.00004473853,0.00004922985,0.0000028883558,0.00006760179,0.0000012126085,0.0025395232,0.9877483,0.0024331093,0.00010870941],"about_ca_topic_score_codex":0.000008974329,"about_ca_topic_score_gemma":0.000026030108,"teacher_disagreement_score":0.0055974578,"about_ca_system_score_codex":0.0000073560996,"about_ca_system_score_gemma":0.000015383093,"threshold_uncertainty_score":0.30817485},"labels":[],"label_agreement":null},{"id":"W2576372907","doi":"","title":"The expected values of Wiener indices in random polygonal chains.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Statistics; Statistical physics; Combinatorics; Physics","score_opus":0.017863348482778093,"score_gpt":0.2776032679613792,"score_spread":0.2597399194786011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576372907","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9974455,0.00011307029,0.000030114594,0.00040528495,0.00020511902,0.00018531305,0.000004822097,0.000032286192,0.0015784645],"genre_scores_gemma":[0.99938315,0.00003170644,0.00008733392,0.000013094969,0.0000057256534,0.00006707389,7.0138583e-7,0.000010370906,0.00040084796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920464,0.00012175879,0.00025232518,0.00011703162,0.00014847393,0.00015577617],"domain_scores_gemma":[0.9980161,0.0014693992,0.00013078297,0.0003071307,0.000045926365,0.00003066624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051382004,0.000083213155,0.00015200145,0.00005720118,0.00010307633,0.000009412344,0.0002532455,0.000048095564,0.000027661557],"category_scores_gemma":[0.00030556528,0.000044474702,0.000056977624,0.00021538328,0.00016272774,0.00006215791,0.00004090113,0.00005961527,0.000009063628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050917224,0.00010928824,0.0020349184,0.0000052951013,0.00001893233,4.6282167e-7,0.00050502096,5.8566147e-8,0.0030817818,0.99331635,0.0003192243,0.00055776525],"study_design_scores_gemma":[0.0017598462,0.000022953896,0.0027496365,0.00004095258,0.000009360829,7.969407e-7,0.00019646603,0.0000039429974,0.009679686,0.98517734,0.00029176442,0.00006724611],"about_ca_topic_score_codex":0.000006410725,"about_ca_topic_score_gemma":0.000008658154,"teacher_disagreement_score":0.008138988,"about_ca_system_score_codex":0.0000139978,"about_ca_system_score_gemma":0.000026259851,"threshold_uncertainty_score":0.18136257},"labels":[],"label_agreement":null},{"id":"W2576592240","doi":"","title":"The least eigenvalues of unicyclic graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Combinatorics; Physics","score_opus":0.026438428088549515,"score_gpt":0.2854146394425249,"score_spread":0.25897621135397536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576592240","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9937336,0.00011177159,0.000046551086,0.00059753266,0.00026773097,0.0001570887,0.000006360884,0.00005602702,0.0050233607],"genre_scores_gemma":[0.9989242,0.00008232595,0.00014486218,0.000013182533,0.0000031053892,0.000032884353,4.0302362e-7,0.000013304929,0.0007857365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993108,0.000080047794,0.00021081835,0.0001128332,0.0001306436,0.00015487602],"domain_scores_gemma":[0.9983095,0.00093149894,0.000118598,0.00053347513,0.00006604177,0.000040908988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003847834,0.000082985855,0.00011678047,0.000030905794,0.00018824176,0.000009528483,0.00032470605,0.000041173473,0.000026895817],"category_scores_gemma":[0.00017106239,0.000043699565,0.00008746064,0.00018862095,0.00022452902,0.00004764702,0.000048966183,0.00005094947,0.000040551102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050510357,0.00006773194,0.0006797161,0.0000050932854,0.000026063388,1.9214507e-7,0.00006888211,1.1841287e-8,0.002607331,0.99124926,0.0016393248,0.0036513358],"study_design_scores_gemma":[0.0002887495,0.00002625222,0.00084596814,0.000023948644,0.000017997709,0.0000012715432,0.0000626377,0.0000013632318,0.012232028,0.9829289,0.003505174,0.00006571828],"about_ca_topic_score_codex":0.0000030075569,"about_ca_topic_score_gemma":0.0000032445841,"teacher_disagreement_score":0.009624696,"about_ca_system_score_codex":0.000009343016,"about_ca_system_score_gemma":0.00001544613,"threshold_uncertainty_score":0.17820166},"labels":[],"label_agreement":null},{"id":"W2576978445","doi":"","title":"Some graft transformations and its applications on Q-spectral radius of a graph.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Graph; Combinatorics; Discrete mathematics; Physics; Eigenvalues and eigenvectors; Quantum mechanics","score_opus":0.018500576086869135,"score_gpt":0.26643793374277375,"score_spread":0.2479373576559046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576978445","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99562603,0.00019052521,0.00050323247,0.0010404928,0.00009550522,0.00067039335,0.00007310144,0.0001065833,0.0016941511],"genre_scores_gemma":[0.99910915,0.00017792199,0.00024580615,0.000031302312,0.000008188538,0.00029459017,0.0000033449246,0.00001539632,0.00011427651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992409,0.000039308623,0.00026669318,0.00016337562,0.00012701073,0.00016273253],"domain_scores_gemma":[0.9989971,0.0004880346,0.000070799084,0.00030598373,0.000056305264,0.00008178612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017350691,0.00011847639,0.00016887035,0.00011797999,0.00014697952,0.000009015721,0.00016231157,0.00006151875,0.000022912418],"category_scores_gemma":[0.000043807897,0.00008850383,0.00007773226,0.00023952551,0.000092377624,0.00015525983,0.000013727329,0.00007394972,0.000029126033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000927052,0.00021383163,0.000041274896,0.000031433774,0.000026509808,1.7489354e-7,0.00019115624,1.3676821e-7,0.007185581,0.9913571,0.00031173008,0.0006317932],"study_design_scores_gemma":[0.00069657696,0.000068018504,0.0003336131,0.000035342495,0.000034827106,0.000003715616,0.000029766197,0.000005071498,0.023941593,0.97357136,0.0011688638,0.00011125273],"about_ca_topic_score_codex":9.926373e-7,"about_ca_topic_score_gemma":0.0000012080114,"teacher_disagreement_score":0.017785748,"about_ca_system_score_codex":0.000014230409,"about_ca_system_score_gemma":0.000016250242,"threshold_uncertainty_score":0.36090815},"labels":[],"label_agreement":null},{"id":"W2577370094","doi":"","title":"The extremal unicyclic graphs with perfect matching with respect to Hosoya index and Merrifield-Simmons index.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Matching (statistics); Discrete mathematics; Statistics; Computer science","score_opus":0.015420698856087477,"score_gpt":0.2593853055955942,"score_spread":0.2439646067395067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577370094","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99429023,0.000050219376,0.000861417,0.0014960363,0.000091046684,0.00046720932,0.000004237796,0.00010645321,0.0026331472],"genre_scores_gemma":[0.99888605,0.000021679696,0.00034172638,0.00007251168,0.0000071982568,0.00011164687,4.6853543e-7,0.000039779083,0.00051893486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987674,0.00012414203,0.00019951921,0.0003297378,0.00024684478,0.00033238472],"domain_scores_gemma":[0.9977785,0.0012051973,0.00010794455,0.0006913644,0.000068992245,0.00014800372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044179804,0.0002160424,0.00021356576,0.000092469425,0.00055063464,0.00008339777,0.00031780294,0.000077170764,0.000014283766],"category_scores_gemma":[0.00008028745,0.00010669759,0.000043891654,0.00039920004,0.00020321629,0.00011839087,0.000090645146,0.00020494782,0.0000114129125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014965486,0.00006488434,0.009009227,0.00000839924,0.00006955852,0.0000059759263,0.00059565593,6.193282e-7,0.00053530716,0.9877128,0.0003512433,0.0014966667],"study_design_scores_gemma":[0.0010128795,0.0002466865,0.0075477483,0.00012540226,0.000042338652,0.00002705118,0.0004957839,0.000005799741,0.00077347603,0.9886354,0.0008585769,0.00022881739],"about_ca_topic_score_codex":0.000037174308,"about_ca_topic_score_gemma":0.00023448863,"teacher_disagreement_score":0.0045958217,"about_ca_system_score_codex":0.00002336201,"about_ca_system_score_gemma":0.00004082359,"threshold_uncertainty_score":0.43510014},"labels":[],"label_agreement":null},{"id":"W2577482927","doi":"","title":"On a vertex-degree-based graph invariant and the multiplicatively weighted Harary index.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Invariant (physics); Combinatorics; Graph; Degree (music); Discrete mathematics","score_opus":0.027440102128969506,"score_gpt":0.25850233515611726,"score_spread":0.23106223302714776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577482927","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9902953,0.000049087856,0.0010825684,0.0040852176,0.00019292791,0.00078754465,0.000027572481,0.00015276647,0.0033269962],"genre_scores_gemma":[0.99874765,0.000014004411,0.00033397507,0.0004466752,0.0000038010166,0.00022788286,0.0000022971544,0.000025362908,0.00019837139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988425,0.00023387262,0.00023810877,0.00029484683,0.00018180803,0.00020890904],"domain_scores_gemma":[0.9956498,0.003406269,0.00014361666,0.00064390444,0.00006633598,0.00009003056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005300616,0.00018574997,0.00023023302,0.00008498402,0.00027149776,0.00003029755,0.00031922685,0.00009153631,0.00004725291],"category_scores_gemma":[0.0003363435,0.000096607946,0.00009192521,0.00026660974,0.00042020375,0.00007577418,0.000060204085,0.00015325738,0.00005893387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002353837,0.00021252205,0.00042974504,0.000010544328,0.000045235698,0.0000017608113,0.0001696663,5.0019516e-8,0.00051547796,0.9958186,0.0015374009,0.0010235842],"study_design_scores_gemma":[0.005493213,0.00005867034,0.003447889,0.000075745294,0.000033591856,0.0000023290643,0.000024271789,0.00014103936,0.0020484822,0.9881824,0.000333538,0.00015882828],"about_ca_topic_score_codex":0.000010261302,"about_ca_topic_score_gemma":0.0000037972275,"teacher_disagreement_score":0.008452311,"about_ca_system_score_codex":0.000015815727,"about_ca_system_score_gemma":0.00003351373,"threshold_uncertainty_score":0.39395577},"labels":[],"label_agreement":null},{"id":"W2578737464","doi":"","title":"The Rainbow Connection Problem: Mathematical Formulations.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Rainbow; Connection (principal bundle); Mathematics; Calculus (dental); Mathematical optimization; Geometry; Physics; Medicine; Optics","score_opus":0.02506789175033619,"score_gpt":0.28385561505290524,"score_spread":0.25878772330256905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578737464","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9507332,0.00004370619,0.0070073046,0.0083506,0.0006251919,0.0012492558,0.000009461168,0.0004721373,0.03150918],"genre_scores_gemma":[0.9956704,0.000011034234,0.001689338,0.000030654388,0.000009829029,0.00021052187,0.0000011502842,0.000019846746,0.0023572363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991317,0.00007465716,0.00026918756,0.00015133132,0.00015892468,0.00021424882],"domain_scores_gemma":[0.997354,0.0019462762,0.000107042826,0.0004420953,0.000091455906,0.000059152677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006233439,0.00010742217,0.00011584991,0.00003082954,0.000507502,0.000041349595,0.00020901553,0.00006344842,0.000096046344],"category_scores_gemma":[0.0004458603,0.000056173063,0.000077090466,0.0001727582,0.00011889373,0.00011682385,0.000042552987,0.00007457252,0.00022699192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076180686,0.000080806574,0.00008338272,0.00001001289,0.000019775476,2.3649709e-7,0.00009422013,6.406367e-8,0.00076955877,0.9924345,0.0042174505,0.0022823801],"study_design_scores_gemma":[0.0004617198,0.00003322749,0.00010611329,0.000031385913,0.000020387675,0.0000069690964,0.00004269019,0.000025485046,0.0014575497,0.9901096,0.007606681,0.00009817083],"about_ca_topic_score_codex":7.916935e-7,"about_ca_topic_score_gemma":0.0000021885814,"teacher_disagreement_score":0.044937227,"about_ca_system_score_codex":0.00003491813,"about_ca_system_score_gemma":0.000019643625,"threshold_uncertainty_score":0.3903346},"labels":[],"label_agreement":null},{"id":"W2578879722","doi":"","title":"The eccentric distance sum, the Harary index and the degree powers of graphs with given diameter.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Index (typography); Combinatorics; Physics; Computer science","score_opus":0.018055641405798177,"score_gpt":0.23797838800744714,"score_spread":0.21992274660164896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578879722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99108905,0.0006417258,0.000457215,0.0046915975,0.00019776015,0.00068660016,0.000017818566,0.00003635526,0.0021818813],"genre_scores_gemma":[0.9993484,0.00018608329,0.000046467747,0.00004883213,0.0000029885184,0.00008390471,4.213359e-7,0.000014600985,0.00026832847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911743,0.00018233928,0.00019229454,0.0001455505,0.0001836455,0.00017873164],"domain_scores_gemma":[0.995921,0.0031432193,0.00018321398,0.0006549775,0.00006067814,0.00003686731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005946606,0.000118590855,0.00015375411,0.000022788061,0.00038082915,0.000033346278,0.00045327164,0.000034806675,0.0000076004876],"category_scores_gemma":[0.00016669759,0.00003960793,0.00006607347,0.00029200863,0.0010178307,0.00006823169,0.00007009956,0.000109448105,0.0000032581984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012512835,0.00004131784,0.005068206,0.000008528155,0.000062327366,5.179991e-7,0.0003333007,7.0731126e-8,0.00002953997,0.9919642,0.0010724829,0.0012943852],"study_design_scores_gemma":[0.0011968678,0.000033632125,0.0055817473,0.000037375943,0.00004622946,0.000003517998,0.0002455905,0.000007980928,0.00033849137,0.99029595,0.0021375576,0.00007507615],"about_ca_topic_score_codex":0.000008365906,"about_ca_topic_score_gemma":0.000015933947,"teacher_disagreement_score":0.008259326,"about_ca_system_score_codex":0.000009653109,"about_ca_system_score_gemma":0.000019218975,"threshold_uncertainty_score":0.37502393},"labels":[],"label_agreement":null},{"id":"W2579755476","doi":"","title":"On the Hosoya index and the Merrifield-Simmons index of bicyclic graphs with given matching number.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Index (typography); Matching (statistics); Discrete mathematics; Statistics; Computer science","score_opus":0.012962276215817291,"score_gpt":0.2520460377340407,"score_spread":0.23908376151822341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579755476","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98868,0.000016339955,0.00016394483,0.0035029047,0.000088672234,0.00038994916,0.0000061884975,0.000037149413,0.007114852],"genre_scores_gemma":[0.99946314,0.000018935894,0.000038869784,0.00012712143,0.0000035009339,0.00009355588,3.6992833e-7,0.000019484927,0.00023503469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909645,0.00016965641,0.00020461464,0.00016935395,0.000196559,0.00016338145],"domain_scores_gemma":[0.99625325,0.0029101423,0.00017536018,0.0005729508,0.00004667946,0.000041602383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000512844,0.00014069735,0.00020452132,0.000037402344,0.00024150778,0.000022137547,0.0003140888,0.0000673631,0.00006578409],"category_scores_gemma":[0.00013762747,0.000057919395,0.000067945744,0.00023281237,0.00043433308,0.000058144586,0.00006537831,0.00018008419,0.000014560791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010051002,0.000081176295,0.003654692,0.000010860539,0.00007278391,5.9596425e-7,0.0006958013,2.685865e-7,0.00013867313,0.9941643,0.0008543059,0.00022605057],"study_design_scores_gemma":[0.0013976753,0.000038989845,0.0024870045,0.00009339747,0.00003827995,0.0000050851563,0.00025872688,0.0000068220606,0.0006591165,0.9947454,0.0001722858,0.000097214375],"about_ca_topic_score_codex":0.000046687932,"about_ca_topic_score_gemma":0.000014950356,"teacher_disagreement_score":0.0107831275,"about_ca_system_score_codex":0.000007335387,"about_ca_system_score_gemma":0.00001623671,"threshold_uncertainty_score":0.23618844},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99382466,0.00016648273,0.00023913659,0.0029437088,0.000007947827,0.00086077343,0.00010374731,0.000049909788,0.0018036615],"genre_scores_gemma":[0.9983528,0.0001179466,0.00078546203,0.00005873158,0.00003275163,0.00025588283,0.000007556579,0.00001524336,0.00037358038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991982,0.00004870704,0.00030676252,0.00017747821,0.00013302664,0.00013583402],"domain_scores_gemma":[0.99761486,0.00078064157,0.0003969115,0.0010186526,0.00014482236,0.000044097593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038179848,0.00011793963,0.00018278207,0.000035473986,0.0010100516,0.00003442972,0.00059910485,0.000059124446,0.000027235614],"category_scores_gemma":[0.00023902114,0.00007225118,0.00007773289,0.00019246376,0.0003775182,0.00007626093,0.00012043719,0.00012371037,0.000010967789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008802061,0.00014089223,0.0005865424,0.00008352128,0.000059581438,1.0282838e-7,0.0011315736,0.0000049670316,0.004925087,0.99201214,0.0004133175,0.0006334903],"study_design_scores_gemma":[0.0006454052,0.000056340177,0.06433921,0.00018301472,0.00035759856,0.000012491632,0.00050241814,0.002722214,0.013894927,0.89839983,0.018512374,0.00037418783],"about_ca_topic_score_codex":0.000017454639,"about_ca_topic_score_gemma":0.000026773809,"teacher_disagreement_score":0.093612306,"about_ca_system_score_codex":0.0000028954084,"about_ca_system_score_gemma":0.000016068021,"threshold_uncertainty_score":0.77686024},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98635197,0.0012043637,0.0075159953,0.001059084,0.00086268067,0.000672174,0.0000043687437,0.000030066201,0.002299285],"genre_scores_gemma":[0.99911857,0.00042502143,0.0000544177,0.0000794709,0.00008313315,0.000018609953,0.0000018614395,0.00004806548,0.00017082733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753886,0.00032691038,0.00082463626,0.00020280867,0.0005372248,0.00056958344],"domain_scores_gemma":[0.9963599,0.0014136671,0.0012161678,0.0007224695,0.00023707995,0.000050739978],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0035625894,0.0003002005,0.0006213786,0.00032021574,0.00011135501,0.00005724489,0.0011540579,0.00025686788,0.000013206438],"category_scores_gemma":[0.0003474119,0.00021558326,0.0003571805,0.00045547914,0.000046443452,0.00005641043,0.0001758697,0.003408149,0.000015761516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082058796,0.00029477666,0.00004609567,0.00007975039,0.000091676906,0.000004351546,0.0004576046,0.00066633755,0.00014817965,0.99775267,0.00024569817,0.00013080823],"study_design_scores_gemma":[0.0007467489,0.0002548106,0.000040286235,0.00029210842,0.0001264119,0.000032057007,0.000079263955,0.0004084161,0.0004079399,0.9966186,0.0007850839,0.00020823108],"about_ca_topic_score_codex":0.0000052055548,"about_ca_topic_score_gemma":0.000013619116,"teacher_disagreement_score":0.01276661,"about_ca_system_score_codex":0.0004505387,"about_ca_system_score_gemma":0.0006744569,"threshold_uncertainty_score":0.99889106},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99283993,0.0013062988,0.0022567979,0.00051204866,0.00022920812,0.00045641925,0.000006930769,0.000009347603,0.0023830337],"genre_scores_gemma":[0.9978979,0.001653871,0.0001023797,0.000008901986,0.00003360675,0.000019613239,0.0000012440019,0.000039858718,0.00024259169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758536,0.0003483595,0.0009498017,0.00014907641,0.0005303011,0.00043712408],"domain_scores_gemma":[0.9951551,0.0014984278,0.0020117967,0.0008443696,0.0004488821,0.000041444535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021469004,0.0002655661,0.00070402655,0.00009787063,0.00009469255,0.00002544187,0.0012744702,0.00018313479,0.000018391518],"category_scores_gemma":[0.00014842907,0.00014508044,0.00031839582,0.00047033554,0.00026799497,0.00005312906,0.00019797016,0.0017659565,0.000004222091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018895956,0.00036565482,0.0047513274,0.00016964883,0.00036354165,0.0000012881092,0.00050114526,0.00007997391,0.000057233578,0.9930757,0.00027418643,0.00017133879],"study_design_scores_gemma":[0.0007678783,0.0001196964,0.00070020545,0.0003251666,0.00023050624,0.00011875268,0.00046735216,0.0000112215575,0.0018252439,0.99494094,0.00034260342,0.00015042475],"about_ca_topic_score_codex":0.000015050123,"about_ca_topic_score_gemma":0.00002417308,"teacher_disagreement_score":0.005058018,"about_ca_system_score_codex":0.00012491488,"about_ca_system_score_gemma":0.0006266183,"threshold_uncertainty_score":0.76723003},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5655901,0.0000029849582,0.280817,0.00424835,0.00009410509,0.0009945548,0.00006695188,0.00022789321,0.14795804],"genre_scores_gemma":[0.9573425,9.709805e-7,0.014813888,0.00023729145,0.000023332943,0.00013480033,0.0000011241759,0.000008122054,0.027437951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975336,0.000005292456,0.00007241843,0.00006569306,0.000033436074,0.00006977924],"domain_scores_gemma":[0.99943227,0.00036252747,0.000020156685,0.00015355536,0.000013396152,0.0000181268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010385096,0.00003280507,0.00003757429,0.000013392867,0.000038672057,0.000003275979,0.000060137558,0.000013607496,0.0004951718],"category_scores_gemma":[0.00007309429,0.000017539465,0.000030117248,0.000020731797,0.000009430731,0.000016014126,0.0000069447706,0.000007966952,0.00016121221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050607587,0.000042585925,0.000014990649,0.0000033415017,0.000005882848,1.6401364e-8,0.000007543996,5.351926e-9,0.0020413804,0.96944195,0.024801785,0.0036354829],"study_design_scores_gemma":[0.00023411035,0.00002494047,0.000019228222,0.0000066824477,0.0000052566584,1.2257001e-7,0.0000070312867,0.0000029918594,0.011232811,0.9646691,0.02376487,0.00003284175],"about_ca_topic_score_codex":1.637551e-7,"about_ca_topic_score_gemma":0.0000015829241,"teacher_disagreement_score":0.39175242,"about_ca_system_score_codex":0.0000039751963,"about_ca_system_score_gemma":0.0000023177765,"threshold_uncertainty_score":0.54217845},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9709468,0.00006850228,0.008175457,0.0008034643,0.000021807251,0.0007057512,0.00008987235,0.00017075943,0.019017613],"genre_scores_gemma":[0.96914375,0.000039488426,0.030163677,0.000036784957,0.000047164915,0.000082701124,0.000009632516,0.00006310486,0.00041370463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869305,0.000037837886,0.00029509707,0.00036334633,0.00021669663,0.0003939636],"domain_scores_gemma":[0.99771017,0.00023553173,0.0003803183,0.0014355065,0.000059602262,0.00017886011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033667116,0.00036211486,0.00046080342,0.00005208101,0.0008439476,0.00030559828,0.00047533467,0.00008246243,0.000046821708],"category_scores_gemma":[0.00007490745,0.00021751648,0.000093312075,0.000096009,0.000664983,0.00023310231,0.000077633464,0.00022388498,0.000008475004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038677692,0.00020056669,0.003083394,0.00026761912,0.00018174908,0.000018486206,0.002901575,6.3858823e-7,0.00021211927,0.99256194,0.000097957425,0.0004352598],"study_design_scores_gemma":[0.0008498901,0.00020282684,0.0060745985,0.00024648604,0.00018015734,0.00016735803,0.0019312536,0.0002807956,0.002876714,0.9863044,0.00039432003,0.0004911976],"about_ca_topic_score_codex":0.000014862533,"about_ca_topic_score_gemma":0.0001683899,"teacher_disagreement_score":0.021988219,"about_ca_system_score_codex":0.000017095284,"about_ca_system_score_gemma":0.000030132398,"threshold_uncertainty_score":0.88700646},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9768681,0.0000293029,0.000103916616,0.00023428253,0.000035603203,0.00017004786,0.000013074698,0.000045421388,0.02250024],"genre_scores_gemma":[0.99684167,0.00001974536,0.0025235028,0.000028089582,0.000014482578,0.00005228282,0.000002586308,0.000011861071,0.0005057792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999479,0.000025685991,0.00014400123,0.00014333133,0.00007185011,0.00013615024],"domain_scores_gemma":[0.99922234,0.000107746695,0.00009883016,0.0005188988,0.000010515166,0.000041686202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017334026,0.00008746042,0.00013844628,0.000024902596,0.00028096518,0.00007388508,0.00018964206,0.000041706215,0.0001456336],"category_scores_gemma":[0.00012129114,0.00007862303,0.000030688876,0.00004265096,0.0001295652,0.00012896705,0.00004876039,0.00006427601,0.00008016052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004124391,0.000049555514,0.02811884,0.00007279002,0.000007653154,0.0000043641808,0.00046767117,5.6463215e-8,0.00017316194,0.9697709,0.0008280329,0.00050285837],"study_design_scores_gemma":[0.00019234476,0.0000049535515,0.07372936,0.000060856633,0.000009092773,0.0000074222194,0.00006948419,0.000045572106,0.00040563714,0.9243536,0.0010261469,0.00009553766],"about_ca_topic_score_codex":0.000015323465,"about_ca_topic_score_gemma":0.00012918799,"teacher_disagreement_score":0.04561052,"about_ca_system_score_codex":0.000007443238,"about_ca_system_score_gemma":0.000005102296,"threshold_uncertainty_score":0.3206154},"labels":[],"label_agreement":null},{"id":"W2591848420","doi":"","title":"On Harmonic Indices of Trees, Unicyclic graphs and Bicyclic graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.03238055584523256,"score_gpt":0.30340022209151707,"score_spread":0.2710196662462845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591848420","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99314326,0.00012737751,0.0000013252995,0.00019504783,0.00022429944,0.00023712436,0.000013683974,0.000061599574,0.005996276],"genre_scores_gemma":[0.9994215,0.000108931294,0.00015713919,0.000033185883,0.0000019142267,0.000039338684,0.0000034302648,0.00002261374,0.00021194661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904627,0.00006280468,0.00026443464,0.00025346488,0.00017132815,0.00020172868],"domain_scores_gemma":[0.99803644,0.00042277723,0.00038391288,0.0010236143,0.00003955307,0.00009372319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003273712,0.00016733314,0.00027672367,0.00016182946,0.00047224486,0.00005807962,0.0005134746,0.000101759,0.0000282096],"category_scores_gemma":[0.00020340513,0.00015213365,0.000102810845,0.00014700412,0.00035057633,0.0001332652,0.0001020735,0.00017438532,0.000015522688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000129727705,0.00022675688,0.005784469,0.000028187887,0.000054012122,0.0000016916753,0.00016343428,3.2118162e-8,0.0008125307,0.99083656,0.0008606054,0.0012187609],"study_design_scores_gemma":[0.0008063667,0.00011014812,0.030437589,0.000058981757,0.000056306926,0.0000023545529,0.00003574235,0.000008057615,0.00416571,0.96393377,0.00023750769,0.00014748191],"about_ca_topic_score_codex":0.00003353402,"about_ca_topic_score_gemma":0.000025887335,"teacher_disagreement_score":0.026902791,"about_ca_system_score_codex":0.0000080104455,"about_ca_system_score_gemma":0.000015190867,"threshold_uncertainty_score":0.620383},"labels":[],"label_agreement":null},{"id":"W2592374713","doi":"","title":"Computing Wiener Index of C 12n Fullerenes.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Index (typography); Fullerene; Mathematics; Wiener index; Computer science; Combinatorics; Physics; World Wide Web; Quantum mechanics","score_opus":0.036914196792453835,"score_gpt":0.31519262087534294,"score_spread":0.2782784240828891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592374713","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9847847,0.00001671402,0.00016282081,0.000121079545,0.00040748573,0.00011816941,0.0000029000898,0.000043748667,0.014342367],"genre_scores_gemma":[0.99911743,0.0000025041236,0.00061485165,0.000015003083,0.000008444368,0.00000675705,0.0000013439517,0.0000140683,0.00021957056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935734,0.000029702709,0.00020746188,0.00013945192,0.000124005,0.00014205238],"domain_scores_gemma":[0.99861133,0.00017549268,0.00028345743,0.0008049022,0.00007884387,0.00004598213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002962777,0.00009155275,0.00018273159,0.00003538962,0.00035227227,0.00003371851,0.00045066638,0.00006261176,0.000037701342],"category_scores_gemma":[0.00019641776,0.000086650485,0.00006784788,0.00005379248,0.00013640482,0.00007779605,0.00013787721,0.00009510196,0.000017590271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000476428,0.00011229888,0.00771213,0.000024135501,0.000021228072,7.8131256e-7,0.00015433865,0.00000123622,0.0004894819,0.989825,0.00075792253,0.00089664425],"study_design_scores_gemma":[0.00044345963,0.000017014538,0.010914173,0.000033461976,0.000015990303,0.0000014749804,0.000043984095,0.00014618224,0.0033356524,0.98439044,0.00056403416,0.00009411439],"about_ca_topic_score_codex":0.000020230791,"about_ca_topic_score_gemma":0.0000036513686,"teacher_disagreement_score":0.014332742,"about_ca_system_score_codex":0.000008441512,"about_ca_system_score_gemma":0.000018106844,"threshold_uncertainty_score":0.35335043},"labels":[],"label_agreement":null},{"id":"W2592557224","doi":"","title":"The Laplacian spectral radius for bicyclic graphs with given independence number.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Independence number; Spectral radius; Independence (probability theory); Laplace operator; Combinatorics; RADIUS; Statistics; Graph; Mathematical analysis; Physics; Eigenvalues and eigenvectors; Computer science; Quantum mechanics; Computer security","score_opus":0.02427209226619297,"score_gpt":0.30515635858914275,"score_spread":0.28088426632294977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592557224","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.982594,0.000021368993,0.00007536522,0.0013016701,0.0004712195,0.0006908918,0.0000147928595,0.00008594211,0.014744748],"genre_scores_gemma":[0.9974952,0.000014331802,0.00092606596,0.00002768978,0.000013464582,0.00021923425,0.0000025525087,0.000026649715,0.0012748255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908936,0.000039154547,0.00016556724,0.00022072646,0.00018429573,0.00030092444],"domain_scores_gemma":[0.9980613,0.00053861336,0.00022437515,0.0010161272,0.000079355545,0.00008024198],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00045397962,0.00014560463,0.00016110652,0.000020312498,0.0018131941,0.00020133467,0.0007903061,0.00007616915,0.000018297858],"category_scores_gemma":[0.00021601502,0.0000992501,0.00009188743,0.00007944511,0.0002836013,0.00014694936,0.000055899825,0.00018520767,0.000043595253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048238606,0.0000760528,0.004741939,0.000012462785,0.000048038055,0.0000022233876,0.00015250633,8.578287e-8,0.00007188953,0.99167734,0.0027719687,0.00039724418],"study_design_scores_gemma":[0.0008305451,0.00006711281,0.0041257595,0.000021674734,0.000041095274,0.0000121739895,0.00007551107,0.000014526432,0.0013587008,0.98756564,0.005735764,0.00015148072],"about_ca_topic_score_codex":0.000019169529,"about_ca_topic_score_gemma":0.000070976406,"teacher_disagreement_score":0.014901185,"about_ca_system_score_codex":0.000018737306,"about_ca_system_score_gemma":0.000035552654,"threshold_uncertainty_score":0.9994863},"labels":[],"label_agreement":null},{"id":"W2592627363","doi":"","title":"Spectral determination of a class of tricyclic graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tricyclic; Mathematics; Class (philosophy); Combinatorics; Chemistry; Stereochemistry; Computer science; Artificial intelligence","score_opus":0.03159058847447061,"score_gpt":0.31093711473108354,"score_spread":0.27934652625661294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592627363","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99096215,0.000013113436,0.00006116536,0.0000842371,0.00020176683,0.00017070853,0.0000070646893,0.000020151556,0.0084796455],"genre_scores_gemma":[0.9985571,0.000008208992,0.0012790088,0.0000037750794,0.0000027362469,0.000017503813,0.0000015050955,0.000010133944,0.00012002029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935645,0.00003537083,0.00025972544,0.00011094177,0.00013078788,0.000106712745],"domain_scores_gemma":[0.99860674,0.00018864,0.00043536036,0.0006557787,0.00008056144,0.000032895634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026571236,0.000078222016,0.00019937055,0.000079914935,0.00013314691,0.000012800879,0.00035658004,0.000058876747,0.00001884585],"category_scores_gemma":[0.00028098666,0.00007591747,0.0001069269,0.000095636475,0.0001559694,0.000098502685,0.00004336336,0.00007071163,0.0000039391543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010105676,0.00019585685,0.0025009334,0.00004466807,0.000012594888,5.846402e-7,0.00015158903,3.318755e-8,0.0045301244,0.9912935,0.000107798005,0.0011522422],"study_design_scores_gemma":[0.0004999495,0.000055700504,0.011397533,0.000024109015,0.00003512355,0.0000014456859,0.000028682362,0.000037638878,0.043427415,0.94434285,0.00008303878,0.00006651245],"about_ca_topic_score_codex":0.000011088473,"about_ca_topic_score_gemma":0.0000043839104,"teacher_disagreement_score":0.046950616,"about_ca_system_score_codex":0.000008572577,"about_ca_system_score_gemma":0.0000147511155,"threshold_uncertainty_score":0.30958247},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61946553,0.000011743591,0.37288356,0.00007400026,0.000008921182,0.00037485667,0.0000072739595,0.00005180986,0.007122294],"genre_scores_gemma":[0.75832474,0.0000030840354,0.24156846,0.000023582044,0.000014278887,0.000036865014,0.0000022314578,0.000011623967,0.000015095611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926794,0.000008064475,0.00026382005,0.00018034654,0.0001607313,0.00011907686],"domain_scores_gemma":[0.9992195,0.0002473575,0.00017995911,0.00020195873,0.00009564981,0.000055589517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025888937,0.00011324091,0.00020253584,0.0000732783,0.00011601736,0.000025904805,0.00009464633,0.000030318772,0.000010578382],"category_scores_gemma":[0.000016898795,0.00009013575,0.000022771583,0.00037172745,0.0001328364,0.000030832387,0.000027241289,0.000044110195,0.000008595775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032114916,0.00011449381,0.000024803063,0.00013754943,0.000018967923,1.8430957e-7,0.0013969259,0.0000066779016,0.001479656,0.99466306,0.00017666622,0.0019489179],"study_design_scores_gemma":[0.00021162118,0.0001184755,0.00030894374,0.00004927249,0.00003978939,0.000003932884,0.00041184315,0.00071699533,0.005045622,0.9928708,0.00010360685,0.000119097844],"about_ca_topic_score_codex":0.0000026864818,"about_ca_topic_score_gemma":0.000015505912,"teacher_disagreement_score":0.13885924,"about_ca_system_score_codex":0.000007821933,"about_ca_system_score_gemma":0.0000097709635,"threshold_uncertainty_score":0.36756292},"labels":[],"label_agreement":null},{"id":"W2592983026","doi":"","title":"The Wiener index of cacti given matching number.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Matching (statistics); Index (typography); Statistics; Combinatorics; Computer science; World Wide Web","score_opus":0.02607460745190234,"score_gpt":0.3159737583519705,"score_spread":0.2898991509000682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592983026","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9750923,0.000011528293,0.000033341803,0.00054565637,0.00043658042,0.00013490955,0.0000033383951,0.000028582795,0.023713743],"genre_scores_gemma":[0.99898314,0.000009260426,0.00016615514,0.000012304098,0.000007305489,0.0000256957,5.811302e-7,0.000013834057,0.00078173354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999411,0.00004272568,0.0001698709,0.00010528017,0.00013201746,0.00013909778],"domain_scores_gemma":[0.9983457,0.00040539537,0.0002569692,0.00089624774,0.00005944573,0.000036295136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039534154,0.00007930731,0.00012272107,0.000010696663,0.00082415773,0.00006565228,0.00055723183,0.000048945178,0.000026136406],"category_scores_gemma":[0.00020170315,0.00005769197,0.00006483005,0.000040191844,0.00015703113,0.00010850914,0.00011136653,0.00012514836,0.000032274187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069137136,0.00005805165,0.0036627522,0.000010673962,0.00002574967,6.0153025e-7,0.00027895413,3.669896e-7,0.0002610755,0.9939061,0.0012908395,0.0004979209],"study_design_scores_gemma":[0.00024827864,0.0000074001105,0.0072130486,0.000018467346,0.000015664511,0.0000022040263,0.00013906296,0.000011329652,0.001343596,0.9881147,0.0028184543,0.000067759545],"about_ca_topic_score_codex":0.000059639824,"about_ca_topic_score_gemma":0.000015607015,"teacher_disagreement_score":0.02389081,"about_ca_system_score_codex":0.000010729095,"about_ca_system_score_gemma":0.0000172921,"threshold_uncertainty_score":0.63388383},"labels":[],"label_agreement":null},{"id":"W2593046873","doi":"","title":"On the signless Laplacian spetral radius of bicyclic graphs with fixed diameter.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; RADIUS; Discrete mathematics; Computer network; Computer science","score_opus":0.03426526987705362,"score_gpt":0.2847459502372293,"score_spread":0.2504806803601757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593046873","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.987831,0.000008184241,0.000019808942,0.00044329034,0.00021047099,0.0003090584,0.000011222821,0.000037396727,0.011129552],"genre_scores_gemma":[0.9992883,0.0000038142675,0.00027500186,0.00004767592,0.0000043756854,0.00005232632,0.00000180244,0.000022146973,0.00030454953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991987,0.00007815934,0.00017873969,0.00017510809,0.00018264606,0.00018669349],"domain_scores_gemma":[0.9977002,0.0007489756,0.0002676268,0.0011815828,0.000045513592,0.000056060493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028636502,0.00014163816,0.0002095268,0.000051249925,0.00044813126,0.000056733206,0.00063282397,0.000057505564,0.00005689241],"category_scores_gemma":[0.00021863995,0.000089669345,0.00009264826,0.000116373805,0.00031669583,0.00007237778,0.00004654897,0.00016623933,0.000026411755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035354602,0.00019897336,0.002230551,0.000016525611,0.000052242307,0.0000023793993,0.00019970653,2.6542887e-7,0.0006585271,0.99501264,0.0014484841,0.00014436495],"study_design_scores_gemma":[0.0005703028,0.00013996095,0.0053360914,0.0000542455,0.000040175582,0.000002296788,0.0000626351,0.000007677916,0.010427178,0.98308134,0.00015846154,0.00011961566],"about_ca_topic_score_codex":0.000014569002,"about_ca_topic_score_gemma":0.000012818297,"teacher_disagreement_score":0.011931267,"about_ca_system_score_codex":0.000009635721,"about_ca_system_score_gemma":0.0000164892,"threshold_uncertainty_score":0.36566097},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027693126,0.00076998293,0.02291868,0.0021087737,0.0001330487,0.00282168,0.000762648,0.00025780662,0.94253427],"genre_scores_gemma":[0.80408347,0.001171274,0.008593337,0.00082418486,0.0003524027,0.0007378062,0.0002611239,0.0004993767,0.18347701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978873,0.00037537247,0.0005997352,0.00044717544,0.0003214843,0.00036893747],"domain_scores_gemma":[0.99643517,0.0024700484,0.00019723503,0.0007309493,0.000040000014,0.00012659824],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029682557,0.00046878302,0.00066412834,0.00024058201,0.0001437055,0.000075140815,0.00040714288,0.00045985417,0.00049265753],"category_scores_gemma":[0.00012764902,0.00026235302,0.00027210917,0.00011796223,0.00042141075,0.000045914025,0.00010394805,0.0005494342,0.000094691124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004913626,0.000089732515,0.00004594448,0.00014988634,0.000059653004,0.00001797897,0.00027643188,7.358273e-8,0.0000042470624,0.994079,0.0008615945,0.004410579],"study_design_scores_gemma":[0.00029620813,0.00004267073,0.00019061497,0.00029790026,0.000096242795,0.000049091697,0.00004581009,0.000054443113,0.0000026529772,0.99246144,0.006105438,0.0003574931],"about_ca_topic_score_codex":0.0000024420335,"about_ca_topic_score_gemma":0.00005022581,"teacher_disagreement_score":0.7763904,"about_ca_system_score_codex":0.000014915189,"about_ca_system_score_gemma":0.000017192522,"threshold_uncertainty_score":0.9999829},"labels":[],"label_agreement":null},{"id":"W2594435072","doi":"","title":"Extremal Laplacian Estrada Index of Threshold Graphs with Given Size.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Laplace operator; Combinatorics; Statistics; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.02679138242446925,"score_gpt":0.28186781658815707,"score_spread":0.2550764341636878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594435072","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9815715,0.000014865394,0.000017542783,0.00023125853,0.00016894618,0.00023793224,0.0000100417965,0.000050777573,0.017697126],"genre_scores_gemma":[0.9990578,0.000004648406,0.0005190111,0.0000155255,0.0000046794803,0.0000333554,0.0000016985827,0.000023075789,0.00034016703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991748,0.000024783249,0.00020569748,0.0001981285,0.00020363297,0.00019297675],"domain_scores_gemma":[0.99830914,0.00022268659,0.00029205056,0.0010196741,0.00007908599,0.00007738907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022165693,0.00014595863,0.00024139755,0.000040544157,0.00033723883,0.000047063862,0.00053302664,0.000082148115,0.00005140952],"category_scores_gemma":[0.000118875796,0.00012325194,0.00007726887,0.0000962503,0.00026429666,0.00014876676,0.00006963879,0.0001576739,0.000008609186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003900328,0.0002068733,0.03130632,0.000035107125,0.000049596816,0.00000604731,0.00016977279,4.857327e-7,0.0004767152,0.9670194,0.0005653371,0.0001253694],"study_design_scores_gemma":[0.00086049654,0.00008558948,0.021250527,0.000055230466,0.000041532076,0.0000054128404,0.00008786165,0.000016278173,0.002555193,0.9746638,0.00023184148,0.0001462373],"about_ca_topic_score_codex":0.000022342841,"about_ca_topic_score_gemma":0.000033976903,"teacher_disagreement_score":0.017486328,"about_ca_system_score_codex":0.000009268562,"about_ca_system_score_gemma":0.00003384547,"threshold_uncertainty_score":0.5026068},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99537146,0.0002806689,0.00001578327,0.00011172241,0.000041480114,0.000034220724,0.000010589907,0.0000020768477,0.0041319947],"genre_scores_gemma":[0.99965805,0.000007547539,0.00021885512,0.00000745322,0.00004812578,9.425718e-7,7.488213e-7,0.000009765906,0.000048537077],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995045,0.000011207568,0.00021090989,0.000069584145,0.000084493964,0.00011930695],"domain_scores_gemma":[0.9989935,0.000017854856,0.0003703647,0.00027080308,0.00010161262,0.0002458725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011817516,0.00008084749,0.0001568881,0.000052768653,0.000102153164,0.00003696239,0.00021603826,0.00007477405,0.00001434204],"category_scores_gemma":[0.00015969874,0.00007867772,0.00006382259,0.000032745116,0.00020606932,0.000043124077,0.00000927274,0.00014812007,2.004525e-8],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008954206,0.000007310696,0.0061354307,0.0001358314,0.0000576095,0.000039961105,0.00028617922,0.000003840852,0.98356843,0.009553886,0.000043156724,0.00015939059],"study_design_scores_gemma":[0.00031085446,0.000016960541,0.0034072928,0.00010372494,0.000079472404,0.00020801999,0.0002110964,0.000015740861,0.43367335,0.56170577,0.00014984306,0.00011786889],"about_ca_topic_score_codex":0.00056107825,"about_ca_topic_score_gemma":0.0005075464,"teacher_disagreement_score":0.55215186,"about_ca_system_score_codex":0.000021465856,"about_ca_system_score_gemma":0.00016533039,"threshold_uncertainty_score":0.32083842},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9674948,0.000005419991,0.0016269865,0.0017470433,0.00006291868,0.00051880954,0.000052254345,0.000042092903,0.028449718],"genre_scores_gemma":[0.9924805,0.0000037852956,0.0065803467,0.0000633716,0.000038547772,0.0000655708,0.0000024196904,0.000024734609,0.00074070593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988359,0.00007055495,0.0004508073,0.00018761276,0.00025555652,0.00019957348],"domain_scores_gemma":[0.99555534,0.0015154477,0.0006008404,0.0022074783,0.00006426035,0.000056613942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011367308,0.00017200634,0.00031263166,0.00002976651,0.0004374567,0.00007549754,0.00088670105,0.00007631172,0.00020977847],"category_scores_gemma":[0.0022493503,0.00010307259,0.00018749305,0.000040154006,0.0003789001,0.000075227224,0.00014598994,0.00015542713,0.000055807253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011233712,0.00017977701,0.000051977626,0.0001328109,0.000032708816,0.0000010958391,0.00058539846,0.0000014241047,0.0010753154,0.9960416,0.0017802984,0.00010635716],"study_design_scores_gemma":[0.00014754126,0.00004014361,0.000519374,0.00010949755,0.00007648699,0.0000053611916,0.00026272924,0.00030505843,0.006833032,0.99125266,0.0003241986,0.00012392625],"about_ca_topic_score_codex":0.0000048645534,"about_ca_topic_score_gemma":0.000004656092,"teacher_disagreement_score":0.027709013,"about_ca_system_score_codex":0.000012977654,"about_ca_system_score_gemma":0.000018786592,"threshold_uncertainty_score":0.42031783},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004992585,0.000033078406,0.0058409227,0.0007734717,0.000019354153,0.0011498467,0.00004288344,0.000031104308,0.99161005],"genre_scores_gemma":[0.22612141,0.000045541867,0.0016697154,0.00047783842,0.000052731204,0.0010491993,0.0000848161,0.00018481114,0.7703139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992336,0.0002392182,0.0001764071,0.00010167613,0.00016395084,0.000085170665],"domain_scores_gemma":[0.9988179,0.0005876649,0.0001460397,0.00043248286,0.000007909045,0.00000796873],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006069074,0.0001089892,0.00013202654,0.000027405846,0.00003670114,0.000010021016,0.00021388737,0.000078074976,0.0011950816],"category_scores_gemma":[0.00006805542,0.000047937356,0.000055068955,0.0001374,0.00006477658,0.0000050501285,0.000008740965,0.000121683595,0.000038160404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.5631264e-7,0.00011738055,0.0000018626876,0.000028048562,0.000010027076,6.897329e-8,0.00008572864,6.1528976e-7,0.0000036111073,0.6683936,0.33133283,0.000025555773],"study_design_scores_gemma":[0.00005896581,0.00002187098,0.0000070227748,0.00011558321,0.000025976715,4.7997e-7,0.00029710255,0.000005794435,0.00011415199,0.9612709,0.038021944,0.000060197144],"about_ca_topic_score_codex":0.000013561563,"about_ca_topic_score_gemma":0.00002667079,"teacher_disagreement_score":0.29331088,"about_ca_system_score_codex":0.000014018329,"about_ca_system_score_gemma":0.000012137154,"threshold_uncertainty_score":0.99971795},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9927421,0.00007030613,0.0031016709,0.00068572274,0.000030155114,0.0001675925,0.000011453277,0.00006754639,0.0031234433],"genre_scores_gemma":[0.99406224,0.000081965896,0.004915232,0.00008100545,0.000021026977,0.000057482244,0.0000013234147,0.000016242326,0.00076346874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993167,0.00006251756,0.00018230928,0.00017841658,0.00008478815,0.00017529372],"domain_scores_gemma":[0.99928075,0.000352473,0.000059943366,0.00023590238,0.000013813443,0.000057120127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020297142,0.00011175373,0.00015301007,0.0000495649,0.00012933233,0.000018212082,0.00010438588,0.00007746203,0.000078512756],"category_scores_gemma":[0.000096125674,0.00007931041,0.000041665025,0.00015698196,0.00028020106,0.00008911139,0.000015165414,0.000083176026,0.000037177877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069765624,0.000041505653,0.013006345,0.00003758496,0.000010843314,0.000004116049,0.0011342447,2.6343361e-8,0.0009387111,0.9823798,0.00040524986,0.0020346004],"study_design_scores_gemma":[0.0003285198,0.000007774117,0.0071639367,0.000059860202,0.000011625992,0.000011271376,0.00018542004,0.0000050077347,0.0007153758,0.9896291,0.001754052,0.00012808057],"about_ca_topic_score_codex":0.0000075001467,"about_ca_topic_score_gemma":0.00006410532,"teacher_disagreement_score":0.0072492803,"about_ca_system_score_codex":0.000030447367,"about_ca_system_score_gemma":0.000006974759,"threshold_uncertainty_score":0.32341847},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98668087,0.00009391427,0.0072911573,0.0018189484,0.000047456768,0.0008112304,0.00002496929,0.00009983874,0.0031316157],"genre_scores_gemma":[0.9860879,0.000024041126,0.011207312,0.00025445758,0.00008923551,0.0004873419,0.000003522236,0.000018408551,0.0018277412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940455,0.000033859866,0.00014638907,0.00015979912,0.00009047964,0.00016491122],"domain_scores_gemma":[0.9987266,0.00078107894,0.000047584104,0.00034830923,0.000055888337,0.000040555722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002162513,0.000097827855,0.000107730906,0.000011259354,0.00060719735,0.0000125593415,0.0001769548,0.000075458214,0.00023681285],"category_scores_gemma":[0.00024832616,0.00006651828,0.000102401915,0.00012406813,0.00033778662,0.000033775268,0.000013158553,0.00013983283,0.000027048454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020790843,0.00009577625,0.0014870568,0.000057479305,0.00001543704,8.109753e-7,0.0030172113,3.9460843e-7,0.00020527253,0.9864712,0.008044659,0.00058395957],"study_design_scores_gemma":[0.00027933135,0.000023865015,0.002024318,0.000004026442,0.000042179854,0.00004775909,0.0005578037,0.00008060554,0.00079911604,0.9749443,0.021083606,0.000113086135],"about_ca_topic_score_codex":0.000004248791,"about_ca_topic_score_gemma":0.000010398769,"teacher_disagreement_score":0.013038947,"about_ca_system_score_codex":0.000020848114,"about_ca_system_score_gemma":0.000025000145,"threshold_uncertainty_score":0.46701324},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9439978,0.00078923133,0.0045779096,0.020090712,0.0003054248,0.0010671925,0.000076524775,0.00021100475,0.028884226],"genre_scores_gemma":[0.9894935,0.00010242397,0.00054473395,0.0053570014,0.00031956477,0.000042032978,0.000012934618,0.000034977937,0.0040928316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982696,0.00025200174,0.00037548336,0.0003760666,0.00029563054,0.00043118844],"domain_scores_gemma":[0.9976986,0.0009393019,0.0002265703,0.00094784895,0.00005798376,0.00012970607],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004621418,0.00035860154,0.0003374337,0.00009735578,0.0010520889,0.00014410153,0.00055060774,0.00042342147,0.00036880022],"category_scores_gemma":[0.0002444736,0.0002506762,0.00027218138,0.00040188408,0.00048784434,0.000055776654,0.000022265478,0.0011122536,0.0002756822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067494984,0.00025867447,0.00004046123,0.000029114093,0.000078033016,0.00001252775,0.006631142,0.00002029721,0.00026161637,0.97397476,0.012863511,0.005762385],"study_design_scores_gemma":[0.00065141026,0.0001616192,0.0019972378,0.00007478608,0.00012066691,0.000029231793,0.0007562816,0.00012912956,0.00048681992,0.965421,0.029864658,0.0003071216],"about_ca_topic_score_codex":0.000008349434,"about_ca_topic_score_gemma":0.000011440613,"teacher_disagreement_score":0.045495726,"about_ca_system_score_codex":0.000078762874,"about_ca_system_score_gemma":0.000047588455,"threshold_uncertainty_score":0.9999946},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99311423,0.00007721728,0.0023108516,0.00005398351,0.0001308415,0.0004938999,0.0001445586,0.00008462188,0.003589801],"genre_scores_gemma":[0.9982518,0.00014092757,0.0005994155,0.0000073411393,0.000029192106,0.0000024427313,0.000017035583,0.000021877522,0.00092996063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839103,0.0001658595,0.00030593722,0.00084767985,0.000061336235,0.00022814002],"domain_scores_gemma":[0.99664044,0.00028922677,0.00067792746,0.0021053567,0.00014517219,0.00014188833],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005978767,0.00029179332,0.0005470731,0.0002640263,0.00025751305,0.000032225093,0.000760202,0.00035762248,0.00004643255],"category_scores_gemma":[0.00022730733,0.0003250708,0.000316721,0.00020907391,0.00067096564,0.0001003022,0.00062621944,0.00038936723,0.000005207415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054743603,0.00026146544,0.009165807,0.00041719936,0.0002310757,0.000010002258,0.00024883097,0.00024324763,0.0005155658,0.9881946,0.00047284688,0.00018461108],"study_design_scores_gemma":[0.00037323416,0.000023697114,0.008188776,0.00012035395,0.0003280882,0.0000017103304,0.00013769364,0.00019451414,0.0012111819,0.98906356,0.00006172806,0.0002954768],"about_ca_topic_score_codex":0.00018229328,"about_ca_topic_score_gemma":0.00008726476,"teacher_disagreement_score":0.005137583,"about_ca_system_score_codex":0.00002999328,"about_ca_system_score_gemma":0.000077482626,"threshold_uncertainty_score":0.9999201},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019652778,0.006011316,0.13506028,0.00064331916,0.0011112769,0.011329188,0.0017755975,0.0010882001,0.8410155],"genre_scores_gemma":[0.001500346,0.0005761233,0.3898371,0.000094631134,0.0001303583,0.0018168065,0.00023142126,0.00037883798,0.60543436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736255,0.00001711444,0.0010529773,0.0006726589,0.00037164992,0.0005230277],"domain_scores_gemma":[0.9952107,0.002433029,0.00082114583,0.0011435056,0.00031520825,0.00007638449],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004142213,0.00078600476,0.0013704462,0.00032708969,0.00035932366,0.00002340459,0.0004085116,0.0002958554,0.00007129505],"category_scores_gemma":[0.00031112065,0.00065662235,0.0003150841,0.00017370872,0.0005332816,0.00011227961,0.00017054686,0.00049608765,0.00014883994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003853342,0.0002526873,0.0000035748333,0.0021557258,0.00045928726,0.000009416018,0.0005282448,0.000016118092,0.000019803814,0.98566514,0.010260987,0.0005904854],"study_design_scores_gemma":[0.0008637757,0.00015239006,0.0000010203233,0.0015231806,0.0005560956,0.00002946797,0.0015570935,0.00004056965,0.000058303016,0.9250196,0.06950151,0.0006969886],"about_ca_topic_score_codex":0.0000019430465,"about_ca_topic_score_gemma":0.00019441388,"teacher_disagreement_score":0.2547768,"about_ca_system_score_codex":0.00018763675,"about_ca_system_score_gemma":0.0000483947,"threshold_uncertainty_score":0.9995885},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94227135,0.012761605,0.0046346667,0.00017241327,0.00050432136,0.00074803876,0.00013570942,0.00023599155,0.038535926],"genre_scores_gemma":[0.9051492,0.00095919333,0.023767406,0.00006268964,0.0002451993,0.000105798645,0.00033951804,0.00008618331,0.06928481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99691534,0.0002575771,0.0006695731,0.0007003432,0.00061352033,0.00084362604],"domain_scores_gemma":[0.9972569,0.000611626,0.0005582659,0.0005900659,0.000468581,0.0005145764],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005600941,0.00067252555,0.0005634283,0.00049760554,0.0127936015,0.00010777133,0.00069229124,0.00074397936,0.00009113913],"category_scores_gemma":[0.00023247131,0.0007761913,0.0006239482,0.00062581175,0.0011714315,0.00041255413,0.00013722938,0.0006464438,0.000081367296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005179208,0.0008771343,0.022889424,0.00094067084,0.00068189064,0.0010094469,0.16384181,0.00095554604,0.06151479,0.7424632,0.00041686083,0.0038913481],"study_design_scores_gemma":[0.002095774,0.00026448414,0.11358331,0.002186951,0.002600625,0.0023762293,0.3628672,0.0023398995,0.19977748,0.28563583,0.024097767,0.0021744615],"about_ca_topic_score_codex":0.023755964,"about_ca_topic_score_gemma":0.032274924,"teacher_disagreement_score":0.4568273,"about_ca_system_score_codex":0.0041079144,"about_ca_system_score_gemma":0.0012185498,"threshold_uncertainty_score":0.99971515},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9926016,0.00020149288,0.00017618373,0.00041163896,0.000055193465,0.000033070028,0.000004126408,0.000002290134,0.006514403],"genre_scores_gemma":[0.99939114,0.000004585718,0.00018621207,0.00005906132,0.00006132049,0.0000019466802,3.394755e-7,0.000007185072,0.00028819375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995167,0.0000122387,0.00020435106,0.000059015852,0.00007374327,0.00013391822],"domain_scores_gemma":[0.99901605,0.00003506966,0.00029444697,0.00032705112,0.0000895082,0.00023788391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016285403,0.000070276175,0.00015504369,0.000018759498,0.00015340757,0.000031459727,0.00040267024,0.000083177896,0.00012246333],"category_scores_gemma":[0.00037631195,0.000055047156,0.00009737291,0.0000208112,0.0002443519,0.000034387973,0.000010365692,0.000194626,0.0000010228774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016040697,0.0002871199,0.0032377802,0.00048212818,0.00041784585,0.0006726363,0.0009735947,0.0004289516,0.3499982,0.6272085,0.013112981,0.0030198733],"study_design_scores_gemma":[0.0003594268,0.000051433195,0.0003076769,0.000304409,0.000050182578,0.0001174022,0.00018004305,0.000036351703,0.43338025,0.5637434,0.0012975695,0.00017184323],"about_ca_topic_score_codex":0.000054074593,"about_ca_topic_score_gemma":0.00007769261,"teacher_disagreement_score":0.08338206,"about_ca_system_score_codex":0.000022178941,"about_ca_system_score_gemma":0.00016414447,"threshold_uncertainty_score":0.22447579},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77725303,0.00005922579,0.019615043,0.00003051093,0.0001978484,0.00010065437,0.00002028878,0.00014872328,0.20257466],"genre_scores_gemma":[0.98869824,0.000009462773,0.0033223145,0.000008198608,0.000064967244,0.0000018859354,0.000018637833,0.000011745324,0.007864542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899286,0.0000651106,0.0002605794,0.0002627516,0.00023511225,0.0001836051],"domain_scores_gemma":[0.9991398,0.00015078613,0.00018086027,0.00032717097,0.00013422655,0.00006716847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008713483,0.00015238496,0.00018859055,0.00030379096,0.0006141645,0.000018932837,0.00029641957,0.00009961487,0.000023446755],"category_scores_gemma":[0.000017410774,0.00017569837,0.00015566545,0.000616833,0.00048085835,0.00022125097,0.00007889383,0.00011182743,0.000004892888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017180697,0.00016982507,0.0019365414,0.00002520358,0.000039241422,0.00008698066,0.000014277517,0.0002556459,0.010287769,0.98675334,0.00020351572,0.0002104855],"study_design_scores_gemma":[0.0014561773,0.00007970006,0.013371103,0.00025780554,0.0002722434,0.00031157467,0.00030626915,0.0007589408,0.038521435,0.8215616,0.122301966,0.0008012175],"about_ca_topic_score_codex":0.0003472426,"about_ca_topic_score_gemma":0.00009446841,"teacher_disagreement_score":0.21144518,"about_ca_system_score_codex":0.00010484455,"about_ca_system_score_gemma":0.00012529962,"threshold_uncertainty_score":0.71647716},"labels":[],"label_agreement":null},{"id":"W2612538177","doi":"","title":"On the signless Laplacian spectral radius of tricyclic graphs with n vertices and diameter d.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Spectral radius; Tricyclic; RADIUS; Physics; Chemistry; Stereochemistry; Computer science; Computer network; Quantum mechanics","score_opus":0.02715207151651852,"score_gpt":0.2767585404666356,"score_spread":0.2496064689501171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612538177","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99443275,0.00002145424,0.000011703061,0.0004965093,0.00008923973,0.00022777214,0.000004381843,0.000019114712,0.0046970854],"genre_scores_gemma":[0.99962986,0.000009703429,0.00019467421,0.000037677586,0.0000027973,0.000031879474,4.92052e-7,0.000012449867,0.000080451595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994379,0.000054815628,0.000121575984,0.00013744405,0.00011919094,0.00012905018],"domain_scores_gemma":[0.99846613,0.0006753798,0.00016592395,0.0006257817,0.000024421222,0.000042354757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023734912,0.00010131731,0.00015640231,0.0000378369,0.00034143904,0.000056881247,0.00030542724,0.000036718004,0.000016711683],"category_scores_gemma":[0.00014701564,0.00006138477,0.000042657077,0.00007145856,0.00026157935,0.00007422476,0.000031863598,0.00010673557,0.0000042860893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003951519,0.000118204516,0.002740899,0.000016164338,0.00004085934,0.0000015138511,0.00027910192,1.0076932e-7,0.00039282822,0.99594754,0.0002606218,0.00016266137],"study_design_scores_gemma":[0.0005448477,0.00013569312,0.010574632,0.000032594766,0.000047953596,0.0000021542573,0.0000799975,0.000010157637,0.0055067325,0.98290634,0.000074143136,0.00008472269],"about_ca_topic_score_codex":0.000011191735,"about_ca_topic_score_gemma":0.000008903238,"teacher_disagreement_score":0.013041159,"about_ca_system_score_codex":0.000005003644,"about_ca_system_score_gemma":0.000008547,"threshold_uncertainty_score":0.26261076},"labels":[],"label_agreement":null},{"id":"W2612569969","doi":"","title":"On the Laplacian Estrada index of graphs with given chromatic number.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Chromatic scale; Combinatorics; Laplace operator; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.022238575197236626,"score_gpt":0.281020372039026,"score_spread":0.25878179684178937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612569969","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9762621,0.000002660338,0.0000124784,0.0006077349,0.000114239985,0.0002818109,0.0000060947445,0.000032857435,0.022680052],"genre_scores_gemma":[0.99955875,0.0000020475436,0.00014842863,0.000033790708,0.0000025070135,0.00005152358,0.0000012367681,0.000017471937,0.00018426027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931324,0.000053942564,0.0001647215,0.00013407346,0.00019252335,0.0001415148],"domain_scores_gemma":[0.9980599,0.0005021164,0.00027908408,0.0010670843,0.000048619455,0.00004318731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026858313,0.0001197056,0.00017671198,0.000022997665,0.00044195086,0.00004504736,0.00055453804,0.00005070776,0.00008127595],"category_scores_gemma":[0.00017004312,0.00007631425,0.000060692237,0.00009128503,0.00025322888,0.00007151532,0.000042741045,0.00014735942,0.000036767986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016486416,0.00017116658,0.004522998,0.000029666657,0.000048719532,0.0000019276333,0.00025529563,3.886451e-7,0.00006312534,0.9935326,0.0012852341,0.00007241699],"study_design_scores_gemma":[0.00044150377,0.00006966104,0.008781479,0.00008850778,0.00003132937,0.0000040914556,0.00010586453,0.000018500741,0.0014093961,0.98883396,0.0001201869,0.00009551033],"about_ca_topic_score_codex":0.000024578956,"about_ca_topic_score_gemma":0.000015630492,"teacher_disagreement_score":0.023296662,"about_ca_system_score_codex":0.00000943586,"about_ca_system_score_gemma":0.000023487735,"threshold_uncertainty_score":0.33991733},"labels":[],"label_agreement":null},{"id":"W2613146741","doi":"","title":"Laplacian and signless Laplacian characteristic polynomial of generalized subdivision corona vertex graph.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Subdivision; Vertex (graph theory); Graph; Laplace operator; Discrete mathematics; Mathematical analysis; Geography","score_opus":0.030175763734057587,"score_gpt":0.2993318505597598,"score_spread":0.26915608682570225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613146741","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.997406,0.000041476127,0.000024062201,0.00013351542,0.00058205187,0.0002756917,0.000044059077,0.00004606661,0.0014470691],"genre_scores_gemma":[0.99944496,0.00003534746,0.00022432567,0.000029284374,0.000011125494,0.000029173314,0.000015611562,0.000025902478,0.00018428474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896955,0.00008133953,0.0003078806,0.00025547363,0.00016548242,0.00022027943],"domain_scores_gemma":[0.998466,0.00021240719,0.000360136,0.00077403843,0.00007229741,0.00011508857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003408348,0.00017869481,0.00035685173,0.00007452314,0.0005118088,0.00008133549,0.00040600705,0.000116044655,0.00004489384],"category_scores_gemma":[0.00019531402,0.000173818,0.00008831893,0.00006467916,0.00025774166,0.00015589458,0.00012935896,0.00013031693,0.000012716021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007119872,0.0001632422,0.0060614413,0.00005288773,0.0000377564,0.000003577929,0.00024384969,2.8333368e-8,0.0073208767,0.9841666,0.00088436896,0.0009941552],"study_design_scores_gemma":[0.0014657298,0.00007826319,0.048387565,0.00005437484,0.00006521488,0.000004996319,0.000039213657,0.00005279327,0.0046211085,0.9444368,0.00059237203,0.0002015924],"about_ca_topic_score_codex":0.000043974047,"about_ca_topic_score_gemma":0.000016241638,"teacher_disagreement_score":0.042326123,"about_ca_system_score_codex":0.000014510825,"about_ca_system_score_gemma":0.000024167799,"threshold_uncertainty_score":0.70880926},"labels":[],"label_agreement":null},{"id":"W2613172277","doi":"","title":"The (distance) signless Laplacian spectral radii of digraphs with given dichromatic number.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.016350410814244598,"score_gpt":0.2814519750782307,"score_spread":0.2651015642639861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613172277","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9792568,0.000043437158,0.0001067286,0.00046845785,0.00021555813,0.00035029333,0.000011512123,0.000051585663,0.019495618],"genre_scores_gemma":[0.9989718,0.000013829989,0.0004339285,0.000008080627,0.0000074953105,0.000051300438,0.0000021306537,0.000023118215,0.00048828105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990617,0.00006484858,0.00024601351,0.00017160605,0.00021676907,0.00023906157],"domain_scores_gemma":[0.9978885,0.0004474581,0.00037179224,0.0011565643,0.00006672497,0.0000689579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034472946,0.0001490393,0.00023956661,0.000018711708,0.0009246105,0.000102049155,0.0007337903,0.000050969833,0.000026749087],"category_scores_gemma":[0.00011535339,0.0000995464,0.00008988552,0.000106132524,0.00050830457,0.00012228714,0.000053170872,0.00014172496,0.000019844172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003155072,0.00013661286,0.007546202,0.000044110242,0.000073401905,0.0000034822442,0.00042471226,2.2781452e-7,0.00015651995,0.9905141,0.0009228532,0.00014622686],"study_design_scores_gemma":[0.00064214686,0.00005568234,0.008313311,0.00007630354,0.00005720963,0.0000062149834,0.00022770917,0.000017934748,0.001845867,0.9877586,0.00086376566,0.00013527989],"about_ca_topic_score_codex":0.000019537909,"about_ca_topic_score_gemma":0.00006304776,"teacher_disagreement_score":0.019715024,"about_ca_system_score_codex":0.000017841427,"about_ca_system_score_gemma":0.000031242813,"threshold_uncertainty_score":0.711145},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9401084,0.00080417405,0.035543535,0.004701317,0.000050948078,0.0018155646,0.00045512803,0.000062913045,0.016458],"genre_scores_gemma":[0.9979879,0.00013350113,0.0011870947,0.000008144363,0.000033016477,0.00012370688,0.0000056296526,0.0000074197633,0.00051357143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994678,0.000013580137,0.00023602895,0.00010832862,0.000082773266,0.00009151777],"domain_scores_gemma":[0.99875265,0.000251804,0.00029031324,0.00062252325,0.000051318206,0.000031368127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001592386,0.00006426874,0.00011935186,0.0000150685455,0.00062246213,0.0000188587,0.00034964993,0.000022219776,0.000017237557],"category_scores_gemma":[0.00006147676,0.000045924553,0.000041125302,0.00005438029,0.00021135811,0.000044606233,0.00006777489,0.00004858781,0.000005263226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004179931,0.00006272156,0.0005490137,0.000024032732,0.000019081017,1.5682483e-8,0.00006811797,2.0676751e-7,0.0012832485,0.99676424,0.00015185132,0.0010732888],"study_design_scores_gemma":[0.00017717291,0.000017394092,0.007951571,0.0000142968975,0.000034117304,6.66246e-7,0.000112473885,0.00022959811,0.012599573,0.9524484,0.026352368,0.00006235675],"about_ca_topic_score_codex":0.0000046460427,"about_ca_topic_score_gemma":0.000064830194,"teacher_disagreement_score":0.057879496,"about_ca_system_score_codex":0.0000022452896,"about_ca_system_score_gemma":0.0000089852465,"threshold_uncertainty_score":0.47875383},"labels":[],"label_agreement":null},{"id":"W2613284777","doi":"","title":"The minimum matching energy of tricyclic graphs and given girth and without K 4 -subdivision.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subdivision; Mathematics; Girth (graph theory); Combinatorics; Tricyclic; Matching (statistics); Discrete mathematics; Statistics; Chemistry; Geography; Stereochemistry","score_opus":0.019603087367869424,"score_gpt":0.28533731674830326,"score_spread":0.26573422938043384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613284777","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9972098,0.00024966194,0.0000364743,0.0003131542,0.00015181125,0.000111170055,0.000004378421,0.000023594412,0.0018999431],"genre_scores_gemma":[0.9991992,0.00021639887,0.00023852321,0.000014931903,0.000002857136,0.0000219509,7.0224274e-7,0.00001347543,0.00029197038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934983,0.000057997004,0.00018978344,0.00015596182,0.00011179508,0.00013463647],"domain_scores_gemma":[0.9985735,0.00051216333,0.00024146031,0.0005740585,0.000039176663,0.00005968722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037145763,0.00010396845,0.00017720042,0.000036184592,0.0008388572,0.000090601054,0.00028067012,0.00005056303,0.0000023664584],"category_scores_gemma":[0.00016154026,0.000074103096,0.000041355604,0.000051171617,0.0002763624,0.00009390821,0.00014461091,0.00008034451,8.1435996e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012910075,0.00004245556,0.0037324205,0.00001724137,0.000027818183,4.094989e-7,0.00028077592,1.7943819e-8,0.0004561191,0.993081,0.0003135695,0.0020352672],"study_design_scores_gemma":[0.0005128836,0.000034976703,0.00915971,0.000028342838,0.00003169603,0.0000039262554,0.00013261002,0.000029601264,0.0008381085,0.98833877,0.0008042605,0.0000851179],"about_ca_topic_score_codex":0.000036585065,"about_ca_topic_score_gemma":0.0000128746615,"teacher_disagreement_score":0.0054272898,"about_ca_system_score_codex":0.0000033609442,"about_ca_system_score_gemma":0.000008695686,"threshold_uncertainty_score":0.64518964},"labels":[],"label_agreement":null},{"id":"W2613355329","doi":"","title":"Some Posets Of Unicyclic Graphs Based On Signless Laplacian Coefficients.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.030004486733901027,"score_gpt":0.30609367687779043,"score_spread":0.2760891901438894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613355329","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99231845,0.000014433542,0.000035768975,0.00024128825,0.00048109595,0.00029206192,0.000030230884,0.000064300286,0.0065223416],"genre_scores_gemma":[0.99950707,0.0000036662618,0.00019647485,0.00008383709,0.000004976996,0.000030398169,0.000008448696,0.00002416703,0.00014093255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990275,0.00007402482,0.00024201757,0.00021850172,0.00023077162,0.00020718513],"domain_scores_gemma":[0.997905,0.00033962843,0.00030011992,0.0012993844,0.00007161222,0.0000842392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036499303,0.00014806351,0.00024267164,0.00010687099,0.00042391958,0.000041549516,0.00065850053,0.000091815295,0.000024093972],"category_scores_gemma":[0.0002103318,0.0001411933,0.000120877965,0.00011315887,0.00020499023,0.00008903855,0.00006187068,0.0001393766,0.00003514422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018756718,0.00060245977,0.0009626859,0.000028040624,0.000017989349,0.000002331685,0.00006771606,0.0000047319254,0.0007306253,0.9966483,0.0005384059,0.00037797162],"study_design_scores_gemma":[0.0009787553,0.00009666203,0.0026758611,0.000063047795,0.000031151616,4.5812877e-7,0.000026046202,0.000344933,0.009420312,0.98591053,0.00030660056,0.00014563717],"about_ca_topic_score_codex":0.000009270181,"about_ca_topic_score_gemma":0.0000025272238,"teacher_disagreement_score":0.010737751,"about_ca_system_score_codex":0.000015899584,"about_ca_system_score_gemma":0.00002870904,"threshold_uncertainty_score":0.57576954},"labels":[],"label_agreement":null},{"id":"W2613851664","doi":"","title":"On 3-term arithmetic progressions in product sets over finite rings via spectra of graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Term (time); Product (mathematics); Arithmetic; Discrete mathematics; Pure mathematics; Combinatorics; Geometry","score_opus":0.02603744304832309,"score_gpt":0.3188185857684699,"score_spread":0.29278114272014677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613851664","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9961681,0.00002318675,0.0000074019235,0.00020048849,0.00029412817,0.00048489723,0.000008603038,0.000044449185,0.002768797],"genre_scores_gemma":[0.99907416,0.000008022103,0.0006790922,0.000014934686,0.0000041309295,0.000090184956,0.0000034872953,0.000022873368,0.00010313571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989604,0.000053372147,0.00028910078,0.00027977463,0.00019252437,0.00022485512],"domain_scores_gemma":[0.9981918,0.00029455157,0.00029398737,0.0011083891,0.000048874295,0.000062422456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003605026,0.00015589994,0.0002518664,0.00013970603,0.00023701214,0.000038489103,0.00044720157,0.00006466948,0.00004421969],"category_scores_gemma":[0.00043329137,0.00014037838,0.00008852593,0.00016427913,0.00017887319,0.00011317887,0.0000911051,0.00022996706,0.000018448793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020148325,0.00071362994,0.015652847,0.00006105943,0.000019713489,0.000006934001,0.00029015238,6.0648205e-7,0.0010003122,0.9813977,0.00023150655,0.000605427],"study_design_scores_gemma":[0.0006537671,0.000071147886,0.07576738,0.00017144116,0.000021112526,0.0000021510677,0.000008299674,0.000035040866,0.0074428185,0.9156523,0.00003804804,0.00013653419],"about_ca_topic_score_codex":0.000012787478,"about_ca_topic_score_gemma":0.000009274179,"teacher_disagreement_score":0.065745406,"about_ca_system_score_codex":0.000018522946,"about_ca_system_score_gemma":0.000020423093,"threshold_uncertainty_score":0.57244647},"labels":[],"label_agreement":null},{"id":"W2614091911","doi":"","title":"The majorization theorem and signless Dirichlet spectral radius of connected graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Majorization; Spectral radius; Combinatorics; Dirichlet distribution; Eigenvalues and eigenvectors; Physics; Mathematical analysis","score_opus":0.019707779136475794,"score_gpt":0.27927326883956,"score_spread":0.2595654897030842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614091911","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9944135,0.000079735546,0.0000766375,0.00039639237,0.0003023601,0.00026822372,0.0000080318105,0.000041649753,0.004413459],"genre_scores_gemma":[0.9996055,0.00005916282,0.00015546354,0.000009439912,0.0000057995935,0.000025017049,0.0000032831413,0.0000147280025,0.000121611265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993043,0.00008008559,0.00019961648,0.00014517878,0.00011900576,0.00015184365],"domain_scores_gemma":[0.9983268,0.0006063229,0.0002673578,0.0006729647,0.000080399455,0.00004620487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004284175,0.00010489263,0.0001578555,0.000029987057,0.0007883033,0.00008766809,0.00037263168,0.000056119155,0.000009924468],"category_scores_gemma":[0.00038061195,0.00007614925,0.000050818348,0.00008945217,0.00038530238,0.000089459834,0.00006489709,0.0000960575,0.000002693352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018094297,0.00006250247,0.00209805,0.000015366766,0.000034743312,7.1870704e-7,0.0002119066,1.00288574e-7,0.0019428562,0.99485296,0.00035028625,0.00041240655],"study_design_scores_gemma":[0.0005113198,0.00003563528,0.009467449,0.000016211547,0.000037991125,0.0000029340429,0.00009797907,0.00004285369,0.008914522,0.9805594,0.00022310842,0.00009057699],"about_ca_topic_score_codex":0.000008781066,"about_ca_topic_score_gemma":0.0000068420386,"teacher_disagreement_score":0.0142935505,"about_ca_system_score_codex":0.0000070836277,"about_ca_system_score_gemma":0.000013253348,"threshold_uncertainty_score":0.60630715},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8350819,0.00073202787,0.00041431913,0.00018255081,0.00015343814,0.0011924875,0.0002937335,0.000008120949,0.16194144],"genre_scores_gemma":[0.7047769,0.00015619649,0.09033816,0.000044956727,0.00032611826,0.00054476224,0.0030454332,0.00017331837,0.20059416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975037,0.00028789486,0.0008092398,0.0006576255,0.00024153572,0.0004999947],"domain_scores_gemma":[0.9976942,0.00060270244,0.00066001946,0.0006789157,0.00020724794,0.00015694885],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00082652055,0.0005239241,0.0006063552,0.00022640981,0.00053452194,0.0005083631,0.0011882312,0.0007567017,0.0033587313],"category_scores_gemma":[0.00018278028,0.0005582984,0.00030531376,0.00047268686,0.00017589865,0.00026165415,0.00012231992,0.000579215,0.0008778744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027878734,0.0028737932,0.0066261706,0.000995543,0.00069626846,0.00008962136,0.029788736,0.00004674684,0.013500427,0.6127347,0.011522918,0.32084635],"study_design_scores_gemma":[0.0011886695,0.0002176382,0.014473525,0.0020925393,0.0013999832,0.000053531625,0.013251234,0.0002289097,0.17104982,0.55383354,0.24025261,0.0019579877],"about_ca_topic_score_codex":0.0015170418,"about_ca_topic_score_gemma":0.00509512,"teacher_disagreement_score":0.31888834,"about_ca_system_score_codex":0.00008144696,"about_ca_system_score_gemma":0.00023177749,"threshold_uncertainty_score":0.99990004},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99340045,0.00005694202,0.0023793806,0.00010600211,0.000050472485,0.000073256575,0.000010633138,0.000012104251,0.0039107576],"genre_scores_gemma":[0.99807394,0.00012397129,0.0010826321,0.00007904026,0.00006893618,0.0000025511956,0.0000014589608,0.00001261805,0.0005548516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990686,0.00014904878,0.00047419616,0.000057783058,0.0001583036,0.00009202882],"domain_scores_gemma":[0.9989604,0.00025987418,0.00043018124,0.00018426056,0.000116094314,0.000049209746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009215868,0.00008072395,0.00021967948,0.00014854241,0.00005173844,0.000008622516,0.00020164033,0.00004646728,0.0006909342],"category_scores_gemma":[0.000061631414,0.00006300919,0.00019855562,0.00025513474,0.000103215294,0.00014006319,0.000007054264,0.000119808974,0.000007860607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001624194,0.00021518428,0.00015974205,0.000021198259,0.0000663385,0.000002351264,0.00047328373,0.0000018535231,0.12959187,0.86076266,0.00015881208,0.008384289],"study_design_scores_gemma":[0.00026875694,0.000081373306,0.0017492789,0.000064386484,0.00007023607,0.000046647965,0.000085567364,0.0000015931371,0.024503723,0.97085,0.002215719,0.00006270245],"about_ca_topic_score_codex":1.9646659e-7,"about_ca_topic_score_gemma":5.470721e-7,"teacher_disagreement_score":0.11008736,"about_ca_system_score_codex":0.000004971573,"about_ca_system_score_gemma":0.000018507819,"threshold_uncertainty_score":0.75652444},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94521725,0.0017858153,0.014271175,0.0017133061,0.00014031991,0.00025035389,0.00002911069,0.00002454092,0.036568146],"genre_scores_gemma":[0.97651505,0.0005341928,0.0143649755,0.000044901575,0.00006335544,0.000012023991,0.0000029806606,0.000008560877,0.008453984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948907,0.000049817183,0.00019656312,0.00011074987,0.000057747955,0.00009606126],"domain_scores_gemma":[0.99942845,0.00022259656,0.00008257394,0.0001470539,0.000078026605,0.000041315056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013150257,0.00008097765,0.00013713854,0.00003963885,0.00007438512,0.000013736595,0.000039866107,0.000076110286,0.0007749733],"category_scores_gemma":[0.000043277545,0.00007922256,0.000034073197,0.00013798384,0.00026793464,0.000092498274,0.000020853631,0.000055175096,0.000019910209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009505694,0.00010641115,0.0012397876,0.00006651176,0.000035063575,7.0139214e-7,0.0008653344,0.0000013298873,0.0025687986,0.9816954,0.0004967033,0.012914439],"study_design_scores_gemma":[0.00026920866,0.000049845672,0.000658166,0.000046000478,0.000086860346,0.00006881824,0.0014955716,0.0003528448,0.0072641787,0.97940534,0.010208086,0.000095062394],"about_ca_topic_score_codex":0.00003587835,"about_ca_topic_score_gemma":0.000029713405,"teacher_disagreement_score":0.03129779,"about_ca_system_score_codex":0.0000060142684,"about_ca_system_score_gemma":0.000015727439,"threshold_uncertainty_score":0.8485414},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9900103,0.00026976556,0.007892374,0.0009257695,0.000039210638,0.00013799063,0.0000023134414,0.000016351734,0.0007059285],"genre_scores_gemma":[0.9971833,0.000067678266,0.0020176456,0.00008137705,0.00015927372,0.0000072524053,0.0000014758155,0.000022708304,0.00045929285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986601,0.00007929772,0.0006313962,0.000089954854,0.00021921353,0.00032006478],"domain_scores_gemma":[0.99865144,0.0002514158,0.0005341803,0.0002512166,0.00023613714,0.0000756336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054910756,0.000120910685,0.00030285132,0.00013104265,0.000046940782,0.000011293499,0.0003186244,0.00006345115,0.00049240043],"category_scores_gemma":[0.00017692537,0.00009363944,0.00019086742,0.00020085023,0.00004021003,0.00014250269,0.000025610552,0.00038727946,0.000037740767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004800779,0.00035337027,0.0005102596,0.000050615054,0.00022583103,0.0000024224516,0.00032336556,0.0000069871885,0.035917785,0.9550518,0.0023277816,0.00518182],"study_design_scores_gemma":[0.0007217648,0.0005013537,0.0010979085,0.00005999771,0.00009648895,0.00008490652,0.00015648136,0.000099024735,0.04082387,0.9546504,0.0015744619,0.00013334569],"about_ca_topic_score_codex":0.00000981825,"about_ca_topic_score_gemma":0.00001771261,"teacher_disagreement_score":0.007173,"about_ca_system_score_codex":0.00003947832,"about_ca_system_score_gemma":0.00013192103,"threshold_uncertainty_score":0.5391439},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90180796,0.002444337,0.06539009,0.0028122417,0.002784519,0.0009325834,0.0000566677,0.00013201132,0.023639595],"genre_scores_gemma":[0.978808,0.0003657441,0.018007694,0.00044561585,0.0014053356,0.000034746277,0.0000040652635,0.00010778313,0.000821005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973956,0.0007200616,0.0009192064,0.00022979846,0.00045157294,0.00028379232],"domain_scores_gemma":[0.9949593,0.0015337137,0.0016372745,0.0010673201,0.000685991,0.000116404786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005732095,0.00032690752,0.00055705,0.00032947367,0.0003296652,0.00010871963,0.0014541791,0.0002704708,0.00034303934],"category_scores_gemma":[0.0006598197,0.00019827462,0.0007184371,0.00034719208,0.0005275525,0.000084908235,0.00039966818,0.0014461873,0.000024867823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012764912,0.00015030972,0.0000629288,0.00009391492,0.00048472977,0.000010771418,0.0018072486,0.00001681551,0.00016067382,0.987272,0.00845209,0.0013608336],"study_design_scores_gemma":[0.00025636985,0.000059421163,0.00015593896,0.00029302688,0.00044824768,0.00013445018,0.00081570033,0.00000848857,0.00048069152,0.993801,0.0033297604,0.00021691009],"about_ca_topic_score_codex":0.000001926814,"about_ca_topic_score_gemma":0.000008595173,"teacher_disagreement_score":0.07700005,"about_ca_system_score_codex":0.000033946315,"about_ca_system_score_gemma":0.00014605097,"threshold_uncertainty_score":0.80854046},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96492964,0.0028445502,0.021112703,0.0021557563,0.0003718075,0.0006265604,0.0002371965,0.00006558729,0.007656168],"genre_scores_gemma":[0.97060484,0.00046968786,0.015418537,0.00012596222,0.000082702274,0.000090430156,0.000031639665,0.0000427068,0.0131334895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841774,0.00030820625,0.00046097545,0.00027524625,0.00018009468,0.00035774847],"domain_scores_gemma":[0.99793583,0.0008983915,0.00025393988,0.00061090634,0.00016459242,0.00013636],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005463462,0.00022916883,0.00036222223,0.00008770645,0.0002105666,0.00004747595,0.0003245908,0.00023204928,0.0011304595],"category_scores_gemma":[0.00024782133,0.00023380881,0.00020017682,0.00053796085,0.0010138227,0.00015654456,0.000026176138,0.0003477842,0.0002717095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012068307,0.0003208047,0.0050247707,0.00023578038,0.00009414204,0.0000024855449,0.0019660543,0.0000016230026,0.00075240404,0.97834694,0.010594687,0.0026482544],"study_design_scores_gemma":[0.00026861308,0.00004432209,0.025654688,0.00007835951,0.000062718864,0.000010099238,0.00045781388,0.00007589439,0.0014624243,0.96333283,0.008308444,0.00024378348],"about_ca_topic_score_codex":0.0008544795,"about_ca_topic_score_gemma":0.0002812542,"teacher_disagreement_score":0.020629918,"about_ca_system_score_codex":0.00005074544,"about_ca_system_score_gemma":0.000031015195,"threshold_uncertainty_score":0.9997826},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9827912,0.000011132262,0.006538357,0.00095931673,0.00006578035,0.0002508441,0.00000956511,0.0001123826,0.009261451],"genre_scores_gemma":[0.9915502,0.000003360246,0.0071551492,0.0006035409,0.00010790673,0.000017102508,0.0000075290714,0.000016601505,0.00053860253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916697,0.00008382773,0.00017145794,0.00023407004,0.00014615075,0.00019755593],"domain_scores_gemma":[0.99915963,0.00034639423,0.00009573738,0.00029181747,0.000045567347,0.00006085657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029206078,0.00014654617,0.00016748454,0.000067049565,0.0004125453,0.000057924448,0.00011654834,0.00013289267,0.00020707259],"category_scores_gemma":[0.00017882875,0.00014050135,0.00010296127,0.00020082467,0.00010853189,0.00012560333,0.000008930967,0.00021645872,0.00006050602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024020237,0.00017820353,0.00020955842,0.000008680635,0.000016571035,0.0000030788585,0.00092282257,0.0000032634466,0.003211931,0.9920725,0.00080645405,0.0025428913],"study_design_scores_gemma":[0.00036849998,0.00003130692,0.002001832,0.00002092191,0.00003591474,0.000024881158,0.00012726945,0.00026864622,0.0036391001,0.9919498,0.0013548454,0.00017701196],"about_ca_topic_score_codex":0.000007341366,"about_ca_topic_score_gemma":0.0000042933825,"teacher_disagreement_score":0.008759036,"about_ca_system_score_codex":0.000101753445,"about_ca_system_score_gemma":0.000016282824,"threshold_uncertainty_score":0.57294786},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9960649,0.00011831178,0.0011170519,0.00013157341,0.000027837086,0.00019507758,0.000037125224,0.0002058177,0.0021022758],"genre_scores_gemma":[0.9975703,0.000013291656,0.002141828,0.00013364668,0.000012873783,0.000013562485,0.000017157166,0.000010707209,0.00008665204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899566,0.00029841106,0.0002684559,0.00015569583,0.000097850956,0.00018391553],"domain_scores_gemma":[0.99886984,0.0006793048,0.00010258044,0.0002652126,0.000041692976,0.000041401294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008087557,0.00012252394,0.00023306721,0.00015454867,0.00007245805,0.000011046483,0.00017665849,0.00011600573,0.00005819922],"category_scores_gemma":[0.0003134236,0.00010819074,0.00007451796,0.0004535686,0.00019726124,0.000037169193,0.000006835684,0.00018740575,0.00000503157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051981988,0.00015691752,0.0022730075,0.000014938484,0.000020447642,0.0000045498805,0.0015242898,0.000011902838,0.0015105354,0.99294466,0.00086787535,0.0006188784],"study_design_scores_gemma":[0.00029365782,0.000039577528,0.1624354,0.00001241358,0.000011632494,0.0000049736414,0.00012908365,0.00009400541,0.0022414455,0.8346012,0.000032659667,0.000103904684],"about_ca_topic_score_codex":0.00005559094,"about_ca_topic_score_gemma":0.00012981969,"teacher_disagreement_score":0.16016239,"about_ca_system_score_codex":0.000020107287,"about_ca_system_score_gemma":0.000020079777,"threshold_uncertainty_score":0.44118902},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9731202,0.00035787022,0.02295364,0.0016958861,0.00003961854,0.00047008292,0.00002966309,0.000045532284,0.0012874864],"genre_scores_gemma":[0.99694103,0.00003159349,0.002424069,0.00036425196,0.000030243542,0.000035909747,0.000002881728,0.0000080880745,0.00016191947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995381,0.000027241893,0.00013965867,0.000108787564,0.000069487265,0.00011669988],"domain_scores_gemma":[0.9989955,0.0006558659,0.00007954926,0.00020196503,0.00003615517,0.00003096593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002080682,0.000088636,0.00013472892,0.000045514244,0.0002873554,0.000023782757,0.00013175464,0.00008314428,0.000007559382],"category_scores_gemma":[0.00007387364,0.000060755778,0.00007238563,0.000111278765,0.00028527557,0.000028316324,0.000006642896,0.000103033475,3.3058535e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027936978,0.000034866873,0.00021735167,0.000022835107,0.000028765078,2.606508e-7,0.0014828499,0.0000015442854,0.0007421488,0.9916711,0.0010174734,0.0047528683],"study_design_scores_gemma":[0.00029069075,0.000048876005,0.0022287797,0.000007499198,0.000043974935,0.000005242264,0.0005090244,0.000061611805,0.0016068937,0.99138176,0.0037397565,0.00007589071],"about_ca_topic_score_codex":0.000004533645,"about_ca_topic_score_gemma":0.000012932975,"teacher_disagreement_score":0.023820823,"about_ca_system_score_codex":0.0000059408094,"about_ca_system_score_gemma":0.000009099115,"threshold_uncertainty_score":0.24775487},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9910293,0.0010401051,0.00036767282,0.00030610905,0.0035083645,0.0008509615,0.00004567412,0.000026078278,0.002825702],"genre_scores_gemma":[0.99406505,0.0010397467,0.003404272,0.000021122907,0.00041029803,0.00003753902,0.0000026240918,0.000052384094,0.0009669934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976347,0.00056783744,0.0010293484,0.00017633256,0.00037749784,0.000214279],"domain_scores_gemma":[0.9947529,0.0021447334,0.0019268927,0.00057758583,0.0005047384,0.00009315836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029876821,0.0002980135,0.0007287095,0.00016548923,0.00023010392,0.00008670415,0.00069463573,0.00027507724,0.000019075569],"category_scores_gemma":[0.0004830153,0.00020193368,0.0003845859,0.00013941735,0.0007228151,0.00015623335,0.00041315035,0.00080205576,0.0000014035035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007913436,0.00012700976,0.000109063854,0.00040115128,0.0003756366,0.0000024618314,0.0024835898,0.000032283177,0.00031037172,0.99388796,0.001152858,0.00032628753],"study_design_scores_gemma":[0.00077030325,0.000259628,0.000041059557,0.00031684953,0.00024720808,0.00003942278,0.002570858,0.0000051164857,0.0026962245,0.988143,0.004719076,0.0001912265],"about_ca_topic_score_codex":0.000004607079,"about_ca_topic_score_gemma":0.000005377769,"teacher_disagreement_score":0.005744916,"about_ca_system_score_codex":0.000031181262,"about_ca_system_score_gemma":0.00019795827,"threshold_uncertainty_score":0.82346165},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5437406,0.0063545196,0.26975277,0.017461898,0.0003154323,0.0011627119,0.00012632344,0.00048801504,0.16059774],"genre_scores_gemma":[0.09235859,0.0012948299,0.8236492,0.0011002651,0.00062655634,0.0002448427,0.000017437076,0.00012105046,0.080587186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969055,0.001303469,0.00042436723,0.00041046634,0.00018386255,0.0007723275],"domain_scores_gemma":[0.9964797,0.0023131836,0.00018108959,0.000670837,0.00008130611,0.00027389763],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0034779247,0.00035358366,0.0003472192,0.00013519365,0.0006328378,0.00016331124,0.0004658295,0.0010422971,0.0010916016],"category_scores_gemma":[0.00082887965,0.0003757551,0.00022624448,0.00066668686,0.0009590041,0.00022805606,0.00006042309,0.0013381306,0.00029609626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031841224,0.000631332,0.00028615634,0.00028127606,0.00012721459,0.000023401988,0.008146158,0.000114640214,0.00455146,0.9480359,0.022028979,0.015741626],"study_design_scores_gemma":[0.00040698436,0.000034309727,0.00010049976,0.0001009979,0.00018596754,0.0001705437,0.0010941715,0.0009549259,0.0047029397,0.7220416,0.26988736,0.00031968005],"about_ca_topic_score_codex":0.00018418433,"about_ca_topic_score_gemma":0.000045787914,"teacher_disagreement_score":0.5538965,"about_ca_system_score_codex":0.0005455578,"about_ca_system_score_gemma":0.00024661847,"threshold_uncertainty_score":0.99986947},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9342496,0.0021164427,0.04605991,0.0009114845,0.00019698085,0.0023788835,0.00008612915,0.00007499833,0.013925563],"genre_scores_gemma":[0.9878505,0.0011008916,0.010673239,0.00005423821,0.00007972863,0.00016342955,0.0000075035623,0.00002977657,0.000040719067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997953,0.00028433927,0.0006933485,0.00054039824,0.00025779888,0.00027109883],"domain_scores_gemma":[0.99375856,0.004829715,0.00026877862,0.0009597766,0.00009281392,0.00009034579],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013428875,0.00033749337,0.00093933893,0.00003684272,0.00006998717,0.000025317424,0.00036862513,0.00021138843,0.000049180228],"category_scores_gemma":[0.0012660881,0.00020321544,0.00020635393,0.0001683528,0.005086561,0.00007992658,0.0006359894,0.0006940082,0.000007310418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010089168,0.0003318911,0.00006598136,0.0019320672,0.000033577235,4.645764e-7,0.0007665853,0.000023843513,0.0000059616964,0.9937048,0.000011286215,0.0030226682],"study_design_scores_gemma":[0.0006206479,0.00003612385,0.000023358316,0.0004168926,0.00014475443,0.0000028479149,0.00020201714,0.0026333034,0.0004376611,0.9952252,0.000028777273,0.0002284338],"about_ca_topic_score_codex":0.0000011439678,"about_ca_topic_score_gemma":0.0000013157199,"teacher_disagreement_score":0.053600866,"about_ca_system_score_codex":0.000009597605,"about_ca_system_score_gemma":0.000020474628,"threshold_uncertainty_score":0.997621},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75935477,0.000032821383,0.03853162,0.00067384716,0.0001221839,0.0013162513,0.000047939775,0.0002622714,0.19965829],"genre_scores_gemma":[0.9136354,0.000010883684,0.0857674,0.000048370905,0.00008440534,0.00014217204,0.0000037328318,0.000036842204,0.00027081007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863285,0.000024294543,0.0005749855,0.00021836424,0.0002764092,0.00027310385],"domain_scores_gemma":[0.9970465,0.0012515881,0.00031733952,0.0011822706,0.00013774891,0.00006455911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009589143,0.00017830248,0.0002774127,0.000030871826,0.000382139,0.000030718697,0.0005341574,0.00008253119,0.00013328693],"category_scores_gemma":[0.00035134642,0.00011378622,0.00011925808,0.00027281194,0.00073491986,0.00003589102,0.00013014623,0.00013468678,0.000111354886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001561409,0.00011170126,0.000010690561,0.00011712681,0.000026535545,7.9845414e-8,0.0010488423,4.938396e-7,0.00446328,0.9921846,0.0012257909,0.000795285],"study_design_scores_gemma":[0.00016544422,0.00002513804,0.000046188157,0.00002499031,0.000057848287,0.0000018798135,0.00092598714,0.0008980876,0.017659891,0.977169,0.0028892977,0.00013629702],"about_ca_topic_score_codex":0.0000012400158,"about_ca_topic_score_gemma":0.0000045359093,"teacher_disagreement_score":0.19938748,"about_ca_system_score_codex":0.000014633051,"about_ca_system_score_gemma":0.000024783718,"threshold_uncertainty_score":0.46400675},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20428999,0.0000137335,0.7866651,0.001937156,0.00011941481,0.00041520345,0.000008263713,0.00011715042,0.006434014],"genre_scores_gemma":[0.87697124,9.504305e-7,0.1227236,0.00015015992,0.00007871579,0.000029783843,0.0000010759786,0.000014961938,0.000029522877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981107,0.00015123829,0.00033759224,0.00040284765,0.0006163957,0.00038120977],"domain_scores_gemma":[0.99745834,0.0011477635,0.00012934039,0.0007395208,0.0002355679,0.0002894805],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003413578,0.00020585826,0.00023715106,0.000075880685,0.0006042777,0.00035876938,0.0007089447,0.00005494976,0.000024705365],"category_scores_gemma":[0.00060184737,0.00012796983,0.000066079985,0.0005971477,0.003037359,0.00025228696,0.00046937857,0.00019801821,0.0000313525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045744987,0.00008650735,0.000013641038,0.000017316588,0.000009494342,0.0000014860691,0.0035417932,0.000007930147,0.00023931428,0.9954936,0.00014156234,0.0004427915],"study_design_scores_gemma":[0.00016277509,0.00007216796,0.00030851777,0.000025984706,0.000038171063,0.00007043426,0.00021778629,0.07941346,0.0003249292,0.9191666,0.000025460362,0.00017370727],"about_ca_topic_score_codex":0.000001729563,"about_ca_topic_score_gemma":6.102131e-7,"teacher_disagreement_score":0.6726812,"about_ca_system_score_codex":0.000025774138,"about_ca_system_score_gemma":0.00007065315,"threshold_uncertainty_score":0.9996758},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9907077,0.0008461019,0.0018128724,0.0005404772,0.00024802735,0.00016318746,0.000018537203,0.000011031448,0.0056520635],"genre_scores_gemma":[0.99775213,0.0004071509,0.0014734771,0.000025975873,0.000085011205,0.0000042388456,3.0663003e-7,0.000022513905,0.000229208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821424,0.0002620824,0.0008569162,0.000102387545,0.00036923317,0.00019516204],"domain_scores_gemma":[0.9942951,0.0016916932,0.0023733163,0.0009882525,0.00057210727,0.00007951345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034426434,0.0001576966,0.00043501912,0.00014931215,0.00051761494,0.000045904133,0.0012257005,0.00007846479,0.000032853375],"category_scores_gemma":[0.0011285358,0.00009572618,0.0004268703,0.00016486498,0.0009790725,0.00020204812,0.00009597938,0.00026648017,0.0000023726452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021978677,0.00020866875,0.0016845597,0.000036853173,0.00025508943,0.000002830687,0.00062028825,0.0000049047962,0.018429304,0.97472024,0.0012073839,0.0026101177],"study_design_scores_gemma":[0.00046571455,0.00012675025,0.003951019,0.00012840329,0.00017091885,0.000029417997,0.0009077592,0.0000023146945,0.03987086,0.9531014,0.0011505202,0.00009492579],"about_ca_topic_score_codex":0.000003516673,"about_ca_topic_score_gemma":0.00007092809,"teacher_disagreement_score":0.021618815,"about_ca_system_score_codex":0.000007110988,"about_ca_system_score_gemma":0.00006231628,"threshold_uncertainty_score":0.3981128},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98419493,0.00023539152,0.014936548,0.000117947755,0.000056859943,0.000093285635,0.000046334135,0.0000024559577,0.00031621737],"genre_scores_gemma":[0.9928311,0.000025328021,0.006913157,0.000007701157,0.00017075284,0.0000011059736,0.000002027833,0.000012740953,0.000036085556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993366,0.000040313338,0.00028471902,0.000069333975,0.0001278565,0.00014115353],"domain_scores_gemma":[0.9986597,0.000055588465,0.00062423554,0.00026140767,0.00022742683,0.00017169707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028554164,0.00008997219,0.00026306874,0.000054023596,0.00025801713,0.00003925543,0.00023585967,0.000033576365,0.00003063466],"category_scores_gemma":[0.000016992459,0.00007639573,0.00008776768,0.0000908056,0.00027249366,0.00032916217,0.000006918836,0.0001083931,8.4591386e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029491213,0.000046971374,0.005110099,0.000110597415,0.00017870616,0.000010250011,0.0009893442,0.000079694444,0.0025055916,0.98988616,0.0003029914,0.0007500737],"study_design_scores_gemma":[0.00051869784,0.000071655915,0.004691909,0.00023773545,0.00025074583,0.000023453205,0.00010569259,0.00012128467,0.008966072,0.9847858,0.00012588545,0.00010104492],"about_ca_topic_score_codex":0.0005094877,"about_ca_topic_score_gemma":0.0024345927,"teacher_disagreement_score":0.00863614,"about_ca_system_score_codex":0.000015784599,"about_ca_system_score_gemma":0.00018880086,"threshold_uncertainty_score":0.31153274},"labels":[],"label_agreement":null},{"id":"W2757565","doi":"10.1007/bf00456661","title":"New results on the eccentric digraphs of the digraphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Combinatorics; Vertex (graph theory); Mathematics; Eccentric; Eccentricity (behavior); Discrete mathematics; Graph; Physics","score_opus":0.033007409058571746,"score_gpt":0.25848545363596986,"score_spread":0.22547804457739812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757565","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98012835,0.000055293716,0.000009859727,0.0017283316,0.0004216929,0.00042087038,0.000016057102,0.000056286193,0.01716328],"genre_scores_gemma":[0.99860424,0.000040128616,0.000092723334,0.00012697662,0.000008105629,0.000021214457,0.0000016131919,0.000015127819,0.0010898756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893004,0.00012513952,0.00030047176,0.00017796013,0.0002793216,0.00018705164],"domain_scores_gemma":[0.99764234,0.001050588,0.00020628967,0.0009854506,0.000056379864,0.000058965088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029756845,0.00013351096,0.00015753522,0.000057883066,0.00036146076,0.000010534306,0.0006035178,0.00006112135,0.000029997665],"category_scores_gemma":[0.00038946222,0.00007326149,0.00019716455,0.0008657203,0.00016541498,0.0000368979,0.0000671212,0.00020564318,0.00002581634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024736864,0.00015435462,0.0009166989,0.000004915731,0.000026971114,7.4905904e-7,0.0004958738,9.999482e-7,0.00009005962,0.9533042,0.04487533,0.00010511942],"study_design_scores_gemma":[0.00055711885,0.000039723876,0.006768584,0.000027951439,0.000025905143,0.000004162218,0.00006406173,0.000004126023,0.0060629677,0.9820676,0.0042912173,0.00008657987],"about_ca_topic_score_codex":0.000023393928,"about_ca_topic_score_gemma":0.000003854572,"teacher_disagreement_score":0.040584113,"about_ca_system_score_codex":0.000010896148,"about_ca_system_score_gemma":0.000045113142,"threshold_uncertainty_score":0.2987517},"labels":[],"label_agreement":null},{"id":"W2757630574","doi":"","title":"Note on the distance spectral gap of graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral gap; Mathematical analysis","score_opus":0.0379458027025027,"score_gpt":0.30739166708374466,"score_spread":0.26944586438124196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757630574","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9631266,0.000011212885,0.000036647543,0.0012160571,0.00032840413,0.00018665347,0.000009866573,0.000028194698,0.035056364],"genre_scores_gemma":[0.99943584,0.000007615549,0.00016961191,0.000036183752,0.0000047580343,0.000024077715,7.154152e-7,0.000010795902,0.00031039873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945337,0.00003567132,0.00013892785,0.000117762334,0.00012884736,0.00012541286],"domain_scores_gemma":[0.99832743,0.00036785592,0.00019146553,0.0010483166,0.000035206096,0.000029732531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028299884,0.00008411144,0.0001228144,0.000018056755,0.00039485976,0.000031453445,0.00052858266,0.00003529985,0.000043031803],"category_scores_gemma":[0.0002561224,0.00005825239,0.000085761276,0.00005586966,0.00020252858,0.0000474895,0.000040965235,0.00012189237,0.000026746096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010605763,0.00011343832,0.00057260745,0.000010116395,0.000012156812,7.1863326e-7,0.00014859282,1.0575082e-7,0.00042115126,0.99661887,0.001999541,0.00009212095],"study_design_scores_gemma":[0.00020176933,0.000030902356,0.003646659,0.000027067732,0.000014554874,5.281636e-7,0.00002412692,0.000009413843,0.009036448,0.98606265,0.0008787177,0.000067188084],"about_ca_topic_score_codex":0.000005934551,"about_ca_topic_score_gemma":0.000006192107,"teacher_disagreement_score":0.036309242,"about_ca_system_score_codex":0.000008300799,"about_ca_system_score_gemma":0.00000960132,"threshold_uncertainty_score":0.30369818},"labels":[],"label_agreement":null},{"id":"W2757702714","doi":"","title":"Distance spectral radius of quasi-trees.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; RADIUS; Spectral radius; Physics; Computer science","score_opus":0.027186262916313597,"score_gpt":0.30104481777193776,"score_spread":0.27385855485562416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757702714","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98069715,0.0000428163,0.00015951936,0.00024503595,0.00040842293,0.00014981173,0.000009329038,0.00004432824,0.018243574],"genre_scores_gemma":[0.99850965,0.000009048713,0.00077969424,0.0000078107405,0.000007887197,0.000017022066,0.0000015963236,0.000013549452,0.000653756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938303,0.000025154206,0.00018466488,0.0001406009,0.00011790826,0.00014864314],"domain_scores_gemma":[0.998586,0.00013954546,0.00022798472,0.000952538,0.000042567637,0.000051357274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020578923,0.00009156072,0.0001841519,0.00002258148,0.00026006985,0.000030756975,0.00047096272,0.00004551902,0.00004553089],"category_scores_gemma":[0.00019966144,0.00008752344,0.00008104266,0.00004849763,0.00017841894,0.00009605955,0.000050153394,0.000092740185,0.000023914294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009328937,0.00022834272,0.0032004188,0.000020124087,0.000018268247,0.0000018771362,0.00014035813,8.1720856e-8,0.0005668571,0.9942364,0.00131232,0.00026560648],"study_design_scores_gemma":[0.00040979506,0.000036323527,0.008708818,0.000023260258,0.0000203419,0.0000015996719,0.000031727668,0.000016432836,0.006034931,0.9833481,0.0012743297,0.000094347815],"about_ca_topic_score_codex":0.000018001958,"about_ca_topic_score_gemma":0.000017828623,"teacher_disagreement_score":0.017812472,"about_ca_system_score_codex":0.000013893662,"about_ca_system_score_gemma":0.000015945277,"threshold_uncertainty_score":0.35691023},"labels":[],"label_agreement":null},{"id":"W2757888206","doi":"","title":"An Incomparable Upper Bound For The Largest Laplacian Graph Eigenvalue.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Upper and lower bounds; Laplace operator; Laplacian matrix; Combinatorics; Graph; Algebraic connectivity; Mathematical analysis; Physics","score_opus":0.04642426429592865,"score_gpt":0.34140376138068157,"score_spread":0.2949794970847529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757888206","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99214554,0.00006942361,0.0002916438,0.0008050714,0.00090827735,0.00085665344,0.000030964828,0.00009934952,0.0047931066],"genre_scores_gemma":[0.99804586,0.000013528108,0.00084306597,0.00009794873,0.000027118414,0.00034090056,0.0000086923465,0.00003067929,0.00059219985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908435,0.00006156046,0.00019910843,0.00023025347,0.00014097341,0.0002837727],"domain_scores_gemma":[0.99741364,0.0006592101,0.00018808329,0.0015566212,0.000093376904,0.000089086505],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00083615404,0.00015010059,0.00019412138,0.00003520194,0.0024039545,0.00027687228,0.00094141753,0.0000817173,0.000047199224],"category_scores_gemma":[0.00023991457,0.0001111191,0.00012972002,0.00006776024,0.00019998949,0.00023767391,0.00006225922,0.00014263486,0.00004447083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001621053,0.00022248054,0.0032943813,0.000017412081,0.000043888926,4.6385733e-7,0.00019317871,0.0000011728639,0.00022417837,0.99111086,0.004665816,0.00020992655],"study_design_scores_gemma":[0.0006090597,0.00005419122,0.0054351334,0.000011812973,0.00006314346,0.00000212205,0.00012509918,0.00017528357,0.0015670634,0.9741711,0.017632069,0.00015394967],"about_ca_topic_score_codex":0.00003722321,"about_ca_topic_score_gemma":0.000044448243,"teacher_disagreement_score":0.016939817,"about_ca_system_score_codex":0.000014622836,"about_ca_system_score_gemma":0.00002956659,"threshold_uncertainty_score":0.99889475},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9608125,0.0023381545,0.034940768,0.00033536492,0.00033804929,0.00026832378,0.000021550934,0.000033318614,0.00091195613],"genre_scores_gemma":[0.98913175,0.00042071458,0.008931933,0.000019460167,0.00087220344,0.0000055720243,0.0000058858946,0.000050685507,0.00056177855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997771,0.00020328298,0.0010478914,0.0001922492,0.00036392608,0.00042161337],"domain_scores_gemma":[0.99692893,0.00045458763,0.0016564478,0.00051151647,0.00036575066,0.000082784114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021151833,0.00025130194,0.0006711309,0.0002516227,0.000082140716,0.00002305917,0.00071375817,0.00024203418,0.00021902229],"category_scores_gemma":[0.0003454327,0.00021642553,0.00052619807,0.00017639987,0.000111140616,0.00006698905,0.00018886392,0.0013821349,0.000017383632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019891158,0.0004107848,0.00010437912,0.00034764613,0.0008894466,0.0000097768125,0.0008466083,0.00022813708,0.004071311,0.9899548,0.0022897455,0.00064840267],"study_design_scores_gemma":[0.00038225623,0.00026206186,0.0000418851,0.00030796597,0.00022390293,0.000078571065,0.000056399946,0.00020267816,0.014090823,0.98155135,0.0026131666,0.00018895013],"about_ca_topic_score_codex":0.000003242802,"about_ca_topic_score_gemma":0.000014232071,"teacher_disagreement_score":0.02831925,"about_ca_system_score_codex":0.000104927356,"about_ca_system_score_gemma":0.0005777686,"threshold_uncertainty_score":0.8825577},"labels":[],"label_agreement":null},{"id":"W2758744141","doi":"","title":"A study on degree characterization for hamiltonian-connected graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Characterization (materials science); Combinatorics; Physics; Nanotechnology; Materials science","score_opus":0.09181590200353909,"score_gpt":0.3404378760293594,"score_spread":0.24862197402582029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758744141","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99592793,0.0000014893895,0.000103688944,0.00025450118,0.000572288,0.0013071228,0.00002980101,0.00012029714,0.001682881],"genre_scores_gemma":[0.9988733,0.0000013592978,0.0001795327,0.000044676115,0.000009849411,0.0005071536,0.000023989647,0.000030881827,0.00032929357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916166,0.000051745545,0.000209405,0.00026087335,0.0001289391,0.00018735151],"domain_scores_gemma":[0.9982954,0.000269586,0.00024823155,0.0010167287,0.00011153843,0.00005846569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033361226,0.00014796201,0.00019993295,0.000070700466,0.00082713447,0.000115363866,0.00042843286,0.00006729058,0.000012307618],"category_scores_gemma":[0.00047751688,0.00014008989,0.00008490202,0.00008137203,0.000053447737,0.0001307373,0.00004914896,0.000095184936,0.000028812863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037917383,0.0007944751,0.0032279503,0.000012371127,0.00004742673,0.000001676123,0.0004557572,2.4703567e-8,0.0029699137,0.9915046,0.00025999427,0.00068790675],"study_design_scores_gemma":[0.0013871269,0.00025222148,0.1101898,0.000019528345,0.000048918326,8.6727084e-7,0.00010792982,0.000012276905,0.0021565259,0.885304,0.00037478376,0.0001460664],"about_ca_topic_score_codex":0.00000339407,"about_ca_topic_score_gemma":0.0000075984594,"teacher_disagreement_score":0.10696185,"about_ca_system_score_codex":0.000015974798,"about_ca_system_score_gemma":0.000015052195,"threshold_uncertainty_score":0.63617337},"labels":[],"label_agreement":null},{"id":"W2759760320","doi":"","title":"Pentacyclic Graphs with Maximal Estrada Index.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Discrete mathematics; Computer science; World Wide Web","score_opus":0.027798339497881807,"score_gpt":0.2915498129243886,"score_spread":0.2637514734265068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759760320","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98299986,0.000010262983,0.000030495365,0.00028765947,0.0002567066,0.00022954853,0.000004456271,0.0000920449,0.01608896],"genre_scores_gemma":[0.9987853,0.000004843229,0.0006877487,0.000031716037,0.0000055771034,0.000046641824,0.0000030767635,0.000025775467,0.00040929837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991997,0.000027675436,0.0001516015,0.00021954875,0.00017899481,0.0002224627],"domain_scores_gemma":[0.9985341,0.000103010876,0.00018481615,0.0010385659,0.000045661127,0.0000938744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017408624,0.0001462173,0.0001711561,0.000043640222,0.0006576232,0.000122416,0.0005485015,0.00006284496,0.000059063714],"category_scores_gemma":[0.00006759259,0.00012318653,0.00006302541,0.00007753134,0.00018649657,0.00019086625,0.000075213524,0.00017414705,0.000047216203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021573542,0.000169922,0.020009132,0.0000137410225,0.00003351006,0.000009279454,0.0001035279,1.05488006e-7,0.000112886955,0.9784908,0.0007659205,0.00026958802],"study_design_scores_gemma":[0.00081286865,0.00005986588,0.029998505,0.00002337532,0.000033819106,0.00001395225,0.000073656796,0.000007733623,0.0009514493,0.9672083,0.0006520388,0.000164402],"about_ca_topic_score_codex":0.000035774498,"about_ca_topic_score_gemma":0.000022025553,"teacher_disagreement_score":0.015785458,"about_ca_system_score_codex":0.000015170367,"about_ca_system_score_gemma":0.000026281412,"threshold_uncertainty_score":0.50579727},"labels":[],"label_agreement":null},{"id":"W2759894817","doi":"","title":"Generalized characteristic polynomial of generalized R-vertex corona.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Corona (planetary geology); Vertex (graph theory); Polynomial; Combinatorics; Mathematical analysis; Graph; Physics; Astrobiology","score_opus":0.039452995323459646,"score_gpt":0.31202343979528646,"score_spread":0.2725704444718268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759894817","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99529517,0.000030778057,0.000022478223,0.00022894349,0.0010864681,0.00027866042,0.000036579782,0.000063827494,0.002957089],"genre_scores_gemma":[0.99757445,0.000022234652,0.0012011586,0.000049204045,0.000019869456,0.00005747452,0.000016577134,0.00003053011,0.001028528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989145,0.00008049324,0.00037166954,0.00022954284,0.0001725506,0.00023127871],"domain_scores_gemma":[0.9980112,0.00015799313,0.0004634293,0.0011779927,0.00009489644,0.00009452191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030090162,0.0001732391,0.00038720752,0.00004927597,0.00041444117,0.000060288785,0.0006394159,0.000103530016,0.00022717837],"category_scores_gemma":[0.00030911094,0.00016725188,0.00014756726,0.00005381156,0.0001951919,0.00012588325,0.00012766664,0.00011453698,0.000049279788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005499761,0.00018359323,0.0011710447,0.00002944087,0.000055032757,0.0000026743496,0.000118405755,1.061967e-7,0.016820803,0.9764235,0.004699322,0.0004410984],"study_design_scores_gemma":[0.0018662162,0.000040742936,0.0106265275,0.000024526445,0.000070638955,0.0000043511213,0.000010728743,0.000071570794,0.0101198405,0.9747162,0.002259138,0.0001895025],"about_ca_topic_score_codex":0.000065398905,"about_ca_topic_score_gemma":0.0000059166414,"teacher_disagreement_score":0.0094554825,"about_ca_system_score_codex":0.00002266509,"about_ca_system_score_gemma":0.00003875538,"threshold_uncertainty_score":0.68203336},"labels":[],"label_agreement":null},{"id":"W2759937049","doi":"","title":"Bicyclic graphs with the second up to seventh largest Wiener indices.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Bicyclic molecule; Combinatorics; Statistics; Graph; Medicinal chemistry; Chemistry","score_opus":0.023780826423362766,"score_gpt":0.2909774739884292,"score_spread":0.26719664756506645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759937049","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9856999,0.00001686188,0.000012786518,0.0016974948,0.00040309713,0.00040032752,0.000016418027,0.00006354632,0.011689591],"genre_scores_gemma":[0.99376535,0.000002230782,0.00016861586,0.00031351438,0.000009935357,0.00014993825,0.0000029631587,0.00002856554,0.0055588605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991179,0.000053228796,0.00014440987,0.00023925173,0.00018719469,0.00025799443],"domain_scores_gemma":[0.99818176,0.00018838649,0.0001923449,0.0012656411,0.000058475434,0.00011339798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040079397,0.00015679363,0.0001695808,0.000057985475,0.0009872719,0.0001479941,0.00078864,0.00006261394,0.00018088777],"category_scores_gemma":[0.00007612773,0.00010122773,0.000063956664,0.00016632676,0.00015933208,0.00015200788,0.00012905839,0.00018761156,0.00014464688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012206047,0.000079028905,0.0028617163,0.000013767036,0.000045056233,0.0000023021273,0.0007167964,1.3069747e-7,0.00018238829,0.9834013,0.012554241,0.00013104216],"study_design_scores_gemma":[0.00053598866,0.000055024564,0.008951718,0.000022420008,0.00003599054,0.0000052736696,0.00013307751,0.0000018207764,0.002023689,0.9567767,0.03129184,0.00016645377],"about_ca_topic_score_codex":0.000015597934,"about_ca_topic_score_gemma":0.00013167421,"teacher_disagreement_score":0.026624618,"about_ca_system_score_codex":0.000012501169,"about_ca_system_score_gemma":0.00002389496,"threshold_uncertainty_score":0.75933975},"labels":[],"label_agreement":null},{"id":"W2760792438","doi":"","title":"On the minimum spectral radius of trees with given matching number.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Matching (statistics); Spectral radius; RADIUS; Combinatorics; Statistics; Computer science; Physics; Computer security; Eigenvalues and eigenvectors; Quantum mechanics","score_opus":0.023870554136700285,"score_gpt":0.2862473691199902,"score_spread":0.2623768149832899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760792438","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97005194,0.0000033564395,0.000015114111,0.0009472635,0.00013697366,0.00019138647,0.000005559256,0.000028192924,0.028620202],"genre_scores_gemma":[0.99910605,0.0000019097251,0.00038154252,0.0000242546,0.0000069817165,0.000025175665,8.55505e-7,0.000016238959,0.0004369669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941623,0.000045644767,0.00013400242,0.00012557924,0.00014221144,0.0001363055],"domain_scores_gemma":[0.99837303,0.00053478393,0.0002072312,0.0008213981,0.000029864457,0.000033663426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002470621,0.00010267707,0.00015370717,0.000014895118,0.00040212017,0.000045863835,0.00047600362,0.00003536587,0.00007557392],"category_scores_gemma":[0.00010355737,0.00006467169,0.00005967465,0.000044923683,0.00016627883,0.00006327636,0.000041095216,0.00012912374,0.00003398725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028588633,0.0001433009,0.0010268508,0.000010594581,0.000038601585,0.000002182868,0.0005220805,7.072551e-7,0.00040747895,0.99611634,0.0016545439,0.000048746588],"study_design_scores_gemma":[0.00041117016,0.00006220784,0.005305889,0.00005258549,0.00002845469,0.0000043196706,0.0001686569,0.000008701841,0.0038755252,0.9898651,0.00013372085,0.000083640494],"about_ca_topic_score_codex":0.000018822768,"about_ca_topic_score_gemma":0.00001815761,"teacher_disagreement_score":0.029054124,"about_ca_system_score_codex":0.000010221437,"about_ca_system_score_gemma":0.000014592039,"threshold_uncertainty_score":0.3092824},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8091109,0.000024923087,0.14851652,0.023291066,0.00011729766,0.0014070302,0.00060306257,0.00023048773,0.016698748],"genre_scores_gemma":[0.97811896,0.0000023268606,0.018099453,0.00024033706,0.00009180242,0.00022953484,0.00001923088,0.00004693635,0.0031514107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884075,0.00004196941,0.0003061087,0.00025308176,0.00012306501,0.00043501292],"domain_scores_gemma":[0.9976861,0.0013465582,0.00007108597,0.00037152742,0.000073203046,0.00045155155],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00026460984,0.00018706608,0.0002496592,0.00011329598,0.00023317168,0.000033618235,0.0002395425,0.00012248442,0.007605228],"category_scores_gemma":[0.0004034444,0.0001255517,0.00015016116,0.000079878606,0.00014068831,0.00003359238,0.000017322844,0.00006833743,0.0023867432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072952726,0.000053741234,0.000024408679,0.00006406991,0.000020457488,0.0000016545621,0.00008430453,6.535118e-8,0.0009951527,0.97180027,0.026386084,0.0005625231],"study_design_scores_gemma":[0.00029981523,0.000027560242,0.00008488061,0.00009133663,0.000037161826,0.000008185713,0.00005609268,0.000021840144,0.0027825106,0.924075,0.072312266,0.00020332924],"about_ca_topic_score_codex":0.000037679365,"about_ca_topic_score_gemma":0.00014603436,"teacher_disagreement_score":0.1690081,"about_ca_system_score_codex":0.00010437536,"about_ca_system_score_gemma":0.0000462179,"threshold_uncertainty_score":0.99839},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96838397,0.0003254293,0.01984709,0.0012734327,0.000028525443,0.00041498768,0.000015929132,0.000014706521,0.009695944],"genre_scores_gemma":[0.99913424,0.00033121087,0.00018166193,0.00007248164,0.000044369717,0.00006235177,6.10403e-7,0.000012231345,0.00016086076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988889,0.00020409268,0.00039072864,0.00012462137,0.0001618856,0.00022973516],"domain_scores_gemma":[0.9965662,0.0016322786,0.000842998,0.000759047,0.00013960685,0.00005989378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028814112,0.00012369308,0.00022274637,0.00006527611,0.00084108295,0.000040155486,0.00067088194,0.00005583316,0.00009150706],"category_scores_gemma":[0.0003051942,0.00007951081,0.00020205288,0.00013533061,0.0005711947,0.00010124268,0.00003876692,0.0004207258,0.0000057677125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100203884,0.0001787663,0.00022274282,0.000011898173,0.00010843526,1.7801433e-7,0.000093425915,4.9340514e-7,0.00052052684,0.99669284,0.00020700782,0.0018635016],"study_design_scores_gemma":[0.00023270182,0.00006384968,0.0008037505,0.000026469887,0.00009932742,0.00004674947,0.0002080636,7.983468e-7,0.0019533744,0.994598,0.0018886891,0.00007826805],"about_ca_topic_score_codex":0.0000013419678,"about_ca_topic_score_gemma":0.0000034093482,"teacher_disagreement_score":0.030750265,"about_ca_system_score_codex":0.000011893049,"about_ca_system_score_gemma":0.00005908919,"threshold_uncertainty_score":0.6469015},"labels":[],"label_agreement":null},{"id":"W2767379641","doi":"","title":"Oriented Bicyclic Graphs with the First Five Large Skew Energies.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Skew; Mathematics; Combinatorics; Computer science; Telecommunications","score_opus":0.015444592651207314,"score_gpt":0.27054560026365354,"score_spread":0.25510100761244625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767379641","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.987408,0.000040475734,0.00003424667,0.0020392607,0.00033577782,0.0003245287,0.000016767726,0.00011178522,0.009689158],"genre_scores_gemma":[0.9980036,0.000015488875,0.00018515313,0.00015321969,0.000008926829,0.00014715877,0.00000555078,0.000027667887,0.0014532425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991065,0.00004003543,0.00014939922,0.00023160745,0.00018934502,0.00028306944],"domain_scores_gemma":[0.99792135,0.0002848681,0.00022633215,0.0014118113,0.0000900534,0.00006559329],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00030968277,0.00016652716,0.00018026869,0.000040403927,0.0017590922,0.00010761039,0.0007114437,0.000067085646,0.000055263445],"category_scores_gemma":[0.00013520001,0.00010555325,0.0000854974,0.00016138871,0.00023844892,0.00013588673,0.00014485119,0.00018228756,0.00006646101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015478687,0.00017257496,0.0019364962,0.000013698361,0.00005696234,0.0000037705759,0.0005559766,2.324808e-7,0.000023233923,0.9835417,0.013633852,0.00004599394],"study_design_scores_gemma":[0.0008675567,0.00004771414,0.0037112504,0.00003015816,0.000057454985,0.0000038789303,0.00015449396,0.000015032413,0.00062000536,0.9488893,0.04544817,0.00015496848],"about_ca_topic_score_codex":0.0000313296,"about_ca_topic_score_gemma":0.000097627155,"teacher_disagreement_score":0.034652412,"about_ca_system_score_codex":0.0000146702105,"about_ca_system_score_gemma":0.000021178308,"threshold_uncertainty_score":0.9995405},"labels":[],"label_agreement":null},{"id":"W2767409815","doi":"","title":"Harmonic index of graphs with more than one cut-vertex.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Index (typography); Combinatorics; Discrete mathematics; Graph; Computer science","score_opus":0.032786357015468164,"score_gpt":0.2902333492639153,"score_spread":0.25744699224844714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767409815","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9950039,0.00001965148,0.000040687322,0.00029402992,0.00015245262,0.00023691755,0.000008730639,0.00005102317,0.0041926145],"genre_scores_gemma":[0.99924815,0.000009842147,0.00037738789,0.000020297795,0.0000024960164,0.000044064906,0.0000030059061,0.000023444903,0.00027132203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999233,0.000027314221,0.00018463872,0.00018339865,0.0001953156,0.0001763395],"domain_scores_gemma":[0.9983328,0.00011183514,0.00027853384,0.0011181665,0.00009100196,0.000067636465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018627859,0.00012873621,0.00023392771,0.000056447436,0.00029826156,0.000038550796,0.00052987126,0.00006976564,0.000032131273],"category_scores_gemma":[0.00007095442,0.00011073091,0.000074858486,0.00009772502,0.00025460642,0.00013578855,0.00008409783,0.00014117206,0.000013509843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028734401,0.00029340351,0.01704717,0.000041123196,0.00007768519,0.0000020019754,0.00027807886,1.2377126e-7,0.00050997763,0.9811136,0.00040133286,0.00020677426],"study_design_scores_gemma":[0.0008151417,0.00007490037,0.034826033,0.000075885,0.00005855716,0.0000029044943,0.00008152465,0.000017738714,0.007972068,0.9558568,0.00008704381,0.00013138798],"about_ca_topic_score_codex":0.000036985224,"about_ca_topic_score_gemma":0.00001998613,"teacher_disagreement_score":0.025256779,"about_ca_system_score_codex":0.000010098281,"about_ca_system_score_gemma":0.000026944224,"threshold_uncertainty_score":0.45154753},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98107576,0.0008245581,0.0066141835,0.0034464067,0.00006975018,0.00026446948,0.0000010565575,0.000019664283,0.0076841493],"genre_scores_gemma":[0.99938416,0.00012334196,0.00009293496,0.00007498479,0.000027565116,0.0000018640686,1.6643052e-7,0.000008773616,0.00028617703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989294,0.00010066368,0.00038728857,0.000056137975,0.00026975342,0.0002567576],"domain_scores_gemma":[0.99863166,0.00043055107,0.00048188426,0.00024920443,0.00016861761,0.00003808508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011257358,0.00009551231,0.00021581828,0.000077739904,0.00008113871,0.000009527738,0.00042026857,0.00004087093,0.000014394455],"category_scores_gemma":[0.000085010455,0.000059939415,0.0001315912,0.00032884334,0.000041561834,0.000049885028,0.000010776488,0.00048121318,0.000003440699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058313555,0.0003559095,0.000005463623,0.000008434577,0.000039040337,9.278958e-7,0.0001574189,0.000009890953,0.0008222917,0.99671793,0.0011947614,0.0006296456],"study_design_scores_gemma":[0.00045194212,0.0010609021,0.00005562344,0.000037261827,0.000058328475,0.000059193786,0.00004844038,0.000008369113,0.0039736284,0.99316317,0.0010245623,0.00005856522],"about_ca_topic_score_codex":3.347572e-7,"about_ca_topic_score_gemma":3.23383e-7,"teacher_disagreement_score":0.01830843,"about_ca_system_score_codex":0.000072714894,"about_ca_system_score_gemma":0.00013173438,"threshold_uncertainty_score":0.24442583},"labels":[],"label_agreement":null},{"id":"W2767596174","doi":"","title":"Molecular graphs with extremal first geometric-arithmetic index.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Arithmetic; Discrete mathematics; Computer science","score_opus":0.022571108241076356,"score_gpt":0.27306227359960106,"score_spread":0.2504911653585247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767596174","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98996633,0.000053625092,0.0005874175,0.00035285932,0.00023264936,0.00031053647,0.0000053043213,0.00010432378,0.008386932],"genre_scores_gemma":[0.998559,0.000008347821,0.0010718148,0.00003678354,0.000004221093,0.00007317556,0.000002713406,0.00003615161,0.00020777847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989171,0.00003365107,0.00019391098,0.00029365972,0.00027528117,0.00028640722],"domain_scores_gemma":[0.9979973,0.00021941667,0.00022289275,0.0013281029,0.000108510154,0.00012382102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028795932,0.0001892389,0.00023460864,0.00017654782,0.0007547914,0.00015693509,0.00066169014,0.000096333424,0.00004604795],"category_scores_gemma":[0.00031233983,0.00016354588,0.00009334236,0.00033906693,0.00020572662,0.00015993194,0.00012006711,0.00019993476,0.00004153128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015218448,0.00022474019,0.009430734,0.000029422308,0.000056731136,0.000025981035,0.00007680624,0.0000019581425,0.00007980114,0.98932767,0.00043988854,0.00029102058],"study_design_scores_gemma":[0.00092277996,0.00008046082,0.010950809,0.000039224837,0.00006220763,0.00001380992,0.00004041002,0.000037900307,0.0018091769,0.9850021,0.0008146736,0.00022643477],"about_ca_topic_score_codex":0.000030282346,"about_ca_topic_score_gemma":0.000015903635,"teacher_disagreement_score":0.0085926615,"about_ca_system_score_codex":0.000020314455,"about_ca_system_score_gemma":0.00002460205,"threshold_uncertainty_score":0.6669207},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12721685,0.00016445968,0.6155179,0.00019034663,0.00015853153,0.00068837666,0.00029138432,0.00038402213,0.25538814],"genre_scores_gemma":[0.98055875,0.00005026516,0.018149896,0.0002060839,0.00007807809,0.00015205987,0.000034379722,0.00009010198,0.00068037654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784195,0.000042000436,0.0007392626,0.0004994178,0.0004197853,0.00045757284],"domain_scores_gemma":[0.9975666,0.0006527377,0.00048822426,0.0009895721,0.00011650073,0.00018636939],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035554447,0.0004352214,0.00066373404,0.0001923779,0.0003057038,0.00005265412,0.00043384888,0.00019879054,0.00012674238],"category_scores_gemma":[0.00006642852,0.00038463264,0.00014959418,0.00049846485,0.000713517,0.00007519576,0.00010536085,0.0001310676,0.000014089117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008167547,0.00027514834,0.0000065129425,0.00024043092,0.0000845992,0.0000018381425,0.0012903347,0.0000011894579,0.0038780386,0.9912632,0.0015563065,0.0013207213],"study_design_scores_gemma":[0.000553327,0.00011596095,0.000007679342,0.0001449626,0.00010273231,0.000005570254,0.0010031199,0.0003569768,0.023454158,0.9683719,0.0054706736,0.0004129048],"about_ca_topic_score_codex":0.000008678711,"about_ca_topic_score_gemma":0.00015862002,"teacher_disagreement_score":0.85334194,"about_ca_system_score_codex":0.000029002995,"about_ca_system_score_gemma":0.0000311015,"threshold_uncertainty_score":0.9998606},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5784675,0.000054719,0.4199947,0.000101571735,0.00023482711,0.00028317986,0.00003863636,0.000015607553,0.000809221],"genre_scores_gemma":[0.992318,0.0000035271814,0.007317034,0.0000019255008,0.0002661439,0.000016450627,0.0000024312653,0.000015999836,0.000058489917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987988,0.000052150528,0.0006890196,0.000097727825,0.00022894703,0.00013337901],"domain_scores_gemma":[0.99688566,0.00073749135,0.0015226156,0.00031038834,0.00047322272,0.00007062887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007070697,0.00010465564,0.0003846768,0.00015914414,0.00059276266,0.00012823066,0.0002824529,0.000056108307,0.00000908539],"category_scores_gemma":[0.0006473195,0.000089829926,0.00016878048,0.00005690445,0.000068545676,0.00021237659,0.000045171855,0.000118611424,0.0000010035887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041400337,0.000105056664,0.00020852189,0.0007124836,0.00015180708,5.5281185e-7,0.00022787125,0.000010076014,0.016240548,0.98140115,0.00003055647,0.0008700055],"study_design_scores_gemma":[0.01875344,0.0009433217,0.011620459,0.0109881,0.0061488296,0.00025326584,0.008933725,0.08322757,0.038459335,0.81933475,0.00018748135,0.0011497186],"about_ca_topic_score_codex":0.000013132081,"about_ca_topic_score_gemma":0.000023792589,"teacher_disagreement_score":0.4138505,"about_ca_system_score_codex":0.000038587106,"about_ca_system_score_gemma":0.000054569948,"threshold_uncertainty_score":0.4559111},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96740633,0.000058148384,0.005182041,0.00034394878,0.00018216317,0.0012549318,0.0004384227,0.00006779064,0.02506624],"genre_scores_gemma":[0.98331845,0.000022411978,0.015900169,0.00004276975,0.000058874823,0.00016689721,0.000022215829,0.00007140091,0.00039679246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978288,0.00014404628,0.001036051,0.0003104086,0.0004461773,0.00023453962],"domain_scores_gemma":[0.9942436,0.0020280073,0.001400679,0.0020631317,0.00020677438,0.000057781297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011802714,0.00036554094,0.0008053939,0.0001575479,0.0000981027,0.000024862517,0.0009963961,0.0002765199,0.0002922395],"category_scores_gemma":[0.00087219593,0.00023032985,0.0004981754,0.00022573206,0.0005610754,0.00002427614,0.00047569408,0.00035723703,0.000026399452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013402786,0.000274051,0.000010959501,0.0010553376,0.0001878413,2.7240486e-7,0.0013416449,0.000012311402,0.0011833712,0.992283,0.0036044917,0.00003331151],"study_design_scores_gemma":[0.000118050586,0.000057534067,0.000034293407,0.0008341239,0.0002351969,0.0000015303518,0.0003710392,0.0002734351,0.02178203,0.9760084,0.00006854127,0.00021582795],"about_ca_topic_score_codex":0.0000065435397,"about_ca_topic_score_gemma":0.000004267036,"teacher_disagreement_score":0.024669448,"about_ca_system_score_codex":0.00001512798,"about_ca_system_score_gemma":0.00005942439,"threshold_uncertainty_score":0.93925786},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9458492,0.00010817757,0.04777122,0.0002621191,0.00021094004,0.0007357306,0.00002207767,0.00006136191,0.0049791783],"genre_scores_gemma":[0.998694,0.000015089895,0.0010166749,0.00004053161,0.000104739804,0.0000452285,0.0000033928748,0.000011591604,0.0000687328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991702,0.00012463886,0.00037361466,0.00010380148,0.00011715266,0.00011063018],"domain_scores_gemma":[0.99758655,0.0010271145,0.0004786276,0.0007303081,0.00012372475,0.000053670065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006514467,0.00008646956,0.00019134287,0.000020364552,0.00038271668,0.00003376696,0.00035184252,0.00008300639,0.0000073790357],"category_scores_gemma":[0.00023917468,0.00005782397,0.00007199703,0.000057582794,0.00034027794,0.00013463196,0.000017790464,0.00010397111,0.000001343895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042567186,0.000066991444,0.00069594954,0.00004451645,0.000049219245,2.1635691e-7,0.00014827683,0.00007540906,0.004664495,0.9937116,0.00009453402,0.00040623074],"study_design_scores_gemma":[0.0007633984,0.00013937597,0.0029992897,0.0000787372,0.000103736,0.0000035911937,0.00032813608,0.04429627,0.012930352,0.93810606,0.00011756084,0.0001335079],"about_ca_topic_score_codex":0.00006472579,"about_ca_topic_score_gemma":0.000035447618,"teacher_disagreement_score":0.055605546,"about_ca_system_score_codex":0.000002834142,"about_ca_system_score_gemma":0.000019726576,"threshold_uncertainty_score":0.2943586},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96966064,0.0011831553,0.019750658,0.00072161993,0.00047193147,0.0006343455,0.00015386233,0.000015146756,0.0074086124],"genre_scores_gemma":[0.9755253,0.00026952088,0.023957677,0.000013142302,0.00015001238,0.0000070225638,0.0000025130948,0.000018400775,0.000056416047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99741894,0.00037129765,0.001448966,0.00012291581,0.0004794581,0.0001584145],"domain_scores_gemma":[0.99325097,0.0016035187,0.003268961,0.00081787945,0.0009816784,0.00007702101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030122574,0.0001937681,0.00090413104,0.00013053183,0.0001514109,0.000023767523,0.00091154675,0.00014479348,0.00007781929],"category_scores_gemma":[0.00062634936,0.00012108646,0.0007496961,0.0001498238,0.0014279257,0.000035602963,0.0002404472,0.0005538997,0.0000012133623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000698518,0.00022391601,0.00017115005,0.00027461367,0.0004886913,0.000002056948,0.0003369849,0.0000032584305,0.0006008195,0.9935704,0.003130763,0.0004988138],"study_design_scores_gemma":[0.0012659106,0.000089585956,0.0007713221,0.00044149987,0.0002830042,0.000041319112,0.0001435455,0.00004144922,0.004539915,0.99061203,0.0016659793,0.00010441797],"about_ca_topic_score_codex":0.0000072999937,"about_ca_topic_score_gemma":0.000018768984,"teacher_disagreement_score":0.007352196,"about_ca_system_score_codex":0.000019620586,"about_ca_system_score_gemma":0.00018117028,"threshold_uncertainty_score":0.5261252},"labels":[],"label_agreement":null},{"id":"W2789910199","doi":"","title":"Some New Upper Bounds on the Wiener and Edge Wiener Index of k-Connected Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Index (typography); Enhanced Data Rates for GSM Evolution; Combinatorics; Upper and lower bounds; Discrete mathematics; Graph; Mathematical analysis; Telecommunications; Computer science","score_opus":0.023855923244972863,"score_gpt":0.2704288971248488,"score_spread":0.24657297387987592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789910199","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9953973,0.00006741903,0.000012422811,0.0007828567,0.00039789997,0.0002233589,0.0000046330924,0.000053887634,0.003060203],"genre_scores_gemma":[0.9989825,0.0000127676085,0.00009505513,0.0002888347,0.000033893903,0.000025959811,0.000001926298,0.0000225632,0.0005365145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915564,0.00007447164,0.00021279116,0.00020596234,0.00016113887,0.00018998714],"domain_scores_gemma":[0.9987016,0.00045068614,0.00011510012,0.00056278886,0.00009104333,0.00007883708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029879695,0.00014274108,0.00018288147,0.000082161925,0.00021576416,0.00002863534,0.0002429941,0.00008956947,0.00008824608],"category_scores_gemma":[0.00017132524,0.000098405784,0.00006772906,0.00032851653,0.00034751045,0.00009899238,0.000067188594,0.0001348646,0.000025792424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020635325,0.00012264014,0.0009910502,0.000008654399,0.000041297844,2.554747e-7,0.0005637414,6.4298575e-8,0.0013710059,0.9893701,0.0073335893,0.0001769825],"study_design_scores_gemma":[0.00051417813,0.000116446085,0.0033838549,0.000029240211,0.00003152789,0.0000019698102,0.00009315117,0.000020337668,0.009472372,0.9838179,0.0023974746,0.00012159286],"about_ca_topic_score_codex":0.000018967066,"about_ca_topic_score_gemma":0.0000066940347,"teacher_disagreement_score":0.0081013655,"about_ca_system_score_codex":0.000009434028,"about_ca_system_score_gemma":0.0000327473,"threshold_uncertainty_score":0.40128717},"labels":[],"label_agreement":null},{"id":"W2790008489","doi":"","title":"On the harmonic index of quasi-tree graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Tree (set theory); Harmonic; Combinatorics; Discrete mathematics; Acoustics; Computer science; Physics; World Wide Web","score_opus":0.02961291843188532,"score_gpt":0.2841706048881804,"score_spread":0.25455768645629506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790008489","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98594373,0.0000135157325,0.000047123693,0.00046562174,0.0002845491,0.0002093524,0.0000038133744,0.000048787046,0.012983504],"genre_scores_gemma":[0.99955344,0.000003577758,0.00007329111,0.00011969752,0.000005821853,0.00003915046,9.1024907e-7,0.000014922957,0.00018915726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929017,0.000080617734,0.00018800226,0.00013467275,0.0001624874,0.00014406726],"domain_scores_gemma":[0.99842685,0.00072081253,0.00011855549,0.00060788356,0.000090291054,0.00003561952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003904416,0.000098093304,0.00013359629,0.000052719275,0.00015936565,0.000011125222,0.0003385966,0.00005558484,0.00014660726],"category_scores_gemma":[0.00020011414,0.0000678942,0.00008329227,0.0003207396,0.000242364,0.00003071936,0.00004391718,0.00012886808,0.00009722561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013972996,0.00026392203,0.0004194442,0.000008000131,0.000027562079,2.3871021e-7,0.0002606656,2.4099258e-8,0.00050821534,0.9919786,0.0062539508,0.00026543997],"study_design_scores_gemma":[0.00025816791,0.00014509125,0.00128744,0.000021672524,0.00001803471,8.1008443e-7,0.000082615894,0.0000229546,0.012983523,0.98458904,0.00051622145,0.00007443552],"about_ca_topic_score_codex":0.0000068174186,"about_ca_topic_score_gemma":0.0000064555306,"teacher_disagreement_score":0.013609737,"about_ca_system_score_codex":0.000009236222,"about_ca_system_score_gemma":0.000017148031,"threshold_uncertainty_score":0.27686453},"labels":[],"label_agreement":null},{"id":"W2790565012","doi":"","title":"Rank of the Hermitian-adjacency matrix of a mixed graph in terms of matching number.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hermitian matrix; Adjacency matrix; Rank (graph theory); Combinatorics; Matching (statistics); Graph; Matrix (chemical analysis); Discrete mathematics; Pure mathematics; Statistics","score_opus":0.01640992588016643,"score_gpt":0.29863082022717624,"score_spread":0.2822208943470098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790565012","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9932797,0.000013581299,0.000021080024,0.000060966227,0.00029568534,0.0002653255,0.0000127887115,0.000014101812,0.006036754],"genre_scores_gemma":[0.99920404,0.000005282094,0.0006491002,0.0000052988157,0.000003992886,0.000016881379,8.003508e-7,0.000014520269,0.0001001075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989776,0.000120315046,0.00046347076,0.00012130345,0.00017081584,0.00014649623],"domain_scores_gemma":[0.9987529,0.00028031258,0.00033273845,0.00054088404,0.000067514346,0.000025660305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046683723,0.00010035098,0.00027681942,0.000059919963,0.00004790038,0.0000032986406,0.00037599078,0.000069944224,0.00005820587],"category_scores_gemma":[0.0001074317,0.00007791924,0.00013206426,0.00051813916,0.00025466928,0.000050047118,0.00007896,0.000106349275,0.0000052771693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017873595,0.00028135296,0.016093075,0.00012558137,0.000021662943,2.8485235e-7,0.0010838198,3.6375323e-7,0.0121559305,0.9699308,0.00019478636,0.00009441981],"study_design_scores_gemma":[0.0005974005,0.00002984039,0.0121408915,0.00015551179,0.000025635996,0.000002278169,0.00014977057,0.0000044015665,0.05319508,0.9336065,0.000025489731,0.000067173525],"about_ca_topic_score_codex":0.000040979638,"about_ca_topic_score_gemma":0.000024143543,"teacher_disagreement_score":0.04103915,"about_ca_system_score_codex":0.000009360638,"about_ca_system_score_gemma":0.000019524454,"threshold_uncertainty_score":0.31774545},"labels":[],"label_agreement":null},{"id":"W2792756847","doi":"","title":"Subgraph Component Polynomials Of Some Compound Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Component (thermodynamics); Combinatorics; Physics","score_opus":0.03024248674765808,"score_gpt":0.29254198734618153,"score_spread":0.26229950059852347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792756847","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99531907,0.00007718304,0.0000193295,0.00016513804,0.0007025439,0.00028707625,0.000019388692,0.00009758864,0.0033126876],"genre_scores_gemma":[0.99896604,0.000012737428,0.00077714794,0.00007417454,0.000017269678,0.000028903578,0.000007712748,0.000024277824,0.00009172939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988299,0.000099292185,0.00041063703,0.00021838925,0.00020229006,0.00023947493],"domain_scores_gemma":[0.99855536,0.00037992647,0.00022587444,0.00060447503,0.00014078338,0.00009357484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043272926,0.00016028101,0.0003256703,0.00014490892,0.00018770859,0.000017805985,0.00035557372,0.00008377917,0.00009879124],"category_scores_gemma":[0.000060317398,0.00015440652,0.00015124066,0.00035056318,0.00044561355,0.000100482204,0.000075078104,0.000107618194,0.00006597644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024146628,0.00037412954,0.0010511868,0.000028693641,0.000059681654,9.302007e-7,0.0002469957,4.9657864e-8,0.012171587,0.9809074,0.005062286,0.000072909424],"study_design_scores_gemma":[0.000619296,0.00011049552,0.0019770924,0.000028027194,0.000043215365,0.000004199228,0.000060178918,0.0000075039293,0.036728755,0.95887786,0.0013882807,0.00015506614],"about_ca_topic_score_codex":0.000025305751,"about_ca_topic_score_gemma":0.000004424609,"teacher_disagreement_score":0.024557168,"about_ca_system_score_codex":0.00001529053,"about_ca_system_score_gemma":0.000022346418,"threshold_uncertainty_score":0.6296515},"labels":[],"label_agreement":null},{"id":"W2794133300","doi":"","title":"Bipartite graphs with every k-matching in a Hamiltonian cycle.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Hamiltonian path; Combinatorics; Matching (statistics); Hamiltonian (control theory); Complete bipartite graph; Pancyclic graph; Discrete mathematics; Chordal graph; Graph; 1-planar graph; Statistics; Mathematical optimization","score_opus":0.017341850816953778,"score_gpt":0.27518320199856194,"score_spread":0.25784135118160817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794133300","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9920146,0.000016687372,0.00004859841,0.00014972569,0.00019505635,0.00022370106,0.0000027782864,0.0001142472,0.0072345925],"genre_scores_gemma":[0.9980495,0.0000036031038,0.0016164426,0.00009449642,0.000007672052,0.000067145746,0.0000020217242,0.000026918633,0.00013219184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990751,0.00006765979,0.00021258065,0.0002296802,0.00014967467,0.00026528488],"domain_scores_gemma":[0.9991544,0.00019099862,0.00008304937,0.00044293824,0.000056612724,0.00007199754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033848654,0.00013947599,0.00017972941,0.0001296607,0.00016218964,0.00003328216,0.00021214537,0.00006232636,0.000042389504],"category_scores_gemma":[0.000042623775,0.00012098606,0.00004429393,0.0005602484,0.00014871401,0.00013940217,0.000044398013,0.00015978346,0.00008859583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023656181,0.00016998776,0.003540121,0.000014806507,0.000017814564,0.0000050452713,0.0012604119,0.000001073243,0.0005591957,0.9939618,0.00030469327,0.00014140196],"study_design_scores_gemma":[0.0005845077,0.0000852933,0.004862078,0.00007687502,0.000015897931,0.000006699405,0.00014427456,0.000031810887,0.0013137937,0.9921901,0.00052298635,0.00016565161],"about_ca_topic_score_codex":0.000038966646,"about_ca_topic_score_gemma":0.00016040025,"teacher_disagreement_score":0.0071024005,"about_ca_system_score_codex":0.000023114359,"about_ca_system_score_gemma":0.000026492116,"threshold_uncertainty_score":0.4933668},"labels":[],"label_agreement":null},{"id":"W2794154631","doi":"","title":"On the Spectral Moment of Quasi-trees and Quasi-unicyclic Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Moment (physics); Combinatorics; Physics; Quantum mechanics","score_opus":0.024544570364443134,"score_gpt":0.28228721636879345,"score_spread":0.2577426460043503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794154631","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99434406,0.00003103838,0.000040128078,0.00063232274,0.00017904745,0.00023939084,0.0000054102143,0.00003775419,0.004490841],"genre_scores_gemma":[0.9995055,0.000017125025,0.00020132185,0.00007617544,0.0000074152967,0.00003305497,0.000001013629,0.000013544521,0.00014484595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925333,0.00008558199,0.0001955999,0.00015889444,0.00014883981,0.00015772396],"domain_scores_gemma":[0.99873906,0.0005757543,0.000107036256,0.00048373686,0.000046175704,0.000048252525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003594777,0.000113852104,0.00016033226,0.00005558219,0.00017381074,0.000015720532,0.00021678349,0.00004564227,0.00007377486],"category_scores_gemma":[0.00007894424,0.000079321886,0.00006248029,0.00021775861,0.00030549805,0.000033567085,0.000045676665,0.00010502385,0.000024901527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011456188,0.00042317752,0.00038368622,0.000008856326,0.00003287513,3.1213364e-7,0.0005629713,2.2524567e-8,0.0006551108,0.99580526,0.0018346932,0.00028159012],"study_design_scores_gemma":[0.00029039884,0.0003667288,0.0014835675,0.000026065545,0.000025015885,0.000001648988,0.00019597553,0.000030394951,0.0071053198,0.9899571,0.000431046,0.00008673123],"about_ca_topic_score_codex":0.0000112420275,"about_ca_topic_score_gemma":0.00001376647,"teacher_disagreement_score":0.006450209,"about_ca_system_score_codex":0.000010240333,"about_ca_system_score_gemma":0.000009761333,"threshold_uncertainty_score":0.32346526},"labels":[],"label_agreement":null},{"id":"W2794213857","doi":"","title":"On the largest real root of independence polynomials of trees.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Root (linguistics); Independence (probability theory); Statistics; Linguistics","score_opus":0.028252631643615227,"score_gpt":0.2964323801444416,"score_spread":0.2681797485008264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794213857","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98326445,0.000006834779,0.000009618936,0.00018173872,0.00018463653,0.00017680887,0.000013052703,0.00002003656,0.016142838],"genre_scores_gemma":[0.9996746,0.0000033151525,0.00008152471,0.000020691994,0.00000811445,0.000017493763,9.470872e-7,0.000010464956,0.00018285886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992602,0.00008613175,0.00024384182,0.00011337523,0.00018308262,0.00011338319],"domain_scores_gemma":[0.9982881,0.0008363507,0.00020073733,0.0005326196,0.00011382164,0.000028362003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005953458,0.00008012413,0.00016702918,0.000038289676,0.00008420359,0.0000051044144,0.00031973512,0.00006712165,0.00012250138],"category_scores_gemma":[0.0002923554,0.000056723413,0.000060823808,0.00019583815,0.00021881431,0.000030293942,0.000047075526,0.000097302494,0.000027482625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021391039,0.00020280827,0.0012563327,0.000009303609,0.000019567651,1.848147e-7,0.0002702586,1.0256377e-7,0.0045573814,0.9911279,0.0024750324,0.000059730886],"study_design_scores_gemma":[0.00022637147,0.00012734115,0.00473737,0.000028513012,0.000017327675,5.8486796e-7,0.000056873785,0.000004857621,0.076912984,0.91773075,0.00010561364,0.00005138298],"about_ca_topic_score_codex":0.000040744253,"about_ca_topic_score_gemma":0.000048456186,"teacher_disagreement_score":0.07339713,"about_ca_system_score_codex":0.0000087881745,"about_ca_system_score_gemma":0.000028315257,"threshold_uncertainty_score":0.23131137},"labels":[],"label_agreement":null},{"id":"W2794409369","doi":"","title":"On the sum of the squares of all distances in bipartite graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Explained sum of squares; Cograph; Discrete mathematics; Statistics; Chordal graph; 1-planar graph; Graph","score_opus":0.029112963078660386,"score_gpt":0.29037175031374907,"score_spread":0.26125878723508866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794409369","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9952797,0.000026677417,0.0000023557327,0.0004656525,0.00020022993,0.0001933942,0.000007894691,0.000009472985,0.0038145713],"genre_scores_gemma":[0.99984705,0.0000050202975,0.000022882277,0.00005168575,0.000002124476,0.000026421167,4.1989765e-7,0.0000064717133,0.00003790292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938136,0.00010077577,0.00020191901,0.00008598595,0.00013207585,0.000097882024],"domain_scores_gemma":[0.99869084,0.0006361628,0.00014002425,0.00046895896,0.000050844465,0.000013194427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036360367,0.00006516687,0.00011356156,0.00003027427,0.00006210833,0.0000048938095,0.00033234255,0.000029792689,0.000039241975],"category_scores_gemma":[0.00017459005,0.000035536203,0.00006532747,0.0003321052,0.00032265394,0.000023641469,0.000038160473,0.00007652082,0.000005045731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012491769,0.00016066004,0.002757947,0.000014892747,0.000012628041,6.088801e-8,0.000794089,1.6942157e-7,0.0013516314,0.9935481,0.001326001,0.000021356542],"study_design_scores_gemma":[0.00015114811,0.000048227153,0.003132654,0.00005148547,0.000010796079,1.2607119e-7,0.00016710306,0.0000082286615,0.04636804,0.9495976,0.0004263126,0.000038291135],"about_ca_topic_score_codex":0.000014759249,"about_ca_topic_score_gemma":0.00006259261,"teacher_disagreement_score":0.045016408,"about_ca_system_score_codex":0.00000545958,"about_ca_system_score_gemma":0.000010000845,"threshold_uncertainty_score":0.14491242},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9795261,0.00067748973,0.012017455,0.0004578884,0.00003618712,0.0010842124,0.000004277539,0.00011413647,0.006082254],"genre_scores_gemma":[0.99827427,0.00007096568,0.0009937813,0.000089572364,0.000115223396,0.00017685562,1.6288934e-7,0.000017515853,0.00026165217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993591,0.000009110587,0.0001721117,0.00019583172,0.000101078076,0.00016279286],"domain_scores_gemma":[0.99947083,0.000083032166,0.00012205005,0.00013018322,0.00014116248,0.00005276157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003635266,0.00010998035,0.00013927753,0.00004593172,0.00028160715,0.000033169923,0.00024100016,0.00006783591,0.0000028688946],"category_scores_gemma":[0.000047847625,0.000071437076,0.000039270726,0.0003311306,0.00045563496,0.00010978168,0.00007355041,0.0001289094,8.6611703e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022116796,0.000045430195,0.00014872816,0.000040944105,0.000022995799,5.6856977e-9,0.0002308171,0.00000139805,0.004364308,0.9929892,0.0008345833,0.0012994702],"study_design_scores_gemma":[0.00011795543,0.000034665285,0.000082537284,0.000030755444,0.00006390773,0.00001071957,0.00007687034,0.0027849004,0.007730646,0.9886033,0.0003724012,0.000091330636],"about_ca_topic_score_codex":0.000002026316,"about_ca_topic_score_gemma":0.0000010851247,"teacher_disagreement_score":0.018748172,"about_ca_system_score_codex":0.000006204738,"about_ca_system_score_gemma":0.000009106853,"threshold_uncertainty_score":0.29131195},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03179296,0.000014668123,0.9461514,0.015993908,0.00005130467,0.0018016433,0.001231909,0.00043588874,0.0025263426],"genre_scores_gemma":[0.5041291,0.0000032778064,0.48959938,0.0047163246,0.00018097716,0.0008054764,0.00009424399,0.000089843255,0.0003813373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974157,0.00017528838,0.0008214391,0.0005845916,0.00038829204,0.00061466306],"domain_scores_gemma":[0.9957412,0.0020786817,0.00019343695,0.0008499477,0.00026792748,0.00086879404],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075527496,0.00043852275,0.0006733765,0.00023179156,0.0003729731,0.00014057205,0.0007071988,0.00015795528,0.00014944572],"category_scores_gemma":[0.0039589475,0.00037154133,0.00034678166,0.0013301262,0.000079285244,0.000097933895,0.00023197055,0.00038329465,0.00070938416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053876058,0.00026550516,0.00001104064,0.00008126877,0.000082940795,0.000007354291,0.0022361428,0.000045257515,0.004397738,0.98683727,0.004505939,0.0014756394],"study_design_scores_gemma":[0.00083363295,0.00071001274,0.000061456136,0.00028231292,0.00025769556,0.000013259277,0.0006307542,0.005951946,0.0060738344,0.9587988,0.025643699,0.0007425973],"about_ca_topic_score_codex":0.000005141773,"about_ca_topic_score_gemma":0.000020627396,"teacher_disagreement_score":0.47233617,"about_ca_system_score_codex":0.000076370496,"about_ca_system_score_gemma":0.000043411605,"threshold_uncertainty_score":0.99987364},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39934698,0.0007821593,0.58102673,0.0010728411,0.0001274973,0.0074725985,0.0041197706,0.00045436487,0.0055970536],"genre_scores_gemma":[0.94948304,0.00018092652,0.045151673,0.00006798551,0.0005847858,0.003224329,0.0006280408,0.00008838668,0.00059086096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984446,0.00006652952,0.0005518723,0.0005624425,0.00014039679,0.00023416526],"domain_scores_gemma":[0.9975812,0.0005178251,0.00041317596,0.0010227138,0.00032766093,0.00013742219],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044917897,0.00028976667,0.00046431468,0.00014617867,0.00026157958,0.000040454186,0.0005664141,0.00034471473,0.0000641682],"category_scores_gemma":[0.00006860465,0.0002705353,0.00018329018,0.00021870708,0.00020908861,0.00006036667,0.00015882589,0.00023168854,0.000017799843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002250648,0.00030895346,0.000020627303,0.00043318674,0.000079779216,6.814111e-8,0.00035133347,0.000008754637,0.0021703525,0.9943952,0.0005743878,0.0016348567],"study_design_scores_gemma":[0.00026022003,0.00008651657,0.0000747247,0.00005307223,0.00027485093,0.000002532055,0.0001735997,0.0035211106,0.0067061186,0.98125726,0.0072955214,0.000294462],"about_ca_topic_score_codex":0.0000035566852,"about_ca_topic_score_gemma":0.000020532312,"teacher_disagreement_score":0.550136,"about_ca_system_score_codex":0.000012056893,"about_ca_system_score_gemma":0.00007158203,"threshold_uncertainty_score":0.99997467},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.871804,0.00001303107,0.00084909337,0.00011299422,0.00013773264,0.0001811391,0.000021076841,0.00007215564,0.12680875],"genre_scores_gemma":[0.9941355,0.000012836922,0.00058930484,0.00003524024,0.000034110868,0.0000026883465,0.0000056187023,0.0000077139475,0.005176984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896854,0.00012435406,0.00020852046,0.00024069278,0.0003037503,0.00015415557],"domain_scores_gemma":[0.99861354,0.00055924314,0.00016293017,0.00046565995,0.00012398008,0.00007467535],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00015573247,0.00014006614,0.0001621376,0.00017734445,0.0013866845,0.000010016569,0.00038629767,0.00008180778,0.00006351054],"category_scores_gemma":[0.00012650953,0.00011839857,0.00018125845,0.00053938443,0.00108204,0.00013704645,0.000061467785,0.00020475722,0.000033411616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057609584,0.00021482358,0.0018914342,0.000015702532,0.000049993167,0.000097223005,0.000088645764,0.00004833195,0.0018745163,0.9947408,0.00089861226,0.000022296852],"study_design_scores_gemma":[0.0012179218,0.00017341014,0.06098939,0.00024728532,0.0002075359,0.0005940615,0.00041166553,0.00015637041,0.020482019,0.87391174,0.04092941,0.0006791963],"about_ca_topic_score_codex":0.000037590784,"about_ca_topic_score_gemma":0.000006294575,"teacher_disagreement_score":0.12233148,"about_ca_system_score_codex":0.000089008834,"about_ca_system_score_gemma":0.00014432361,"threshold_uncertainty_score":0.9999134},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9880648,0.0007922674,0.006417463,0.0015650546,0.000022848526,0.0011712894,0.00009178684,0.000071237984,0.0018032282],"genre_scores_gemma":[0.9980869,0.00021383994,0.0009239373,0.0000847805,0.00009324879,0.00038614837,0.00000755,0.0000138322675,0.00018971389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991844,0.00005029722,0.00026808755,0.0002255479,0.00010576922,0.00016588421],"domain_scores_gemma":[0.9985858,0.0007126046,0.00013732005,0.0003190231,0.0001644766,0.00008076155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035131717,0.00011766384,0.0001554766,0.000044328066,0.0006709165,0.000023332892,0.00016559534,0.000046627967,0.000042282285],"category_scores_gemma":[0.00008694598,0.0000868597,0.000041757765,0.00027885998,0.00023736994,0.00005483203,0.00009054607,0.00008873992,0.00002138154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066428297,0.00007825268,0.00007515127,0.000031423766,0.000032825345,2.8751064e-8,0.00023873855,5.5168037e-8,0.003097302,0.99466157,0.00032271052,0.0014552732],"study_design_scores_gemma":[0.00028659622,0.000075535565,0.0014580841,0.000013842849,0.00006548747,0.0000067207775,0.00025117947,0.00065367203,0.011714181,0.95756304,0.027777126,0.00013452774],"about_ca_topic_score_codex":0.0000030926267,"about_ca_topic_score_gemma":0.000030461872,"teacher_disagreement_score":0.03709855,"about_ca_system_score_codex":0.0000040088457,"about_ca_system_score_gemma":0.000015543383,"threshold_uncertainty_score":0.51602155},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99737334,0.00015629537,0.0002724358,0.00023975622,0.00011540681,0.000155411,0.0000044826456,0.0000064950614,0.0016763714],"genre_scores_gemma":[0.9971859,0.000028350469,0.0026446253,0.000018996312,0.00009048043,0.0000022836703,1.8295786e-7,0.0000056701106,0.000023519346],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987611,0.000038765153,0.00050805626,0.00016326884,0.00036814561,0.00016065527],"domain_scores_gemma":[0.998604,0.00019413706,0.0007802594,0.00017769726,0.00017314061,0.00007076092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014628201,0.000101940095,0.00029073906,0.00027002898,0.00018833527,0.000018749144,0.00038079006,0.00004326614,0.000054001554],"category_scores_gemma":[0.00008951585,0.00007557054,0.00008583591,0.00064223283,0.0011885072,0.00013820794,0.000058889087,0.00014286653,0.0000024469778],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005273962,0.000550147,0.004338258,0.00015241941,0.00011212603,0.0000014119828,0.0021666263,0.000006212334,0.74323136,0.23058955,0.0062728385,0.012051623],"study_design_scores_gemma":[0.0013738264,0.0006465371,0.0146293575,0.00013736439,0.00013502868,0.00004400172,0.001010347,0.00008520243,0.58338976,0.39756542,0.0007949984,0.00018813342],"about_ca_topic_score_codex":0.000004374067,"about_ca_topic_score_gemma":0.0000038868993,"teacher_disagreement_score":0.16697587,"about_ca_system_score_codex":0.000011670134,"about_ca_system_score_gemma":0.00014664131,"threshold_uncertainty_score":0.43791044},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96629363,0.00022100967,0.021582928,0.000706397,0.0083415285,0.0003709448,0.0000047349936,0.000047731977,0.0024310744],"genre_scores_gemma":[0.9905617,0.000039319573,0.008707098,0.000008726281,0.0006479858,0.000003151374,4.4305858e-7,0.000023498378,0.0000080620985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787533,0.000078027864,0.0011341537,0.000120922545,0.00056732853,0.00022421162],"domain_scores_gemma":[0.995133,0.00234974,0.0015124488,0.0002737742,0.0006096328,0.0001214265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018100342,0.00018950197,0.00048867724,0.00011649333,0.0006342984,0.00009567084,0.00039401607,0.0001163036,0.0000066218668],"category_scores_gemma":[0.0009459029,0.0001375142,0.00022916225,0.00031627933,0.0002252405,0.00014566671,0.000106689964,0.00045733352,0.0000016576486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045343604,0.0005401985,0.000017167655,0.000049291968,0.00011333931,0.0000026177886,0.0004989145,0.000038291895,0.00080411055,0.9973504,0.00015683804,0.0003835045],"study_design_scores_gemma":[0.0021948316,0.0002955583,0.000055731038,0.00016562759,0.0001142774,0.00012264913,0.0004907629,0.00014135087,0.002135863,0.99308103,0.0010702182,0.00013212049],"about_ca_topic_score_codex":0.0000043991945,"about_ca_topic_score_gemma":5.2033766e-7,"teacher_disagreement_score":0.024268065,"about_ca_system_score_codex":0.00006546208,"about_ca_system_score_gemma":0.00017693636,"threshold_uncertainty_score":0.56076664},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041173242,0.0005775893,0.005555612,0.00050821196,0.00044292366,0.004832124,0.0016876712,0.000043237073,0.9451794],"genre_scores_gemma":[0.68545806,0.010037268,0.1574315,0.0008484025,0.00794999,0.0018430628,0.0009310933,0.0009150245,0.13458562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860036,0.000022720604,0.0007133292,0.00023353615,0.00022223324,0.00020781599],"domain_scores_gemma":[0.9968419,0.0015503442,0.00086327555,0.000587464,0.000102523794,0.00005448217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052359235,0.0003134972,0.00091121666,0.0001086305,0.00013106635,0.000014833578,0.00030470197,0.00021743712,0.0001417714],"category_scores_gemma":[0.00007951138,0.00020861605,0.00016571012,0.00018415485,0.00086893723,0.000018499584,0.000115560186,0.00016326465,0.000008924736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010290014,0.0001302789,3.0016898e-7,0.0018642213,0.00019466861,2.9982164e-8,0.0010663064,0.000008053735,0.00046708644,0.8099194,0.18573123,0.00051552727],"study_design_scores_gemma":[0.00075259357,0.00043326596,0.0000036416513,0.0006865931,0.0007445053,0.0000027515862,0.0017704568,0.00011234386,0.010440731,0.9101386,0.0745358,0.00037870268],"about_ca_topic_score_codex":0.0000011189588,"about_ca_topic_score_gemma":0.000004466139,"teacher_disagreement_score":0.8105938,"about_ca_system_score_codex":0.0000041494814,"about_ca_system_score_gemma":0.00001796797,"threshold_uncertainty_score":0.8507116},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9825794,0.000015423066,0.00072884077,0.006387649,0.000051693445,0.00026565287,0.0000052984687,0.00006571501,0.009900306],"genre_scores_gemma":[0.995613,0.000017504744,0.0033522234,0.00061854883,0.0001054279,0.000027418528,0.0000014547903,0.000012430118,0.00025202887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993156,0.00012194238,0.00013612221,0.00016604841,0.000097973374,0.00016228625],"domain_scores_gemma":[0.99848634,0.00092625764,0.00003865817,0.0004268965,0.00006590556,0.000055960303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007136303,0.00009861865,0.00014651637,0.000025803789,0.00030255163,0.000044317803,0.00019278686,0.000047614303,0.00014472236],"category_scores_gemma":[0.00040990827,0.000059855756,0.000051908177,0.00011383727,0.0011079289,0.000055349166,0.00009085,0.00012693944,0.000049960716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038661994,0.000030287532,0.00018763207,0.0000060994007,0.000025385421,4.4720116e-7,0.0010186506,1.0544885e-9,0.0011183512,0.9959645,0.00075783394,0.000852105],"study_design_scores_gemma":[0.00042532105,0.000020941327,0.0034073705,0.000009065569,0.00006751343,0.000023917284,0.00019372214,0.000059689177,0.0029847887,0.98674864,0.0059660007,0.00009301118],"about_ca_topic_score_codex":0.000008219861,"about_ca_topic_score_gemma":0.000010507926,"teacher_disagreement_score":0.013033542,"about_ca_system_score_codex":0.0000058887235,"about_ca_system_score_gemma":0.000009335212,"threshold_uncertainty_score":0.408221},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9896207,0.00050394767,0.0037424602,0.00029496365,0.002933196,0.00034903095,0.000024288896,0.000027666307,0.0025037534],"genre_scores_gemma":[0.99449307,0.0002591324,0.0050046234,0.0000132257355,0.0000814044,0.000004615962,0.000003549819,0.000032356464,0.00010804044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788404,0.00011962322,0.0011356493,0.00017791064,0.00050006656,0.00018271881],"domain_scores_gemma":[0.99561864,0.00050888653,0.002541942,0.0005660474,0.000662532,0.000101936916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008487329,0.00024586584,0.0008025367,0.00038278385,0.000052792348,0.000029862314,0.000586223,0.00031730084,0.00006901376],"category_scores_gemma":[0.00027844295,0.0002258626,0.00058591465,0.00034439826,0.00015555255,0.00008284199,0.00018997869,0.0011158156,0.000005001847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031494175,0.00032202306,0.00091440347,0.00038490453,0.00024479564,0.0000048494885,0.00021545835,0.00001853237,0.0001943248,0.9959182,0.0015047934,0.0002462188],"study_design_scores_gemma":[0.0006055163,0.00017387119,0.0004752343,0.00027945006,0.00028753918,0.0001295749,0.00014517002,0.000022426477,0.0021833384,0.9950438,0.00046560334,0.00018844064],"about_ca_topic_score_codex":0.0000027637184,"about_ca_topic_score_gemma":5.730345e-7,"teacher_disagreement_score":0.0048723584,"about_ca_system_score_codex":0.00008932021,"about_ca_system_score_gemma":0.0002796308,"threshold_uncertainty_score":0.921041},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98197335,0.0016873385,0.0143501,0.0012633344,0.00015309338,0.00014434027,0.00001606924,0.00004464408,0.00036773752],"genre_scores_gemma":[0.99760985,0.00025004984,0.00077395054,0.00015720369,0.0007171481,0.000004074475,0.0000023507819,0.000031412645,0.00045393116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860674,0.00007701485,0.00047609003,0.00014206392,0.00019444354,0.0005036425],"domain_scores_gemma":[0.9988845,0.00020074865,0.00041400315,0.00029814363,0.0001019576,0.0001006386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006833194,0.0001664196,0.00027876298,0.00009802693,0.00017820233,0.000024356863,0.00041600526,0.000064774715,0.00010422668],"category_scores_gemma":[0.00009088177,0.00012702716,0.00020062024,0.000265041,0.0001579091,0.00018759363,0.00002463257,0.0004332058,0.000025440959],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062823965,0.00013812412,0.00006123928,0.000008727087,0.000099129415,0.0000021516232,0.000224463,1.6016409e-7,0.006172225,0.9891168,0.0036223826,0.0004917927],"study_design_scores_gemma":[0.00042349272,0.00045856516,0.000027786447,0.000025669078,0.000039012197,0.00010154556,0.00005360722,0.00004360674,0.049214464,0.9344197,0.015059387,0.00013317542],"about_ca_topic_score_codex":9.926745e-7,"about_ca_topic_score_gemma":0.000014383487,"teacher_disagreement_score":0.054697093,"about_ca_system_score_codex":0.0000629049,"about_ca_system_score_gemma":0.00012859337,"threshold_uncertainty_score":0.5180017},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98641914,0.00015485678,0.0010976798,0.0010859381,0.0037581015,0.0003721561,0.0000129454265,0.000040617815,0.007058549],"genre_scores_gemma":[0.99828076,0.000035404868,0.00021884286,0.00015112334,0.0010168529,0.00001529406,7.784377e-7,0.000029652214,0.00025130983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976417,0.00084549363,0.00068079075,0.00017495528,0.0003364553,0.00032062264],"domain_scores_gemma":[0.9961741,0.002196907,0.00065483694,0.00049442844,0.00037672455,0.00010299706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037524616,0.00023205334,0.0004971792,0.00016823718,0.00035470512,0.000096047996,0.0006469588,0.00016749618,0.00024938973],"category_scores_gemma":[0.0012866975,0.00015522771,0.00024337454,0.0006015313,0.0006857461,0.0004449246,0.00008360742,0.000646297,0.000013869753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072083867,0.00026855053,0.00040741172,0.000020857062,0.00009204515,0.000012976587,0.0012997484,0.000002533686,0.00057615765,0.99329966,0.0030273944,0.00027184162],"study_design_scores_gemma":[0.001294757,0.00049231586,0.00096170086,0.00007103186,0.00007106481,0.00015821103,0.0008539195,0.0000017502166,0.0063660303,0.9733906,0.01616321,0.0001754288],"about_ca_topic_score_codex":0.000008210832,"about_ca_topic_score_gemma":0.000037232945,"teacher_disagreement_score":0.019909065,"about_ca_system_score_codex":0.00005985247,"about_ca_system_score_gemma":0.00015158136,"threshold_uncertainty_score":0.63300025},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3628275,0.0008118262,0.013945818,0.0021650537,0.0006566674,0.002269269,0.0013815451,0.00013083313,0.61581147],"genre_scores_gemma":[0.99718183,0.000111198235,0.0010767557,0.0000092892105,0.00026442314,0.00017264692,0.00018551364,0.00002601834,0.000972334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767196,0.0005591883,0.00064165023,0.00038818407,0.0005219189,0.00021712066],"domain_scores_gemma":[0.9954986,0.0025249121,0.0004087035,0.00060343015,0.0008843245,0.00008002567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004484081,0.00014693261,0.0003309778,0.00071370736,0.000095419775,0.000026833191,0.0006749951,0.000277566,0.00056301954],"category_scores_gemma":[0.00055000983,0.00013025798,0.00015435975,0.00013443822,0.00031703038,0.0001163604,0.00022791306,0.00031295783,0.000029435501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006146237,0.00021586183,0.000056148176,0.00010085235,0.000089654626,1.5140327e-7,0.00008346843,0.00009864965,0.0020745636,0.9935235,0.0019494874,0.0017462424],"study_design_scores_gemma":[0.00023368157,0.000042187745,0.0000745011,0.00007699818,0.000012578841,0.0000010278532,0.000038379898,0.000392779,0.009152908,0.9895994,0.00026439998,0.00011114941],"about_ca_topic_score_codex":0.00002859512,"about_ca_topic_score_gemma":0.000013144981,"teacher_disagreement_score":0.6343543,"about_ca_system_score_codex":0.00023992645,"about_ca_system_score_gemma":0.0005998844,"threshold_uncertainty_score":0.6164669},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98559725,0.000039569222,0.0018477989,0.00008442575,0.00006342846,0.00013373709,0.0000067637684,0.000051041286,0.012175981],"genre_scores_gemma":[0.9961571,0.0000015030608,0.0036138948,0.00006406639,0.000023356946,0.000018218985,0.0000015660837,0.000015240838,0.000105064864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994527,0.00004036845,0.00014926337,0.00013695237,0.00010568591,0.00011501546],"domain_scores_gemma":[0.99945074,0.00006964295,0.00007190283,0.00030924656,0.000062951985,0.000035508074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000100394165,0.00008933919,0.00011025721,0.00007405398,0.00004124716,0.0000061389155,0.00014017404,0.00004764281,0.000033387656],"category_scores_gemma":[0.00009454023,0.00007733494,0.000059848797,0.00017576931,0.00027218685,0.000011603477,0.000023489742,0.000029278097,0.000019981608],"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.0000093369135,0.000062561754,0.000022146838,0.0000108208815,0.0000132816685,0.0000010807764,0.00008504463,4.695322e-8,0.33387795,0.6654632,0.00019471043,0.0002598217],"study_design_scores_gemma":[0.000084199586,0.000082190236,0.000036198453,0.000020279667,0.000013560537,0.000001322208,0.000040005434,0.000011314668,0.5734065,0.4259369,0.00030702804,0.00006044995],"about_ca_topic_score_codex":0.000014556544,"about_ca_topic_score_gemma":0.000004873695,"teacher_disagreement_score":0.2395286,"about_ca_system_score_codex":0.0000063756106,"about_ca_system_score_gemma":0.000010973699,"threshold_uncertainty_score":0.31536272},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041245954,0.000149768,0.0066611674,0.00014187268,0.0033122618,0.0012441436,0.00014236072,0.0001376234,0.98779833],"genre_scores_gemma":[0.16968921,0.00011647807,0.012492395,0.00010289476,0.0018703386,0.000121288,0.0004070723,0.0003819341,0.8148184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989494,0.000033073655,0.0004463395,0.00021014131,0.00023683245,0.0001241884],"domain_scores_gemma":[0.99830145,0.00029258433,0.00056912104,0.0006014281,0.00020459095,0.000030825566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016799374,0.00022375117,0.00032302702,0.00007229764,0.00017565596,0.000024694147,0.00032626136,0.0003181373,0.00023665925],"category_scores_gemma":[0.00013293473,0.00018438902,0.0002086773,0.00007141062,0.00013655968,0.000053223772,0.000092723785,0.00019439761,0.000009044529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015335705,0.00005867251,0.0000028584318,0.000044085242,0.000029129436,6.943113e-7,0.000016156862,0.0042952765,0.000016605265,0.97803605,0.017460607,0.000024514406],"study_design_scores_gemma":[0.0004235979,0.000037454494,0.0000017727019,0.00011536434,0.00018659611,0.000003951718,0.000002776323,0.0004012346,0.00049119064,0.97648287,0.02164656,0.00020662202],"about_ca_topic_score_codex":0.000013081191,"about_ca_topic_score_gemma":0.0000032442185,"teacher_disagreement_score":0.17297995,"about_ca_system_score_codex":0.000051081755,"about_ca_system_score_gemma":0.000104823725,"threshold_uncertainty_score":0.7519166},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97029734,0.0013003309,0.025925852,0.0006135521,0.00022552426,0.00038533856,0.000029947614,0.000039862633,0.0011822649],"genre_scores_gemma":[0.99506664,0.00037978828,0.0032796925,0.00012997496,0.0004695084,0.000015513619,0.00001643947,0.0000722412,0.00057017733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977012,0.00013924531,0.00070186023,0.00029147588,0.0006273708,0.00053881324],"domain_scores_gemma":[0.99705756,0.0007896185,0.0012454162,0.00051382964,0.0002774354,0.00011612543],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0010887813,0.0003555505,0.0006384969,0.0002818982,0.00010067553,0.000052432442,0.00068387145,0.00024215684,0.00020157655],"category_scores_gemma":[0.00011120829,0.0002563648,0.00038041355,0.00020235612,0.00007095784,0.00007930655,0.00012351385,0.0025968903,0.00007400139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033799617,0.0003194836,0.00013250936,0.00012562319,0.00053722295,0.0000153909,0.00011757023,0.00087086955,0.00005384255,0.99535257,0.0017163529,0.00042055122],"study_design_scores_gemma":[0.000659968,0.0007562721,0.00008545059,0.00034096095,0.00028294005,0.00022279772,0.000027203849,0.000111619316,0.0005439297,0.9947692,0.0019114962,0.00028811922],"about_ca_topic_score_codex":0.000001218423,"about_ca_topic_score_gemma":0.0000058492014,"teacher_disagreement_score":0.024769338,"about_ca_system_score_codex":0.00014837741,"about_ca_system_score_gemma":0.0011307638,"threshold_uncertainty_score":0.99998885},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9488395,0.00017967586,0.0011765586,0.009303169,0.002194133,0.00041139123,0.000030600917,0.000025396526,0.03783961],"genre_scores_gemma":[0.9991858,0.000026915524,0.00012469462,0.00018277449,0.00021166174,0.0000014843107,5.705381e-7,0.000047397993,0.00021871706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973998,0.0011282715,0.0007482939,0.00013382506,0.00046116236,0.00012866857],"domain_scores_gemma":[0.9963155,0.00091199693,0.0016653716,0.0007869969,0.00023851174,0.0000816392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017578447,0.00020574701,0.00036078994,0.0000614464,0.00014117034,0.00004384523,0.0018152492,0.0000512664,0.000031263982],"category_scores_gemma":[0.0011146192,0.00011167524,0.00048716506,0.00023414004,0.00012928611,0.000021697655,0.0005827634,0.0014757455,0.000017594815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040618874,0.00018628428,0.00006299068,0.000058012793,0.00010418594,0.000015040729,0.00035817054,0.000036117654,0.00024029992,0.9590471,0.0397066,0.00014461999],"study_design_scores_gemma":[0.0003674714,0.00014062795,0.0020286888,0.00026918406,0.00014723379,0.00001819358,0.00007614039,0.00001397455,0.0011563007,0.9894314,0.006230711,0.00012011545],"about_ca_topic_score_codex":3.477689e-7,"about_ca_topic_score_gemma":1.9271513e-7,"teacher_disagreement_score":0.05034632,"about_ca_system_score_codex":0.000034944278,"about_ca_system_score_gemma":0.00011213568,"threshold_uncertainty_score":0.6411462},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4354048,0.00003856717,0.5414705,0.0011210571,0.000446754,0.010724584,0.0046400786,0.000066616776,0.006087045],"genre_scores_gemma":[0.9939652,0.0000146113925,0.0021654337,0.00009627087,0.000023887562,0.0013550106,0.0022733295,0.000022007842,0.00008422577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969008,0.00022766365,0.0019898615,0.00023860406,0.00042585185,0.00021722578],"domain_scores_gemma":[0.9957577,0.0007816542,0.0018923087,0.0010279418,0.00049434596,0.000046049958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021069276,0.00029347008,0.0011350781,0.0005434542,0.000087603585,0.00026538892,0.0016791527,0.00034753184,0.000018120854],"category_scores_gemma":[0.00054843817,0.00023279406,0.00037316026,0.0016530561,0.00007773902,0.0004458615,0.00059593795,0.00036750824,0.000009218373],"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.000076982156,0.00010907078,0.00016584914,0.0014954801,0.000674503,2.1726156e-7,0.005879613,0.017791443,0.0000091242,0.97336847,0.00022767937,0.00020157611],"study_design_scores_gemma":[0.00040734495,0.000053096406,0.00015923668,0.00026603354,0.000748289,0.0000032116598,0.0065659154,0.88111544,0.000008734015,0.1099021,0.00052215846,0.00024844887],"about_ca_topic_score_codex":0.0006627521,"about_ca_topic_score_gemma":0.00015387406,"teacher_disagreement_score":0.8634664,"about_ca_system_score_codex":0.000109960085,"about_ca_system_score_gemma":0.00019535565,"threshold_uncertainty_score":0.94930667},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13146731,0.00072440493,0.8559243,0.00033873605,0.00028353534,0.0012084785,0.000069065376,0.00017454459,0.009809613],"genre_scores_gemma":[0.99787503,0.00011624991,0.00018580057,0.00009979354,0.00007391772,0.0001568585,0.000002607214,0.000037342987,0.0014523873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982127,0.0001995824,0.00031883948,0.0005996075,0.0003236878,0.00034557274],"domain_scores_gemma":[0.9985742,0.00027563336,0.00016840256,0.0005688731,0.00018062968,0.00023224684],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010423809,0.00024830102,0.00027914386,0.00016633325,0.0016017363,0.000231377,0.00017862245,0.00010581863,0.000010878201],"category_scores_gemma":[0.000022811857,0.00020211175,0.000031490134,0.0007324907,0.0017418513,0.00023241808,0.000003244265,0.00014121505,0.000001617485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003461462,0.000048720918,0.00006834744,0.00009133263,0.000052282274,0.0000010919771,0.0011327767,0.00009988131,0.0058432613,0.9884408,0.00005458973,0.00413231],"study_design_scores_gemma":[0.0029837885,0.0005944182,0.002399201,0.0015934441,0.0006603438,0.00033360533,0.0052672485,0.0035770296,0.0040011895,0.95636266,0.020399446,0.0018276193],"about_ca_topic_score_codex":0.000006890679,"about_ca_topic_score_gemma":0.00011081302,"teacher_disagreement_score":0.86640775,"about_ca_system_score_codex":0.000042481577,"about_ca_system_score_gemma":0.00007418196,"threshold_uncertainty_score":0.99969804},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9889812,0.00003604606,0.0071236263,0.000009615213,0.00006498856,0.0002421928,0.00006584164,0.000042593336,0.0034339027],"genre_scores_gemma":[0.99854827,0.00010130654,0.0008256325,0.0000038056476,0.000009100086,9.990637e-7,0.000004926195,0.000013934459,0.00049204775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990936,0.00007169633,0.00021734498,0.00041044984,0.00007052117,0.00013642402],"domain_scores_gemma":[0.9984867,0.0001453252,0.00038950285,0.0007305068,0.00017950327,0.00006846795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002461173,0.00017689825,0.0003436497,0.00020829348,0.000057955793,0.0000065468566,0.00045167614,0.00024745602,0.00005468684],"category_scores_gemma":[0.000053268075,0.00019373336,0.0001424116,0.00028172892,0.00043756474,0.00006357909,0.00049175735,0.00023591875,0.000004441683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045461737,0.00014698507,0.0042609065,0.00027450567,0.000104870545,0.0000066084317,0.00017193495,0.0003598674,0.0005530627,0.9938301,0.00013569975,0.0001100386],"study_design_scores_gemma":[0.00024060303,0.000043278607,0.0043861186,0.00012728677,0.00016263728,0.0000017711293,0.00014887073,0.001519512,0.0021953331,0.99099314,0.000018322655,0.00016313004],"about_ca_topic_score_codex":0.000059111135,"about_ca_topic_score_gemma":0.00007606708,"teacher_disagreement_score":0.009567054,"about_ca_system_score_codex":0.000014661206,"about_ca_system_score_gemma":0.000045070035,"threshold_uncertainty_score":0.7900217},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09504853,0.00021093956,0.85554653,0.00063650287,0.00065248186,0.0066984203,0.0011672776,0.0004523009,0.039586987],"genre_scores_gemma":[0.5981583,0.000040519033,0.38585636,0.00011628353,0.00026418795,0.0023928036,0.00028453703,0.00026744275,0.01261954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977669,0.00006474042,0.0007432309,0.0006053596,0.0004214728,0.0003982549],"domain_scores_gemma":[0.99543506,0.001862391,0.00077599974,0.001584411,0.00024122866,0.00010088091],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009514753,0.00048325336,0.00077418704,0.0001305931,0.0001934266,0.00015281113,0.000803014,0.00059834233,0.00009521567],"category_scores_gemma":[0.00089619996,0.00042992146,0.0004969371,0.00013517047,0.00014764626,0.00011146591,0.00059594546,0.0008153426,0.00013832746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011857317,0.00014419042,0.000013381212,0.0023032897,0.00019073955,9.0337875e-7,0.0029306458,0.00003881049,0.00006316578,0.992052,0.002182096,0.00006889433],"study_design_scores_gemma":[0.0003058659,0.00003873106,0.000007613511,0.0006081515,0.00034155374,0.000006180232,0.0006155877,0.004958561,0.000443603,0.99082255,0.0013496397,0.0005019658],"about_ca_topic_score_codex":0.0000030557835,"about_ca_topic_score_gemma":0.000005894327,"teacher_disagreement_score":0.5031098,"about_ca_system_score_codex":0.000073986914,"about_ca_system_score_gemma":0.00015733283,"threshold_uncertainty_score":0.9998153},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9993692,0.000040883187,0.000110385845,0.000033667347,0.00011260845,0.00015302608,0.000028646104,0.0000017570818,0.00014984902],"genre_scores_gemma":[0.99971217,0.0000014874317,0.00014284399,0.000011838749,0.000070992835,0.0000013353928,6.9971304e-7,0.000010145486,0.000048492704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992628,0.000060493152,0.00035189936,0.000058872505,0.00015396345,0.00011194372],"domain_scores_gemma":[0.998867,0.000102936334,0.00039586698,0.00024284805,0.00025477225,0.00013660094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029654228,0.000074828786,0.0002983955,0.00008145365,0.00003906253,0.000007983276,0.00022547707,0.000029754387,0.000034844605],"category_scores_gemma":[0.00007464946,0.00006731003,0.000096937525,0.00013694656,0.000060440783,0.000101493824,0.0000069950142,0.00012241417,0.0000035905214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025307583,0.000632079,0.025445977,0.00019046197,0.00028095927,0.000008343304,0.0056103873,0.00003172746,0.024021441,0.9409585,0.00034780797,0.0024470019],"study_design_scores_gemma":[0.0007322555,0.00043646374,0.03019263,0.00014183704,0.00019491704,0.000011560531,0.0019215547,0.00001380297,0.01531162,0.95056134,0.00033503206,0.00014696876],"about_ca_topic_score_codex":0.0003030732,"about_ca_topic_score_gemma":0.0007233914,"teacher_disagreement_score":0.009602851,"about_ca_system_score_codex":0.000022747856,"about_ca_system_score_gemma":0.00027353782,"threshold_uncertainty_score":0.27448234},"labels":[],"label_agreement":null},{"id":"W2918186528","doi":"","title":"Further results on Wiener, Harary indices and graph properties.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Graph; Combinatorics","score_opus":0.03681575060499444,"score_gpt":0.27271480358290334,"score_spread":0.23589905297790892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918186528","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9844597,0.00007659807,0.000002428186,0.0005244345,0.0003037595,0.00022319559,0.000009126656,0.00010646426,0.014294292],"genre_scores_gemma":[0.9989371,0.00001702299,0.00021683349,0.00018129806,0.00002006494,0.000042563057,0.0000029704738,0.000019605022,0.00056257186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992181,0.000060279024,0.00018530361,0.00023795723,0.00013188757,0.0001664764],"domain_scores_gemma":[0.9992683,0.00013068314,0.0000907484,0.00038923946,0.00005326096,0.00006775108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029358262,0.00012284405,0.00012844347,0.000074237556,0.00020010324,0.000035337023,0.0001651643,0.00007079099,0.000021442907],"category_scores_gemma":[0.000109831126,0.00009607633,0.000032948494,0.00020131555,0.00023900117,0.000096362455,0.000048591322,0.000109233224,0.000079931044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007913431,0.00016424121,0.00018847984,0.000014631216,0.00002271608,0.0000010857273,0.0013123307,3.6400213e-8,0.0007638596,0.99243176,0.0043806597,0.00064108276],"study_design_scores_gemma":[0.00069178065,0.00019140012,0.0008005135,0.000051488256,0.000016637416,0.0000025663564,0.00012019165,0.000008037151,0.008686461,0.98520166,0.0040974016,0.00013185422],"about_ca_topic_score_codex":0.000007631887,"about_ca_topic_score_gemma":0.000004255735,"teacher_disagreement_score":0.014477368,"about_ca_system_score_codex":0.000007282133,"about_ca_system_score_gemma":0.000013099016,"threshold_uncertainty_score":0.3917879},"labels":[],"label_agreement":null},{"id":"W2918293970","doi":"","title":"Bicyclic graphs with the second up to eighth largest hyper-Wiener indices.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bicyclic molecule; Wiener index; Combinatorics; Statistics; Graph; Medicinal chemistry; Chemistry","score_opus":0.019580191362177524,"score_gpt":0.27085861240031606,"score_spread":0.2512784210381385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918293970","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9828154,0.000024037274,0.000022727274,0.0009769386,0.0004292141,0.00039262557,0.000013867111,0.000104103856,0.015221075],"genre_scores_gemma":[0.9948754,0.0000018663013,0.00030671887,0.0007462233,0.0000250675,0.00013932443,0.000003900741,0.000035040168,0.0038665156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989706,0.00007455173,0.00017223395,0.00027441184,0.00020792372,0.00030026265],"domain_scores_gemma":[0.9986715,0.00026995846,0.00010087227,0.00072071626,0.00011163077,0.00012532146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003655049,0.00017594369,0.00017613311,0.0001068416,0.00044163436,0.000058475238,0.0004670329,0.00007295911,0.00044039852],"category_scores_gemma":[0.000041949537,0.000109936605,0.000058037527,0.00076936814,0.00021744402,0.00009509932,0.00008124607,0.0001741457,0.0004047418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015419284,0.00009127195,0.0012895467,0.0000105905665,0.000037903526,9.2642205e-7,0.0012822343,3.7319584e-8,0.00057866407,0.9756619,0.020930931,0.00010060772],"study_design_scores_gemma":[0.0004648121,0.00015158283,0.0019189911,0.000016483504,0.000029800987,0.000007970461,0.00020651233,0.000002127235,0.0067685647,0.91658705,0.07366403,0.00018204948],"about_ca_topic_score_codex":0.000008518052,"about_ca_topic_score_gemma":0.000098361976,"teacher_disagreement_score":0.059074793,"about_ca_system_score_codex":0.000014496958,"about_ca_system_score_gemma":0.000026371508,"threshold_uncertainty_score":0.5202272},"labels":[],"label_agreement":null},{"id":"W2918475526","doi":"","title":"Spectral characterizations of graphs with at most two (signless) Laplacian eigenvalues greater than 2.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Combinatorics; Discrete mathematics; Physics","score_opus":0.021813250109894104,"score_gpt":0.2722463776423414,"score_spread":0.2504331275324473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918475526","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99293673,0.0000060415405,0.000068570356,0.00008390278,0.00018795945,0.0003044928,0.000045335906,0.00009451285,0.0062724603],"genre_scores_gemma":[0.99846685,0.0000032922333,0.00078871974,0.00003768408,0.000016337874,0.00004844396,0.000034668923,0.00003389233,0.00057011336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990478,0.00006547237,0.00024540938,0.00023113159,0.00017415335,0.00023600971],"domain_scores_gemma":[0.9990008,0.000087982255,0.00016936284,0.0005112457,0.0001489283,0.00008170818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016048444,0.00016885686,0.00022678466,0.00009747981,0.00028480048,0.000021799906,0.0002317449,0.00005589724,0.00023424586],"category_scores_gemma":[0.000023319773,0.0001398227,0.00006345166,0.00045038218,0.0003120477,0.00010837719,0.000054031316,0.00008198199,0.000060125214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044073113,0.00015623853,0.028004184,0.000018436995,0.00005981934,0.0000017667068,0.00087660557,1.4980289e-7,0.0068659713,0.963563,0.00038203178,0.000027672131],"study_design_scores_gemma":[0.0006365755,0.00017649059,0.013920551,0.00004066682,0.000067897345,0.00000932053,0.00007971428,0.000013412875,0.06484237,0.9197755,0.00026200156,0.00017550701],"about_ca_topic_score_codex":0.000011662285,"about_ca_topic_score_gemma":0.00005550782,"teacher_disagreement_score":0.057976402,"about_ca_system_score_codex":0.000022549499,"about_ca_system_score_gemma":0.000025646501,"threshold_uncertainty_score":0.5701804},"labels":[],"label_agreement":null},{"id":"W2918493888","doi":"","title":"The linear programming approach to the harmonic index of a graph with minimum degree at least three.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Index (typography); Graph; Combinatorics; Computer science; Programming language","score_opus":0.046279962539619524,"score_gpt":0.27706904114541014,"score_spread":0.23078907860579062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918493888","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9925285,0.00007117016,0.0017175149,0.0005809117,0.00017800416,0.0010973929,0.0000046730947,0.000071432136,0.0037503974],"genre_scores_gemma":[0.9966403,0.000002942153,0.0026767117,0.000040280887,0.000022034264,0.00030971572,0.000002142431,0.000029641657,0.0002761936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887073,0.00007421953,0.0002497783,0.00023290818,0.0002719644,0.00030041722],"domain_scores_gemma":[0.9983687,0.00034067515,0.00016412884,0.00086628296,0.00018270288,0.000077505916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063786085,0.00016118509,0.0001750533,0.000042993448,0.00067327335,0.00003643439,0.0006268328,0.000061113074,0.0000057715083],"category_scores_gemma":[0.000090825684,0.00008490789,0.00008313726,0.0006364943,0.0004466456,0.000041181538,0.00016049416,0.00016601037,0.000032184005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008895383,0.00022869749,0.0017472865,0.000020792239,0.00007730789,2.539419e-7,0.0009582838,0.0000011213158,0.00009745032,0.99343485,0.0013190635,0.0020259647],"study_design_scores_gemma":[0.0005618765,0.00026333545,0.0018080246,0.000034974077,0.00007012479,0.000010785994,0.00057077484,0.0002512266,0.0015665542,0.98622376,0.008474181,0.00016436765],"about_ca_topic_score_codex":0.000013646738,"about_ca_topic_score_gemma":0.00013888346,"teacher_disagreement_score":0.007211051,"about_ca_system_score_codex":0.000020679465,"about_ca_system_score_gemma":0.00003473979,"threshold_uncertainty_score":0.5178342},"labels":[],"label_agreement":null},{"id":"W2918733661","doi":"","title":"On the connective eccentricity index of graphs with fixed clique number.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Clique; Eccentricity (behavior); Combinatorics; Index (typography); Computer science; Political science","score_opus":0.019004138609064206,"score_gpt":0.2799922236122643,"score_spread":0.2609880850032001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918733661","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98421115,0.000002247518,0.00017872106,0.00020559838,0.00013507628,0.00036838764,0.0000082571,0.000046940826,0.014843603],"genre_scores_gemma":[0.9995988,0.0000018812058,0.00011501703,0.00012994891,0.000004816568,0.000053200707,0.0000012592363,0.000015255105,0.00007980619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992181,0.000132666,0.00016950614,0.00016246332,0.00016370109,0.00015355794],"domain_scores_gemma":[0.9978385,0.0012919446,0.00016207802,0.00046623734,0.00019967456,0.000041567433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029772037,0.000116279116,0.00016483742,0.000034170633,0.00018343041,0.000011373156,0.00024482296,0.00006299286,0.00015543964],"category_scores_gemma":[0.00025605876,0.00007346123,0.00005711967,0.0004287061,0.00030369236,0.00003842356,0.00003465846,0.00015436453,0.00004322982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008181848,0.00026561847,0.0055984613,0.000008628698,0.00005480507,5.753756e-7,0.00039962897,3.6784266e-7,0.00006829551,0.9911254,0.0023666925,0.000029692832],"study_design_scores_gemma":[0.0005052635,0.00017960815,0.0022528667,0.000032713226,0.000025148014,0.0000025466697,0.00018499665,0.000023484105,0.012966982,0.9835988,0.00013348357,0.00009410759],"about_ca_topic_score_codex":0.000018271754,"about_ca_topic_score_gemma":0.000013183603,"teacher_disagreement_score":0.015387647,"about_ca_system_score_codex":0.000016620968,"about_ca_system_score_gemma":0.000027515267,"threshold_uncertainty_score":0.2995662},"labels":[],"label_agreement":null},{"id":"W2918815615","doi":"","title":"Minimizing Wiener index of trees containing a prescribed subtree.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Index (typography); Statistics; Combinatorics; Computer science; World Wide Web","score_opus":0.03535646671553372,"score_gpt":0.2953473363639706,"score_spread":0.2599908696484369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918815615","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98998475,0.000027182647,0.00015048275,0.000070701746,0.0002690586,0.00018798324,0.000004713567,0.00007872142,0.009226427],"genre_scores_gemma":[0.9985107,0.0000017531542,0.0011295236,0.000034608005,0.000015334672,0.000037763883,0.0000024199055,0.000021281901,0.00024661233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991092,0.00006793776,0.00028980803,0.00018109646,0.00015352845,0.00019842508],"domain_scores_gemma":[0.998836,0.00036876553,0.00016787332,0.00042095903,0.00014710709,0.000059296737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032594608,0.00011945904,0.00022365137,0.00007729567,0.00012209758,0.000015384443,0.00024212271,0.00007568051,0.00007455435],"category_scores_gemma":[0.00022772093,0.000112854206,0.000074516145,0.00025568108,0.00019329767,0.00009359528,0.00006702054,0.00009218352,0.000016235894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044218763,0.00014676497,0.00539774,0.00001596794,0.00003854924,8.3439045e-7,0.0011431355,2.3440309e-7,0.0035774254,0.9882687,0.0010437357,0.00032272827],"study_design_scores_gemma":[0.00072590355,0.00014279743,0.0028506357,0.000051472187,0.00003452949,0.0000020609846,0.0003959496,0.0001243063,0.015843986,0.97886336,0.00084111415,0.00012388911],"about_ca_topic_score_codex":0.000019610761,"about_ca_topic_score_gemma":0.00003437759,"teacher_disagreement_score":0.0122665595,"about_ca_system_score_codex":0.000013693105,"about_ca_system_score_gemma":0.000026820002,"threshold_uncertainty_score":0.4602061},"labels":[],"label_agreement":null},{"id":"W2918832912","doi":"","title":"A class of cospectral graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Class (philosophy); Combinatorics; Statistics; Computer science; Artificial intelligence","score_opus":0.022938388817884042,"score_gpt":0.29012750521640757,"score_spread":0.2671891163985235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918832912","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97530174,0.000013825746,0.000044207805,0.00009564253,0.0003104557,0.00013486567,0.000004874859,0.00006727002,0.02402713],"genre_scores_gemma":[0.99884546,0.000002742446,0.0009038186,0.00003277666,0.0000065986806,0.00001750178,0.0000014374343,0.000012242543,0.00017745224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941826,0.000033211116,0.0001800155,0.00011993322,0.00010796076,0.00014061981],"domain_scores_gemma":[0.9992748,0.0001433596,0.000089020905,0.000352669,0.00009477182,0.0000453658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001951275,0.00007730119,0.0001397435,0.000049797116,0.00008115595,0.000006809041,0.00018754466,0.00004974436,0.00011522607],"category_scores_gemma":[0.00006866589,0.000072695875,0.00007185222,0.00027797354,0.0002045548,0.00004003822,0.000029684816,0.000071429895,0.000053258034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000090604735,0.00015308688,0.00067208294,0.000012035334,0.000021684644,3.9656572e-7,0.00021164631,1.1310158e-8,0.0021011017,0.9921564,0.0045703272,0.00009220777],"study_design_scores_gemma":[0.0003160788,0.00009929887,0.0007125349,0.000012016049,0.00002092904,0.0000021400256,0.00004100405,0.000010084888,0.02303863,0.9742972,0.0013741531,0.0000759052],"about_ca_topic_score_codex":0.000004311978,"about_ca_topic_score_gemma":0.0000038813864,"teacher_disagreement_score":0.023849677,"about_ca_system_score_codex":0.000008567829,"about_ca_system_score_gemma":0.000014837432,"threshold_uncertainty_score":0.2964452},"labels":[],"label_agreement":null},{"id":"W2919067400","doi":"","title":"A degree sequence variant of balanced bipartition problem of graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Sequence (biology); Combinatorics; Genetics; Biology; Physics","score_opus":0.05611509745440838,"score_gpt":0.30466061464293376,"score_spread":0.24854551718852538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919067400","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9930392,0.000012982857,0.00030240673,0.00006315671,0.00012496022,0.0002617238,0.000017927727,0.000044583514,0.0061330455],"genre_scores_gemma":[0.9928736,0.0000057804905,0.0070057986,0.000012355298,0.000003556957,0.000042374846,0.0000038740272,0.0000104872925,0.000042153293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992403,0.000054758184,0.00030104205,0.00013752189,0.0001364681,0.00012990656],"domain_scores_gemma":[0.9990222,0.0001409489,0.00022946003,0.00036186608,0.00020745407,0.000038070713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033079862,0.00008433444,0.00018563819,0.00006448988,0.000059157526,0.000004452028,0.0001870896,0.000055973993,0.000056067707],"category_scores_gemma":[0.000066574525,0.00007811232,0.000062173014,0.00039226655,0.00022986885,0.0000674332,0.000032620203,0.000058113863,0.000012611792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015384961,0.00019229761,0.00049156783,0.000068067144,0.000023446813,5.6463165e-7,0.0003150289,1.6699256e-7,0.031561125,0.9666817,0.00041758304,0.00023306657],"study_design_scores_gemma":[0.00034115868,0.00013692371,0.00069028686,0.00006801612,0.000028629369,0.000003645209,0.00003185051,0.000033477714,0.0654763,0.9330064,0.00011091431,0.00007236791],"about_ca_topic_score_codex":0.000014890304,"about_ca_topic_score_gemma":0.000005405024,"teacher_disagreement_score":0.03391517,"about_ca_system_score_codex":0.000009292959,"about_ca_system_score_gemma":0.000028839302,"threshold_uncertainty_score":0.31853282},"labels":[],"label_agreement":null},{"id":"W2919068130","doi":"","title":"On the spectral moments of signless Laplacian matrix of trees and unicyclic graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.022112627964107155,"score_gpt":0.29377690374986204,"score_spread":0.27166427578575486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919068130","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99585766,0.00002059718,0.0000073488563,0.00014463026,0.00009620068,0.0001896615,0.000010323615,0.000016780574,0.0036567918],"genre_scores_gemma":[0.99967766,0.000008222226,0.00011809517,0.000016872544,0.0000031772222,0.00001258737,9.795156e-7,0.000010158437,0.00015224595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939793,0.000066973,0.00019218652,0.00010878841,0.00012342306,0.000110669236],"domain_scores_gemma":[0.9990148,0.0004283083,0.00013610261,0.0003443045,0.000045251487,0.000031214302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025521856,0.00008608204,0.00015774554,0.00005921325,0.00008596099,0.0000067242,0.00019480762,0.000041377705,0.000039814757],"category_scores_gemma":[0.00005667343,0.00006151425,0.000050386167,0.00022794052,0.0002784086,0.000028079872,0.000034638557,0.000068308545,0.000005912668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001610317,0.00017693666,0.0008404619,0.000015049958,0.00003492178,1.9737583e-7,0.00038795543,6.900274e-8,0.003271107,0.9946387,0.0005390734,0.00007944241],"study_design_scores_gemma":[0.0003306299,0.00015902013,0.002177579,0.000030084564,0.000026713593,7.6205185e-7,0.00015910313,0.000015870059,0.032825876,0.96415603,0.00006106818,0.00005728563],"about_ca_topic_score_codex":0.000006597266,"about_ca_topic_score_gemma":0.00000966353,"teacher_disagreement_score":0.030482674,"about_ca_system_score_codex":0.0000055574646,"about_ca_system_score_gemma":0.000008137833,"threshold_uncertainty_score":0.25084782},"labels":[],"label_agreement":null},{"id":"W2919123079","doi":"","title":"A sharper lower bound on the signless Laplacian Estrada index.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Combinatorics; Statistics; Upper and lower bounds; Mathematical analysis; Computer science","score_opus":0.031400793766020146,"score_gpt":0.28679259908889543,"score_spread":0.2553918053228753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919123079","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96800673,0.0000065705576,0.000026888698,0.0010162056,0.0006583255,0.00028502743,0.000006636885,0.00008968516,0.029903928],"genre_scores_gemma":[0.99841523,0.0000012361689,0.00005975937,0.0005123121,0.000035348286,0.00005847037,0.0000019142174,0.000025831223,0.00088988827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911475,0.00007834221,0.00017219975,0.00020967014,0.00019649098,0.00022853969],"domain_scores_gemma":[0.9986346,0.0005041417,0.0000769614,0.0006440487,0.0000751042,0.00006517946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036178075,0.00014474135,0.00013175402,0.00003705949,0.00038984336,0.00006931583,0.00038145616,0.000083962994,0.00044984976],"category_scores_gemma":[0.00012758694,0.000101836595,0.00007154006,0.00025213955,0.00022842332,0.000060457456,0.00004928376,0.00020329647,0.0004578961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020884567,0.00022626111,0.00018509624,0.0000052177666,0.000024725265,0.0000020604032,0.0004206378,8.084672e-8,0.00021253446,0.9847692,0.014022003,0.000111246736],"study_design_scores_gemma":[0.0002762063,0.00010791777,0.000456243,0.000025087204,0.000016680018,0.0000026133152,0.00015211108,0.0000270514,0.0020273454,0.9868366,0.009938322,0.00013383795],"about_ca_topic_score_codex":0.0000073393862,"about_ca_topic_score_gemma":0.000012044394,"teacher_disagreement_score":0.03040851,"about_ca_system_score_codex":0.00002381294,"about_ca_system_score_gemma":0.000029540808,"threshold_uncertainty_score":0.58854806},"labels":[],"label_agreement":null},{"id":"W2919251934","doi":"","title":"On unicyclic graphs with maximum Harary spectral radius.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; Combinatorics; Eigenvalues and eigenvectors; Physics; Quantum mechanics","score_opus":0.018633089515201602,"score_gpt":0.2671748255604362,"score_spread":0.2485417360452346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919251934","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96491784,0.0000139905715,0.00005728863,0.00025778508,0.0003386218,0.0002593239,0.0000056121476,0.00018661856,0.033962898],"genre_scores_gemma":[0.99795157,0.0000044947055,0.0012188419,0.00019550964,0.000016187847,0.000041194562,0.0000054475827,0.00003511906,0.00053163595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990538,0.000060008642,0.00016953336,0.00026447896,0.00017990974,0.0002723035],"domain_scores_gemma":[0.99889547,0.00023443572,0.000085223364,0.0006300435,0.000052554464,0.000102292244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001817451,0.00017211601,0.000179289,0.00009518799,0.00023218957,0.000030880037,0.00028871367,0.00006954699,0.00017585576],"category_scores_gemma":[0.000036084126,0.0001408458,0.000068327594,0.00040652373,0.0002376992,0.00008370807,0.000030112551,0.00018201901,0.00026703958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042844407,0.00026597263,0.00030821917,0.000007711227,0.000040233524,0.000005860942,0.00016408054,8.8734545e-8,0.00019761213,0.9919421,0.006690582,0.00033466303],"study_design_scores_gemma":[0.00076649175,0.0003915603,0.0010215988,0.00003233362,0.000032286916,0.0000118384,0.00003726728,0.000013720045,0.0049017146,0.99108297,0.0015182303,0.00019001774],"about_ca_topic_score_codex":0.000004769848,"about_ca_topic_score_gemma":0.000005671808,"teacher_disagreement_score":0.03343126,"about_ca_system_score_codex":0.000022074159,"about_ca_system_score_gemma":0.000024802479,"threshold_uncertainty_score":0.5743525},"labels":[],"label_agreement":null},{"id":"W2919296063","doi":"","title":"On the maximum signless Laplacian spectral radius of bipartite graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Spectral radius; Combinatorics; Graph; Physics; Eigenvalues and eigenvectors; Quantum mechanics","score_opus":0.026933673101849864,"score_gpt":0.2766647719501171,"score_spread":0.24973109884826727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919296063","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9816878,0.000012208673,0.000030856696,0.00048199733,0.00039901098,0.00025711226,0.000009011132,0.00006028992,0.017061748],"genre_scores_gemma":[0.99946296,0.000003308498,0.00016900706,0.000116108895,0.000012377021,0.00003459595,0.0000017224509,0.000018668496,0.00018125256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991422,0.000096713935,0.0002183215,0.00016412958,0.00017133987,0.00020728953],"domain_scores_gemma":[0.99863833,0.0005346344,0.00012463606,0.00057960086,0.00006937715,0.000053396794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003995083,0.00012371237,0.0001657933,0.00006377315,0.00019429506,0.000017967284,0.0003384989,0.000058343398,0.00020448113],"category_scores_gemma":[0.0001183115,0.0000884409,0.00010020668,0.00037396955,0.0003031392,0.000039662387,0.000033798548,0.00013458732,0.00011765529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024175835,0.0001977792,0.00020662749,0.000010098973,0.00003220155,8.817018e-7,0.00037310258,1.4919513e-7,0.0014684616,0.992171,0.005397291,0.000118229065],"study_design_scores_gemma":[0.00028811136,0.00014984218,0.00042534203,0.000023942892,0.000025141208,0.0000018859607,0.000085434585,0.000014563502,0.033503737,0.9642164,0.001166559,0.00009904751],"about_ca_topic_score_codex":0.0000065420163,"about_ca_topic_score_gemma":0.000007782549,"teacher_disagreement_score":0.032035276,"about_ca_system_score_codex":0.000011839317,"about_ca_system_score_gemma":0.000016277998,"threshold_uncertainty_score":0.36065152},"labels":[],"label_agreement":null},{"id":"W2919430489","doi":"","title":"Extremal Properties of Some Topological Indices of Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Topology (electrical circuits); Combinatorics","score_opus":0.05432449548216772,"score_gpt":0.2916358624358771,"score_spread":0.23731136695370936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919430489","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9975299,0.0001087119,0.000004052004,0.00007021597,0.00018925602,0.00014664086,0.0000036789395,0.000035424477,0.0019121],"genre_scores_gemma":[0.999457,0.000007858911,0.00040771754,0.000017101054,0.000007100897,0.000018948193,6.4120195e-7,0.000007662992,0.00007596262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931276,0.000055245127,0.00026178133,0.00011764933,0.0001321918,0.00012037831],"domain_scores_gemma":[0.9993163,0.00010245226,0.00016632075,0.00027894558,0.000103551014,0.000032480002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024038616,0.00008190622,0.0002027053,0.000064018976,0.0000676112,0.000004480897,0.00022525218,0.00007072196,0.00007218321],"category_scores_gemma":[0.00012453704,0.00006149553,0.00007075944,0.00018305391,0.0005449465,0.0000732756,0.000058499478,0.000065801185,0.000009816831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021978776,0.00026944204,0.0015340745,0.000055015335,0.00002491876,2.575142e-7,0.0005389495,1.7390477e-8,0.020611003,0.97668016,0.00017865097,0.00008551338],"study_design_scores_gemma":[0.00020379528,0.00014288604,0.0008474955,0.000032905256,0.00001971175,0.0000011679934,0.00016215896,0.0000030223575,0.16172384,0.83672905,0.00007575027,0.000058247704],"about_ca_topic_score_codex":0.000008459196,"about_ca_topic_score_gemma":0.0000016586616,"teacher_disagreement_score":0.14111283,"about_ca_system_score_codex":0.000004188017,"about_ca_system_score_gemma":0.000015916545,"threshold_uncertainty_score":0.2507715},"labels":[],"label_agreement":null},{"id":"W2919798801","doi":"","title":"On the sum of the squares of all distances in trees with fixed diameter.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Statistics; Explained sum of squares","score_opus":0.02478737374470275,"score_gpt":0.27420308874436633,"score_spread":0.24941571499966358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919798801","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9970016,0.000014116198,0.0000091332495,0.00032722906,0.00008826971,0.0002082667,0.0000081324415,0.000008496683,0.0023347957],"genre_scores_gemma":[0.9997703,0.000002041174,0.00008371971,0.000033286327,0.0000022511608,0.000030313939,4.5483756e-7,0.0000073766537,0.000070247675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944925,0.00009350038,0.00015740225,0.00008543699,0.00012829012,0.00008612377],"domain_scores_gemma":[0.99849623,0.00087535894,0.0001340174,0.00043926545,0.00004367787,0.000011432423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021162265,0.000068157475,0.00012175811,0.00002141097,0.000051055602,0.000005257752,0.00029571133,0.000024404228,0.00002284665],"category_scores_gemma":[0.0001380083,0.00003272516,0.00004079249,0.00022269003,0.00031537577,0.000023033077,0.00002820104,0.00006643773,0.0000020074815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030206265,0.00017332689,0.004340297,0.000012952559,0.000017126438,8.700856e-8,0.0008639581,4.5020704e-7,0.0007447088,0.9931269,0.0006520192,0.000037925925],"study_design_scores_gemma":[0.00024276045,0.00012867423,0.008828814,0.00007453954,0.000014475445,1.8540742e-7,0.000295465,0.0000077288905,0.02537304,0.9648246,0.00016729337,0.000042399326],"about_ca_topic_score_codex":0.000018528697,"about_ca_topic_score_gemma":0.00022372654,"teacher_disagreement_score":0.028302317,"about_ca_system_score_codex":0.000006462579,"about_ca_system_score_gemma":0.000011266375,"threshold_uncertainty_score":0.13344932},"labels":[],"label_agreement":null},{"id":"W2920016910","doi":"","title":"Ordering c-cyclic graphs with respect to signless Laplacian spectral moments.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.023510429681374127,"score_gpt":0.2880957711141978,"score_spread":0.2645853414328237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920016910","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98345405,0.000007827706,0.00018990478,0.00032803413,0.00029336062,0.0004082268,0.000004755062,0.00019250126,0.015121367],"genre_scores_gemma":[0.99679893,0.0000017370742,0.0024117613,0.00012178531,0.000020928825,0.00008979413,0.0000025505396,0.00004085669,0.00051166036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988524,0.00005330533,0.0002066819,0.000316114,0.0002142945,0.0003572395],"domain_scores_gemma":[0.99898446,0.00013129275,0.00007593542,0.0005656231,0.00008458573,0.00015813598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025438773,0.00018477421,0.00020943553,0.00013872568,0.00028142886,0.000053039726,0.00032084325,0.000056499346,0.00010570613],"category_scores_gemma":[0.00005708024,0.00016365947,0.00005420778,0.0007102972,0.00012051632,0.00009127883,0.00006359738,0.00013803355,0.00018149713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057020578,0.00015728278,0.0011442768,0.000012402116,0.000043253644,0.000005265275,0.00073466584,5.616683e-7,0.0023989002,0.99344975,0.0018715806,0.00012501575],"study_design_scores_gemma":[0.00056267134,0.0003133536,0.0013487082,0.00004216956,0.000028480774,0.000007321932,0.00018650308,0.0000054422585,0.014501759,0.9798868,0.0028849796,0.00023181243],"about_ca_topic_score_codex":0.000012935588,"about_ca_topic_score_gemma":0.000053665244,"teacher_disagreement_score":0.014609707,"about_ca_system_score_codex":0.000039532875,"about_ca_system_score_gemma":0.00002405917,"threshold_uncertainty_score":0.6673839},"labels":[],"label_agreement":null},{"id":"W2920071073","doi":"","title":"Arc-Transitive Prime-Valent Graphs Of Order Twice A Prime Power.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transitive relation; Prime (order theory); Prime power; Arc (geometry); Combinatorics; Order (exchange); Geometry; Business","score_opus":0.018223771257146547,"score_gpt":0.2921293774823923,"score_spread":0.2739056062252458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920071073","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98359174,0.000045233955,0.00044401208,0.00015578941,0.00040225932,0.0004738889,0.000017448081,0.000104459396,0.014765158],"genre_scores_gemma":[0.9975559,0.0000068258555,0.0020580206,0.00006642799,0.000007109759,0.000045501503,0.0000044545204,0.000029564377,0.00022616253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881154,0.00010500818,0.00033591577,0.000263168,0.00023238292,0.00025199246],"domain_scores_gemma":[0.99846625,0.0002933036,0.00018208854,0.0005920398,0.00037749717,0.00008879046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003879256,0.0001736838,0.00026879454,0.00009470222,0.00014045076,0.000012602467,0.00028733528,0.000097485485,0.00015983192],"category_scores_gemma":[0.00014386544,0.00016541146,0.00011899103,0.0005490565,0.00032135498,0.00008301436,0.00005516604,0.00015008525,0.000084772415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004432679,0.00048090197,0.0003481916,0.000026477053,0.000080796366,0.0000011456366,0.001974647,3.5810203e-8,0.009169054,0.98682237,0.00093307067,0.00011898315],"study_design_scores_gemma":[0.0006366803,0.00025741715,0.0014500008,0.00005021337,0.00006545339,0.0000039988727,0.00019169266,0.000008234744,0.06954415,0.92667633,0.0009474911,0.00016831698],"about_ca_topic_score_codex":0.000012930806,"about_ca_topic_score_gemma":0.0000037438042,"teacher_disagreement_score":0.0603751,"about_ca_system_score_codex":0.000018904324,"about_ca_system_score_gemma":0.000060052484,"threshold_uncertainty_score":0.67452836},"labels":[],"label_agreement":null},{"id":"W2920097892","doi":"","title":"Wiener index and Harary index on Hamilton-connected and traceable graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Wiener index; Combinatorics; Statistics; Graph; Computer science; World Wide Web","score_opus":0.01963593642719662,"score_gpt":0.26641896721847375,"score_spread":0.2467830307912771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920097892","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9937085,0.00007248197,0.000027687836,0.00014814649,0.00023685148,0.00024883286,0.0000067854144,0.00011231686,0.005438435],"genre_scores_gemma":[0.9991681,0.000024291483,0.00017378831,0.00019311722,0.000011595167,0.000042364747,0.0000034963264,0.000025333547,0.00035788986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991172,0.000059894308,0.00018349756,0.00029382363,0.00013010077,0.00021547945],"domain_scores_gemma":[0.9990843,0.00029318844,0.00007873347,0.00036635122,0.00006655838,0.00011084603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022786132,0.00016408526,0.00019429986,0.0001143747,0.0002734492,0.000049003265,0.00012756526,0.00012217193,0.000047536458],"category_scores_gemma":[0.00007222844,0.00015055703,0.000032417254,0.0002891773,0.00027522302,0.00012988553,0.000044665612,0.00016848119,0.000018991033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040420236,0.00015364485,0.0060029323,0.000019442987,0.000030237734,0.0000018562698,0.00047939355,8.118191e-8,0.00040983883,0.9902466,0.0021905673,0.0004249632],"study_design_scores_gemma":[0.0009429376,0.00014250028,0.016446361,0.000033535183,0.000021952526,0.00000841195,0.00008099073,0.00015304245,0.0020140768,0.97811973,0.0018554163,0.00018106496],"about_ca_topic_score_codex":0.000012621809,"about_ca_topic_score_gemma":0.0000093830195,"teacher_disagreement_score":0.012126912,"about_ca_system_score_codex":0.000009208194,"about_ca_system_score_gemma":0.000013709003,"threshold_uncertainty_score":0.6139537},"labels":[],"label_agreement":null},{"id":"W2920165927","doi":"","title":"On the first reformulated Zagreb indices of graphs with a given clique number.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Clique; Combinatorics; Clique number; Discrete mathematics; Graph","score_opus":0.01730043306879466,"score_gpt":0.27359028305768107,"score_spread":0.25628984998888643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920165927","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98505515,0.0000035395622,0.0000068163504,0.000559893,0.00009660426,0.00030778698,0.0000065491868,0.00005933503,0.013904318],"genre_scores_gemma":[0.99955726,0.0000032208193,0.00016122249,0.00012239833,0.0000045024917,0.000023019316,0.0000024112985,0.000018590752,0.000107381165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927974,0.000053989865,0.00019740705,0.00015179114,0.00016452758,0.00015253405],"domain_scores_gemma":[0.9986041,0.00051836466,0.00019657437,0.0005232751,0.00012041853,0.000037264617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031267214,0.00012114605,0.00015833232,0.000041422336,0.00024044569,0.000014165429,0.0003100469,0.00007107124,0.00013371943],"category_scores_gemma":[0.00008365665,0.000070770795,0.00005490995,0.00042549404,0.00026328088,0.00005243536,0.000038078946,0.00014179481,0.00007236668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058423197,0.00018886654,0.0012731251,0.000019166751,0.000057992132,7.640331e-7,0.0011924012,1.586873e-7,0.00007307043,0.9950274,0.0020817022,0.000026886166],"study_design_scores_gemma":[0.0004000839,0.0002523131,0.0011659331,0.00008555442,0.000029871677,0.0000037778716,0.00014525237,0.0000116409565,0.006949623,0.9900455,0.00081282115,0.00009762899],"about_ca_topic_score_codex":0.000020497777,"about_ca_topic_score_gemma":0.000035125206,"teacher_disagreement_score":0.014502096,"about_ca_system_score_codex":0.000013212619,"about_ca_system_score_gemma":0.000019110139,"threshold_uncertainty_score":0.2885949},"labels":[],"label_agreement":null},{"id":"W2920214273","doi":"","title":"The diameter and Wiener index of modular product graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Modular design; Index (typography); Product (mathematics); Discrete mathematics; Graph; Computer science; Geometry; Programming language","score_opus":0.017804591139641113,"score_gpt":0.26872947389541857,"score_spread":0.25092488275577746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920214273","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9978393,0.0001020543,0.000050638406,0.00022295996,0.0002492118,0.0001925646,0.0000020747088,0.000025711484,0.0013155258],"genre_scores_gemma":[0.99934286,0.000018571289,0.00039600572,0.00002311371,0.000008052786,0.000031298685,5.115963e-7,0.000011443372,0.00016816247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994328,0.000051056362,0.00015128322,0.00013983187,0.000103128594,0.000121895486],"domain_scores_gemma":[0.9991216,0.00021430464,0.00007962516,0.0004560166,0.0000960488,0.00003241499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003695312,0.000075313554,0.000103521525,0.00003090616,0.00018618758,0.00001625885,0.00015982581,0.000029947001,0.000008663636],"category_scores_gemma":[0.0001486599,0.0000505681,0.000035624056,0.00018968298,0.00037127413,0.000048663853,0.000039667048,0.0000654339,0.000005218158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072297457,0.0000572209,0.00218464,0.00001020977,0.0000240731,1.181568e-7,0.00022237719,3.5407503e-8,0.0019050856,0.9938311,0.0009903243,0.0007676028],"study_design_scores_gemma":[0.0001871037,0.00004282165,0.0038220303,0.0000087204,0.000017195414,0.0000015161133,0.000037145364,0.000022258171,0.013856024,0.98015916,0.0017837393,0.00006226074],"about_ca_topic_score_codex":0.000004847048,"about_ca_topic_score_gemma":0.0000035882204,"teacher_disagreement_score":0.013671898,"about_ca_system_score_codex":0.00000340961,"about_ca_system_score_gemma":0.000008397183,"threshold_uncertainty_score":0.20621072},"labels":[],"label_agreement":null},{"id":"W2920327934","doi":"","title":"Ordering connected non-bipartite graphs by the least Q-eigenvalue.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Eigenvalues and eigenvectors; Discrete mathematics; Graph; Physics; Quantum mechanics","score_opus":0.022627687731638785,"score_gpt":0.2802282080225212,"score_spread":0.25760052029088243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920327934","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99069035,0.000051908362,0.00016680626,0.00042720052,0.00058794755,0.0003433047,0.000011324671,0.0001602242,0.007560922],"genre_scores_gemma":[0.9988705,0.000006893258,0.00023278147,0.00015551418,0.000017788978,0.0000950855,0.0000072136945,0.000031858806,0.0005823935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989854,0.00008216973,0.00023707596,0.00023320758,0.00016936018,0.00029276247],"domain_scores_gemma":[0.99870867,0.0003391339,0.00010980587,0.00063452026,0.00012906108,0.00007879461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039337805,0.0001607313,0.00016610484,0.000040530103,0.00053112424,0.000052744363,0.00039822192,0.000072908835,0.00017207165],"category_scores_gemma":[0.00015155014,0.00012276843,0.000080053964,0.0004809157,0.00027400538,0.000079306024,0.000078199075,0.00016722461,0.00024774246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009241009,0.00011129215,0.00039150944,0.00000926818,0.000039598446,4.83514e-7,0.0005036471,1.4832999e-7,0.0050267223,0.96563375,0.028060297,0.00021401588],"study_design_scores_gemma":[0.0004215402,0.000060194394,0.00033360513,0.000018482033,0.000036946225,0.0000048513434,0.00018302293,0.00011790579,0.013166675,0.9759294,0.009565361,0.00016202586],"about_ca_topic_score_codex":0.00001908263,"about_ca_topic_score_gemma":0.000012105149,"teacher_disagreement_score":0.018494936,"about_ca_system_score_codex":0.000014915038,"about_ca_system_score_gemma":0.000019942645,"threshold_uncertainty_score":0.5006351},"labels":[],"label_agreement":null},{"id":"W2920466201","doi":"","title":"On Zagreb indices and spectral radius of partial k-trees.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; RADIUS; Spectral radius; Physics; Computer science; Eigenvalues and eigenvectors","score_opus":0.02003394539558644,"score_gpt":0.2844005039640042,"score_spread":0.26436655856841773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920466201","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99506974,0.000019224823,0.0000085171205,0.000092956,0.00026023533,0.00012305491,0.000006703013,0.00003582996,0.0043837153],"genre_scores_gemma":[0.9995522,0.0000043510017,0.00027542686,0.000027865526,0.000016952145,0.000004271924,0.0000020184773,0.000009720363,0.00010721294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994482,0.00003559909,0.00015230685,0.00013426617,0.00010320935,0.00012641729],"domain_scores_gemma":[0.99934906,0.00023551575,0.00009460977,0.00023879636,0.000030751627,0.000051261926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017427857,0.00008226349,0.00013524084,0.000046522975,0.00008907696,0.000011082427,0.00011428566,0.000048943235,0.000071416995],"category_scores_gemma":[0.00008054052,0.00007288061,0.000033359287,0.0001259948,0.00020502273,0.0000417063,0.000027233702,0.00007366917,0.00003435122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023090593,0.00014320933,0.00081682333,0.000010499349,0.000019414361,7.258416e-7,0.0005786475,4.4728594e-8,0.00075038127,0.9959608,0.001523689,0.00017272048],"study_design_scores_gemma":[0.00043117403,0.00021961213,0.0026797105,0.000018173072,0.00002263954,0.0000022255624,0.00005990065,0.000016781121,0.021783933,0.97429883,0.00039113703,0.00007586387],"about_ca_topic_score_codex":0.0000057838442,"about_ca_topic_score_gemma":0.00000465713,"teacher_disagreement_score":0.021661904,"about_ca_system_score_codex":0.0000066154143,"about_ca_system_score_gemma":0.0000111037025,"threshold_uncertainty_score":0.2971985},"labels":[],"label_agreement":null},{"id":"W2920501364","doi":"","title":"Integral Graphs With Distinct Eigenvalues.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Pure mathematics; Physics","score_opus":0.024139030417929874,"score_gpt":0.28524564654847334,"score_spread":0.2611066161305435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920501364","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9769001,0.000013620351,0.00016989016,0.000108819026,0.0003071003,0.00020310929,0.000005551609,0.00017479478,0.022117008],"genre_scores_gemma":[0.9974479,0.0000014156532,0.0019195469,0.000049943013,0.0000132354735,0.000051985786,0.000005466295,0.000026075344,0.00048440025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920446,0.000049113252,0.00016121531,0.00021258277,0.00015423226,0.00021838711],"domain_scores_gemma":[0.9990827,0.0001600569,0.0000784434,0.0004771448,0.000117443305,0.00008423249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022789817,0.00014243352,0.00015546095,0.000055321154,0.00023158606,0.000029018154,0.00024802666,0.00005360393,0.00015447063],"category_scores_gemma":[0.00007847614,0.00010735219,0.000058098693,0.00034938595,0.00031295491,0.0000719442,0.000041701172,0.00013052231,0.00014958496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022363776,0.00013785012,0.0027604797,0.000008989223,0.000029924575,0.0000019900333,0.00028588323,1.32456535e-8,0.000097998156,0.99303424,0.003287154,0.00033313019],"study_design_scores_gemma":[0.0004091943,0.00018179858,0.0018982734,0.000024928715,0.000038220176,0.000008561418,0.00009587454,0.0000108552,0.0024308695,0.9923534,0.0023916364,0.00015641833],"about_ca_topic_score_codex":0.000011785734,"about_ca_topic_score_gemma":0.000021430364,"teacher_disagreement_score":0.021632608,"about_ca_system_score_codex":0.000016682294,"about_ca_system_score_gemma":0.00002321405,"threshold_uncertainty_score":0.43776953},"labels":[],"label_agreement":null},{"id":"W2920753679","doi":"","title":"Hyper-Wiener index and Hamiltonicity of graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Wiener index; Combinatorics; Statistics; Graph; Computer science; World Wide Web","score_opus":0.022559600643046556,"score_gpt":0.28002582304284424,"score_spread":0.25746622239979766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920753679","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9932688,0.00003677974,0.00003681762,0.00006164176,0.00017918638,0.00011478119,0.000004151851,0.00004070459,0.006257122],"genre_scores_gemma":[0.99926716,0.000009927683,0.0005356918,0.000041718875,0.000004457324,0.00001351111,9.300163e-7,0.000010998663,0.00011557956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994378,0.000034769655,0.00016582187,0.00014053531,0.000099480596,0.00012160527],"domain_scores_gemma":[0.9993053,0.00015385196,0.00008100335,0.00031736286,0.000092803355,0.000049666785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002176567,0.0000825798,0.00014605468,0.000061021477,0.00010130966,0.0000086395075,0.00013031118,0.000061355946,0.00003955346],"category_scores_gemma":[0.000080048776,0.000074829295,0.00003924552,0.00023623007,0.00028016645,0.000054598375,0.000057893274,0.0000719787,0.000009695345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008077082,0.000107805216,0.0068723825,0.000016110187,0.000015547195,1.7225034e-7,0.00020852189,2.3044828e-8,0.0012959028,0.99038535,0.00079108623,0.0002990371],"study_design_scores_gemma":[0.00036556038,0.000060332128,0.0066985586,0.00001328735,0.000018745674,0.000002552931,0.00004294276,0.000026582113,0.009392844,0.98234105,0.00095664174,0.000080879574],"about_ca_topic_score_codex":0.000013195871,"about_ca_topic_score_gemma":0.000005875211,"teacher_disagreement_score":0.008096941,"about_ca_system_score_codex":0.0000051684074,"about_ca_system_score_gemma":0.0000121393405,"threshold_uncertainty_score":0.305145},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.268239,0.002338465,0.66187084,0.006547461,0.0011348559,0.011796025,0.0000076960705,0.00010486528,0.047960807],"genre_scores_gemma":[0.98657244,0.00036586644,0.011600312,0.00007802435,0.0005396501,0.00046212616,7.881041e-7,0.000010923487,0.00036986862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746674,0.0003658913,0.00030686025,0.0002788045,0.0008192586,0.00076244574],"domain_scores_gemma":[0.99824095,0.0011727063,0.00013024003,0.00017798746,0.00021194239,0.000066149434],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.010710281,0.00009039562,0.00014692718,0.00012964387,0.00396552,0.00026089483,0.0008832687,0.00003667539,0.000005886782],"category_scores_gemma":[0.00019746363,0.00006341542,0.00007150977,0.001821298,0.00070432783,0.00020695063,0.00020169448,0.00038633778,0.000012453814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059542,0.00005558239,0.0011827186,0.000018613497,0.000008320048,4.7480134e-7,0.00032370613,0.007115582,0.000021635138,0.95240176,0.0021933385,0.03661873],"study_design_scores_gemma":[0.00020646292,0.00007674872,0.0007809326,0.000043991942,0.0000038747007,0.0000034845941,0.0020945885,0.0071220538,0.00001686066,0.9146528,0.07490492,0.00009325441],"about_ca_topic_score_codex":0.000004849744,"about_ca_topic_score_gemma":0.00018815244,"teacher_disagreement_score":0.7183334,"about_ca_system_score_codex":0.00016190387,"about_ca_system_score_gemma":0.00006116774,"threshold_uncertainty_score":0.9973312},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9944417,0.00006482809,0.0036044386,0.0005773423,0.000035409445,0.00069861783,0.000024540555,0.0000052790024,0.0005478493],"genre_scores_gemma":[0.9905781,0.000046581128,0.008778801,0.000010815698,0.00002712129,0.000039921866,0.0000025915363,0.000016788605,0.00049928814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852747,0.00024114618,0.00040150408,0.00015386773,0.00043965597,0.00023635337],"domain_scores_gemma":[0.99639785,0.001499738,0.00011604506,0.0002572581,0.0016268385,0.00010229269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015368034,0.00010215416,0.00028518224,0.00029382843,0.00025877517,0.000080772144,0.00022117056,0.00006298052,0.00025105648],"category_scores_gemma":[0.00069946604,0.000072592826,0.00006934404,0.0006761345,0.00018074962,0.000284544,0.000046247464,0.00030405118,0.0000075574653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013943418,0.0015733761,0.09429205,0.0004911573,0.00054114166,0.00000892896,0.0027717322,0.000642795,0.032832604,0.86206,0.0022417563,0.0011501313],"study_design_scores_gemma":[0.022138052,0.005131331,0.05781159,0.0010740695,0.0005681451,0.0010307262,0.01599294,0.027856378,0.07208394,0.79086834,0.00420714,0.0012373168],"about_ca_topic_score_codex":0.000021309785,"about_ca_topic_score_gemma":0.00008390371,"teacher_disagreement_score":0.071191624,"about_ca_system_score_codex":0.000023370032,"about_ca_system_score_gemma":0.00023901816,"threshold_uncertainty_score":0.29602495},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90816605,0.000024434352,0.00026060786,0.0030405936,0.000031521882,0.00041569254,0.000023369992,0.000053771666,0.08798395],"genre_scores_gemma":[0.9869147,0.0000025455838,0.004166331,0.00052882923,0.000016724487,0.0000318796,0.000005341327,0.000024973428,0.008308691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915624,0.00003649614,0.00018930016,0.0001941696,0.00010812227,0.00031565095],"domain_scores_gemma":[0.99885356,0.00035907308,0.000037996175,0.00031600543,0.00002687455,0.00040647932],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002856241,0.000120746474,0.00020140492,0.00007876535,0.00010239516,0.000041625066,0.000146563,0.00007274465,0.0168782],"category_scores_gemma":[0.00013264125,0.00011116414,0.00004124856,0.000088382585,0.00007328747,0.000020700752,0.000027237875,0.00012304664,0.012568163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022336853,0.000026594747,0.00016435942,0.00009381979,0.000012946628,0.0000031540144,0.00011983623,2.897947e-7,0.00032805983,0.98937356,0.009785199,0.00008992559],"study_design_scores_gemma":[0.00021113284,0.000014403553,0.00021590317,0.00005253023,0.000016631235,0.000017621192,0.00014592978,0.00010748745,0.000127215,0.8805443,0.11838682,0.00016002501],"about_ca_topic_score_codex":0.0002170159,"about_ca_topic_score_gemma":0.00014451363,"teacher_disagreement_score":0.10882928,"about_ca_system_score_codex":0.000038245118,"about_ca_system_score_gemma":0.000035200574,"threshold_uncertainty_score":0.98820066},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14600739,0.004685562,0.033257086,0.002826066,0.035449952,0.019487016,0.008283001,0.001967441,0.7480365],"genre_scores_gemma":[0.029533248,0.0014478229,0.10879472,0.00037886674,0.0014874679,0.0009250234,0.0009036009,0.0010564054,0.85547286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99572635,0.00010083214,0.0015130917,0.0009450458,0.0008090729,0.00090563204],"domain_scores_gemma":[0.9955517,0.00047167123,0.0012188626,0.002147276,0.00020408753,0.0004064252],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080103544,0.001030093,0.0019204769,0.00054429396,0.00023217873,0.00015445666,0.0011407497,0.00076625677,0.00022617792],"category_scores_gemma":[0.0004426385,0.00089183566,0.00060056715,0.0006484324,0.00037826019,0.00016740854,0.0004743219,0.00106612,0.0002445409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028069751,0.00015975069,0.000017069986,0.00284759,0.00026606247,0.000007942097,0.0028780573,9.655115e-7,0.0002820912,0.6893356,0.30408463,0.00009219948],"study_design_scores_gemma":[0.00063432043,0.00034581003,0.00007822363,0.0022076434,0.00091135746,0.0000705202,0.0018466339,0.00059399765,0.00074988516,0.81237274,0.17874323,0.0014456367],"about_ca_topic_score_codex":0.000027040847,"about_ca_topic_score_gemma":0.000027374199,"teacher_disagreement_score":0.1253414,"about_ca_system_score_codex":0.000078793506,"about_ca_system_score_gemma":0.00019145508,"threshold_uncertainty_score":0.99935323},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9911532,0.0005090134,0.0032999925,0.0007497264,0.000026804832,0.001142635,0.00011482002,0.00017524873,0.002828585],"genre_scores_gemma":[0.99380803,0.00016075694,0.0042240107,0.00020502317,0.00004274101,0.00035217847,0.00003695907,0.00002354675,0.0011467732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992278,0.000025496915,0.00020655194,0.00029178063,0.0000819665,0.00016635271],"domain_scores_gemma":[0.9991075,0.00031464593,0.00007619416,0.0003359204,0.000058440102,0.00010731089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012942715,0.00013224261,0.00017296922,0.00006405021,0.00021922257,0.000034711553,0.00012535181,0.0000649011,0.00008426092],"category_scores_gemma":[0.0000224097,0.00012043973,0.000040519502,0.00021703029,0.000080627346,0.00009340551,0.00006753347,0.000114335955,0.00018971249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003499243,0.000063190906,0.00078059715,0.00006330067,0.000018632805,7.2662935e-8,0.00015216279,7.002554e-7,0.008122222,0.9887316,0.00023602355,0.001827971],"study_design_scores_gemma":[0.00046547712,0.00003121211,0.0028835763,0.000021788524,0.000047256806,0.000011760688,0.00017908782,0.0016908597,0.002185144,0.91911405,0.07310894,0.0002608167],"about_ca_topic_score_codex":0.0000026569605,"about_ca_topic_score_gemma":0.0000044105686,"teacher_disagreement_score":0.072872914,"about_ca_system_score_codex":0.000003053356,"about_ca_system_score_gemma":0.000007767091,"threshold_uncertainty_score":0.49113894},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.970311,0.0006367697,0.0040319343,0.0004913632,0.0004932096,0.00089847203,0.00031025126,0.00014286114,0.022684138],"genre_scores_gemma":[0.992051,0.0002745732,0.0068493825,0.000025234516,0.00067630666,0.00004229955,0.000021020624,0.000026585305,0.000033572982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879104,0.00005733351,0.00042453717,0.0003682198,0.00019954727,0.000159352],"domain_scores_gemma":[0.9988027,0.00024493743,0.0004153016,0.0003950135,0.000059388087,0.00008264323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002573781,0.0002083768,0.00046383607,0.000122023346,0.00009272663,0.00004771404,0.00030670493,0.00018124693,0.00010304911],"category_scores_gemma":[0.00011379658,0.00019903855,0.00018113702,0.00021819658,0.000112359514,0.0000383712,0.00040255772,0.00032523007,0.000009737206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030082221,0.000059972346,0.0006285688,0.0010377059,0.00007030003,0.0000037003474,0.0006884085,0.0000028483219,0.00035005328,0.9940238,0.0014619255,0.0016426446],"study_design_scores_gemma":[0.00012164349,0.00001547283,0.0015277987,0.00009208096,0.00014488115,0.0000030210742,0.00012211422,0.000022201593,0.0005659686,0.9957407,0.0014603097,0.00018377502],"about_ca_topic_score_codex":0.00003904702,"about_ca_topic_score_gemma":0.000014229036,"teacher_disagreement_score":0.022650566,"about_ca_system_score_codex":0.000013690962,"about_ca_system_score_gemma":0.00003825396,"threshold_uncertainty_score":0.81165564},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20296167,0.000040595573,0.7714733,0.00025935745,0.00014798493,0.00051772007,0.000015818112,0.000054930475,0.02452866],"genre_scores_gemma":[0.81304765,0.0000067682663,0.18648843,0.00007388389,0.00017649427,0.000021045607,4.5809546e-7,0.000033602868,0.00015166998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989467,0.000044718898,0.0005269146,0.00008956697,0.00020881488,0.00018326209],"domain_scores_gemma":[0.99803376,0.00089211046,0.00045789423,0.00027167774,0.00023634634,0.000108214466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078407064,0.00013607262,0.00036265817,0.00004746509,0.0000820123,0.000015940275,0.00031977476,0.000059036774,0.00012895881],"category_scores_gemma":[0.00038000869,0.00009641231,0.00040200565,0.0001443582,0.00011772023,0.00014546614,0.0000252258,0.00017266259,0.000023263065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043615208,0.0006130183,0.000008466069,0.00013297248,0.00007713731,0.0000016572859,0.00088577153,3.1967656e-7,0.00043053844,0.99437606,0.0019712271,0.0014592392],"study_design_scores_gemma":[0.00036671723,0.00014816721,0.000017589675,0.00007913397,0.00015179272,0.0000346333,0.00020691275,0.00006171943,0.0060618087,0.99236244,0.00039936436,0.00010971263],"about_ca_topic_score_codex":8.7066205e-8,"about_ca_topic_score_gemma":6.920711e-8,"teacher_disagreement_score":0.61008596,"about_ca_system_score_codex":0.000011790577,"about_ca_system_score_gemma":0.000026293701,"threshold_uncertainty_score":0.393158},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9596262,0.000012843995,0.017086294,0.00007068937,0.00025040406,0.00043742463,0.00004162883,0.0001625394,0.022311997],"genre_scores_gemma":[0.9971172,0.000071839124,0.0008278857,0.000039929688,0.00003527425,0.0000034116297,0.000020783067,0.000031428917,0.0018522126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865526,0.0001053199,0.00021525752,0.0006667356,0.00005842335,0.0002990282],"domain_scores_gemma":[0.99824524,0.0002521164,0.00020309714,0.0011098302,0.00006552161,0.00012417891],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033734634,0.00028438272,0.00032664003,0.0003818591,0.00010957044,0.000029120993,0.00078340777,0.0004912509,0.00024085467],"category_scores_gemma":[0.00007801788,0.00033474344,0.0002548483,0.0005070854,0.00017224692,0.0000862793,0.00047671614,0.0012600241,0.000092847404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025141948,0.00017029826,0.0013174239,0.00007134174,0.000042368727,0.00009916718,0.00019391971,0.002256606,0.000106376705,0.99532324,0.0002607363,0.0001333604],"study_design_scores_gemma":[0.00036903462,0.000010457608,0.0010920612,0.00006472941,0.000058619993,0.000002581522,0.00011045692,0.0017961968,0.00012072879,0.9955014,0.0005279783,0.00034573747],"about_ca_topic_score_codex":0.00007577944,"about_ca_topic_score_gemma":0.00046107685,"teacher_disagreement_score":0.037491053,"about_ca_system_score_codex":0.00006499649,"about_ca_system_score_gemma":0.00007146204,"threshold_uncertainty_score":0.9999105},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98601526,0.000008115517,0.001440734,0.00049698673,0.00002607261,0.0006010782,0.000043395212,0.000042931402,0.011325412],"genre_scores_gemma":[0.9941149,0.000002691133,0.0054868446,0.00006326381,0.000015042447,0.00003074894,0.0000032830276,0.000020879495,0.00026236015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999072,0.00006003449,0.00034756208,0.00016772331,0.00020053466,0.00015214749],"domain_scores_gemma":[0.9970473,0.0019554894,0.00018776263,0.00072307384,0.00004811058,0.000038277376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000564479,0.00014344287,0.00027928437,0.000032692722,0.00009694253,0.000022084036,0.00023618636,0.000054391523,0.00019981014],"category_scores_gemma":[0.0003411962,0.00008804474,0.000092973976,0.00012625917,0.0001713407,0.000036849873,0.000083545114,0.00012544841,0.000050972903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000099577965,0.00010306325,0.00017596723,0.00023141797,0.000017148359,8.59881e-8,0.00060877175,0.0000060965913,0.0027918892,0.99555653,0.0004572252,0.000041848914],"study_design_scores_gemma":[0.0001495875,0.0000612274,0.0005857007,0.00006762111,0.000033565975,0.000002631305,0.0006795429,0.0010085576,0.0022842644,0.99487644,0.00014734418,0.000103530205],"about_ca_topic_score_codex":0.0000027216963,"about_ca_topic_score_gemma":0.000002246678,"teacher_disagreement_score":0.011063052,"about_ca_system_score_codex":0.000008452995,"about_ca_system_score_gemma":0.000009436516,"threshold_uncertainty_score":0.35903603},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99485415,0.0007856033,0.0003825966,0.000114903276,0.00015715726,0.0003997292,0.000055736462,0.0001241194,0.0031259737],"genre_scores_gemma":[0.996075,0.000398261,0.0027549851,0.00004449172,0.000054244294,0.000062713596,0.00002764362,0.00004077489,0.0005418944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986032,0.000069637106,0.00049033435,0.00042200758,0.00017248934,0.00024230282],"domain_scores_gemma":[0.9982099,0.0003844765,0.00034215645,0.0008434118,0.00012428919,0.00009579156],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005655678,0.00028010944,0.00046495002,0.0001913164,0.00010923146,0.000016317912,0.00033415784,0.0003109935,0.0000933005],"category_scores_gemma":[0.0001356341,0.00026160007,0.00018867591,0.00016152216,0.00026926398,0.000034501743,0.0003834097,0.00037727377,0.000021374699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002877456,0.00027505946,0.23670524,0.0008375856,0.00024474802,0.000004614573,0.0011236444,0.0000055522896,0.0026502614,0.7562945,0.0009901363,0.00083987607],"study_design_scores_gemma":[0.00016958345,0.000023473123,0.06174132,0.0001688664,0.00015451871,0.0000040717982,0.00021650667,0.0000069187818,0.014906249,0.92162466,0.0007021608,0.00028166568],"about_ca_topic_score_codex":0.00008153892,"about_ca_topic_score_gemma":0.0000557019,"teacher_disagreement_score":0.17496394,"about_ca_system_score_codex":0.00001131517,"about_ca_system_score_gemma":0.000043081014,"threshold_uncertainty_score":0.9999836},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99692243,0.0003785671,0.000063354615,0.0005329745,0.000066658075,0.0007403156,0.000017954462,0.000007533904,0.0012702318],"genre_scores_gemma":[0.99882156,0.0004691661,0.00017109861,0.00006459435,0.00002565041,0.0002695309,0.0000034205477,0.000016615226,0.00015839691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859333,0.00036828403,0.000493175,0.00020407797,0.00017387685,0.00016724411],"domain_scores_gemma":[0.99761695,0.00089059776,0.00040366538,0.0010296083,0.000039823495,0.000019355906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013225573,0.00017506498,0.00032750427,0.000026307629,0.00013418321,0.000020397463,0.00058880664,0.00010409029,0.000012896925],"category_scores_gemma":[0.000115304465,0.000076623124,0.0001670862,0.00012363493,0.00045616372,0.000013696023,0.00022419232,0.00033634427,0.0000065033314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071998205,0.00033606996,0.13796742,0.00066781713,0.00017113841,0.000009926044,0.0094913,0.000018242807,0.0014427473,0.84869343,0.0003629737,0.000766936],"study_design_scores_gemma":[0.00073622155,0.000013432242,0.11222206,0.00020096063,0.00026720023,0.00011810538,0.0012927395,0.0001701219,0.0011829293,0.88241947,0.0011458066,0.00023096448],"about_ca_topic_score_codex":0.00004035631,"about_ca_topic_score_gemma":0.000021501388,"teacher_disagreement_score":0.033726033,"about_ca_system_score_codex":0.000011105897,"about_ca_system_score_gemma":0.000030929823,"threshold_uncertainty_score":0.31246004},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9921516,0.00019159581,0.0011791467,0.00003258694,0.00012040148,0.00041465578,0.00012731028,0.00012193194,0.005660742],"genre_scores_gemma":[0.9977199,0.0002432329,0.00067657424,0.000007684473,0.000017580225,0.0000024877752,0.000023889794,0.000028334289,0.0012803078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873126,0.00014059934,0.0002626581,0.00056450354,0.00007502419,0.00022596311],"domain_scores_gemma":[0.9981885,0.00020101876,0.0003556085,0.000874493,0.00019174528,0.000188619],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034269484,0.00028182118,0.00044263952,0.00030010045,0.00009610725,0.00001918537,0.00049205037,0.00029896162,0.00004424412],"category_scores_gemma":[0.00006772001,0.00031366074,0.00023530964,0.00046522502,0.00031286717,0.00008726242,0.00048453428,0.0003734853,0.000011367081],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034277567,0.0001510556,0.0025183677,0.00028434352,0.00012102334,0.000021054822,0.00021998015,0.00022725647,0.00007926298,0.995432,0.00078795606,0.00012342168],"study_design_scores_gemma":[0.0004191776,0.00003299,0.0006713416,0.000113914466,0.00028587223,0.0000042165475,0.00040772863,0.0005064864,0.00026501287,0.9967315,0.0002621531,0.00029958592],"about_ca_topic_score_codex":0.00004768476,"about_ca_topic_score_gemma":0.00005466212,"teacher_disagreement_score":0.0055682794,"about_ca_system_score_codex":0.00002986676,"about_ca_system_score_gemma":0.0000806357,"threshold_uncertainty_score":0.9999316},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9891749,0.00004282511,0.0029828853,0.000024942556,0.00012654823,0.00044486645,0.000046256715,0.00011253718,0.007044249],"genre_scores_gemma":[0.9969777,0.0001470312,0.0010048843,0.000014976874,0.000021940923,0.0000032568944,0.000015678352,0.000023191533,0.0017913793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989141,0.00010233791,0.00023722363,0.0004706758,0.00006481001,0.00021081296],"domain_scores_gemma":[0.9980412,0.00033895933,0.00038354617,0.00096494076,0.00016696104,0.0001043909],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018293041,0.00022694282,0.00036784852,0.00046071556,0.00007800168,0.000015976455,0.00067028304,0.00025232302,0.0002800507],"category_scores_gemma":[0.00008978709,0.0002465602,0.00032470236,0.0008309414,0.00016740541,0.00006914854,0.0004426369,0.00037422453,0.00010414851],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010678991,0.0001774096,0.0008704788,0.00017420214,0.00012098727,0.00000703807,0.000053608303,0.0005047253,0.00011574527,0.99716604,0.0007325972,0.000066471424],"study_design_scores_gemma":[0.00023152021,0.00002011352,0.00037712418,0.000058387606,0.00021527465,9.900956e-7,0.00007586042,0.0022431836,0.00043090974,0.9958829,0.00024163374,0.00022206195],"about_ca_topic_score_codex":0.000058754704,"about_ca_topic_score_gemma":0.0000047026383,"teacher_disagreement_score":0.0078027714,"about_ca_system_score_codex":0.00004222663,"about_ca_system_score_gemma":0.000045701505,"threshold_uncertainty_score":0.9999987},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9799889,0.00007458722,0.013750817,0.00015910027,0.00011760684,0.0005687241,0.00046372451,0.000107640655,0.004768954],"genre_scores_gemma":[0.99895555,0.00015288683,0.00012950039,0.00005093195,0.000031253396,0.000006830806,0.00011797297,0.000029760206,0.0005253094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987519,0.00022802025,0.00023112656,0.0004310977,0.00008308606,0.00027476376],"domain_scores_gemma":[0.99816567,0.0004238283,0.00027307085,0.00096528116,0.00006403293,0.00010810125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027625047,0.00027297254,0.0003030226,0.00029984908,0.0002414687,0.000016822507,0.00068261806,0.0002191477,0.00016979709],"category_scores_gemma":[0.000026617414,0.00023885148,0.00031704747,0.0012809336,0.00020225575,0.00005760772,0.00011519542,0.0005566306,0.000039502673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021997485,0.00045920335,0.00038679366,0.00006116507,0.00017309286,0.0000036471506,0.00012253648,0.0006561954,0.000498809,0.99633014,0.0012720425,0.000014360517],"study_design_scores_gemma":[0.00025581414,0.000040096318,0.00088937854,0.000056618832,0.00046773197,0.0000013207069,0.000097044074,0.000865007,0.0026208374,0.994195,0.00021083128,0.0003003323],"about_ca_topic_score_codex":0.000056205416,"about_ca_topic_score_gemma":0.00005912933,"teacher_disagreement_score":0.018966708,"about_ca_system_score_codex":0.000057700458,"about_ca_system_score_gemma":0.000026713762,"threshold_uncertainty_score":0.9740081},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97798806,0.00003991539,0.008618948,0.000019982299,0.00013311736,0.00044150307,0.00017146497,0.00012565419,0.012461324],"genre_scores_gemma":[0.99855995,0.00005911649,0.0004615639,0.000016335916,0.000021189966,0.0000020477103,0.000041246825,0.000025167952,0.000813386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986116,0.0001465236,0.00028623946,0.0005881854,0.0001330592,0.0002343588],"domain_scores_gemma":[0.9977403,0.0002252952,0.00046147805,0.0011362021,0.00029307258,0.00014360898],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043673342,0.00027394903,0.00047105478,0.00023480358,0.00009325823,0.000018646506,0.00089205516,0.0003281347,0.0001366096],"category_scores_gemma":[0.00007501113,0.00030839877,0.0002759951,0.00041758164,0.00026576413,0.000084924344,0.0006208722,0.0005096017,0.00006004321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041470117,0.00019186988,0.0016835288,0.00020742108,0.00013860007,0.00002785589,0.00018572717,0.0033628752,0.00037048061,0.99285173,0.0009255822,0.0000128538795],"study_design_scores_gemma":[0.00037963846,0.000023337787,0.00038017394,0.0001176519,0.00020835109,0.0000048350166,0.0002753594,0.002279301,0.0007530292,0.99508095,0.00019327783,0.000304124],"about_ca_topic_score_codex":0.0001135419,"about_ca_topic_score_gemma":0.00004461707,"teacher_disagreement_score":0.020571854,"about_ca_system_score_codex":0.00007016812,"about_ca_system_score_gemma":0.00015557298,"threshold_uncertainty_score":0.9999368},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99547887,0.00019033186,0.0009009245,0.0008097845,0.00021810505,0.00052707526,0.00031543462,0.00012578536,0.0014336987],"genre_scores_gemma":[0.9921601,0.00028015854,0.0058691716,0.00032726253,0.0001007696,0.00044609752,0.00006273567,0.00018637534,0.00056735217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99621665,0.00020610343,0.0013558615,0.00058588607,0.00082772,0.0008077858],"domain_scores_gemma":[0.9942651,0.0017786401,0.0012763666,0.0024156768,0.000079028774,0.00018522792],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014937153,0.0005134369,0.000526751,0.00013884119,0.0006759823,0.00020299245,0.0015189643,0.00041162537,0.000058960795],"category_scores_gemma":[0.00073190127,0.00037723233,0.00069415034,0.0008126913,0.00051443785,0.0002505349,0.0007295209,0.0006908249,0.0004960993],"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.0000918652,0.00041606696,0.0000877376,0.00088309695,0.00021471026,0.000008959524,0.004559567,0.00006538059,0.0011358212,0.99198,0.0003655629,0.0001912038],"study_design_scores_gemma":[0.0017321855,0.0003013343,0.00033253038,0.0014049242,0.00044361444,0.00015159242,0.0075156856,0.5692706,0.008739249,0.40603405,0.0031904387,0.0008837769],"about_ca_topic_score_codex":0.0001127899,"about_ca_topic_score_gemma":0.00030823576,"teacher_disagreement_score":0.58594596,"about_ca_system_score_codex":0.000026433396,"about_ca_system_score_gemma":0.00019865145,"threshold_uncertainty_score":0.999868},"labels":[],"label_agreement":null},{"id":"W2962760670","doi":"","title":"Maximally connected and super arc-connected Bi-Cayley digraphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arc (geometry); Cayley graph; Combinatorics; Geometry; Graph","score_opus":0.021095974597185464,"score_gpt":0.25668725136268533,"score_spread":0.23559127676549987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962760670","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99454695,0.0000687449,0.00008229352,0.0009815462,0.00026604623,0.0003467201,0.000028339988,0.00029351286,0.0033858342],"genre_scores_gemma":[0.9985802,0.00005350379,0.0005884006,0.0000984284,0.0000088509105,0.00008692082,0.0000063009156,0.00003916363,0.0005382042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987293,0.00011102678,0.00029875457,0.00036681135,0.00016433315,0.00032981107],"domain_scores_gemma":[0.99799937,0.001048931,0.00009739199,0.0005612263,0.00013645267,0.00015665074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029334138,0.00021742028,0.00027319905,0.00013659697,0.00019058722,0.000041706226,0.0002456007,0.00012573623,0.00022894148],"category_scores_gemma":[0.00045778358,0.00015745468,0.00008402128,0.00037295878,0.0002074931,0.00015663412,0.000085767075,0.00011888352,0.00009191222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002861014,0.00016480465,0.003350614,0.000020686104,0.000058220045,0.0000042861875,0.00019633243,9.028089e-9,0.014254277,0.97893775,0.0022596396,0.0007247994],"study_design_scores_gemma":[0.0015471221,0.00007432032,0.0062823,0.0000576157,0.00004741911,0.000014642604,0.00006121269,0.0000040766754,0.0070622675,0.981565,0.0030220242,0.00026197513],"about_ca_topic_score_codex":0.000014120174,"about_ca_topic_score_gemma":0.00001408225,"teacher_disagreement_score":0.007192009,"about_ca_system_score_codex":0.000019097402,"about_ca_system_score_gemma":0.000026470349,"threshold_uncertainty_score":0.64208156},"labels":[],"label_agreement":null},{"id":"W2962922560","doi":"","title":"Notes on the sum of powers of the signless Laplacian eigenvalues of graphs","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Eigenvalues and eigenvectors; Graph; Sums of powers; Discrete mathematics; Connectivity; Physics","score_opus":0.02401801892270766,"score_gpt":0.2676450529362539,"score_spread":0.24362703401354624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962922560","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99465674,0.000014478118,0.000018747787,0.000373602,0.00019229163,0.00023077516,0.0000118508715,0.000012493987,0.004489004],"genre_scores_gemma":[0.999827,0.000003923153,0.00007158258,0.000037271126,0.0000019195995,0.000013533307,7.3876896e-7,0.000011557964,0.000032460535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913937,0.00018960291,0.00026766956,0.00009723602,0.00020332981,0.000102818354],"domain_scores_gemma":[0.9972026,0.0017311875,0.0002900258,0.00066508196,0.00009091695,0.00002020405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063070917,0.00009474856,0.00020579083,0.000039390754,0.00008483052,0.0000037223158,0.00044167376,0.00005202335,0.000021540214],"category_scores_gemma":[0.0004395186,0.00005326982,0.0001500345,0.00027605245,0.00028549944,0.000019421082,0.000049121943,0.000097229626,0.0000027283454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010811213,0.00018719374,0.0021252765,0.0000418979,0.000033686047,2.2018787e-8,0.0005936802,0.0000024852384,0.0057841046,0.9908629,0.0002821367,0.00007578871],"study_design_scores_gemma":[0.00016477039,0.000060590242,0.0019172791,0.00005242088,0.000031823576,1.684866e-7,0.00019321048,0.000012956017,0.1542808,0.8431412,0.00009845727,0.000046348858],"about_ca_topic_score_codex":0.00001454618,"about_ca_topic_score_gemma":0.0000044382023,"teacher_disagreement_score":0.14849669,"about_ca_system_score_codex":0.000004452816,"about_ca_system_score_gemma":0.000014829347,"threshold_uncertainty_score":0.21722804},"labels":[],"label_agreement":null},{"id":"W2963002481","doi":"","title":"Lower bounds for algebraic connectivity of graphs in terms of matching number or edge covering number.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Algebraic connectivity; Matching (statistics); Algebraic number; Enhanced Data Rates for GSM Evolution; Upper and lower bounds; Discrete mathematics; Graph; Connectivity; Line graph; Computer science; Statistics","score_opus":0.023840666708191155,"score_gpt":0.30532034046449696,"score_spread":0.2814796737563058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963002481","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99598384,0.0000029157336,0.00050601363,0.000058098707,0.00035101728,0.00038471288,0.000037105485,0.000033862714,0.0026424478],"genre_scores_gemma":[0.99882114,0.000005654017,0.00083452224,0.000012388204,0.000004170102,0.00010028562,0.0000015563817,0.000027147653,0.000193131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902445,0.00005674887,0.00038882912,0.00019831107,0.0001229896,0.00020869043],"domain_scores_gemma":[0.99769866,0.001583492,0.00023018943,0.000385284,0.000059239163,0.000043148844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005080677,0.0001363528,0.0003427842,0.000052156767,0.000058844034,0.000008743208,0.00020840112,0.000088966044,0.00012508835],"category_scores_gemma":[0.00029145545,0.00010013013,0.00012915689,0.00025095243,0.000117170755,0.00014958586,0.000059342416,0.00007230667,0.00000981466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010694808,0.00040320412,0.01961084,0.00015026965,0.00003661524,9.506808e-7,0.00031058595,1.7683823e-7,0.007989457,0.97082233,0.0002584252,0.0003101826],"study_design_scores_gemma":[0.0014573627,0.00005226586,0.0033983416,0.00019311995,0.00002295684,0.0000042046563,0.000045756715,0.0000037678997,0.01572308,0.9787857,0.0001764688,0.00013699465],"about_ca_topic_score_codex":0.000019105273,"about_ca_topic_score_gemma":0.000027575272,"teacher_disagreement_score":0.0162125,"about_ca_system_score_codex":0.000030347659,"about_ca_system_score_gemma":0.000025960424,"threshold_uncertainty_score":0.40831882},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8130464,0.008801593,0.15877408,0.012406973,0.0014031241,0.0015657264,0.000016733515,0.000040449482,0.0039449534],"genre_scores_gemma":[0.9975875,0.0016091173,0.00008617995,0.00009673763,0.00017582734,0.000035691904,0.0000056101626,0.000022800097,0.0003805524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982119,0.0004390457,0.00055973534,0.00013807256,0.0003748996,0.00027629684],"domain_scores_gemma":[0.9962164,0.0019083006,0.001019003,0.00048878655,0.00032214462,0.000045354947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026159843,0.00020417805,0.00038605824,0.00008979522,0.00038597293,0.000094410745,0.0006204069,0.00016093648,0.000024514538],"category_scores_gemma":[0.00016385976,0.00011690022,0.00026695445,0.00016097332,0.00018461017,0.000060322713,0.0001791924,0.0020289745,0.000008423717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019070627,0.00009645886,0.000025752244,0.000024734567,0.00026337485,4.7071876e-7,0.00034187653,0.0006023091,0.000019588879,0.9973516,0.001056285,0.000026835623],"study_design_scores_gemma":[0.0009882487,0.00012453941,0.00009591833,0.00004830098,0.00042515836,0.00017756027,0.00012795742,0.00068725547,0.00008854556,0.9953805,0.0017340196,0.00012197818],"about_ca_topic_score_codex":0.0000044720946,"about_ca_topic_score_gemma":0.0000052654423,"teacher_disagreement_score":0.18454112,"about_ca_system_score_codex":0.00018278757,"about_ca_system_score_gemma":0.0005522271,"threshold_uncertainty_score":0.8814997},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99051046,0.00011132652,0.0082847765,0.00045232737,0.000028268101,0.000090365036,0.00001122828,0.000011784859,0.00049947127],"genre_scores_gemma":[0.9907704,0.00015749091,0.008794755,0.000032914304,0.000049237366,0.0000015793025,3.02118e-7,0.0000108741,0.00018242183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918294,0.00012652476,0.00037756632,0.00007636004,0.000114277784,0.00012234424],"domain_scores_gemma":[0.99885154,0.00040775648,0.00036761077,0.0001315478,0.00015045497,0.000091083806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097410777,0.00008339411,0.00023399357,0.00008657379,0.000040947234,0.000009039963,0.00012628482,0.000039591367,0.000116710595],"category_scores_gemma":[0.00015571015,0.000049923954,0.00009141872,0.00010338279,0.00016348335,0.00011070826,0.000017865887,0.0001054567,0.000002084965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018136305,0.00010921368,0.00042953205,0.000028176797,0.00006899336,0.0000056876247,0.00045957768,6.870615e-7,0.16399236,0.830456,0.00024621154,0.004022165],"study_design_scores_gemma":[0.00050160824,0.00011064769,0.0011872068,0.000111722955,0.000046326466,0.000058322858,0.000245211,0.0000020494172,0.10550717,0.8920536,0.000113679685,0.000062454776],"about_ca_topic_score_codex":0.0000016893663,"about_ca_topic_score_gemma":0.0000029893356,"teacher_disagreement_score":0.061597563,"about_ca_system_score_codex":0.000019575638,"about_ca_system_score_gemma":0.000037956324,"threshold_uncertainty_score":0.20358397},"labels":[],"label_agreement":null},{"id":"W2963088367","doi":"","title":"The Laplacian polynomial of graphs derived from regular graphs and applications","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Graph; 1-planar graph; Laplace operator; Symmetric graph; Discrete mathematics; Chordal graph; Line graph; Voltage graph; Mathematical analysis","score_opus":0.013213284517185332,"score_gpt":0.24862245707134292,"score_spread":0.23540917255415758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963088367","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9971008,0.0002232504,0.00011251182,0.0007031048,0.00016940283,0.00038984438,0.000050396266,0.00007006475,0.0011806297],"genre_scores_gemma":[0.9991333,0.00009647295,0.00037058853,0.000022780085,0.000006309554,0.00018613794,0.000003340643,0.000017138933,0.00016397044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991851,0.000074834905,0.00025558047,0.0001997795,0.00012069097,0.00016402995],"domain_scores_gemma":[0.9980286,0.001076069,0.00015884744,0.00059858727,0.00006509403,0.000072827606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023064236,0.00011756075,0.00016326144,0.00004511467,0.00030966962,0.000019998006,0.00028080546,0.00007351636,0.000015081367],"category_scores_gemma":[0.0000608986,0.00007304453,0.00007940089,0.00020168975,0.00036168567,0.00006114571,0.00006320455,0.00006691253,0.0000100349325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016766331,0.000063097395,0.000994429,0.0000053157746,0.000048282633,1.6200934e-7,0.00007488707,6.9928205e-9,0.021303048,0.9740094,0.0010062156,0.0024783695],"study_design_scores_gemma":[0.00056984526,0.000021307998,0.003547135,0.00001879217,0.000044032196,7.4454454e-7,0.0000721983,6.309586e-7,0.014612553,0.9765929,0.004420331,0.00009954017],"about_ca_topic_score_codex":0.00001444968,"about_ca_topic_score_gemma":0.0000122821675,"teacher_disagreement_score":0.006690496,"about_ca_system_score_codex":0.000009015757,"about_ca_system_score_gemma":0.000017078819,"threshold_uncertainty_score":0.29786694},"labels":[],"label_agreement":null},{"id":"W2963129494","doi":"","title":"The number of spanning trees of power graphs associated with specific groups and some applications.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Spanning tree; Graph; Isomorphism (crystallography); Discrete mathematics","score_opus":0.01965033774156178,"score_gpt":0.2796773922405817,"score_spread":0.2600270544990199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963129494","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9956224,0.000101511694,0.000026415682,0.0001111886,0.000060421244,0.00026703405,0.000009747043,0.00002226261,0.0037790004],"genre_scores_gemma":[0.99949926,0.000043009833,0.00026346213,0.0000041840135,0.0000023484465,0.000068225614,0.000002080157,0.000015018224,0.00010241899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993386,0.00003930088,0.00021860006,0.00013470378,0.00014448244,0.00012430767],"domain_scores_gemma":[0.9981939,0.0005221275,0.00044570703,0.00069240236,0.00011100395,0.000034849145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038251712,0.0000962966,0.00018765294,0.000023780101,0.00049210934,0.000040297007,0.00032339175,0.00005150421,0.000008191736],"category_scores_gemma":[0.00009776849,0.0000677309,0.00004787541,0.00009764171,0.0004452515,0.00010504344,0.00006043921,0.00009264075,0.0000026293399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012547641,0.00013446233,0.018157074,0.000009315472,0.00006134952,2.3229852e-7,0.00020250665,7.049069e-8,0.00037279323,0.980656,0.00020110223,0.00019252049],"study_design_scores_gemma":[0.00044364174,0.000024337662,0.054985564,0.00003846866,0.000030975007,0.0000014402477,0.0001768386,0.0000027172582,0.001114666,0.94283575,0.00027074094,0.00007488712],"about_ca_topic_score_codex":0.0000047292847,"about_ca_topic_score_gemma":0.0000041886487,"teacher_disagreement_score":0.037820302,"about_ca_system_score_codex":0.0000070633496,"about_ca_system_score_gemma":0.000010813477,"threshold_uncertainty_score":0.3784957},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8676359,0.00067100726,0.10564267,0.00014396594,0.00007626961,0.0009783186,0.000022764765,0.00014155541,0.024687517],"genre_scores_gemma":[0.78697246,0.00005678122,0.21273406,0.000014345249,0.0000092503005,0.000093536415,0.0000039178854,0.000018213523,0.000097430544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899566,0.000044814362,0.00039663294,0.00015489307,0.00024632012,0.00016170216],"domain_scores_gemma":[0.99877506,0.00036993792,0.00025682643,0.00040616438,0.00013246106,0.00005952165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004898042,0.00013588475,0.00027026064,0.00010117182,0.000035870387,0.000010498958,0.00020304017,0.000047821788,0.000015361564],"category_scores_gemma":[0.00029230223,0.000105829575,0.000036717305,0.00045457808,0.0001477018,0.0002908788,0.000024084793,0.00010449024,0.000009458902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026830463,0.00024492445,0.00087631284,0.00020690494,0.000009529962,0.0000024855158,0.0019044601,0.00019119815,0.00025143014,0.99494195,0.000029695633,0.001314289],"study_design_scores_gemma":[0.00042325997,0.000081754246,0.000026626589,0.00017157153,0.000022331553,0.000015881615,0.0010527887,0.0007169629,0.0027552454,0.99435174,0.00025232224,0.00012952893],"about_ca_topic_score_codex":0.0000022272743,"about_ca_topic_score_gemma":0.00006758051,"teacher_disagreement_score":0.10709139,"about_ca_system_score_codex":0.00002547149,"about_ca_system_score_gemma":0.000044399338,"threshold_uncertainty_score":0.4315605},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92948246,0.0000066170724,0.019987829,0.0015328035,0.000021025364,0.00016993529,0.000010439842,0.00010348467,0.04868541],"genre_scores_gemma":[0.9930142,0.000006985074,0.0051072836,0.000029052328,0.0000058987653,0.000027723301,8.894271e-7,0.000005670528,0.0018022647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996324,0.000021232678,0.00014191131,0.00007989946,0.00005950464,0.000065005006],"domain_scores_gemma":[0.9993538,0.00026307118,0.000064923675,0.00025633085,0.000037813967,0.000024008114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015362047,0.000040676627,0.00006420335,0.00003858898,0.000017045424,0.000002032708,0.00009107777,0.000027801228,0.00028419957],"category_scores_gemma":[0.00005828576,0.000023392593,0.0000452637,0.00008578636,0.00005139978,0.000037374284,0.000009980219,0.000015174321,0.00005492113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027885978,0.00005103838,0.00037757307,0.0000064856995,0.000008729423,3.0670687e-8,0.000039077964,3.9968966e-9,0.0905721,0.9047615,0.002141754,0.0020389492],"study_design_scores_gemma":[0.00012361308,0.000010669832,0.002294517,0.000009647136,0.000011571906,8.005477e-7,0.00004219285,0.0000038670537,0.017430808,0.9761538,0.003879082,0.0000394499],"about_ca_topic_score_codex":0.0000011663656,"about_ca_topic_score_gemma":0.000004362102,"teacher_disagreement_score":0.073141284,"about_ca_system_score_codex":0.0000036769022,"about_ca_system_score_gemma":0.000005192112,"threshold_uncertainty_score":0.3111786},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99463403,0.00031431703,0.0029807829,0.00014621322,0.00020854738,0.00048561487,0.0000309667,0.000100822705,0.0010986981],"genre_scores_gemma":[0.9958915,0.00014389619,0.0034560899,0.00008813329,0.000025551784,0.00011585812,0.000002781158,0.000022022285,0.00025417985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988524,0.000036208374,0.00024812235,0.00036844402,0.00019978362,0.0002950753],"domain_scores_gemma":[0.998865,0.00035265533,0.000121980614,0.00032041428,0.00019150645,0.00014842572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005851751,0.00018973777,0.0002400857,0.00013044996,0.0004982048,0.00008065338,0.00020785864,0.0001753386,0.00001445631],"category_scores_gemma":[0.0001175961,0.00017682325,0.00007318685,0.00032942987,0.0003342565,0.00013982582,0.00009238163,0.00016331689,0.0000032048806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028021945,0.00008354179,0.001855927,0.000044755245,0.000024894181,8.697524e-7,0.00027877677,6.2801455e-8,0.0003968717,0.99550045,0.000807798,0.0009780065],"study_design_scores_gemma":[0.00061783515,0.00024606488,0.0012840308,0.000021018666,0.00005410885,0.000022880782,0.00021580824,0.000083022496,0.0022486814,0.9935726,0.0014072083,0.00022675208],"about_ca_topic_score_codex":0.0000117409845,"about_ca_topic_score_gemma":0.000008286171,"teacher_disagreement_score":0.0019278858,"about_ca_system_score_codex":0.000007570146,"about_ca_system_score_gemma":0.000026635293,"threshold_uncertainty_score":0.72106427},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9687362,0.000017263743,0.0012424554,0.00020381046,0.00013397966,0.000213203,0.000016631744,0.00010167656,0.029334836],"genre_scores_gemma":[0.99596363,0.0000055142536,0.0016851126,0.000026113381,0.00021245694,0.0000023776702,0.000017637116,0.000006364275,0.0020807746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99933356,0.000053036892,0.00013879243,0.0001978937,0.0001388119,0.00013791319],"domain_scores_gemma":[0.9994247,0.0001658645,0.00008298435,0.00016752278,0.000052825108,0.00010609914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000087181776,0.0001050572,0.00012717943,0.00009280215,0.0007147143,0.000036595757,0.000126874,0.000118539625,0.000030016596],"category_scores_gemma":[0.000033275242,0.00011612135,0.000058689635,0.00011077031,0.0002208053,0.00039512376,0.00007895037,0.00016610637,0.000041263258],"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.00008116618,0.00012751158,0.05432775,0.000058362893,0.00015833377,0.000042646257,0.0006147056,0.00007543002,0.012405356,0.92196023,0.009209193,0.0009393195],"study_design_scores_gemma":[0.0038283449,0.00016648795,0.6480928,0.00018677673,0.00048281503,0.00033371733,0.001315585,0.0006617509,0.0056697885,0.10574794,0.23226064,0.0012533464],"about_ca_topic_score_codex":0.00024116228,"about_ca_topic_score_gemma":0.0000073680103,"teacher_disagreement_score":0.8162123,"about_ca_system_score_codex":0.0001228779,"about_ca_system_score_gemma":0.000081618804,"threshold_uncertainty_score":0.5497077},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9718252,0.0007717552,0.023330364,0.000058686594,0.00013717177,0.0005406798,0.000045715016,0.00006318362,0.0032272371],"genre_scores_gemma":[0.9979066,0.0011128618,0.0005499783,0.000016155418,0.000038749546,7.0710234e-7,0.000009418107,0.000018178349,0.00034734845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835086,0.00028480418,0.00040474872,0.00053137646,0.00011196811,0.00031626492],"domain_scores_gemma":[0.9979408,0.00036493485,0.00049844215,0.00058040104,0.00032588013,0.00028957846],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006930172,0.00027331145,0.00048275723,0.00016620001,0.00023470137,0.0000475108,0.00034384322,0.0002118225,0.00005944978],"category_scores_gemma":[0.00019596818,0.00030923195,0.00019440838,0.001114327,0.0005070398,0.00048813908,0.00012364594,0.00021317652,0.000023228618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026517134,0.00051505957,0.01725176,0.00020130385,0.00013412841,0.000019554122,0.0012952917,0.0005534447,0.0006496751,0.97873324,0.000139396,0.00024196802],"study_design_scores_gemma":[0.0054891286,0.0001607565,0.0015736902,0.00018023084,0.00091213675,0.000009874747,0.0028573172,0.014021466,0.002727627,0.9710828,0.00049026136,0.0004946824],"about_ca_topic_score_codex":0.00006359351,"about_ca_topic_score_gemma":0.000018311806,"teacher_disagreement_score":0.026081396,"about_ca_system_score_codex":0.00004636685,"about_ca_system_score_gemma":0.0001238994,"threshold_uncertainty_score":0.999936},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91371465,0.000001033135,0.0026214148,0.00062652107,0.000034443554,0.00009204908,0.0000075763137,0.000020059164,0.08288227],"genre_scores_gemma":[0.9944384,0.0000028933061,0.0036137584,0.000021528396,0.000012798515,3.4023867e-7,0.0000012259886,0.000004636415,0.0019044116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960566,0.00006674759,0.00006930333,0.000093495946,0.000090931564,0.00007389022],"domain_scores_gemma":[0.9991792,0.00034014226,0.00013070527,0.0002753591,0.000049062473,0.000025541867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024232747,0.000055281555,0.000117344935,0.00003715385,0.00012998606,0.0000024074461,0.00018590028,0.00004461631,0.000734606],"category_scores_gemma":[0.000053330365,0.000050559996,0.00008738803,0.00013245746,0.00018679994,0.000046432553,0.000031902247,0.000073859715,0.000080457314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002302061,0.000065184715,0.000249252,0.000023287772,0.00001915937,1.5336546e-7,0.00032223796,0.0000013331079,0.00076791144,0.98989844,0.001861314,0.006768725],"study_design_scores_gemma":[0.0003965039,0.000051380775,0.0026366855,0.000053534714,0.00006771969,0.0000075788503,0.0020169818,0.00038162133,0.0013121348,0.98788476,0.0050964304,0.00009465699],"about_ca_topic_score_codex":0.000022782777,"about_ca_topic_score_gemma":0.000034246863,"teacher_disagreement_score":0.08097786,"about_ca_system_score_codex":0.0000078245575,"about_ca_system_score_gemma":0.000009219879,"threshold_uncertainty_score":0.80434203},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9890486,0.00023861554,0.0074273925,0.0015612603,0.000102143335,0.00025680056,0.0000070768424,0.000011664445,0.001346428],"genre_scores_gemma":[0.9959607,0.00006659299,0.0032141616,0.000032641197,0.00029379112,0.000015182791,0.0000019694146,0.000018059454,0.00039691787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895865,0.00003513242,0.00041492647,0.000101789396,0.000117554584,0.00037192783],"domain_scores_gemma":[0.9988647,0.00018562004,0.00046538337,0.00033076646,0.00009312828,0.00006038945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086402864,0.00010379755,0.0002292536,0.00012487877,0.00037516077,0.000081085906,0.00041921256,0.000056936533,0.00003911713],"category_scores_gemma":[0.00031435615,0.00009187227,0.00019504121,0.00008045634,0.000074880234,0.00023780133,0.00001688514,0.0003339648,0.0000058991873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055017335,0.00013264664,0.0003471709,0.000009877582,0.000059539983,0.0000020328741,0.0002048776,0.0000062543113,0.0014596106,0.99692404,0.0005216428,0.0002772775],"study_design_scores_gemma":[0.000828665,0.00021380087,0.0011404401,0.000025556876,0.000046606536,0.000047686455,0.00006940746,0.000121441495,0.0031425366,0.988182,0.0060824594,0.000099406694],"about_ca_topic_score_codex":0.000003929733,"about_ca_topic_score_gemma":0.00023573317,"teacher_disagreement_score":0.00874206,"about_ca_system_score_codex":0.000058167756,"about_ca_system_score_gemma":0.00022500419,"threshold_uncertainty_score":0.37464425},"labels":[],"label_agreement":null},{"id":"W2964046804","doi":"","title":"On the reciprocal degree distance of graphs with cut vertices or cut edges.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Reciprocal; Degree (music); Combinatorics; Physics","score_opus":0.0821127410272369,"score_gpt":0.29683252418585687,"score_spread":0.21471978315861998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964046804","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9874796,0.000042967327,0.00019318514,0.00045138723,0.0002158706,0.0003360665,0.000007900615,0.00005915953,0.01121382],"genre_scores_gemma":[0.99902225,0.000006048109,0.0003520014,0.00007279868,0.0000039710535,0.00008582747,0.0000018302136,0.000019265477,0.00043600102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991249,0.000083619,0.00019683283,0.00017146576,0.00025887974,0.00016432801],"domain_scores_gemma":[0.99824005,0.0008304606,0.00013817269,0.0005753894,0.00013412177,0.00008179083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038697914,0.00013079667,0.0001812826,0.00003399414,0.00011028995,0.000018358687,0.00034980814,0.000050534458,0.00002663634],"category_scores_gemma":[0.00036673676,0.00007119602,0.000046551402,0.00036586166,0.00020674233,0.000068856425,0.00003574517,0.000146846,0.000024922467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021688215,0.00025133096,0.0004105128,0.000022149678,0.000035275545,0.0000020817192,0.00051764195,9.0700274e-7,0.000025726882,0.991216,0.0070981123,0.00020337384],"study_design_scores_gemma":[0.00059177435,0.00026269574,0.0001403502,0.00007251072,0.000043626,0.0000032057255,0.0003801226,0.000020293906,0.0045197937,0.9923191,0.0015361918,0.000110333596],"about_ca_topic_score_codex":0.0000065065656,"about_ca_topic_score_gemma":0.000044216493,"teacher_disagreement_score":0.011542615,"about_ca_system_score_codex":0.000019371771,"about_ca_system_score_gemma":0.00005696987,"threshold_uncertainty_score":0.29032895},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36251143,0.00009427056,0.630455,0.0005683122,0.0006361078,0.002422773,0.0012097957,0.000058627116,0.0020436542],"genre_scores_gemma":[0.6016599,0.00013481415,0.39681962,0.000094328105,0.00026219455,0.000031893116,0.0003707205,0.00013224209,0.0004943028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968986,0.00020632973,0.0014794267,0.00044397954,0.000565566,0.00040609296],"domain_scores_gemma":[0.99377936,0.0014171366,0.0019408003,0.0022624787,0.0003876172,0.00021263046],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022136522,0.00040177008,0.00075663225,0.00023517878,0.00024201185,0.00025121076,0.0013019656,0.00022804408,0.000752034],"category_scores_gemma":[0.0007611204,0.00034167513,0.00027195865,0.00030749157,0.00009077892,0.00075821683,0.00012284229,0.00040082895,0.00008455885],"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.0003144938,0.002273649,0.00017155595,0.0026109742,0.0005329992,0.0000019964282,0.0036642684,0.033685185,0.004059231,0.95078766,0.0010735407,0.0008244584],"study_design_scores_gemma":[0.0012722722,0.0009126308,0.00002385922,0.0007573431,0.00051622523,0.00005581332,0.0016429177,0.50927603,0.001556254,0.48311642,0.00046512278,0.00040513198],"about_ca_topic_score_codex":9.771787e-7,"about_ca_topic_score_gemma":0.0000021589037,"teacher_disagreement_score":0.47559083,"about_ca_system_score_codex":0.000058338544,"about_ca_system_score_gemma":0.00011622031,"threshold_uncertainty_score":0.9999035},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9290619,0.0020379184,0.0033891555,0.001205925,0.0050567784,0.00050601433,0.004421725,0.0014232035,0.052897412],"genre_scores_gemma":[0.95839256,0.003848919,0.01139985,0.0026413319,0.0037338382,0.0059298594,0.009515378,0.0038818158,0.00065644016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9672865,0.0015336538,0.008917607,0.006351681,0.007962012,0.007948518],"domain_scores_gemma":[0.9694741,0.006893373,0.010492287,0.008497077,0.00089687743,0.0037462863],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.0073019736,0.0045459224,0.002273643,0.0023425394,0.0054027825,0.0048145824,0.008416306,0.008188242,0.020731661],"category_scores_gemma":[0.005816179,0.0072904257,0.0070852973,0.0046217632,0.0056745065,0.005245565,0.0072645545,0.006819361,0.00890239],"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.002642178,0.0027879404,0.000051902636,0.008186872,0.005859398,0.002072178,0.009594449,0.003154992,0.009724852,0.92813975,0.0264168,0.0013686881],"study_design_scores_gemma":[0.0057189646,0.003884943,0.00015950757,0.0076085483,0.007885371,0.004078012,0.010112174,0.5988349,0.3397602,0.0073628617,0.007828473,0.0067660552],"about_ca_topic_score_codex":0.0026769163,"about_ca_topic_score_gemma":0.002407151,"teacher_disagreement_score":0.9207769,"about_ca_system_score_codex":0.00013568359,"about_ca_system_score_gemma":0.0040010256,"threshold_uncertainty_score":0.99703145},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96588767,0.00040357484,0.022252474,0.0015480992,0.000039357725,0.0044352273,0.00024748378,0.00017812465,0.005007998],"genre_scores_gemma":[0.9875018,0.000083540726,0.0099950135,0.0002343003,0.00006378012,0.0012387953,0.00007205688,0.000040679035,0.0007700461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990156,0.000036424375,0.00027961956,0.00035329076,0.00009491584,0.00022010804],"domain_scores_gemma":[0.99829435,0.00096599676,0.00014313473,0.00040289655,0.00007801626,0.00011561779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023865113,0.0002070679,0.0002884975,0.000069995265,0.00032555746,0.000046148874,0.00017863559,0.00012254927,0.00008584021],"category_scores_gemma":[0.000051913652,0.0001746455,0.00008008799,0.00025270888,0.00012729877,0.0001044625,0.00005934474,0.00015542499,0.00005889337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009971313,0.00008194354,0.00013406445,0.00019392188,0.000055800203,7.8100356e-8,0.0008405298,0.0000010345913,0.0022192004,0.9950344,0.00044885278,0.0009802285],"study_design_scores_gemma":[0.00068230275,0.0000689704,0.0003485284,0.000039138486,0.00010246149,0.000014780667,0.0007004053,0.0016612455,0.0027587255,0.98551625,0.007859339,0.00024785212],"about_ca_topic_score_codex":0.0000026267037,"about_ca_topic_score_gemma":0.0000049910245,"teacher_disagreement_score":0.021614127,"about_ca_system_score_codex":0.000008786545,"about_ca_system_score_gemma":0.00002209528,"threshold_uncertainty_score":0.71218365},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9991845,0.000046282174,0.00007201581,0.000032893156,0.00015203381,0.00021577609,0.00001547016,0.000076547105,0.00020447417],"genre_scores_gemma":[0.9982214,0.00006948031,0.0016091579,0.000001928468,0.000009164251,0.000015845491,8.580353e-7,0.000009141046,0.00006302703],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99909556,0.00001375568,0.00030241243,0.00018480697,0.0002002944,0.0002031474],"domain_scores_gemma":[0.9993371,0.000029280242,0.00012013848,0.00026066214,0.00020780104,0.000045068537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046139423,0.00012090248,0.00029990636,0.0001478033,0.00005959811,0.000050787163,0.00025047138,0.00003862732,0.00006747627],"category_scores_gemma":[0.0001531518,0.000098550554,0.000021751726,0.00040252958,0.00033490628,0.00037212306,0.000080433485,0.00003735903,0.000003337272],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072891426,0.000013650101,0.00010352031,0.0003349629,0.0000045934435,1.12780626e-7,0.00038001285,0.000013422128,0.79577243,0.20334071,0.0000014167165,0.000027896105],"study_design_scores_gemma":[0.00008718898,0.00003924679,0.0021607,0.00019696166,0.000010499838,0.000005409258,0.00027003713,0.000068841524,0.98748523,0.009527818,0.00002809987,0.00011994409],"about_ca_topic_score_codex":0.00001870906,"about_ca_topic_score_gemma":0.0000010848901,"teacher_disagreement_score":0.19381289,"about_ca_system_score_codex":0.0000059696426,"about_ca_system_score_gemma":0.000057721583,"threshold_uncertainty_score":0.40187752},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9287074,0.000083377185,0.0017702922,0.000099162084,0.0003095485,0.00030533678,0.000026863356,0.00014784173,0.06855014],"genre_scores_gemma":[0.9898457,0.00006771499,0.0016651548,0.000009528775,0.00007048952,0.0000037518996,0.00001132839,0.000014674564,0.008311659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856925,0.00014218412,0.0003326097,0.00032557623,0.00036549816,0.00026490906],"domain_scores_gemma":[0.9983667,0.0004670952,0.00027649174,0.0005246534,0.00023698233,0.00012806385],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00018525842,0.00020371859,0.00024831612,0.00022742798,0.002514373,0.000026024936,0.0005037103,0.0001043718,0.000028055221],"category_scores_gemma":[0.00013497783,0.00017884088,0.00021972465,0.0006999884,0.0016599774,0.00022492002,0.0000897124,0.00025973914,0.000024523255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089578134,0.00017861817,0.00663424,0.000023179331,0.00011023406,0.000190973,0.00015850768,0.000026109303,0.008631455,0.9834377,0.00046857583,0.000050807343],"study_design_scores_gemma":[0.0056755953,0.00047426508,0.18078011,0.0006229027,0.0009622927,0.0051785987,0.0025606407,0.0007445982,0.086147435,0.46771476,0.2468024,0.0023363845],"about_ca_topic_score_codex":0.000058330435,"about_ca_topic_score_gemma":0.000044153567,"teacher_disagreement_score":0.51572293,"about_ca_system_score_codex":0.00012334032,"about_ca_system_score_gemma":0.0002945218,"threshold_uncertainty_score":0.99878424},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9696546,0.0034388273,0.019374877,0.001124722,0.000076202654,0.0019920834,0.00022354112,0.00032281425,0.003792292],"genre_scores_gemma":[0.9849204,0.0019297265,0.010840912,0.00012210934,0.00020557572,0.0012477176,0.00014247523,0.000060399878,0.00053069147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808395,0.00011242001,0.00047800675,0.00080348324,0.00023264598,0.00028952144],"domain_scores_gemma":[0.9976656,0.0006597876,0.00028327547,0.0009667465,0.00022283757,0.00020174272],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047996038,0.00039385477,0.0004914849,0.0001786399,0.00046007952,0.00019065029,0.00042645758,0.0003943896,0.000048547125],"category_scores_gemma":[0.00016281707,0.00038045534,0.00014453595,0.0004442581,0.00024280894,0.00015010012,0.0012047417,0.0007338295,0.000019048088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005064294,0.00018845225,0.0005448796,0.0003687644,0.000081928665,0.0000013681384,0.0004029556,0.0000041930316,0.0008312969,0.9944824,0.00013064998,0.002958037],"study_design_scores_gemma":[0.0001878432,0.00002079842,0.0012722855,0.00012016913,0.00021211889,0.000052639938,0.00039119515,0.00095286197,0.001451124,0.9929716,0.0019201059,0.0004472849],"about_ca_topic_score_codex":0.00002597392,"about_ca_topic_score_gemma":0.000092736955,"teacher_disagreement_score":0.015265753,"about_ca_system_score_codex":0.000020337307,"about_ca_system_score_gemma":0.00010567436,"threshold_uncertainty_score":0.99986476},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8247571,0.000038483486,0.17267092,0.000027496346,0.00015647797,0.0014653241,0.00023544778,0.00003193869,0.00061678997],"genre_scores_gemma":[0.99099594,0.00023100755,0.007824788,0.0000045024126,0.000024015544,0.000011721526,0.000055433204,0.000040446193,0.00081214576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980482,0.00014113954,0.0006367364,0.0007650808,0.00009211739,0.00031671464],"domain_scores_gemma":[0.9954747,0.001370132,0.0015323609,0.0008662635,0.00060597307,0.00015058162],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050311134,0.00043055552,0.0007863516,0.00037819488,0.00030185233,0.000022220765,0.0004942532,0.0006208786,0.000055053762],"category_scores_gemma":[0.00031241178,0.0005099242,0.00042390058,0.0005401585,0.0010090946,0.00031175776,0.0003730287,0.000587118,0.0000027339368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065031514,0.00020259483,0.012062001,0.0011004724,0.00029273308,0.0000026944547,0.0019643551,0.024002127,0.0010586678,0.95850366,0.000028895256,0.00013149841],"study_design_scores_gemma":[0.0012598274,0.00023988912,0.0067025307,0.00039162632,0.0007258228,0.0000034100542,0.0017466695,0.04935181,0.002832584,0.9362912,0.00005119032,0.0004034142],"about_ca_topic_score_codex":0.00008710579,"about_ca_topic_score_gemma":0.000280996,"teacher_disagreement_score":0.16623881,"about_ca_system_score_codex":0.000030335443,"about_ca_system_score_gemma":0.00011733455,"threshold_uncertainty_score":0.99973524},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78145254,0.0001213657,0.2089477,0.00004758299,0.0004343527,0.00082716317,0.00011207736,0.00030573894,0.0077514737],"genre_scores_gemma":[0.9948737,0.00007038774,0.00049114245,0.000026796031,0.00007467953,0.0000023615141,0.000026995467,0.00003595693,0.004397973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861455,0.00009658376,0.00020200209,0.0006965973,0.000078544195,0.00031170144],"domain_scores_gemma":[0.99782395,0.0005482243,0.0003284396,0.001069649,0.00010723004,0.00012252072],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022300714,0.0002922627,0.00037031627,0.0004346904,0.00013333975,0.000046975314,0.0007905574,0.00029224402,0.00017800838],"category_scores_gemma":[0.0001118912,0.00032650132,0.00027660764,0.0008434197,0.00008255378,0.000084042214,0.00062105217,0.00053425075,0.00052149314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022080776,0.00013984973,0.00037016915,0.0001783494,0.00009684055,0.000014008721,0.000057745365,0.033982527,0.000010507312,0.9640837,0.0009869076,0.000057330486],"study_design_scores_gemma":[0.00034641998,0.000019002531,0.0001998829,0.00008229764,0.00032691943,0.0000023653852,0.00011795977,0.024307251,0.000027161585,0.9737952,0.00040020797,0.00037533705],"about_ca_topic_score_codex":0.000022132648,"about_ca_topic_score_gemma":0.0000060839848,"teacher_disagreement_score":0.21342115,"about_ca_system_score_codex":0.000112778034,"about_ca_system_score_gemma":0.00008139404,"threshold_uncertainty_score":0.9999187},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9910289,0.00092874287,0.0033233627,0.0005585582,0.00011910592,0.00027683802,0.0000267188,0.000012290695,0.0037254675],"genre_scores_gemma":[0.9963797,0.00020855835,0.000982203,0.00006350613,0.00006561178,0.0000049932773,0.0000017262558,0.000012934104,0.0022807892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885666,0.00020615513,0.0005724219,0.0001016252,0.00014131708,0.00012181574],"domain_scores_gemma":[0.99784184,0.0009859288,0.00056267675,0.00026976338,0.00025323307,0.000086587126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001612732,0.00009838684,0.00027795916,0.00013826301,0.00008973896,0.000018078554,0.00020577858,0.00010394947,0.00046784067],"category_scores_gemma":[0.00035066978,0.000077454126,0.000113206435,0.0001750307,0.00007031193,0.00015731607,0.000024674171,0.00026785498,0.000019317278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008142481,0.00023830013,0.00017171862,0.000060373535,0.00007241719,2.7754788e-7,0.0004926397,0.000014268648,0.0384755,0.9594141,0.0005063747,0.00047256952],"study_design_scores_gemma":[0.00069938274,0.0001286469,0.002554327,0.0001368808,0.00016955993,0.000035873087,0.0009052696,0.00007941881,0.030201042,0.95782447,0.007118671,0.00014646977],"about_ca_topic_score_codex":3.8532016e-7,"about_ca_topic_score_gemma":3.8717985e-7,"teacher_disagreement_score":0.008274457,"about_ca_system_score_codex":0.000012451766,"about_ca_system_score_gemma":0.000063672116,"threshold_uncertainty_score":0.51225275},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95409364,0.000053193056,0.032710128,0.0008138474,0.0025443817,0.00045169576,0.0000039619463,0.000017902361,0.00931124],"genre_scores_gemma":[0.9942539,0.000017614959,0.005561164,0.000040262206,0.00004255105,0.0000029154953,8.6843073e-7,0.0000121441435,0.00006858254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894917,0.000110650726,0.0004573835,0.00007363,0.00031586987,0.000093312934],"domain_scores_gemma":[0.9980345,0.0006453617,0.00067821104,0.00026045195,0.00033786945,0.000043613556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008610692,0.00008394883,0.00020063086,0.00012913876,0.0000750022,0.000020192208,0.00026285916,0.000060130187,0.00015193013],"category_scores_gemma":[0.0005992415,0.000055178214,0.00013802775,0.00038768398,0.00004318056,0.000117189215,0.00001664341,0.00016105369,0.000007715928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000618889,0.00028194571,0.00008098141,0.000014699808,0.000018442026,2.0454392e-7,0.00015514535,0.020232007,0.0005117627,0.97643894,0.0021804944,0.000023499702],"study_design_scores_gemma":[0.0006286817,0.0003066337,0.000020837157,0.00005365447,0.000040728788,0.000005326279,0.00007822852,0.0009694965,0.0026238963,0.9951186,0.000095235286,0.0000586803],"about_ca_topic_score_codex":7.261959e-7,"about_ca_topic_score_gemma":1.9858641e-8,"teacher_disagreement_score":0.04016025,"about_ca_system_score_codex":0.00001869363,"about_ca_system_score_gemma":0.000067404646,"threshold_uncertainty_score":0.22501023},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9864666,0.0000060844613,0.00024934224,0.0014372775,0.00007534321,0.00018820267,0.000010497907,0.00017432505,0.011392339],"genre_scores_gemma":[0.9994668,0.000004942841,0.00012908093,0.000105696425,0.000006383314,0.000042897052,0.0000018496233,0.000011756946,0.00023058668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993866,0.00007770954,0.000116251664,0.00011617958,0.00014865423,0.0001546135],"domain_scores_gemma":[0.9976207,0.0017874971,0.000039005747,0.00039144928,0.00012373758,0.00003757928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035995457,0.00007525576,0.00012351347,0.00004449745,0.00016937895,0.000008460456,0.00017409021,0.000037763944,0.00005180383],"category_scores_gemma":[0.0006017884,0.000045687982,0.000053383024,0.00045742502,0.0001244508,0.000020665586,0.000044161585,0.00012491939,0.00012871105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013327988,0.00026625296,0.0005085496,0.00003209945,0.000011088942,0.0000023239568,0.00012625518,4.048831e-8,0.00008310626,0.98668855,0.0122581655,0.0000102296735],"study_design_scores_gemma":[0.00012840872,0.00011027603,0.001206653,0.00002235401,0.000018948336,0.0000010489525,0.00007672643,0.000022236685,0.0022439058,0.99518996,0.00091956276,0.00005991386],"about_ca_topic_score_codex":0.000001229999,"about_ca_topic_score_gemma":8.323784e-7,"teacher_disagreement_score":0.013000218,"about_ca_system_score_codex":0.0000069192615,"about_ca_system_score_gemma":0.000011507362,"threshold_uncertainty_score":0.18631019},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9845121,0.000046538524,0.010958135,0.0002421729,0.00012935733,0.000040353683,0.000008686219,0.000005300987,0.0040573836],"genre_scores_gemma":[0.99927586,0.000017090184,0.00022633625,0.000034664725,0.00037950967,0.0000017474168,0.0000017722983,0.000008281245,0.00005476271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909705,0.00003792704,0.00036438394,0.00009037266,0.00032682891,0.00008343611],"domain_scores_gemma":[0.9987465,0.00031269633,0.00046584624,0.00010733685,0.00029734857,0.00007024569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038608303,0.000090593945,0.000196715,0.00008600021,0.000024754165,0.000020528685,0.00027973505,0.0000710745,0.00014830253],"category_scores_gemma":[0.00044315655,0.00008329088,0.00012475654,0.000090505884,0.0000997609,0.00006842722,0.000043045413,0.00018752819,7.03568e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012788754,0.0013876298,0.054382112,0.00032806973,0.0012648279,0.00008902092,0.00074061286,0.00016150135,0.3582126,0.5552969,0.002057852,0.024800023],"study_design_scores_gemma":[0.0016698592,0.000020267209,0.0021512304,0.00007451297,0.00004117709,0.00018360125,0.00006265595,0.00016354321,0.14378102,0.85073644,0.0010144636,0.000101207166],"about_ca_topic_score_codex":0.0000018743882,"about_ca_topic_score_gemma":6.6109334e-7,"teacher_disagreement_score":0.29543957,"about_ca_system_score_codex":0.000023933444,"about_ca_system_score_gemma":0.000036012847,"threshold_uncertainty_score":0.33965036},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9457227,0.000062819956,0.0059770923,0.000101572165,0.00015551902,0.00074022776,0.000029465742,0.000055803124,0.047154807],"genre_scores_gemma":[0.99776363,0.000004306702,0.0006904449,0.000026254136,0.00003186099,0.000054545122,0.0000046653195,0.000008446215,0.001415828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992709,0.000071922004,0.00027424874,0.00012251873,0.000083711275,0.00017668445],"domain_scores_gemma":[0.9990438,0.00047155822,0.00008350661,0.0003456538,0.000027663827,0.000027801249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035953577,0.00006428267,0.00018888207,0.00006636401,0.000031399435,0.000008742668,0.000106433086,0.00004087426,0.00023310237],"category_scores_gemma":[0.000030615134,0.00005681081,0.00007423428,0.0003228667,0.000022212538,0.00005171128,0.000013304182,0.00007628013,0.00005116956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000976571,0.00010956895,0.03917611,0.000028425711,0.00002202762,4.1937952e-7,0.000104596395,0.00044784608,0.00047170193,0.9573984,0.0022286256,0.0000024855485],"study_design_scores_gemma":[0.0013446893,0.00003122471,0.018497193,0.000055980687,0.000033664095,0.0000036881972,0.00094306277,0.0026058068,0.00029184483,0.9753144,0.00074685575,0.00013162756],"about_ca_topic_score_codex":0.000041106276,"about_ca_topic_score_gemma":0.000076185235,"teacher_disagreement_score":0.052040957,"about_ca_system_score_codex":0.000007064754,"about_ca_system_score_gemma":0.000012502679,"threshold_uncertainty_score":0.25523075},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94168335,0.0010343643,0.0004184837,0.00011786413,0.0008786334,0.0012234518,0.00048797246,0.00011943835,0.054036457],"genre_scores_gemma":[0.99079645,0.0004096491,0.0071205115,0.000013475848,0.00086418254,0.00006346414,0.00006285339,0.000057914913,0.0006115274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997691,0.00013738373,0.001011964,0.0004413282,0.0004570885,0.00026124087],"domain_scores_gemma":[0.99652946,0.00066554814,0.001551789,0.00092516624,0.00025634345,0.000071690774],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044911398,0.00036048304,0.0009387858,0.0006198115,0.000064459084,0.00003364988,0.0008915035,0.00042106243,0.00068678695],"category_scores_gemma":[0.00011042114,0.00032523266,0.00045270458,0.00075344805,0.00017146194,0.00008254977,0.0004289867,0.0003723194,0.00006028956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001286302,0.0003977004,0.0013367006,0.002675503,0.0002452947,0.0000022384454,0.00090950745,0.00001772207,0.0015315586,0.98663855,0.0050971652,0.0010194384],"study_design_scores_gemma":[0.00034232892,0.00006991837,0.00070250453,0.00028468456,0.00035163254,0.0000014525056,0.00026590592,0.000032714368,0.008111074,0.9869268,0.0025584567,0.0003525093],"about_ca_topic_score_codex":0.000082141996,"about_ca_topic_score_gemma":0.00004290748,"teacher_disagreement_score":0.05342493,"about_ca_system_score_codex":0.000022985134,"about_ca_system_score_gemma":0.00011490705,"threshold_uncertainty_score":0.99991995},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9491748,0.000021449096,0.00005287594,0.0001969549,0.00004549669,0.0006592448,0.000026590254,0.00002367846,0.049798917],"genre_scores_gemma":[0.9954011,0.000023908493,0.0038914823,0.00005060062,0.00019327195,0.00009454892,0.0000045554375,0.000008982764,0.00033158157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921435,0.00009551667,0.00025147814,0.00013604453,0.0001532201,0.00014939305],"domain_scores_gemma":[0.99915886,0.0003554732,0.00013160678,0.00030070034,0.000031629857,0.00002172118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000464231,0.000083854255,0.00014921495,0.000110454326,0.00007928083,0.00001793037,0.00027460948,0.000048353242,0.0004478822],"category_scores_gemma":[0.000034894896,0.00006037796,0.0000857008,0.00064373954,0.000062721156,0.00009440087,0.00003294289,0.00011987994,0.00013269931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018621155,0.00030992055,0.008258304,0.00009426742,0.000011907374,6.5162664e-7,0.0019376763,0.000047609265,0.0008947967,0.98535264,0.0028837027,0.00018988401],"study_design_scores_gemma":[0.00028963303,0.000034744542,0.0046504447,0.000024653746,0.000026406155,0.0000016179749,0.0011715819,0.000028217259,0.0006211217,0.98531985,0.007741964,0.00008973286],"about_ca_topic_score_codex":0.00007638744,"about_ca_topic_score_gemma":0.0005680763,"teacher_disagreement_score":0.049467336,"about_ca_system_score_codex":0.000009214777,"about_ca_system_score_gemma":0.00001810559,"threshold_uncertainty_score":0.4903996},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9889413,0.0024593777,0.00045440363,0.0031746232,0.00013152909,0.0009028405,0.0001236169,0.000047583544,0.003764703],"genre_scores_gemma":[0.995219,0.0024055927,0.0007696874,0.0011378616,0.00015084319,0.00012783533,0.000008205115,0.000046000616,0.00013500876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769753,0.00030950803,0.00089524314,0.00031794872,0.00052122097,0.00025857636],"domain_scores_gemma":[0.99643433,0.0014487472,0.00094478874,0.00070605136,0.00026493374,0.00020114661],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010815373,0.0002595609,0.00057407055,0.0002612073,0.00038058305,0.0002689526,0.002926876,0.00008704859,0.00378735],"category_scores_gemma":[0.0010010736,0.0001909041,0.0003072699,0.0013851124,0.00020482528,0.00064365735,0.00046228545,0.00041367667,0.00002190307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010140846,0.00051113224,0.03891683,0.00013259426,0.00023875551,0.000004378419,0.00077999657,0.00010575122,0.08171856,0.82841814,0.04852427,0.000548182],"study_design_scores_gemma":[0.00027209678,0.000017223283,0.09070769,0.00022728377,0.00012126466,0.000002148021,0.0002548433,0.000045664732,0.027694462,0.87811935,0.0022943297,0.00024366585],"about_ca_topic_score_codex":0.00006397626,"about_ca_topic_score_gemma":0.000012919192,"teacher_disagreement_score":0.054024097,"about_ca_system_score_codex":0.000019824543,"about_ca_system_score_gemma":0.000094400246,"threshold_uncertainty_score":0.9971233},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9851291,0.0029025124,0.00022803123,0.00006368385,0.00015958032,0.0007014149,0.00007909241,0.000032916716,0.010703673],"genre_scores_gemma":[0.996982,0.0012124978,0.0012575737,0.00004763146,0.000028643803,0.000032103824,0.000008795468,0.00004467283,0.00038609284],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973575,0.00025865852,0.001234813,0.00030743884,0.0005681597,0.00027343538],"domain_scores_gemma":[0.9959159,0.0009639909,0.0017933528,0.00076250883,0.00041769198,0.00014659538],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013152461,0.00026930426,0.0009711196,0.0009286532,0.00010500588,0.0001488219,0.0023627114,0.0001326047,0.00824101],"category_scores_gemma":[0.00020150622,0.00022948628,0.0003158413,0.0016549303,0.00017095021,0.00096543634,0.00042984105,0.0002469273,0.000021571508],"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.00038538684,0.001152597,0.22408019,0.0008832811,0.00056837394,0.0000051351913,0.0006159473,0.00002150978,0.5593451,0.1969289,0.013338823,0.0026747421],"study_design_scores_gemma":[0.0007135617,0.00002473543,0.05990217,0.00050781836,0.0001955709,0.000005437765,0.00019838454,0.000042580825,0.2097048,0.72702247,0.0013463127,0.00033617974],"about_ca_topic_score_codex":0.00015437145,"about_ca_topic_score_gemma":0.000018009327,"teacher_disagreement_score":0.53009355,"about_ca_system_score_codex":0.00001933146,"about_ca_system_score_gemma":0.000074553776,"threshold_uncertainty_score":0.9926656},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8766687,0.000440421,0.12203481,0.00015720351,0.00019038872,0.0003401,0.000021265296,0.000005940966,0.00014118187],"genre_scores_gemma":[0.9997152,0.00011439922,0.000042049334,0.000007807702,0.000047526457,0.000006762206,0.0000029222974,0.000011701921,0.000051619318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986707,0.0001296076,0.0006332736,0.000066407876,0.00023438345,0.00026560386],"domain_scores_gemma":[0.9971679,0.00087747164,0.0009747788,0.00026116776,0.000681839,0.00003685479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024287826,0.00009874464,0.00036429174,0.00007034822,0.00012117555,0.0000068013287,0.00040003745,0.00005483852,0.000009418957],"category_scores_gemma":[0.000506525,0.00006709683,0.00024422555,0.00037659795,0.00021507582,0.000053006173,0.000021045993,0.00017568268,7.909372e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055967143,0.00033225454,0.0000358542,0.000029678527,0.00011663679,6.83679e-8,0.0001825875,0.0000038578874,0.0031355852,0.9944622,0.00097492617,0.0001666896],"study_design_scores_gemma":[0.002871312,0.00069340266,0.000056596047,0.000035608875,0.00021007253,0.000014713082,0.00007513403,0.000046262627,0.058115453,0.93667656,0.0011474708,0.000057437206],"about_ca_topic_score_codex":0.0000014999775,"about_ca_topic_score_gemma":0.0000011681757,"teacher_disagreement_score":0.123046525,"about_ca_system_score_codex":0.00005623811,"about_ca_system_score_gemma":0.00016287675,"threshold_uncertainty_score":0.27361292},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99538976,0.00023303245,0.0019411158,0.0007967799,0.00021654773,0.00013382845,0.0000013015015,0.000013479251,0.0012741603],"genre_scores_gemma":[0.99960095,0.00012309158,0.000078941935,0.00001913704,0.000040271694,0.0000047049803,8.665768e-7,0.00001542624,0.000116635856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882376,0.000121304794,0.00046519644,0.00006905631,0.00026840725,0.00025225666],"domain_scores_gemma":[0.9980254,0.00052779773,0.0006430916,0.00041737038,0.0003332171,0.000053080905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017510569,0.000103261205,0.00021199753,0.00012608262,0.0001255943,0.0000111986155,0.00057752844,0.000075355274,0.000020563266],"category_scores_gemma":[0.00023052485,0.00007034695,0.00015127471,0.00048625408,0.00013495651,0.000086923435,0.000023526187,0.0009532086,0.000002813979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002674974,0.00022580802,0.00023990839,0.00001234067,0.000061320374,4.6526546e-7,0.00024474625,9.073415e-7,0.015337163,0.9832911,0.00033262963,0.00022685132],"study_design_scores_gemma":[0.00038209718,0.00017193967,0.00096111366,0.0000112365,0.00010506858,0.00008374623,0.00023507256,0.000022267648,0.0053874566,0.99100655,0.0015638976,0.00006954578],"about_ca_topic_score_codex":0.0000028078255,"about_ca_topic_score_gemma":0.000012224112,"teacher_disagreement_score":0.0099497065,"about_ca_system_score_codex":0.00003559921,"about_ca_system_score_gemma":0.00021130775,"threshold_uncertainty_score":0.414127},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9982899,0.0003054402,0.0005236687,0.00028133558,0.00019435037,0.00017910771,0.0000048081324,0.000012913004,0.00020851403],"genre_scores_gemma":[0.999708,0.00016278616,0.000004056858,0.000020312316,0.000007526237,0.000002497823,0.000004937039,0.000013875465,0.000076021235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989071,0.00012568301,0.0003646906,0.00008998681,0.00022834736,0.00028423202],"domain_scores_gemma":[0.99835026,0.0009979816,0.0003152012,0.00017968527,0.00009910223,0.00005778988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051477,0.00013609648,0.0002559565,0.00016147853,0.00013111097,0.000022052543,0.00023492951,0.00006769458,0.000067122026],"category_scores_gemma":[0.000065495435,0.0000893108,0.000103929655,0.0003436517,0.00006034396,0.00014260045,0.000024924086,0.00072130415,0.000004767674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023388935,0.00020540551,0.019869424,0.000007795459,0.00007346329,6.375666e-7,0.00031174143,0.000008658869,0.00086024555,0.97849923,0.00013549546,0.000004509405],"study_design_scores_gemma":[0.000660742,0.00019773695,0.021322517,0.000023092107,0.00004642731,0.0000420417,0.00045569157,0.00006315003,0.0003918741,0.9761884,0.000512404,0.00009588291],"about_ca_topic_score_codex":0.000007365856,"about_ca_topic_score_gemma":0.000006840129,"teacher_disagreement_score":0.0023107931,"about_ca_system_score_codex":0.00012640195,"about_ca_system_score_gemma":0.00010777424,"threshold_uncertainty_score":0.36419886},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90638274,0.0019407159,0.053430077,0.02237609,0.000030305124,0.0028134312,0.00021460599,0.00068245025,0.012129575],"genre_scores_gemma":[0.9920392,0.00020407785,0.0057157953,0.0010521412,0.00020430432,0.0003632594,0.000026488477,0.000023299935,0.00037142562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993258,0.000025143887,0.00019223204,0.00025634954,0.00007645383,0.00012401273],"domain_scores_gemma":[0.99938226,0.00017039919,0.000060828428,0.00017662838,0.000044444758,0.00016544224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008523649,0.000114842944,0.00013830664,0.000027163771,0.00028158573,0.000035028475,0.0001049494,0.000058677382,0.000065983055],"category_scores_gemma":[0.00006830324,0.000106840955,0.000030094878,0.00020513765,0.000064888925,0.00008436131,0.00005399612,0.00010682682,0.00008729103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037709892,0.00003487585,0.00009210224,0.00004625324,0.000018425882,1.7236538e-7,0.000564622,4.788879e-7,0.002296884,0.9945384,0.0008360511,0.0015679537],"study_design_scores_gemma":[0.0004100199,0.000060876406,0.00037556104,0.000012532687,0.00013009856,0.000011036578,0.00047861383,0.0031782477,0.008724845,0.8464411,0.13985072,0.0003263652],"about_ca_topic_score_codex":9.0118954e-7,"about_ca_topic_score_gemma":0.0000028580691,"teacher_disagreement_score":0.14809734,"about_ca_system_score_codex":0.0000026977498,"about_ca_system_score_gemma":0.000013078267,"threshold_uncertainty_score":0.43568477},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9875292,0.00013224795,0.0046167397,0.0035107944,0.000103437254,0.0012412313,0.00016983152,0.00006351287,0.0026329814],"genre_scores_gemma":[0.9975002,0.000021163238,0.0019325527,0.00007025681,0.000069691974,0.000038764447,0.000009226895,0.00002371251,0.00033442414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983593,0.00019589896,0.00063510967,0.00022231795,0.000353775,0.00023356768],"domain_scores_gemma":[0.9967144,0.0014768819,0.0005663183,0.0011304788,0.00008822043,0.000023686982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006821706,0.0001699895,0.00032889133,0.000049163536,0.00015434985,0.000021173402,0.00069528515,0.00006588533,0.00045146223],"category_scores_gemma":[0.00023858441,0.00008475975,0.00024020136,0.0009685894,0.00014096529,0.00009442057,0.00016715484,0.00014524373,0.000038896636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042807693,0.00016498294,0.009052134,0.000072762356,0.000103469436,5.1612872e-8,0.0040618377,0.000114495415,0.023856612,0.9605033,0.00196993,0.000057660018],"study_design_scores_gemma":[0.00027687577,0.00004250833,0.010834114,0.00009028227,0.00012891516,9.024481e-7,0.0019549911,0.0006444052,0.087157436,0.8978061,0.0009434105,0.00012007304],"about_ca_topic_score_codex":0.0010146959,"about_ca_topic_score_gemma":0.00061842,"teacher_disagreement_score":0.063300826,"about_ca_system_score_codex":0.000014407913,"about_ca_system_score_gemma":0.00004130786,"threshold_uncertainty_score":0.4943195},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99031657,0.000331832,0.0053546927,0.002596334,0.0000045562665,0.0006884317,0.00015704114,0.000033248165,0.0005172687],"genre_scores_gemma":[0.99858093,0.00022990735,0.00065769366,0.00021825943,0.000018669049,0.00024413444,0.000009337142,0.000009139655,0.00003191118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933976,0.000034483837,0.00025653213,0.00017153483,0.00010746332,0.000090197114],"domain_scores_gemma":[0.9989983,0.00053733314,0.00012160159,0.00020842836,0.00007252271,0.00006184407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000098341894,0.000102173726,0.00017176314,0.000040765743,0.00014306452,0.000007715869,0.00016541638,0.000031723976,0.000040494135],"category_scores_gemma":[0.00006364406,0.0000712715,0.00004706027,0.00030306508,0.000102489976,0.000021035012,0.00006282494,0.00008060163,0.0000034332893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007225242,0.00008335771,0.000039370854,0.00008613113,0.000027724469,2.5059482e-8,0.0004925911,0.000003562988,0.015795875,0.9830649,0.00011804704,0.00028117004],"study_design_scores_gemma":[0.00023603506,0.00009874954,0.0010112355,0.0000303688,0.000073316754,9.959308e-7,0.0004099374,0.0010462974,0.057231043,0.9389094,0.00083640794,0.000116179646],"about_ca_topic_score_codex":0.0000024581364,"about_ca_topic_score_gemma":0.000002813921,"teacher_disagreement_score":0.044155486,"about_ca_system_score_codex":0.0000011567822,"about_ca_system_score_gemma":0.000008227278,"threshold_uncertainty_score":0.29063672},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93184805,0.0005570118,0.046195157,0.011139071,0.000018177765,0.0014970258,0.00016113615,0.00028073794,0.00830364],"genre_scores_gemma":[0.9951984,0.00016289577,0.0033143815,0.00048867945,0.00011716616,0.00032872893,0.000030594652,0.000024788691,0.00033432918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999049,0.000040326715,0.00027994765,0.00032256547,0.00012905335,0.00017910014],"domain_scores_gemma":[0.9990605,0.00040413093,0.00008063766,0.00025802146,0.000047779617,0.00014892152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000083860716,0.00014094966,0.00019496346,0.000034462533,0.00014397987,0.000028592893,0.00019588527,0.00007556372,0.00016625324],"category_scores_gemma":[0.00012202732,0.00013251117,0.00003534564,0.0007456071,0.00003907363,0.00005942211,0.000052157582,0.00022672492,0.00016748007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018906478,0.0003023285,0.00024770634,0.000070721464,0.000014297581,3.0421953e-7,0.0002537181,0.00000754594,0.00090060395,0.99722815,0.00039194833,0.0005638029],"study_design_scores_gemma":[0.00075214036,0.000107396554,0.0023239774,0.000055567285,0.000091474474,0.0000022684649,0.000286095,0.005014927,0.0025126007,0.92949855,0.058949567,0.0004054512],"about_ca_topic_score_codex":0.0000018560053,"about_ca_topic_score_gemma":0.000010006463,"teacher_disagreement_score":0.067729585,"about_ca_system_score_codex":0.00000648137,"about_ca_system_score_gemma":0.000014118158,"threshold_uncertainty_score":0.54036486},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9959123,0.00008005695,0.0015893332,0.0017161653,0.00000986442,0.00017400867,0.00003997714,0.00001940674,0.00045889008],"genre_scores_gemma":[0.9987598,0.00006169167,0.0008661919,0.00024510265,0.000008699488,0.000026380829,0.0000021229807,0.000006554239,0.000023469287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994659,0.000060077673,0.00017685113,0.000107259395,0.000109405766,0.000080521604],"domain_scores_gemma":[0.99914515,0.00053593004,0.00009593063,0.00015512816,0.000032275806,0.000035568704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010371432,0.00008310277,0.00015505936,0.000035899004,0.0001033123,0.000005678504,0.00014939913,0.00003109841,0.000032744843],"category_scores_gemma":[0.00009578382,0.0000556108,0.00006203576,0.00017388805,0.00021576889,0.00001272025,0.000027360422,0.0000912795,7.7560094e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016713273,0.000045312005,0.00015617949,0.000070863956,0.00003461252,2.7123258e-7,0.0029019052,0.0000035949065,0.01140774,0.9849279,0.0002661605,0.00016874688],"study_design_scores_gemma":[0.00017356733,0.00007860868,0.0011891512,0.00002188711,0.000030335177,7.096919e-7,0.0007739218,0.000066553424,0.034094177,0.96340877,0.00009872672,0.00006362198],"about_ca_topic_score_codex":0.0000054253787,"about_ca_topic_score_gemma":0.0000042893594,"teacher_disagreement_score":0.022686437,"about_ca_system_score_codex":0.0000026341615,"about_ca_system_score_gemma":0.0000046921605,"threshold_uncertainty_score":0.22677425},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8385995,0.00038767845,0.10625656,0.004085195,0.00035031902,0.00022041783,0.0000049106716,0.00011580193,0.049979597],"genre_scores_gemma":[0.99521524,0.000035687903,0.0040191393,0.00033628682,0.0001579495,2.1633788e-7,4.6770583e-7,0.00003712893,0.0001978907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989317,0.00022444267,0.00034774546,0.00009483417,0.00027092136,0.00013036812],"domain_scores_gemma":[0.9988628,0.00014250044,0.000395569,0.00016658353,0.00014653755,0.00028603253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005054967,0.0001215322,0.00020501803,0.00005933121,0.00008468631,0.00004032598,0.00036304435,0.00001039378,0.00004096761],"category_scores_gemma":[0.00015750316,0.00009293483,0.00011003503,0.00039780693,0.000048936276,0.000118253694,0.00003349973,0.00027043407,0.000039484145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078373065,0.00009504314,0.00044490813,0.000015251321,0.000079175275,0.00012885901,0.00096499984,0.00005590936,0.00033880296,0.9762809,0.021018911,0.0004988426],"study_design_scores_gemma":[0.0025817468,0.00095144665,0.00042255997,0.000065281296,0.00015731592,0.00012357037,0.0003475794,0.000013935343,0.001403618,0.94939816,0.044317186,0.00021762736],"about_ca_topic_score_codex":2.7936952e-7,"about_ca_topic_score_gemma":9.7675944e-8,"teacher_disagreement_score":0.1566157,"about_ca_system_score_codex":0.000012234906,"about_ca_system_score_gemma":0.000060129852,"threshold_uncertainty_score":0.37897727},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9977687,0.00055884226,0.00028035374,0.00016564252,0.00003843191,0.00015317531,0.000020366953,0.00003542672,0.0009790785],"genre_scores_gemma":[0.9992966,0.00025697952,0.00036792146,0.000031201904,0.0000019874453,0.000011160671,0.0000015048455,0.000010318206,0.000022305365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992485,0.00003078049,0.00025357408,0.00018101998,0.00017036707,0.000115742994],"domain_scores_gemma":[0.9993547,0.00011673676,0.00015129629,0.00019369312,0.00008293283,0.00010060735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001514877,0.00011485728,0.0002566667,0.00007460547,0.00006739682,0.000009557296,0.0001383009,0.00007969513,0.0000073433907],"category_scores_gemma":[0.000058780643,0.00010520579,0.00006297542,0.000463887,0.00016254192,0.000059127746,0.000071337665,0.00011466252,3.9855294e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015433892,0.000110061635,0.007455513,0.00015321733,0.000027554757,0.00000104298,0.00043735825,4.357368e-7,0.0016405777,0.9889973,0.00019543484,0.0009660714],"study_design_scores_gemma":[0.00041098913,0.00014736537,0.0086206235,0.000021621061,0.000046392306,0.0000031445438,0.00028327198,0.00008964658,0.0032291717,0.98695725,0.000088051995,0.00010245217],"about_ca_topic_score_codex":0.000010512774,"about_ca_topic_score_gemma":0.0000034840218,"teacher_disagreement_score":0.0020400286,"about_ca_system_score_codex":0.0000017737435,"about_ca_system_score_gemma":0.000011023041,"threshold_uncertainty_score":0.42901677},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9400025,0.00010717471,0.050046295,0.00002940568,0.0004683557,0.0012083814,0.00026771065,0.000095106036,0.00777508],"genre_scores_gemma":[0.9984436,0.00007695328,0.00015059451,0.000012440329,0.00007078991,0.0000076023803,0.00003792857,0.000024990708,0.0011750979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841225,0.0002658944,0.00036762175,0.0005429731,0.00007087533,0.00034040865],"domain_scores_gemma":[0.9977019,0.0006282271,0.00041399614,0.001084044,0.000097317425,0.00007452189],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048775488,0.00022750236,0.0005300145,0.00026731007,0.00008536675,0.000020402205,0.000518257,0.0002634111,0.000053665462],"category_scores_gemma":[0.000058378922,0.0002685955,0.00029717947,0.00065074576,0.00010191263,0.0000830935,0.0002280813,0.000501121,0.000032155505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004294716,0.00017794232,0.026461756,0.00016333153,0.00012047231,0.000018579822,0.00011358147,0.20045893,0.000019114526,0.77165914,0.00076332066,8.948714e-7],"study_design_scores_gemma":[0.0012150793,0.000023029399,0.00576868,0.00025954726,0.00025573123,0.0000021398055,0.00052233797,0.040248454,0.000021582884,0.9512133,0.00016737287,0.00030277245],"about_ca_topic_score_codex":0.00014366499,"about_ca_topic_score_gemma":0.00015024174,"teacher_disagreement_score":0.17955415,"about_ca_system_score_codex":0.00006958977,"about_ca_system_score_gemma":0.00009284779,"threshold_uncertainty_score":0.99997663},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5160091,0.00062819634,0.4600145,0.002780504,0.0020829928,0.0049629123,0.0024174224,0.00018802543,0.010916372],"genre_scores_gemma":[0.9321152,0.000051240353,0.06399146,0.0000070298865,0.00034502105,0.0019398767,0.0005312123,0.000049017293,0.000969976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99646074,0.00029716885,0.000998926,0.00046635274,0.0014438744,0.00033294375],"domain_scores_gemma":[0.9869137,0.008497494,0.0006635929,0.0008324162,0.0029915182,0.00010128199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004000078,0.00022868512,0.0005004949,0.00043037464,0.00021079248,0.00036294214,0.0010530687,0.00029964146,0.00016733403],"category_scores_gemma":[0.0071999137,0.00022511538,0.00031698993,0.0002313046,0.0002879175,0.00016104066,0.0006892815,0.00064538425,0.000012747455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017279222,0.0009473527,0.000027278918,0.002848754,0.00035113996,0.0000018626624,0.0010372427,0.0010163207,0.0008593555,0.9916556,0.0011369489,0.000100866084],"study_design_scores_gemma":[0.00022930675,0.00003263489,0.000036373338,0.001145693,0.000091393435,0.0000026540133,0.0015384952,0.06324371,0.0023463955,0.9305679,0.0005736679,0.0001917758],"about_ca_topic_score_codex":0.000052952815,"about_ca_topic_score_gemma":0.000060160906,"teacher_disagreement_score":0.41610608,"about_ca_system_score_codex":0.00013821917,"about_ca_system_score_gemma":0.00030218175,"threshold_uncertainty_score":0.91799384},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99103004,0.0005064181,0.002281617,0.00093677756,0.000028355333,0.0009939332,0.00022602224,0.000056591583,0.0039402307],"genre_scores_gemma":[0.99670935,0.000060873273,0.0016848407,0.00010078276,0.00002374647,0.0010370081,0.000038394046,0.000011143356,0.0003338561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992828,0.00004748888,0.00026800344,0.0001695407,0.00013384805,0.000098348384],"domain_scores_gemma":[0.99938536,0.0002450383,0.00010940631,0.00019316038,0.000028448081,0.000038578804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024878664,0.00007177223,0.0001303442,0.00010906199,0.0002277782,0.000005156266,0.00012886853,0.000023649689,0.0005043742],"category_scores_gemma":[0.00002380317,0.000076053264,0.000046991343,0.00044796534,0.000043455813,0.000048246595,0.00007970068,0.00014963042,0.000009651092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065335253,0.00024232682,0.00042191255,0.000027043883,0.000010510176,1.3397512e-7,0.00012984447,0.000010127327,0.002553782,0.995723,0.00029863507,0.0005761235],"study_design_scores_gemma":[0.00025081466,0.00002859182,0.0012077943,0.000005837921,0.000020606129,0.000009134843,0.00046661208,0.00025317093,0.0011572764,0.96178466,0.03471634,0.00009918826],"about_ca_topic_score_codex":0.0000039887423,"about_ca_topic_score_gemma":0.0000027883025,"teacher_disagreement_score":0.034417707,"about_ca_system_score_codex":0.000013026889,"about_ca_system_score_gemma":0.000018504772,"threshold_uncertainty_score":0.55225444},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011041455,0.00021107719,0.013205894,0.000028012357,0.000065260974,0.0006839598,0.00082573993,0.00020454645,0.9846651],"genre_scores_gemma":[0.00030333456,0.000056460554,0.00035932768,0.000032905253,0.00016651476,0.000024738323,0.00023172791,0.000042191212,0.9987828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990121,0.0000678617,0.00016185021,0.00046466608,0.00009733461,0.0001961927],"domain_scores_gemma":[0.9984147,0.00033858302,0.00016767446,0.00077573344,0.00015536658,0.00014795022],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009592572,0.00028778904,0.00033741439,0.0001218438,0.00046168585,0.000046377358,0.0003059625,0.00028805918,0.000006826707],"category_scores_gemma":[0.000011851819,0.0003144123,0.00018296753,0.000031336353,0.00028550884,0.000047010428,0.00028341965,0.00041011802,0.000010214993],"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.000004653092,0.000025189056,3.1005584e-7,0.00010775766,0.00010985405,0.0000061338255,0.000043333777,1.0501308e-7,0.000055368884,0.8037194,0.19530071,0.0006271711],"study_design_scores_gemma":[0.0002167261,0.000010462665,0.0000021293226,0.000070769485,0.0002626329,0.000023089331,0.00029985397,0.0000071561176,0.00017550278,0.0081400275,0.9904914,0.00030028468],"about_ca_topic_score_codex":0.000007875787,"about_ca_topic_score_gemma":0.0000027701417,"teacher_disagreement_score":0.7955794,"about_ca_system_score_codex":0.000096761665,"about_ca_system_score_gemma":0.00017979529,"threshold_uncertainty_score":0.9999308},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9872636,0.0003268,0.0003747583,0.00029042072,0.0000422346,0.0007519004,0.00008707194,0.00011202266,0.010751195],"genre_scores_gemma":[0.9943258,0.00001550045,0.0038373892,0.000036462607,0.00002674336,0.000102837934,0.000003415434,0.000039761126,0.0016120508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988861,0.000025559419,0.00053781964,0.00014350709,0.00023003777,0.00017694876],"domain_scores_gemma":[0.9986267,0.00021137441,0.0003440968,0.0007165694,0.000047271435,0.000054008342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000072981486,0.00016171749,0.0003059099,0.0000637246,0.00007207674,0.00008500262,0.00059496594,0.00006433624,0.00004756991],"category_scores_gemma":[0.00015812255,0.00010259801,0.00020511576,0.00033244985,0.00038661703,0.0012343343,0.00019366643,0.00009826709,0.000026107777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037704121,0.00036532505,0.00036251787,0.00081906555,0.00004039256,1.3608708e-7,0.00089542073,6.346908e-7,0.004557225,0.9916896,0.0009706054,0.0002952661],"study_design_scores_gemma":[0.000086104126,0.00001848631,0.00016983674,0.00032414196,0.00001910017,0.0000027894635,0.00054884376,0.000052436873,0.0996619,0.8988757,0.00012887818,0.0001117782],"about_ca_topic_score_codex":7.200867e-7,"about_ca_topic_score_gemma":1.4372073e-7,"teacher_disagreement_score":0.09510468,"about_ca_system_score_codex":0.0000037224786,"about_ca_system_score_gemma":0.000034410128,"threshold_uncertainty_score":0.41838256},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.872894,0.0035574231,0.08027415,0.02556911,0.000049571252,0.004421022,0.0003807561,0.00051720894,0.012336749],"genre_scores_gemma":[0.9959143,0.00021804671,0.0029891082,0.00025127616,0.00007128849,0.0003198106,0.000010247149,0.000016838654,0.0002090808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993187,0.000038593695,0.00025325705,0.00016930126,0.00009784392,0.00012230054],"domain_scores_gemma":[0.9989702,0.00052093226,0.000104458835,0.00025420182,0.00005890106,0.000091308044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017084423,0.00009211369,0.00012516593,0.000019942514,0.00034267167,0.000016829263,0.00021898304,0.000043757733,0.000029490628],"category_scores_gemma":[0.00010229387,0.00006623039,0.00006193052,0.00033170998,0.00011490814,0.00003727969,0.00004919432,0.00008673714,0.00003073398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006060434,0.00003600114,0.000016046888,0.000029464856,0.000021456803,5.3721713e-8,0.0002937603,7.057736e-7,0.008686163,0.98879445,0.00075810164,0.0013577628],"study_design_scores_gemma":[0.00014179722,0.0000320951,0.00010642835,0.000004850363,0.000046916517,0.0000014925142,0.00035199718,0.0006243258,0.010356987,0.9617472,0.026491895,0.00009397757],"about_ca_topic_score_codex":9.779092e-7,"about_ca_topic_score_gemma":0.0000018065301,"teacher_disagreement_score":0.12302029,"about_ca_system_score_codex":0.0000021360627,"about_ca_system_score_gemma":0.00001579517,"threshold_uncertainty_score":0.27007967},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9945296,0.000082706036,0.0004858622,0.00037452154,0.00015426023,0.00013527839,0.000044489403,0.000007646964,0.004185659],"genre_scores_gemma":[0.99902433,0.000027516111,0.00055953785,0.00014807183,0.000020194353,0.000012680644,7.3905215e-7,0.000017151067,0.00018976488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817747,0.00058975024,0.00060393766,0.00008004367,0.00042672912,0.0001220964],"domain_scores_gemma":[0.9960197,0.0023744698,0.0010167012,0.00039206984,0.00015366705,0.000043395015],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002818919,0.00010866352,0.00031769238,0.00019273836,0.00019274722,0.000005160093,0.0005326032,0.000031502805,0.0015863463],"category_scores_gemma":[0.00024163748,0.000070317394,0.0003959709,0.000533379,0.0002552268,0.000044304965,0.00006523153,0.00039639487,0.0000029287999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002969174,0.00041864513,0.0002740035,0.000025206746,0.0001728873,0.0000030041174,0.0005664899,0.00003259465,0.001237129,0.9933302,0.003412899,0.00023003541],"study_design_scores_gemma":[0.00037859724,0.00020313042,0.00040953595,0.000032629432,0.00008764329,0.00007033008,0.0012474528,0.0000012100543,0.0037564037,0.9933223,0.00042369773,0.00006703323],"about_ca_topic_score_codex":0.000002201334,"about_ca_topic_score_gemma":5.256606e-7,"teacher_disagreement_score":0.004494768,"about_ca_system_score_codex":0.000011630627,"about_ca_system_score_gemma":0.000037608792,"threshold_uncertainty_score":0.99932635},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98972076,0.0009831786,0.0033433111,0.0022109626,0.000018442517,0.00019566981,0.000014622002,0.00013616084,0.0033769151],"genre_scores_gemma":[0.9883886,0.000052448566,0.01083294,0.00050662627,0.000055401793,0.000025842497,0.00000121206,0.0000113162,0.00012561302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995811,0.00002110564,0.00009592648,0.0001420322,0.000062203966,0.00009761165],"domain_scores_gemma":[0.999645,0.00013115058,0.000034052966,0.00012317214,0.00000908124,0.000057525787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000080913574,0.000059814243,0.00008944779,0.000008027034,0.000085461514,0.000014310454,0.00007486481,0.000026444975,0.000042446463],"category_scores_gemma":[0.00008091325,0.00005633421,0.000021589605,0.000109960645,0.00004042862,0.00004291217,0.000034708875,0.00006082605,0.000022337896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038257044,0.000010217638,0.0013280547,0.000033712513,0.0000021380292,0.0000015307974,0.00027547037,8.98998e-8,0.0012480639,0.9891429,0.002003005,0.005950998],"study_design_scores_gemma":[0.00025302832,0.000022687125,0.005427012,0.000036651803,0.00001199175,0.0000048755446,0.0000784381,0.00023963065,0.0008448519,0.74836177,0.24458379,0.00013528788],"about_ca_topic_score_codex":0.00000395894,"about_ca_topic_score_gemma":0.000008405187,"teacher_disagreement_score":0.24258077,"about_ca_system_score_codex":0.0000033842455,"about_ca_system_score_gemma":0.0000035236178,"threshold_uncertainty_score":0.22972424},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23792067,0.00009970995,0.74844205,0.010167574,0.0002901984,0.0013513812,0.000045084595,0.00012992178,0.0015534307],"genre_scores_gemma":[0.15698926,0.00012399282,0.8390494,0.00068790984,0.00039295308,0.0002240558,0.0000030215804,0.00015654537,0.002372876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983853,0.00016391615,0.0007236237,0.000111179266,0.00038162188,0.00023432923],"domain_scores_gemma":[0.9887979,0.009759336,0.00068676897,0.00045731541,0.00022250207,0.00007618847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051513244,0.00017113218,0.00042693838,0.00019947239,0.00023050915,0.000048113987,0.00049979315,0.00008493915,0.000018854435],"category_scores_gemma":[0.0020808703,0.00010100012,0.00048847595,0.00047674327,0.00006544893,0.00005125167,0.000027834572,0.00026243806,0.00003269903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067517016,0.00021008728,0.0000012901953,0.00013620286,0.000111092646,0.000005176299,0.0016857161,0.000050870087,0.0027683424,0.9818516,0.011586676,0.0015254455],"study_design_scores_gemma":[0.0011167874,0.00011162148,0.0000047256144,0.00017603076,0.00019437491,0.00008157801,0.0020392449,0.0029787188,0.006436407,0.98121035,0.005536912,0.00011323561],"about_ca_topic_score_codex":3.7079928e-7,"about_ca_topic_score_gemma":0.0000015214711,"teacher_disagreement_score":0.09060736,"about_ca_system_score_codex":0.00001684027,"about_ca_system_score_gemma":0.000036676254,"threshold_uncertainty_score":0.41186655},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9222047,0.0022624107,0.07390486,0.0007003553,0.000017836588,0.00051212125,0.00007102774,0.000011867706,0.00031487888],"genre_scores_gemma":[0.9738831,0.00053010875,0.025207028,0.000017842143,0.00012979454,0.00010387402,0.0000068466256,0.000018676988,0.000102765895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971225,0.0001325511,0.0019708164,0.00022868512,0.00040473518,0.00014067607],"domain_scores_gemma":[0.9956006,0.0005118137,0.002419931,0.0007039601,0.00063229096,0.00013142002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010844163,0.00022778475,0.0016241632,0.00045507294,0.00006765876,0.000045244615,0.00042919224,0.00020325145,0.00009168553],"category_scores_gemma":[0.00028190334,0.00016609317,0.0009880773,0.00062764384,0.00030337024,0.00007834174,0.00026653256,0.0003812492,0.0000013923884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022950264,0.0016497687,0.00012426733,0.0023579656,0.003945987,0.0000012880029,0.0007592382,0.00014481388,0.02312784,0.9669865,0.000094112285,0.00078531547],"study_design_scores_gemma":[0.0001915265,0.00003110228,0.00014375283,0.0005314734,0.007054431,0.000018135976,0.0009732195,0.0006141297,0.030946713,0.95919687,0.00011661904,0.00018204979],"about_ca_topic_score_codex":0.0000052412656,"about_ca_topic_score_gemma":0.000004177729,"teacher_disagreement_score":0.051678415,"about_ca_system_score_codex":0.000018368513,"about_ca_system_score_gemma":0.00013120507,"threshold_uncertainty_score":0.6773083},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97281575,0.00016156922,0.015197448,0.0047565033,0.00013994935,0.00024673739,0.000040142462,0.000030378202,0.00661152],"genre_scores_gemma":[0.9981011,0.000038137827,0.0006157756,0.0010932011,0.0000793713,0.0000058771443,0.0000016471794,0.00002109556,0.000043805554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861526,0.00036136288,0.00049431506,0.000102182945,0.0002942835,0.00013261741],"domain_scores_gemma":[0.9968344,0.0019469914,0.0006052482,0.00027300743,0.00024493242,0.00009542558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012765223,0.00013399553,0.00025908992,0.00014826847,0.0001289886,0.000015098536,0.00039038804,0.00006345429,0.00063962676],"category_scores_gemma":[0.0005126146,0.000081655955,0.0003283167,0.00059283845,0.00022969603,0.00008900996,0.000025527446,0.00034782474,0.000013079976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019999212,0.00016160237,0.000020418307,0.000023659928,0.00014608275,0.0000022289348,0.0008631867,0.00001877782,0.002368956,0.9867988,0.0090329815,0.0003632745],"study_design_scores_gemma":[0.00034550545,0.0002221784,0.00025363016,0.00006445397,0.000117516756,0.000014960137,0.0013277319,0.000007225649,0.0037334287,0.99340945,0.00041855415,0.00008535076],"about_ca_topic_score_codex":4.209147e-7,"about_ca_topic_score_gemma":0.000001921383,"teacher_disagreement_score":0.025285337,"about_ca_system_score_codex":0.000007848199,"about_ca_system_score_gemma":0.000033976572,"threshold_uncertainty_score":0.7003464},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9615889,0.000058906087,0.031643394,0.0007845963,0.00006721427,0.00026183174,0.000009837593,0.00008775936,0.005497549],"genre_scores_gemma":[0.99639726,0.0000036397676,0.003106355,0.00020260774,0.00021118409,0.000015677488,0.000002847645,0.000009862711,0.000050542323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937755,0.000058356705,0.0002343365,0.0001404529,0.00007003348,0.000119254815],"domain_scores_gemma":[0.9992618,0.00027576377,0.00010084245,0.00025562383,0.000031784515,0.0000742068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023166071,0.00007247664,0.00017064282,0.000009625653,0.000043204946,0.0000063004823,0.0001487838,0.00005263498,0.00013910142],"category_scores_gemma":[0.00011094934,0.0000654611,0.000077722696,0.00014639641,0.00006321812,0.000030526844,0.00004051092,0.00011513774,0.000012057468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007307965,0.00015114222,0.0027194843,0.000075852506,0.000025310641,0.0000024691888,0.00033060898,0.0017476266,0.0013432979,0.97758114,0.011529737,0.004420222],"study_design_scores_gemma":[0.00069470576,0.00011330986,0.0028817244,0.000042561594,0.00009677556,0.0000053913163,0.00006525307,0.017185245,0.0023682825,0.97133017,0.0049844766,0.00023210797],"about_ca_topic_score_codex":0.0000034274872,"about_ca_topic_score_gemma":0.0000029778007,"teacher_disagreement_score":0.03480837,"about_ca_system_score_codex":0.000005189977,"about_ca_system_score_gemma":0.000010784491,"threshold_uncertainty_score":0.26694262},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9758116,0.000023976187,0.00395226,0.00092215126,0.000039922797,0.00013241815,0.000012779293,0.00009258788,0.019012276],"genre_scores_gemma":[0.9939574,0.00002326282,0.003918434,0.000031213644,0.00001352569,0.000022211729,6.001374e-7,0.000008372668,0.0020249523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995148,0.000026761922,0.00017055003,0.00009358984,0.00008623574,0.00010807081],"domain_scores_gemma":[0.9992406,0.00032879892,0.000057362722,0.00028884088,0.00003701136,0.000047382244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001990923,0.00005865342,0.000102336046,0.00006174919,0.000032931388,0.000002785886,0.00012087944,0.0000318787,0.00079592364],"category_scores_gemma":[0.0000879411,0.0000329814,0.000067833826,0.0001440814,0.0001042167,0.00004628646,0.000017544984,0.00001913205,0.000103247716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003020019,0.000043290493,0.001179597,0.000010036212,0.000012887725,1.5310874e-7,0.000086307715,1.3533151e-8,0.026786549,0.96845293,0.0017318014,0.0016934299],"study_design_scores_gemma":[0.00011377895,0.00001559408,0.00048428882,0.000015579613,0.000012863451,8.4830333e-7,0.0000387948,0.0000013976339,0.097599566,0.9002067,0.001459217,0.000051367242],"about_ca_topic_score_codex":0.000004062795,"about_ca_topic_score_gemma":0.000019619172,"teacher_disagreement_score":0.07081302,"about_ca_system_score_codex":0.000002988505,"about_ca_system_score_gemma":0.000008439396,"threshold_uncertainty_score":0.8714806},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000654837,0.78544515,0.040369663,0.06516516,0.00024426295,0.0047497978,0.00007272448,0.0002927619,0.10300564],"genre_scores_gemma":[0.5834489,0.22278409,0.017204367,0.1376103,0.0004996227,0.0008564923,0.000059769485,0.00019629984,0.037340164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917436,0.00014217776,0.0002941368,0.00012666223,0.00015629534,0.00010637993],"domain_scores_gemma":[0.9989242,0.00013763973,0.0001609246,0.00067257334,0.00006692082,0.000037725662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049972243,0.000099656325,0.00022121091,0.000017310542,0.0001066103,0.0000041399458,0.00024695013,0.00003856463,0.0006745361],"category_scores_gemma":[0.00016980627,0.00006427725,0.00019201284,0.0002503002,0.00002961838,0.000054121472,0.000022723374,0.00010576147,0.000049635953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.034769e-7,0.000109141045,0.0000044977764,0.00041990998,0.000015580978,1.1461314e-7,0.00003652629,4.3557444e-7,0.00021290359,0.90397424,0.09329463,0.0019314303],"study_design_scores_gemma":[0.000107852626,0.0000129402715,0.0003516733,0.0020530382,0.00023194043,0.000005323489,0.0000053388353,0.000006070204,0.00012348579,0.8004394,0.19656122,0.00010170777],"about_ca_topic_score_codex":7.803057e-7,"about_ca_topic_score_gemma":0.0000074994373,"teacher_disagreement_score":0.5827941,"about_ca_system_score_codex":0.000022044955,"about_ca_system_score_gemma":0.000024813138,"threshold_uncertainty_score":0.73856974},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99411714,0.00002323039,0.004330965,0.0001668035,0.000010508902,0.0004021926,0.000021429885,0.00010115407,0.0008265932],"genre_scores_gemma":[0.988349,0.0000013888849,0.011475437,0.00007782952,0.000009131427,0.00000787996,0.00003420203,0.0000089806745,0.000036127236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934655,0.000040299215,0.00020225061,0.00017515275,0.00011718293,0.00011858852],"domain_scores_gemma":[0.9993494,0.00013551748,0.000110242625,0.00025765251,0.00009840819,0.00004873926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006850592,0.0001257946,0.00018564421,0.000074504154,0.00009206958,0.000018739049,0.000087918335,0.000051175422,0.00010247694],"category_scores_gemma":[0.000032789583,0.00009195951,0.000026708854,0.00024088065,0.00006210704,0.00009359618,0.0000103853545,0.000083268016,8.4595877e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005839851,0.000086145985,0.0012285205,0.000016121176,0.00003468129,4.2012485e-7,0.000251629,0.000005285526,0.12783338,0.8699499,0.00008363374,0.00045191226],"study_design_scores_gemma":[0.0009901935,0.00011541451,0.021525694,0.000024282708,0.000057559122,0.000008893357,0.00003284127,0.00053332676,0.060325198,0.9162485,0.000013603204,0.00012448627],"about_ca_topic_score_codex":0.00001975014,"about_ca_topic_score_gemma":0.00013752421,"teacher_disagreement_score":0.06750818,"about_ca_system_score_codex":0.00000378346,"about_ca_system_score_gemma":0.000007948482,"threshold_uncertainty_score":0.375},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99570704,0.0004511829,0.00043469985,0.002123415,0.0001013523,0.000589194,0.000042761574,0.00012500772,0.00042535755],"genre_scores_gemma":[0.9965896,0.00070810417,0.0017336978,0.00022539857,0.0001269711,0.000089975154,0.0000064538544,0.000022887754,0.00049690844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919033,0.00009046217,0.00019904762,0.00020935142,0.00012992043,0.00018089372],"domain_scores_gemma":[0.9987511,0.00088785245,0.00007781926,0.00019971271,0.0000127910935,0.00007069831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043482083,0.00015772496,0.00028079486,0.000058363847,0.00036753452,0.00006946929,0.000112280126,0.0000527606,0.000024777986],"category_scores_gemma":[0.00012834108,0.000084914864,0.00008710073,0.00014381691,0.00020903922,0.0000392491,0.00006352662,0.00014348437,0.0000063692346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003518808,0.000013167192,0.000024761111,0.00005794941,0.000040719067,0.000007684065,0.001626946,0.0000027586511,0.00033642218,0.9606295,0.00096013455,0.035948057],"study_design_scores_gemma":[0.0050185146,0.00003320566,0.0013465526,0.00003233268,0.00005457457,0.00006622309,0.00037417107,0.0011004581,0.00037077442,0.9900978,0.0013768936,0.0001284773],"about_ca_topic_score_codex":0.000012771865,"about_ca_topic_score_gemma":0.000006059551,"teacher_disagreement_score":0.03581958,"about_ca_system_score_codex":0.000003430941,"about_ca_system_score_gemma":0.0000064249825,"threshold_uncertainty_score":0.34627277},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99351305,0.000072562136,0.0017893062,0.0005496658,0.00008277387,0.0005041624,0.00006936928,0.00011141421,0.0033076848],"genre_scores_gemma":[0.99849427,0.00051700074,0.0004107714,0.000041469142,0.000018492337,0.0000034006925,0.000009796316,0.000022860822,0.00048195748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855244,0.00024245387,0.0002985274,0.00062340935,0.00007049934,0.00021266766],"domain_scores_gemma":[0.9970504,0.001100752,0.00035801457,0.001251074,0.00010763474,0.00013211077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044882915,0.00024690886,0.0003716102,0.00008843173,0.00027428663,0.000027335718,0.0007322915,0.00022576505,0.000022901075],"category_scores_gemma":[0.00030084737,0.00021607325,0.00023886422,0.0004856083,0.00060667493,0.000055774235,0.0007910257,0.0005550265,0.00001561693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052342817,0.00008283193,0.0033530786,0.00019841021,0.0000786118,0.000005971226,0.00017977763,0.00030263537,0.00014016696,0.9950994,0.0004446942,0.0000620399],"study_design_scores_gemma":[0.00026029866,0.000021481057,0.0018452923,0.000055209588,0.00020696003,0.0000010901406,0.00019028314,0.0025349755,0.00025576082,0.99339545,0.0010269628,0.0002062265],"about_ca_topic_score_codex":0.00005744037,"about_ca_topic_score_gemma":0.000032941374,"teacher_disagreement_score":0.00498119,"about_ca_system_score_codex":0.00003613436,"about_ca_system_score_gemma":0.00006342322,"threshold_uncertainty_score":0.88112116},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9888771,0.0029189163,0.004241562,0.00032414895,0.00007645615,0.0005157175,0.00007075617,0.000039743813,0.002935608],"genre_scores_gemma":[0.9968698,0.0015247567,0.0012632847,0.00021482476,0.000036023135,0.0000285649,0.0000047147782,0.00003376776,0.000024257704],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809086,0.00017437241,0.00079520955,0.00033047883,0.00036737177,0.0002416981],"domain_scores_gemma":[0.99783355,0.0005279483,0.0007802624,0.0004175292,0.0001813032,0.00025938178],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010090095,0.00022295573,0.0006915558,0.0002541991,0.00020232661,0.00026684545,0.0013274316,0.00008408207,0.0015033159],"category_scores_gemma":[0.0004128597,0.00020100291,0.00019318264,0.00078200136,0.00018055069,0.0007254336,0.00052712957,0.00028135983,0.000003927337],"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.00042026213,0.0007075427,0.3004806,0.0012590977,0.00063983176,0.000028701974,0.0020290834,0.00005398118,0.36203992,0.29424214,0.025709916,0.012388942],"study_design_scores_gemma":[0.00036291208,0.000008940663,0.06879069,0.00019783771,0.00012163389,0.0000102835775,0.00012475403,0.000075423515,0.029789273,0.8992117,0.0010757032,0.00023082917],"about_ca_topic_score_codex":0.00008347153,"about_ca_topic_score_gemma":0.000006223752,"teacher_disagreement_score":0.60496956,"about_ca_system_score_codex":0.000014773337,"about_ca_system_score_gemma":0.000043816282,"threshold_uncertainty_score":0.99940944},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010918229,0.004531388,0.060445655,0.0025833882,0.0007004999,0.001079512,0.00023773537,0.00023483574,0.9300778],"genre_scores_gemma":[0.76138246,0.0053019198,0.06279752,0.0029981527,0.0010462052,0.00062454556,0.00021285392,0.0002933196,0.16534305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986668,0.000021608203,0.0004703331,0.00040925574,0.0003043982,0.00012758486],"domain_scores_gemma":[0.99717426,0.0022428099,0.00020332015,0.00019066622,0.00014818853,0.000040737392],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015849678,0.00027572745,0.00039308745,0.00013491149,0.0001238984,0.000013476563,0.00027569322,0.00008559143,0.00008309403],"category_scores_gemma":[0.00020624243,0.00025516495,0.00013729467,0.00010482808,0.0004542461,0.000027370323,0.00009695513,0.00035871542,0.00019599053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019234947,0.000029574823,0.0000018146394,0.00011191536,0.00012387591,0.00001491424,0.00061457045,0.0019657644,1.1725609e-7,0.9922518,0.0027878692,0.0020785402],"study_design_scores_gemma":[0.000031353506,0.000057374837,0.0000024890267,0.00042757834,0.00002425794,0.0000026429977,0.00025214854,0.00018352151,0.000009606215,0.98823184,0.010545673,0.00023148808],"about_ca_topic_score_codex":4.5940718e-7,"about_ca_topic_score_gemma":0.0000138883925,"teacher_disagreement_score":0.76473475,"about_ca_system_score_codex":0.00006221754,"about_ca_system_score_gemma":0.000029585648,"threshold_uncertainty_score":0.99999005},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9969269,0.00019740964,0.0022927406,0.00012845633,0.00009244711,0.000062711246,0.000061329454,0.000010182561,0.0002278134],"genre_scores_gemma":[0.9954188,0.00051478745,0.0038684735,0.000005615361,0.000070318914,0.0000015708256,0.0000045868933,0.000011128496,0.00010475118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99899584,0.000094771225,0.00053186156,0.00009655126,0.00017077097,0.000110197834],"domain_scores_gemma":[0.99825907,0.00019092966,0.0006836245,0.00021546915,0.0005914066,0.000059477265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018044042,0.00012140061,0.0004465939,0.00006267179,0.000054944096,0.000022045433,0.00014025976,0.000047812846,0.00006320363],"category_scores_gemma":[0.00016519846,0.000106638785,0.00013819117,0.0002445732,0.0002233957,0.00023529069,0.000046128705,0.00014294182,5.820998e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012658405,0.0003872805,0.0013138076,0.00028227718,0.0001955633,0.000010771892,0.0015779147,0.0000013665286,0.40668586,0.5858165,0.00011999741,0.0034820861],"study_design_scores_gemma":[0.00034669504,0.00011072362,0.004588741,0.00020599217,0.00018240872,0.000045208046,0.0007010041,0.000011198706,0.5130294,0.48056528,0.00009527283,0.00011808277],"about_ca_topic_score_codex":0.0000033016643,"about_ca_topic_score_gemma":0.000005055176,"teacher_disagreement_score":0.10634354,"about_ca_system_score_codex":0.0000049682185,"about_ca_system_score_gemma":0.00015521202,"threshold_uncertainty_score":0.43486032},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9984941,0.00044016854,0.00066445046,0.00010012825,0.000053490683,0.0000753518,0.0000423635,0.000007346846,0.00012261832],"genre_scores_gemma":[0.9971751,0.0006764666,0.0020074989,0.0000026665027,0.000042127744,0.0000018065771,0.0000020350096,0.000010036609,0.000082241735],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989177,0.00010048823,0.00062033837,0.00008449437,0.00017947808,0.00009748292],"domain_scores_gemma":[0.99797857,0.00009999678,0.0009380465,0.00019546374,0.0007476266,0.000040295938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017447924,0.00011493712,0.00051711773,0.00006582192,0.00004265133,0.000014380524,0.00014786958,0.00004407736,0.000021466092],"category_scores_gemma":[0.00016023252,0.000093277406,0.00012615767,0.00022812493,0.0003425796,0.0002205426,0.00004947642,0.000116079755,2.1201119e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010903251,0.00023780657,0.00093280437,0.0005167615,0.00013086143,0.00000167592,0.0017910397,8.5178914e-7,0.7396426,0.25504407,0.000017590088,0.0015748569],"study_design_scores_gemma":[0.00021484976,0.00012462528,0.0028107688,0.00038309186,0.00012490092,0.000020468315,0.0010518224,0.000007495764,0.7984081,0.19675738,0.000020301493,0.00007623334],"about_ca_topic_score_codex":0.000006195947,"about_ca_topic_score_gemma":0.000003951802,"teacher_disagreement_score":0.058765426,"about_ca_system_score_codex":0.0000042283464,"about_ca_system_score_gemma":0.00017674657,"threshold_uncertainty_score":0.3803742},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8801765,0.00007931441,0.10317685,0.00017348713,0.00053726375,0.0028032365,0.0002831104,0.00028990468,0.012480348],"genre_scores_gemma":[0.9865702,0.000096951226,0.001085477,0.00007716039,0.00012275956,0.000016682594,0.00006322128,0.000049351696,0.011918199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856246,0.00011910183,0.00023343004,0.0007292954,0.00006873313,0.00028698533],"domain_scores_gemma":[0.9972847,0.0010823604,0.0003125937,0.001108534,0.000115705945,0.000096108284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004223571,0.00031764226,0.00049733237,0.00025488756,0.00017464008,0.000045130702,0.00068185735,0.00037155327,0.0001490375],"category_scores_gemma":[0.00013024348,0.000324806,0.00056298886,0.00024203226,0.00007123885,0.00007113679,0.00024955,0.0003931854,0.00022259813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051416823,0.00018917827,0.00012722528,0.00028466387,0.00018414306,0.000009142806,0.000111574525,0.005297107,0.000032994772,0.9900186,0.003128405,0.000102778526],"study_design_scores_gemma":[0.0028209512,0.000060311068,0.00003799778,0.00012849196,0.00044967717,0.0000011027628,0.00014220239,0.00814425,0.00029647155,0.9790522,0.008464581,0.0004017807],"about_ca_topic_score_codex":0.000010269475,"about_ca_topic_score_gemma":0.000004119318,"teacher_disagreement_score":0.10639371,"about_ca_system_score_codex":0.00007970231,"about_ca_system_score_gemma":0.00007133844,"threshold_uncertainty_score":0.9999204},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6740976,0.00032677132,0.2811926,0.0008330348,0.000042552518,0.0018166526,0.00012344263,0.00016329708,0.041404042],"genre_scores_gemma":[0.9416486,0.00005184929,0.05779273,0.000033857305,0.000032964508,0.00019001347,0.000027565118,0.000030036801,0.00019235296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986581,0.00006800782,0.0005525119,0.00025055505,0.00027338456,0.00019739053],"domain_scores_gemma":[0.9974749,0.0013049463,0.00036840868,0.0007055997,0.00008678798,0.000059365804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008830101,0.00018917359,0.00045532137,0.000038098122,0.00022536425,0.00003690111,0.00020723046,0.0001012222,0.000018321778],"category_scores_gemma":[0.0002849122,0.00013068944,0.00012805198,0.00038158774,0.00041032897,0.000069201604,0.00011573954,0.00020859677,0.000006504047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017964785,0.00008779246,0.00027758355,0.00037480253,0.00007102171,5.6667164e-7,0.0023364723,0.0000016807413,0.0008267848,0.9957805,0.00008787826,0.00013689502],"study_design_scores_gemma":[0.00077705085,0.000007069657,0.00071299064,0.000071466515,0.00023727263,0.0000053950967,0.0010959804,0.00018102994,0.004681041,0.99189216,0.00018717247,0.00015139839],"about_ca_topic_score_codex":0.0000018725715,"about_ca_topic_score_gemma":0.000007745568,"teacher_disagreement_score":0.26755103,"about_ca_system_score_codex":0.000009958227,"about_ca_system_score_gemma":0.000030551168,"threshold_uncertainty_score":0.53293604},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99326783,0.000044226774,0.0012713057,0.00016256254,0.00080102566,0.00055000844,0.000080027436,0.000100280406,0.0037227303],"genre_scores_gemma":[0.9991041,8.4885016e-7,0.00026307648,0.00003388566,0.000067940135,0.00016478838,0.0000072963844,0.000010976363,0.00034709086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991706,0.00029287164,0.00012437154,0.00021005348,0.000086954125,0.000115138115],"domain_scores_gemma":[0.9982302,0.001292808,0.000061171595,0.00034029555,0.00003106693,0.00004443434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019134973,0.00007471626,0.00012702157,0.0000317052,0.0004861615,0.000011224441,0.00016816666,0.000030794687,0.00015636362],"category_scores_gemma":[0.00036625992,0.00007696821,0.000058543024,0.00011425729,0.00011003866,0.000041265204,0.00014387163,0.00012128967,7.565993e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014849218,0.00018000042,0.00007289954,0.000013168667,0.000016252015,2.5083995e-7,0.00039727212,3.0815772e-7,0.00029157515,0.997429,0.0007044002,0.0007463523],"study_design_scores_gemma":[0.00074491126,0.000081641556,0.00010783663,0.0000014017246,0.000029080713,0.0000013582695,0.00079467945,0.000006228875,0.00050819956,0.98777026,0.0098661035,0.0000882754],"about_ca_topic_score_codex":0.0000020309399,"about_ca_topic_score_gemma":7.2285053e-7,"teacher_disagreement_score":0.0096587455,"about_ca_system_score_codex":0.000037502967,"about_ca_system_score_gemma":0.000025857482,"threshold_uncertainty_score":0.37392104},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.559261,0.00013512572,0.43155888,0.0036469903,0.00024689423,0.00056792604,0.000024407063,0.000027982718,0.004530808],"genre_scores_gemma":[0.9088515,0.000022667118,0.090012714,0.000059665945,0.00007943332,0.000009749548,4.3214905e-7,0.00001873338,0.0009450856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998619,0.00011119527,0.00066655735,0.000097517244,0.00036235855,0.00014337355],"domain_scores_gemma":[0.9975278,0.0012887863,0.0006694935,0.00024207107,0.00019198195,0.000079903126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014735878,0.0001257548,0.00029123508,0.000026737715,0.000281021,0.000030356718,0.00020482524,0.00010893094,0.00019197547],"category_scores_gemma":[0.00087574637,0.000080580554,0.00042302586,0.00024113816,0.00012514427,0.00015249426,0.000036171987,0.0002630093,0.000004983981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007386572,0.0003486765,0.000082552215,0.00013148529,0.00020120932,1.2796241e-7,0.0017911276,0.00008143025,0.0005496119,0.9951037,0.0016633393,0.00003935618],"study_design_scores_gemma":[0.00046924388,0.00003901536,0.0013405369,0.00008028351,0.000329651,0.00010179192,0.00047597894,0.0015976136,0.00040330086,0.99387234,0.0012041522,0.000086085274],"about_ca_topic_score_codex":5.126136e-7,"about_ca_topic_score_gemma":9.099053e-7,"teacher_disagreement_score":0.3495905,"about_ca_system_score_codex":0.000040995717,"about_ca_system_score_gemma":0.000055385237,"threshold_uncertainty_score":0.32859796},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7373921,0.000060543185,0.24731544,0.0011388329,0.00012045125,0.00023712877,0.000014573292,0.00014996297,0.013570974],"genre_scores_gemma":[0.95887655,0.000025142957,0.038844846,0.000278485,0.00023527164,0.000038453592,0.0000047691783,0.00006203871,0.0016344488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982376,0.00011723215,0.00051387516,0.00026528025,0.00044591734,0.0004201134],"domain_scores_gemma":[0.99797827,0.000739648,0.00020960234,0.00052898587,0.00025323615,0.00029028286],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00051071594,0.00024637315,0.00040743718,0.00007598387,0.00027764947,0.00017200565,0.00030669256,0.00011222336,0.0030628815],"category_scores_gemma":[0.00043819033,0.00017501481,0.0001861431,0.00033875258,0.00009627199,0.0001530552,0.000060884613,0.00058578106,0.00019592782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036823036,0.0006519256,0.0006647913,0.00018979162,0.00019839687,0.00028839443,0.00070730824,0.000007141273,0.0035574785,0.98907673,0.0029912475,0.0016299781],"study_design_scores_gemma":[0.0006751534,0.000070980095,0.00046403814,0.00031632851,0.00011524684,0.0019339562,0.00064977596,0.000058387377,0.009529406,0.9847957,0.0011082609,0.00028278297],"about_ca_topic_score_codex":2.2700128e-7,"about_ca_topic_score_gemma":0.0000019216686,"teacher_disagreement_score":0.22148444,"about_ca_system_score_codex":0.000044443306,"about_ca_system_score_gemma":0.00010324853,"threshold_uncertainty_score":0.99784845},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71147776,0.0039028227,0.2686316,0.010590781,0.00021627016,0.00033814693,0.00040421612,0.000048221715,0.0043901806],"genre_scores_gemma":[0.9885676,0.00096106285,0.009060841,0.00031072632,0.0004351913,0.000022084967,0.000055948993,0.000012012733,0.0005745261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988417,0.000037933176,0.0005345306,0.00020387625,0.000266307,0.000115675204],"domain_scores_gemma":[0.9980391,0.000480888,0.000505704,0.00018457965,0.00067609065,0.00011363601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003470096,0.000120654855,0.00029643642,0.0003696496,0.00019042332,0.00016410218,0.0002563012,0.00006374638,0.00003445377],"category_scores_gemma":[0.000079653095,0.00010661364,0.00027081097,0.00043226132,0.00009894081,0.00020249277,0.00006531462,0.00009947937,0.0000011669418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015772797,0.00018558398,0.0008260409,0.000010805436,0.0016539642,0.0000027168887,0.00018102342,0.000015152412,0.0018183434,0.98421097,0.0005044646,0.010575152],"study_design_scores_gemma":[0.00040633196,0.000026360496,0.001747265,0.00001639256,0.0011019049,0.0000761903,0.0006287884,0.00013074772,0.0016383253,0.96691436,0.027186323,0.00012698615],"about_ca_topic_score_codex":0.000008669985,"about_ca_topic_score_gemma":0.000053924534,"teacher_disagreement_score":0.27708983,"about_ca_system_score_codex":0.000022638318,"about_ca_system_score_gemma":0.000058685397,"threshold_uncertainty_score":0.4347578},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9350842,0.00041784454,0.060135577,0.0017835115,0.00004466933,0.000076697484,0.00006343905,0.000009753784,0.0023842838],"genre_scores_gemma":[0.991867,0.00034585324,0.007507888,0.00007695905,0.000079565,0.000005764775,0.000013747879,0.000003689936,0.00009951808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989636,0.00004768173,0.0005321552,0.000116733514,0.00027399935,0.00006582844],"domain_scores_gemma":[0.99817616,0.00032733046,0.0005406666,0.00016042641,0.00073267275,0.00006274434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003090384,0.00007224233,0.00025729343,0.00031438645,0.000059429392,0.00003149476,0.00027246095,0.000046580946,0.0002429666],"category_scores_gemma":[0.000093036564,0.000057540685,0.00030524735,0.0006652922,0.000113458074,0.0000774072,0.000052262298,0.00010779203,0.0000016967278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000100797515,0.00030704643,0.009166584,0.000006172528,0.001521598,0.000004723237,0.00014951652,0.000021616755,0.0031684714,0.9815038,0.000117973424,0.0040224376],"study_design_scores_gemma":[0.00025293013,0.000024723244,0.014912017,0.000014390922,0.0009915216,0.000072722105,0.0007524385,0.000036341604,0.0069691595,0.97138566,0.0045024627,0.00008561451],"about_ca_topic_score_codex":0.000003921488,"about_ca_topic_score_gemma":0.000016162938,"teacher_disagreement_score":0.056782793,"about_ca_system_score_codex":0.00000960136,"about_ca_system_score_gemma":0.000033122837,"threshold_uncertainty_score":0.2660314},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07481531,0.00003604164,0.9224707,0.0018985162,0.00020157431,0.00014325813,0.00017430216,0.000021935342,0.00023837088],"genre_scores_gemma":[0.9428797,0.000016660442,0.055027857,0.00033180913,0.00008384914,0.00014921153,0.00036788607,0.000010081972,0.0011329417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936587,0.000043981152,0.00016448452,0.0002546715,0.000079509155,0.00009146638],"domain_scores_gemma":[0.9988592,0.00073301396,0.00006275279,0.00015644295,0.00010869879,0.00007983801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013787947,0.00007446353,0.00014476161,0.00008851206,0.00024372696,0.00012246953,0.00004442142,0.000017664954,0.00007803768],"category_scores_gemma":[0.00029335468,0.00007305194,0.000093479895,0.00046101204,0.000010352025,0.00013601771,0.000041671537,0.000051934836,0.0000019484453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013727499,0.0000696461,0.00031369727,0.0000046188347,0.00040793352,2.6018586e-7,0.00021854328,0.00008099292,0.004925531,0.9884817,0.0042154477,0.0012678973],"study_design_scores_gemma":[0.00012042746,0.000018432915,0.0007894762,0.000006614359,0.0004714383,0.0000016014061,0.00037136575,0.076858826,0.00066809653,0.91642475,0.004186512,0.000082472805],"about_ca_topic_score_codex":0.000028861981,"about_ca_topic_score_gemma":0.0007553624,"teacher_disagreement_score":0.8680644,"about_ca_system_score_codex":0.000006856165,"about_ca_system_score_gemma":0.000016411344,"threshold_uncertainty_score":0.29789716},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88326573,0.000020648824,0.005967106,0.00004312543,0.00016297611,0.0001153495,0.000012512976,0.000048177742,0.11036436],"genre_scores_gemma":[0.99399114,0.000008343528,0.003493451,0.0000054431816,0.00003484822,0.0000012415351,0.0000053194317,0.000007766201,0.002452469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990147,0.00012652736,0.0002750446,0.00018282,0.00025605783,0.00014485122],"domain_scores_gemma":[0.99852353,0.00058267557,0.00027693267,0.00036392134,0.00019068448,0.000062245046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024320195,0.00012173941,0.00019310619,0.00010618755,0.00088342105,0.000017804527,0.00037089453,0.00006943511,0.000010137207],"category_scores_gemma":[0.00007756205,0.00010798925,0.00016600102,0.00037493627,0.000925984,0.00014761362,0.000080719714,0.00012941913,0.0000062453723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045289504,0.000095163654,0.015757505,0.000033656197,0.00007033262,0.000008416146,0.000074535725,0.00016342355,0.008092162,0.97535753,0.000083854524,0.00021810342],"study_design_scores_gemma":[0.0020595866,0.00012942131,0.1301829,0.00067842426,0.0005622251,0.0003310086,0.0011543952,0.0013684862,0.045702297,0.7480483,0.06898095,0.0008019852],"about_ca_topic_score_codex":0.000045264638,"about_ca_topic_score_gemma":0.000015772346,"teacher_disagreement_score":0.22730924,"about_ca_system_score_codex":0.000043723445,"about_ca_system_score_gemma":0.00007228602,"threshold_uncertainty_score":0.679465},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97368205,0.00006957462,0.0157669,0.0024302609,0.00035665612,0.0011577184,0.00013634433,0.0004834805,0.005917047],"genre_scores_gemma":[0.9183437,0.00019960069,0.07092199,0.00032407726,0.0006572177,0.00042423792,0.000057395166,0.0002958312,0.0087759355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997974,0.00006336564,0.0006864328,0.0002514651,0.00043985446,0.0005849056],"domain_scores_gemma":[0.997845,0.0008475085,0.00039577397,0.0005573788,0.00011375141,0.00024059892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012867207,0.00030247113,0.00043220358,0.00032290703,0.00059335463,0.0002090015,0.00043799082,0.0001184122,0.00012559112],"category_scores_gemma":[0.00044854006,0.00023774232,0.0004972521,0.0006757667,0.0001316141,0.00014433455,0.000049973216,0.0003556872,0.00019076887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002902937,0.00016230314,0.000019956044,0.00022172583,0.00012580764,0.000016217833,0.0010683627,0.000039487946,0.0014201263,0.9789055,0.017790996,0.000200503],"study_design_scores_gemma":[0.00058183615,0.00017197781,0.000057027934,0.00023538679,0.00012347582,0.000123466,0.0008425697,0.0022695498,0.0022955027,0.9879256,0.005085203,0.0002884015],"about_ca_topic_score_codex":2.532001e-7,"about_ca_topic_score_gemma":0.0000022876377,"teacher_disagreement_score":0.0553383,"about_ca_system_score_codex":0.000043663338,"about_ca_system_score_gemma":0.000045578236,"threshold_uncertainty_score":0.96948504},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9946626,0.0010679561,0.0002370335,0.0012018615,0.00023499638,0.00016942552,0.0000051830093,0.000014937544,0.0024060116],"genre_scores_gemma":[0.9992206,0.00035416646,0.000052322204,0.000039446353,0.000026901229,0.0000040606515,0.0000011071816,0.000022110904,0.0002792547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831814,0.00024391476,0.0005619304,0.00012543841,0.00045289219,0.00029768876],"domain_scores_gemma":[0.9972887,0.0008211478,0.0007831649,0.0005454716,0.0005138243,0.000047680813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014096475,0.00014656234,0.00041235605,0.00014002249,0.000093128554,0.000008243331,0.0004261379,0.000060420803,0.00001832304],"category_scores_gemma":[0.0005607178,0.0001014831,0.00019686755,0.0008845057,0.00010267894,0.000045096265,0.00002891596,0.00055823394,0.0000027938124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000727266,0.00089658133,0.000026872696,0.000052796433,0.00015755784,0.0000043635227,0.0002834655,0.000024268356,0.0066623166,0.9907397,0.00091506005,0.00016425992],"study_design_scores_gemma":[0.0004928882,0.0007826995,0.00009886717,0.0000949127,0.00011325673,0.00004838082,0.00006944371,0.0000057054795,0.15380934,0.8439502,0.00046232488,0.00007197473],"about_ca_topic_score_codex":0.0000016357792,"about_ca_topic_score_gemma":0.0000021314897,"teacher_disagreement_score":0.14714701,"about_ca_system_score_codex":0.00008530659,"about_ca_system_score_gemma":0.00034382826,"threshold_uncertainty_score":0.41383606},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87401617,0.00038143623,0.06488654,0.031298567,0.000101276244,0.004207881,0.000104095336,0.000765672,0.024238368],"genre_scores_gemma":[0.9693589,0.000005499998,0.027509885,0.0016457548,0.00020192366,0.00044359002,0.0000051975267,0.00007153947,0.00075766287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981346,0.00014113763,0.0004469771,0.00042928255,0.0004309348,0.00041702762],"domain_scores_gemma":[0.99800396,0.00062808674,0.00012722336,0.0008895545,0.00008810794,0.0002630917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055000576,0.00030055796,0.0004041676,0.00008513636,0.00032214107,0.00007698149,0.00060308434,0.00007750161,0.0006539988],"category_scores_gemma":[0.00047849273,0.00017965828,0.00014786283,0.0007959528,0.00018319617,0.0001166054,0.00012667933,0.0002628299,0.00042509646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014074783,0.00014792496,0.000054924232,0.00012698025,0.00009266145,0.000008430507,0.0038931947,0.000014271013,0.00028479,0.9836901,0.011363134,0.0001828721],"study_design_scores_gemma":[0.0006680692,0.00015877547,0.00017125958,0.00006528829,0.0001126892,0.000037556485,0.0007989066,0.0011694793,0.00057599763,0.99014664,0.0058057164,0.00028962526],"about_ca_topic_score_codex":0.0000038704256,"about_ca_topic_score_gemma":0.000006591539,"teacher_disagreement_score":0.095342785,"about_ca_system_score_codex":0.00001567039,"about_ca_system_score_gemma":0.00004548569,"threshold_uncertainty_score":0.7326252},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99496037,0.001808947,0.00019709466,0.00035559802,0.00007513018,0.00016140507,0.00002350857,0.00012851195,0.0022894093],"genre_scores_gemma":[0.9832268,0.0006966115,0.014330643,0.00010239895,0.00005358966,0.000015913489,0.000023975648,0.000027273401,0.0015228131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905396,0.00006807922,0.0002661871,0.00031039026,0.00011345392,0.00018792354],"domain_scores_gemma":[0.9990351,0.0004376853,0.0000647115,0.00025589098,0.00007843582,0.00012817269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022351292,0.00014707122,0.00021575489,0.00011839759,0.00017315678,0.000041058203,0.000069935435,0.000121702935,0.00010141031],"category_scores_gemma":[0.00028191143,0.00012992209,0.00007487541,0.000574462,0.000105675244,0.00007493953,0.000083465566,0.00018973388,0.00002782042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001651114,0.00019629963,0.0013557784,0.00012135288,0.00008549988,0.000028741679,0.0005257497,8.4571207e-7,0.001586517,0.98422647,0.00027954715,0.011576693],"study_design_scores_gemma":[0.0014956953,0.00005939234,0.0046640774,0.0000543469,0.00021579079,0.00023678117,0.0006634668,0.0072154477,0.009297898,0.9673948,0.008270419,0.00043185859],"about_ca_topic_score_codex":0.000006481864,"about_ca_topic_score_gemma":0.000006271303,"teacher_disagreement_score":0.016831638,"about_ca_system_score_codex":0.0000035321932,"about_ca_system_score_gemma":0.000016679029,"threshold_uncertainty_score":0.5298069},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89243793,0.0029411458,0.06709124,0.0031884916,0.000245451,0.0010729083,0.000075717544,0.00033378915,0.032613326],"genre_scores_gemma":[0.9373958,0.0002481512,0.046392318,0.0011181006,0.000120717974,0.00034286882,0.000014640717,0.000036500827,0.014330878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991999,0.000035989524,0.00019623319,0.00022545911,0.00008939241,0.00025302323],"domain_scores_gemma":[0.9989826,0.000497571,0.00005461979,0.00031248623,0.000080840924,0.0000718674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004302847,0.00013939105,0.00018799296,0.00019992994,0.00029422808,0.00007169576,0.0001629317,0.00009708436,0.000023984403],"category_scores_gemma":[0.0004095019,0.00012821615,0.0001025942,0.00037829424,0.00016675882,0.000113018184,0.00005176273,0.00009968757,0.000009711049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028652592,0.00007656147,0.0014103731,0.00012411422,0.00008445339,0.0000013184372,0.00026921032,0.0000048595075,0.00009732301,0.9715988,0.022379886,0.0039244182],"study_design_scores_gemma":[0.00031765684,0.000021613165,0.0005211051,0.00003686847,0.00009816142,0.0000056346084,0.00013941058,0.0002816754,0.0010709177,0.6039787,0.39341345,0.00011480819],"about_ca_topic_score_codex":0.0000050148346,"about_ca_topic_score_gemma":0.000019865587,"teacher_disagreement_score":0.37103355,"about_ca_system_score_codex":0.000023472681,"about_ca_system_score_gemma":0.000085710584,"threshold_uncertainty_score":0.5228503},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8907372,0.00019937813,0.09827881,0.0011142672,0.00008088067,0.00053334376,0.000039573297,0.000031765736,0.00898478],"genre_scores_gemma":[0.9835943,0.00004875724,0.015935918,0.00014501656,0.000026591531,0.000027736614,0.0000021766905,0.000027490014,0.00019202447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805105,0.00021685773,0.00079664384,0.00015944657,0.0005087389,0.00026724418],"domain_scores_gemma":[0.9972576,0.00148034,0.0004335081,0.0006069022,0.00014506,0.00007661395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015407465,0.00020452292,0.00045146368,0.0001321366,0.0001824318,0.00006202933,0.00046709646,0.00008226053,0.000044272714],"category_scores_gemma":[0.00076601625,0.00013107082,0.00031544967,0.0004560615,0.00012000086,0.0000728637,0.00005176696,0.00055743434,0.000008463554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003673955,0.0005995579,0.0000067866276,0.00013106657,0.000056876837,0.000018404646,0.0034082553,0.0054632896,0.0006558161,0.9891994,0.00037571054,0.00004810222],"study_design_scores_gemma":[0.0010746673,0.000047168003,0.000018204693,0.00032459025,0.00010160696,0.000256662,0.00185973,0.02471007,0.0008513137,0.97059697,0.000017792281,0.00014121807],"about_ca_topic_score_codex":4.864563e-7,"about_ca_topic_score_gemma":0.000007303519,"teacher_disagreement_score":0.09285709,"about_ca_system_score_codex":0.000023544228,"about_ca_system_score_gemma":0.00009081382,"threshold_uncertainty_score":0.5344913},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9896912,0.00031036287,0.00091085554,0.0043407395,0.000018137815,0.0005837016,0.000117696574,0.00007436174,0.00395292],"genre_scores_gemma":[0.93063843,0.000154789,0.06875814,0.00014609865,0.0000017567426,0.0001965269,0.0000037940658,0.000019414414,0.00008107973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986127,0.0003121544,0.0004894301,0.00015010733,0.0002722734,0.00016335193],"domain_scores_gemma":[0.9946265,0.0014521285,0.000634846,0.003157095,0.00007495377,0.000054471955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076195603,0.00012740228,0.00037756283,0.00004116625,0.0005879564,0.00000848597,0.0021568947,0.00002150855,0.000058781723],"category_scores_gemma":[0.0002706064,0.00009959279,0.0003982988,0.0009853223,0.002482709,0.00003957897,0.00217382,0.00029655098,0.0000016952235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005888005,0.00048059487,0.0006911952,0.000066385546,0.00011504346,1.7570631e-8,0.0014917991,0.0000033980302,0.002563632,0.9924392,0.0016268376,0.0005160051],"study_design_scores_gemma":[0.00012865041,0.00004753486,0.00085807417,0.000024115612,0.00013908387,0.0000068390495,0.0028948223,0.00040196461,0.0007128773,0.9939607,0.000724531,0.00010084894],"about_ca_topic_score_codex":0.000021063199,"about_ca_topic_score_gemma":0.000002463063,"teacher_disagreement_score":0.06784728,"about_ca_system_score_codex":0.000018836845,"about_ca_system_score_gemma":0.00002757908,"threshold_uncertainty_score":0.91476446},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9821421,0.000018726601,0.0008389402,0.0002659476,0.00007038318,0.00040968283,0.00003923221,0.0003660909,0.015848912],"genre_scores_gemma":[0.9911934,0.00001866252,0.0076681282,0.000022120767,0.000030681957,0.00013586538,0.000028835317,0.000046294903,0.0008559986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985019,0.000048285678,0.00047363457,0.00024143324,0.00027269183,0.00046203262],"domain_scores_gemma":[0.9987404,0.00048226342,0.00012921593,0.00052155193,0.000032291864,0.000094294344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005752161,0.0002071151,0.00030203888,0.00022891045,0.00012767946,0.000054231015,0.0003540707,0.00008646605,0.00013885606],"category_scores_gemma":[0.00020199419,0.00018463602,0.00013564844,0.000906968,0.00010395004,0.00014697452,0.000088219545,0.00020468624,0.00031921375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007037483,0.0001242916,0.0008433619,0.00016399156,0.00002650284,0.000011414245,0.0025619082,0.00003536806,0.00048341622,0.9946737,0.0009813638,0.00008761264],"study_design_scores_gemma":[0.00036901276,0.000031821888,0.0015116697,0.0000791618,0.000041693736,0.000006670516,0.0024555784,0.0040017343,0.0011109237,0.9898877,0.00025845965,0.00024553286],"about_ca_topic_score_codex":0.000009633573,"about_ca_topic_score_gemma":0.00008115315,"teacher_disagreement_score":0.014992913,"about_ca_system_score_codex":0.000024721021,"about_ca_system_score_gemma":0.000022048856,"threshold_uncertainty_score":0.75292385},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50991815,0.000026193202,0.48915386,0.00014639995,0.00020654236,0.00011227455,0.0000061867963,0.000247284,0.00018308767],"genre_scores_gemma":[0.99848616,0.00006165745,0.0013202105,0.000043281187,0.000017561448,0.000037407557,2.1615993e-7,0.000008237125,0.000025279905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920464,0.000008728703,0.00009990238,0.00023175307,0.00016309036,0.00029186657],"domain_scores_gemma":[0.9995029,0.00018891279,0.000015098661,0.00015255959,0.000027626174,0.000112918795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000492806,0.00010397047,0.00010823484,0.00010343775,0.00038555206,0.00005235162,0.000092834045,0.000039738443,0.0000061941955],"category_scores_gemma":[0.000012027089,0.00009952205,0.000028287624,0.0015928942,0.00024026449,0.00015309289,0.0000029008772,0.000110593086,0.000007894998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019733938,0.00006264836,0.000074887386,0.00006881072,0.00004257381,0.0000069960106,0.0002896401,0.16595659,0.0017342964,0.7877893,0.0006146211,0.043339916],"study_design_scores_gemma":[0.0006735978,0.00012138169,0.0033414068,0.00014412482,0.000091577946,0.00009602428,0.00034608625,0.33101287,0.0022788807,0.6601032,0.0011773738,0.0006134536],"about_ca_topic_score_codex":0.000004069504,"about_ca_topic_score_gemma":0.000009087479,"teacher_disagreement_score":0.48856798,"about_ca_system_score_codex":0.000021773194,"about_ca_system_score_gemma":0.000022450537,"threshold_uncertainty_score":0.40583912},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9807152,0.00014686145,0.0029977523,0.0002480804,0.00025142025,0.00025873128,0.00040780733,0.00016136498,0.014812757],"genre_scores_gemma":[0.9702614,0.00007403125,0.027383022,0.00035049644,0.0002576583,0.00051784393,0.00020981408,0.00021924227,0.0007264948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966635,0.00008570624,0.0011332176,0.000633583,0.00081178796,0.00067217083],"domain_scores_gemma":[0.995599,0.00111234,0.0009583792,0.0020100744,0.00011236391,0.00020787574],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093038724,0.0004972365,0.00049491395,0.000082402,0.00061234785,0.00017645353,0.0009593192,0.00046940282,0.00019362473],"category_scores_gemma":[0.0004019776,0.00046745903,0.0006145582,0.0004973287,0.00050357496,0.00017215533,0.00068187027,0.0005536756,0.00046495613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003562458,0.00043638257,0.000003557318,0.0013979226,0.00032149098,0.000020829155,0.0029771517,0.000056308927,0.013403337,0.9803649,0.0008801594,0.00010231326],"study_design_scores_gemma":[0.0009868067,0.00010908711,0.000024844494,0.00057331595,0.0009286751,0.0001829437,0.0065352484,0.19802299,0.13467,0.65328103,0.0038749475,0.00081007846],"about_ca_topic_score_codex":0.000009822013,"about_ca_topic_score_gemma":0.00004771731,"teacher_disagreement_score":0.32708386,"about_ca_system_score_codex":0.000016651546,"about_ca_system_score_gemma":0.00023686365,"threshold_uncertainty_score":0.99977773},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96968013,0.00061279995,0.027237723,0.00054826477,0.000027793423,0.00015008605,0.0000071287773,0.000011818123,0.0017242266],"genre_scores_gemma":[0.9966897,0.0020337754,0.00041449675,0.000005898791,0.000022719112,0.000008305518,3.7294626e-7,0.000009932173,0.0008148412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987028,0.00008181848,0.00031504178,0.0000764015,0.00015718736,0.0006667369],"domain_scores_gemma":[0.9987776,0.00045171654,0.00033795767,0.00029018163,0.00011210415,0.000030393694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001996728,0.0000774533,0.00014410676,0.000047877747,0.00021539378,0.000006693111,0.0003392409,0.000037190734,0.000009014733],"category_scores_gemma":[0.00015934664,0.000050762745,0.00014487315,0.00024955394,0.00014390724,0.00004720312,0.000022727307,0.000581981,0.0000028599252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029360386,0.000111506204,0.0010863829,0.000004279605,0.00007914186,9.741837e-8,0.000080590915,0.0000011968567,0.0036311669,0.98548067,0.000052949817,0.009442659],"study_design_scores_gemma":[0.00023275061,0.0000682012,0.001012376,0.0000091943075,0.000029288547,0.00010001261,0.00055472343,0.000013713563,0.0028317561,0.9943968,0.00070068974,0.000050509767],"about_ca_topic_score_codex":0.000012339973,"about_ca_topic_score_gemma":0.0003315093,"teacher_disagreement_score":0.027009498,"about_ca_system_score_codex":0.000048860125,"about_ca_system_score_gemma":0.00026635043,"threshold_uncertainty_score":0.252845},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038608763,0.0040181438,0.93765485,0.005265942,0.00008318841,0.0066036615,0.0005559141,0.0009743548,0.006235193],"genre_scores_gemma":[0.9708442,0.000620474,0.01323388,0.00023951368,0.0006319694,0.012022347,0.00020817597,0.00006496873,0.0021344486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990921,0.000019110927,0.00026209647,0.0003774318,0.000076371805,0.0001728675],"domain_scores_gemma":[0.99879986,0.0006897529,0.00005639649,0.00024961005,0.00009272228,0.00011167528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022581294,0.00014684124,0.00014834371,0.00011195183,0.00044168613,0.00009547709,0.0000957979,0.0001062484,0.000028883818],"category_scores_gemma":[0.00003856097,0.0001400882,0.00005966142,0.00033240713,0.00006864292,0.00014311066,0.00002620337,0.00013502236,0.000047824775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005808816,0.000060487124,0.0000057354096,0.00017902239,0.00003409773,9.3900226e-8,0.00009717599,8.8923616e-7,0.001897079,0.98375225,0.0006570752,0.0133103],"study_design_scores_gemma":[0.00015005759,0.000017809994,0.000041057163,0.000017655699,0.00010232446,0.000014025298,0.0001286006,0.0028010388,0.0007641666,0.66976076,0.32606536,0.00013712692],"about_ca_topic_score_codex":0.0000019114957,"about_ca_topic_score_gemma":0.000007738529,"teacher_disagreement_score":0.9322355,"about_ca_system_score_codex":0.000012856373,"about_ca_system_score_gemma":0.000029414134,"threshold_uncertainty_score":0.57126313},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15028854,0.00097013917,0.788958,0.0050392714,0.000520417,0.0005216941,0.00043357373,0.00072714745,0.05254121],"genre_scores_gemma":[0.96253693,0.00012756416,0.028968578,0.00014536454,0.000093093884,0.00015914945,0.000030461757,0.000032192573,0.007906678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907607,0.000058020007,0.00024117125,0.0002358501,0.0001687055,0.00022021342],"domain_scores_gemma":[0.99891603,0.0004664648,0.000051738843,0.0003782694,0.00008385952,0.00010363875],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015354822,0.00012401128,0.00016379308,0.00015773781,0.0003483304,0.000046150984,0.00014509757,0.00008165338,0.002621905],"category_scores_gemma":[0.000051328247,0.00012836947,0.00019376789,0.001257504,0.000043534095,0.0000975675,0.000005416779,0.00020726472,0.00018651066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009357976,0.0006181415,0.000043831416,0.000072091236,0.00010018603,0.000014372463,0.0003098499,0.000019867179,0.0036591394,0.9807267,0.004210549,0.010215886],"study_design_scores_gemma":[0.0005003686,0.000019276957,0.00030971103,0.000017034823,0.00019585674,0.00007212995,0.00041456858,0.00011376485,0.03290609,0.86974615,0.09544385,0.0002611916],"about_ca_topic_score_codex":0.000011015426,"about_ca_topic_score_gemma":0.000057722456,"teacher_disagreement_score":0.81224835,"about_ca_system_score_codex":0.000026844253,"about_ca_system_score_gemma":0.00006744169,"threshold_uncertainty_score":0.9982898},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7971974,0.00034979885,0.1293543,0.013169827,0.00034369397,0.0008511237,0.000479911,0.00074735214,0.057506625],"genre_scores_gemma":[0.95253503,0.00022771627,0.037714455,0.00013950854,0.00005191035,0.0002916275,0.0005797326,0.00009829601,0.008361718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99393576,0.0037065367,0.00067440496,0.00090377516,0.00037560627,0.00040394],"domain_scores_gemma":[0.9905881,0.0042960523,0.000760854,0.003183565,0.00095363724,0.00021775601],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0034081999,0.00043970213,0.0005199899,0.00021093508,0.00036039666,0.0003163632,0.0015627844,0.00040325968,0.00051790354],"category_scores_gemma":[0.0015427299,0.00040530186,0.00037794295,0.00029259585,0.00028480595,0.00012658865,0.0012232807,0.0006825294,0.00012589667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009456177,0.0004584796,0.0006231137,0.000080480924,0.00011393884,0.000001929399,0.005023111,1.2094874e-7,0.016330445,0.9676806,0.00097553903,0.008702839],"study_design_scores_gemma":[0.00042899852,1.13151074e-7,0.0018436421,0.0020126149,0.000088132314,0.0000020323307,0.000060477654,0.00023477052,0.06523061,0.9213114,0.00830845,0.00047877716],"about_ca_topic_score_codex":0.00022515115,"about_ca_topic_score_gemma":0.00027697528,"teacher_disagreement_score":0.15533766,"about_ca_system_score_codex":0.00007162641,"about_ca_system_score_gemma":0.00011535019,"threshold_uncertainty_score":0.9998399},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9845831,0.00018549249,0.014182861,0.0001983898,0.000065259344,0.00013808734,0.000009627551,0.00001726278,0.00061994867],"genre_scores_gemma":[0.997692,0.00003349185,0.002083777,0.000022957482,0.000037233214,0.000011229804,0.0000022555225,0.000020935844,0.000096131385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987451,0.00009346483,0.0004462304,0.000098015626,0.0003078032,0.00030940064],"domain_scores_gemma":[0.9989449,0.00019112602,0.00052603555,0.00018162327,0.000094047755,0.00006228264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041723042,0.00011754601,0.00028771206,0.0001506683,0.00026272458,0.000007698808,0.00023830621,0.000023198823,0.00023294154],"category_scores_gemma":[0.000028738523,0.0000932498,0.00018769491,0.00033887668,0.0001025133,0.00006724412,0.000032272175,0.0006413151,6.589223e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103857536,0.00019433889,0.0008399032,0.000013679263,0.00022980072,0.0000030409735,0.0003099457,0.00010341268,0.0015788439,0.9962025,0.00020586603,0.00021477684],"study_design_scores_gemma":[0.000856692,0.00073579233,0.00011374447,0.000020342748,0.00016619635,0.0007941286,0.00082951284,0.000050395636,0.006714884,0.98898137,0.0006272244,0.00010971018],"about_ca_topic_score_codex":0.000003705738,"about_ca_topic_score_gemma":0.000015167982,"teacher_disagreement_score":0.013108917,"about_ca_system_score_codex":0.00010457383,"about_ca_system_score_gemma":0.00019485556,"threshold_uncertainty_score":0.38026166},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9795759,0.001231626,0.01029987,0.001368953,0.0000352788,0.0012892022,0.00040034758,0.00017216329,0.005626709],"genre_scores_gemma":[0.9961301,0.00007628732,0.00239418,0.00007632478,0.000044000994,0.0008063761,0.000029606585,0.000014504238,0.00042862172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993381,0.000034697303,0.0002278753,0.00016779415,0.00012700817,0.000104553794],"domain_scores_gemma":[0.99932873,0.00019220836,0.00012254878,0.00026638497,0.00004077848,0.000049371025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018199987,0.00007561951,0.00012956544,0.000075436175,0.00035709335,0.0000067402184,0.00017467797,0.000022604117,0.00026148514],"category_scores_gemma":[0.000019952317,0.00007427838,0.00005081678,0.0003748938,0.000037319056,0.000034289154,0.00010536344,0.00010872618,0.000015701333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025566837,0.00015108236,0.0000647281,0.00004049654,0.000016470542,1.4210563e-7,0.00016414851,0.0000044799285,0.0041829697,0.9942441,0.00045228624,0.00067654095],"study_design_scores_gemma":[0.00022382179,0.000041264564,0.00028082562,0.0000048390775,0.000074824275,0.000022443874,0.00055843405,0.0007704141,0.0035238073,0.89177,0.102573216,0.00015610138],"about_ca_topic_score_codex":0.0000022504569,"about_ca_topic_score_gemma":9.630402e-7,"teacher_disagreement_score":0.10247409,"about_ca_system_score_codex":0.000007244105,"about_ca_system_score_gemma":0.00001890263,"threshold_uncertainty_score":0.30289844},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93888134,0.007101513,0.032558788,0.008630997,0.0005634418,0.0019046984,0.0014347995,0.0003968576,0.0085275825],"genre_scores_gemma":[0.93879086,0.0003653691,0.0265764,0.0018193804,0.00024100745,0.0004083533,0.000036621583,0.00015753983,0.031604458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99566406,0.00078595016,0.0012298824,0.0007356938,0.00062632456,0.00095808634],"domain_scores_gemma":[0.9944789,0.0008245573,0.0008237413,0.003087745,0.00045703066,0.0003280335],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013976257,0.00060625264,0.00083664473,0.0002332601,0.00068515737,0.00017448739,0.0012978936,0.0006470294,0.0012487808],"category_scores_gemma":[0.000859127,0.0005347135,0.0008471345,0.0014864781,0.00048389126,0.0002206133,0.0007394424,0.0009202226,0.00006430767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053078034,0.0015260071,0.011467162,0.0006048692,0.00033762582,0.000039724102,0.0013519702,0.00009935329,0.06762761,0.90147996,0.01402475,0.0013878713],"study_design_scores_gemma":[0.00085355743,0.00010544599,0.019320428,0.00045599157,0.00045489887,0.00025990777,0.0011625276,0.0048013423,0.45262122,0.501801,0.017370984,0.0007926815],"about_ca_topic_score_codex":0.00045261913,"about_ca_topic_score_gemma":0.002439559,"teacher_disagreement_score":0.39967898,"about_ca_system_score_codex":0.00022673253,"about_ca_system_score_gemma":0.00079198845,"threshold_uncertainty_score":0.99971044},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34046263,0.00011952394,0.05463816,0.002293097,0.00018745154,0.0011543912,0.00008445253,0.0009397457,0.60012054],"genre_scores_gemma":[0.91617393,0.0000043841083,0.07374539,0.00013673113,0.000118715594,0.000022785865,0.000007769189,0.000039341,0.009750948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984457,0.0000368968,0.00056420185,0.00029675223,0.0002922431,0.0003642207],"domain_scores_gemma":[0.99654526,0.0022409968,0.0001457485,0.0008396042,0.00004367713,0.00018469503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012249378,0.00021232475,0.0002684546,0.00013069985,0.00016515185,0.00003358365,0.0003111167,0.00009270554,0.0003904481],"category_scores_gemma":[0.0009928541,0.00017136938,0.00014268866,0.00027163848,0.000085550455,0.00006711815,0.000046746893,0.00016495807,0.0006971703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009170471,0.0002149286,0.0000055722767,0.000044499786,0.000030352707,0.000003944708,0.001476407,2.7945427e-7,0.00035020005,0.96060634,0.033518013,0.0036577438],"study_design_scores_gemma":[0.0004503182,0.00008433403,0.00040773308,0.0000961695,0.000041458934,0.000008305716,0.0006794872,0.000025126368,0.007099372,0.9785617,0.012366362,0.00017962835],"about_ca_topic_score_codex":0.000004632916,"about_ca_topic_score_gemma":0.00001792945,"teacher_disagreement_score":0.5903696,"about_ca_system_score_codex":0.000025851996,"about_ca_system_score_gemma":0.000024870547,"threshold_uncertainty_score":0.8960947},"labels":[],"label_agreement":null},{"id":"W35075569","doi":"10.1007/s00604-022-05173-0","title":"Eccentricity sequences and eccentricity sets in digraphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Research Council of Thailand","keywords":"Digraph; Eccentricity (behavior); Mathematics; Combinatorics; Sequence (biology); Vertex (graph theory); Eccentric; Set (abstract data type); Order (exchange); Discrete mathematics; Physics; Graph; Computer science; Biology","score_opus":0.03507426591244646,"score_gpt":0.283843585084521,"score_spread":0.24876931917207457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35075569","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99717903,0.00016827266,0.00002408225,0.00016064069,0.00015086123,0.00025924708,0.0000075393477,0.00007815801,0.001972145],"genre_scores_gemma":[0.99924296,0.0002012406,0.00039733486,0.00005729904,0.000002835705,0.00002860867,0.0000031274324,0.000010639118,0.000055947035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990168,0.000092542316,0.00024132215,0.00024033544,0.00015780263,0.00025116286],"domain_scores_gemma":[0.9991713,0.0003560032,0.00008541444,0.00025433968,0.000040466133,0.000092486844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026137588,0.00013455709,0.00020860975,0.00012157748,0.00020211736,0.000016628928,0.00017447736,0.00007921496,0.000026965761],"category_scores_gemma":[0.00015741619,0.00012741386,0.000047764224,0.00056509266,0.0001644765,0.00012731439,0.00005786595,0.00017047966,0.000012559754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072408243,0.00021399677,0.08703338,0.00001693223,0.000009371935,0.00002054338,0.00043446003,0.000002311344,0.00003218822,0.9113411,0.00072727335,0.00016123876],"study_design_scores_gemma":[0.00055382797,0.000022352839,0.019227367,0.00001499226,0.000010328089,0.000026803116,0.000060380804,0.00012290757,0.00086527783,0.9786258,0.00032617702,0.00014380949],"about_ca_topic_score_codex":0.00005889143,"about_ca_topic_score_gemma":0.000016567436,"teacher_disagreement_score":0.06780601,"about_ca_system_score_codex":0.000029141569,"about_ca_system_score_gemma":0.000026529337,"threshold_uncertainty_score":0.5195787},"labels":[],"label_agreement":null},{"id":"W36680195","doi":"10.3390/v15010155","title":"Eigenvalues of the Discrete p-Laplacian for Graphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Eigenvalues and eigenvectors; Laplacian matrix; Laplace operator; Pure mathematics; Combinatorics; Mathematical analysis; Physics","score_opus":0.026469833968516262,"score_gpt":0.2914175538317178,"score_spread":0.26494771986320154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W36680195","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9902866,0.000048420105,0.00015549317,0.00018005133,0.0004931874,0.0005562825,0.000019839503,0.000034865196,0.008225245],"genre_scores_gemma":[0.99821717,0.0000038131511,0.0012526824,0.00003249511,0.0000016812004,0.000094871124,0.0000013923429,0.000015010239,0.00038090235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938536,0.00007652708,0.00018444036,0.00011609338,0.00010097026,0.0001366191],"domain_scores_gemma":[0.99904954,0.00031265046,0.000113677444,0.0004365832,0.000057106554,0.000030461144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033451378,0.00008537697,0.00013216473,0.00002571202,0.00016701008,0.00000836362,0.00022027711,0.000046290566,0.000018682309],"category_scores_gemma":[0.00026957333,0.00006028341,0.00015111001,0.00021158264,0.000098771314,0.000034225446,0.000019497156,0.00006172611,0.0000032561438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041159974,0.00007111548,0.00086788356,0.000026448917,0.000022303639,3.9969763e-8,0.00020954161,2.8355876e-7,0.00057246914,0.9966717,0.0015108327,0.000043260185],"study_design_scores_gemma":[0.00032239148,0.000025280766,0.00043611022,0.000014569935,0.000038694645,9.176739e-7,0.00010310363,0.0000046562945,0.02372898,0.9720381,0.0032140266,0.00007316212],"about_ca_topic_score_codex":0.0000014720025,"about_ca_topic_score_gemma":0.0000021222456,"teacher_disagreement_score":0.0246336,"about_ca_system_score_codex":0.0000071934523,"about_ca_system_score_gemma":0.000019942638,"threshold_uncertainty_score":0.24582861},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8324591,0.00022917842,0.00030878655,0.0011903015,0.0001424128,0.00024436958,0.0000421987,0.00007783742,0.16530584],"genre_scores_gemma":[0.9854759,0.00003083331,0.0023959584,0.000334987,0.0013852754,0.00007273042,0.000009151412,0.000032841413,0.010262303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992504,0.000078292316,0.00013607864,0.00018844454,0.00017092917,0.00017586135],"domain_scores_gemma":[0.9991247,0.0003220449,0.0000905894,0.00034551646,0.00007065443,0.000046460143],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018432402,0.00011390192,0.00013892994,0.00004210631,0.00030656852,0.0000841494,0.00022432316,0.000046654437,0.0023302683],"category_scores_gemma":[0.000022972461,0.00007228845,0.00007404267,0.0005519416,0.00009782474,0.00007164134,0.000039399292,0.00013187405,0.00010170954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013066213,0.000057875346,0.00018288472,0.000033232627,0.000034773562,0.000013901772,0.0005276546,8.508911e-7,0.00040357394,0.9848006,0.013319205,0.0006124248],"study_design_scores_gemma":[0.00018366182,0.000021191456,0.000674646,0.000010854323,0.000055254568,0.000022426457,0.0015396118,0.000001709365,0.0055573387,0.82148755,0.17030229,0.00014349949],"about_ca_topic_score_codex":0.000002223149,"about_ca_topic_score_gemma":0.0005496821,"teacher_disagreement_score":0.16331303,"about_ca_system_score_codex":0.000008606035,"about_ca_system_score_gemma":0.000045043904,"threshold_uncertainty_score":0.9985817},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9906857,0.0020420875,0.0056099063,0.00078840763,0.00004625798,0.00008309006,0.000009188756,0.00000610806,0.00072922517],"genre_scores_gemma":[0.99850863,0.0004894457,0.0007329998,0.000032893924,0.000051664112,0.0000027170486,9.561052e-7,0.000013635309,0.00016707824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987503,0.00012713268,0.0005420422,0.000086704094,0.00027638001,0.00021743563],"domain_scores_gemma":[0.99786013,0.0009138762,0.0006622132,0.00030588344,0.00022265178,0.00003526977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079791655,0.00009846834,0.00027571234,0.00007088191,0.00006704257,0.0000077604345,0.00030871274,0.00004140588,0.0001241752],"category_scores_gemma":[0.00031010524,0.000064171625,0.00024460861,0.00043831248,0.00008542358,0.000052837928,0.000023499992,0.0003913539,0.0000029756704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045611683,0.00022058732,0.000092004586,0.00003780388,0.00012634147,0.000002568646,0.00017922964,0.0000085081065,0.0041676355,0.99446195,0.00029813722,0.0003596463],"study_design_scores_gemma":[0.00023139018,0.00017254145,0.00010304015,0.00008017203,0.00008032749,0.000035036664,0.0002236392,0.000021909964,0.066482715,0.9314587,0.001051912,0.00005862738],"about_ca_topic_score_codex":0.0000013894087,"about_ca_topic_score_gemma":0.000009103544,"teacher_disagreement_score":0.063003235,"about_ca_system_score_codex":0.000023478891,"about_ca_system_score_gemma":0.00018218889,"threshold_uncertainty_score":0.2616843},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98131776,0.00010693478,0.012458668,0.003986576,0.00004136819,0.00014983567,0.000109801666,0.0000067857877,0.0018222437],"genre_scores_gemma":[0.99910843,0.000054987908,0.0004907965,0.00018575916,0.000041502302,0.000030475976,0.0000073838587,0.0000045161783,0.00007615765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896616,0.00007453164,0.0004063877,0.00008616579,0.0004132144,0.000053562268],"domain_scores_gemma":[0.99818116,0.00072084466,0.00065644074,0.00017782336,0.0002311289,0.000032625187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064790645,0.00006232282,0.00016022766,0.00042307685,0.00020307147,0.000022169728,0.00050711265,0.000014007047,0.00039732337],"category_scores_gemma":[0.000053869622,0.00004262278,0.00024924075,0.0006963676,0.00008107469,0.000040682215,0.000071132315,0.00016403038,0.0000011787259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015862726,0.00021334318,0.001300373,0.0000016376048,0.0010235345,5.7469197e-7,0.00022212193,0.00022263368,0.0003783245,0.9947285,0.00056733226,0.0013257845],"study_design_scores_gemma":[0.00014136672,0.00004657033,0.0027897886,0.000004522673,0.0005056627,0.000017450153,0.001038469,0.00010863719,0.00048217035,0.98881274,0.0059995656,0.000053035175],"about_ca_topic_score_codex":0.0000064979386,"about_ca_topic_score_gemma":0.0000050539684,"teacher_disagreement_score":0.017790634,"about_ca_system_score_codex":0.000015662205,"about_ca_system_score_gemma":0.000019167455,"threshold_uncertainty_score":0.43504122},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96545327,0.00013407452,0.003312497,0.0004591062,0.0004166184,0.0008266593,0.000228595,0.00017852648,0.028990682],"genre_scores_gemma":[0.994348,0.00022228615,0.00017831131,0.000015027187,0.000027747592,0.000006088601,0.000013800267,0.000024892515,0.0051638745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987674,0.00023181156,0.00025353642,0.00043158152,0.00009039927,0.00022531927],"domain_scores_gemma":[0.9966081,0.00086039864,0.00042180775,0.001993825,0.000050133858,0.00006576815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060965767,0.0002016294,0.00031285785,0.00015550783,0.00041775097,0.00002107944,0.0017595073,0.00012671841,0.00034019773],"category_scores_gemma":[0.00016541456,0.00018480918,0.0004337765,0.0005570911,0.00025440418,0.000037993585,0.0014482575,0.00057691865,0.000011056096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006160969,0.00011368349,0.00029035308,0.000057428853,0.00013992048,0.000014151594,0.00010832558,0.000984194,0.000013199418,0.99626946,0.0019067625,0.00004090844],"study_design_scores_gemma":[0.00039401255,0.000029746012,0.00015146007,0.000019843366,0.00018884386,0.0000013318614,0.00046118165,0.0005445784,0.00013372971,0.9941302,0.0037633446,0.00018175492],"about_ca_topic_score_codex":0.000040496005,"about_ca_topic_score_gemma":0.00007721305,"teacher_disagreement_score":0.02889473,"about_ca_system_score_codex":0.00006275181,"about_ca_system_score_gemma":0.00008318829,"threshold_uncertainty_score":0.75363},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13155402,0.0002342651,0.7613076,0.018696127,0.00072720804,0.01028278,0.019943446,0.0005582561,0.05669629],"genre_scores_gemma":[0.9773612,0.000050113325,0.015623718,0.00044023633,0.000103691425,0.0020150002,0.00024043492,0.000056725636,0.004108852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784493,0.000114663926,0.0009006188,0.0004032795,0.00038204,0.00035444918],"domain_scores_gemma":[0.9937155,0.003009812,0.0005446263,0.0020592867,0.00054724,0.000123488],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010754262,0.0004144995,0.00075502996,0.00027671442,0.0003293959,0.00007529839,0.001027238,0.00030274302,0.00015007006],"category_scores_gemma":[0.0021658875,0.00029279562,0.0005264653,0.00066977006,0.00021831492,0.000026379355,0.00070879754,0.0006763839,0.000056365105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004087351,0.0003332289,0.0000011917264,0.00037262106,0.00023674943,5.683223e-7,0.0006835184,0.00056934124,0.00013804236,0.98590064,0.011696479,0.000026761723],"study_design_scores_gemma":[0.0004354697,0.00005150117,0.0000029906194,0.0010214437,0.000407437,0.0000012839256,0.00028089577,0.00075541704,0.004346575,0.991047,0.0013777917,0.00027218647],"about_ca_topic_score_codex":0.000011093786,"about_ca_topic_score_gemma":0.000013467272,"teacher_disagreement_score":0.8458072,"about_ca_system_score_codex":0.00010231447,"about_ca_system_score_gemma":0.00020560114,"threshold_uncertainty_score":0.99995244},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8821495,0.000031101838,0.08788687,0.00032273293,0.00006318014,0.0006082551,0.000017707203,0.000220962,0.02869967],"genre_scores_gemma":[0.9174353,0.000003015714,0.0819686,0.00016332633,0.000019565707,0.00025189403,0.000019820936,0.000019891706,0.00011858469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931914,0.000013034642,0.00021678375,0.00016156357,0.00016980685,0.00011966972],"domain_scores_gemma":[0.9994101,0.00025156024,0.00012513301,0.00014954145,0.000020151469,0.00004352234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002816263,0.00010233994,0.00013892492,0.000069581074,0.000428613,0.000030108795,0.000097433396,0.000023270264,0.000089503825],"category_scores_gemma":[0.000015037012,0.00010309944,0.000030477828,0.0002065614,0.000043348307,0.000028989914,0.00012234249,0.00012045714,0.000010942651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030715253,0.00013704602,0.000004096402,0.000053211897,0.000012781776,5.2021954e-7,0.0013513955,0.00010796341,0.0011452937,0.9896446,0.001697505,0.005842513],"study_design_scores_gemma":[0.00023944284,0.000020633443,0.000019451154,0.0000038776016,0.000028255774,0.000013812133,0.0018376798,0.005500408,0.0003587188,0.9897303,0.0021218113,0.00012560301],"about_ca_topic_score_codex":0.0000014736969,"about_ca_topic_score_gemma":8.7552735e-7,"teacher_disagreement_score":0.035285782,"about_ca_system_score_codex":0.000018891606,"about_ca_system_score_gemma":0.000012823625,"threshold_uncertainty_score":0.42042732},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065208036,0.00018935556,0.013627246,0.00013328604,0.00005640446,0.00086431374,0.00036308603,0.0002030437,0.9780425],"genre_scores_gemma":[0.21748435,0.00040996925,0.0039814417,0.00018182793,0.0001127912,0.00011360279,0.00028062423,0.00023460784,0.77720076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981562,0.0001617686,0.00054516183,0.000541132,0.00032211977,0.00027362767],"domain_scores_gemma":[0.99684006,0.0017662772,0.00025347352,0.0009059721,0.00006149821,0.00017274],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018042609,0.00047128924,0.0010338848,0.00053119805,0.00013417807,0.0000758372,0.00024367317,0.00037875297,0.0014494307],"category_scores_gemma":[0.00008349423,0.00036829623,0.00070936844,0.0002055816,0.00020798437,0.000035243113,0.000082391125,0.00035993208,0.00030706375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054273273,0.00010343989,0.00010008023,0.00012631473,0.0010730445,0.0000025687843,0.000071208146,9.096108e-7,0.0000025286356,0.9942409,0.0007288188,0.0035448065],"study_design_scores_gemma":[0.00015900575,0.00008365998,0.00059253507,0.00011700304,0.0013983719,0.0000025292702,0.000014589709,0.000093052455,0.000007678406,0.9889657,0.008147834,0.00041805202],"about_ca_topic_score_codex":0.0000021932435,"about_ca_topic_score_gemma":0.000030639785,"teacher_disagreement_score":0.21096356,"about_ca_system_score_codex":0.000011483781,"about_ca_system_score_gemma":0.000014512569,"threshold_uncertainty_score":0.9998769},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92950845,0.00056390074,0.067852914,0.00034121348,0.00013243251,0.00040324687,0.000005182435,0.000027200416,0.0011654651],"genre_scores_gemma":[0.9910227,0.00004074834,0.008362845,0.00011341544,0.00017956858,0.0000030684096,0.0000017906137,0.000025069843,0.000250771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987402,0.00005307875,0.0004999797,0.00011839497,0.00016734659,0.0004210289],"domain_scores_gemma":[0.99854016,0.00057821744,0.00043337335,0.00019381063,0.00018804465,0.00006639913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012284386,0.00012197347,0.00029294792,0.00011566522,0.000103821316,0.000018035491,0.00025496347,0.00005535162,0.00009012365],"category_scores_gemma":[0.000108072316,0.00010164807,0.00024693026,0.00019051082,0.000038001708,0.00007559583,0.000021660924,0.00036285617,0.000022084592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000614808,0.00009624209,0.00012234741,0.000035944828,0.00013398871,8.665516e-7,0.0001573842,0.000020424897,0.0035823102,0.99463624,0.00052761316,0.0006251504],"study_design_scores_gemma":[0.001151545,0.00059398514,0.000013205703,0.000055107,0.00008325562,0.00010137316,0.00020775948,0.0005550155,0.0042884788,0.9851782,0.007642882,0.00012924738],"about_ca_topic_score_codex":5.647977e-7,"about_ca_topic_score_gemma":0.0000022135052,"teacher_disagreement_score":0.061514277,"about_ca_system_score_codex":0.000050621344,"about_ca_system_score_gemma":0.00021839756,"threshold_uncertainty_score":0.4145088},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99096054,0.00067896047,0.0018868359,0.00016230773,0.0001627692,0.00013528811,0.000029201932,0.000012381726,0.0059716906],"genre_scores_gemma":[0.9959476,0.00006324686,0.0037092778,0.000020346839,0.00009203458,0.0000030524336,0.000001199103,0.00002040536,0.00014281819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810576,0.00025189653,0.0010733849,0.00009246492,0.00030685225,0.00016964991],"domain_scores_gemma":[0.9969297,0.0010341306,0.0013955212,0.0002875622,0.00027513254,0.0000779778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002153002,0.00014109266,0.00051394955,0.00051955046,0.000057653222,0.0000068980426,0.0003585282,0.000096916614,0.00015049643],"category_scores_gemma":[0.00022663157,0.0001112003,0.0005072479,0.00045979334,0.00033833002,0.00010710669,0.000025375384,0.00019069055,0.0000019704903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001304694,0.00034497076,0.0010885269,0.00006672412,0.00011519415,0.000004841348,0.0001534012,0.0000053881595,0.048791423,0.94700277,0.0015934015,0.0007029117],"study_design_scores_gemma":[0.00049719453,0.000113770075,0.0022455866,0.00010245871,0.00015051776,0.000055367887,0.00029794025,0.0000010674726,0.052923236,0.94318825,0.00033257762,0.00009203046],"about_ca_topic_score_codex":0.0000069258294,"about_ca_topic_score_gemma":0.000009044077,"teacher_disagreement_score":0.0058288723,"about_ca_system_score_codex":0.000008847442,"about_ca_system_score_gemma":0.00005052521,"threshold_uncertainty_score":0.45346168},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98399615,0.000024469466,0.004070704,0.0009750907,0.000046605328,0.0003114698,0.000005263018,0.00005656437,0.010513671],"genre_scores_gemma":[0.99932194,0.0000027573765,0.0002948303,0.0001763246,0.00006501706,0.000013439515,0.0000024992842,0.0000056548497,0.00011753538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937236,0.00010487917,0.0002007202,0.00011454386,0.00007950397,0.00012798335],"domain_scores_gemma":[0.9980452,0.0012977553,0.00010450704,0.0004833305,0.00004135394,0.000027870434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004599117,0.000075371434,0.00013413401,0.000014069332,0.00008391551,0.000007924297,0.00017005172,0.000067065535,0.00012915212],"category_scores_gemma":[0.00027184992,0.000049003498,0.0000672684,0.00014776253,0.000058309342,0.000017036846,0.00001097034,0.00014382522,0.000006722839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028161201,0.00011122041,0.000050069477,0.0000021724259,0.00000695749,1.0495036e-7,0.000034746514,0.0010647636,0.00021161513,0.9907893,0.0069352738,0.00076559884],"study_design_scores_gemma":[0.0001447066,0.00008070534,0.005954002,0.000022012877,0.000018805607,4.7510963e-7,0.000029999497,0.0018151893,0.0006556867,0.9908389,0.0003766761,0.000062837426],"about_ca_topic_score_codex":0.0000020318585,"about_ca_topic_score_gemma":0.0000037487778,"teacher_disagreement_score":0.015325778,"about_ca_system_score_codex":0.000008582793,"about_ca_system_score_gemma":0.0000081366525,"threshold_uncertainty_score":0.19983046},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013186213,0.00017129588,0.0010716073,0.00020464994,0.00015105534,0.0009891277,0.00006515201,0.00031074698,0.99571776],"genre_scores_gemma":[0.0069950656,0.0009169439,0.032042027,0.000121987214,0.00016869804,0.00018409309,0.00007086632,0.00040950155,0.9590908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973464,0.000030054098,0.0010903471,0.00051965896,0.0005501829,0.00046337364],"domain_scores_gemma":[0.9970476,0.0007631731,0.00059288414,0.0013572008,0.000108838525,0.00013028515],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007642538,0.0006606447,0.0009201275,0.000512104,0.00012925603,0.00005315806,0.0006533823,0.0004900188,0.00091056805],"category_scores_gemma":[0.0001592833,0.0006264915,0.0003705619,0.00017395557,0.0002496908,0.00007121767,0.0001435733,0.00088020484,0.00084426056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038360135,0.00017735314,0.0000026252758,0.00038785874,0.00006723836,0.000044853576,0.0005499175,0.0000010446054,0.0000065095833,0.9877161,0.0093695335,0.0016731792],"study_design_scores_gemma":[0.00026412564,0.000025647223,0.0000037592986,0.0006842698,0.00014449823,0.00006502079,0.000056496894,0.00006362354,0.000023072316,0.9643055,0.03375704,0.0006069398],"about_ca_topic_score_codex":0.0000020624504,"about_ca_topic_score_gemma":0.000024712208,"teacher_disagreement_score":0.036626928,"about_ca_system_score_codex":0.0000780771,"about_ca_system_score_gemma":0.00004585268,"threshold_uncertainty_score":0.9999337},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000089482775,0.000039030256,0.007535016,0.00009648503,0.000034537796,0.00024643543,0.0000134142165,0.00006550477,0.9918801],"genre_scores_gemma":[0.0027325274,0.000013975266,0.004545226,0.00006927486,0.00009679689,0.000020354277,0.0000057429647,0.0000978446,0.9924182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996905,0.00001685062,0.000102718346,0.00006634267,0.00007227489,0.000051312923],"domain_scores_gemma":[0.9995119,0.000021994994,0.00012180045,0.00032392456,0.000010863171,0.000009493135],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00004713183,0.00006997597,0.00009485182,0.000035864596,0.000019351704,0.0000028771397,0.00013245607,0.000094742696,0.0060608983],"category_scores_gemma":[0.000011877813,0.000039591057,0.000065323904,0.00008424296,0.000026125348,0.000005762675,0.000021598076,0.000037136982,0.00002164876],"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":[1.9513593e-7,0.000016407625,0.000007895896,0.000019129588,0.000011726511,5.653213e-9,0.000018252713,4.2001605e-7,0.000025344003,0.6268659,0.3728832,0.00015148139],"study_design_scores_gemma":[0.00008001961,0.000001854942,0.000012694995,0.000038441274,0.000036942252,7.2077694e-7,0.0000072203757,0.000022848695,0.0004420523,0.31324747,0.68604654,0.00006320117],"about_ca_topic_score_codex":0.000012077379,"about_ca_topic_score_gemma":0.00017619693,"teacher_disagreement_score":0.31361848,"about_ca_system_score_codex":0.000003455804,"about_ca_system_score_gemma":0.000008941695,"threshold_uncertainty_score":0.9948477},"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":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035106475,0.0009904262,0.00032347746,0.9824262,0.000675453,0.0007561948,0.00011689581,0.0012966053,0.0099040875],"genre_scores_gemma":[0.015397721,0.000062117826,0.014725168,0.9440447,0.0028925755,0.00071952754,0.00043017085,0.00021545158,0.021512583],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836534,0.000070694776,0.00033861218,0.0004935319,0.00023758598,0.0004942228],"domain_scores_gemma":[0.9977267,0.0006356182,0.00027075296,0.0012051446,0.000138429,0.000023399147],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.00012091885,0.0003936174,0.00056403823,0.00041609234,0.00019597862,0.000061163046,0.0010010474,0.009479285,0.00072480296],"category_scores_gemma":[0.00026823627,0.00034643916,0.00018660937,0.00034062075,0.0005657941,0.000063709595,0.000158075,0.009082319,0.0005410251],"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":[7.649762e-7,0.000010634572,3.333287e-7,0.00006338558,0.00003481867,0.000016454847,0.000010091845,8.063313e-9,0.00008248504,0.4786398,0.52082855,0.00031263728],"study_design_scores_gemma":[0.00006576806,0.000013456733,7.0831504e-7,0.000022166165,0.000032517022,0.00004543422,0.0000132894465,9.1082535e-7,0.00056355225,0.5004661,0.49859962,0.00017646175],"about_ca_topic_score_codex":0.000006959259,"about_ca_topic_score_gemma":0.0000070839706,"teacher_disagreement_score":0.038381528,"about_ca_system_score_codex":0.000051670093,"about_ca_system_score_gemma":0.00004286887,"threshold_uncertainty_score":0.99989873},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010361269,0.0001426173,0.0012310247,0.00010562016,0.00022170391,0.0010212291,0.00004530542,0.00020080568,0.9959956],"genre_scores_gemma":[0.004378913,0.00013625101,0.033157058,0.00011213425,0.00017427688,0.000057117562,0.000019429812,0.00027226782,0.9616926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785715,0.000018962586,0.0008823493,0.000482275,0.0004014893,0.00035774542],"domain_scores_gemma":[0.99699473,0.0008443118,0.0005285255,0.0014597144,0.00008276368,0.00008997304],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007510454,0.0005142394,0.0008872887,0.00024538813,0.00006745307,0.000044214106,0.00058535725,0.00054503826,0.0014140883],"category_scores_gemma":[0.00020853255,0.00051890727,0.0002861266,0.000069457026,0.00018640797,0.00006309719,0.00021586052,0.00080969435,0.0015640658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037897528,0.00009485776,0.000012804803,0.0009381264,0.00005521372,0.0000108791755,0.00030504473,0.0000014737471,0.000022939059,0.99669665,0.0016299848,0.00022821542],"study_design_scores_gemma":[0.00023250225,0.00001848815,0.000008661004,0.00077831984,0.00008102348,0.0000128728525,0.000027035732,0.00008234631,0.00009698666,0.9312913,0.06688249,0.00048798477],"about_ca_topic_score_codex":0.000001952954,"about_ca_topic_score_gemma":0.000020166934,"teacher_disagreement_score":0.06540538,"about_ca_system_score_codex":0.00010838417,"about_ca_system_score_gemma":0.00010220602,"threshold_uncertainty_score":0.99972624},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99382865,0.00027095363,0.005237835,0.00019911106,0.000100969744,0.000056694003,0.000015968673,0.000006515315,0.0002833086],"genre_scores_gemma":[0.9987302,0.000047573692,0.00087707426,0.000008911461,0.00027527506,0.0000026808898,0.0000070079695,0.000008736067,0.000042538923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849737,0.000075956006,0.000774082,0.00012735218,0.00039566043,0.0001295733],"domain_scores_gemma":[0.9978004,0.0005108985,0.0008684354,0.00022819331,0.000537486,0.00005455351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007783006,0.00011232743,0.0003261926,0.000067047076,0.000058696736,0.000026625643,0.000525096,0.00007109122,0.000041786934],"category_scores_gemma":[0.0002906923,0.00007925589,0.00021005725,0.00037339248,0.00023905022,0.000083307874,0.00007284,0.00021814552,1.123525e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044796735,0.00017201251,0.020355616,0.00013883643,0.0035002406,0.000041308194,0.0008109969,0.016156614,0.40817377,0.54981333,0.00010863374,0.00028066596],"study_design_scores_gemma":[0.0009308404,0.000045660006,0.0031438137,0.0005421361,0.0013034492,0.00120213,0.0019681922,0.27764314,0.22390313,0.48878697,0.00016872038,0.00036180677],"about_ca_topic_score_codex":0.00002895949,"about_ca_topic_score_gemma":9.806568e-7,"teacher_disagreement_score":0.26148653,"about_ca_system_score_codex":0.000035590692,"about_ca_system_score_gemma":0.000037574457,"threshold_uncertainty_score":0.32319614},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97782636,0.00006558162,0.0212422,0.00046929033,0.00004549116,0.000037866674,0.000012526929,0.0000057304674,0.00029495207],"genre_scores_gemma":[0.98398924,0.000030889405,0.015589885,0.00006882776,0.00022877926,8.3077947e-7,0.0000021600054,0.0000034527357,0.000085915155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993982,0.000050275485,0.00028507638,0.00007975267,0.00012883058,0.000057901456],"domain_scores_gemma":[0.99925774,0.00011343872,0.00021070646,0.000062780586,0.00029951142,0.000055818604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004893272,0.000060196737,0.00018158983,0.000194134,0.00013323304,0.000030911335,0.000046034987,0.000035878733,0.00009007483],"category_scores_gemma":[0.00014756981,0.00004334781,0.00008267504,0.00031046136,0.00010246832,0.00012764725,0.00001920211,0.00008460545,0.0000016552644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005702691,0.0009082508,0.06618984,0.00013265494,0.007885262,0.0000081273165,0.0043975404,0.00003091534,0.016864087,0.8963364,0.00078318914,0.005893515],"study_design_scores_gemma":[0.0019311315,0.00054019334,0.095026046,0.000120776385,0.0070069823,0.0003983522,0.0016222275,0.07983948,0.0024630437,0.80707407,0.0035091995,0.000468525],"about_ca_topic_score_codex":0.000008416096,"about_ca_topic_score_gemma":0.000026480146,"teacher_disagreement_score":0.08926231,"about_ca_system_score_codex":0.000012178244,"about_ca_system_score_gemma":0.000030963227,"threshold_uncertainty_score":0.17676723},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001734516,0.00002693261,0.0010122693,0.000045877794,0.000078170415,0.00025234523,0.000031374195,0.00017132392,0.9982083],"genre_scores_gemma":[0.0013128376,0.000021490026,0.0068292995,0.00010390237,0.00009461445,0.00002271768,0.000012914893,0.0000524279,0.9915498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993471,0.0000065100508,0.00019121642,0.000225748,0.000112621296,0.000116806266],"domain_scores_gemma":[0.99914205,0.0001217193,0.00011165678,0.00047596285,0.000092500995,0.000056138386],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000117373165,0.00019956175,0.00020952478,0.000091889786,0.00008828236,0.0000159701,0.0001890784,0.00021294529,0.013016375],"category_scores_gemma":[0.000017873697,0.00016697623,0.00017210611,0.000019148132,0.00018359661,0.000026666243,0.000046514568,0.00016254548,0.001816813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026624991,0.0000103804105,2.5314554e-7,0.000013073315,0.000053031257,9.4542145e-7,0.00013043998,1.4412023e-9,0.00001128693,0.91595167,0.08363796,0.00018826792],"study_design_scores_gemma":[0.00004096102,0.000019183975,4.2957066e-7,0.0000353846,0.00006134141,0.0000033944038,0.000024423352,4.125283e-7,0.00009470109,0.7650811,0.2344876,0.00015104238],"about_ca_topic_score_codex":0.0000010497134,"about_ca_topic_score_gemma":0.000013897045,"teacher_disagreement_score":0.15087056,"about_ca_system_score_codex":0.000014259854,"about_ca_system_score_gemma":0.00001634796,"threshold_uncertainty_score":0.9989604},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96396846,0.00039356502,0.00118348,0.00086116546,0.000211443,0.0002411066,0.000037684546,0.000027614069,0.03307549],"genre_scores_gemma":[0.965518,0.000056611665,0.03264223,0.0001505502,0.00020210017,0.0000068627673,0.0000015745975,0.000046106805,0.0013759634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987496,0.00005239101,0.0005627742,0.000097838696,0.00024046128,0.0002969308],"domain_scores_gemma":[0.9980508,0.0004538643,0.00043495718,0.00037651105,0.00018289847,0.0005009675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005010052,0.00015600512,0.00029799005,0.00032148333,0.00031280538,0.00003495533,0.0005046378,0.000083296174,0.00033734774],"category_scores_gemma":[0.0005883181,0.00013327709,0.00016130014,0.0002696191,0.00010446277,0.00013355343,0.000012326297,0.0002794613,0.00006948085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056342806,0.00020723298,0.0008833283,0.0002535461,0.00009514419,0.00036516934,0.004714527,0.000026769792,0.00012070629,0.91790736,0.07497565,0.00044494958],"study_design_scores_gemma":[0.00035019385,0.00012239531,0.00038132013,0.00040074065,0.00007610295,0.0013600611,0.0012542637,0.00004731119,0.00080187013,0.97995305,0.015011481,0.00024122502],"about_ca_topic_score_codex":0.00007472931,"about_ca_topic_score_gemma":0.001012289,"teacher_disagreement_score":0.062045686,"about_ca_system_score_codex":0.000070020156,"about_ca_system_score_gemma":0.00040593187,"threshold_uncertainty_score":0.5434882},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99591607,0.00006353003,0.000030351139,0.00029337223,0.000059077855,0.00003155906,0.00007982473,0.0000032753026,0.0035229244],"genre_scores_gemma":[0.9994446,0.0000012060427,0.00020543106,0.000031550953,0.000068672736,0.0000036999543,0.000006403727,0.000006814184,0.00023163234],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994584,0.000025780486,0.00025052088,0.00005383676,0.00009995739,0.00011155677],"domain_scores_gemma":[0.9993354,0.000055771045,0.00023377182,0.00012859015,0.0000669304,0.00017951992],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001300043,0.000057136545,0.00013430747,0.000045701076,0.00012939158,0.000007634583,0.00022878736,0.000034352346,0.0016450643],"category_scores_gemma":[0.000115694216,0.000055526605,0.00007527035,0.00012788628,0.000089075504,0.000018666195,0.000014373577,0.00022033117,9.861157e-8],"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.00002808803,0.000093560055,0.003590171,0.00013865196,0.00012675006,0.00009919146,0.0016851274,0.00011610276,0.80052567,0.1916778,0.0016133958,0.00030553163],"study_design_scores_gemma":[0.00035097124,0.000058024834,0.0014675043,0.000020437683,0.00006444563,0.0007443026,0.0018388878,0.00001713857,0.12909271,0.8586674,0.0074969884,0.00018123146],"about_ca_topic_score_codex":0.000060039245,"about_ca_topic_score_gemma":0.000050740546,"teacher_disagreement_score":0.6714329,"about_ca_system_score_codex":0.00005092917,"about_ca_system_score_gemma":0.00038085034,"threshold_uncertainty_score":0.9992676},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12160853,0.009350988,0.000771413,0.0007283757,0.00047800376,0.005042346,0.000299707,0.0004412624,0.86127937],"genre_scores_gemma":[0.08447436,0.008695113,0.008164938,0.0002573323,0.00013558558,0.0008791068,0.00009458993,0.0004906348,0.8968083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983571,0.00008081869,0.00061937154,0.0003937752,0.00025077353,0.00029815678],"domain_scores_gemma":[0.9967057,0.0023869458,0.0003565911,0.00043422953,0.000027978325,0.00008854171],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019789515,0.00037697985,0.0007079454,0.0003621867,0.00020615882,0.00005295079,0.00027732327,0.00030181915,0.0001848203],"category_scores_gemma":[0.00021610082,0.00034473688,0.00007969984,0.0002510066,0.000311232,0.000059693266,0.00024058031,0.0007635669,0.0000054737634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009549512,0.00034787433,0.00009142715,0.0010967146,0.000033951652,0.000024828478,0.0049915477,6.898622e-7,0.0000021316941,0.98894036,0.0042902054,0.00017074909],"study_design_scores_gemma":[0.00044788854,0.00004350222,0.00006426199,0.0006942313,0.00008732911,0.0000535068,0.00075772917,0.00006442802,0.000002381688,0.9827024,0.0147119565,0.00037040035],"about_ca_topic_score_codex":0.0000031230281,"about_ca_topic_score_gemma":0.000037135476,"teacher_disagreement_score":0.037134167,"about_ca_system_score_codex":0.00009175264,"about_ca_system_score_gemma":0.00006394599,"threshold_uncertainty_score":0.99990046},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51025844,0.000039307826,0.4325261,0.0005359217,0.00015371027,0.0013096234,0.00009161848,0.0001650258,0.05492021],"genre_scores_gemma":[0.991893,0.00004960032,0.0056401133,0.00015584913,0.000051387397,0.000024631297,0.00004939482,0.00003440673,0.0021016062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985375,0.00022173433,0.0001980441,0.000669957,0.00009092972,0.0002818792],"domain_scores_gemma":[0.9979774,0.00031126643,0.00013971409,0.0012809061,0.0001465139,0.00014420022],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042284958,0.00030288796,0.00034520845,0.00015179317,0.00033702544,0.00007172194,0.0009836142,0.00022756973,0.00005841654],"category_scores_gemma":[0.000049528902,0.00026263102,0.0004061987,0.00082808157,0.00014704888,0.000083443185,0.00044829398,0.0007400387,0.000034920395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036996316,0.00031389663,0.000038301,0.000105569234,0.00022941093,0.000019037649,0.0047954363,0.008309157,0.0000122299425,0.9847834,0.0010393178,0.0003172168],"study_design_scores_gemma":[0.00030722705,0.00002441706,0.00008647681,0.00007696198,0.0003442622,0.0000059929403,0.0052447733,0.010285241,0.00022112686,0.98062783,0.0023696008,0.00040607],"about_ca_topic_score_codex":0.000049018454,"about_ca_topic_score_gemma":0.00010973851,"teacher_disagreement_score":0.48163456,"about_ca_system_score_codex":0.00007723747,"about_ca_system_score_gemma":0.00009854135,"threshold_uncertainty_score":0.9999826},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84070694,0.00013375877,0.06309416,0.010186596,0.0015419491,0.00033896507,0.00045508018,0.0001550341,0.08338753],"genre_scores_gemma":[0.99810356,0.000024392604,0.00085119193,0.00010759627,0.00011947684,0.0000100214,0.0000034385694,0.0000093582275,0.0007709365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915415,0.00009673644,0.0002999301,0.00008002395,0.00026644755,0.00010269207],"domain_scores_gemma":[0.9990143,0.00017695752,0.00041563672,0.00019745462,0.00015119737,0.000044409706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027841068,0.00008588363,0.00017112553,0.000056194538,0.00022949286,0.000026406353,0.00025911248,0.000015003924,0.00007841915],"category_scores_gemma":[0.000053830896,0.00007451774,0.000116221636,0.00020294856,0.00006510286,0.0001388926,0.000050571147,0.00022695937,0.0000019036838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017961812,0.00017028152,0.0000034128666,0.0000047762737,0.00003091882,0.000005267955,0.00058809354,0.000058127833,0.001968528,0.9849443,0.0031990747,0.008847606],"study_design_scores_gemma":[0.00025102613,0.00036189088,0.000022979673,0.000013755803,0.00001979569,0.000026405352,0.0008809421,0.000004476337,0.037353646,0.9457433,0.015245025,0.000076721124],"about_ca_topic_score_codex":0.0000019018553,"about_ca_topic_score_gemma":0.0000020545738,"teacher_disagreement_score":0.15739666,"about_ca_system_score_codex":0.000016374477,"about_ca_system_score_gemma":0.00007230234,"threshold_uncertainty_score":0.3038745},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95446587,0.00010428302,0.033832215,0.00006295017,0.00021831642,0.0015374765,0.00021083928,0.00016511366,0.009402954],"genre_scores_gemma":[0.9979052,0.000100659694,0.00031442306,0.000050295675,0.000032225526,0.000013604457,0.000029426657,0.000054646778,0.001499527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99644524,0.0003595759,0.0005648749,0.001513217,0.00020596178,0.000911106],"domain_scores_gemma":[0.99691117,0.00010169891,0.0005217432,0.0016565857,0.00039935304,0.0004094514],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008470669,0.0007535965,0.00082594046,0.00034740905,0.00034754266,0.000110717265,0.0012803983,0.00050510786,0.000103704864],"category_scores_gemma":[0.000069408765,0.0007495845,0.00029577708,0.0018469074,0.00059028226,0.00022886731,0.0014033793,0.0006727953,0.0001395342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000755176,0.0023412413,0.008519478,0.00052503345,0.00021579847,0.00021983548,0.0016441802,0.25354028,0.000014956029,0.73202366,0.0001493419,0.00005101905],"study_design_scores_gemma":[0.0039201723,0.00031269225,0.0011968456,0.0011205921,0.0005649683,0.00003212723,0.006268324,0.32856622,0.00005445368,0.6556472,0.0008730404,0.0014433331],"about_ca_topic_score_codex":0.00014195306,"about_ca_topic_score_gemma":0.0015801325,"teacher_disagreement_score":0.07637642,"about_ca_system_score_codex":0.0005501487,"about_ca_system_score_gemma":0.00040979107,"threshold_uncertainty_score":0.9994955},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39092264,0.0033752634,0.39381558,0.02363744,0.000290645,0.0012498413,0.000565765,0.00053511624,0.18560773],"genre_scores_gemma":[0.7768323,0.0033759214,0.15386839,0.00007134572,0.00006257691,0.0004916398,0.0006060857,0.00014434292,0.0645474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98854625,0.007966029,0.0009940881,0.0012020635,0.00048045817,0.0008111352],"domain_scores_gemma":[0.9861926,0.0047307257,0.0013766782,0.005355398,0.0018970039,0.00044761488],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.008259507,0.00073320913,0.0007657976,0.0002227374,0.0020213965,0.00084951165,0.003299442,0.0008094189,0.00035562352],"category_scores_gemma":[0.00402724,0.0008126636,0.0007308051,0.000307297,0.0017190056,0.0002165028,0.0015007613,0.0012370248,0.00015009227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012734778,0.0011507731,0.0044065383,0.000492152,0.00021173555,0.000009629075,0.020504735,0.000046753077,0.0021388528,0.9524952,0.0014860996,0.017044788],"study_design_scores_gemma":[0.00071006117,9.64012e-7,0.013774383,0.006474477,0.00048242157,0.000059829934,0.0014182215,0.02002881,0.050575603,0.8392447,0.06594127,0.0012892443],"about_ca_topic_score_codex":0.0054545715,"about_ca_topic_score_gemma":0.012826904,"teacher_disagreement_score":0.38590968,"about_ca_system_score_codex":0.0002569027,"about_ca_system_score_gemma":0.00047474777,"threshold_uncertainty_score":0.99943244},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9783017,0.0002993138,0.016104432,0.003444189,0.0000768535,0.00030952596,0.0001838966,0.000039482875,0.0012406053],"genre_scores_gemma":[0.9937758,0.0000032585085,0.0054409793,0.00012773999,0.000028478222,0.0000678828,0.000031006894,0.0000048785478,0.0005199936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957705,0.000040680352,0.0001353225,0.000114715534,0.00006702149,0.00006523923],"domain_scores_gemma":[0.9968428,0.002731409,0.000050399438,0.00026600822,0.00008778395,0.000021625676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015957846,0.000048562357,0.00009389618,0.000012976536,0.00025601414,0.000030972195,0.00006112111,0.00002573857,0.0001623738],"category_scores_gemma":[0.00040562957,0.00003450548,0.00005481083,0.00011392074,0.00027842735,0.00009976595,0.000063830856,0.000038305963,0.0000010046372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010976747,0.00010981855,0.0025088557,0.00004434183,0.00003181772,1.2684521e-7,0.00031638274,0.0000039600923,0.000895748,0.99102914,0.004997303,0.000051514264],"study_design_scores_gemma":[0.000104539315,0.000007665832,0.008706543,0.0000053271065,0.000044665463,0.0000029418466,0.0013075508,0.00007427411,0.031932946,0.95625275,0.0015249664,0.00003584659],"about_ca_topic_score_codex":0.0000029286061,"about_ca_topic_score_gemma":0.000008116086,"teacher_disagreement_score":0.034776423,"about_ca_system_score_codex":0.0000021314986,"about_ca_system_score_gemma":0.00004663889,"threshold_uncertainty_score":0.19690797},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8232384,0.00067316124,0.099329665,0.0042732847,0.000186262,0.0014015746,0.00021573716,0.0004438106,0.07023814],"genre_scores_gemma":[0.92211765,0.00018845145,0.07133735,0.000038513426,0.0000121350695,0.00030772632,0.00022792944,0.000060213846,0.005710024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99483216,0.003125993,0.0007581254,0.00060175103,0.0003691073,0.00031288553],"domain_scores_gemma":[0.99166703,0.002466224,0.00088838127,0.002888397,0.0019216001,0.0001683628],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004000416,0.00034107835,0.0005259947,0.00025359957,0.00024561505,0.00014399253,0.0013348714,0.00032406987,0.0005060988],"category_scores_gemma":[0.0013117346,0.00034905766,0.00036031727,0.0004656652,0.00044675337,0.000095099225,0.00091589807,0.000524076,0.000080320395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041227972,0.0005519586,0.00014945274,0.00022501317,0.00008097783,6.265914e-7,0.0025978528,0.000005595774,0.0068811015,0.98480904,0.0017969446,0.0028973042],"study_design_scores_gemma":[0.00027009632,2.9253388e-7,0.0004330411,0.00095005555,0.00009054675,0.00000327182,0.00007557265,0.00094935804,0.08162793,0.9130906,0.0021845435,0.00032473556],"about_ca_topic_score_codex":0.0003064653,"about_ca_topic_score_gemma":0.00017103163,"teacher_disagreement_score":0.0988793,"about_ca_system_score_codex":0.00003402272,"about_ca_system_score_gemma":0.00012827724,"threshold_uncertainty_score":0.99989617},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82329816,0.000034597713,0.16274388,0.0001442867,0.00014295898,0.0016297235,0.0006069731,0.00030477828,0.011094666],"genre_scores_gemma":[0.99415714,0.000049166516,0.0029796371,0.00005470588,0.00003012444,0.000039673632,0.0000771888,0.00004019057,0.0025722058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987602,0.0000836532,0.000163047,0.0006646144,0.00006642188,0.00026206425],"domain_scores_gemma":[0.9982859,0.00041198297,0.00025980538,0.00083557173,0.00011040032,0.00009634438],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027416166,0.00026122198,0.00032190487,0.0001837651,0.00034726306,0.000030911106,0.00057110196,0.0001206507,0.00025321794],"category_scores_gemma":[0.000033467095,0.00027309285,0.00023814874,0.00033320364,0.00020185387,0.000053670163,0.00041838188,0.00038558527,0.000006790953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014064948,0.00016422432,0.00063444977,0.00017158205,0.00019011869,0.00003279563,0.00012875012,0.00309162,0.000015232969,0.9943654,0.0010430512,0.000022111622],"study_design_scores_gemma":[0.0006482636,0.00008796792,0.00006685513,0.000051730585,0.00035895125,0.0000043848404,0.0008532367,0.001342389,0.00006382755,0.992497,0.0036614903,0.00036386802],"about_ca_topic_score_codex":0.000025450587,"about_ca_topic_score_gemma":0.000050591207,"teacher_disagreement_score":0.17085896,"about_ca_system_score_codex":0.00009191458,"about_ca_system_score_gemma":0.00012528463,"threshold_uncertainty_score":0.9999721},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.990434,0.000008028985,0.002309674,0.0002205735,0.00011040398,0.00051367783,0.00008849877,0.0000668981,0.006248279],"genre_scores_gemma":[0.9975831,0.00003693771,0.000061253784,0.00013057671,0.000019311665,0.000010643266,0.000018739389,0.000020711592,0.002118718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891335,0.00025364783,0.000193197,0.00040004344,0.000081550876,0.00015820596],"domain_scores_gemma":[0.99745715,0.00092121406,0.00034058874,0.0011782073,0.000054973123,0.00004785067],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038648935,0.00019772229,0.00026457044,0.00015409535,0.00020826429,0.000013711411,0.00078341854,0.00011244349,0.001245245],"category_scores_gemma":[0.000091230766,0.0001681251,0.0003021775,0.00039456369,0.00015460007,0.00003175612,0.00046175066,0.0006087199,0.00003458341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003321272,0.00020029375,0.00019371416,0.00008763251,0.00010521336,0.0000112471525,0.00031605226,0.0010779018,0.000066317196,0.9970801,0.00081778795,0.000010511846],"study_design_scores_gemma":[0.00013604354,0.00003338153,0.00027509689,0.00005567242,0.00014655088,7.009054e-7,0.00029836164,0.0007252769,0.00015760057,0.99754983,0.00045104758,0.00017040901],"about_ca_topic_score_codex":0.000018439723,"about_ca_topic_score_gemma":0.000010356158,"teacher_disagreement_score":0.0071491417,"about_ca_system_score_codex":0.000038682872,"about_ca_system_score_gemma":0.000047620717,"threshold_uncertainty_score":0.99966776},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0152768195,0.00096787553,0.00029723116,0.00026318594,0.00046397353,0.0012948685,0.00006143505,0.0002248434,0.9811498],"genre_scores_gemma":[0.020553168,0.0033871443,0.020128665,0.0001884482,0.000090405854,0.00021525526,0.00002633014,0.00022521053,0.95518535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988687,0.000012143891,0.0004237305,0.00032698183,0.0001932605,0.00017519566],"domain_scores_gemma":[0.99860245,0.00073851895,0.00026010326,0.00027857642,0.000028374156,0.000091970476],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047715814,0.0002820285,0.00044264316,0.00036661097,0.00020051717,0.000055090833,0.00014660646,0.0001459619,0.00039133022],"category_scores_gemma":[0.00010432847,0.00025392984,0.000067196896,0.00010014313,0.000100014244,0.0000554493,0.0001664735,0.00039971134,0.000016901087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045186334,0.000043147993,0.000010784338,0.0003234669,0.00002505091,0.0000045703387,0.0017650183,3.6426889e-7,0.000023198005,0.9877226,0.007622449,0.0024548762],"study_design_scores_gemma":[0.00010463816,0.0000513931,0.000009732479,0.00042669385,0.00008778213,0.000070561524,0.00019531729,0.000069345326,0.0000148673,0.95274305,0.045948066,0.0002785351],"about_ca_topic_score_codex":0.0000073376386,"about_ca_topic_score_gemma":0.000021359992,"teacher_disagreement_score":0.03832562,"about_ca_system_score_codex":0.000033396896,"about_ca_system_score_gemma":0.000012408404,"threshold_uncertainty_score":0.9999913},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98413455,0.00018972832,0.008454182,0.001547088,0.000015647252,0.00016625626,0.000035827452,0.00011308719,0.0053436533],"genre_scores_gemma":[0.97169447,0.00029558342,0.027431116,0.00003038584,0.000020544647,0.00009851911,0.00003405753,0.000017715485,0.00037762034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988794,0.00008568502,0.0005483163,0.0001943091,0.000120167075,0.0001721586],"domain_scores_gemma":[0.9967465,0.0021837784,0.00010276408,0.0008735514,0.000033073877,0.000060364848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004761655,0.00013788936,0.00032957082,0.00008382036,0.000095775,0.000024015577,0.0004057307,0.0001258863,0.00005828158],"category_scores_gemma":[0.000090179274,0.00013561758,0.000049833467,0.00052461406,0.00032584867,0.000101247155,0.0004748197,0.00022943212,0.000020491425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005013141,0.000287516,0.008272715,0.00039725896,0.000032427626,0.0000011079234,0.0006856353,0.00001117174,0.000479355,0.98746675,0.00079238514,0.0015686842],"study_design_scores_gemma":[0.00034998916,0.000004069108,0.0029968075,0.0002213682,0.000019087418,0.0000067446263,0.00008013701,0.006857954,0.00037757386,0.9886859,0.00026540627,0.00013495737],"about_ca_topic_score_codex":0.000007849244,"about_ca_topic_score_gemma":0.0000025764411,"teacher_disagreement_score":0.018976932,"about_ca_system_score_codex":0.000015741998,"about_ca_system_score_gemma":0.000014668359,"threshold_uncertainty_score":0.5530324},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9675962,0.00039659874,0.0066955914,0.0031804813,0.000096308286,0.001682188,0.00009494979,0.001308663,0.01894907],"genre_scores_gemma":[0.9931361,0.00018747659,0.0019798551,0.00014108568,0.00024613162,0.00036268498,0.00007893646,0.00003455074,0.00383318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992144,0.000027401857,0.00019626872,0.0002491769,0.00010120503,0.00021153053],"domain_scores_gemma":[0.9991041,0.00034236384,0.000057425957,0.00033210305,0.000067020635,0.00009699678],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002029008,0.00012314419,0.0001362043,0.000084186024,0.00029016117,0.000028325088,0.00017507486,0.000070483184,0.00016040073],"category_scores_gemma":[0.00007394271,0.00010765112,0.000049733382,0.000802734,0.00006565353,0.000062107894,0.000052647058,0.00011598394,0.00088890095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047437184,0.00004539825,0.000022338867,0.000026248797,0.00001723054,3.725475e-7,0.00017516266,0.0000015330161,0.0055694096,0.99115044,0.002051321,0.00093579525],"study_design_scores_gemma":[0.00014881296,0.000023731009,0.00028379043,0.0000064938004,0.000034713266,0.000005451946,0.00016183995,0.00084248546,0.0035372982,0.95930034,0.035503775,0.00015123982],"about_ca_topic_score_codex":0.0000012111334,"about_ca_topic_score_gemma":0.0000020585105,"teacher_disagreement_score":0.033452455,"about_ca_system_score_codex":0.0000060293078,"about_ca_system_score_gemma":0.00001717822,"threshold_uncertainty_score":0.999889},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9480532,0.000026320182,0.045313023,0.00019262252,0.00030232818,0.00062771107,0.00020986432,0.00086187944,0.00441305],"genre_scores_gemma":[0.99038345,0.00014137202,0.00034873903,0.000034716893,0.000047970152,0.0000073341935,0.00018165771,0.00005229242,0.008802451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853975,0.00012156018,0.00021602862,0.00072416564,0.00007159333,0.0003268971],"domain_scores_gemma":[0.9984167,0.00026233713,0.00022859748,0.0008546615,0.000100409285,0.00013726886],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029730448,0.00029559695,0.00031574268,0.00021691708,0.00022305077,0.000039183054,0.00062033586,0.00033292602,0.00010330342],"category_scores_gemma":[0.000066600885,0.00035373628,0.0003054941,0.00060362724,0.00015002188,0.000075842814,0.00036805397,0.0005480487,0.00025862595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025404446,0.00013202436,0.00043545172,0.000091205206,0.000109892986,0.000028333638,0.00008128675,0.0006842992,0.00020436039,0.9819014,0.016277624,0.000028706065],"study_design_scores_gemma":[0.00031085152,0.00002193337,0.00021748169,0.00005273882,0.00018919176,0.000001433465,0.00013703505,0.003270075,0.00031702893,0.9940995,0.0010240895,0.00035862374],"about_ca_topic_score_codex":0.00004835766,"about_ca_topic_score_gemma":0.00004372114,"teacher_disagreement_score":0.044964284,"about_ca_system_score_codex":0.00010897715,"about_ca_system_score_gemma":0.00005394251,"threshold_uncertainty_score":0.99989146},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.938225,0.0005292384,0.018073805,0.00090610737,0.00014538657,0.0011239016,0.0006548795,0.00022980192,0.04011192],"genre_scores_gemma":[0.99127674,0.0006872888,0.00616544,0.000012186048,0.000004291803,0.00006834821,0.0002669753,0.000039547398,0.0014791519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99527526,0.0027001596,0.0007708376,0.00052359124,0.00047400728,0.00025615026],"domain_scores_gemma":[0.9917048,0.0043970863,0.0010617323,0.0017884859,0.0009231248,0.00012473878],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004443518,0.00031134646,0.0006617821,0.00060075463,0.00027866696,0.000051795716,0.0009651315,0.00018090247,0.00044782733],"category_scores_gemma":[0.0013055751,0.0003238035,0.00026920487,0.0010780952,0.0003561434,0.00006135265,0.0006453358,0.0005548993,0.0000030398269],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064734755,0.0009063064,0.0027094637,0.0004905321,0.00016404285,0.0000011423634,0.0030520188,0.00007439158,0.0008946619,0.98954463,0.0004281628,0.0016699217],"study_design_scores_gemma":[0.005605728,0.000011992335,0.035053972,0.004147261,0.0007588133,0.00002130947,0.0018456312,0.01219873,0.156609,0.77534145,0.0067019453,0.0017041566],"about_ca_topic_score_codex":0.0004798108,"about_ca_topic_score_gemma":0.00025211307,"teacher_disagreement_score":0.21420316,"about_ca_system_score_codex":0.00005584442,"about_ca_system_score_gemma":0.00011936225,"threshold_uncertainty_score":0.9999214},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93672,0.000051141873,0.061674435,0.000068556204,0.00003882513,0.0010283687,0.00017504733,0.000032148513,0.00021147831],"genre_scores_gemma":[0.9986014,0.00014048423,0.0010517027,0.0000044272238,0.000018430277,0.00002180234,0.000012308142,0.000019458032,0.0001299869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991676,0.00006784384,0.0002699574,0.00031301563,0.00006652282,0.00011504355],"domain_scores_gemma":[0.99727774,0.001287515,0.00046465851,0.0007661425,0.00016447341,0.00003946352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005560585,0.00013967125,0.0002708187,0.0001852305,0.000121804165,0.000009435126,0.0005827899,0.000093412265,0.0000047662747],"category_scores_gemma":[0.00013275673,0.00010478647,0.00014949338,0.0009367339,0.00016202967,0.000037122838,0.00032481214,0.00011265866,0.0000018689315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042727355,0.00009274577,0.0048274347,0.00050744816,0.000114753995,1.9432461e-7,0.00041592593,0.0018669266,0.00019421004,0.9914942,0.00006826856,0.00037520446],"study_design_scores_gemma":[0.00015794729,0.000034421966,0.0067678145,0.00006629429,0.0004002915,4.099893e-7,0.0009855214,0.011428751,0.0008426202,0.9790836,0.00010788644,0.00012444852],"about_ca_topic_score_codex":0.0001625203,"about_ca_topic_score_gemma":0.000088702924,"teacher_disagreement_score":0.061881404,"about_ca_system_score_codex":0.000011173151,"about_ca_system_score_gemma":0.000024810672,"threshold_uncertainty_score":0.42730683},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91047734,0.00005707211,0.02380813,0.008367864,0.0004499164,0.0018312389,0.00014468771,0.00077654753,0.054087203],"genre_scores_gemma":[0.88742375,0.00010531551,0.08032553,0.0005681434,0.0004173589,0.00071059616,0.000052072664,0.00021887457,0.030178335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980724,0.0002223801,0.0004298185,0.0003050663,0.000493777,0.00047657258],"domain_scores_gemma":[0.9909394,0.0073702,0.00022886082,0.0012784192,0.00010014401,0.000082989216],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020579263,0.00026075504,0.00027268825,0.00003748689,0.0011389657,0.00027727822,0.00086109637,0.00012225994,0.0003169918],"category_scores_gemma":[0.0012678396,0.00014168161,0.00017275976,0.0006613013,0.00019355303,0.00007915023,0.00020744816,0.00038655451,0.0015805237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020310605,0.000057260815,0.000013698953,0.000026829826,0.00009051792,0.0000045662277,0.0023102632,0.000034651082,0.0004402135,0.97125137,0.025530547,0.00021975243],"study_design_scores_gemma":[0.00014612381,0.000022262138,0.00003427646,0.00005565596,0.00008504957,0.000007655302,0.005698612,0.0066805356,0.002327419,0.9735152,0.011215839,0.00021133247],"about_ca_topic_score_codex":0.000024969466,"about_ca_topic_score_gemma":0.000012876549,"teacher_disagreement_score":0.0565174,"about_ca_system_score_codex":0.000034550645,"about_ca_system_score_gemma":0.000059384114,"threshold_uncertainty_score":0.9991969},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97105175,0.0003049481,0.025303746,0.001425414,0.00016423433,0.0005634515,0.00020862337,0.00016788773,0.00080995186],"genre_scores_gemma":[0.99717367,0.00068395917,0.000843281,0.000032297146,0.00017655664,0.00006823958,0.00007015604,0.0000743212,0.0008775409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971545,0.00014372615,0.0005189901,0.00036549204,0.00053477136,0.0012825262],"domain_scores_gemma":[0.9983479,0.00022466123,0.0006301988,0.00052860676,0.00016894957,0.00009973001],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0016713424,0.00032451825,0.0004792272,0.00036467577,0.0002797825,0.000050726358,0.00049156835,0.00020944298,0.00007329577],"category_scores_gemma":[0.00007592104,0.00026255473,0.00034775757,0.00030596345,0.00025901583,0.00004951926,0.00008993014,0.0036049597,0.000029485922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098114055,0.0002141719,0.00034703975,0.000070013826,0.00057106966,0.0000056631866,0.00014389992,0.00020751309,0.00022458463,0.9977356,0.00020814588,0.00017413902],"study_design_scores_gemma":[0.00043278176,0.00034253096,0.0009240544,0.00021547497,0.00019979676,0.00017101556,0.00037793376,0.00003544637,0.0008812473,0.9959846,0.00017075948,0.00026434846],"about_ca_topic_score_codex":0.00001670669,"about_ca_topic_score_gemma":0.00026558782,"teacher_disagreement_score":0.026121905,"about_ca_system_score_codex":0.00030392903,"about_ca_system_score_gemma":0.0016290625,"threshold_uncertainty_score":0.99998266},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99549544,0.000053944266,0.0011595377,0.00015025765,0.000047827914,0.00039413973,0.0000413902,0.0009214026,0.0017360768],"genre_scores_gemma":[0.9721726,0.000055574143,0.025175327,0.00008271185,0.000027891594,0.00017404355,0.000033973887,0.00003785906,0.0022399854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925715,0.000044513406,0.00021375019,0.0001946655,0.00008094788,0.00020899695],"domain_scores_gemma":[0.9989485,0.0006517491,0.00005483826,0.00021832885,0.00007327038,0.000053277887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036632305,0.00011987312,0.00017556515,0.00019111506,0.00024775777,0.00003048492,0.00007970926,0.00006387616,0.000044475724],"category_scores_gemma":[0.00015563893,0.00009936518,0.000081257014,0.00058335694,0.00008776712,0.00007079978,0.0000340032,0.000045694553,0.00000637748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009583578,0.000025624746,0.0003638052,0.000070801274,0.000040712675,3.140106e-7,0.00049013674,5.9443306e-7,0.007855193,0.98862094,0.0023215953,0.00020072634],"study_design_scores_gemma":[0.0002314306,0.0000160542,0.0004401153,0.000018285757,0.00004909585,0.0000024161627,0.00069076946,0.0017042699,0.0061276834,0.98970085,0.00087085436,0.00014815891],"about_ca_topic_score_codex":0.000016265789,"about_ca_topic_score_gemma":0.000009579861,"teacher_disagreement_score":0.02401579,"about_ca_system_score_codex":0.000004741068,"about_ca_system_score_gemma":0.000010269968,"threshold_uncertainty_score":0.40519944},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9886902,0.000036170695,0.007677925,0.00030719882,0.000031666506,0.0005440202,0.0000032348796,0.0007709403,0.0019386325],"genre_scores_gemma":[0.93487746,0.0000026756043,0.06383782,0.000037780857,0.000098394135,0.0003094162,0.000012624012,0.000052281073,0.00077157904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985739,0.00006479502,0.00038423642,0.00030042423,0.00024047423,0.00043615568],"domain_scores_gemma":[0.9986466,0.00076617405,0.00008587436,0.00030417647,0.00003641201,0.0001607754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008210877,0.00018923468,0.00027341858,0.00010417859,0.00035269372,0.00013172228,0.00010685356,0.00009741227,0.0000827634],"category_scores_gemma":[0.0005369663,0.00016352576,0.000079779034,0.00047611588,0.0001601662,0.000100800135,0.00013914208,0.0001867331,0.00021551062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003279619,0.00011491754,0.000054215205,0.00034484323,0.00003288863,0.000021819273,0.0012160771,0.0000033195365,0.0008073808,0.9618114,0.00060120935,0.034988634],"study_design_scores_gemma":[0.00024919194,0.00003807558,0.000073420866,0.00009351813,0.000054384825,0.00013105379,0.00084638083,0.010532409,0.00040822194,0.98653424,0.0007895345,0.0002495456],"about_ca_topic_score_codex":0.0000012573123,"about_ca_topic_score_gemma":0.0000013600705,"teacher_disagreement_score":0.056159895,"about_ca_system_score_codex":0.000013552981,"about_ca_system_score_gemma":0.000012725113,"threshold_uncertainty_score":0.6668387},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9767521,0.0046848967,0.0059736925,0.010721107,0.0003989561,0.0004203639,0.0000071949607,0.00008513665,0.0009565581],"genre_scores_gemma":[0.9964256,0.0024463485,0.0000141594755,0.00011892135,0.00009571351,0.000020170222,0.0000020755028,0.000020887177,0.00085607247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985013,0.00038894944,0.00040093588,0.00009262695,0.00024837424,0.00036783013],"domain_scores_gemma":[0.997593,0.0014713334,0.00036799195,0.0003655423,0.00015078524,0.000051361963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028818054,0.00014424737,0.00029127055,0.000114799965,0.00059097365,0.000048443686,0.00048021888,0.00004594888,0.000013148607],"category_scores_gemma":[0.00013048341,0.00006782359,0.00020392703,0.00078726985,0.00027751378,0.00007125978,0.00006440192,0.00058947096,0.000013359599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008392803,0.00004182576,0.00002413093,0.000008105384,0.00016820106,8.9130214e-7,0.00044900962,0.0000055263295,0.000098083445,0.9939773,0.0050281035,0.00011487124],"study_design_scores_gemma":[0.0016028135,0.00008553667,0.00010397548,0.000011838529,0.0001405597,0.00012651633,0.00042577088,0.00013449976,0.00012846863,0.9723604,0.024798278,0.00008135462],"about_ca_topic_score_codex":0.0000025981683,"about_ca_topic_score_gemma":0.000003585437,"teacher_disagreement_score":0.021616936,"about_ca_system_score_codex":0.00004060414,"about_ca_system_score_gemma":0.00008717019,"threshold_uncertainty_score":0.4545351},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9788749,0.0002109327,0.003136384,0.0028923322,0.00002628001,0.0010891446,0.00013844368,0.00047056255,0.013161012],"genre_scores_gemma":[0.9967416,0.00026476075,0.00072623603,0.00022812106,0.00007854787,0.0005436652,0.00003069855,0.00002131171,0.0013650929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927706,0.000021506485,0.00018150739,0.0002582759,0.00009885784,0.00016277005],"domain_scores_gemma":[0.9991752,0.00036729258,0.0000557228,0.00026648442,0.00003896992,0.00009634495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016205416,0.000118551805,0.00013063852,0.0001027576,0.00029553438,0.00002842036,0.00009462181,0.00006407488,0.00004343376],"category_scores_gemma":[0.000044823773,0.00010222299,0.000028611423,0.00040705202,0.00009597256,0.000050566545,0.000053992495,0.00010403283,0.0001345903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046272867,0.000055658522,0.00014541969,0.000018846888,0.000016048054,3.5228624e-7,0.00013307414,0.0000016480918,0.0012967007,0.9947248,0.0009823702,0.002620439],"study_design_scores_gemma":[0.000302513,0.000034330467,0.00194673,0.000019580884,0.000033407938,0.0000051379648,0.00028020726,0.0014267301,0.00096887205,0.95670885,0.038101654,0.00017196685],"about_ca_topic_score_codex":0.0000016764006,"about_ca_topic_score_gemma":0.000007114833,"teacher_disagreement_score":0.038015947,"about_ca_system_score_codex":0.000004548223,"about_ca_system_score_gemma":0.000011998761,"threshold_uncertainty_score":0.41685328},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9971081,0.00013495678,0.00093521836,0.0012580375,0.00004401003,0.00007994512,0.000019133693,0.000010388414,0.00041021843],"genre_scores_gemma":[0.99895966,0.00006802963,0.00016118768,0.00017826223,0.00010296124,0.000004367508,0.000002781725,0.000018461116,0.00050431653],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922264,0.00003143693,0.0003203004,0.00009403036,0.000093303934,0.00023826261],"domain_scores_gemma":[0.9982028,0.000812712,0.0002776521,0.0002926143,0.00009779055,0.00031640363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036564522,0.00011064859,0.00019325258,0.00004726041,0.00013952312,0.00003960233,0.00024267806,0.000105231935,0.000054180015],"category_scores_gemma":[0.00037876697,0.00008349918,0.00009726271,0.00029979227,0.00018567502,0.000044486755,0.000015501731,0.00036108555,0.0000020587254],"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.00039445586,0.0002739406,0.0098133255,0.00074947794,0.0013044252,0.0008539696,0.0038657687,0.13891612,0.042109057,0.22738999,0.5495103,0.024819143],"study_design_scores_gemma":[0.0030504484,0.00025275335,0.013511056,0.002659852,0.0008130427,0.0015720088,0.002391761,0.062302887,0.07165467,0.72592133,0.113914736,0.0019554736],"about_ca_topic_score_codex":0.00008223733,"about_ca_topic_score_gemma":0.00027909075,"teacher_disagreement_score":0.4985313,"about_ca_system_score_codex":0.000029717528,"about_ca_system_score_gemma":0.00015055621,"threshold_uncertainty_score":0.3404998},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99125624,0.0001694995,0.004053831,0.00048465774,0.000023208342,0.0007066948,0.00015344542,0.00029110292,0.0028613291],"genre_scores_gemma":[0.99666125,0.00014051722,0.0020108435,0.000036102476,0.000052334453,0.00028903977,0.00007369016,0.000020523965,0.00071570114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916637,0.000034568362,0.00023094594,0.00024931543,0.000139916,0.0001788653],"domain_scores_gemma":[0.9989479,0.00038188839,0.00011957956,0.0003931495,0.00006779597,0.000089689194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002639732,0.0001265846,0.000189937,0.000106861444,0.00026528587,0.000013776957,0.0002056655,0.000054362634,0.000061605795],"category_scores_gemma":[0.000053817515,0.000116138996,0.0000858276,0.00061702484,0.0001105055,0.00006421002,0.00008752723,0.00009665043,0.00011930453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036917693,0.00009123247,0.0013957226,0.00005933105,0.00003525262,2.420938e-7,0.00019634093,0.0000019883691,0.0018641872,0.9946609,0.0007263893,0.0009647159],"study_design_scores_gemma":[0.00021644477,0.000016249836,0.006327872,0.000014465613,0.00008714796,0.0000029059943,0.00014450101,0.00067125,0.007316072,0.9768699,0.008182686,0.00015052943],"about_ca_topic_score_codex":0.0000066934867,"about_ca_topic_score_gemma":0.000012230431,"teacher_disagreement_score":0.01779103,"about_ca_system_score_codex":0.000004106275,"about_ca_system_score_gemma":0.0000140528045,"threshold_uncertainty_score":0.47360107},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000086635526,0.00076883787,0.0022323155,0.0066934563,0.00013181935,0.0017515485,0.000067525754,0.00048705077,0.9877808],"genre_scores_gemma":[0.0019681302,0.0007291373,0.005328781,0.00064137246,0.00032897055,0.00044565595,0.000021214068,0.0002650295,0.9902717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980387,0.00017330641,0.00062343467,0.00038629366,0.00048152474,0.00029671405],"domain_scores_gemma":[0.9859358,0.012697423,0.00025997398,0.0009790614,0.000023747014,0.00010397904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011755378,0.00035624747,0.00061320723,0.000055931447,0.00047361135,0.00031529416,0.00087992346,0.00023233851,0.0002996455],"category_scores_gemma":[0.00022473714,0.0001907654,0.00031879471,0.00006964679,0.0008257533,0.000083634804,0.00074212736,0.0006234078,0.00042655808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025181267,0.000028722772,7.0697797e-7,0.00015343976,0.00027721,0.0000050544995,0.0005665527,1.6338751e-7,0.0000010170762,0.98160213,0.01539431,0.0019454834],"study_design_scores_gemma":[0.00038133623,0.000017401364,0.000015672094,0.00015240908,0.00026228858,0.000020522417,0.00016370667,0.000027294329,0.000011017825,0.9566123,0.042113386,0.00022269628],"about_ca_topic_score_codex":2.5299488e-7,"about_ca_topic_score_gemma":8.370853e-7,"teacher_disagreement_score":0.026719078,"about_ca_system_score_codex":0.0000070858,"about_ca_system_score_gemma":0.00003263854,"threshold_uncertainty_score":0.7779187},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9363091,0.000012961558,0.0012123183,0.00079284015,0.00003991123,0.00019742639,0.0000042456995,0.0004161231,0.061015084],"genre_scores_gemma":[0.99436474,0.000013326559,0.0036008821,0.00009829392,0.000015379115,0.000076523655,0.0000048491806,0.000011670124,0.0018143156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949604,0.000031488595,0.00013769133,0.00012285585,0.000065535256,0.00014639202],"domain_scores_gemma":[0.9993715,0.0003584652,0.000023054074,0.0002157543,0.000011841851,0.000019363171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019532164,0.000066160894,0.000095005074,0.00007613187,0.000058863166,0.000011833571,0.00011777605,0.000028025841,0.0001740705],"category_scores_gemma":[0.000051941042,0.00005510429,0.000046054738,0.00060768006,0.000041207983,0.00006155734,0.00003196006,0.00005261776,0.00031518814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000192339,0.000044417877,0.00042375887,0.000010210637,0.000005243176,0.0000015446752,0.00046957275,0.000003207201,0.001510108,0.99163127,0.0053830314,0.00051573507],"study_design_scores_gemma":[0.0001819967,0.000005751174,0.0008481332,0.000008769504,0.0000047796957,6.80645e-7,0.0005741524,0.00003969607,0.006009081,0.9914327,0.00082087296,0.00007335576],"about_ca_topic_score_codex":0.0000200003,"about_ca_topic_score_gemma":0.00009774517,"teacher_disagreement_score":0.05920077,"about_ca_system_score_codex":0.000004058426,"about_ca_system_score_gemma":0.0000055896403,"threshold_uncertainty_score":0.40512112},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9037695,0.0003232435,0.0074130897,0.016998632,0.0010394516,0.0015428062,0.00015989077,0.00056427496,0.06818911],"genre_scores_gemma":[0.981566,0.00073196844,0.010899088,0.000101042264,0.00027938889,0.00007439949,0.000006439844,0.00014060031,0.0062010433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801606,0.00012616086,0.0008041284,0.00013711264,0.0005404355,0.00037610903],"domain_scores_gemma":[0.99583095,0.0023758125,0.0006272225,0.0009646813,0.00007517477,0.00012616403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021720142,0.0002022769,0.0003728914,0.00021165302,0.000557397,0.0000978803,0.000926724,0.000072896066,0.0000808455],"category_scores_gemma":[0.0013613753,0.00012002405,0.0004027225,0.00078813836,0.00019580398,0.00007237653,0.00011289463,0.0003922706,0.00011502736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024908115,0.00009820105,0.000012354052,0.00007120618,0.00009578114,0.000008381471,0.00064231304,0.000009131792,0.00023075448,0.98489666,0.0135378335,0.00037245476],"study_design_scores_gemma":[0.00052127347,0.00012488666,0.00006614394,0.0001505839,0.00006885027,0.00006666066,0.0013511608,0.000282988,0.0016294449,0.99282444,0.0027765369,0.00013705726],"about_ca_topic_score_codex":4.2037274e-7,"about_ca_topic_score_gemma":0.000004274202,"teacher_disagreement_score":0.077796526,"about_ca_system_score_codex":0.000021362455,"about_ca_system_score_gemma":0.00003842206,"threshold_uncertainty_score":0.48944387},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.995273,0.00013281748,0.0016887847,0.0008721125,0.000049181734,0.0002949126,0.00007464122,0.00003046555,0.001584081],"genre_scores_gemma":[0.999042,0.00017302907,0.00034997042,0.00007549212,0.000044103384,0.000038090668,0.000004735869,0.000014587883,0.00025799134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908006,0.000032358792,0.000497204,0.000106965184,0.00015816456,0.00012526473],"domain_scores_gemma":[0.99852985,0.00054012105,0.0004813214,0.00020636704,0.0001478452,0.00009450545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039097518,0.0000988548,0.00024894,0.00022835062,0.0001267024,0.000017356206,0.00017701392,0.000053938944,0.000074931726],"category_scores_gemma":[0.00012906105,0.00008205458,0.00010648976,0.00047398952,0.000060538125,0.000078718425,0.000020402584,0.00013264555,0.00003258361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002457954,0.00012613571,0.000050239152,0.000035964,0.000041365307,9.229663e-7,0.0002248608,7.3429703e-7,0.008031153,0.98801696,0.0024589763,0.0009881008],"study_design_scores_gemma":[0.00028643757,0.0001097066,0.0042261314,0.000058151672,0.000063798165,0.000019006731,0.00018696272,0.000013880509,0.002660663,0.98431677,0.007958216,0.000100289515],"about_ca_topic_score_codex":2.5675533e-7,"about_ca_topic_score_gemma":6.215012e-7,"teacher_disagreement_score":0.0054992386,"about_ca_system_score_codex":0.000008912691,"about_ca_system_score_gemma":0.000028121092,"threshold_uncertainty_score":0.33460888},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96910536,0.00029317758,0.015021018,0.0056162234,0.000057536672,0.001306978,0.00023552892,0.0009381809,0.0074259858],"genre_scores_gemma":[0.9939513,0.0001630365,0.0023034222,0.00014373475,0.0004905519,0.00066918577,0.00013817647,0.000029198698,0.002111368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917805,0.000029718472,0.00023532429,0.00024452762,0.0001371443,0.00017526031],"domain_scores_gemma":[0.9988416,0.00065653434,0.00007378265,0.0002654735,0.000060864804,0.00010174454],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023850951,0.000109059176,0.00014370197,0.00008966565,0.00035675673,0.000027602684,0.00015401648,0.00007160811,0.0001246639],"category_scores_gemma":[0.00009550166,0.0001025181,0.000054217948,0.0005759549,0.00005023153,0.00010489495,0.000059248516,0.00013778509,0.0008195185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020451494,0.000038547114,0.00051765254,0.000040233273,0.00002825305,1.92135e-7,0.00009169056,0.0000016323603,0.00072486413,0.99423546,0.0023437124,0.0019757343],"study_design_scores_gemma":[0.000169944,0.0000140430175,0.0055969534,0.0000137509915,0.00007682516,0.0000028356071,0.0001229796,0.0005176223,0.0010518212,0.81862384,0.1736443,0.00016509077],"about_ca_topic_score_codex":0.0000015705294,"about_ca_topic_score_gemma":0.0000014190492,"teacher_disagreement_score":0.17561162,"about_ca_system_score_codex":0.0000067222136,"about_ca_system_score_gemma":0.000017387458,"threshold_uncertainty_score":0.99995846},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9433686,0.000019717363,0.053529453,0.000053050455,0.000042238025,0.00089980493,0.00018824791,0.0003904878,0.0015083792],"genre_scores_gemma":[0.9975534,0.00014288367,0.00075517094,0.000011239811,0.00001742451,0.00002682769,0.000059211387,0.000041355983,0.0013924825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862045,0.00011994998,0.00027405302,0.0006212228,0.000105695086,0.0002586488],"domain_scores_gemma":[0.9974407,0.0007427373,0.00057422626,0.00091481814,0.00022516023,0.00010235748],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003522546,0.00026551206,0.00040524345,0.0003558994,0.00015729366,0.000022753082,0.00080156256,0.00024332273,0.00003434866],"category_scores_gemma":[0.000107304666,0.000279014,0.00021195952,0.0016252777,0.0002526507,0.000090141424,0.00034269853,0.00048198176,0.000041890733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034385466,0.00024441807,0.0060083433,0.00018448112,0.00026860612,0.000025210928,0.00016297319,0.0035960888,0.00005091777,0.989139,0.00026783737,0.000017690802],"study_design_scores_gemma":[0.00025929674,0.00003935637,0.0040204786,0.00021655811,0.0003810402,0.0000017602083,0.00020394554,0.001508503,0.0002667399,0.992772,0.000025548286,0.00030478422],"about_ca_topic_score_codex":0.000111238674,"about_ca_topic_score_gemma":0.0005191887,"teacher_disagreement_score":0.054184783,"about_ca_system_score_codex":0.00009183625,"about_ca_system_score_gemma":0.00013933306,"threshold_uncertainty_score":0.9999662},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9900596,0.000039131795,0.0036183966,0.00025717446,0.00007328189,0.001857799,0.00018042354,0.0006278884,0.0032862811],"genre_scores_gemma":[0.9947336,0.00014146963,0.0016249263,0.000022935072,0.000040841773,0.0021751127,0.00009255647,0.00008368005,0.0010848899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973823,0.00019004176,0.0007517275,0.0008750577,0.00043871312,0.0003621575],"domain_scores_gemma":[0.9957684,0.000966325,0.0009688043,0.0018519977,0.0003171733,0.00012726132],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011772648,0.00038270504,0.00063032366,0.0003363305,0.00016158057,0.000020649482,0.0011408249,0.00033742623,0.00018742391],"category_scores_gemma":[0.00061601197,0.00036696644,0.00027680217,0.0010142453,0.00026420582,0.00007595704,0.0009345958,0.0008750204,0.00037970772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007242943,0.001034074,0.41311345,0.0009887029,0.0009123208,0.000010600346,0.0016886266,0.0003432974,0.0033111894,0.5781681,0.00024802145,0.000109175984],"study_design_scores_gemma":[0.0002004411,0.000017614027,0.15859427,0.00040809307,0.00025857575,0.00000403621,0.00012456965,0.000044093485,0.010764473,0.82914597,0.00007769394,0.0003601673],"about_ca_topic_score_codex":0.00014219739,"about_ca_topic_score_gemma":0.0002621506,"teacher_disagreement_score":0.25451916,"about_ca_system_score_codex":0.00009028187,"about_ca_system_score_gemma":0.00019422961,"threshold_uncertainty_score":0.9998782},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99613607,0.000076702934,0.0007849478,0.00019150447,0.0001063134,0.00015523567,0.00006221282,0.00002079511,0.002466208],"genre_scores_gemma":[0.99525946,0.000025975985,0.004488591,0.000028199694,0.000026989741,0.000004279205,0.0000025379761,0.00002940425,0.00013457713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987742,0.000053290565,0.00061812607,0.00007990354,0.00020564723,0.0002688887],"domain_scores_gemma":[0.998024,0.0007253829,0.00038928376,0.00027477322,0.00026184713,0.00032472136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008290319,0.00012885967,0.00036483273,0.00048130806,0.00011092886,0.000017963446,0.00032188874,0.00007464157,0.00011226264],"category_scores_gemma":[0.00061462773,0.00011475938,0.00020721993,0.00064727326,0.00015970491,0.000067295754,0.000008922895,0.00016939126,0.000021701988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037431778,0.00007095324,0.0005832413,0.00028209135,0.00016600256,0.0000550143,0.006159131,0.000025687888,0.0016018581,0.98455334,0.0061662085,0.0003327509],"study_design_scores_gemma":[0.0002020548,0.000059159185,0.00042600685,0.00015111406,0.00011228844,0.00006525157,0.0031648844,0.00025183125,0.003975467,0.99102354,0.00045679027,0.00011161576],"about_ca_topic_score_codex":0.00011991971,"about_ca_topic_score_gemma":0.0016006802,"teacher_disagreement_score":0.0064702188,"about_ca_system_score_codex":0.000032143565,"about_ca_system_score_gemma":0.0003567237,"threshold_uncertainty_score":0.46797517},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97199535,0.00002549148,0.022556331,0.00015284805,0.000016733879,0.00085223746,0.00006187582,0.00049996166,0.003839144],"genre_scores_gemma":[0.9773407,0.000039341776,0.021501245,0.00002015616,0.000015582003,0.00043164918,0.000023224535,0.000043516004,0.00058460305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987877,0.000041117255,0.00042547454,0.00019380005,0.00029859622,0.0002533012],"domain_scores_gemma":[0.99764395,0.001265614,0.00035139627,0.00054030307,0.00013212017,0.00006660771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058558286,0.00016446674,0.00031218774,0.00021859688,0.00013733956,0.000022755246,0.0003539838,0.000075895725,0.000049600683],"category_scores_gemma":[0.00030285591,0.00013460257,0.00009573017,0.0019895867,0.00014375865,0.00007711803,0.000055664084,0.00013468765,0.00009340152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000492321,0.00037505076,0.00052996917,0.00028869833,0.000089949324,0.0000028507523,0.0015453269,0.000017151111,0.0008198909,0.9948255,0.0013784957,0.00012219338],"study_design_scores_gemma":[0.00019813876,0.000047000387,0.0009404605,0.00014393726,0.000106484964,0.0000084402345,0.00068613037,0.0005838559,0.002637799,0.99440086,0.000077171644,0.0001697033],"about_ca_topic_score_codex":0.000005066398,"about_ca_topic_score_gemma":0.00004267179,"teacher_disagreement_score":0.005345305,"about_ca_system_score_codex":0.00002150623,"about_ca_system_score_gemma":0.000039176637,"threshold_uncertainty_score":0.54889333},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9905522,0.00031293774,0.0034100306,0.0007446065,0.00002806383,0.0010062197,0.00022605949,0.00033325146,0.003386649],"genre_scores_gemma":[0.99340576,0.00020405982,0.0029204453,0.000053608466,0.00007226227,0.0006185704,0.0001400972,0.000040826802,0.0025443956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887764,0.000045298042,0.00031550828,0.00032993493,0.00019520763,0.0002363921],"domain_scores_gemma":[0.9985847,0.0004553536,0.00016600528,0.00057914585,0.000096224954,0.00011857411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030030325,0.00017502658,0.00023780043,0.00012768398,0.00039372896,0.000017091577,0.00026281422,0.000077955985,0.00008356631],"category_scores_gemma":[0.00007550328,0.00015877452,0.00010409026,0.0007873959,0.00014018713,0.00007042519,0.00014819895,0.000103068676,0.0001558709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007326467,0.000079705824,0.0010069201,0.00008312066,0.000056942466,6.8750785e-7,0.0001892956,0.0000032978587,0.0062747668,0.9887738,0.0017914813,0.0017326223],"study_design_scores_gemma":[0.0003669483,0.000025740428,0.0047704773,0.00002671137,0.00013920388,0.000010419011,0.000146257,0.0010789175,0.016108885,0.9601869,0.016902875,0.00023669393],"about_ca_topic_score_codex":0.0000065754416,"about_ca_topic_score_gemma":0.000030304764,"teacher_disagreement_score":0.028586961,"about_ca_system_score_codex":0.000010166276,"about_ca_system_score_gemma":0.00001814886,"threshold_uncertainty_score":0.64746374},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9401477,0.000029985355,0.000053434956,0.006649916,0.000061396226,0.00074676593,0.00066158257,0.00014120697,0.051508],"genre_scores_gemma":[0.99565077,0.000010981475,0.00087975845,0.00028371735,0.00006343291,0.000051650106,0.000037684364,0.000050203984,0.0029717812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810016,0.000121281504,0.00069831463,0.0003056498,0.00032921985,0.00044540135],"domain_scores_gemma":[0.99655527,0.0020331626,0.00019009174,0.000733686,0.00010296086,0.0003848012],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00082789926,0.00024341654,0.0005450501,0.0003827078,0.0001477108,0.000027215945,0.00044163092,0.00016163746,0.0015789054],"category_scores_gemma":[0.0013482985,0.00020996205,0.00014424503,0.00053218356,0.00022787247,0.000029810959,0.000037442922,0.00023395185,0.0033699675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004223831,0.00016529906,0.0000120631075,0.0003157799,0.00006434418,0.000011422816,0.00088940846,0.00031282197,0.000045374276,0.96782553,0.030112745,0.00020295584],"study_design_scores_gemma":[0.0009559945,0.00032929404,0.0002517714,0.0008442559,0.00012244015,0.000009492825,0.001263465,0.0021764766,0.0027321714,0.96134335,0.029504478,0.0004668329],"about_ca_topic_score_codex":0.0003671042,"about_ca_topic_score_gemma":0.00018985129,"teacher_disagreement_score":0.055503078,"about_ca_system_score_codex":0.000058949023,"about_ca_system_score_gemma":0.00013151423,"threshold_uncertainty_score":0.9993338},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78978914,0.00013995101,0.20970187,0.00002752713,0.0000071244226,0.0001255904,0.00001283549,0.000095442054,0.00010051441],"genre_scores_gemma":[0.97923625,0.00013677313,0.020528698,0.0000014948214,0.0000035052205,0.00003318847,0.000004467524,0.00001677102,0.000038826365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991868,0.00001199416,0.00036637587,0.00015514913,0.00012336086,0.00015628463],"domain_scores_gemma":[0.9990818,0.00054821733,0.00009175764,0.00018652462,0.00003102085,0.00006070813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048971025,0.00011616103,0.00039781386,0.0003640663,0.00003963087,0.0000131221905,0.000080251055,0.00006531138,0.000007870745],"category_scores_gemma":[0.000051222465,0.00009925611,0.00008817856,0.0008416462,0.00006829286,0.00003755167,0.000038705184,0.00008906691,0.0000014169306],"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.000003027849,0.00006609238,0.00013747156,0.0016942847,0.00051386387,3.1524374e-7,0.0017988102,0.10492265,0.0016384575,0.88902473,0.0000061075466,0.00019420907],"study_design_scores_gemma":[0.000064724154,0.000013458266,0.00006273325,0.00010639099,0.00041529554,7.831241e-7,0.00005717485,0.5382882,0.00043118128,0.4604847,0.000007170301,0.0000681581],"about_ca_topic_score_codex":0.000003170705,"about_ca_topic_score_gemma":4.0463905e-7,"teacher_disagreement_score":0.43336555,"about_ca_system_score_codex":0.00000208958,"about_ca_system_score_gemma":0.0000038456096,"threshold_uncertainty_score":0.40475467},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9979067,0.00022199232,0.00028910625,0.00054536096,0.000022433629,0.00025508032,0.000009446948,0.00008615263,0.00066375],"genre_scores_gemma":[0.99904865,0.00013581841,0.0003650035,0.000014138393,0.000026310416,0.000069115435,0.000005135212,0.000009634839,0.00032618621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953866,0.000030604875,0.00015339919,0.00008932385,0.000089644076,0.00009836669],"domain_scores_gemma":[0.9990395,0.0006205219,0.000057156438,0.00022820788,0.00002964025,0.000025009138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029985968,0.000054281656,0.00008543694,0.00004313148,0.00015939564,0.000007008923,0.00011394403,0.00003120642,0.000006237669],"category_scores_gemma":[0.00018203359,0.000036772617,0.000030855594,0.00035345007,0.00005035409,0.00002561448,0.000038117112,0.0000472632,0.00006784996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023446537,0.000019284204,0.00022983715,0.00006822911,0.000015101213,1.0501519e-7,0.0001434777,3.6143103e-7,0.014549039,0.982827,0.00047936197,0.0016658435],"study_design_scores_gemma":[0.00012690584,0.000016936388,0.0019499406,0.000018752391,0.00002597304,0.0000021119747,0.00039959815,0.0029436946,0.02243032,0.9692229,0.0027999752,0.00006291088],"about_ca_topic_score_codex":0.0000018108508,"about_ca_topic_score_gemma":0.0000027335204,"teacher_disagreement_score":0.0136041315,"about_ca_system_score_codex":0.000003682647,"about_ca_system_score_gemma":0.0000062206977,"threshold_uncertainty_score":0.14995438},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9972108,0.000033467903,0.00025791806,0.00024031762,0.00004286319,0.00013662188,0.000011106594,0.000020695292,0.002046232],"genre_scores_gemma":[0.9968764,0.000025721942,0.0028566874,0.00003770227,0.00007644558,0.000009474818,0.0000024072503,0.000011763237,0.000103374834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992219,0.000021549886,0.00038469333,0.00007681953,0.00017382379,0.00012116609],"domain_scores_gemma":[0.9992052,0.0001944801,0.00031776546,0.00013805566,0.000069764865,0.000074741714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046436925,0.00008796356,0.00026382066,0.00011667988,0.00007120515,0.000013595457,0.0001434007,0.000052862928,0.000078244295],"category_scores_gemma":[0.000032068878,0.00006973608,0.00008189511,0.0002875219,0.00010469259,0.000040982748,0.0000400091,0.00015664265,0.0000098346045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023909783,0.00013544016,0.00041002868,0.000062862826,0.00004191095,0.0000052142127,0.00023558848,7.692711e-7,0.013636393,0.9789903,0.0034567032,0.0030008762],"study_design_scores_gemma":[0.00041568323,0.000053712647,0.009928261,0.00003010219,0.00013832595,0.000046139292,0.0004728203,0.000007155859,0.0055090957,0.98278654,0.0005267861,0.000085406886],"about_ca_topic_score_codex":3.1649827e-7,"about_ca_topic_score_gemma":0.0000013916292,"teacher_disagreement_score":0.009518232,"about_ca_system_score_codex":0.000005308136,"about_ca_system_score_gemma":0.000019848538,"threshold_uncertainty_score":0.2843755},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89740694,0.000012552166,0.09666397,0.00018145099,0.0001930486,0.0008637849,0.00027022697,0.00034878158,0.004059256],"genre_scores_gemma":[0.997965,0.00002846517,0.0002702832,0.000044580604,0.000021865113,0.0000051166376,0.000031149313,0.000027413966,0.0016061489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891585,0.00007436293,0.00016672896,0.00056858116,0.00006013632,0.00021433416],"domain_scores_gemma":[0.9984245,0.0006345328,0.00016163515,0.0006165234,0.000053740907,0.00010908497],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024067053,0.00022520279,0.0002640677,0.00016673653,0.00018365565,0.00002911973,0.0002913769,0.00012050276,0.00010596058],"category_scores_gemma":[0.000063541,0.0002488532,0.000097112475,0.00018910866,0.00017101826,0.000024738149,0.0005311635,0.00033941484,0.000109048335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028451479,0.000085125685,0.00005711014,0.000082434985,0.0000922754,0.00002979899,0.000100329744,0.008308067,0.0000110498295,0.9902,0.0009768998,0.000028474607],"study_design_scores_gemma":[0.00036700247,0.000039801114,0.0001001969,0.00015913988,0.00014582535,0.0000012462344,0.00028138314,0.009702096,0.000012169739,0.98887247,0.000077310986,0.00024137802],"about_ca_topic_score_codex":0.000020613847,"about_ca_topic_score_gemma":0.00004265713,"teacher_disagreement_score":0.10055804,"about_ca_system_score_codex":0.00006817,"about_ca_system_score_gemma":0.00004117402,"threshold_uncertainty_score":0.99999636},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9906921,0.000017699324,0.0010341293,0.004336773,0.000017954935,0.0010358365,0.00006166032,0.00008322445,0.002720623],"genre_scores_gemma":[0.99864596,0.000015008842,0.00011970079,0.00013735985,0.000037236343,0.0005643453,0.0000059184713,0.000009613437,0.00046484958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937814,0.000060124592,0.00019180679,0.00014769554,0.00012045306,0.00010178768],"domain_scores_gemma":[0.99825263,0.00102143,0.00008439449,0.0005542685,0.000057596946,0.000029688157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036872047,0.00007418621,0.00008526262,0.000022202506,0.00035228726,0.000010530943,0.00024281957,0.000037276623,0.00007889136],"category_scores_gemma":[0.00022377701,0.000040469014,0.000057392157,0.00051898876,0.00011462294,0.000022741442,0.00007915045,0.00011631215,0.00007075781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020896975,0.00005525463,0.000074200456,0.000018484045,0.000009031,1.102011e-8,0.00025553218,0.0000027401882,0.0024214762,0.9964048,0.00058128085,0.0001750498],"study_design_scores_gemma":[0.00008118577,0.000011672853,0.0020549523,0.000008658101,0.000023789698,6.1659534e-7,0.00022730912,0.0010971413,0.021520348,0.9675424,0.007369081,0.00006284442],"about_ca_topic_score_codex":0.000001123004,"about_ca_topic_score_gemma":0.0000044572926,"teacher_disagreement_score":0.028862448,"about_ca_system_score_codex":0.0000045406227,"about_ca_system_score_gemma":0.000019879135,"threshold_uncertainty_score":0.27095443},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9237877,0.00061990146,0.038968768,0.0007834103,0.000098865465,0.00021276851,0.000022243263,0.000054212796,0.03545211],"genre_scores_gemma":[0.9849836,0.0000069734074,0.01402561,0.000009223181,0.00018850264,0.000008071099,5.2772583e-7,0.000024189158,0.0007532999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987418,0.000030275234,0.0006742158,0.00010445791,0.00031639938,0.00013284276],"domain_scores_gemma":[0.99840564,0.0008141256,0.00028155863,0.00023302973,0.00017090183,0.00009472352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084202486,0.00012615901,0.0003538763,0.000046705674,0.000026224878,0.000023724055,0.00026772937,0.00010502559,0.0006287157],"category_scores_gemma":[0.00066077913,0.000087845125,0.0002614327,0.00019590465,0.00016630691,0.0000958042,0.00004048426,0.00038062606,0.000009583357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003277503,0.0003668996,0.000003104246,0.0021726668,0.00018803144,0.000022664193,0.0008221823,0.0000013786563,0.07480747,0.918522,0.0018109874,0.0012498355],"study_design_scores_gemma":[0.000090388276,0.00002332772,0.0000014380142,0.00044839695,0.000091033486,0.00019319764,0.00028633577,0.000084562336,0.2747464,0.72355187,0.00042055539,0.00006250481],"about_ca_topic_score_codex":6.298259e-8,"about_ca_topic_score_gemma":1.5640982e-8,"teacher_disagreement_score":0.19993892,"about_ca_system_score_codex":0.000028137209,"about_ca_system_score_gemma":0.000083070794,"threshold_uncertainty_score":0.6883996},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8837522,0.000065268185,0.090748005,0.0044830134,0.000266242,0.0026084124,0.0052068126,0.0004594484,0.012410551],"genre_scores_gemma":[0.99412453,0.0000025581726,0.004442598,0.00015606452,0.000023511842,0.0005605676,0.00008220598,0.00003938166,0.0005685905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981083,0.00015143349,0.0006424074,0.0002898713,0.000426842,0.000381129],"domain_scores_gemma":[0.99712795,0.0013412865,0.0003042935,0.00091417885,0.00015363788,0.00015865981],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00074849324,0.00023094882,0.0004583191,0.00029322322,0.0006388578,0.000025153366,0.00051575317,0.000054498694,0.0010634545],"category_scores_gemma":[0.0012955868,0.00022210402,0.00024593374,0.0010783469,0.000112894944,0.000045172812,0.00023293235,0.00028797204,0.000072722236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031279567,0.00056603726,0.000011134018,0.000049676255,0.00007618896,0.0000024032095,0.0006694593,0.000099644785,0.0018165141,0.9911109,0.005533118,0.000033648543],"study_design_scores_gemma":[0.0005525086,0.0002690758,0.000046631074,0.00004146507,0.00011140055,0.00001607514,0.0007441754,0.0004871568,0.0066089663,0.9886539,0.0022210116,0.00024765386],"about_ca_topic_score_codex":0.0000041032495,"about_ca_topic_score_gemma":0.0000053057324,"teacher_disagreement_score":0.110372275,"about_ca_system_score_codex":0.000114470036,"about_ca_system_score_gemma":0.000060336042,"threshold_uncertainty_score":0.99984974},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95866966,0.00011074541,0.02666123,0.002232559,0.00016938255,0.0022127966,0.0033037544,0.00051245897,0.0061274073],"genre_scores_gemma":[0.9863543,0.0000067255787,0.01154553,0.0001725864,0.000022997177,0.0012851392,0.00013978127,0.00004275363,0.00043020607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804693,0.0002089409,0.0006240506,0.00032100148,0.00034043728,0.0004586101],"domain_scores_gemma":[0.9980724,0.0007579001,0.00017219705,0.0007252877,0.000121396755,0.00015085154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087255414,0.00022863367,0.00041474486,0.00038576307,0.0006955742,0.000048161524,0.0005033625,0.00005313173,0.00045235085],"category_scores_gemma":[0.00053603423,0.00023321886,0.000166348,0.0012696772,0.00008756614,0.000069674155,0.00023778378,0.00033380222,0.000103242484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013047297,0.00036775888,0.000098768745,0.00003519815,0.000030573086,0.0000054568195,0.001706991,0.00012321993,0.0026717512,0.9923719,0.0024918115,0.00008353387],"study_design_scores_gemma":[0.00056623225,0.000056711127,0.0004939005,0.0000378089,0.000054327655,0.000021665746,0.0012290536,0.0015499785,0.0005219628,0.9824601,0.012691775,0.00031652738],"about_ca_topic_score_codex":0.000014306638,"about_ca_topic_score_gemma":0.00004915818,"teacher_disagreement_score":0.027684616,"about_ca_system_score_codex":0.00018984178,"about_ca_system_score_gemma":0.00004555688,"threshold_uncertainty_score":0.9510389},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9896347,0.0002456162,0.007993264,0.0002773095,0.00015033745,0.0003458231,0.00006040496,0.00020929104,0.0010832873],"genre_scores_gemma":[0.99602264,0.00002470303,0.0030620962,0.00005536894,0.00011839048,0.000025273877,0.000011640712,0.000025024827,0.0006548544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992424,0.00003846254,0.00022215085,0.00023271955,0.00014004935,0.00012421313],"domain_scores_gemma":[0.9989214,0.0007178028,0.00004656551,0.00021773022,0.000037173577,0.000059323906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002461557,0.00013298471,0.00016408399,0.00013450746,0.000063210675,0.00002458099,0.00007880327,0.00007637384,0.00005249403],"category_scores_gemma":[0.00015954125,0.000104415216,0.000074484466,0.00018944342,0.000066039014,0.000046439454,0.000021503638,0.00016654714,0.000092752496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000742051,0.00016115715,0.0000034119798,0.00019430382,0.000032746026,0.000002772009,0.00043811,0.00014295989,0.00094798324,0.993589,0.00038185253,0.0040314947],"study_design_scores_gemma":[0.0008113031,0.00042157882,0.0001332263,0.00073517417,0.0001665112,0.000015231896,0.00015763831,0.08990408,0.01089826,0.89418435,0.002234288,0.0003383452],"about_ca_topic_score_codex":0.000008081507,"about_ca_topic_score_gemma":0.000003562237,"teacher_disagreement_score":0.09940464,"about_ca_system_score_codex":0.000007585947,"about_ca_system_score_gemma":0.000015723617,"threshold_uncertainty_score":0.4257929},"labels":[],"label_agreement":null},{"id":"W4391127520","doi":"10.61091/ars157-14","title":"On Lanzhou Index of Graphs","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Innovation Scientists and Technicians Troop Construction Projects of Henan Province; National Natural Science Foundation of China; Sungkyunkwan University; National Research Foundation","keywords":"Mathematics; Index (typography); Statistics; Computer science; World Wide Web","score_opus":0.028476082883004183,"score_gpt":0.29881417138011196,"score_spread":0.2703380884971078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127520","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9903677,0.0000042124793,0.0000064702067,0.00012251495,0.00024762755,0.00012269903,0.000007275483,0.00015897318,0.008962535],"genre_scores_gemma":[0.9994634,0.000005008041,0.000044010347,0.000032586275,0.0000016621997,0.000030697396,0.0000051644906,0.000013961371,0.00040353963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994547,0.000033138556,0.0001472285,0.00010952551,0.00013353453,0.000121895144],"domain_scores_gemma":[0.99908006,0.0004551164,0.00006534784,0.0003302652,0.000034200802,0.000035027082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023515217,0.00007005656,0.00012212057,0.00011293142,0.000058043108,0.000005174517,0.00015859718,0.00004896416,0.000044138666],"category_scores_gemma":[0.00012340407,0.000064995205,0.00006341444,0.00056985376,0.000044596934,0.000023042274,0.000031538155,0.00008436544,0.00015106758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007464424,0.00010389165,0.0010403554,0.000019629611,0.000016100714,0.0000012490591,0.00012785736,0.0000015364669,0.00029547754,0.9882694,0.009982333,0.00013473352],"study_design_scores_gemma":[0.00029304303,0.000040269068,0.0025882726,0.000018496075,0.000008793865,4.3777223e-7,0.000052745276,0.000026952206,0.0021309906,0.99431974,0.00045540364,0.00006485517],"about_ca_topic_score_codex":0.0000033376766,"about_ca_topic_score_gemma":9.723093e-7,"teacher_disagreement_score":0.009526929,"about_ca_system_score_codex":0.000005391902,"about_ca_system_score_gemma":0.0000089078585,"threshold_uncertainty_score":0.26504275},"labels":[],"label_agreement":null},{"id":"W4391127522","doi":"10.61091/ars157-03","title":"On a conjecture of the harmonic index with given minimum degree of graphs and short proof of Liu’s result on Randić index","year":2023,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Index (typography); Degree (music); Combinatorics; Discrete mathematics; Statistics; Computer science; Physics","score_opus":0.03007204907759478,"score_gpt":0.2713264816441492,"score_spread":0.2412544325665544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127522","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9979025,0.000020965666,0.0000063582415,0.00017991371,0.00007911665,0.0006352365,0.00003522901,0.000026609649,0.0011140752],"genre_scores_gemma":[0.99977535,0.0000070064034,0.00002117898,0.000015516967,0.000001348161,0.0000436043,0.000003310099,0.00001937795,0.000113296825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990036,0.00009038864,0.0003009272,0.00018591453,0.00028076573,0.00013841043],"domain_scores_gemma":[0.9984856,0.0006183992,0.00022137952,0.0005417579,0.000095827796,0.00003699175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000341756,0.00013981144,0.00030767274,0.00012996243,0.000068096946,0.0000049205614,0.00025102627,0.00010177837,0.000005763909],"category_scores_gemma":[0.0001453857,0.00008985362,0.00008297509,0.0006576465,0.00025766323,0.000024633075,0.00006027615,0.00019461138,6.8842957e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051257765,0.00029303107,0.005918084,0.00016261575,0.00011117496,0.0000012519575,0.0010591563,0.00001449046,0.0010178293,0.9897132,0.00099144,0.00020513011],"study_design_scores_gemma":[0.0015166029,0.0004866847,0.018628364,0.00023671995,0.000057162288,0.0000018559409,0.00019896864,0.00006395978,0.032129552,0.9465635,0.00002517237,0.000091471324],"about_ca_topic_score_codex":0.000009971409,"about_ca_topic_score_gemma":0.000012947101,"teacher_disagreement_score":0.043149736,"about_ca_system_score_codex":0.000008452831,"about_ca_system_score_gemma":0.000042554115,"threshold_uncertainty_score":0.3664124},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99100095,0.00010508085,0.002111891,0.00042163258,0.0056095733,0.00051528285,0.0000072865,0.000051734398,0.00017657588],"genre_scores_gemma":[0.99746203,0.000043659296,0.0016343448,0.000026617856,0.00078116247,0.000012677299,0.0000013392782,0.000030028345,0.000008124495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977807,0.0001077515,0.0010893646,0.00017287792,0.000537761,0.00031157807],"domain_scores_gemma":[0.9888863,0.009134901,0.0012569018,0.00029562888,0.0003192306,0.000107055406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028696314,0.00023791355,0.0006975786,0.00023150466,0.0004580916,0.00008616272,0.0005734836,0.0001595576,0.000006513613],"category_scores_gemma":[0.0015670523,0.00015597486,0.0003453969,0.00049922697,0.0002178374,0.00010916,0.00016153256,0.0003953804,0.0000019174038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012764649,0.0004546512,0.00002953701,0.0002239282,0.00014028238,0.0000033959818,0.0009306924,0.000022153723,0.00028013086,0.9967531,0.0007136453,0.00032083696],"study_design_scores_gemma":[0.0022878456,0.00092676573,0.000083772684,0.00019165392,0.00019269546,0.000019876818,0.0007984696,0.00097423035,0.0008593357,0.99335295,0.00014977726,0.00016265005],"about_ca_topic_score_codex":0.0000016078342,"about_ca_topic_score_gemma":1.3042343e-7,"teacher_disagreement_score":0.0090271495,"about_ca_system_score_codex":0.000022482078,"about_ca_system_score_gemma":0.000051984265,"threshold_uncertainty_score":0.63604707},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9380949,0.0002088706,0.056523964,0.00007742394,0.000092778566,0.000114959876,0.000002925328,0.000031199943,0.0048529436],"genre_scores_gemma":[0.9320576,0.000028241398,0.0677898,0.000018497763,0.00007339734,0.0000011504139,2.1606223e-7,0.000018997598,0.000012072735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990172,0.0000058394276,0.0005490065,0.00010182449,0.00019055737,0.0001356031],"domain_scores_gemma":[0.9988048,0.00064714695,0.00032265784,0.000133833,0.000037065798,0.00005451319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057828915,0.00012196099,0.00030863337,0.00014192074,0.00007951288,0.000053029373,0.00013780904,0.00003904575,0.000008155659],"category_scores_gemma":[0.000033086584,0.00009544636,0.00010617155,0.00018653304,0.000056568715,0.00004695727,0.000033270044,0.00022346262,0.0000017760409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015564394,0.0001034946,0.0000014153666,0.0005620692,0.00006184778,0.000005496865,0.0015595055,0.00007222044,0.003115748,0.9915321,0.00011097977,0.0028595554],"study_design_scores_gemma":[0.0001639304,0.0000574494,0.0000071444556,0.0005639796,0.0000549055,0.00004070213,0.0005904544,0.004942329,0.003508768,0.98985094,0.00012705183,0.00009233498],"about_ca_topic_score_codex":1.5945699e-7,"about_ca_topic_score_gemma":3.106353e-7,"teacher_disagreement_score":0.011265835,"about_ca_system_score_codex":0.000012017689,"about_ca_system_score_gemma":0.000019068415,"threshold_uncertainty_score":0.389219},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8328857,0.00003430309,0.16612206,0.0007033936,0.000044310553,0.00006132919,0.000009642911,0.000012917157,0.00012634505],"genre_scores_gemma":[0.9983519,0.0000050998656,0.0011240576,0.00018030734,0.00017820598,0.000006517544,0.0000010677485,0.000016512944,0.00013633016],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993322,0.000033726672,0.00030102627,0.00006307444,0.0001580713,0.00011188546],"domain_scores_gemma":[0.9989543,0.00051184813,0.00017461462,0.0001646091,0.00014986563,0.0000447868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002978819,0.000078049496,0.00017861187,0.000006683802,0.000029370904,0.000016452275,0.00013230939,0.000029037737,0.00007291106],"category_scores_gemma":[0.000028428107,0.000046077173,0.00013186535,0.00014781301,0.00011173417,0.000093603194,0.000020365254,0.000102141195,0.000007722571],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003906199,0.00014605753,0.00000802503,0.000050568335,0.00014251884,2.7040866e-7,0.0005122248,0.000008965614,0.64537525,0.3463235,0.0050526904,0.0019893015],"study_design_scores_gemma":[0.00019158717,0.000049848193,0.000002315692,0.000046013916,0.00021984434,0.000012768461,0.00003681113,0.00054245465,0.552439,0.4454734,0.00094776147,0.00003823438],"about_ca_topic_score_codex":9.650453e-7,"about_ca_topic_score_gemma":2.7961426e-7,"teacher_disagreement_score":0.1654662,"about_ca_system_score_codex":0.000011514189,"about_ca_system_score_gemma":0.000023412666,"threshold_uncertainty_score":0.18789725},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98784804,0.00021755429,0.0061953035,0.0012364853,0.00048251118,0.0003612686,0.00007818733,0.000119489756,0.003461182],"genre_scores_gemma":[0.9990408,0.0000046372747,0.00041732145,0.000038381528,0.000030632527,0.000022757413,0.0000035127307,0.000017721883,0.00042425512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999148,0.00007713523,0.00024778684,0.00017398837,0.00019303584,0.00016003],"domain_scores_gemma":[0.99913293,0.00026762806,0.000063730186,0.0004593346,0.000042014828,0.00003436685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003571684,0.00010034887,0.00014326816,0.000042182288,0.00012485031,0.000024642226,0.00029651052,0.000044193093,0.00018751255],"category_scores_gemma":[0.000113286485,0.00006508319,0.00013497769,0.00036345673,0.0003026559,0.000039023886,0.0000876185,0.00015061775,0.00013194329],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042150123,0.00012377846,0.00008827543,0.00011461469,0.000022740074,5.505796e-7,0.00041621833,0.000002591937,0.0016479273,0.9935947,0.0037898233,0.00019454601],"study_design_scores_gemma":[0.000073453055,0.000015405596,0.0008257998,0.000095123076,0.00004124299,0.000004781903,0.00010468151,0.008340935,0.003084696,0.97546834,0.011862758,0.0000827714],"about_ca_topic_score_codex":0.000009292714,"about_ca_topic_score_gemma":0.000005984522,"teacher_disagreement_score":0.018126367,"about_ca_system_score_codex":0.00001312176,"about_ca_system_score_gemma":0.00003158049,"threshold_uncertainty_score":0.26540157},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88270015,0.0005250638,0.113027364,0.00009893804,0.00034225063,0.0001480685,0.000017870902,0.000019842184,0.0031204377],"genre_scores_gemma":[0.9957564,0.000053380787,0.0036423008,0.000025086854,0.00023439091,0.0000067912597,0.000005593014,0.000019762942,0.00025630873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985025,0.00017777122,0.00074167544,0.00012365714,0.0003480989,0.00010629405],"domain_scores_gemma":[0.99817175,0.0008249497,0.00054156873,0.00020913908,0.00020483232,0.000047770816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017324046,0.00011171515,0.00030136618,0.0002795846,0.000046663925,0.000018894141,0.00018288975,0.00008241855,0.0001582398],"category_scores_gemma":[0.00013199136,0.00009001521,0.0003262327,0.00035448567,0.0001510465,0.00028744232,0.000033074066,0.00023008772,0.000008658537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003954565,0.00023185402,0.00016871895,0.00019229729,0.00021899355,0.000003952105,0.0005473989,0.000015981877,0.11644651,0.87551683,0.0012137481,0.0050482303],"study_design_scores_gemma":[0.00036415918,0.00028986402,0.009050813,0.00023235173,0.00025790508,0.00005119158,0.0011926539,0.00013666089,0.004152857,0.98373014,0.00046104993,0.00008033087],"about_ca_topic_score_codex":0.0000013032675,"about_ca_topic_score_gemma":5.4396327e-7,"teacher_disagreement_score":0.11305622,"about_ca_system_score_codex":0.00002892399,"about_ca_system_score_gemma":0.00005455143,"threshold_uncertainty_score":0.36707136},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9949526,0.0003359048,0.00015504978,0.0016112718,0.000050671486,0.0011404317,0.00028543948,0.00008232015,0.0013862938],"genre_scores_gemma":[0.98652923,0.0007139966,0.012201232,0.000102073645,0.000035542624,0.00018783356,0.000012700911,0.00006888459,0.00014852628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996593,0.00006842524,0.0015045261,0.00071514247,0.0006257465,0.00049316854],"domain_scores_gemma":[0.99684703,0.0006657377,0.0015779238,0.00045090867,0.00032324516,0.0001351632],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015674552,0.00057923177,0.0015406974,0.00008330018,0.00013061667,0.000104805324,0.0008153729,0.0004044843,0.0000715716],"category_scores_gemma":[0.00061617914,0.00042550007,0.0010937955,0.0011088063,0.0023782423,0.0000859856,0.0016000841,0.0012419277,0.000004476031],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114770155,0.00058009353,0.00450352,0.005207626,0.00047589134,3.2667492e-7,0.0066448385,7.266e-7,0.0069794804,0.9734173,0.0019280049,0.0001474106],"study_design_scores_gemma":[0.00031677439,0.000121566794,0.014796676,0.0018893243,0.0005990026,0.000007172296,0.0029412778,0.00063178944,0.008015697,0.9702451,0.00003909219,0.00039652153],"about_ca_topic_score_codex":0.00010819827,"about_ca_topic_score_gemma":0.0000046357977,"teacher_disagreement_score":0.012046182,"about_ca_system_score_codex":0.000091207134,"about_ca_system_score_gemma":0.00007460812,"threshold_uncertainty_score":0.9998197},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9920331,0.00016537802,0.0012167261,0.000059995164,0.00009963746,0.00026649007,0.00016057516,0.00014281942,0.0058552334],"genre_scores_gemma":[0.99877393,0.0001565216,0.00024867416,0.000012562827,0.000010208654,0.0000011721302,0.000012270266,0.00002259848,0.0007620549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991449,0.00006241869,0.00016294034,0.0004532118,0.00003189789,0.00014460133],"domain_scores_gemma":[0.9988836,0.00025181263,0.00014669029,0.0005781671,0.00006573605,0.00007396622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017966345,0.00021701236,0.00031820804,0.00022382167,0.00007532286,0.000021080896,0.00034093027,0.0001658144,0.00004532911],"category_scores_gemma":[0.0000199533,0.00020779493,0.00021515125,0.0003167892,0.00031364715,0.00003028732,0.00072014536,0.00035885387,0.000012817313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014144582,0.000056939767,0.00024629585,0.000314641,0.00016237966,0.0000082766655,0.00041835321,0.00018519403,0.00037719496,0.99771595,0.00041330606,0.00008734509],"study_design_scores_gemma":[0.00012453736,0.000016419763,0.00012378421,0.00015847837,0.00016031657,0.0000024899084,0.00063830015,0.0016815801,0.0007072981,0.9960152,0.00018163108,0.00018999628],"about_ca_topic_score_codex":0.000028761458,"about_ca_topic_score_gemma":0.000020773414,"teacher_disagreement_score":0.0067407917,"about_ca_system_score_codex":0.00001986873,"about_ca_system_score_gemma":0.000036342728,"threshold_uncertainty_score":0.8473632},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98965836,0.004032697,0.00065762224,0.0009989135,0.00024326183,0.00048208452,0.00005275271,0.00015039425,0.003723925],"genre_scores_gemma":[0.9976961,0.001460083,0.00023699577,0.000013786448,0.0000079335505,0.00009750658,0.000003993141,0.000015015581,0.00046861323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920166,0.000051975203,0.0002431575,0.00019973621,0.00012206526,0.00018141391],"domain_scores_gemma":[0.9993133,0.00026286105,0.000028929791,0.0002551426,0.000062664076,0.0000771312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029691638,0.0001281917,0.00013896739,0.00010114425,0.0005806876,0.00013533048,0.00011634072,0.000052342457,0.000008471548],"category_scores_gemma":[0.000032241125,0.000074419746,0.00008611355,0.00056913384,0.00031129038,0.00010778644,0.00004211538,0.00016641886,0.0000014268076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028314857,0.0000764134,0.00043759297,0.0000627113,0.000052057378,0.0000010427406,0.00027862698,0.000001476183,0.00016862713,0.99744004,0.00094479654,0.0005337615],"study_design_scores_gemma":[0.00013183603,0.00007078407,0.0007053788,0.000039601666,0.00008237049,0.000010516486,0.00038037307,0.0003178513,0.00029173645,0.9950508,0.002810209,0.000108547385],"about_ca_topic_score_codex":0.000017077844,"about_ca_topic_score_gemma":0.000040730145,"teacher_disagreement_score":0.008037724,"about_ca_system_score_codex":0.0000050864683,"about_ca_system_score_gemma":0.000024910958,"threshold_uncertainty_score":0.4466238},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7202826,0.00069166505,0.22913614,0.010729455,0.00014015389,0.0005946134,0.00020665555,0.0005877652,0.037630912],"genre_scores_gemma":[0.8913145,0.0005791901,0.09650141,0.000074792624,0.00006742208,0.0002962038,0.00023149798,0.00008865905,0.010846333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9924748,0.005361864,0.00057177397,0.00073226955,0.00035695816,0.00050231087],"domain_scores_gemma":[0.9933917,0.0034118225,0.00044825475,0.0017939514,0.0006931884,0.00026107128],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.008186728,0.00040067805,0.0003728242,0.00021838657,0.00046239077,0.00041138526,0.0013313019,0.00046631,0.00018782336],"category_scores_gemma":[0.0024592706,0.0004291689,0.00032292487,0.00041178512,0.000382849,0.000070237715,0.0011239052,0.0010268886,0.00004218335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001425736,0.0005274136,0.0025796406,0.00046522156,0.00012784902,0.000014720794,0.031093147,0.00013053053,0.01092566,0.94486743,0.0042991657,0.004954957],"study_design_scores_gemma":[0.00031984833,4.894306e-7,0.004753562,0.0017168082,0.00026534617,0.000049999784,0.00064434065,0.0135388775,0.04972369,0.9194292,0.0090449285,0.0005129349],"about_ca_topic_score_codex":0.000826668,"about_ca_topic_score_gemma":0.00062414113,"teacher_disagreement_score":0.17103185,"about_ca_system_score_codex":0.00034933176,"about_ca_system_score_gemma":0.00074257643,"threshold_uncertainty_score":0.999816},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83696187,0.0013533735,0.13911778,0.005302318,0.0104739275,0.0008880004,0.000014667301,0.00010020108,0.005787837],"genre_scores_gemma":[0.9887902,0.0001342329,0.010890513,0.0000119460765,0.000098933975,0.0000038822286,5.476153e-7,0.000014239819,0.000055480836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898183,0.00009619742,0.000545789,0.0000603675,0.00022522468,0.000090611065],"domain_scores_gemma":[0.99827117,0.0011522239,0.00027736966,0.00011428995,0.00014737448,0.000037581038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010716821,0.0000734396,0.00016678027,0.00010951704,0.00006787456,0.00005974301,0.0001828833,0.000056547084,0.000027465914],"category_scores_gemma":[0.0006316162,0.00005074,0.000118562675,0.0004104148,0.000046089855,0.00018575393,0.000018869816,0.00021150542,0.0000010021012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007048028,0.00009179167,0.000037965456,0.000035870416,0.000029129451,0.0000047569984,0.00039143403,0.006413165,0.00022952475,0.99177295,0.0006794979,0.00024341808],"study_design_scores_gemma":[0.00044629417,0.000072529896,0.000039118404,0.00010696986,0.000030055297,0.00001685882,0.0000683473,0.00421948,0.00048080285,0.9938119,0.00065751764,0.000050103285],"about_ca_topic_score_codex":0.0000016323978,"about_ca_topic_score_gemma":2.830728e-7,"teacher_disagreement_score":0.15182833,"about_ca_system_score_codex":0.000028141103,"about_ca_system_score_gemma":0.00007326975,"threshold_uncertainty_score":0.20691171},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48859572,0.002573573,0.15467528,0.0807748,0.005394357,0.0035040844,0.00025196112,0.0018648425,0.2623654],"genre_scores_gemma":[0.9295179,0.0006630808,0.04366853,0.0007230398,0.0013261378,0.000086272536,0.000008921921,0.00018095093,0.02382513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841243,0.00009144927,0.0005683888,0.000177269,0.0004562059,0.00029425637],"domain_scores_gemma":[0.99765915,0.0014644604,0.00019551604,0.00046502057,0.000093621245,0.00012221174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012140777,0.00022141523,0.00020744152,0.000064325824,0.00071597274,0.000517189,0.0003590015,0.000094497474,0.0003844431],"category_scores_gemma":[0.000340202,0.00012516517,0.00028463494,0.00030876973,0.000111434165,0.00016504708,0.000041152514,0.00063555484,0.00077498355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009467459,0.0000555572,0.0000029603325,0.00009974767,0.00009737281,0.000012045298,0.0018747564,0.000003778305,0.00016510602,0.96640694,0.02974525,0.0015270038],"study_design_scores_gemma":[0.00011573443,0.000038146663,0.000005329624,0.00029202778,0.000077326375,0.00028821896,0.00067024445,0.0036273734,0.0008625033,0.92541784,0.068444245,0.00016100108],"about_ca_topic_score_codex":2.3896055e-7,"about_ca_topic_score_gemma":0.0000010019351,"teacher_disagreement_score":0.44092223,"about_ca_system_score_codex":0.00005013634,"about_ca_system_score_gemma":0.000054190452,"threshold_uncertainty_score":0.9961104},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.793996,0.000117224525,0.20426875,0.00064437353,0.00002046009,0.00030953795,0.000040607756,0.000024567265,0.00057850365],"genre_scores_gemma":[0.99735165,0.000030123136,0.002362095,0.00004477269,0.000065097105,0.000100644655,0.000015263702,0.000008980719,0.000021379812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866927,0.000063650485,0.00052320486,0.00020929141,0.0004595075,0.0000750994],"domain_scores_gemma":[0.9984331,0.0005676949,0.00039003234,0.00022263035,0.00032232414,0.00006419111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053223636,0.00011840309,0.0002676303,0.0008158175,0.00007589483,0.00006915275,0.00034300843,0.000044860324,0.000037367274],"category_scores_gemma":[0.000027640006,0.00007980072,0.00020446563,0.0009919377,0.00010726063,0.000107469226,0.000027587252,0.00016613666,0.0000029749792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011639263,0.001575318,0.029208599,0.000022445814,0.0023627833,0.00001268349,0.000339699,0.00021329425,0.0007764858,0.95165986,0.0000820302,0.013630424],"study_design_scores_gemma":[0.0014954397,0.0013671169,0.18297435,0.00021420489,0.0051880623,0.000077587196,0.002852072,0.0051465053,0.0039726184,0.7927759,0.00348676,0.00044934454],"about_ca_topic_score_codex":0.000009010626,"about_ca_topic_score_gemma":0.000018808341,"teacher_disagreement_score":0.20335568,"about_ca_system_score_codex":0.000019362928,"about_ca_system_score_gemma":0.000038655817,"threshold_uncertainty_score":0.32541788},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58004904,0.026647246,0.16941024,0.021259475,0.0034754723,0.016469507,0.0011916293,0.007050595,0.1744468],"genre_scores_gemma":[0.9813428,0.00011126284,0.01333386,0.000051305713,0.0001030803,0.0013426455,0.000015708036,0.0000887752,0.0036105842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983018,0.00008702387,0.0005532854,0.0003587798,0.00026418673,0.00043489283],"domain_scores_gemma":[0.99511796,0.0038164984,0.00009998865,0.00076774566,0.00009093412,0.00010690019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010949651,0.00025658926,0.000277643,0.00013208612,0.00057042943,0.00021519471,0.0005085342,0.000114910996,0.00021615787],"category_scores_gemma":[0.00038027103,0.00016309878,0.00033022123,0.00056689786,0.00021135903,0.00012676355,0.000065683525,0.00019067738,0.0001899773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013553271,0.000107159096,0.0000057304424,0.00068051275,0.00011784126,0.0000020407272,0.00060314656,5.3931736e-8,0.00007647737,0.9657595,0.024862492,0.007771486],"study_design_scores_gemma":[0.00014898187,0.00003370764,0.000026423348,0.00018409075,0.00013891827,0.000017193901,0.00077801256,0.0031465467,0.00034564838,0.9406897,0.054301724,0.00018906394],"about_ca_topic_score_codex":0.000001591002,"about_ca_topic_score_gemma":0.000010843436,"teacher_disagreement_score":0.40129372,"about_ca_system_score_codex":0.000024826666,"about_ca_system_score_gemma":0.000049399365,"threshold_uncertainty_score":0.66509753},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90786195,0.00030453986,0.02020992,0.0008494705,0.00012087014,0.00057222205,0.00018929079,0.00027412883,0.069617614],"genre_scores_gemma":[0.9963379,0.000008480558,0.0030721873,0.000055625063,0.00001953351,0.000081866994,0.0000070061096,0.000030524916,0.00038690702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987564,0.00012435977,0.00047928302,0.00020926513,0.00025830683,0.00017235868],"domain_scores_gemma":[0.99500895,0.0039037205,0.00011900722,0.0008593702,0.000053912423,0.000055054574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007549256,0.00016341795,0.00028884417,0.00014429573,0.00007753017,0.000020016427,0.00037176415,0.00007282564,0.0007109006],"category_scores_gemma":[0.00041427964,0.00010332604,0.00019687317,0.000461067,0.00024108269,0.000065566455,0.000045502697,0.00012438884,0.00003924309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001301112,0.00032817127,8.369062e-7,0.0004468957,0.00007516121,0.0000017028077,0.0017456434,0.0000016837822,0.000698643,0.99486387,0.0012705339,0.00055382797],"study_design_scores_gemma":[0.00006617301,0.000109244174,0.000007665516,0.00029544978,0.00008048229,0.000005003386,0.0007108414,0.0015580044,0.008509546,0.9879495,0.0006120738,0.00009602802],"about_ca_topic_score_codex":0.000004535433,"about_ca_topic_score_gemma":0.000005968603,"teacher_disagreement_score":0.08847593,"about_ca_system_score_codex":0.0000074201175,"about_ca_system_score_gemma":0.000022737062,"threshold_uncertainty_score":0.77838624},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.893009,0.00021104942,0.027937554,0.0012819542,0.000025162431,0.000855202,0.000036124602,0.0002505201,0.0763934],"genre_scores_gemma":[0.9835352,0.000028780132,0.015337605,0.00003433817,0.00003159725,0.00009053861,0.000005773339,0.00003675006,0.0008994312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910504,0.000015006153,0.00030577817,0.00018574503,0.00021011873,0.00017829945],"domain_scores_gemma":[0.9987321,0.00064250856,0.00010051588,0.0004504728,0.000021941582,0.000052446205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034564128,0.00018512743,0.00027713313,0.0000626977,0.00013372161,0.00005385422,0.00020829025,0.000054133387,0.00004459969],"category_scores_gemma":[0.000012152518,0.000099229066,0.0000612636,0.0002657912,0.00028679348,0.00005218402,0.00006690021,0.00014747155,0.000018797264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021881604,0.000074719625,0.0000053609756,0.00034139905,0.00010569515,9.31156e-7,0.0020781497,0.0000016638455,0.0043535037,0.9913326,0.0011654971,0.0005186019],"study_design_scores_gemma":[0.00024642164,0.00004869713,0.000022742828,0.00018463236,0.00019816363,0.00001817499,0.0018250797,0.001270463,0.01006976,0.9840981,0.0018502302,0.00016756423],"about_ca_topic_score_codex":4.4852015e-7,"about_ca_topic_score_gemma":0.0000070201595,"teacher_disagreement_score":0.090526156,"about_ca_system_score_codex":0.000004722826,"about_ca_system_score_gemma":0.0000162394,"threshold_uncertainty_score":0.4046444},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9819829,0.0010965874,0.00399301,0.0003070714,0.011452588,0.0003713971,0.0000137084135,0.00008328699,0.0006994791],"genre_scores_gemma":[0.990244,0.00006727682,0.007913096,0.00001386918,0.0016855523,0.000004651534,0.0000018937992,0.000052260744,0.000017410002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972424,0.00012966829,0.0015393139,0.00022989835,0.0005556841,0.00030302053],"domain_scores_gemma":[0.9969068,0.0016308287,0.0005496068,0.00031822658,0.0004106381,0.00018390325],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018655771,0.0003034163,0.00082155457,0.00042029945,0.00028170022,0.00022371941,0.0004460166,0.00018685691,0.000020767124],"category_scores_gemma":[0.0005010057,0.0002590844,0.00036783135,0.0005606722,0.00018385203,0.00038239034,0.00019373265,0.0005440844,0.0000032953162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049546514,0.00059983134,0.0000114966415,0.00049108197,0.00020387613,0.000017995111,0.0011470995,0.000031188418,0.0052600405,0.9906965,0.0009767858,0.00051459187],"study_design_scores_gemma":[0.0014977593,0.0005791172,0.000013522596,0.0006807646,0.00026047448,0.00009925127,0.0003450848,0.0037366035,0.0026402795,0.9892795,0.0006144761,0.000253143],"about_ca_topic_score_codex":0.0000056121416,"about_ca_topic_score_gemma":2.6316556e-7,"teacher_disagreement_score":0.009767036,"about_ca_system_score_codex":0.00005060214,"about_ca_system_score_gemma":0.00021480824,"threshold_uncertainty_score":0.9999861},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98980653,0.0008401192,0.002449875,0.000108623,0.0054086316,0.0003342638,0.000011812501,0.00005419761,0.000985971],"genre_scores_gemma":[0.9910429,0.000107187436,0.008283487,0.000004958745,0.00049000065,0.000002918917,0.0000011222592,0.000048913127,0.000018482775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968212,0.00016109666,0.0018833476,0.00021520759,0.0006258377,0.00029330072],"domain_scores_gemma":[0.99572146,0.0018108857,0.0013904953,0.0003763628,0.0005197136,0.00018108173],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021831754,0.0003009384,0.0010129539,0.0004803203,0.00013446099,0.000084393716,0.0004738399,0.0001911694,0.000021603153],"category_scores_gemma":[0.00060422043,0.00026223113,0.00044043316,0.0008687321,0.00023367314,0.00021577756,0.00017254833,0.0004862874,0.000002205836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055754525,0.000649019,0.00007550683,0.0014380745,0.00024708675,0.000015866235,0.0017311525,0.000008526854,0.005090428,0.9896234,0.00041886003,0.00064628647],"study_design_scores_gemma":[0.0016295337,0.00051165087,0.000024794537,0.0014305027,0.00034398178,0.000086389926,0.0005149536,0.0015151519,0.0052268473,0.98797715,0.0005126475,0.0002264269],"about_ca_topic_score_codex":0.000006657068,"about_ca_topic_score_gemma":6.1824085e-7,"teacher_disagreement_score":0.0058336114,"about_ca_system_score_codex":0.00003791725,"about_ca_system_score_gemma":0.00017360631,"threshold_uncertainty_score":0.999983},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.869618,0.010568754,0.10781498,0.003521461,0.0020886064,0.000635749,0.000006136348,0.00015620631,0.005590114],"genre_scores_gemma":[0.99855405,0.0006672437,0.00003242225,0.000045865992,0.00011671805,0.000007967741,0.0000013099966,0.000041471558,0.0005329235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976356,0.0002780583,0.00069418474,0.0001717108,0.00044124082,0.00077919103],"domain_scores_gemma":[0.9978794,0.0012323647,0.0002643889,0.00037657662,0.00014362701,0.000103675455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026157126,0.00022968366,0.0003946813,0.00026481302,0.00014541425,0.00010284484,0.00073928316,0.00011609198,0.00003971745],"category_scores_gemma":[0.00019292947,0.0001579156,0.000246964,0.0013910529,0.00010418884,0.00021603187,0.000058550162,0.0013817991,0.000009471971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003676185,0.00029942926,0.00012277767,0.000050315666,0.00016416337,0.000024597637,0.00070116745,0.00012681683,0.00011105164,0.99734557,0.00081293576,0.00020443779],"study_design_scores_gemma":[0.00053689716,0.00022832095,0.000103832084,0.00009542407,0.00018622016,0.00027360802,0.00017249501,0.002766751,0.0003666731,0.99140334,0.0036929995,0.00017340876],"about_ca_topic_score_codex":0.000007324969,"about_ca_topic_score_gemma":0.000008533122,"teacher_disagreement_score":0.12893608,"about_ca_system_score_codex":0.0005365319,"about_ca_system_score_gemma":0.00047831665,"threshold_uncertainty_score":0.6439611},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96737313,0.0036474364,0.021770135,0.0012051497,0.000042423413,0.0009813274,0.00016850329,0.00018038199,0.0046314974],"genre_scores_gemma":[0.99609095,0.00048967655,0.0026045952,0.000024028206,0.000048498372,0.000106717096,0.000012360361,0.000016802243,0.0006063773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994105,0.000017700104,0.00018129883,0.00021444057,0.00006988467,0.000106172134],"domain_scores_gemma":[0.9993785,0.00028106637,0.000040153758,0.00019214021,0.000038079204,0.00007004697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013639561,0.00009743227,0.00012977238,0.00009747285,0.00012375292,0.000020222804,0.00008650068,0.00005568329,0.000028700859],"category_scores_gemma":[0.000019086176,0.000084080384,0.00004541912,0.00033309066,0.00012257093,0.00007561974,0.000041062216,0.00008895751,0.0000138389705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032734943,0.000039869432,0.000026420485,0.00012578117,0.000032787415,4.1396925e-7,0.00037752462,5.3393796e-7,0.0064892694,0.9900908,0.00026063295,0.0025527305],"study_design_scores_gemma":[0.00019905504,0.000037042184,0.00021098164,0.000059345937,0.00015968943,0.00001696671,0.0005655537,0.001988783,0.010739001,0.9327345,0.053108316,0.00018077153],"about_ca_topic_score_codex":0.0000038121893,"about_ca_topic_score_gemma":0.0000026529628,"teacher_disagreement_score":0.05735627,"about_ca_system_score_codex":0.0000042586753,"about_ca_system_score_gemma":0.000020419024,"threshold_uncertainty_score":0.34286985},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97317845,0.0007865787,0.004538637,0.0010740116,0.00091871637,0.0003766554,0.00011501187,0.00039767497,0.018614246],"genre_scores_gemma":[0.9981432,0.0002098238,0.000117870135,0.00013481549,0.00015843949,0.00010979741,0.000032258726,0.000048802092,0.001045008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874496,0.00007337126,0.00028352565,0.00040031422,0.00014705291,0.0003507416],"domain_scores_gemma":[0.99834216,0.0008799278,0.00008201833,0.00043589098,0.00009721343,0.00016278571],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023455737,0.00031255392,0.00026713545,0.00013583254,0.00057338504,0.00025613396,0.00023334891,0.00008070808,0.000023237377],"category_scores_gemma":[0.000055386306,0.0002625421,0.00021810329,0.0004589807,0.00018642144,0.0003757871,0.000085207925,0.0005099302,0.00007679664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013182633,0.00034696795,0.00030424932,0.00010708173,0.00018883261,0.00001033814,0.0014057809,0.00006625229,0.00046352323,0.9906758,0.004175267,0.0022426997],"study_design_scores_gemma":[0.00015981898,0.00008856818,0.0001927015,0.00022325134,0.00006087593,0.000038633807,0.00047335288,0.0032464415,0.0019894636,0.9214757,0.07177687,0.00027431417],"about_ca_topic_score_codex":0.000024385456,"about_ca_topic_score_gemma":0.000049719765,"teacher_disagreement_score":0.06920011,"about_ca_system_score_codex":0.000079629455,"about_ca_system_score_gemma":0.00008252605,"threshold_uncertainty_score":0.99998266},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6934682,0.00046383147,0.119261056,0.000473807,0.00044867554,0.0020519646,0.00036072367,0.002029759,0.18144196],"genre_scores_gemma":[0.93708813,0.00003206275,0.0618171,0.000060677823,0.00005938925,0.0003229218,0.00007133233,0.00013048615,0.00041793048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976633,0.000020311723,0.0007579344,0.00054935704,0.00038997605,0.0006190741],"domain_scores_gemma":[0.9980331,0.0008363026,0.00020052423,0.0006975105,0.000041441617,0.00019113031],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060544047,0.00044567333,0.00052679674,0.00021730624,0.00031895342,0.00028967808,0.00042958863,0.00017182187,0.00020711364],"category_scores_gemma":[0.00006391264,0.00039823196,0.00029064444,0.00087258784,0.0002951066,0.00016374674,0.00010616498,0.00043650475,0.00018138922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005128533,0.000082222316,0.000018728184,0.00061296823,0.00015013674,0.0000058212486,0.0012749789,0.000001346891,0.022375245,0.9678405,0.0067403545,0.00089259236],"study_design_scores_gemma":[0.00023965255,0.000018773715,0.0000016693026,0.00022509308,0.00021516599,0.000037041995,0.00271715,0.0018325826,0.028259715,0.96482986,0.0011504004,0.0004729169],"about_ca_topic_score_codex":0.0000030472474,"about_ca_topic_score_gemma":0.0000049828463,"teacher_disagreement_score":0.24361987,"about_ca_system_score_codex":0.00005692968,"about_ca_system_score_gemma":0.000037099737,"threshold_uncertainty_score":0.99984694},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9538269,0.00016700917,0.007988772,0.004760913,0.00013795469,0.0009431944,0.000030928797,0.00031227697,0.03183206],"genre_scores_gemma":[0.996066,0.00001031977,0.0019527805,0.0002250852,0.000043479846,0.00021874135,0.0000025058057,0.000037254093,0.0014438397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887234,0.0000825369,0.00040804397,0.00020350736,0.00025264232,0.00018090931],"domain_scores_gemma":[0.9962041,0.0029154392,0.00009441174,0.0007055657,0.000036415913,0.000044087523],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00057941634,0.00017043421,0.0002512134,0.000119498574,0.00009961325,0.00005433685,0.00032937323,0.00006347871,0.001040224],"category_scores_gemma":[0.0003378688,0.0000978248,0.00020678192,0.00044265355,0.00012882375,0.000055438286,0.000040655905,0.00020635099,0.0005351148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004833142,0.00015367307,0.000001078608,0.00045626328,0.00007255928,0.0000024049855,0.0016606817,2.4610083e-7,0.002350965,0.98588955,0.009167747,0.00024000565],"study_design_scores_gemma":[0.00005854549,0.000031515712,0.000014853052,0.0004060685,0.00007635388,0.000009826745,0.00019606444,0.0003565377,0.0047079325,0.9922476,0.0017835528,0.00011116321],"about_ca_topic_score_codex":6.6071146e-7,"about_ca_topic_score_gemma":7.3486945e-7,"teacher_disagreement_score":0.042239103,"about_ca_system_score_codex":0.000009201956,"about_ca_system_score_gemma":0.000019063958,"threshold_uncertainty_score":0.999873},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98760384,0.00044513217,0.0018625039,0.00039282054,0.0071330145,0.00032221267,0.000010868556,0.00010411926,0.0021254946],"genre_scores_gemma":[0.99664074,0.000053892927,0.0026164132,0.000024913717,0.0005928074,0.0000053069784,0.0000018188481,0.000047432328,0.00001669051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979609,0.00010655107,0.00093719375,0.00024848047,0.00046503337,0.0002818108],"domain_scores_gemma":[0.9956498,0.0032104235,0.0004384554,0.00025212858,0.00023632319,0.00021286988],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014113032,0.00029929486,0.00063116575,0.00027756032,0.00038387426,0.00035252573,0.00025274628,0.00015659802,0.00001930229],"category_scores_gemma":[0.000751972,0.00025047097,0.00019444658,0.00030341937,0.00016082037,0.0001804036,0.0001324655,0.0005855316,0.0000061501255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036430632,0.0003983092,0.000012864333,0.00031828054,0.00014502073,0.000025009218,0.0008153089,0.0000025971588,0.0004962892,0.99541384,0.00127171,0.0010643159],"study_design_scores_gemma":[0.0015131038,0.00047326687,0.000063241765,0.0009137257,0.00019353132,0.00018058026,0.00030693662,0.0018913095,0.00051588455,0.9931332,0.00056137145,0.00025384102],"about_ca_topic_score_codex":0.000002262612,"about_ca_topic_score_gemma":3.5130208e-7,"teacher_disagreement_score":0.00903689,"about_ca_system_score_codex":0.000053215394,"about_ca_system_score_gemma":0.000086915694,"threshold_uncertainty_score":0.99999475},"labels":[],"label_agreement":null},{"id":"W4400512486","doi":"10.61091/ars159-15","title":"Sharp Upper Bound for Harmonic Index of Trees with Given Total Domination Number","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Universiti Malaysia Terengganu; Universiti Sains Malaysia","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Vertex (graph theory); Graph; Connectivity; Bound graph; Simple graph; Harmonic mean; Topological index; Discrete mathematics; Mathematical analysis; Geometry; Graph power; Line graph","score_opus":0.018183247079297034,"score_gpt":0.29291427582129237,"score_spread":0.27473102874199534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400512486","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.995986,0.00006223034,0.0005769483,0.00033564123,0.0002647432,0.00044511905,0.000033931552,0.00008309054,0.0022123237],"genre_scores_gemma":[0.9977132,0.0000029320547,0.00076018315,0.000008779068,0.000010194115,0.00019695608,0.000015096755,0.000028572915,0.0012641067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934226,0.000023216504,0.00018536721,0.0001809989,0.00013135411,0.00013678783],"domain_scores_gemma":[0.999192,0.00040531973,0.00006192457,0.00022087843,0.00008468485,0.000035185614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021312761,0.00010830067,0.00015672424,0.000055200086,0.00007878312,0.000044726105,0.00011344014,0.00006309274,0.00010032493],"category_scores_gemma":[0.000043944165,0.00009008326,0.00008639545,0.00022114006,0.00007058277,0.00012995648,0.000022892196,0.00008681981,0.000024379213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038233462,0.00013562164,0.0006253655,0.00012671124,0.000077183686,9.703589e-7,0.00046138713,9.185965e-7,0.00074824493,0.9940283,0.0032252537,0.00053183455],"study_design_scores_gemma":[0.00060618715,0.00007426454,0.0015001189,0.00008811522,0.000075567405,0.000008227763,0.00011634026,0.0003931123,0.0050230618,0.99024844,0.0017515535,0.00011500005],"about_ca_topic_score_codex":0.0000051137063,"about_ca_topic_score_gemma":0.0000060192524,"teacher_disagreement_score":0.0042748167,"about_ca_system_score_codex":0.00002818386,"about_ca_system_score_gemma":0.000040921845,"threshold_uncertainty_score":0.36734888},"labels":[],"label_agreement":null},{"id":"W4400512519","doi":"10.61091/ars159-09","title":"On the Eccentric Graph of Trees","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Eccentric; Graph; Vertex (graph theory); Complement graph; Bound graph; Discrete mathematics; Graph power; Line graph; Physics","score_opus":0.023725452130310354,"score_gpt":0.2797744487017792,"score_spread":0.25604899657146885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400512519","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9881692,0.00016238732,0.000031229894,0.0006938619,0.0004242166,0.00017232235,0.000007171423,0.00009018185,0.010249428],"genre_scores_gemma":[0.99952734,0.000013664612,0.00004109853,0.000035834302,0.0000035192054,0.000031314572,0.0000011184958,0.000011519277,0.00033459056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995076,0.000048506005,0.00013113921,0.0001051402,0.00011474015,0.0000928831],"domain_scores_gemma":[0.9984033,0.0012129975,0.00003146374,0.00030885608,0.000021806642,0.000021546426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002524628,0.00006906114,0.00008660099,0.00006596981,0.00006735731,0.00001912902,0.00018095097,0.000030853666,0.00011005213],"category_scores_gemma":[0.000106520325,0.00004355024,0.000086943335,0.0004459135,0.000058545924,0.000025286756,0.000021008102,0.00010363644,0.00006420315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030065894,0.000093584385,0.000032740623,0.00002272945,0.00002890259,0.0000011702767,0.00017655204,5.9433614e-7,0.00021892242,0.98571473,0.013480851,0.00022618778],"study_design_scores_gemma":[0.00007588258,0.000030432164,0.00012373916,0.000042696363,0.000025796411,0.0000010457528,0.000058000256,0.000041242212,0.0035140219,0.99464977,0.0013896703,0.00004770218],"about_ca_topic_score_codex":0.0000017090342,"about_ca_topic_score_gemma":0.0000010768509,"teacher_disagreement_score":0.012091181,"about_ca_system_score_codex":0.0000072813255,"about_ca_system_score_gemma":0.000011665973,"threshold_uncertainty_score":0.17759272},"labels":[],"label_agreement":null},{"id":"W4400513380","doi":"10.61091/ars159-03","title":"Full Edge-Friendly Index Sets of One Point Union of Cycles","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Point (geometry); Enhanced Data Rates for GSM Evolution; Geometry; Computer science; Artificial intelligence","score_opus":0.021356344053248058,"score_gpt":0.28971049691793777,"score_spread":0.2683541528646897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400513380","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99462116,0.0001799364,0.00039870886,0.00021551157,0.0003706728,0.00018362635,0.000023643997,0.00008516931,0.003921556],"genre_scores_gemma":[0.9990116,0.000015554067,0.0008217832,0.00000558134,0.0000045644274,0.000018472674,0.000006510373,0.000019355199,0.00009658788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919707,0.00006837236,0.0003028108,0.0001505689,0.000162288,0.00011891653],"domain_scores_gemma":[0.9990833,0.00033436096,0.000097507975,0.0003647747,0.00007810842,0.000041966323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041965916,0.000095937234,0.00020280134,0.000104426144,0.000036594818,0.000010467818,0.00017628486,0.000073540985,0.000064252934],"category_scores_gemma":[0.000073205454,0.000092793474,0.00008979887,0.00034708736,0.00009705687,0.00007325878,0.0000614868,0.00012029979,0.000020114048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015828911,0.0002667331,0.00010393056,0.00026019194,0.00005323023,0.0000011465594,0.00042540772,9.863982e-7,0.0065490445,0.990229,0.0012625366,0.0008319759],"study_design_scores_gemma":[0.00022802816,0.00012282802,0.00040767476,0.00016080748,0.000044002296,0.0000027443423,0.0001473026,0.00010493589,0.022047084,0.97616374,0.00048596878,0.000084900596],"about_ca_topic_score_codex":0.000010706591,"about_ca_topic_score_gemma":0.0000028606241,"teacher_disagreement_score":0.015498039,"about_ca_system_score_codex":0.000015596475,"about_ca_system_score_gemma":0.000033068216,"threshold_uncertainty_score":0.3784008},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9540914,0.00003570714,0.01667218,0.00071550126,0.00027482817,0.0015884374,0.00057317404,0.00020322057,0.02584553],"genre_scores_gemma":[0.9760566,0.000008962407,0.021102482,0.000082824816,0.000025942254,0.00008352441,0.000050456336,0.0000470917,0.0025421265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817663,0.00006878966,0.0007019356,0.0003047272,0.00032577603,0.00042216657],"domain_scores_gemma":[0.9970196,0.00085817516,0.00027518225,0.0011213172,0.0005265265,0.00019919095],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005501849,0.00026892452,0.00057439297,0.00012680003,0.00015678433,0.000048188733,0.00047342214,0.00015075282,0.0011517947],"category_scores_gemma":[0.0010716132,0.00024041133,0.00025154077,0.00094318384,0.00012202855,0.00011893038,0.0001455455,0.00019330639,0.002004578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018912202,0.00026312572,0.00065388344,0.00016945468,0.000093795934,6.337016e-7,0.000539088,0.000007761819,0.0036089437,0.99027604,0.0042943885,0.00007399809],"study_design_scores_gemma":[0.00056554284,0.000067619745,0.00031354377,0.0001848626,0.00014892977,0.00001376217,0.00045561237,0.00035112907,0.004300172,0.98969656,0.0035904928,0.00031176547],"about_ca_topic_score_codex":0.000004123643,"about_ca_topic_score_gemma":0.0000023680113,"teacher_disagreement_score":0.023303403,"about_ca_system_score_codex":0.000057735208,"about_ca_system_score_gemma":0.00006897325,"threshold_uncertainty_score":0.9997613},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95731163,0.000079110265,0.0294288,0.0003852093,0.00009339889,0.0015431066,0.0020813544,0.00012348825,0.008953927],"genre_scores_gemma":[0.9943032,0.000009117414,0.0039058805,0.000058800862,0.00001753236,0.00015398768,0.00018538722,0.000042226762,0.0013238582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806315,0.00006517501,0.0007169594,0.0003349764,0.0003637406,0.00045598176],"domain_scores_gemma":[0.9976459,0.00060244894,0.00036009232,0.00090907404,0.0002626981,0.00021979264],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005583262,0.00028143046,0.00055978616,0.00015958269,0.00017670651,0.00004436693,0.00045876944,0.00015013338,0.0003517701],"category_scores_gemma":[0.00019893397,0.00025774806,0.00029363262,0.00063491135,0.00010985089,0.00011608092,0.00011637807,0.00019300422,0.0003294987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002929319,0.00045025934,0.00041294648,0.0002020377,0.00007815027,0.0000010191429,0.0005309888,0.000041796306,0.045165386,0.94705814,0.0060114576,0.000018518293],"study_design_scores_gemma":[0.0021908623,0.000118958684,0.000129234,0.00016458126,0.00023553564,0.000012415434,0.00090159517,0.00048514907,0.064834386,0.9268915,0.003509226,0.00052652106],"about_ca_topic_score_codex":0.000010055898,"about_ca_topic_score_gemma":0.0000045782867,"teacher_disagreement_score":0.036991604,"about_ca_system_score_codex":0.00006536565,"about_ca_system_score_gemma":0.00006704478,"threshold_uncertainty_score":0.9999875},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018022558,0.0016659918,0.5609455,0.057104517,0.042359583,0.04175357,0.12546344,0.0017540986,0.15093072],"genre_scores_gemma":[0.5609217,0.00085543573,0.058025725,0.005859148,0.007552868,0.012568444,0.011314663,0.0018992701,0.3410027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947211,0.0003483991,0.0022031602,0.0008092866,0.001106908,0.0008111122],"domain_scores_gemma":[0.9926218,0.001412427,0.0016066481,0.002423372,0.001443932,0.0004918338],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013015736,0.00093087676,0.0018838798,0.00040967116,0.00054125756,0.00013723635,0.001573437,0.0007274366,0.00026597027],"category_scores_gemma":[0.007378578,0.0006954638,0.0009195933,0.0013619184,0.0003529861,0.00012463574,0.000440967,0.0011485963,0.000645577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059623482,0.0002015851,0.0000017983,0.00044902306,0.00023965222,0.0000017705115,0.001009917,0.00000842561,0.0009675684,0.5643542,0.4326664,0.00004005131],"study_design_scores_gemma":[0.00081945566,0.0007057235,0.000030191584,0.0019201967,0.0011508301,0.000011099151,0.0009871047,0.0028091792,0.0027794624,0.5623814,0.42526123,0.0011441549],"about_ca_topic_score_codex":0.000031602776,"about_ca_topic_score_gemma":0.000089347304,"teacher_disagreement_score":0.5428992,"about_ca_system_score_codex":0.00021734109,"about_ca_system_score_gemma":0.00038836277,"threshold_uncertainty_score":0.9995496},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41370156,0.00012639431,0.5448371,0.02764938,0.0001653732,0.0031052632,0.0033037462,0.00037962288,0.006731515],"genre_scores_gemma":[0.9642492,0.00000667996,0.034720127,0.0005660705,0.00006198264,0.00016565999,0.000016764558,0.000029272724,0.00018423106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850345,0.000102696344,0.0005825038,0.00023244892,0.0002893098,0.000289621],"domain_scores_gemma":[0.9980026,0.00044997013,0.0002706062,0.0007897717,0.00028039832,0.0002066922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035536522,0.00020117052,0.00038124112,0.00004850841,0.00028789177,0.00003202283,0.0007080824,0.00008447919,0.00010384455],"category_scores_gemma":[0.002457749,0.00014038206,0.00028680582,0.00095222425,0.00020541274,0.000065103006,0.0002065579,0.00017664307,0.000057258454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000752635,0.00007032695,0.000033448185,0.00008626112,0.00004722507,5.4020455e-7,0.0011201586,0.000028939166,0.018783119,0.9767759,0.0029611415,0.000085432664],"study_design_scores_gemma":[0.00039910787,0.000039665174,0.00007010193,0.00008863032,0.00016792578,0.000006837472,0.00029825483,0.00115292,0.020469539,0.97413594,0.0029588037,0.0002122824],"about_ca_topic_score_codex":0.000003229467,"about_ca_topic_score_gemma":0.0000059165855,"teacher_disagreement_score":0.55054766,"about_ca_system_score_codex":0.000034087494,"about_ca_system_score_gemma":0.0000684053,"threshold_uncertainty_score":0.5724614},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12754168,0.0002419259,0.85672045,0.0023070287,0.00010245997,0.0007260837,0.00090378313,0.00041364925,0.011042928],"genre_scores_gemma":[0.88161004,0.00003814688,0.11175939,0.0003750273,0.000090890295,0.00059699593,0.00028242817,0.00008970069,0.005157417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805063,0.000121979676,0.0005669663,0.00041354971,0.0003355683,0.0005112767],"domain_scores_gemma":[0.9971275,0.0007294679,0.00019068383,0.0010453195,0.00059670483,0.00031032498],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032683986,0.00031485513,0.0005129865,0.00015283366,0.00047219923,0.00009030302,0.00029922655,0.00012508582,0.0002462784],"category_scores_gemma":[0.00081023877,0.0002589532,0.00020880518,0.0013220287,0.00015873279,0.00010659878,0.00013733869,0.00017839705,0.00007743669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022940587,0.00035840526,0.000022680428,0.00004618964,0.00014386352,0.00002047946,0.0004260313,0.0000038849303,0.001505494,0.9946265,0.0026265786,0.00019692376],"study_design_scores_gemma":[0.0013703058,0.00009778818,0.000043010714,0.00019874211,0.00034132457,0.00011578274,0.0007731017,0.0004598176,0.013723976,0.9515043,0.030908965,0.00046286726],"about_ca_topic_score_codex":0.0000045389675,"about_ca_topic_score_gemma":0.00006456403,"teacher_disagreement_score":0.7540683,"about_ca_system_score_codex":0.000071018636,"about_ca_system_score_gemma":0.00014648304,"threshold_uncertainty_score":0.9999863},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90227824,0.004447475,0.089569084,0.0019636615,0.00015597716,0.00015476118,0.000113419504,0.000034277644,0.0012831044],"genre_scores_gemma":[0.99447894,0.002169185,0.0028958712,0.000027839731,0.00029464578,0.000017961469,0.000010456073,0.0000054895363,0.0000995971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897254,0.000030390976,0.0005207402,0.00012947655,0.00027883588,0.00006799825],"domain_scores_gemma":[0.99896157,0.0003570845,0.0002706258,0.00012980649,0.00022983676,0.000051097886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034585476,0.000082467144,0.00022941678,0.00070587633,0.0000565707,0.00007165765,0.00031216795,0.000044622564,0.000116151255],"category_scores_gemma":[0.000021878435,0.00006211651,0.0003303987,0.000650076,0.00015741786,0.00015082667,0.00003980794,0.00012690524,0.000004087219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007593607,0.00013191605,0.0012104398,0.000013707549,0.0013049409,0.0000033672611,0.00017845762,0.000014164067,0.0018696495,0.9877053,0.0003080167,0.0072524804],"study_design_scores_gemma":[0.000102559294,0.000026737194,0.0030852505,0.000032114855,0.00064729236,0.00002756407,0.0005759591,0.00008805767,0.001758344,0.9770628,0.016516017,0.00007725997],"about_ca_topic_score_codex":0.0000048813185,"about_ca_topic_score_gemma":0.0000043789314,"teacher_disagreement_score":0.09220071,"about_ca_system_score_codex":0.000012653742,"about_ca_system_score_gemma":0.000018995417,"threshold_uncertainty_score":0.2533038},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99007094,0.00020287337,0.0054359604,0.00018977851,0.0000650287,0.00011223869,0.000027869897,0.000011137856,0.0038841749],"genre_scores_gemma":[0.9971475,0.00009623522,0.002655441,0.0000085552365,0.000020538722,0.0000010969944,0.000001185601,0.000019060933,0.00005039818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998569,0.0002581846,0.0007793497,0.000061699575,0.00024370935,0.00008801736],"domain_scores_gemma":[0.9978722,0.0013493325,0.00040488126,0.00024729298,0.000100684985,0.000025650032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002634678,0.000097259806,0.00023656807,0.00013115536,0.000030278283,0.000015254223,0.00028901146,0.000016456706,0.000027066591],"category_scores_gemma":[0.00064950256,0.000058008547,0.00017197491,0.00032636264,0.00012488368,0.000047779704,0.000029351557,0.0002072428,0.0000106651805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062959343,0.00022582826,0.000023421006,0.00030103727,0.000048885104,0.000010330646,0.0029802152,0.00003065625,0.0010260347,0.9936849,0.0011583549,0.0005040806],"study_design_scores_gemma":[0.00013199981,0.00013727795,0.00033247747,0.0010794074,0.00006767221,0.000031407726,0.002063074,0.00024964812,0.005161515,0.99039245,0.00029136793,0.000061693754],"about_ca_topic_score_codex":5.070652e-7,"about_ca_topic_score_gemma":5.987755e-7,"teacher_disagreement_score":0.0070765507,"about_ca_system_score_codex":0.000012100003,"about_ca_system_score_gemma":0.0000219066,"threshold_uncertainty_score":0.23655199},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33951545,0.0002866344,0.65826577,0.0002281389,0.00008788616,0.00017183796,0.001348649,0.000005884218,0.00008976449],"genre_scores_gemma":[0.7431786,0.00006722691,0.25660303,0.000018258552,0.000033714437,0.0000131855695,0.000017632437,0.0000083870855,0.000059964055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998955,0.000029164068,0.00055380294,0.0001487573,0.00022031512,0.00009294304],"domain_scores_gemma":[0.998284,0.0005623048,0.0002434082,0.00007960899,0.0007701752,0.000060534392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070276746,0.00010501723,0.00020635736,0.00011752316,0.0000553775,0.000064887194,0.00011443787,0.000047494617,0.000028672208],"category_scores_gemma":[0.00018472923,0.000089571375,0.000060906506,0.00006271528,0.000090652866,0.00013349931,0.000039603154,0.000121698155,1.3351199e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012002141,0.00019401296,0.00022730927,0.00053742115,0.00016816694,0.0000019109555,0.0003628725,0.0004228687,0.00090680685,0.988214,0.0005127048,0.008331867],"study_design_scores_gemma":[0.0002624495,0.00007028801,0.00021859816,0.00010777529,0.00006910992,0.000026352196,0.00004233566,0.2923395,0.00024342416,0.7064931,0.000066512606,0.000060586073],"about_ca_topic_score_codex":0.000002580288,"about_ca_topic_score_gemma":0.0000103870225,"teacher_disagreement_score":0.40366316,"about_ca_system_score_codex":0.000040406456,"about_ca_system_score_gemma":0.00008562722,"threshold_uncertainty_score":0.36526147},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53336143,0.0018229671,0.31156182,0.025575202,0.00053435174,0.0013448726,0.000017387638,0.0010438786,0.12473809],"genre_scores_gemma":[0.99536127,0.00006863282,0.00069309864,0.00061893626,0.00007117173,0.000049341725,0.0000021531464,0.000010655833,0.0031247623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995346,0.00004232373,0.00011287182,0.00013706567,0.00006907462,0.00010403766],"domain_scores_gemma":[0.99741954,0.0022549396,0.000016284685,0.00026311842,0.000013494124,0.00003265592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025672466,0.000077641445,0.000064890315,0.00005595788,0.00015766517,0.0000792755,0.000084336425,0.000040232197,0.0002206748],"category_scores_gemma":[0.00008713317,0.000046101115,0.000052322852,0.00024836944,0.00004949445,0.00003831361,0.000023632972,0.00012689321,0.000040718416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030000276,0.000023813882,0.000009268862,0.000009998333,0.000021485377,0.000001029941,0.0003558833,0.000022198406,0.000026277066,0.9812946,0.014955182,0.0032773158],"study_design_scores_gemma":[0.000044006258,0.00004167738,0.000027063774,0.000038730745,0.00004887162,0.000004411851,0.000348638,0.008244139,0.0002351161,0.9796872,0.011206348,0.00007380728],"about_ca_topic_score_codex":0.0000065292065,"about_ca_topic_score_gemma":0.000079085556,"teacher_disagreement_score":0.46199983,"about_ca_system_score_codex":0.0000032072471,"about_ca_system_score_gemma":0.0000071886993,"threshold_uncertainty_score":0.24162343},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96911937,0.00024388047,0.027953073,0.0009833401,0.00006437238,0.00069623877,0.000055904246,0.00023721703,0.00064663193],"genre_scores_gemma":[0.9857319,0.000036407542,0.013001017,0.00033635076,0.00012337578,0.00010368225,0.00001590737,0.000057091635,0.0005942726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876446,0.00013119052,0.00024879084,0.00039542158,0.00016127934,0.0002988636],"domain_scores_gemma":[0.9985617,0.0008126898,0.00004066921,0.00038208533,0.000056792876,0.00014607403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054178474,0.0002376393,0.00021177268,0.00012290836,0.000373946,0.00014371576,0.00019622139,0.00007996475,0.000037821123],"category_scores_gemma":[0.000067852605,0.00013503864,0.000100677746,0.00045939712,0.00013323507,0.000085189415,0.00010520196,0.0003561113,0.000057119953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075575015,0.000108049746,0.00026865923,0.00010968171,0.00018787831,0.000033383258,0.009551313,0.0001210919,0.0056645237,0.97681886,0.00018684183,0.006874116],"study_design_scores_gemma":[0.0014793283,0.00080807135,0.002324853,0.0015691444,0.0008299554,0.00038829175,0.004937378,0.0672114,0.033845637,0.8720049,0.012922684,0.0016783075],"about_ca_topic_score_codex":0.0001386915,"about_ca_topic_score_gemma":0.0001753443,"teacher_disagreement_score":0.10481393,"about_ca_system_score_codex":0.000014103477,"about_ca_system_score_gemma":0.000042331405,"threshold_uncertainty_score":0.55067164},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98523766,0.0010015283,0.0021293666,0.010316132,0.000051793504,0.00020063789,0.0002256134,0.0000054005086,0.00083188666],"genre_scores_gemma":[0.99936485,0.00026612473,0.00017833586,0.00006054312,0.00005002466,0.000013986031,0.0000023210962,0.0000035419855,0.00006027962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907243,0.000042758453,0.00046679814,0.000087170345,0.00028488148,0.000045932757],"domain_scores_gemma":[0.99847347,0.00074540765,0.00034655014,0.0001637774,0.00024517797,0.000025598678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004946156,0.00006148539,0.00014172652,0.00019076932,0.00007092427,0.000034305132,0.0003143989,0.000018164785,0.000025447078],"category_scores_gemma":[0.00006147107,0.000032144464,0.00019154145,0.00039097984,0.00009466001,0.000060618382,0.000050849878,0.00009501995,6.989911e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017644934,0.0000950588,0.00031256716,0.000009739233,0.0010933313,2.2622125e-7,0.00030374018,0.000025832502,0.0018584977,0.99506754,0.00032480573,0.00089101825],"study_design_scores_gemma":[0.00038000525,0.0000845254,0.026467113,0.0001936045,0.0017348542,0.000016228734,0.0009645777,0.0012207156,0.0128837,0.946151,0.009791873,0.00011177707],"about_ca_topic_score_codex":0.0000050036306,"about_ca_topic_score_gemma":0.000011414673,"teacher_disagreement_score":0.048916515,"about_ca_system_score_codex":0.0000076262004,"about_ca_system_score_gemma":0.000017228416,"threshold_uncertainty_score":0.13108133},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49296078,0.00052816066,0.4402645,0.0018209469,0.00061642163,0.00036572694,0.000012159841,0.00027687126,0.06315444],"genre_scores_gemma":[0.9554256,0.000012568229,0.043146726,0.00007420487,0.00075346674,0.0000076275533,5.657105e-7,0.000045488636,0.0005337318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986211,0.000053578904,0.0006331363,0.000117856485,0.00037426603,0.00020005043],"domain_scores_gemma":[0.99770933,0.0015843047,0.00020002504,0.0002629759,0.000118841155,0.0001245416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008426037,0.00015538298,0.0003578351,0.00007425039,0.00008575147,0.00014145474,0.00026580217,0.000052820895,0.00015326416],"category_scores_gemma":[0.00038854076,0.00011470221,0.0003369834,0.00029729705,0.000092933245,0.00025443357,0.00004809592,0.00043738988,0.00017339036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007119068,0.00021296872,0.0000019298952,0.00027965909,0.000105766194,0.000024735375,0.00056655466,0.0000108026725,0.0024416875,0.991453,0.0028225912,0.0020731757],"study_design_scores_gemma":[0.0001884393,0.000047422465,0.0000030925803,0.0005682115,0.0001601865,0.00016473867,0.00015999468,0.001206721,0.0033993747,0.9928402,0.001139082,0.000122578],"about_ca_topic_score_codex":1.8062576e-7,"about_ca_topic_score_gemma":1.3679521e-7,"teacher_disagreement_score":0.46246484,"about_ca_system_score_codex":0.00003927974,"about_ca_system_score_gemma":0.00006491982,"threshold_uncertainty_score":0.46774206},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94805384,0.01208951,0.03207948,0.0028149302,0.0006212021,0.00021279433,0.0000042017473,0.00005915904,0.004064858],"genre_scores_gemma":[0.9988007,0.00044216609,0.000040611678,0.000018753284,0.000058922604,0.0000031564712,2.0887111e-7,0.000018260154,0.00061720674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989387,0.00008809372,0.00040536743,0.0000636346,0.00024237885,0.00026184373],"domain_scores_gemma":[0.99881285,0.0005618729,0.00021025699,0.00024485507,0.00013238662,0.00003774913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001370402,0.000091944385,0.00019874178,0.00010403994,0.00007184577,0.000022971886,0.00038624325,0.000044163095,0.000025185014],"category_scores_gemma":[0.00009489838,0.000057793717,0.00017814999,0.00050517207,0.00007739703,0.00007918427,0.000024859557,0.000526522,0.000009230553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012346283,0.000092955066,0.000018286473,0.00004234644,0.000118316864,0.0000028580553,0.00042518438,0.0000057063853,0.0011238826,0.99625456,0.0015057063,0.0003978654],"study_design_scores_gemma":[0.00015517097,0.00019234451,0.00002449964,0.00006393132,0.00013123747,0.000117694704,0.00009021154,0.000086809276,0.005233005,0.97696984,0.016877642,0.00005763279],"about_ca_topic_score_codex":0.000001027019,"about_ca_topic_score_gemma":0.0000015796433,"teacher_disagreement_score":0.05074685,"about_ca_system_score_codex":0.000078074256,"about_ca_system_score_gemma":0.00024048,"threshold_uncertainty_score":0.23567593},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95730764,0.00079890713,0.00052910694,0.0006164974,0.00017773431,0.00066734897,0.00009430241,0.0006754333,0.039133016],"genre_scores_gemma":[0.9959415,0.000029651968,0.002956727,0.000040767674,0.000012241909,0.000089941175,0.0000076049755,0.000051911167,0.000869661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845636,0.000078742094,0.00059944135,0.00031664842,0.0002856203,0.00026321068],"domain_scores_gemma":[0.9972632,0.0018166634,0.00010470237,0.00068603334,0.000043813743,0.0000856085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054704526,0.00022745566,0.00036937496,0.00024097085,0.000090998394,0.00003678087,0.0002895006,0.00011779882,0.00070178916],"category_scores_gemma":[0.00036324607,0.00018073835,0.00028125563,0.0004676945,0.00020812039,0.00011055486,0.000049935345,0.00023255983,0.0005000573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009107297,0.00035405712,0.0000030037952,0.00076344446,0.00014325984,0.0000068915383,0.00088217383,0.000001008777,0.00096635945,0.9904632,0.005433964,0.0009735087],"study_design_scores_gemma":[0.00014265293,0.00007582767,0.000032137134,0.0004484392,0.00013245251,0.000017352535,0.0002225545,0.0007879641,0.0028676267,0.99464846,0.00045686655,0.00016765702],"about_ca_topic_score_codex":0.0000014141119,"about_ca_topic_score_gemma":4.7011724e-7,"teacher_disagreement_score":0.038633842,"about_ca_system_score_codex":0.000021045795,"about_ca_system_score_gemma":0.000033073273,"threshold_uncertainty_score":0.7684099},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9903908,0.0004932653,0.0030864286,0.00036863328,0.003542708,0.00049022696,0.000006927905,0.000060800012,0.0015602182],"genre_scores_gemma":[0.99420375,0.00008559789,0.0052173804,0.000006300468,0.00042173258,0.0000046513346,7.119534e-7,0.000043988675,0.000015902355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976011,0.0001670034,0.0011516096,0.00020751568,0.0005880465,0.00028475013],"domain_scores_gemma":[0.9928729,0.004926029,0.0011631852,0.00033082097,0.00057310105,0.00013397675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023627202,0.0002804785,0.00064817123,0.00013556401,0.00041364421,0.00023469905,0.00052166457,0.00014007033,0.0000063066855],"category_scores_gemma":[0.00045703756,0.00017342303,0.00023145873,0.00055557216,0.0003403967,0.00017898048,0.00014473361,0.0006056497,0.0000024859764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001001504,0.00033335283,0.00015746031,0.0003483829,0.00031962205,0.000010075952,0.0028699134,0.0000024313294,0.00028843668,0.994331,0.00034248809,0.00089665735],"study_design_scores_gemma":[0.0012733514,0.00041822463,0.000057239533,0.0007843509,0.00021543153,0.00013031326,0.0012645157,0.00058319065,0.0016163575,0.9921357,0.0013202553,0.00020103622],"about_ca_topic_score_codex":0.0000048491,"about_ca_topic_score_gemma":0.0000010020159,"teacher_disagreement_score":0.0047590258,"about_ca_system_score_codex":0.000037887377,"about_ca_system_score_gemma":0.00014666085,"threshold_uncertainty_score":0.7071986},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38427687,0.00061970577,0.4105007,0.0002017387,0.0002784027,0.0020062497,0.0007942021,0.0011083533,0.20021379],"genre_scores_gemma":[0.95165133,0.00003439274,0.04753874,0.0000175828,0.000031048192,0.00013239171,0.00004862182,0.00007263522,0.000473267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984595,0.000031782893,0.000592198,0.0003240272,0.00030195055,0.00029052293],"domain_scores_gemma":[0.9978927,0.0011047629,0.00015887748,0.0007085754,0.000047860754,0.000087224646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008477108,0.0002553162,0.00042592883,0.00013827944,0.00008913411,0.000065340624,0.00035793145,0.00009859747,0.00017261265],"category_scores_gemma":[0.00011323426,0.00021426805,0.00017336398,0.00073355157,0.00020047085,0.00006843773,0.00005967059,0.00020641758,0.000085991334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011953701,0.0001337066,0.000024193989,0.00093616056,0.00008946077,0.0000024897406,0.0012117282,0.0000013895125,0.0032421036,0.99230814,0.0017167103,0.0003219459],"study_design_scores_gemma":[0.00012882322,0.000017627697,0.00011421775,0.00016712095,0.000090244896,0.0000056301974,0.00046354491,0.00043703898,0.005819572,0.9914865,0.0010264163,0.00024326937],"about_ca_topic_score_codex":0.000005721231,"about_ca_topic_score_gemma":0.000035713343,"teacher_disagreement_score":0.56737447,"about_ca_system_score_codex":0.000020444679,"about_ca_system_score_gemma":0.000036056343,"threshold_uncertainty_score":0.87375975},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82856995,0.03198303,0.07091126,0.010723957,0.00024900454,0.004481004,0.0006253345,0.0026214572,0.049835004],"genre_scores_gemma":[0.9899681,0.0009884193,0.0042697242,0.00024206162,0.00015711471,0.0007837949,0.00004218414,0.000044710672,0.003503854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920493,0.00002111381,0.00019630427,0.00032077284,0.000087628476,0.00016924445],"domain_scores_gemma":[0.9992481,0.00033588285,0.000029234874,0.00022840418,0.000037367103,0.0001210126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017694363,0.0001364368,0.00013426285,0.00010244295,0.00027527031,0.000083762425,0.00010054647,0.000077383476,0.0001009265],"category_scores_gemma":[0.000025911793,0.00012190114,0.00004661918,0.00039293146,0.00008689922,0.00012059707,0.000051548377,0.00014049932,0.00010636841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016269208,0.00003757838,0.000024452838,0.0001396842,0.000027405105,6.819376e-7,0.00017582127,3.1557252e-7,0.0006789221,0.9944254,0.0015667843,0.002921312],"study_design_scores_gemma":[0.00007819927,0.000012871653,0.00006853666,0.000025235642,0.00007195512,0.000021913658,0.000080511454,0.001290156,0.0006096098,0.82719004,0.1704149,0.00013607764],"about_ca_topic_score_codex":0.000002313518,"about_ca_topic_score_gemma":0.0000070558804,"teacher_disagreement_score":0.16884811,"about_ca_system_score_codex":0.000005218275,"about_ca_system_score_gemma":0.000019059977,"threshold_uncertainty_score":0.49709842},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9565961,0.0009612293,0.023430627,0.004677492,0.0005137208,0.0023609423,0.005517696,0.0011022221,0.0048400033],"genre_scores_gemma":[0.9901225,0.000050405408,0.008070808,0.00006682334,0.000104921404,0.0002864449,0.00014011099,0.00005609624,0.0011019044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786377,0.00007938799,0.0008386871,0.00042263474,0.00027908167,0.0005164165],"domain_scores_gemma":[0.9973086,0.0014850809,0.00009654773,0.00077232905,0.000122061785,0.00021534642],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009687549,0.00029820378,0.00041610515,0.00044695803,0.0002140995,0.00018478827,0.0003747228,0.00014626479,0.000057786754],"category_scores_gemma":[0.0018104733,0.0002489556,0.00022465219,0.0011853136,0.00010936099,0.00023832373,0.00011117962,0.0003332647,0.0002518524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011136468,0.00015024605,0.000021509653,0.00015197891,0.000048093232,0.0000093819845,0.002157601,0.000009984224,0.0006094264,0.99222255,0.0045386846,0.00006940581],"study_design_scores_gemma":[0.00033900543,0.000039741397,0.00025580067,0.0004454814,0.000081015685,0.000005992881,0.0005925447,0.0010507934,0.0018704248,0.9872509,0.0077567087,0.00031156497],"about_ca_topic_score_codex":0.000011344178,"about_ca_topic_score_gemma":0.000041909836,"teacher_disagreement_score":0.033526417,"about_ca_system_score_codex":0.00015064637,"about_ca_system_score_gemma":0.00008330511,"threshold_uncertainty_score":0.99999624},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82109106,0.01417554,0.12155385,0.0060433997,0.00009839312,0.003421425,0.00041326508,0.0022591115,0.03094393],"genre_scores_gemma":[0.99233323,0.0002903346,0.0046242415,0.00007024435,0.00016388031,0.0008433121,0.000043509328,0.00003942106,0.0015918141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921054,0.000019818372,0.00018132459,0.00031419404,0.000110482884,0.0001636666],"domain_scores_gemma":[0.9991993,0.0003178464,0.000034718167,0.0003025875,0.000046513036,0.00009907535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012897982,0.00014556356,0.00013216739,0.00007954027,0.00027099525,0.0000787084,0.00013461619,0.000053763306,0.00008977998],"category_scores_gemma":[0.000018608172,0.00010800573,0.000052451553,0.0004899754,0.00009308201,0.00009848242,0.000033544282,0.00013353628,0.00014106976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032949642,0.00006014604,0.00007576154,0.00013693281,0.000048598362,9.230112e-7,0.00016858165,4.2991704e-7,0.0002997984,0.9954358,0.0005229462,0.0032468091],"study_design_scores_gemma":[0.000108331165,0.000037898826,0.00044466712,0.00005742031,0.00015763729,0.000027321335,0.00010584585,0.0007932098,0.001137965,0.8137639,0.18314618,0.00021959616],"about_ca_topic_score_codex":0.0000022418333,"about_ca_topic_score_gemma":0.0000080349555,"teacher_disagreement_score":0.18262322,"about_ca_system_score_codex":0.0000061161436,"about_ca_system_score_gemma":0.00002459681,"threshold_uncertainty_score":0.4404346},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.961723,0.0012902179,0.035097267,0.000763199,0.00008666928,0.00011691266,0.00004882166,0.000025750633,0.0008481041],"genre_scores_gemma":[0.9955884,0.00032310974,0.0039454135,0.000032099662,0.000049776947,0.0000043767827,0.000001464144,0.000009384046,0.000045954344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991719,0.00006355609,0.00033453206,0.00013197708,0.00017451854,0.00012348454],"domain_scores_gemma":[0.9989086,0.00046338295,0.00026330905,0.0001323591,0.0001591806,0.000073196796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028852053,0.00013645437,0.00030264165,0.000073106254,0.00008895691,0.00008031249,0.0001415377,0.000059657894,0.000024310391],"category_scores_gemma":[0.000057666548,0.00010258972,0.000084604006,0.00021560318,0.000548906,0.00033421785,0.000030743224,0.00022889907,5.514516e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057954483,0.000077095465,0.0006972308,0.0003087523,0.00006759029,0.000007868634,0.00083217135,0.000001421123,0.0033473063,0.9893468,0.00006307064,0.0051927404],"study_design_scores_gemma":[0.00019748823,0.00022635957,0.0014065042,0.00022532548,0.00014675809,0.000024390542,0.00075240515,0.00005490947,0.018412828,0.9780487,0.0003898762,0.000114454],"about_ca_topic_score_codex":0.0000037695413,"about_ca_topic_score_gemma":0.00001597531,"teacher_disagreement_score":0.033865362,"about_ca_system_score_codex":0.0000054965467,"about_ca_system_score_gemma":0.00007445746,"threshold_uncertainty_score":0.41834876},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98784935,0.00018823087,0.0061385008,0.000022282235,0.00009168104,0.0003465334,0.00023958132,0.00007435305,0.005049472],"genre_scores_gemma":[0.9978384,0.00013376014,0.00065327686,0.0000030203653,0.000017103053,0.0000024885635,0.000019658197,0.000029682451,0.0013026539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880576,0.00010111085,0.00030772167,0.0005379275,0.00007894985,0.00016851096],"domain_scores_gemma":[0.99844444,0.00030176295,0.00033500767,0.0007224095,0.0001140213,0.00008237158],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024494898,0.00025605582,0.0004762767,0.00015034813,0.000065355795,0.000014037029,0.00036276015,0.00021442938,0.00008335864],"category_scores_gemma":[0.000050987797,0.0002673862,0.00027662425,0.00040838536,0.0004464335,0.000040014416,0.00055072573,0.00027333084,0.000010360412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000569598,0.0001454613,0.0021419278,0.0012729253,0.00020516734,0.00001701728,0.00028057792,0.00006291321,0.00033229624,0.9951665,0.0002481728,0.00007011594],"study_design_scores_gemma":[0.00022013203,0.00002194964,0.00035008424,0.0003316275,0.0005242157,0.0000020730604,0.00021784496,0.0011681906,0.0013463267,0.9953996,0.0001805717,0.0002374021],"about_ca_topic_score_codex":0.000038362738,"about_ca_topic_score_gemma":0.000023495557,"teacher_disagreement_score":0.009988991,"about_ca_system_score_codex":0.000027466673,"about_ca_system_score_gemma":0.000049846574,"threshold_uncertainty_score":0.9999778},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16435778,0.004180327,0.82172394,0.0017513878,0.000100835154,0.0024003566,0.0044277925,0.000058381233,0.0009992183],"genre_scores_gemma":[0.7368617,0.0009489493,0.26065707,0.00007920633,0.00006220433,0.001072386,0.0001295588,0.000018623816,0.00017029518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99686426,0.0009422161,0.0011068048,0.0006726133,0.00018200948,0.00023210785],"domain_scores_gemma":[0.98540175,0.012147717,0.0006660919,0.0012476012,0.0004239035,0.00011294453],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0038782523,0.00036884812,0.00092614983,0.00032237373,0.0005519191,0.00005771398,0.0004420002,0.0003975342,0.00003084138],"category_scores_gemma":[0.0015854693,0.00026650963,0.00024809354,0.0007269638,0.002309801,0.00006276109,0.0007600981,0.0006820109,4.601996e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031259766,0.00030281447,0.0020207595,0.0006367592,0.00021520782,1.9970733e-8,0.00058693864,0.00000466793,0.0002491582,0.9475311,0.00004599996,0.048375305],"study_design_scores_gemma":[0.00043192008,0.000021041626,0.004494751,0.00019682029,0.00046883454,0.0000027363071,0.0016797036,0.0026157708,0.0021110137,0.9870229,0.00073395396,0.0002205524],"about_ca_topic_score_codex":0.00033258527,"about_ca_topic_score_gemma":0.00008383047,"teacher_disagreement_score":0.5725039,"about_ca_system_score_codex":0.000025047915,"about_ca_system_score_gemma":0.00016739484,"threshold_uncertainty_score":0.9999787},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7059762,0.0003454854,0.06819042,0.20316061,0.00044726883,0.0011733436,0.00025222122,0.00066356466,0.019790906],"genre_scores_gemma":[0.8828733,0.000013536262,0.03714114,0.02667848,0.0007709419,0.00039485464,0.0000336802,0.00012696785,0.05196712],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991734,0.000028183833,0.00016845124,0.0002538093,0.00016181674,0.00021434946],"domain_scores_gemma":[0.9992962,0.00012452419,0.000021464286,0.00043781864,0.00002533889,0.000094662064],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00015108602,0.0001277334,0.00013059976,0.00006947316,0.00007770781,0.000077939076,0.0001915199,0.000059964987,0.0017462402],"category_scores_gemma":[0.000040097777,0.00011032891,0.00011460165,0.00011760128,0.000032064425,0.000057961843,0.000058779726,0.00012624491,0.00097027136],"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.0000057603797,0.000049296366,0.00006282989,0.000059420574,0.00005956341,0.000011990174,0.0045136153,7.291303e-7,0.0045758435,0.45886505,0.5306455,0.0011503857],"study_design_scores_gemma":[0.00008655529,0.000017226745,0.00002236595,0.000058737594,0.000048084923,0.000005532898,0.00014813851,0.00022668886,0.011236711,0.5621925,0.4258347,0.00012277496],"about_ca_topic_score_codex":0.0000036754352,"about_ca_topic_score_gemma":0.000007588854,"teacher_disagreement_score":0.1768971,"about_ca_system_score_codex":0.000025800528,"about_ca_system_score_gemma":0.000014156562,"threshold_uncertainty_score":0.9998076},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98749506,0.0009605213,0.007657848,0.00075521803,0.0016307898,0.00021726613,0.000009096811,0.000059624923,0.001214594],"genre_scores_gemma":[0.9991144,0.00007160266,0.00041143814,0.000009202225,0.00006205071,0.0000025169393,0.0000011397725,0.000021035768,0.0003066171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988512,0.000058250258,0.00052173674,0.00010822613,0.00035180117,0.000108788336],"domain_scores_gemma":[0.9985747,0.0005854095,0.00031856628,0.00022245894,0.00023812134,0.00006076676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059247186,0.0001118958,0.00023611706,0.00032333616,0.000048225258,0.00003112342,0.00020812835,0.000051672734,0.000050528317],"category_scores_gemma":[0.00040261532,0.00008821064,0.00018557336,0.0007676801,0.000038709084,0.00013452394,0.000019200128,0.00026893007,0.000008150014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015234117,0.0002600358,0.00007236646,0.00017262354,0.000072332274,0.0000072140897,0.00030361523,0.0000048720935,0.0016715873,0.99343073,0.0034694227,0.0005199759],"study_design_scores_gemma":[0.00019170497,0.00023473415,0.00016098276,0.00015494168,0.00008025459,0.000034996316,0.000044570046,0.000021728878,0.006776094,0.99019086,0.002028925,0.0000801802],"about_ca_topic_score_codex":5.821484e-7,"about_ca_topic_score_gemma":1.543454e-7,"teacher_disagreement_score":0.0116193555,"about_ca_system_score_codex":0.000040222803,"about_ca_system_score_gemma":0.000077130826,"threshold_uncertainty_score":0.35971257},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99477875,0.0020654113,0.00096280675,0.00034229626,0.000073994896,0.00024417776,0.000031491712,0.00013435885,0.0013667227],"genre_scores_gemma":[0.9900431,0.00021536283,0.009163466,0.00006654138,0.000100432815,0.000028638146,0.000008092443,0.000021869811,0.0003525091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992187,0.00004235722,0.00023656157,0.00026353155,0.000072542665,0.00016630672],"domain_scores_gemma":[0.99929154,0.00045801708,0.000024166839,0.00014119767,0.000019255123,0.0000658313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029208287,0.00013307402,0.0001753002,0.000092299524,0.00009109106,0.00007362697,0.000055525543,0.00006832564,0.000039103717],"category_scores_gemma":[0.00010817036,0.000111782065,0.000034263026,0.00015756463,0.00011912909,0.00009103538,0.000050574574,0.00017857803,0.0000116487345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019399768,0.00009832636,0.001729941,0.0002787761,0.00004227857,0.000024147133,0.0025874826,0.000002687001,0.0054429113,0.9365167,0.00019674911,0.05306062],"study_design_scores_gemma":[0.0018845755,0.00014184165,0.0027968476,0.0008452616,0.00012259567,0.00010468117,0.0027885188,0.09699448,0.019536866,0.8548671,0.019062726,0.0008545249],"about_ca_topic_score_codex":0.000018733117,"about_ca_topic_score_gemma":0.00008256631,"teacher_disagreement_score":0.09699179,"about_ca_system_score_codex":0.0000055649502,"about_ca_system_score_gemma":0.00001815956,"threshold_uncertainty_score":0.45583403},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51119703,0.0003441096,0.48687184,0.0010545962,0.00007115863,0.00016415339,0.00008996656,0.000016175776,0.00019094818],"genre_scores_gemma":[0.9830972,0.00027892718,0.01623481,0.000043704043,0.00018648777,0.00006382617,0.000024325383,0.000006166413,0.00006456645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999092,0.00003245516,0.00049409055,0.00012288366,0.00019398583,0.00006463127],"domain_scores_gemma":[0.9988926,0.00039661842,0.00029911267,0.00010109234,0.0002607997,0.000049771985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004765355,0.00007584195,0.00021887914,0.0005145738,0.00005235577,0.000053483993,0.00024382508,0.00004681501,0.00005828674],"category_scores_gemma":[0.00003944891,0.000057103407,0.00036217854,0.00043778383,0.000091278285,0.00010183252,0.00002638333,0.00007748418,0.0000011538837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024850142,0.00012964035,0.000922767,0.00002608066,0.0014769214,9.974337e-7,0.0001322541,0.000035530968,0.0033346347,0.98964113,0.00032564774,0.0039495467],"study_design_scores_gemma":[0.00025332102,0.00005150255,0.0010496669,0.000026207015,0.0013468274,0.000016863247,0.00020600956,0.0011875017,0.0013647283,0.9858385,0.008583202,0.000075720796],"about_ca_topic_score_codex":0.000010798074,"about_ca_topic_score_gemma":0.000024009914,"teacher_disagreement_score":0.47190014,"about_ca_system_score_codex":0.000013209841,"about_ca_system_score_gemma":0.000015959029,"threshold_uncertainty_score":0.23286094},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4659521,0.0009652299,0.06689498,0.239459,0.0010901375,0.024703931,0.019193428,0.001266768,0.18047445],"genre_scores_gemma":[0.95174074,0.000025848467,0.034359183,0.0044985707,0.00023682074,0.005357527,0.00022000383,0.00013919416,0.003422084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977683,0.00021448705,0.0005752399,0.00062051316,0.00020456841,0.00061693427],"domain_scores_gemma":[0.98454654,0.013746222,0.00012103233,0.000902377,0.00021807307,0.00046576394],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008442391,0.0004327915,0.0006350527,0.0002902436,0.0006083642,0.00021338266,0.00058172154,0.000396382,0.0017789202],"category_scores_gemma":[0.0071360497,0.0003287029,0.00030409094,0.00020112173,0.00059053616,0.000010658402,0.00015791971,0.0007205474,0.00023938784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008948172,0.00006955389,0.0000034662087,0.00088942645,0.00007695133,0.000002925182,0.0002222344,0.0000014211051,0.000018214238,0.9533213,0.045256287,0.00012927373],"study_design_scores_gemma":[0.00018581944,0.000031452808,0.000018981713,0.00082517904,0.0001903451,0.0000063096572,0.0004410661,0.00072538544,0.00014635127,0.97907114,0.018098073,0.00025991508],"about_ca_topic_score_codex":0.00017493634,"about_ca_topic_score_gemma":0.0006816984,"teacher_disagreement_score":0.48578867,"about_ca_system_score_codex":0.000059698014,"about_ca_system_score_gemma":0.00021047528,"threshold_uncertainty_score":0.9999165},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98074836,0.000609866,0.012093986,0.002138328,0.00017936606,0.00015176371,0.000011533002,0.000019861815,0.004046923],"genre_scores_gemma":[0.99645126,0.000017038365,0.0030564785,0.00024841054,0.0001169059,0.0000069006396,0.000001351839,0.000015323592,0.00008636133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998543,0.00035046856,0.0005197371,0.000092969196,0.0003195844,0.00017422778],"domain_scores_gemma":[0.99529785,0.0041432474,0.00023396539,0.00019337809,0.00008988082,0.000041662814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002907771,0.00011214312,0.00021473595,0.00047903773,0.00010970742,0.00009235318,0.00044085595,0.000050924802,0.00005676326],"category_scores_gemma":[0.00070386584,0.00006981624,0.00016655326,0.0013843202,0.00008472541,0.0001704289,0.000044170723,0.00069431774,0.000027023156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012674464,0.0017394088,0.0037664846,0.000532179,0.0005854547,0.00069324026,0.06394031,0.000513015,0.0047548823,0.84083384,0.030363742,0.05215067],"study_design_scores_gemma":[0.00065267796,0.00020233852,0.006104275,0.0005713989,0.000109927634,0.000524471,0.012890919,0.00049424835,0.00093390327,0.96837384,0.008947315,0.00019470726],"about_ca_topic_score_codex":0.000001594819,"about_ca_topic_score_gemma":0.0000026617242,"teacher_disagreement_score":0.12753995,"about_ca_system_score_codex":0.000049578935,"about_ca_system_score_gemma":0.00005210707,"threshold_uncertainty_score":0.30165038},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02423284,0.00007222914,0.7665347,0.0054985387,0.0021510066,0.0029410378,0.00022942963,0.0010444329,0.1972958],"genre_scores_gemma":[0.59650093,0.00019807712,0.24547225,0.005198881,0.0032999252,0.0022450583,0.0004674196,0.00016038615,0.14645706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985918,0.00008637435,0.0003969222,0.0005066385,0.00015184676,0.0002664224],"domain_scores_gemma":[0.9978199,0.0006135654,0.00018208171,0.0011281185,0.00013245486,0.0001239086],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018231037,0.0002771823,0.00039785888,0.00016049547,0.0001310967,0.0000672428,0.0005979161,0.00055061135,0.00039964687],"category_scores_gemma":[0.00034598965,0.00026300026,0.00020719739,0.00039281027,0.000027531405,0.000021413323,0.00087356655,0.0007606884,0.00004594777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052977728,0.00014147148,0.000086381384,0.00015147327,0.00012356033,0.0000037477846,0.00011083712,0.036518153,0.000003451065,0.5630269,0.39921248,0.00056856556],"study_design_scores_gemma":[0.0006582417,0.00004041001,0.0005471251,0.0008255257,0.00042630054,0.0000022075844,0.0003900207,0.014308325,0.00014257198,0.94021976,0.041425627,0.0010138853],"about_ca_topic_score_codex":0.000041522828,"about_ca_topic_score_gemma":0.00013431735,"teacher_disagreement_score":0.57226807,"about_ca_system_score_codex":0.000039653325,"about_ca_system_score_gemma":0.00007770179,"threshold_uncertainty_score":0.99998224},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9312985,0.003980441,0.012320822,0.004455776,0.00008467205,0.0033005753,0.00014498849,0.00048581982,0.043928392],"genre_scores_gemma":[0.9931419,0.0007714633,0.0031839923,0.00030656272,0.000013161982,0.00068822794,0.000033086726,0.000018874727,0.0018427119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989954,0.00003696533,0.0003512372,0.0003431627,0.00008301622,0.00019022032],"domain_scores_gemma":[0.9988247,0.00055270264,0.000092859314,0.0003681834,0.000065647466,0.000095874195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025570748,0.00016779444,0.00023736394,0.0001339198,0.00040678107,0.000045512046,0.00014329824,0.00011408488,0.00004254951],"category_scores_gemma":[0.00006719613,0.00015129765,0.000064816086,0.00051977544,0.00020080764,0.00007644779,0.00006824545,0.00018280545,0.000019166064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015907824,0.000079721474,0.0001790603,0.000051589668,0.00007863102,3.3820024e-7,0.000106864965,0.0000010203403,0.0009497427,0.9959805,0.00077589706,0.0017807187],"study_design_scores_gemma":[0.001008041,0.0000146490665,0.00016772734,0.00003809259,0.00014994471,0.000008655607,0.00016543736,0.0007790433,0.0013896711,0.98665863,0.009457334,0.00016280002],"about_ca_topic_score_codex":0.0000026666678,"about_ca_topic_score_gemma":0.0000037963323,"teacher_disagreement_score":0.061843403,"about_ca_system_score_codex":0.000006784349,"about_ca_system_score_gemma":0.000023753188,"threshold_uncertainty_score":0.61697394},"labels":[],"label_agreement":null},{"id":"W4406164283","doi":"10.61091/ars161-14","title":"Sharp Lower Bound for Randić index of Trees with Fixed Roman Domination Number","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Upper and lower bounds; Combinatorics; Computer science; World Wide Web; Mathematical analysis","score_opus":0.016686441878597295,"score_gpt":0.2918168312654158,"score_spread":0.2751303893868185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406164283","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9941011,0.00004850993,0.0010179332,0.00014189932,0.0003820653,0.0005189144,0.000025975152,0.0000965215,0.0036670475],"genre_scores_gemma":[0.9975557,0.0000023886876,0.0007037506,0.000011206128,0.000010171871,0.00019355278,0.000016381224,0.000028740838,0.0014781267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993237,0.000026089936,0.00020291601,0.00017964243,0.00013694102,0.0001306706],"domain_scores_gemma":[0.9990548,0.0005072991,0.00006960018,0.0002488465,0.000083506064,0.00003597756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023245186,0.00011250715,0.00017716375,0.000056821427,0.00008415491,0.000045903864,0.00012826317,0.000068034286,0.000107443244],"category_scores_gemma":[0.000056723577,0.00009144465,0.00008610446,0.00024363284,0.000070446964,0.000117247095,0.000017985047,0.00007814217,0.000018370407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009925876,0.00018144047,0.000510337,0.00013313994,0.00007603585,0.0000014885312,0.00033789067,7.4914294e-7,0.00054211565,0.9915851,0.006278411,0.000254059],"study_design_scores_gemma":[0.0011398084,0.00008929079,0.0007200859,0.000101638005,0.0000826429,0.000004127127,0.00007151841,0.00024311045,0.002795207,0.9905578,0.004076881,0.00011791824],"about_ca_topic_score_codex":0.0000044430453,"about_ca_topic_score_gemma":0.000018475863,"teacher_disagreement_score":0.0034545474,"about_ca_system_score_codex":0.00002113683,"about_ca_system_score_gemma":0.000030327034,"threshold_uncertainty_score":0.37290046},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9864772,0.00063912704,0.006954644,0.00036417457,0.004586188,0.000490374,0.000013130765,0.000048170845,0.00042702255],"genre_scores_gemma":[0.9933955,0.00003186747,0.0058206874,0.000011704469,0.0006792101,0.000005303376,0.0000011071407,0.00004048291,0.000014144394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982075,0.00008082459,0.00094898837,0.00019954311,0.0003465984,0.00021652714],"domain_scores_gemma":[0.9935162,0.0053095724,0.0006143717,0.00019538657,0.0002444371,0.000120054974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013979065,0.0002527785,0.0007209281,0.00023274988,0.00018847929,0.00015925395,0.0002310027,0.00016359585,0.0000050475087],"category_scores_gemma":[0.0008580594,0.0002009831,0.00021836882,0.00023174738,0.0001296216,0.00010569398,0.000076501026,0.00034768053,4.1395862e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008961128,0.00032558327,0.000017468734,0.0008792088,0.00016346983,0.0000059760146,0.001079715,0.000005551879,0.0009976644,0.99457675,0.0009163862,0.000942633],"study_design_scores_gemma":[0.0019619016,0.0010476742,0.000016773907,0.0008893368,0.00021922115,0.000074294505,0.0003441394,0.0019666601,0.0020199658,0.9902828,0.0009874636,0.00018982388],"about_ca_topic_score_codex":0.0000012760161,"about_ca_topic_score_gemma":4.4104624e-7,"teacher_disagreement_score":0.006918324,"about_ca_system_score_codex":0.000029764124,"about_ca_system_score_gemma":0.00008352261,"threshold_uncertainty_score":0.81958526},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7212987,0.023021393,0.05998456,0.021392291,0.001070916,0.0075904634,0.00042633223,0.00031198649,0.16490333],"genre_scores_gemma":[0.9892167,0.007190229,0.00080005586,0.000115735864,0.000095814794,0.0001364817,0.000006451261,0.000025217792,0.002413313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755484,0.00028287165,0.00061052706,0.00027780203,0.0002741758,0.0009997884],"domain_scores_gemma":[0.9980204,0.0006114593,0.0006432199,0.0005258415,0.00014793614,0.00005115968],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0036737078,0.0002792663,0.0005098277,0.00020704388,0.00033949787,0.00007344243,0.00054461526,0.00018089364,0.000017128963],"category_scores_gemma":[0.00012040264,0.00018271455,0.00030130302,0.00020592153,0.00045077183,0.000028611557,0.00022925965,0.003652941,0.0000017984576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018940768,0.00012014863,0.000036311572,0.00012345762,0.0005747083,4.84289e-7,0.00038059946,0.000012831359,0.000025240739,0.99676096,0.00024673494,0.0015291297],"study_design_scores_gemma":[0.0011697337,0.000115808885,0.00000795705,0.00030744186,0.00031555022,0.000074346935,0.00082180044,0.000027483431,0.00008406549,0.9962549,0.00065907754,0.00016182377],"about_ca_topic_score_codex":0.00002731982,"about_ca_topic_score_gemma":0.00025677762,"teacher_disagreement_score":0.267918,"about_ca_system_score_codex":0.00018702201,"about_ca_system_score_gemma":0.0018958035,"threshold_uncertainty_score":0.99864566},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98402077,0.000038946815,0.00723083,0.00005481209,0.000091231224,0.00045783998,0.0001843699,0.00029315398,0.0076280213],"genre_scores_gemma":[0.9974218,0.000054810662,0.0013890238,0.00001344761,0.000025831157,0.00000855727,0.00006234509,0.000045579607,0.0009786088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985704,0.00013208833,0.00025412094,0.000708914,0.00008935482,0.00024512433],"domain_scores_gemma":[0.99800736,0.00018352209,0.00024779854,0.0012321695,0.00017037791,0.00015879721],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023661992,0.00030749434,0.00039697695,0.0004411225,0.00014003114,0.000034103046,0.00058493146,0.00024020679,0.000109881345],"category_scores_gemma":[0.000019583515,0.00030492948,0.00029603476,0.0009480571,0.00036424858,0.00009548733,0.00035438864,0.0005646172,0.000039066013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066044144,0.0006599558,0.0005931143,0.0003381633,0.00023474087,0.000045286528,0.00030143504,0.00094953796,0.00011970717,0.99642485,0.00023461139,0.000032544507],"study_design_scores_gemma":[0.00025641307,0.00016308393,0.00020884139,0.00022376061,0.0006210218,0.0000046575633,0.00049111596,0.0017840591,0.00065362477,0.99516755,0.00009139322,0.00033446128],"about_ca_topic_score_codex":0.00007204393,"about_ca_topic_score_gemma":0.00051179266,"teacher_disagreement_score":0.013401001,"about_ca_system_score_codex":0.00003515784,"about_ca_system_score_gemma":0.00011009346,"threshold_uncertainty_score":0.9999403},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45911664,0.0012722705,0.5250524,0.00027624206,0.00012355861,0.009174927,0.0010904432,0.00015324145,0.0037402888],"genre_scores_gemma":[0.87280846,0.000050203536,0.12553036,0.0000091222955,0.000046056455,0.001016271,0.000045079792,0.000034392157,0.00046003613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99514174,0.0025415937,0.0005280316,0.00067373004,0.00071644376,0.00039842678],"domain_scores_gemma":[0.9880891,0.009625629,0.00015813646,0.0011357736,0.00087389234,0.0001174716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015797007,0.00026485568,0.000724646,0.00028848898,0.00026868275,0.00006666806,0.00046295256,0.00022079406,0.00008473354],"category_scores_gemma":[0.0016763753,0.00023672551,0.000076738586,0.0004721425,0.00054328755,0.000034685356,0.0017012326,0.0014475653,0.000005093764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016609981,0.0019486449,0.00009748475,0.004090261,0.0004030225,0.000010864262,0.010564905,0.00008946336,0.00030143044,0.97883713,0.0009148094,0.0025759079],"study_design_scores_gemma":[0.0005867426,0.00043994893,0.0012382155,0.0007467425,0.0001346942,0.0000029650098,0.008853377,0.0005728336,0.00024171034,0.9867658,0.00021971253,0.0001972518],"about_ca_topic_score_codex":0.00018636521,"about_ca_topic_score_gemma":0.00003254288,"teacher_disagreement_score":0.41369185,"about_ca_system_score_codex":0.00005597351,"about_ca_system_score_gemma":0.00028900016,"threshold_uncertainty_score":0.96533865},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9621077,0.000020161395,0.0011676293,0.00093930855,0.00009358414,0.0010592551,0.000090223286,0.0000069969387,0.03451515],"genre_scores_gemma":[0.9948176,0.000009881691,0.0048452844,0.000058437425,0.000025167106,0.00006637283,0.0000010852707,0.000030879288,0.00014527969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976847,0.00017664029,0.001017372,0.00013311916,0.0007953705,0.00019277468],"domain_scores_gemma":[0.99546665,0.0013838045,0.0020865013,0.0008967994,0.00010616101,0.000060073944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002647764,0.00017996869,0.0005238309,0.000096351614,0.00039725253,0.000039017592,0.002639054,0.00005459611,0.0002831974],"category_scores_gemma":[0.00021891693,0.00010118171,0.00027814117,0.0005460731,0.0002336075,0.00007210726,0.0007664829,0.00063142076,0.0000021667154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010784244,0.0004670765,0.00003572403,0.00006403141,0.00011945581,0.0000014478144,0.0016942316,0.000088499175,0.0069518634,0.9885602,0.0018113956,0.00009824984],"study_design_scores_gemma":[0.00065959396,0.00015744986,0.0001526652,0.000107697684,0.00017325056,0.000060921247,0.0040485025,0.000034831104,0.012421931,0.98184097,0.00021909385,0.00012308397],"about_ca_topic_score_codex":0.000010208254,"about_ca_topic_score_gemma":0.000013297331,"teacher_disagreement_score":0.03436987,"about_ca_system_score_codex":0.00003319578,"about_ca_system_score_gemma":0.00014668069,"threshold_uncertainty_score":0.49040627},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000126658,0.000057517995,0.000003904467,0.00014586595,0.0000017579355,0.0006248017,0.00016620448,0.00031105865,0.9986876],"genre_scores_gemma":[0.0000014520148,5.590482e-7,0.00047661364,0.000041093655,0.00024995807,0.00008583396,0.00009903772,0.00015311311,0.99889237],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985095,0.000023130926,0.00043082333,0.00045673244,0.0002704303,0.00030937657],"domain_scores_gemma":[0.99831575,0.00026869882,0.00016465725,0.000986943,0.00006480369,0.0001991526],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00020314142,0.00044294805,0.0005020842,0.00019833265,0.0001577699,0.000045695862,0.00049035694,0.00036059486,0.99700737],"category_scores_gemma":[0.000034321594,0.00044831733,0.00027430584,0.000052784522,0.00009640213,0.000046158773,0.000099324505,0.00037751105,0.9951873],"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.000048624996,0.00006849328,1.261727e-9,0.000047089987,0.000116929616,0.000007793598,0.000026521358,0.0000017515703,0.000006609143,0.21790755,0.55702794,0.22474071],"study_design_scores_gemma":[0.00009812035,0.000046963956,6.279244e-8,0.00009004439,0.0001170945,0.00000980255,2.7923042e-7,0.0000026190855,0.000013308058,0.3136416,0.685642,0.0003381032],"about_ca_topic_score_codex":0.0000019613085,"about_ca_topic_score_gemma":3.751304e-7,"teacher_disagreement_score":0.2244026,"about_ca_system_score_codex":0.00004227829,"about_ca_system_score_gemma":0.000040272058,"threshold_uncertainty_score":0.99979687},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9857808,0.00029096438,0.00039969385,0.003890187,0.000067543624,0.00021269888,0.00000705064,0.00005792588,0.009293182],"genre_scores_gemma":[0.9971869,0.0000026999426,0.0013425893,0.0009586892,0.000019376876,0.000046952257,0.0000044806166,0.0000067889187,0.00043155122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921286,0.000112095906,0.00024298189,0.00014538941,0.00011933713,0.00016733102],"domain_scores_gemma":[0.9980942,0.0013647997,0.00014472955,0.0003318563,0.000033759898,0.00003067851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027492718,0.000107695414,0.00016465952,0.000083710176,0.00019393877,0.00001825268,0.00036816855,0.000065324035,0.000029438343],"category_scores_gemma":[0.0005668995,0.0000687117,0.00007610868,0.0006506974,0.00030375563,0.000047395224,0.00006558813,0.0002026612,0.0000038117644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006988445,0.00006346401,0.0042744796,0.000042668205,0.000037515674,3.4137616e-7,0.00026287572,0.0000023763118,0.005516106,0.98585117,0.00035246267,0.0035895712],"study_design_scores_gemma":[0.00039397035,0.000047228557,0.01044816,0.00006505127,0.00008219735,0.0000014837865,0.00147342,0.00046971935,0.020776493,0.9655243,0.0005726464,0.00014533605],"about_ca_topic_score_codex":0.000021137275,"about_ca_topic_score_gemma":0.000010123706,"teacher_disagreement_score":0.020326857,"about_ca_system_score_codex":0.000010877865,"about_ca_system_score_gemma":0.00005106905,"threshold_uncertainty_score":0.28019816},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.997982,0.00015714187,0.0011826066,0.00035718235,0.000013382185,0.0002311542,0.000002372464,0.000006162956,0.00006796637],"genre_scores_gemma":[0.999421,0.000059404625,0.0003601191,0.00012160276,0.0000046624905,0.000028599032,5.0824616e-7,0.000002404505,0.0000016996414],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992821,0.000022760396,0.00045865765,0.00006166999,0.000096718424,0.000078095916],"domain_scores_gemma":[0.99955976,0.00008974137,0.0001425776,0.00007372731,0.000088731314,0.000045488265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015888675,0.00009461258,0.00024597906,0.00014273234,0.000024916664,0.000017788423,0.00006929175,0.00004798431,9.997168e-7],"category_scores_gemma":[0.000074726675,0.00005919079,0.00004579504,0.00015660003,0.00003616275,0.00015437462,0.00002507117,0.00011491964,1.2267566e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013314802,0.0022048221,0.00092346774,0.00036355402,0.00032403105,0.0000013697216,0.05830838,0.0012399582,0.78864926,0.124263726,0.000046771893,0.022343168],"study_design_scores_gemma":[0.0024065957,0.0003372915,0.00004031401,0.0006926375,0.00007365928,0.0000035914106,0.008988683,0.0258779,0.7669804,0.194386,0.00004897234,0.0001639579],"about_ca_topic_score_codex":0.0000073780047,"about_ca_topic_score_gemma":7.8170865e-7,"teacher_disagreement_score":0.07012228,"about_ca_system_score_codex":0.00003308353,"about_ca_system_score_gemma":0.000027111293,"threshold_uncertainty_score":0.24137303},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9804697,0.00038400065,0.0121030575,0.00077406043,0.00012851624,0.00047343769,0.000058427646,0.000270373,0.0053383945],"genre_scores_gemma":[0.9862104,0.00009004473,0.009224906,0.00037170702,0.0000574572,0.00005459166,0.000058874542,0.000020617937,0.003911374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912566,0.000048006452,0.0002525338,0.0002705864,0.0000877004,0.00021550368],"domain_scores_gemma":[0.99931467,0.00021951273,0.000051879102,0.0002744235,0.000061621045,0.00007789354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002182828,0.00015877918,0.00019590222,0.000088365836,0.00020331432,0.000028320579,0.00012449543,0.000108510314,0.000057154568],"category_scores_gemma":[0.00012883866,0.00014414964,0.0000880224,0.00027938385,0.00011365123,0.00005997011,0.000043583663,0.00017224724,0.000024790314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041929175,0.00020880939,0.0005244244,0.000067337976,0.00005338811,0.0000010419491,0.00015465335,9.050286e-7,0.007557653,0.9769408,0.010156607,0.0042924588],"study_design_scores_gemma":[0.0015266599,0.000060373808,0.0007699083,0.000050457056,0.0001231726,0.000005514846,0.00020028514,0.007170982,0.03335055,0.90678924,0.049628664,0.00032416152],"about_ca_topic_score_codex":0.000013832263,"about_ca_topic_score_gemma":0.000009624142,"teacher_disagreement_score":0.070151515,"about_ca_system_score_codex":0.000010098628,"about_ca_system_score_gemma":0.000019392779,"threshold_uncertainty_score":0.5878252},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9911709,0.00030593292,0.0018590719,0.00019313337,0.00019372586,0.00021571055,0.0000069486255,0.000014803559,0.006039811],"genre_scores_gemma":[0.9697696,0.000016237316,0.02956881,0.000065420296,0.000052603587,0.000010342556,5.7782904e-7,0.00001570671,0.00050072424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984766,0.000049867635,0.0009996502,0.0000860618,0.0002400089,0.00014776616],"domain_scores_gemma":[0.9981629,0.0004437257,0.00092184084,0.00029080865,0.00011512826,0.00006556264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000611976,0.00014673568,0.00047652575,0.00019993699,0.0000633679,0.000020553729,0.00034232516,0.000066823246,0.000082721956],"category_scores_gemma":[0.00022007524,0.00011875059,0.00024680665,0.00021149254,0.00010351233,0.00012014822,0.00007736166,0.0001471151,0.0000055722385],"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.000044489767,0.0010418928,0.00007632141,0.00015337368,0.00015255196,0.0000033779097,0.0018332342,9.1609076e-7,0.29169467,0.70374596,0.0011415624,0.00011162623],"study_design_scores_gemma":[0.0006904987,0.00012964722,0.00012942031,0.00034455032,0.00010727994,0.0000453665,0.0023726076,0.000030856194,0.652059,0.3433148,0.0006555859,0.0001203941],"about_ca_topic_score_codex":5.9809724e-7,"about_ca_topic_score_gemma":1.6083072e-7,"teacher_disagreement_score":0.3604312,"about_ca_system_score_codex":0.000052241274,"about_ca_system_score_gemma":0.000057403573,"threshold_uncertainty_score":0.48425084},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.887568,0.00018835359,0.077921174,0.0020106395,0.0004992713,0.0008844607,0.00006971425,0.00083449844,0.030023867],"genre_scores_gemma":[0.96988225,0.000024886715,0.027638422,0.00031000783,0.000059563154,0.000121018835,0.000028038496,0.000022178143,0.001913645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989782,0.0001230555,0.00025510686,0.00023884774,0.00010598349,0.0002988271],"domain_scores_gemma":[0.9992742,0.00025563233,0.000040088675,0.00030514045,0.000041099665,0.00008386075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016790596,0.00012803823,0.0002149944,0.00013795402,0.00010587083,0.000030227522,0.00021885947,0.00007781082,0.00013620856],"category_scores_gemma":[0.00006800666,0.00011664961,0.00006991169,0.0008767143,0.00008872389,0.00008682975,0.000025136813,0.00017848745,0.000022748703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013247383,0.00050882157,0.002090565,0.00002834902,0.000020615367,0.0000042811685,0.00034831325,0.000004071105,0.00014926233,0.9867088,0.0015063361,0.008617301],"study_design_scores_gemma":[0.00030911254,0.000031266743,0.004841087,0.000029638115,0.000020810128,0.0000011622571,0.00035187902,0.0013943989,0.0010910343,0.98495054,0.006815967,0.00016307898],"about_ca_topic_score_codex":0.000070575865,"about_ca_topic_score_gemma":0.00006572425,"teacher_disagreement_score":0.082314216,"about_ca_system_score_codex":0.00003277581,"about_ca_system_score_gemma":0.000039082614,"threshold_uncertainty_score":0.4756833},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97255075,0.00013018449,0.0028485633,0.00067401497,0.0000065828235,0.00052618433,0.000038785543,0.00007499385,0.023149967],"genre_scores_gemma":[0.9973248,0.000011672609,0.0016746236,0.00003970189,0.000025992145,0.00025002714,0.0000050870285,0.000012307321,0.00065573433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992117,0.000019677786,0.00021583815,0.00025602762,0.00014927248,0.00014742804],"domain_scores_gemma":[0.99908733,0.00015461906,0.00006960284,0.00046022,0.00018271078,0.000045509107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023613707,0.00013261687,0.00018620606,0.000023549672,0.000091927075,0.00002595513,0.00020354662,0.00007945806,0.00009290674],"category_scores_gemma":[0.000181342,0.00009703829,0.000022795935,0.00025172182,0.0007433286,0.000046815298,0.00007585061,0.00013417685,0.000003974584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007850883,0.00017060025,0.0002629212,0.0007183246,0.00004712041,3.7839334e-7,0.00007854144,7.0596053e-7,0.04617617,0.95146865,0.000060423776,0.0009376325],"study_design_scores_gemma":[0.00019344581,0.000008608285,0.000054062028,0.00008196959,0.000075249765,0.000006100883,0.000105561274,0.000024409326,0.46642637,0.53271884,0.00021701786,0.000088341294],"about_ca_topic_score_codex":0.0000013539938,"about_ca_topic_score_gemma":3.8184206e-7,"teacher_disagreement_score":0.4202502,"about_ca_system_score_codex":0.000012011099,"about_ca_system_score_gemma":0.00005344893,"threshold_uncertainty_score":0.39571068},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9868161,0.00023796104,0.00018490915,0.00019939289,0.00074776396,0.0003390059,0.000011619588,0.00002528155,0.011437966],"genre_scores_gemma":[0.99925417,0.000012066811,0.00013513396,0.00003222296,0.000015257056,0.000018348248,6.9408634e-7,0.000008231638,0.0005238967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990512,0.00027952658,0.00030888506,0.00013379006,0.000120129574,0.00010645467],"domain_scores_gemma":[0.9981927,0.00094100786,0.00018597984,0.0005405022,0.000115805815,0.00002395872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001118199,0.00009807367,0.00023767579,0.00010367389,0.0001262543,0.00000918968,0.00031322936,0.00008133495,0.00002212649],"category_scores_gemma":[0.0011966482,0.00007211586,0.000095055235,0.0005772085,0.00046571137,0.000038818533,0.00016809466,0.00010543248,6.151763e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006761632,0.00012743469,0.000726838,0.00010586544,0.0000565307,1.20711e-7,0.00021085066,7.630781e-8,0.002565982,0.99489427,0.0008504403,0.00039395262],"study_design_scores_gemma":[0.0005242738,0.000023947694,0.0009554018,0.000093825576,0.00007462061,5.0082997e-7,0.00023069284,0.000001818951,0.06455893,0.9330323,0.00044635803,0.00005737305],"about_ca_topic_score_codex":0.0000033023618,"about_ca_topic_score_gemma":9.0976624e-7,"teacher_disagreement_score":0.06199295,"about_ca_system_score_codex":0.0000066947077,"about_ca_system_score_gemma":0.00003207348,"threshold_uncertainty_score":0.29407993},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9939593,0.0010587692,0.00032082223,0.00031267377,0.0035031438,0.00029601355,0.0000013324344,0.000020259868,0.00052767555],"genre_scores_gemma":[0.99629563,0.00015596504,0.0032163025,0.00002296134,0.00025444475,0.0000040704354,1.6402328e-7,0.000018407602,0.000032049542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980303,0.00014045025,0.0010893486,0.00014770628,0.00035067077,0.00024149864],"domain_scores_gemma":[0.9971802,0.0010660177,0.00092827907,0.0002915816,0.00043486813,0.000099012446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018989339,0.00022255219,0.000602222,0.00017631098,0.0005548069,0.00014343386,0.0003963453,0.000121545534,8.460379e-7],"category_scores_gemma":[0.0007601135,0.00015153695,0.00016291496,0.0003062791,0.00035897185,0.00014362611,0.00023504464,0.00035971103,2.5223773e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072623676,0.00024776207,0.000105682426,0.0002927749,0.00015560942,0.0000017750743,0.0008226994,0.0000015686935,0.0024518392,0.99450785,0.00028834067,0.0010515021],"study_design_scores_gemma":[0.0019040236,0.00018209663,0.00009089287,0.00046285972,0.00015948681,0.00002197496,0.0004980018,0.00072425196,0.003735288,0.9915244,0.0005549967,0.0001417072],"about_ca_topic_score_codex":0.000005907138,"about_ca_topic_score_gemma":0.0000012445292,"teacher_disagreement_score":0.003248699,"about_ca_system_score_codex":0.000026967999,"about_ca_system_score_gemma":0.00011818919,"threshold_uncertainty_score":0.6179498},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98477924,0.0004296603,0.00487117,0.0002968357,0.0069766273,0.00038022385,0.0000023231214,0.00003372112,0.0022301746],"genre_scores_gemma":[0.99812794,0.000051314113,0.001535109,0.000016198663,0.00021695517,0.0000043384184,3.594829e-7,0.000019209096,0.000028572269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974602,0.00018259796,0.0014821294,0.00015058453,0.00045162864,0.00027286456],"domain_scores_gemma":[0.9932131,0.004062272,0.0014572402,0.0003739769,0.0007958261,0.00009756106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026087353,0.00022763092,0.00070493156,0.0002208349,0.00049815146,0.000120327655,0.0005501581,0.00014655353,0.0000036475135],"category_scores_gemma":[0.0013503383,0.00016095246,0.00025540235,0.00071006693,0.00026013373,0.00010341484,0.00017756493,0.00042978176,4.5892028e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011766518,0.00043964674,0.00018857168,0.00015435895,0.00020096368,0.0000018969728,0.0004671673,0.000004678704,0.0005911364,0.9963045,0.00063374016,0.00089567725],"study_design_scores_gemma":[0.0028566266,0.00020325738,0.00010696959,0.00035060212,0.0001677254,0.000016250664,0.0005524176,0.0007869294,0.0020506165,0.99137753,0.0013886691,0.00014240266],"about_ca_topic_score_codex":0.000003917616,"about_ca_topic_score_gemma":7.8895926e-7,"teacher_disagreement_score":0.01334868,"about_ca_system_score_codex":0.00003117446,"about_ca_system_score_gemma":0.00014228598,"threshold_uncertainty_score":0.65634507},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9852804,0.000017751841,0.0047336454,0.00021702146,0.007968617,0.0003653526,0.0000036903625,0.000021470905,0.0013920479],"genre_scores_gemma":[0.99919724,0.000007839257,0.0005026437,0.000042923846,0.0002079157,0.0000033261672,0.0000011496021,0.000017835388,0.000019120462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980211,0.0001596904,0.0010820125,0.00013753293,0.0004254946,0.00017412774],"domain_scores_gemma":[0.9970668,0.0007827642,0.0013595878,0.00034012753,0.0003930297,0.000057704354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011404622,0.00020351938,0.0005283267,0.00022367056,0.00029252627,0.000070237526,0.0003819476,0.00012226395,0.000005232848],"category_scores_gemma":[0.00047655613,0.00014488687,0.000245378,0.00055883743,0.000105399784,0.00009995162,0.00012827462,0.00032789976,6.987487e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080244914,0.00075044925,0.00025050613,0.00027842456,0.0001177378,4.823836e-7,0.00037405835,0.0000014106025,0.0067239637,0.99066156,0.00010267904,0.0006584682],"study_design_scores_gemma":[0.001986375,0.00025447045,0.0009422426,0.00082347635,0.00017087093,0.000010100014,0.00013443196,0.00025518617,0.005214407,0.98982173,0.00027134432,0.00011537274],"about_ca_topic_score_codex":8.2511656e-7,"about_ca_topic_score_gemma":1.157851e-7,"teacher_disagreement_score":0.013916844,"about_ca_system_score_codex":0.000037184942,"about_ca_system_score_gemma":0.000068306195,"threshold_uncertainty_score":0.5908315},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18700461,0.000060433784,0.6267656,0.000619806,0.000046539168,0.001438005,0.0002648061,0.00010499319,0.18369523],"genre_scores_gemma":[0.89783233,0.0000060054954,0.10079772,0.000054952412,0.000010361406,0.00015615075,0.000011042086,0.000011920101,0.0011194878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991108,0.00004032803,0.00044214932,0.00015035973,0.000096612515,0.00015973463],"domain_scores_gemma":[0.9958763,0.0035455811,0.00015533382,0.00033689933,0.000051567404,0.000034333167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042057445,0.00010769581,0.0003844762,0.00013934706,0.00005380643,0.0000040550817,0.00023540114,0.000044832796,0.000046235273],"category_scores_gemma":[0.0011488715,0.00008199552,0.0002177539,0.00024383601,0.00023186517,0.000020612746,0.000061893414,0.0000643478,0.0000074596987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002646798,0.0002948276,0.00002079253,0.00081830175,0.000054455173,1.2226855e-7,0.00029331897,0.0000011671834,0.008640417,0.9889361,0.00062178145,0.00029220182],"study_design_scores_gemma":[0.0002449505,0.00007992271,0.000042458792,0.00015563723,0.000079743164,6.7980363e-7,0.00011019513,0.0006276555,0.022338262,0.97589606,0.0003562801,0.000068138244],"about_ca_topic_score_codex":9.967749e-7,"about_ca_topic_score_gemma":0.0000016323982,"teacher_disagreement_score":0.71082777,"about_ca_system_score_codex":0.0000047129456,"about_ca_system_score_gemma":0.000020874688,"threshold_uncertainty_score":0.33436802},"labels":[],"label_agreement":null},{"id":"W4408736835","doi":"10.61091/ars162-03","title":"On First Zagreb index, \\({\\tau}\\)-path-coverable and \\({\\tau}\\)-edge-Hamiltonian graphs","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Path (computing); Hamiltonian (control theory); Enhanced Data Rates for GSM Evolution; Hamiltonian path; Combinatorics; Graph; Computer science; Computer network; Telecommunications; Mathematical optimization","score_opus":0.011392266814499862,"score_gpt":0.25933135012198927,"score_spread":0.2479390833074894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408736835","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97024494,0.00019408797,0.000079354446,0.000583975,0.0008545584,0.00054023333,0.000018889034,0.00021843208,0.027265532],"genre_scores_gemma":[0.9972838,0.00008083032,0.00024680287,0.0003798779,0.0000066097487,0.00006492962,0.000008830727,0.000033545035,0.0018947665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998456,0.00008851513,0.00036665853,0.00047884614,0.00022239266,0.0003875827],"domain_scores_gemma":[0.9979384,0.0009043571,0.00012331866,0.0008141086,0.000088072054,0.0001317753],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004144015,0.00029837483,0.00036121937,0.00023866876,0.0006666891,0.000094288545,0.00036666187,0.00019588124,0.00007080401],"category_scores_gemma":[0.00027326014,0.00029236733,0.00012607049,0.0006907937,0.00016461404,0.00013130548,0.00013525745,0.0003609613,0.00006676931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038354647,0.00034967196,0.0025709274,0.000105332336,0.00006976942,0.0000047544495,0.00036311202,0.0000023404539,0.00010778771,0.98004705,0.015961716,0.00037917466],"study_design_scores_gemma":[0.0013609391,0.00009013256,0.005446936,0.00015985756,0.000063870866,0.0000036349925,0.00014920418,0.00006935971,0.0009075622,0.98497343,0.0064990837,0.00027600222],"about_ca_topic_score_codex":0.000028483777,"about_ca_topic_score_gemma":0.000031015254,"teacher_disagreement_score":0.027038869,"about_ca_system_score_codex":0.000055515637,"about_ca_system_score_gemma":0.000046234556,"threshold_uncertainty_score":0.99995285},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009369864,0.00092626776,0.9771216,0.001078149,0.0003159155,0.002107635,0.00001751698,0.00013159614,0.008931466],"genre_scores_gemma":[0.8983268,0.00008298465,0.10092988,0.00033594933,0.000049284703,0.000039766943,0.000002862823,0.000018803348,0.00021363469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833804,0.00009475315,0.0004930999,0.0005644851,0.00028530337,0.00022430425],"domain_scores_gemma":[0.9949085,0.0035306106,0.0003018805,0.0010817851,0.0001362835,0.00004091183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00291344,0.0002515671,0.00051191734,0.0002236478,0.0003131049,0.00007470985,0.00091770437,0.00014957105,0.000008061327],"category_scores_gemma":[0.0002912104,0.0001663096,0.0001380291,0.0003306119,0.0018269613,0.00005633664,0.00046403354,0.00050042814,7.204388e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027930048,0.000042215244,0.00005714191,0.00025099053,0.00003403831,5.326025e-7,0.0021244492,0.00027993476,0.00005139052,0.96555156,0.000015948988,0.03156388],"study_design_scores_gemma":[0.00083000504,0.000020173922,0.00001833475,0.00034218133,0.000052413405,0.0000074960385,9.377435e-7,0.011704571,0.00049510185,0.9862368,0.00013836735,0.00015363225],"about_ca_topic_score_codex":0.000013956886,"about_ca_topic_score_gemma":0.000037792335,"teacher_disagreement_score":0.88895696,"about_ca_system_score_codex":0.000027988985,"about_ca_system_score_gemma":0.00011731201,"threshold_uncertainty_score":0.6781909},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7151556,0.00015025663,0.019766815,0.027877599,0.00012849703,0.0017122179,0.00047460062,0.00033832184,0.23439607],"genre_scores_gemma":[0.95689607,0.0000019547783,0.027286582,0.0015490205,0.000025886211,0.00009760302,0.000016175833,0.00003894472,0.014087765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987799,0.000055284923,0.00028400618,0.00029926415,0.00014491963,0.00043663723],"domain_scores_gemma":[0.9984889,0.00040984104,0.000055723856,0.0006068659,0.000083571555,0.00035509738],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00020310853,0.00022716352,0.00029587123,0.00024217812,0.0002800222,0.00005384799,0.000358738,0.00014592292,0.009890442],"category_scores_gemma":[0.00025790196,0.00017983642,0.000086985885,0.0004764994,0.0002032142,0.000021630676,0.000032812088,0.0002548408,0.0009162972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009013131,0.00003879498,0.00004916804,0.0001311007,0.00005288434,0.000016595186,0.0000821686,8.0593065e-7,0.000085748565,0.93933064,0.059763666,0.00043942765],"study_design_scores_gemma":[0.00023399499,0.000023157067,0.00015921844,0.00012769461,0.000069544185,0.00003348743,0.00014871139,0.000015786425,0.0002831232,0.9232448,0.07546096,0.00019957205],"about_ca_topic_score_codex":0.00018408858,"about_ca_topic_score_gemma":0.0018443017,"teacher_disagreement_score":0.24174045,"about_ca_system_score_codex":0.00007170375,"about_ca_system_score_gemma":0.0002179368,"threshold_uncertainty_score":0.9998616},"labels":[],"label_agreement":null},{"id":"W4408968286","doi":"10.61091/ars162-10","title":"Chemical applicability of GQ and QG indices of a graph and their bounds","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics","score_opus":0.011899939445502987,"score_gpt":0.2731626614923572,"score_spread":0.2612627220468542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408968286","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99760914,0.0001778219,0.000042363492,0.00008595883,0.00003365908,0.00019387837,0.000012073585,0.000019029718,0.0018261023],"genre_scores_gemma":[0.9995899,0.000017654813,0.0003239288,0.000012490763,9.150868e-7,0.00003341745,0.0000015278566,0.000004446234,0.00001571577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947184,0.000031272895,0.000216277,0.00014768903,0.000052689247,0.0000802551],"domain_scores_gemma":[0.9990649,0.0004956751,0.000095756266,0.00026777695,0.000044774963,0.000031098967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028266732,0.00008250731,0.00022454052,0.00005387597,0.000044699907,0.0000069627163,0.000111205074,0.000068449845,0.000004488018],"category_scores_gemma":[0.00008520018,0.000069005655,0.000040404906,0.00024107483,0.00034229262,0.000029327115,0.000082528946,0.00007896242,1.5792894e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000139108215,0.00018715845,0.0065762564,0.00020864788,0.000035476158,3.745964e-8,0.00042277042,9.07862e-9,0.014818518,0.9771085,0.000088258086,0.0005405018],"study_design_scores_gemma":[0.0003389343,0.000017863375,0.0019104168,0.000030454199,0.000026444084,6.4579774e-7,0.0002303999,0.0000075578305,0.059520382,0.93773997,0.00012777778,0.000049175593],"about_ca_topic_score_codex":0.000007029534,"about_ca_topic_score_gemma":0.0000010366664,"teacher_disagreement_score":0.044701863,"about_ca_system_score_codex":0.000004303944,"about_ca_system_score_gemma":0.000015445317,"threshold_uncertainty_score":0.2813969},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99430823,0.00060325844,0.0006335148,0.00023160192,0.0027531607,0.00039323902,0.000012911942,0.000028583467,0.0010354836],"genre_scores_gemma":[0.99433476,0.00004501007,0.0052442024,0.000007634361,0.00031171693,0.000003010525,3.2596176e-7,0.000042455682,0.000010859175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743223,0.00014082846,0.0012155387,0.00021703515,0.00072595885,0.0002684284],"domain_scores_gemma":[0.99531835,0.0026464243,0.0011077784,0.00032013768,0.00047673745,0.00013059229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017528149,0.0003011377,0.0008586242,0.00016654095,0.00020000507,0.00011041737,0.00047645916,0.00014561135,0.000007146604],"category_scores_gemma":[0.0005735662,0.00019939592,0.00027321896,0.00057649077,0.00037486313,0.00014780744,0.00019580599,0.00050055963,2.8445626e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011326215,0.0004300657,0.00016524846,0.00088749256,0.000267834,0.000009511653,0.0016436033,0.0000026738367,0.002331486,0.9935347,0.00024967766,0.00036445487],"study_design_scores_gemma":[0.0022344675,0.00070575794,0.00025743898,0.0012140933,0.00033992913,0.0002257238,0.0004686538,0.00058193237,0.0038814351,0.98967725,0.00020389578,0.00020944812],"about_ca_topic_score_codex":0.000006326643,"about_ca_topic_score_gemma":8.709382e-7,"teacher_disagreement_score":0.0046106875,"about_ca_system_score_codex":0.000035955196,"about_ca_system_score_gemma":0.0001940419,"threshold_uncertainty_score":0.813113},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9873661,0.00005911744,0.009923535,0.00020889715,0.001253922,0.00043267917,0.000023598062,0.00001078087,0.00072139414],"genre_scores_gemma":[0.9983402,0.000016706834,0.0015710971,0.000013783207,0.000031986663,0.000006381809,0.0000028114098,0.000014698514,0.00000232752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720997,0.0002281421,0.001705017,0.00014697203,0.00053878286,0.00017112562],"domain_scores_gemma":[0.99252135,0.0038615393,0.0023734027,0.00037175196,0.0008104685,0.00006147527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019518186,0.00020526485,0.00072723004,0.00027767656,0.00019950412,0.000026757714,0.00051067123,0.000117855794,0.00000802187],"category_scores_gemma":[0.0006494257,0.0001570843,0.00023968703,0.0007778861,0.00033477845,0.00007317256,0.0000965581,0.00034484544,1.8965713e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075090094,0.00095332257,0.00006988579,0.00033307588,0.00020214428,2.7449428e-7,0.0007064937,0.0000051264856,0.03712482,0.95976263,0.00041577578,0.00035133678],"study_design_scores_gemma":[0.0017059263,0.00048295723,0.00012559627,0.00064901,0.0002042828,0.000003438019,0.001641599,0.0006598236,0.02104216,0.97335124,0.000023813147,0.000110179055],"about_ca_topic_score_codex":0.000010148028,"about_ca_topic_score_gemma":6.412567e-7,"teacher_disagreement_score":0.01608266,"about_ca_system_score_codex":0.00003161266,"about_ca_system_score_gemma":0.00012739951,"threshold_uncertainty_score":0.6405712},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9923811,0.000088663364,0.0015940723,0.0005213543,0.000030844105,0.00037204166,0.000065802014,0.00003855292,0.0049075494],"genre_scores_gemma":[0.99068767,0.000014076474,0.004558641,0.00027810468,0.000028377845,0.000041478386,0.0000057743864,0.000015071476,0.00437079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999335,0.0000629673,0.00019391673,0.00018531554,0.000090266316,0.00013256076],"domain_scores_gemma":[0.9986053,0.00086538505,0.000068550675,0.00037170158,0.000053677144,0.000035350935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000223571,0.0001290752,0.00018408214,0.000058666028,0.00012195559,0.0000123491,0.00014131065,0.000058522055,0.00022641532],"category_scores_gemma":[0.0001381933,0.00007493158,0.000062889725,0.0001778645,0.00015461558,0.00003821625,0.000038238457,0.00014862364,0.000011840137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008894468,0.00026660692,0.0013583171,0.00010542166,0.00009545694,0.0000010838509,0.0005033369,0.0000050939084,0.0019876983,0.99323696,0.001294927,0.0010561249],"study_design_scores_gemma":[0.0023136528,0.00040655382,0.010024884,0.00033331354,0.00024143393,0.0000063009647,0.00086617965,0.00414623,0.13702373,0.8186855,0.025501635,0.00045060244],"about_ca_topic_score_codex":0.0000063397056,"about_ca_topic_score_gemma":0.00008542666,"teacher_disagreement_score":0.1745515,"about_ca_system_score_codex":0.0000035773216,"about_ca_system_score_gemma":0.000020497388,"threshold_uncertainty_score":0.3055621},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74782026,0.00366886,0.22469394,0.0051675197,0.00077996927,0.002473405,0.0001214802,0.00008232417,0.015192265],"genre_scores_gemma":[0.9886421,0.00016323,0.010181495,0.00018821906,0.00010470621,0.00006223279,0.0000010779329,0.000015657908,0.0006412662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859583,0.00016728265,0.00071023405,0.00011484255,0.00019404195,0.00021775629],"domain_scores_gemma":[0.9957768,0.0028933098,0.0006540194,0.00032797275,0.00029443044,0.000053494583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026249671,0.00015477315,0.0003604346,0.00027593403,0.00020768106,0.000024338595,0.0005558465,0.00007831542,0.00005265771],"category_scores_gemma":[0.00027962506,0.00008776483,0.00065285305,0.00064147415,0.00023368817,0.000086471424,0.000036062007,0.0002950943,8.962504e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035996657,0.00026796188,0.00012981406,0.00013401215,0.00041574182,0.00000121911,0.00042321775,0.000008698895,0.0036371371,0.9876059,0.0042204326,0.0027958592],"study_design_scores_gemma":[0.0006477579,0.00015836545,0.00044979653,0.00016783246,0.00041070188,0.00002749153,0.0007488532,0.000008224468,0.0044169594,0.9897495,0.0031238673,0.00009068343],"about_ca_topic_score_codex":0.0000013035223,"about_ca_topic_score_gemma":0.000008978216,"teacher_disagreement_score":0.24082188,"about_ca_system_score_codex":0.00001410125,"about_ca_system_score_gemma":0.00007402207,"threshold_uncertainty_score":0.3578946},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98908705,0.00025305786,0.004785018,0.00010978819,0.0033566689,0.0003171036,0.0000050046733,0.000022778037,0.002063535],"genre_scores_gemma":[0.99450964,0.000040032675,0.0052444087,0.000010529413,0.00015177093,0.000002450988,6.6513616e-7,0.000023525768,0.000016993952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970616,0.00015530238,0.001856216,0.00017067099,0.0005094017,0.00024679388],"domain_scores_gemma":[0.99413407,0.0025354698,0.002050993,0.00037010593,0.00080584217,0.000103509265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018161797,0.0002615175,0.0010997299,0.00048004414,0.0001639859,0.000044305358,0.0005122614,0.00019427387,0.000008598685],"category_scores_gemma":[0.0011538138,0.00023123894,0.0003172918,0.0008243851,0.0002260337,0.00011688606,0.00019368943,0.00040308962,3.3558132e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010810044,0.0009915163,0.0008047809,0.0007619838,0.00024013767,0.0000024102665,0.00063143333,0.00000779862,0.0022859585,0.99313563,0.00029499287,0.0007352854],"study_design_scores_gemma":[0.002734247,0.00033908035,0.00016188525,0.0007843097,0.0002209154,0.000014382899,0.0005548445,0.000571856,0.007458715,0.9867083,0.00028312815,0.00016833769],"about_ca_topic_score_codex":0.000009280131,"about_ca_topic_score_gemma":4.3884762e-7,"teacher_disagreement_score":0.0064273034,"about_ca_system_score_codex":0.000033288885,"about_ca_system_score_gemma":0.0001754685,"threshold_uncertainty_score":0.94296503},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70277786,0.0053542596,0.1475403,0.0008135033,0.0014642623,0.0036728512,0.00016367217,0.00044775743,0.13776554],"genre_scores_gemma":[0.9773769,0.0023966122,0.017825704,0.00025380866,0.00016927734,0.00078631035,0.00043711197,0.00002433968,0.0007299742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998737,0.00011162463,0.0005633908,0.00023750524,0.00018945962,0.00016105543],"domain_scores_gemma":[0.99831736,0.00051562925,0.00034944815,0.0006142663,0.00016396724,0.000039343115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092750567,0.00021000946,0.00037482678,0.00023057307,0.000057594276,0.000017597995,0.0003291624,0.0002402203,0.00009338941],"category_scores_gemma":[0.0003731783,0.00019919375,0.00013973443,0.00026628497,0.00020295409,0.00016516403,0.00029797107,0.00047353236,0.000011117244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005310762,0.00019488501,0.00020709763,0.0012830523,0.00003960821,1.223138e-7,0.0004800661,0.0002469293,0.000028547682,0.9953599,0.00033493844,0.0017717344],"study_design_scores_gemma":[0.00021747894,0.000004268159,0.00044447105,0.00015189512,0.00005252577,0.0000010668548,0.0002658763,0.00014477284,0.0038399808,0.9933161,0.0013954289,0.00016611314],"about_ca_topic_score_codex":0.0000010367443,"about_ca_topic_score_gemma":9.323734e-7,"teacher_disagreement_score":0.274599,"about_ca_system_score_codex":0.000057454457,"about_ca_system_score_gemma":0.00014493901,"threshold_uncertainty_score":0.8122885},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97018975,0.000017784418,0.0015620869,0.00014385107,0.000018077353,0.00032234722,0.000012196405,0.000033031603,0.027700856],"genre_scores_gemma":[0.9966064,0.000010393335,0.0026744355,0.000051607316,0.0000019476452,0.00006695097,0.0000018992421,0.000014208794,0.0005721694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991018,0.00009130093,0.00035154828,0.00016349753,0.00015675732,0.00013505487],"domain_scores_gemma":[0.9984434,0.0008587064,0.00016295584,0.00040533734,0.000090141766,0.000039459796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022629884,0.0001386697,0.00035161767,0.000075170195,0.00006189659,0.0000147893015,0.00016173214,0.00007481349,0.00017502988],"category_scores_gemma":[0.00019556243,0.00009864736,0.00005412486,0.00037329894,0.00019351463,0.000060084967,0.00003946806,0.00009150194,0.0000069744424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009080252,0.00027643473,0.0028355604,0.0017730941,0.00013304617,5.263494e-7,0.00091099547,0.0000055245255,0.0021879598,0.991498,0.0001662118,0.000121851655],"study_design_scores_gemma":[0.00054755894,0.000064773696,0.0078030084,0.00067848805,0.00021179562,0.00000380203,0.0008036469,0.00046439943,0.009100597,0.98014027,0.00004485568,0.00013679464],"about_ca_topic_score_codex":0.000011912707,"about_ca_topic_score_gemma":0.000011935488,"teacher_disagreement_score":0.027128687,"about_ca_system_score_codex":0.000010390981,"about_ca_system_score_gemma":0.000028442837,"threshold_uncertainty_score":0.40227228},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96035725,0.0014101415,0.036023043,0.00052038056,0.00012854116,0.00036867047,0.0000051151173,0.000012315045,0.0011745464],"genre_scores_gemma":[0.99962884,0.00013430427,0.00011325936,0.0000064924916,0.000010555806,0.000008346205,0.0000016808151,0.000012584463,0.00008392808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837047,0.00021858227,0.0007817048,0.00010770161,0.00030032903,0.00022123696],"domain_scores_gemma":[0.9971319,0.0006557535,0.001087807,0.00039736155,0.0007008381,0.000026346515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013852945,0.0001348984,0.0004379273,0.00018874036,0.00006843096,0.0000044963754,0.00045481574,0.000046791785,0.000005691891],"category_scores_gemma":[0.00024061235,0.00009680947,0.00017718774,0.0010626706,0.00024644617,0.00006510348,0.000026754646,0.00038749623,2.0534286e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001109436,0.0007093091,0.00063215016,0.00012360919,0.0002795918,2.4592222e-7,0.0004568756,0.0000040124314,0.03082861,0.96628684,0.000063458036,0.00050435984],"study_design_scores_gemma":[0.00084446144,0.0002894189,0.0037970974,0.00011935351,0.00035705388,0.000014030273,0.00013143734,0.00015534121,0.042866234,0.9512711,0.00008311985,0.000071304676],"about_ca_topic_score_codex":0.000009657273,"about_ca_topic_score_gemma":0.0000073756155,"teacher_disagreement_score":0.039271604,"about_ca_system_score_codex":0.00007318713,"about_ca_system_score_gemma":0.00035555303,"threshold_uncertainty_score":0.39477754},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47633126,0.0014875089,0.2700571,0.002948766,0.00007920887,0.0031049643,0.00012568879,0.000501621,0.24536385],"genre_scores_gemma":[0.9770406,0.000087809734,0.020656612,0.00007775631,0.000037775797,0.00036935494,0.0000056338727,0.000023033896,0.0017014389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989923,0.000035869896,0.00045756166,0.00021632803,0.00011287627,0.00018505268],"domain_scores_gemma":[0.9984505,0.00066846184,0.00017379725,0.00060502184,0.000047577214,0.000054630764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028993274,0.00016381225,0.0003264867,0.00018934015,0.00015138599,0.00002478528,0.00028075685,0.00007965554,0.00012871697],"category_scores_gemma":[0.000074647156,0.00013552973,0.000094195384,0.0005642553,0.00015152288,0.000064624845,0.00011862438,0.00012430508,0.000028607581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051308702,0.000214073,0.00006950372,0.0005376111,0.00005444838,1.9709192e-7,0.00026525857,3.3666268e-7,0.0009686607,0.9954954,0.0009936948,0.0013957192],"study_design_scores_gemma":[0.00021319085,0.000012810268,0.00016297512,0.000092014794,0.00008631766,0.000008111846,0.00036155593,0.00012777718,0.007715634,0.9811465,0.009955604,0.00011748919],"about_ca_topic_score_codex":0.0000017080646,"about_ca_topic_score_gemma":0.0000040160426,"teacher_disagreement_score":0.5007093,"about_ca_system_score_codex":0.000012787862,"about_ca_system_score_gemma":0.000030471387,"threshold_uncertainty_score":0.55267423},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97906655,0.000022794167,0.00016171772,0.0012726497,0.00006767615,0.0010866667,0.000027226619,0.00009738591,0.018197322],"genre_scores_gemma":[0.9989412,0.000006457975,0.00034973564,0.00038703028,0.000022884617,0.0001797123,0.000014285036,0.000031982236,0.00006674266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983483,0.00023588006,0.00039537653,0.0005045224,0.00017426602,0.00034168674],"domain_scores_gemma":[0.998268,0.0007690036,0.0001532238,0.00068602315,0.000024551193,0.000099218814],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061358564,0.00030392926,0.00038889315,0.0006897431,0.000248421,0.000073166535,0.00043176534,0.00013248065,0.00003109683],"category_scores_gemma":[0.00015496512,0.00027223054,0.00011759189,0.00091447437,0.00019676803,0.00009388938,0.00007987786,0.00038127162,0.000006963536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046191554,0.0030959558,0.033275623,0.00009706005,0.00025110075,0.000011929627,0.003140384,0.0000010167545,0.0039318376,0.9510907,0.001224398,0.0034180775],"study_design_scores_gemma":[0.002873106,0.0003473122,0.11245446,0.0001511107,0.00019510364,0.0000018100521,0.0040408997,0.00007242373,0.0019248899,0.8774191,0.00014031674,0.00037947926],"about_ca_topic_score_codex":0.000026475775,"about_ca_topic_score_gemma":0.00030197352,"teacher_disagreement_score":0.07917884,"about_ca_system_score_codex":0.000026013147,"about_ca_system_score_gemma":0.00006755904,"threshold_uncertainty_score":0.999973},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05172654,0.0005272401,0.92188114,0.0016653478,0.00036116646,0.00051353785,0.000083578765,0.000034370936,0.023207083],"genre_scores_gemma":[0.9965868,0.00008963275,0.0002580157,0.0022133223,0.00028329584,0.00011568643,0.000010604441,0.000016952075,0.0004256738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980824,0.00027935734,0.0008213097,0.00020565437,0.00044758333,0.00016372325],"domain_scores_gemma":[0.98978615,0.008120366,0.00077119604,0.00036420947,0.00088759523,0.00007047207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019565925,0.00018855574,0.0002750968,0.0002396152,0.0002588539,0.00005605852,0.00071604433,0.00008750517,0.00016257602],"category_scores_gemma":[0.0006219532,0.0001415521,0.00018568554,0.00044069954,0.00032906618,0.00015933151,0.00009700537,0.00047365244,0.000009523438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001382789,0.00032724993,0.000083458624,0.000011707587,0.00033030537,0.000001375705,0.00010113608,0.0016924854,0.0012045329,0.98611355,0.0018332127,0.008162737],"study_design_scores_gemma":[0.0006237829,0.000035056393,0.00013444043,0.00014114384,0.00010040166,0.000045169156,0.00013560223,0.00018839982,0.00090305787,0.98951757,0.008056924,0.00011842373],"about_ca_topic_score_codex":0.000002007961,"about_ca_topic_score_gemma":0.0000033308938,"teacher_disagreement_score":0.9448603,"about_ca_system_score_codex":0.000035684996,"about_ca_system_score_gemma":0.0001316579,"threshold_uncertainty_score":0.57723266},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98471856,0.00013599664,0.007210046,0.00004166718,0.000024412735,0.00020165235,0.0000022354882,0.000046650646,0.0076187635],"genre_scores_gemma":[0.91616434,0.000045021985,0.08373831,0.000006767176,0.0000022918268,0.00001240654,3.091415e-7,0.0000047522067,0.000025777661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933803,0.0000042770703,0.0002655895,0.0001515202,0.00009867969,0.00014192713],"domain_scores_gemma":[0.9994678,0.00030865776,0.000065091896,0.00012261412,0.000009108248,0.000026730455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069766975,0.000098080454,0.00020216501,0.00024635208,0.00007962153,0.000028068118,0.00013500621,0.0000501175,0.0000029981961],"category_scores_gemma":[0.000049380444,0.00007869422,0.0000172564,0.00060910435,0.00014439659,0.000038313276,0.00006703897,0.00008523108,2.6340297e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.5383385e-7,0.00002989858,0.00008248273,0.0003115856,0.000007814907,1.6332127e-7,0.00094467774,0.00010781163,0.0043532047,0.9931088,0.0000043215587,0.0010484016],"study_design_scores_gemma":[0.00014758194,0.000010925435,0.00033513526,0.00016074383,0.000013665345,0.0000023676068,0.0009250621,0.03167344,0.0036281464,0.9629721,0.000034234727,0.00009659541],"about_ca_topic_score_codex":0.0000024268627,"about_ca_topic_score_gemma":0.0000027948208,"teacher_disagreement_score":0.076528266,"about_ca_system_score_codex":0.0000056769222,"about_ca_system_score_gemma":0.000008201296,"threshold_uncertainty_score":0.3209057},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9917516,0.000053321502,0.00068787497,0.0008551555,0.0022295653,0.00036275884,0.0000019192285,0.000011631351,0.0040461733],"genre_scores_gemma":[0.9978522,0.00001879684,0.0018103087,0.000096565855,0.00019096794,0.0000067686283,3.4509586e-7,0.000015335858,0.000008685626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977085,0.00037447122,0.0010866792,0.00013696683,0.00047357642,0.00021980354],"domain_scores_gemma":[0.9933072,0.005140703,0.00087080325,0.00040035907,0.00023753835,0.000043439086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033346375,0.00021531974,0.000578909,0.0001721374,0.00027821917,0.000102554935,0.0006922184,0.000107572516,0.00000796373],"category_scores_gemma":[0.0009519396,0.00012634502,0.00023664175,0.00059458945,0.00017262094,0.0000612113,0.00011047287,0.0005076972,0.0000010431704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006412971,0.0006151857,0.00018365333,0.000106002204,0.000083311206,0.000004105953,0.0016224525,0.000007221469,0.00018889489,0.9963977,0.00057663553,0.00015075695],"study_design_scores_gemma":[0.0019527996,0.0001065474,0.00028810705,0.00042566954,0.000096975615,0.000026571663,0.0010345984,0.00024755136,0.00042284126,0.9951096,0.00017420156,0.000114502625],"about_ca_topic_score_codex":0.0000070885644,"about_ca_topic_score_gemma":8.4772176e-7,"teacher_disagreement_score":0.0061006257,"about_ca_system_score_codex":0.000027814353,"about_ca_system_score_gemma":0.000070793554,"threshold_uncertainty_score":0.51522005},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86039096,0.00010972306,0.0048462716,0.0014016932,0.00014506522,0.00081262976,0.000037505728,0.0005358579,0.13172029],"genre_scores_gemma":[0.9857278,0.000008243934,0.010299282,0.00019325913,0.000028474431,0.0002558853,0.000010465409,0.00002783953,0.0034487615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985009,0.00007729499,0.0005251424,0.00032911473,0.00018501413,0.00038257745],"domain_scores_gemma":[0.9983342,0.0005365089,0.00012740491,0.0008421531,0.00006778313,0.00009193802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058666064,0.00023384509,0.00035810686,0.00020566833,0.00025390432,0.00006204632,0.00037769452,0.00009665466,0.0004980485],"category_scores_gemma":[0.00041244822,0.0002083526,0.000201758,0.0005342082,0.00016260461,0.00012910634,0.00010626893,0.00019595759,0.00024225964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012419689,0.00024483647,0.0001401016,0.00025673403,0.000072987146,0.0000012936245,0.00044629993,1.003934e-7,0.0015552237,0.9923776,0.0037856812,0.00110676],"study_design_scores_gemma":[0.0003038157,0.00002250039,0.00057431654,0.00017749729,0.0000980647,0.0000050849003,0.00030140666,0.0002322461,0.0023075317,0.9864795,0.009319571,0.0001784432],"about_ca_topic_score_codex":0.0000016560629,"about_ca_topic_score_gemma":0.0000023033397,"teacher_disagreement_score":0.12827154,"about_ca_system_score_codex":0.000024816256,"about_ca_system_score_gemma":0.00003530441,"threshold_uncertainty_score":0.84963727},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9683186,0.0016957967,0.0013282606,0.00065750326,0.00011727757,0.0012197695,0.00003194808,0.0002705721,0.026360288],"genre_scores_gemma":[0.99375844,0.00005685327,0.0045570796,0.0000650252,0.000005547639,0.0003626036,0.0000042552983,0.000022636059,0.0011675726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984174,0.00013520644,0.0005973589,0.00035552477,0.00017250178,0.00032205472],"domain_scores_gemma":[0.9983242,0.00068030227,0.00010858689,0.00075334153,0.000051204715,0.00008234254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096659374,0.0002216546,0.00042030748,0.00035202023,0.00014090023,0.000058956804,0.00023771486,0.00012126764,0.000051838033],"category_scores_gemma":[0.00034705884,0.00019488217,0.000104681596,0.00077672966,0.00020794134,0.000096367585,0.00008989174,0.00017012304,0.000028844273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000942402,0.000215353,0.0004920495,0.00073048385,0.000040050352,0.000003347503,0.0006384153,4.0010718e-7,0.00044703484,0.9944629,0.002522329,0.00043819848],"study_design_scores_gemma":[0.00034940251,0.000017924576,0.0006256165,0.00043149354,0.0000593307,0.000007956311,0.000926285,0.00072470296,0.00021261911,0.99420804,0.0022690038,0.00016764327],"about_ca_topic_score_codex":0.000012241934,"about_ca_topic_score_gemma":0.000010923005,"teacher_disagreement_score":0.025439842,"about_ca_system_score_codex":0.000018101418,"about_ca_system_score_gemma":0.000023429919,"threshold_uncertainty_score":0.7947064},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9117338,0.00061566924,0.025234351,0.0057409755,0.00004267967,0.0015052715,0.00005212862,0.00027213868,0.054802954],"genre_scores_gemma":[0.99394774,0.000085441054,0.0023460733,0.00017315417,0.000029081071,0.00024952882,0.000012861289,0.000008663899,0.00314744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946994,0.000021071432,0.00016302076,0.00018483015,0.000044376935,0.0001167942],"domain_scores_gemma":[0.99945974,0.00022377793,0.000033322056,0.000214509,0.000030354777,0.00003826756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001048386,0.000082178645,0.00010863576,0.00012971304,0.00012615974,0.000012940067,0.00012946557,0.000057060926,0.000032677504],"category_scores_gemma":[0.00003441678,0.000080257545,0.000029260038,0.0005288168,0.00005077573,0.00005745122,0.00003997518,0.000100303056,0.000024864446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003463107,0.000080997415,0.00023490196,0.000017972412,0.000010046548,1.7491416e-7,0.00010711848,0.000002908473,0.00076936366,0.99641865,0.0005464388,0.0018079795],"study_design_scores_gemma":[0.0003333163,0.00000794007,0.0015317083,0.000021469215,0.000030892505,0.0000010710781,0.00042681934,0.00080440525,0.0012949576,0.93570226,0.059732754,0.00011241451],"about_ca_topic_score_codex":0.000005244936,"about_ca_topic_score_gemma":0.000037310598,"teacher_disagreement_score":0.08221392,"about_ca_system_score_codex":0.000011803672,"about_ca_system_score_gemma":0.0000242971,"threshold_uncertainty_score":0.32728076},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9493621,0.00007255269,0.012395771,0.0024169174,0.0001754686,0.0021537878,0.000058857902,0.00044596143,0.032918602],"genre_scores_gemma":[0.99500316,0.000010438201,0.0029000766,0.00046921542,0.000007096504,0.00024476025,0.000015763644,0.000025476984,0.001324009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975752,0.00033762204,0.00095969025,0.00045684396,0.00022821497,0.00044242517],"domain_scores_gemma":[0.99623346,0.0023294897,0.00026966137,0.00090568437,0.00013688167,0.00012480229],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013611201,0.0003206054,0.0007407707,0.00021001438,0.0001744049,0.000050077848,0.0004518889,0.00018519351,0.00044423642],"category_scores_gemma":[0.0011056021,0.00026361487,0.00018665941,0.0009171103,0.00034059884,0.00014930907,0.0000892023,0.00032079,0.00006532816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013366732,0.00069864286,0.0018965675,0.0005013804,0.00008902708,0.000018914161,0.00068537577,2.6637912e-7,0.0014547191,0.9919256,0.0023339395,0.00026190258],"study_design_scores_gemma":[0.0015904123,0.000030387848,0.0008588044,0.00024956,0.00006739341,0.000010155616,0.00041634231,0.00036780053,0.0037858891,0.9911557,0.0011882987,0.00027928472],"about_ca_topic_score_codex":0.000060696675,"about_ca_topic_score_gemma":0.00025787187,"teacher_disagreement_score":0.045641083,"about_ca_system_score_codex":0.000059954622,"about_ca_system_score_gemma":0.000119589145,"threshold_uncertainty_score":0.9999816},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9703124,0.000022355523,0.022448357,0.0016520784,0.00014935003,0.0020765553,0.0023061086,0.00010037207,0.00093240733],"genre_scores_gemma":[0.99094176,0.0000012015839,0.008245096,0.00006469876,0.00003384161,0.0004302831,0.00007976759,0.000028135035,0.00017521731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860793,0.000046021,0.0005116685,0.00025461384,0.00024839785,0.000331391],"domain_scores_gemma":[0.9971334,0.0005185424,0.0004866695,0.0011681307,0.0005566802,0.00013658106],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00047703486,0.00022690932,0.00039690032,0.00018392157,0.0013177122,0.00012477215,0.0005968497,0.00009802622,0.000040975247],"category_scores_gemma":[0.0033315513,0.00017740311,0.00020860933,0.00019026062,0.0003446505,0.000111454414,0.00007557026,0.00011189991,0.000014186496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051779574,0.00020881835,0.000063621184,0.00019976191,0.000049395316,3.575048e-7,0.00051213236,0.0002098534,0.0079794815,0.9901517,0.0005457602,0.000027327038],"study_design_scores_gemma":[0.00090176036,0.00033925794,0.0004673946,0.0004309685,0.00023071181,0.0000029653615,0.00064983236,0.018373745,0.03860618,0.939231,0.00042196966,0.0003442113],"about_ca_topic_score_codex":0.0000067353467,"about_ca_topic_score_gemma":0.000017275994,"teacher_disagreement_score":0.05092071,"about_ca_system_score_codex":0.0000477287,"about_ca_system_score_gemma":0.00008852988,"threshold_uncertainty_score":0.9999824},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25087455,0.000049231207,0.73062,0.0068160216,0.00012382035,0.001368598,0.0035168251,0.00038559354,0.0062453095],"genre_scores_gemma":[0.97987586,0.00001151357,0.018879881,0.000045757002,0.00004386754,0.00025745566,0.000015775833,0.000029847146,0.0008400339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847835,0.00007794327,0.0005431681,0.0002507484,0.00028564202,0.00036412495],"domain_scores_gemma":[0.99720734,0.0011561828,0.0002515915,0.00090620824,0.0002833858,0.00019529193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059773726,0.00019767357,0.0004000071,0.000161769,0.00023320927,0.000024786252,0.0003536736,0.00009481692,0.00041670818],"category_scores_gemma":[0.0017448693,0.00013554125,0.00020105985,0.000418385,0.00020452595,0.00011141833,0.00010118156,0.00007904637,0.00027392688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000628093,0.0001946979,0.000094088966,0.000041396404,0.000059045997,0.0000015946582,0.0002986149,0.0000015100403,0.016914995,0.9771527,0.004995222,0.00023986267],"study_design_scores_gemma":[0.00045998886,0.000045801313,0.00033232695,0.0002767717,0.000115879506,0.00001590564,0.00013566672,0.00003832357,0.033199187,0.96199936,0.0031877256,0.00019308351],"about_ca_topic_score_codex":0.0000019958982,"about_ca_topic_score_gemma":0.0000076845845,"teacher_disagreement_score":0.7290013,"about_ca_system_score_codex":0.00008195408,"about_ca_system_score_gemma":0.000059100214,"threshold_uncertainty_score":0.5527212},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015496244,0.0002356931,0.013513637,0.000059717804,0.00022656757,0.0016550384,0.00091149076,0.00020030902,0.9816479],"genre_scores_gemma":[0.004908374,0.00066080067,0.6850089,0.00005368558,0.00007322844,0.00018827584,0.00005422099,0.0002661433,0.30878636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968759,0.0000073504407,0.0015464781,0.0005483813,0.0005980146,0.00042389258],"domain_scores_gemma":[0.99680334,0.0008688122,0.0011798085,0.00052829285,0.0005089116,0.000110813875],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007597534,0.00064692885,0.0012088332,0.0006292403,0.0001231545,0.00006825301,0.00068927184,0.00047947204,0.0003494444],"category_scores_gemma":[0.00071898627,0.00068326556,0.000228103,0.00019164426,0.00045637533,0.00007459617,0.00024067306,0.00080175453,0.000044510267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011386034,0.00017069984,0.00003968503,0.0053654234,0.00013718964,0.000007774907,0.00172717,4.300158e-7,0.00006351719,0.9838357,0.007951805,0.000689207],"study_design_scores_gemma":[0.00031130193,0.000041204887,0.00001044734,0.0020161353,0.00034626707,0.000008356798,0.00028027946,0.00012268875,0.00020088488,0.98434246,0.011786237,0.000533721],"about_ca_topic_score_codex":0.0000060357543,"about_ca_topic_score_gemma":0.000016716598,"teacher_disagreement_score":0.6728616,"about_ca_system_score_codex":0.000113384165,"about_ca_system_score_gemma":0.00015271938,"threshold_uncertainty_score":0.99956185},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3171117,0.000066328874,0.67520225,0.001214908,0.00009090394,0.0009530248,0.00019929672,0.00012347869,0.0050381143],"genre_scores_gemma":[0.97975355,0.000009663197,0.019611461,0.00005091146,0.000043444208,0.000060456543,0.000008348685,0.00001926398,0.0004429177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853265,0.000047033758,0.000625312,0.00015885486,0.00025626487,0.0003799015],"domain_scores_gemma":[0.9959929,0.0023699973,0.0002397992,0.0007960891,0.00044592615,0.0001553031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021087748,0.00015679662,0.00027834665,0.00009274679,0.00058184355,0.000035726254,0.00039462865,0.00007905872,0.00002108525],"category_scores_gemma":[0.0024002783,0.00010849871,0.00018282623,0.00062879367,0.00024139357,0.000044122105,0.000107069645,0.00014540809,0.000051143543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015418718,0.0001121068,0.000059083708,0.000031373016,0.00004781126,8.963679e-7,0.00049887144,0.0000014199577,0.0023460283,0.9946484,0.0019584117,0.00028017053],"study_design_scores_gemma":[0.00022237116,0.000034677356,0.00037321646,0.000049374743,0.00009030291,0.000010653691,0.0007708661,0.00006049899,0.018495157,0.9762362,0.0035192133,0.00013743779],"about_ca_topic_score_codex":0.0000037922096,"about_ca_topic_score_gemma":0.000059577018,"teacher_disagreement_score":0.6626418,"about_ca_system_score_codex":0.000043563807,"about_ca_system_score_gemma":0.00003601454,"threshold_uncertainty_score":0.4475129},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07711161,0.000024055684,0.91441554,0.0016439055,0.000077452256,0.0015369771,0.000698973,0.00022655528,0.0042649033],"genre_scores_gemma":[0.9200813,0.0000023420193,0.07818771,0.00015342885,0.00016966624,0.00053936825,0.000075725344,0.000037116482,0.0007533486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984271,0.000034707162,0.0005847433,0.0002538552,0.00019066173,0.000508955],"domain_scores_gemma":[0.9968165,0.0019034471,0.00015142668,0.00056734914,0.00031774092,0.00024354014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016666483,0.00019994607,0.00031797093,0.00011952535,0.00040991209,0.000057472975,0.00026636987,0.00012181771,0.00008787137],"category_scores_gemma":[0.0024267072,0.0001719924,0.00022010852,0.00037142824,0.00011373026,0.0000779688,0.000057456786,0.00011847057,0.00006628393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031128664,0.00020902147,0.000011406448,0.000042010546,0.00003915333,8.68495e-7,0.0006056158,0.000003828118,0.0022985407,0.9930845,0.003296894,0.00037706524],"study_design_scores_gemma":[0.0004960287,0.000080631406,0.000087241606,0.000062629406,0.00012921297,0.000010175255,0.00045738294,0.00041171137,0.008322737,0.9771829,0.012529426,0.00022990236],"about_ca_topic_score_codex":0.000001920284,"about_ca_topic_score_gemma":0.000084100684,"teacher_disagreement_score":0.84296966,"about_ca_system_score_codex":0.00010317802,"about_ca_system_score_gemma":0.00005309895,"threshold_uncertainty_score":0.7013647},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97950315,0.00035210524,0.005147523,0.0015329556,0.0011890865,0.00013839777,0.0000026832263,0.000041417246,0.012092659],"genre_scores_gemma":[0.99686104,0.00004291126,0.0011003349,0.00014493344,0.000035746154,0.0000045373417,5.7545896e-7,0.000011602488,0.001798324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988202,0.00007538365,0.0005768033,0.00009841308,0.00024169,0.00018754315],"domain_scores_gemma":[0.9984526,0.0004903572,0.00035795712,0.00027183426,0.00033385708,0.00009337958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071701396,0.00013553583,0.00029834753,0.00034144594,0.00013389175,0.000052600917,0.00044405228,0.000089567555,0.00004604402],"category_scores_gemma":[0.0004199106,0.00011299729,0.00025555288,0.00081453525,0.00007238255,0.00021642234,0.000063512496,0.0004543881,0.000005695283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023300905,0.00028262052,0.0009238921,0.000035826786,0.00008760497,0.000009775972,0.00015674668,7.5472684e-7,0.00018848112,0.98826754,0.009247745,0.0007756954],"study_design_scores_gemma":[0.00063724245,0.00009435777,0.00093875575,0.000073672185,0.000098774144,0.000047883364,0.00022520342,0.0000085867505,0.0014960916,0.98775905,0.008522123,0.00009825038],"about_ca_topic_score_codex":0.0000029264772,"about_ca_topic_score_gemma":0.000002699792,"teacher_disagreement_score":0.017357862,"about_ca_system_score_codex":0.000057237692,"about_ca_system_score_gemma":0.0001266766,"threshold_uncertainty_score":0.46078956},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19017892,0.00018831826,0.058334373,0.0022427426,0.00008672199,0.004232642,0.000115050716,0.00025537235,0.7443659],"genre_scores_gemma":[0.95893854,0.00005486628,0.039433286,0.0002609943,0.000015052693,0.0005536256,0.000008178886,0.000032600798,0.00070284493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860424,0.00003845693,0.0006189381,0.00025401037,0.00024080202,0.00024355981],"domain_scores_gemma":[0.99740297,0.0014299592,0.00031080056,0.0007459544,0.000061648825,0.00004867488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008278615,0.0002467572,0.00049801276,0.00012795391,0.0002572819,0.00005145877,0.00033199196,0.000092950424,0.000028189028],"category_scores_gemma":[0.00010549204,0.00015645541,0.00012854813,0.00044050254,0.0008174558,0.00002834262,0.00012866284,0.0002078004,0.000008703653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008396263,0.0001791797,0.000006525578,0.00054668635,0.0001339085,2.9675675e-7,0.0016409981,0.000002504667,0.001062066,0.994953,0.0010406394,0.00035023515],"study_design_scores_gemma":[0.0013729307,0.000025522531,0.000008397707,0.00017076581,0.00021030854,0.0000024564833,0.002012326,0.0001836385,0.0028169125,0.9923565,0.0006863302,0.00015395279],"about_ca_topic_score_codex":0.0000029735888,"about_ca_topic_score_gemma":0.000006803196,"teacher_disagreement_score":0.7687596,"about_ca_system_score_codex":0.000013979121,"about_ca_system_score_gemma":0.00003983292,"threshold_uncertainty_score":0.6380067},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025845122,0.00008875825,0.9725154,0.00017708841,0.00061931653,0.00035861897,0.000010179718,0.00017352194,0.00021197386],"genre_scores_gemma":[0.89644116,0.000030530977,0.1028139,0.00022663503,0.00011543011,0.00022685828,5.5703083e-7,0.000016249733,0.00012867882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988775,0.000011494833,0.00020247724,0.00030759277,0.00014326924,0.00045764784],"domain_scores_gemma":[0.9988933,0.00065554795,0.000033055137,0.00023351908,0.00009034228,0.00009422684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056081754,0.00016077037,0.00017416725,0.00011490659,0.0009467088,0.000122004334,0.00018714207,0.00007133529,0.0000073354204],"category_scores_gemma":[0.00003950209,0.00015707294,0.000065045184,0.0013806572,0.00011137689,0.00010300212,0.0000029098137,0.00020091335,0.0000021388485],"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.000022964816,0.000046807356,0.0000042257507,0.00003978805,0.000039538558,6.434605e-7,0.00005840732,0.61306536,0.0006316692,0.3803935,0.00037582047,0.00532125],"study_design_scores_gemma":[0.00061489246,0.00010295171,0.000064644926,0.000508778,0.00014027744,0.000016939026,0.000057448247,0.38139766,0.0066077965,0.60689944,0.0030543944,0.00053480023],"about_ca_topic_score_codex":0.0000021196868,"about_ca_topic_score_gemma":0.000009183385,"teacher_disagreement_score":0.87059605,"about_ca_system_score_codex":0.000040237155,"about_ca_system_score_gemma":0.000063484425,"threshold_uncertainty_score":0.7281414},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9955938,0.000082733444,0.0017819926,0.00024738908,0.00084169686,0.00027606424,0.0000021214123,0.000010419243,0.0011638195],"genre_scores_gemma":[0.99807614,0.00001647246,0.0017899742,0.000014300086,0.00007848244,0.0000037016848,2.4628042e-7,0.00001585994,0.000004846094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824756,0.000111897316,0.0008770789,0.0001458311,0.0004482325,0.0001694144],"domain_scores_gemma":[0.9946206,0.003436705,0.0010602224,0.00026469232,0.0005479531,0.00006980463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012108102,0.00020831583,0.0006691286,0.000123962,0.00014147695,0.000052638716,0.0003416111,0.00011145456,0.000007829856],"category_scores_gemma":[0.0007949466,0.00013502901,0.00011396434,0.00042746478,0.0002811143,0.00006683997,0.00015088043,0.0003583795,1.4933735e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022994194,0.0007400759,0.00056572165,0.0003939175,0.00022302713,0.0000017573778,0.00082994526,0.0000040488626,0.0007554961,0.99582034,0.00015084542,0.00028488805],"study_design_scores_gemma":[0.0024098768,0.00031443927,0.00007116518,0.00084486423,0.00020305213,0.000025983984,0.00063053047,0.00042765198,0.008383594,0.98652774,0.000037906062,0.00012316642],"about_ca_topic_score_codex":0.000004398696,"about_ca_topic_score_gemma":2.148833e-7,"teacher_disagreement_score":0.009292566,"about_ca_system_score_codex":0.000017718705,"about_ca_system_score_gemma":0.00009227982,"threshold_uncertainty_score":0.5506323},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85739464,0.0000410761,0.13851337,0.0013183117,0.0003785993,0.00031929804,0.0000022166273,0.000019707559,0.0020127883],"genre_scores_gemma":[0.9969036,0.0000021928524,0.0023148686,0.00012290255,0.000021345248,0.000003595876,0.0000010053257,0.0000049373693,0.0006255244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900365,0.00015672133,0.00033124152,0.0001821847,0.00020379006,0.00012241717],"domain_scores_gemma":[0.9987894,0.00057998113,0.0002261262,0.00020901348,0.0001546266,0.000040839488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002253372,0.00007884225,0.00014032365,0.00023355256,0.0007452153,0.0001849269,0.00016393143,0.000022557368,0.0000053337576],"category_scores_gemma":[0.00026510438,0.000052875384,0.00006781422,0.00083857763,0.00014108402,0.00003927166,0.000038434962,0.00014121644,0.0000022605761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041542095,0.000052556923,0.00006546518,0.000026898071,0.00001683122,2.6856296e-7,0.00083130214,0.002478304,0.0009701967,0.9919006,0.0017465045,0.001869523],"study_design_scores_gemma":[0.00056034036,0.00004152655,0.00016514769,0.00035467223,0.00002336485,0.000006642529,0.00035409504,0.010117287,0.0017110625,0.98538435,0.0012185605,0.0000629505],"about_ca_topic_score_codex":0.0000011565148,"about_ca_topic_score_gemma":0.000006590484,"teacher_disagreement_score":0.13950899,"about_ca_system_score_codex":0.000022995016,"about_ca_system_score_gemma":0.000022886974,"threshold_uncertainty_score":0.57316685},"labels":[],"label_agreement":null},{"id":"W4414631951","doi":"10.61091/ars164-02","title":"Existentially closed critical Cayley graphs","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science","keywords":"Cayley graph; Vertex-transitive graph; Vertex (graph theory); Adjacency list; Chordal graph; Indifference graph; Graph; Symmetric graph","score_opus":0.025179444904508793,"score_gpt":0.3294265627726002,"score_spread":0.3042471178680914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414631951","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91465706,0.00009813047,0.0003527294,0.0014437042,0.0015139239,0.0003217243,0.000009338455,0.00027955475,0.08132384],"genre_scores_gemma":[0.9970713,0.000005678693,0.0013691963,0.00020854255,0.0000039494407,0.00007299434,0.0000044537887,0.000014064203,0.0012497732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906975,0.000085243664,0.00025133937,0.00023185025,0.00013451233,0.00022731225],"domain_scores_gemma":[0.9985954,0.00068260427,0.000037692225,0.000505188,0.00010991393,0.00006917971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002863187,0.00012686313,0.0001858515,0.00010033689,0.00022140484,0.000042699114,0.00028140275,0.00009460136,0.000087980094],"category_scores_gemma":[0.00046577246,0.00012762273,0.00012517144,0.00040625202,0.00014187675,0.00006312775,0.00006943251,0.00016752056,0.00006150835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010791107,0.00026310506,0.00027643234,0.000049364906,0.00003470353,0.0000035444027,0.000072961455,6.447881e-8,0.00075547444,0.9904474,0.007835887,0.00025025176],"study_design_scores_gemma":[0.00043901248,0.000021774427,0.00059943274,0.000037887352,0.00006580659,0.0000017943931,0.00006790969,0.000011776095,0.0022024387,0.9934619,0.002969373,0.000120912104],"about_ca_topic_score_codex":0.000005876061,"about_ca_topic_score_gemma":0.0000034625978,"teacher_disagreement_score":0.08241429,"about_ca_system_score_codex":0.000018285506,"about_ca_system_score_gemma":0.00004376165,"threshold_uncertainty_score":0.5204304},"labels":[],"label_agreement":null},{"id":"W4414643069","doi":"10.61091/ars164-07","title":"On maximum Zagreb connection indices for trees with fixed matching number","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Connection (principal bundle); Matching (statistics); Index (typography); Tree (set theory); Base (topology)","score_opus":0.016139074717204896,"score_gpt":0.2946702317796536,"score_spread":0.27853115706244874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414643069","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98956066,0.000006343471,0.00119296,0.0003068571,0.00038024833,0.000463261,0.0000073190727,0.00012991946,0.007952427],"genre_scores_gemma":[0.99757904,0.0000014891782,0.001342129,0.00012480145,0.0000053819685,0.00010287516,0.000010345769,0.000016884758,0.00081703695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993462,0.000038036687,0.00015490496,0.00019295607,0.00009236119,0.00017553984],"domain_scores_gemma":[0.9986508,0.0009080987,0.000092236194,0.00025987392,0.000054039516,0.0000349867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021620897,0.00012093498,0.00016323187,0.00006441084,0.00024805954,0.000039551778,0.00013483636,0.0000679197,0.000037355785],"category_scores_gemma":[0.000096548916,0.00010110238,0.00005723884,0.00023093613,0.000037666643,0.000069941816,0.000019120544,0.000105267565,0.000023511171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008276877,0.00018562916,0.00069298706,0.00004948446,0.00006039195,4.4865652e-7,0.00031508703,0.0000037239463,0.0001723516,0.99543667,0.0026505738,0.00034987569],"study_design_scores_gemma":[0.0009851896,0.00007847344,0.0008562116,0.00009128871,0.00005672542,0.0000016958974,0.0004138484,0.00001938164,0.0022347425,0.9940664,0.0010805886,0.000115409646],"about_ca_topic_score_codex":0.000011558237,"about_ca_topic_score_gemma":0.000024802037,"teacher_disagreement_score":0.008018391,"about_ca_system_score_codex":0.000040746534,"about_ca_system_score_gemma":0.000024529792,"threshold_uncertainty_score":0.41228354},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61002594,0.009958244,0.12035876,0.086886205,0.00030818736,0.004468043,0.000104942,0.001290939,0.16659877],"genre_scores_gemma":[0.9618173,0.0013347616,0.03586722,0.00035539005,0.0000196463,0.0002703394,0.00002668206,0.000018236788,0.00029039252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987224,0.0002699998,0.0004578857,0.00022744627,0.00012103382,0.00020123925],"domain_scores_gemma":[0.9953315,0.002772355,0.00007244598,0.0017035841,0.00006451353,0.000055592966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005294841,0.00017075705,0.00033744093,0.000077130826,0.00026006903,0.000029794019,0.0007801195,0.00010871758,0.000050097042],"category_scores_gemma":[0.0006735308,0.00014788618,0.00007245051,0.0006515227,0.000562611,0.00010050516,0.0004701422,0.00039657645,0.0000287309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047429503,0.0006985852,0.00025707146,0.00028609938,0.0000160436,2.9190713e-7,0.00016675808,1.910536e-7,0.0001216034,0.9957567,0.0019780823,0.0007138602],"study_design_scores_gemma":[0.00020130101,0.000015329368,0.00068620907,0.0006865821,0.000046703266,0.0000016533445,0.000101185935,0.0013823819,0.00023072118,0.99383825,0.0026659323,0.00014372694],"about_ca_topic_score_codex":0.0000028199704,"about_ca_topic_score_gemma":0.0000049291093,"teacher_disagreement_score":0.3517914,"about_ca_system_score_codex":0.000037797603,"about_ca_system_score_gemma":0.000026778212,"threshold_uncertainty_score":0.60306233},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9887514,0.0006621249,0.0014694178,0.0006339796,0.005391501,0.00094237487,0.000009172464,0.000032135405,0.0021078766],"genre_scores_gemma":[0.99748677,0.00022072406,0.0019074088,0.000049911807,0.00023985488,0.000008134459,0.0000013389772,0.00006600023,0.000019881134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99513143,0.00052899035,0.0024137395,0.00043705737,0.00090234564,0.00058642396],"domain_scores_gemma":[0.9886538,0.0055301404,0.0032997672,0.0007786827,0.0014664571,0.00027115742],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0032535032,0.0007165,0.0019231443,0.00045306273,0.00089815137,0.00034912897,0.0009481462,0.00045453137,0.000018451581],"category_scores_gemma":[0.00079070806,0.00051585847,0.00040044036,0.0017677841,0.00081122306,0.00023995052,0.00048380223,0.0013674247,0.0000013437467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003497472,0.0014042618,0.00055113446,0.0009930469,0.0011279124,0.000012044168,0.0026374673,0.000002192058,0.00089549244,0.98999643,0.0002646899,0.0017655931],"study_design_scores_gemma":[0.008092692,0.0009000745,0.000247712,0.0022398583,0.00151872,0.00019963256,0.00320516,0.0010487073,0.0020723531,0.97969913,0.0002973629,0.00047857114],"about_ca_topic_score_codex":0.000021411106,"about_ca_topic_score_gemma":0.000003146982,"teacher_disagreement_score":0.010297262,"about_ca_system_score_codex":0.000061820465,"about_ca_system_score_gemma":0.00040337903,"threshold_uncertainty_score":0.9997293},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015041447,0.0030722397,0.9213086,0.010974086,0.000693405,0.0048010023,0.0022525054,0.0001744634,0.041682277],"genre_scores_gemma":[0.9881098,0.00035768497,0.0052068634,0.00015848136,0.000067401204,0.0006452354,0.000022350501,0.00004867078,0.005383459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99566907,0.00028958428,0.0020855844,0.00050051877,0.0005666208,0.00088861],"domain_scores_gemma":[0.9889006,0.0062306738,0.00079887005,0.0024072945,0.0013860682,0.00027647332],"candidate_categories":["metaresearch","metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0025341513,0.0005289204,0.000978482,0.00084462075,0.0017566151,0.00026367366,0.001525081,0.0003382438,0.000066868735],"category_scores_gemma":[0.008929289,0.0004115095,0.0007012641,0.006564931,0.0008010404,0.0001126171,0.000577006,0.0005549095,0.00014321454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000422157,0.00062836177,0.00007267344,0.00046683813,0.0005574473,8.46143e-7,0.00070638035,0.00004266918,0.00025952325,0.986087,0.008338918,0.002797077],"study_design_scores_gemma":[0.0008052903,0.00009129081,0.00026871703,0.00076572306,0.0008491505,0.0000048858424,0.002054823,0.0027273535,0.0033410843,0.97048455,0.018231515,0.0003756059],"about_ca_topic_score_codex":0.000012864355,"about_ca_topic_score_gemma":0.000030323965,"teacher_disagreement_score":0.9730684,"about_ca_system_score_codex":0.00018485251,"about_ca_system_score_gemma":0.00040786646,"threshold_uncertainty_score":0.9998337},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07666118,0.0012215712,0.9194512,0.00009386176,0.00016305716,0.00055590324,0.000012895819,0.00011283549,0.0017274977],"genre_scores_gemma":[0.952034,0.0002738039,0.04720516,0.00001743667,0.000027205995,0.00012924304,0.0000059155545,0.00004986816,0.00025739422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809724,0.000040092113,0.00089251634,0.00040569177,0.00015765881,0.00040680668],"domain_scores_gemma":[0.9984748,0.0006955373,0.00016552229,0.0004155774,0.000121346486,0.00012722383],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061958865,0.0003812927,0.00064003764,0.00025403124,0.000121657846,0.00007539055,0.00019218987,0.00029249038,0.000031727464],"category_scores_gemma":[0.00015884402,0.00038424347,0.0001906788,0.0004890925,0.00014456273,0.00010130354,0.00011024433,0.00046028066,0.0000048642796],"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.000008858635,0.00015624416,0.0000011559459,0.0018662299,0.00015855183,6.814839e-7,0.000645036,0.38973376,0.00073395664,0.60615,0.00003938945,0.00050614483],"study_design_scores_gemma":[0.0001758679,0.00003836754,5.1620714e-7,0.002057296,0.00019491605,0.000004326266,0.00012157384,0.5734316,0.0022906775,0.42137578,0.00012937195,0.00017969217],"about_ca_topic_score_codex":0.000005367756,"about_ca_topic_score_gemma":2.8784794e-7,"teacher_disagreement_score":0.87537277,"about_ca_system_score_codex":0.000037731195,"about_ca_system_score_gemma":0.000021192049,"threshold_uncertainty_score":0.99986094},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78304577,0.00038600157,0.0551448,0.0007950427,0.000097686105,0.0012578819,0.00013355064,0.0005289299,0.15861033],"genre_scores_gemma":[0.94047934,0.000027051614,0.050032604,0.00010219162,0.0000612174,0.00030003805,0.00004937986,0.00008492408,0.008863246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845856,0.00004265421,0.00048223848,0.00034512012,0.0003040053,0.00036739997],"domain_scores_gemma":[0.9980341,0.0006136311,0.00024341358,0.0009168174,0.00009441598,0.00009758379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032766553,0.00032246983,0.0004069439,0.00012501435,0.00044523648,0.000082688886,0.0004627325,0.000104186154,0.00027256671],"category_scores_gemma":[0.00017493044,0.00023454354,0.00012376832,0.0006459724,0.00021201106,0.00010606363,0.00017918443,0.0001664685,0.000107973756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020570462,0.00019479351,0.0020005861,0.00062140345,0.0001167099,0.000006490165,0.00066635985,0.0000029659222,0.00018217406,0.99317807,0.0024259537,0.00058395293],"study_design_scores_gemma":[0.00038559618,0.000045484234,0.00086325593,0.00037843452,0.00028317294,0.000018096523,0.0006761957,0.00059331284,0.0016313144,0.99276286,0.0020221614,0.0003401126],"about_ca_topic_score_codex":0.000007669616,"about_ca_topic_score_gemma":0.00024688235,"teacher_disagreement_score":0.15743357,"about_ca_system_score_codex":0.00005949889,"about_ca_system_score_gemma":0.000049786617,"threshold_uncertainty_score":0.9564408},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9460015,0.00029309074,0.00069779356,0.0027409391,0.0007982073,0.0006118168,0.00007197926,0.00021169969,0.048572946],"genre_scores_gemma":[0.97705185,0.00010930751,0.0010060587,0.00022048909,0.0003558474,0.00035341753,0.000018722749,0.000024270457,0.020860061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989411,0.00009309154,0.00030886065,0.00031414564,0.00011297345,0.00022978704],"domain_scores_gemma":[0.99764454,0.0008468505,0.00017063155,0.0012252626,0.00006312031,0.000049574417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004122997,0.00020596913,0.00022053893,0.000045973586,0.0004033183,0.000051387746,0.00077408704,0.00022065574,0.0000533989],"category_scores_gemma":[0.00028893154,0.00014877174,0.00021317283,0.0001155715,0.00013241096,0.000018800103,0.00066216104,0.0006145429,0.00016332841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030075757,0.00012851313,0.015307615,0.00016369019,0.00022158037,0.0000024609726,0.0003843113,0.000005565375,0.00018245137,0.9244213,0.054775752,0.0043766764],"study_design_scores_gemma":[0.00017788411,0.000008492649,0.012380778,0.00011310311,0.00014857626,0.0000017510511,0.00011390429,0.000024843343,0.0014013931,0.89743626,0.087932475,0.0002605243],"about_ca_topic_score_codex":0.000020792784,"about_ca_topic_score_gemma":0.00005672544,"teacher_disagreement_score":0.033156723,"about_ca_system_score_codex":0.000031437703,"about_ca_system_score_gemma":0.00011426031,"threshold_uncertainty_score":0.60667354},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95063543,0.00013183655,0.04823346,0.00016304282,0.000028430553,0.00063733547,0.00005626189,0.000054824384,0.000059355934],"genre_scores_gemma":[0.9906109,0.000032379292,0.008687991,0.000016544142,0.000024148669,0.00057384087,0.000033248318,0.000008758347,0.000012172957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931717,0.000019863677,0.00030060267,0.0001664736,0.000081112375,0.00011479699],"domain_scores_gemma":[0.99895704,0.00056099735,0.00015302096,0.00020042578,0.00010133106,0.000027166792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012247496,0.00010529451,0.00021082193,0.00011834163,0.00009118054,0.000009021823,0.00012226216,0.0000728395,9.578578e-7],"category_scores_gemma":[0.00015418211,0.0000964132,0.000052257583,0.00028704703,0.00009512937,0.000119590484,0.000039018545,0.00006382616,2.0372445e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002045641,0.000044451426,0.00022119861,0.00015564376,0.00003531591,3.4069952e-8,0.00040664038,0.000092271286,0.25890324,0.73794633,0.000021150368,0.0021532883],"study_design_scores_gemma":[0.00042197268,0.00005705378,0.0014059442,0.000048076014,0.00005400055,7.570305e-7,0.0006154929,0.00041182127,0.4543552,0.54243803,0.00008789609,0.000103782084],"about_ca_topic_score_codex":7.602795e-7,"about_ca_topic_score_gemma":0.000002724588,"teacher_disagreement_score":0.1955083,"about_ca_system_score_codex":0.000009825885,"about_ca_system_score_gemma":0.000017272389,"threshold_uncertainty_score":0.3931616},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23795472,0.00006361841,0.75584656,0.0005311141,0.000015178118,0.00038863515,0.000013061946,0.000031457887,0.0051556295],"genre_scores_gemma":[0.8872154,0.000010468239,0.11252472,0.000044232995,0.000005354997,0.00008625828,4.3797442e-7,0.0000055512924,0.00010762679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992453,0.0000071353325,0.00027061845,0.00018777193,0.00015508778,0.00013412091],"domain_scores_gemma":[0.99909675,0.00046282902,0.00008940851,0.00026915292,0.000010200253,0.000071670445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043506784,0.000107265194,0.0002726054,0.00038320757,0.000104898514,0.000026655282,0.0002223465,0.000032815493,0.000005386009],"category_scores_gemma":[0.000040837353,0.000073114534,0.000037334932,0.0022011755,0.000117995456,0.000016263833,0.00006161458,0.000059785463,1.0546611e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041289018,0.000045008957,0.000046829264,0.00015145405,0.00005948448,8.299379e-8,0.0013010647,0.0117188785,0.0013867244,0.9850308,0.000016269169,0.00023927775],"study_design_scores_gemma":[0.00044326275,0.00004980399,0.0005272818,0.00014811665,0.0004519571,0.0000036586353,0.0020363615,0.053852964,0.0035897966,0.93759423,0.0010645932,0.00023797757],"about_ca_topic_score_codex":0.000026550912,"about_ca_topic_score_gemma":0.00004351274,"teacher_disagreement_score":0.64926064,"about_ca_system_score_codex":0.000021110254,"about_ca_system_score_gemma":0.00006346057,"threshold_uncertainty_score":0.29815242},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49164638,0.001323576,0.50356007,0.0016931879,0.000095141855,0.000186727,0.00008670257,0.000006066111,0.0014021539],"genre_scores_gemma":[0.98826206,0.0017418022,0.009484426,0.00016954863,0.00020802389,0.000016361404,0.000008652138,0.000009015448,0.00010013364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973032,0.0001036828,0.0015921211,0.00027432616,0.0005566071,0.00017007183],"domain_scores_gemma":[0.99623334,0.00053054414,0.0013848492,0.00031175732,0.001434324,0.000105155355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094046636,0.00020790065,0.00069919304,0.0013117116,0.00021505292,0.00011070505,0.0007411668,0.0001482959,0.00019105952],"category_scores_gemma":[0.000111645786,0.00018318104,0.0006445177,0.0015804627,0.00031745675,0.00019610363,0.00016860478,0.0003088664,0.0000014757461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008467065,0.00085345254,0.0067105107,0.00006919018,0.008932435,0.0000020640196,0.0006243822,0.017146317,0.0020592173,0.9565559,0.000036002064,0.0069258665],"study_design_scores_gemma":[0.0009239469,0.000057846948,0.0015464694,0.00034171893,0.011414043,0.000024882402,0.0036718622,0.20813891,0.0019429246,0.7697846,0.0018310533,0.00032171243],"about_ca_topic_score_codex":0.00006351461,"about_ca_topic_score_gemma":0.000013089747,"teacher_disagreement_score":0.49661568,"about_ca_system_score_codex":0.000073828094,"about_ca_system_score_gemma":0.00016943103,"threshold_uncertainty_score":0.74699056},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9351335,0.0006887206,0.00023772282,0.00008576453,0.00022502903,0.0012784573,0.00008943891,0.0000043811165,0.06225694],"genre_scores_gemma":[0.6868961,0.0015343133,0.12971225,0.00004288379,0.00016113352,0.00043080776,0.001785759,0.00015002955,0.17928676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998209,0.00018672185,0.0005499001,0.00052870286,0.00019504648,0.00033062615],"domain_scores_gemma":[0.9982071,0.00043927957,0.00039485106,0.000607703,0.00020142943,0.00014964932],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00040077145,0.0003886968,0.00048954046,0.0001434554,0.00084618817,0.00016933362,0.00073529285,0.00043931958,0.0043984437],"category_scores_gemma":[0.00015746635,0.0003886748,0.00022293092,0.0004520763,0.00026865752,0.00026477387,0.000112450885,0.00035951755,0.0024306395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041381863,0.0030476637,0.0015127086,0.0007729713,0.00066428224,0.00011392878,0.0824969,0.00004519331,0.04210803,0.4982279,0.005697699,0.36489892],"study_design_scores_gemma":[0.0009849697,0.00021451077,0.0027025198,0.0019154637,0.0006644981,0.00012623901,0.011085112,0.0001341815,0.19542533,0.6585526,0.1268831,0.0013115071],"about_ca_topic_score_codex":0.0001351534,"about_ca_topic_score_gemma":0.0008325761,"teacher_disagreement_score":0.3635874,"about_ca_system_score_codex":0.00004357066,"about_ca_system_score_gemma":0.00015047837,"threshold_uncertainty_score":0.99985653},"labels":[],"label_agreement":null},{"id":"W62939430","doi":"","title":"Minor clique free extremal graphs","year":2004,"lang":"fr","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Contractible space; Graph; Clique; Block graph; Split graph; Discrete mathematics; Pathwidth; Line graph","score_opus":0.022213531092072424,"score_gpt":0.26927344698587985,"score_spread":0.24705991589380744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W62939430","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95933986,0.0027365254,0.000224576,0.0062062857,0.004245752,0.00068220077,0.000089452966,0.00019778228,0.026277572],"genre_scores_gemma":[0.986795,0.00014285353,0.005059219,0.00022006549,0.000037788646,0.00012632273,0.000015438165,0.000074120566,0.0075291935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980148,0.00014999631,0.00052148715,0.0004481738,0.00027913004,0.0005864128],"domain_scores_gemma":[0.9976187,0.00037743567,0.0002123691,0.0013890914,0.0001440472,0.00025835642],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00051280996,0.00035500203,0.00038536027,0.0001235129,0.00033279537,0.00007740029,0.0007437533,0.00035982468,0.0005618543],"category_scores_gemma":[0.00029431135,0.00039937804,0.00030635565,0.00061041076,0.00038490994,0.00022071805,0.00018630673,0.0004701549,0.0007928604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018071252,0.0013026419,0.00030684343,0.00016705849,0.00009760894,0.00005343286,0.00082283735,0.0000066339903,0.00044306688,0.9879248,0.008286473,0.0005704882],"study_design_scores_gemma":[0.0021054058,0.00014298815,0.00040912372,0.00020955384,0.00016437715,0.00008349321,0.00019379317,0.000007998087,0.004104052,0.97966385,0.012502141,0.00041321327],"about_ca_topic_score_codex":0.00011812084,"about_ca_topic_score_gemma":0.000035998863,"teacher_disagreement_score":0.027455145,"about_ca_system_score_codex":0.000115064286,"about_ca_system_score_gemma":0.00013538661,"threshold_uncertainty_score":0.99998516},"labels":[],"label_agreement":null},{"id":"W6738926","doi":"10.1016/0304-3940(84)90123-x","title":"Self-centered super graph of a graph and center number of a graph.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Windmill graph; Cubic graph; Butterfly graph; Graph; Combinatorics; Line graph; Voltage graph; Simplex graph; Discrete mathematics","score_opus":0.02317031662195031,"score_gpt":0.27043285598175565,"score_spread":0.24726253935980533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6738926","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9967583,0.000073228715,0.000024559486,0.00004884996,0.00016503659,0.00029764135,0.000036833517,0.000066999026,0.002528563],"genre_scores_gemma":[0.9977418,0.00017402366,0.0019326372,0.000026051146,0.000003047138,0.000035101744,0.000007635481,0.000025029105,0.000054660748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885863,0.00008655611,0.0004140647,0.00022707712,0.0002006502,0.00021302672],"domain_scores_gemma":[0.9989314,0.00019315562,0.0001799974,0.00046915768,0.00013586879,0.000090415226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019342461,0.00017469736,0.00035399772,0.00013070962,0.00010956438,0.0000059639115,0.00020724449,0.00009506184,0.000054032855],"category_scores_gemma":[0.00003668517,0.00016384259,0.00018555096,0.0004571211,0.00026169975,0.000097020566,0.00006824518,0.00012405173,0.0000069632342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027924314,0.0010072779,0.07037293,0.00013599842,0.00012299296,0.0000029672121,0.0012805512,3.3884554e-8,0.0007186034,0.92528665,0.0010257247,0.000018325383],"study_design_scores_gemma":[0.0015470266,0.00005556177,0.00510771,0.00004878202,0.00006128871,0.000046927933,0.00012279372,0.000002858853,0.003981664,0.9885009,0.0003746608,0.00014980431],"about_ca_topic_score_codex":0.000014086333,"about_ca_topic_score_gemma":0.0000027843066,"teacher_disagreement_score":0.06526522,"about_ca_system_score_codex":0.0000063600874,"about_ca_system_score_gemma":0.000016333262,"threshold_uncertainty_score":0.6681307},"labels":[],"label_agreement":null},{"id":"W68092451","doi":"","title":"Generalized Fibonacci polynomial of graph.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Mathematics; Combinatorics; Graph; Fibonacci polynomials; Discrete mathematics; Orthogonal polynomials; Difference polynomials","score_opus":0.02513507556700114,"score_gpt":0.2826466010507899,"score_spread":0.2575115254837888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W68092451","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.988066,0.000065484695,0.000033424254,0.00005172874,0.00038210952,0.0001717352,0.000006393947,0.000051337698,0.011171744],"genre_scores_gemma":[0.9967795,0.000009093722,0.002726082,0.000031710533,0.0000035161895,0.00003164337,0.0000029910482,0.000016714699,0.00039873432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924165,0.00009942544,0.0002472142,0.00014006955,0.00011582576,0.00015582626],"domain_scores_gemma":[0.99919355,0.00019806565,0.0001141914,0.0003820158,0.00005544318,0.000056713867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028191612,0.000102847815,0.000194145,0.000064104555,0.0000797078,0.000008001781,0.00015796478,0.00006551689,0.00016430124],"category_scores_gemma":[0.00014970309,0.0000992228,0.000112154186,0.00026362657,0.0000636156,0.000043073745,0.000017980912,0.00007924871,0.000018374607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008855402,0.00016784675,0.0005232797,0.000013935539,0.000025954489,5.572424e-7,0.00010436787,4.4437263e-7,0.003443952,0.9888276,0.006832685,0.000050506904],"study_design_scores_gemma":[0.00075062574,0.000027910319,0.00017604478,0.0000072886146,0.000026515198,0.0000029378036,0.00003533378,0.0000023591367,0.03142031,0.9628832,0.0045655877,0.000101925565],"about_ca_topic_score_codex":0.0000073023816,"about_ca_topic_score_gemma":0.0000015723783,"teacher_disagreement_score":0.027976358,"about_ca_system_score_codex":0.000009649938,"about_ca_system_score_gemma":0.000025909829,"threshold_uncertainty_score":0.40461883},"labels":[],"label_agreement":null},{"id":"W68153034","doi":"","title":"Szeged Index of armchair polyhex Nanotube.","year":2008,"lang":"hu","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Topological index; Nanotube; Molecular graph; Index (typography); Graph; Mathematics; Bond graph; Combinatorics; Materials science; Nanotechnology; Carbon nanotube; Computer science","score_opus":0.02537950164128944,"score_gpt":0.2624510424169788,"score_spread":0.23707154077568937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W68153034","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.988042,0.00051962613,0.00007033,0.00031315332,0.0012357959,0.00055315136,0.000049868202,0.0001173967,0.009098659],"genre_scores_gemma":[0.99679947,0.00017945083,0.0002864874,0.00008136433,0.000021247148,0.00004933149,0.000012010613,0.00006566642,0.0025049935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976998,0.00019442884,0.0007843529,0.00040698028,0.00044416255,0.0004702746],"domain_scores_gemma":[0.99741316,0.00055380363,0.0004651081,0.0011418911,0.00022994883,0.000196113],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004417247,0.00035616383,0.0006270406,0.00018746371,0.00040196985,0.000016666989,0.00060189876,0.00030953097,0.00039248107],"category_scores_gemma":[0.00021986432,0.00037766498,0.00030272626,0.0007532018,0.00049932714,0.00013303607,0.00016191431,0.00041234543,0.0002860919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049979946,0.0012331562,0.004603282,0.00015373225,0.0001497938,0.000015729187,0.0022660012,0.0000026069906,0.0025564013,0.9827332,0.0060210554,0.00021507812],"study_design_scores_gemma":[0.0015405783,0.00015496234,0.0041156705,0.0001214997,0.00010020617,0.00003676183,0.00035120017,0.00009944314,0.017944,0.97264194,0.0025211915,0.00037254748],"about_ca_topic_score_codex":0.00004603767,"about_ca_topic_score_gemma":0.0000038790217,"teacher_disagreement_score":0.015387599,"about_ca_system_score_codex":0.000050422073,"about_ca_system_score_gemma":0.00016426577,"threshold_uncertainty_score":0.9998675},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.941028,0.000056935092,0.0017881908,0.0019090077,0.000073722884,0.0004987418,0.00001534222,0.000080394784,0.05454967],"genre_scores_gemma":[0.9961864,0.0000030879835,0.0019935938,0.00027802386,0.00006784327,0.0002019501,0.00001670861,0.000016374543,0.0012360432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908704,0.000058901314,0.00015974288,0.00015888446,0.0003503343,0.0001850909],"domain_scores_gemma":[0.9991439,0.00017091125,0.00007466396,0.0004895342,0.00008356266,0.00003741672],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009586137,0.00009076939,0.00008165248,0.000023795003,0.00035978778,0.000041035397,0.00019983406,0.00005269748,0.001357732],"category_scores_gemma":[0.00024867704,0.000063034786,0.00007702015,0.00013928638,0.00011487015,0.00007237252,0.00006500823,0.00009512519,0.00022920629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010722262,0.0000793886,0.000093741175,0.0000102316735,0.000014021978,7.120479e-7,0.0011658,0.000023365877,0.025586404,0.96619964,0.0032759558,0.0035400065],"study_design_scores_gemma":[0.00047492704,0.000018988672,0.0005344372,0.000010320996,0.000037627575,0.000008072834,0.00044056098,0.00009125439,0.011113043,0.9840738,0.003112935,0.00008401106],"about_ca_topic_score_codex":0.0000067788033,"about_ca_topic_score_gemma":0.00013080901,"teacher_disagreement_score":0.055158384,"about_ca_system_score_codex":0.00009984119,"about_ca_system_score_gemma":0.000025647314,"threshold_uncertainty_score":0.9995552},"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":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000836262,0.000085347456,0.00028477475,0.00019465592,0.00095615775,0.0007523518,0.9948356,0.00020005534,0.001854763],"genre_scores_gemma":[0.00006146128,0.00017382608,0.0028438936,0.000047820497,0.0007188249,0.000008221819,0.98755115,0.00005673106,0.008538085],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9914777,0.004470011,0.0006615545,0.0016504289,0.0010222686,0.0007180324],"domain_scores_gemma":[0.98671913,0.0053545716,0.000902181,0.0058932104,0.0007006783,0.0004302477],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0044486793,0.00068867253,0.00086388655,0.0005810961,0.0012388608,0.0001546096,0.005003581,0.0007102464,0.00040816245],"category_scores_gemma":[0.0021944253,0.00072215573,0.0002581492,0.0007649134,0.001623511,0.0008624061,0.0025446804,0.0014515871,0.0008248209],"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.00017951822,0.0004774103,0.0000020878485,0.0003531156,0.0006103125,0.0002461659,0.0027062737,9.666119e-8,0.000066196895,0.01380794,0.9815304,0.00002042554],"study_design_scores_gemma":[0.00059604255,0.00013148086,0.000010088199,0.0002090961,0.0005088224,0.000029589022,0.010019517,0.000006742479,0.00007087359,0.01712527,0.9705071,0.00078536564],"about_ca_topic_score_codex":0.0012447312,"about_ca_topic_score_gemma":0.0004784352,"teacher_disagreement_score":0.011023344,"about_ca_system_score_codex":0.00035194485,"about_ca_system_score_gemma":0.0005407091,"threshold_uncertainty_score":0.99995315},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038531123,0.00007157916,0.0003874691,0.00070916914,0.00018233605,0.0003842199,0.00047737543,0.0001548802,0.99724764],"genre_scores_gemma":[0.23727563,0.00019882599,0.001148031,0.0002364528,0.0011687605,5.952366e-7,0.0013264931,0.011883582,0.7467616],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99887395,0.000105743915,0.00017775879,0.00033213393,0.00024887006,0.00026155528],"domain_scores_gemma":[0.9989946,0.000021967926,0.00011968102,0.0006030463,0.00014069668,0.00012004339],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00073142257,0.00011832234,0.00012278264,0.0005025354,0.0008252837,0.00026084337,0.001098429,0.00008139511,0.047146935],"category_scores_gemma":[0.00032960405,0.000098732395,0.000047025023,0.00079235237,0.00067710073,0.00006114283,0.0003334226,0.000258991,0.019356346],"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.0000023835523,0.000025063182,5.2939164e-8,0.0000703633,0.000021751248,0.000001881584,0.00034011796,5.4964244e-7,0.0007322563,0.18546672,0.810831,0.0025078603],"study_design_scores_gemma":[0.000063357744,0.00003019834,0.00000842878,0.000100244164,0.000026040792,0.00003111548,0.00014209769,0.000010910232,0.00016796168,0.03262254,0.9667002,0.00009690351],"about_ca_topic_score_codex":0.00038506,"about_ca_topic_score_gemma":0.000108418746,"teacher_disagreement_score":0.25048605,"about_ca_system_score_codex":0.00007467943,"about_ca_system_score_gemma":0.000013601121,"threshold_uncertainty_score":0.9814072},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000658151,0.00039399645,0.0063733794,0.00079433114,0.00052507035,0.0022745144,0.0039028595,0.0028454293,0.9822323],"genre_scores_gemma":[0.010241441,0.00045893187,0.0023788975,0.0002592214,0.0010778871,0.000002723338,0.0047667595,0.02005807,0.96075606],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.996508,0.00045192742,0.000713679,0.0010780648,0.00060094055,0.00064737623],"domain_scores_gemma":[0.9970776,0.00013620371,0.00043910102,0.0014830157,0.00057124055,0.0002928453],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0017314297,0.00050632306,0.0005632068,0.0005034462,0.0010104498,0.0009644674,0.0016516031,0.00033672783,0.041515365],"category_scores_gemma":[0.0010632548,0.0005220105,0.0002477793,0.00082777924,0.0003399054,0.00014997157,0.0010684396,0.0006499958,0.045300998],"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.000043210264,0.0001974537,0.0000013139888,0.0007951297,0.00015780893,0.000009329111,0.00034090487,0.0000014334107,0.0003475447,0.24743684,0.74805486,0.002614168],"study_design_scores_gemma":[0.00046975157,0.00014366487,0.000015584239,0.00030290772,0.00014418531,0.000054109667,0.00019671296,0.000040091505,0.00012226959,0.023545763,0.97442293,0.00054204976],"about_ca_topic_score_codex":0.00003876551,"about_ca_topic_score_gemma":0.0000072069765,"teacher_disagreement_score":0.22636805,"about_ca_system_score_codex":0.00013166334,"about_ca_system_score_gemma":0.000016300108,"threshold_uncertainty_score":0.99972314},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000611263,0.0005341102,0.001243129,0.00070419686,0.0002628711,0.00060190196,0.00031451706,0.0018679186,0.9944102],"genre_scores_gemma":[0.0009749026,0.0007104695,0.0008403486,0.00022037896,0.00039566244,1.6398533e-7,0.00077859964,0.013392001,0.9826875],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99839324,0.00018050217,0.00024939814,0.0005318749,0.0003259812,0.00031901122],"domain_scores_gemma":[0.99876976,0.000028339797,0.00015821686,0.0008042431,0.00012033849,0.000119083365],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005068933,0.00023571079,0.00022136026,0.0003889452,0.00068423647,0.0014095049,0.0010178479,0.00017443966,0.26096338],"category_scores_gemma":[0.00015331943,0.00024005769,0.00010778095,0.0005329132,0.00014894862,0.00014755757,0.00094490236,0.00041583105,0.1923908],"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.0000035634494,0.00004483209,2.1439341e-8,0.0002467448,0.00007255669,0.000005698907,0.00047146392,8.825719e-8,0.000106845815,0.2754036,0.716406,0.0072385687],"study_design_scores_gemma":[0.000106050175,0.000027744161,4.540734e-7,0.000403001,0.000049491326,0.00003323401,0.00014888425,0.000010292767,0.00010130974,0.17293172,0.825985,0.00020280853],"about_ca_topic_score_codex":0.0000028498048,"about_ca_topic_score_gemma":2.3681491e-7,"teacher_disagreement_score":0.109579004,"about_ca_system_score_codex":0.000060802056,"about_ca_system_score_gemma":0.0000020300574,"threshold_uncertainty_score":0.9996271},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5095232,0.0001207306,0.047860283,0.0077913953,0.00027593828,0.001847755,0.00091590814,0.0050499733,0.4266148],"genre_scores_gemma":[0.9941101,0.000050482075,0.0009537655,0.00015266218,0.00016620656,1.5820538e-7,0.00011356671,0.0011762382,0.003276827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986826,0.00022896296,0.00022585118,0.00032006952,0.00022256303,0.00031994036],"domain_scores_gemma":[0.99873674,0.00009129036,0.00008395495,0.0005981025,0.00031939437,0.00017054476],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006076495,0.00012727632,0.00012840853,0.0001323619,0.0015654743,0.00026245753,0.00073054514,0.00006229865,0.01635292],"category_scores_gemma":[0.0008471185,0.00009805404,0.00006375964,0.00036085525,0.0001763534,0.00019095592,0.0004619195,0.00012883112,0.012668704],"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.000030086243,0.00012616567,0.0000028186703,0.000024543402,0.000033916684,0.0000028547825,0.00039272607,2.502464e-7,0.034945298,0.69952124,0.20335846,0.061561637],"study_design_scores_gemma":[0.0004576182,0.00006315189,0.0001182864,0.000025848169,0.0000143236475,0.000047166002,0.00008673566,0.000005663754,0.004455592,0.087912634,0.9066597,0.00015323171],"about_ca_topic_score_codex":0.000001869976,"about_ca_topic_score_gemma":1.3444443e-7,"teacher_disagreement_score":0.7033013,"about_ca_system_score_codex":0.00006785228,"about_ca_system_score_gemma":0.0000026255432,"threshold_uncertainty_score":0.99973434},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003665409,0.00010057954,0.024902072,0.00020896483,0.00024826798,0.0007326732,0.0005833849,0.006592632,0.96659476],"genre_scores_gemma":[0.0004954916,0.00029888493,0.029015332,0.00009082477,0.0006077462,6.4996436e-7,0.0021744661,0.044545885,0.92277074],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99767256,0.0007774217,0.00029747252,0.0005552496,0.0003008645,0.00039644065],"domain_scores_gemma":[0.99819887,0.00019652468,0.00022926171,0.0010184031,0.00018626796,0.00017068826],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014767655,0.00025021474,0.00030067153,0.0004605923,0.0011348187,0.00033963495,0.0012193817,0.00020970772,0.0650366],"category_scores_gemma":[0.0013001735,0.00026200528,0.000114712435,0.00086434867,0.00018079136,0.000060126473,0.0009987876,0.0003820903,0.03077392],"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.00000459937,0.00005990963,3.5804078e-8,0.00008280221,0.00006747843,0.0000032103198,0.0001522156,3.4706508e-7,0.00020409911,0.2694062,0.6872353,0.042783786],"study_design_scores_gemma":[0.00019602409,0.000042114756,0.0000073445112,0.000076831886,0.000046230907,0.000021195445,0.00017246995,0.000018242612,0.00011984624,0.055982254,0.9430664,0.0002510048],"about_ca_topic_score_codex":0.000049925635,"about_ca_topic_score_gemma":0.0000040944096,"teacher_disagreement_score":0.25583112,"about_ca_system_score_codex":0.000072639654,"about_ca_system_score_gemma":0.0000032803287,"threshold_uncertainty_score":0.9999832},"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":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039935822,0.000015597694,8.6380163e-7,0.00010015462,0.00028671464,0.0002848123,0.99863946,0.00010886833,0.00016414856],"genre_scores_gemma":[0.000021041356,0.0000868824,0.00017998202,0.000032417105,0.00028317244,0.00020035253,0.9974336,0.00005873102,0.0017038002],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986617,0.00013427313,0.00022898108,0.0003453773,0.00020583638,0.0004238421],"domain_scores_gemma":[0.99717903,0.0011469137,0.00013870181,0.0011515067,0.00009029296,0.00029355797],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044140444,0.00026598747,0.0003011882,0.0002445121,0.00027101053,0.00014136586,0.00052108616,0.0003320892,0.00049888715],"category_scores_gemma":[0.0009926825,0.00027496536,0.00011924916,0.00031730547,0.000040229897,0.0000892546,0.00005468869,0.00035127642,0.00058699155],"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.0000024097797,0.000023415214,0.0001459588,0.000031304982,0.000045718447,0.00001729836,0.00004079484,7.27046e-7,3.784226e-7,0.0005304197,0.9990746,0.00008699412],"study_design_scores_gemma":[0.000064168,0.000008768382,0.02904708,0.00009199381,0.000065196444,0.0000028735933,0.000096010146,0.0000016302855,0.0000046489777,0.005245201,0.96506053,0.00031187094],"about_ca_topic_score_codex":0.985604,"about_ca_topic_score_gemma":0.9758964,"teacher_disagreement_score":0.03401402,"about_ca_system_score_codex":0.00015256774,"about_ca_system_score_gemma":0.00018690816,"threshold_uncertainty_score":0.99997026},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47809947,0.0004409169,0.14795764,0.0866501,0.002255262,0.008115669,0.00033048246,0.0012290241,0.27492145],"genre_scores_gemma":[0.7232688,0.000059359492,0.26037273,0.00783503,0.00022913245,0.004108985,0.00029294606,0.00006368728,0.0037693218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980907,0.00031986146,0.00057262974,0.0004207361,0.00024280822,0.00035327533],"domain_scores_gemma":[0.9981602,0.0007469847,0.00021038794,0.0005607346,0.0001718533,0.00014986328],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00073016656,0.0002439113,0.00033505788,0.00021566343,0.0002398054,0.00012140781,0.00037924715,0.00013551599,0.0074551264],"category_scores_gemma":[0.00034811642,0.00023514962,0.000119686796,0.0005543513,0.00011668326,0.0063304408,0.00008710169,0.00024064448,0.0015868939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001365239,0.00025812307,0.000052912925,0.000023352397,0.000015388947,0.0000024821147,0.00007654444,0.000024222936,0.0061887647,0.9725905,0.0059800562,0.014773972],"study_design_scores_gemma":[0.0008935871,0.000065678505,0.016812775,0.00008770863,0.000025738209,0.0000133820595,0.0003902123,0.00015972981,0.012350912,0.9463243,0.02251829,0.00035768803],"about_ca_topic_score_codex":0.000026741893,"about_ca_topic_score_gemma":0.00036896046,"teacher_disagreement_score":0.27115214,"about_ca_system_score_codex":0.000066538065,"about_ca_system_score_gemma":0.000035475907,"threshold_uncertainty_score":0.9991905},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9914321,0.000047674665,0.003932951,0.0012889432,0.00019540376,0.000394824,0.0008259094,0.000116657895,0.0017655443],"genre_scores_gemma":[0.93607444,0.000031174906,0.057560187,0.0021850767,0.000055098568,0.000057347876,0.0025398533,0.0000624511,0.0014343787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974831,0.00060576206,0.0004675694,0.00079424935,0.00019954836,0.00044982161],"domain_scores_gemma":[0.9941049,0.0022430862,0.00025880663,0.003095538,0.00016370961,0.00013396425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025416433,0.00024003178,0.00033565908,0.00007639892,0.00034238287,0.000012630306,0.0010427767,0.00016307342,0.00039203788],"category_scores_gemma":[0.0018810901,0.000239859,0.00004114105,0.0005174066,0.00032220813,0.00013319985,0.00088270375,0.00029674484,0.0003876739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013013066,0.00028671738,0.036637023,0.00012739046,0.00015309585,0.00019502226,0.0009784464,0.000027828744,0.0014915967,0.9509302,0.008844001,0.00019860023],"study_design_scores_gemma":[0.0012070711,0.000089118796,0.05712594,0.000063639236,0.00013255671,0.001711564,0.00010976611,0.000533563,0.0028518937,0.7407398,0.19474557,0.00068948785],"about_ca_topic_score_codex":0.0012501283,"about_ca_topic_score_gemma":0.018875483,"teacher_disagreement_score":0.21019031,"about_ca_system_score_codex":0.000035438785,"about_ca_system_score_gemma":0.00012397968,"threshold_uncertainty_score":0.9990275},"labels":[],"label_agreement":null},{"id":"W69622806","doi":"","title":"Remarks on a general model of a random digraph.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Mathematics; Combinatorics","score_opus":0.03522067822346185,"score_gpt":0.2683219233748625,"score_spread":0.23310124515140063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W69622806","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97425175,0.000040302235,0.00025513142,0.00014828905,0.000122287,0.00023898398,0.00001028392,0.000062442814,0.024870541],"genre_scores_gemma":[0.9969728,0.000021064723,0.0017765269,0.00006136285,0.0000041818325,0.00005327644,0.0000019003469,0.000016994934,0.0010918842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992604,0.000051606814,0.00023207784,0.00015426548,0.00015451228,0.00014710156],"domain_scores_gemma":[0.99910754,0.0002498943,0.000102089194,0.0004392089,0.000047499325,0.000053763317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020014904,0.00010997839,0.00021075028,0.00007236064,0.00007671367,0.00000853332,0.00017947487,0.00006510537,0.000078756246],"category_scores_gemma":[0.0000936611,0.00009875008,0.000128237,0.00019318958,0.000060243972,0.000040077175,0.00002324844,0.00011089525,0.000023062748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030890402,0.00037842928,0.000048950966,0.000016957769,0.000025635174,5.851275e-7,0.0002932684,0.000044883916,0.0013194071,0.99128354,0.0063672853,0.000190181],"study_design_scores_gemma":[0.0015046179,0.000048342317,0.00001820134,0.000022170627,0.000028001275,0.0000010948243,0.000012794181,0.014705301,0.0027959743,0.9806081,0.00015422521,0.00010118309],"about_ca_topic_score_codex":0.0000023103248,"about_ca_topic_score_gemma":7.6495013e-7,"teacher_disagreement_score":0.023778656,"about_ca_system_score_codex":0.000009282663,"about_ca_system_score_gemma":0.0000052000028,"threshold_uncertainty_score":0.40269116},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9711621,0.00026552912,0.0066969274,0.00043619674,0.00058261724,0.0021141223,0.0020288655,0.0003347984,0.016378881],"genre_scores_gemma":[0.9966993,0.000042567783,0.0020488235,0.0004957032,0.000055907723,0.00020361278,0.00017293295,0.000064204694,0.00021698674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976916,0.0000783018,0.0010649737,0.00024896045,0.0004334412,0.00048275138],"domain_scores_gemma":[0.9970312,0.0013301413,0.00032269617,0.0009916311,0.00017864343,0.00014565547],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000979643,0.0003954062,0.0004716132,0.00044400682,0.0003543526,0.00024973112,0.0007209658,0.00021637374,0.00028396494],"category_scores_gemma":[0.0002663666,0.0002538551,0.00041018592,0.0009514685,0.0003951003,0.00044728394,0.00010380567,0.0005158419,0.00009846505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053307216,0.0002881761,0.00009038512,0.0006722932,0.0002254746,0.0000020023242,0.004293298,0.000009417592,0.00019126914,0.98663414,0.0058518597,0.001688359],"study_design_scores_gemma":[0.0012362663,0.00061744195,0.000096792726,0.0005884569,0.00025448616,0.000067945635,0.0036780194,0.0056935507,0.007640453,0.9434198,0.036086675,0.00062007393],"about_ca_topic_score_codex":0.0000056515732,"about_ca_topic_score_gemma":0.000007370859,"teacher_disagreement_score":0.043214317,"about_ca_system_score_codex":0.000043551598,"about_ca_system_score_gemma":0.00007453736,"threshold_uncertainty_score":0.99999136},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73024094,0.00008029096,7.8057957e-7,0.000016313643,0.0008320302,0.00089765125,0.00063406694,0.0006057425,0.2666922],"genre_scores_gemma":[0.9679769,0.00010225542,0.0023493913,0.00026015053,0.00007662023,0.0005998042,0.0013393373,0.0003812263,0.02691426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99547327,0.00048430398,0.0011650035,0.0012412645,0.00079101435,0.00084512297],"domain_scores_gemma":[0.99564326,0.00085816905,0.0009124915,0.0017578936,0.00040307775,0.0004251091],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014424734,0.0009883808,0.001041827,0.0005693037,0.0016338615,0.00011038661,0.0012100745,0.0011280894,0.00065724255],"category_scores_gemma":[0.0011066706,0.0010295863,0.0007883937,0.00079937617,0.00010376553,0.0003633523,0.00010892767,0.0018442072,0.0011185375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073394236,0.00025945785,0.00000470663,0.0004474333,0.00019419343,0.000010223652,0.000008022318,0.0000010703219,0.00769933,0.96239614,0.00008383158,0.028822174],"study_design_scores_gemma":[0.00052428065,0.0000721254,0.00012661632,0.0003007517,0.00037653663,0.000014882636,0.00015443044,0.000003491806,0.02879648,0.86401397,0.10463203,0.00098438],"about_ca_topic_score_codex":0.00004833367,"about_ca_topic_score_gemma":0.0006142534,"teacher_disagreement_score":0.23977794,"about_ca_system_score_codex":0.00018798215,"about_ca_system_score_gemma":0.000033799723,"threshold_uncertainty_score":0.99966586},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65742177,0.11154406,0.039028946,0.1760463,0.00043483378,0.0009899059,0.006742102,0.0003945062,0.0073976004],"genre_scores_gemma":[0.77549374,0.050917152,0.020994866,0.0007947494,0.0023579763,0.00017639648,0.0010295147,0.00038561696,0.14785],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99473596,0.00090235064,0.0010591004,0.000758024,0.00061983435,0.0019247503],"domain_scores_gemma":[0.99523354,0.0011007471,0.0010236577,0.0008840594,0.00066151907,0.0010964636],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012307529,0.0009451994,0.0009769977,0.0005614564,0.011031194,0.00025093005,0.0010335887,0.0007675927,0.002204249],"category_scores_gemma":[0.00038969237,0.0011661702,0.0008856705,0.0010262671,0.001121563,0.00058311777,0.00039540452,0.0015210452,0.000013725394],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007891415,0.0007063765,0.0046660383,0.0002168167,0.00061464024,0.00203392,0.0011506608,0.006649136,0.0010773238,0.32746062,0.65055406,0.0047914986],"study_design_scores_gemma":[0.0014239703,0.00013239801,0.005262696,0.0006446624,0.0018078603,0.006260436,0.011244311,0.0018645744,0.0009045233,0.15806468,0.8111513,0.0012385824],"about_ca_topic_score_codex":0.9713221,"about_ca_topic_score_gemma":0.9900809,"teacher_disagreement_score":0.17525154,"about_ca_system_score_codex":0.016049843,"about_ca_system_score_gemma":0.0030173443,"threshold_uncertainty_score":0.9990788},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009998754,0.0000013126433,0.0030056662,0.00019313228,0.00043291817,0.0017876112,0.00026982548,0.0010100374,0.9922996],"genre_scores_gemma":[0.006616238,0.00019261098,0.004322301,0.00011188853,0.00036654188,0.00088889065,0.00005528773,0.00081020803,0.98663604],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99420166,0.00055873033,0.0009340913,0.0028374025,0.0006400849,0.00082803436],"domain_scores_gemma":[0.99048996,0.0008412017,0.000889727,0.007313337,0.00012982839,0.00033592555],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0033985756,0.0008473619,0.0010883356,0.0003426353,0.00022628368,0.00011089226,0.002076554,0.00097225985,0.9552154],"category_scores_gemma":[0.0013258056,0.0008064498,0.00052838534,0.00033021244,0.00046591362,0.00013770197,0.0015033035,0.0008290436,0.9783332],"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.000042767522,0.00059967744,0.001012637,0.00027478905,0.00041043755,0.00002667024,0.00021663686,2.8313664e-7,0.0016648915,0.14450018,0.84449977,0.0067512416],"study_design_scores_gemma":[0.0005620493,4.1388964e-7,0.0001009165,0.0002808496,0.00017691655,0.000059787464,0.00003258869,0.0000022475017,0.004892395,0.24808644,0.74509317,0.00071220536],"about_ca_topic_score_codex":0.00010885334,"about_ca_topic_score_gemma":0.00011859498,"teacher_disagreement_score":0.103586264,"about_ca_system_score_codex":0.00016441781,"about_ca_system_score_gemma":0.00021489385,"threshold_uncertainty_score":0.99943864},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017859288,0.00006292446,0.00036820612,0.0051347697,0.00027131906,0.00078343344,0.0004035887,0.0008376456,0.9903522],"genre_scores_gemma":[0.0024620937,0.000021345464,0.004124922,0.0001097142,0.00081990653,0.000016160608,0.0002448402,0.0004446747,0.9917563],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99789655,0.00024232797,0.00025333496,0.00064323144,0.00032317766,0.0006413654],"domain_scores_gemma":[0.9980453,0.00018820935,0.0004986813,0.0008419897,0.00011272748,0.00031304365],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002807697,0.00054531486,0.00055384944,0.00038080855,0.00034215653,0.00012923052,0.00087127206,0.0013073513,0.0104148],"category_scores_gemma":[0.00021111025,0.0005571202,0.00032410602,0.0006869711,0.00044322276,0.00017622579,0.00014598388,0.00075795833,0.0018360487],"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.00001412974,0.00012235927,0.000010315801,0.000046879377,0.00018483329,0.00003764523,0.00041600538,1.0440815e-7,0.0005580014,0.20326716,0.795066,0.00027659436],"study_design_scores_gemma":[0.0012043734,0.000035815065,0.000098304605,0.00038958734,0.0003077131,0.000033509426,0.0051902304,0.000010222023,0.00095139106,0.023264395,0.9677465,0.00076798355],"about_ca_topic_score_codex":0.00038625702,"about_ca_topic_score_gemma":0.00035589735,"teacher_disagreement_score":0.18000276,"about_ca_system_score_codex":0.00015447178,"about_ca_system_score_gemma":0.00021282722,"threshold_uncertainty_score":0.99998915},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9947455,0.00007094998,0.000023678705,0.000052564283,0.00015269688,0.0008522122,0.000017274973,0.000027576954,0.004057544],"genre_scores_gemma":[0.995198,0.00005527057,0.00012851994,0.000005024428,0.000017713155,0.0000020085254,0.000037678958,0.000016433869,0.0045393435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9986828,0.00023024097,0.00022474333,0.00029243086,0.00032485355,0.00024493193],"domain_scores_gemma":[0.9965281,0.001766419,0.0005390159,0.0009842371,0.00012016815,0.00006208073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080967107,0.0002221801,0.00039953008,0.00013040101,0.00035890797,0.000012086244,0.00081358774,0.00025874528,0.000045668105],"category_scores_gemma":[0.00014472543,0.00018048176,0.0002444291,0.00039204644,0.00023409365,0.00010870136,0.000059394028,0.0006319625,0.000014516179],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.02512678,0.010448268,0.028378593,0.004143803,0.0013929853,0.0001290045,0.09696634,0.000053650816,0.34010842,0.37130156,0.0039584883,0.117992125],"study_design_scores_gemma":[0.0011281517,0.0006171301,0.8769993,0.00029481328,0.00042968648,0.0000017938531,0.010099721,0.00003233876,0.01978582,0.08921739,0.0009858313,0.00040801833],"about_ca_topic_score_codex":0.011296882,"about_ca_topic_score_gemma":0.2066021,"teacher_disagreement_score":0.8486207,"about_ca_system_score_codex":0.00014390734,"about_ca_system_score_gemma":0.00016053794,"threshold_uncertainty_score":0.995287},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9536723,0.000007874951,0.002023919,0.00050874037,0.00006705092,0.00026815885,0.0001247658,0.000067987545,0.043259196],"genre_scores_gemma":[0.9946709,0.0002614214,0.00074206706,0.000120566845,0.000024471092,6.42121e-7,0.0000098179535,0.00002181689,0.0041482626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845105,0.00030749914,0.00018429001,0.00047902516,0.00022261267,0.0003555041],"domain_scores_gemma":[0.9976149,0.0012713565,0.00022371286,0.00057614635,0.000078513134,0.00023532231],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003499816,0.0002957023,0.00037812363,0.0005741061,0.0007679167,0.00003604467,0.00058411213,0.00015749558,0.00027964043],"category_scores_gemma":[0.0000973295,0.00025906882,0.00017909326,0.00049025874,0.001114559,0.00018098182,0.00042089593,0.00044486948,0.0000051126563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051505736,0.0001534086,0.0059367656,0.00003654977,0.00013176931,0.000029356519,0.0011836714,0.000007877941,0.0024599961,0.9878435,0.00041621886,0.0012857993],"study_design_scores_gemma":[0.003767439,0.000220538,0.034409627,0.00011310325,0.00030553562,0.00003191184,0.004614673,0.0005786385,0.0018799953,0.83560073,0.11772452,0.0007532786],"about_ca_topic_score_codex":0.00085855834,"about_ca_topic_score_gemma":0.0031240047,"teacher_disagreement_score":0.1522428,"about_ca_system_score_codex":0.000019708286,"about_ca_system_score_gemma":0.000054588498,"threshold_uncertainty_score":0.9999862},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007830779,0.0003382504,0.028462594,0.00030985544,0.0000847847,0.0016893179,0.04237806,0.00079299184,0.9258658],"genre_scores_gemma":[0.005092236,0.0011685368,0.029652257,0.00019942538,0.00053389376,9.82585e-7,0.13413212,0.014209442,0.81501114],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987053,0.00016208399,0.00026495312,0.0004899602,0.00017466025,0.00020299874],"domain_scores_gemma":[0.9978817,0.0001397158,0.00022286721,0.0014742354,0.00019135629,0.00009009723],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006169629,0.00017075297,0.0002771937,0.00027114575,0.00056617905,0.0001582894,0.001460034,0.00010521816,0.007843186],"category_scores_gemma":[0.00088428694,0.00017509304,0.000036764184,0.00024656835,0.00019792507,0.0000711665,0.0018210127,0.00016340158,0.00024526956],"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.000033133427,0.000103514714,3.9797112e-7,0.00066387624,0.00008993257,9.729213e-7,0.00007959741,1.3654868e-7,0.00034277764,0.14691214,0.8489827,0.0027908315],"study_design_scores_gemma":[0.0005515421,0.000045841396,0.00000433325,0.0002071009,0.00009448849,0.000010072508,0.000098271004,0.00007820997,0.00016187974,0.016564628,0.98202795,0.00015567818],"about_ca_topic_score_codex":0.000012788599,"about_ca_topic_score_gemma":0.0000019193235,"teacher_disagreement_score":0.13304527,"about_ca_system_score_codex":0.00001701677,"about_ca_system_score_gemma":0.0000067476944,"threshold_uncertainty_score":0.9930638},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99387175,0.0015095993,0.0010217917,0.00011064698,0.0019261119,0.0009851446,0.000025402478,0.00001565679,0.0005339179],"genre_scores_gemma":[0.9961816,0.00014362212,0.0035523237,0.000003921306,0.00007282308,0.000008403096,0.000005471729,0.000026937721,0.0000049154396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99394,0.00039817436,0.0041805096,0.00046653146,0.0006485285,0.00036628416],"domain_scores_gemma":[0.9902702,0.0039004874,0.0037426895,0.00073378824,0.0011780434,0.00017480826],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0038791357,0.00049424917,0.0027663305,0.0014489855,0.00023406686,0.00008573911,0.0006543152,0.00038211874,0.000013720892],"category_scores_gemma":[0.0015853469,0.00046203836,0.00059814553,0.003993219,0.000761496,0.00014967438,0.00039894972,0.0009833233,9.170266e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015616274,0.0025425109,0.003949369,0.0020164237,0.0021912302,0.0000017239227,0.0025428906,0.00009000083,0.0026635164,0.98287934,0.000016834732,0.0009500177],"study_design_scores_gemma":[0.003490051,0.0002397677,0.0025250965,0.0007150969,0.004036621,0.00001136974,0.0010460383,0.0036644721,0.0057548517,0.9781929,0.000022124454,0.0003016],"about_ca_topic_score_codex":0.000019848789,"about_ca_topic_score_gemma":0.0000012353079,"teacher_disagreement_score":0.0046864087,"about_ca_system_score_codex":0.000080496626,"about_ca_system_score_gemma":0.00025713234,"threshold_uncertainty_score":0.99978316},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95286757,0.0001253225,0.0001790824,0.00014088563,0.0002379623,0.00031881526,0.00003740191,0.000106945656,0.04598601],"genre_scores_gemma":[0.9831933,0.00008393208,0.0033685896,0.000008766992,0.000058462654,0.0000014903505,0.00033220195,0.00004439294,0.012908898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920845,0.000057234207,0.000100814104,0.00021120162,0.00021048833,0.00021183716],"domain_scores_gemma":[0.99891716,0.000119836266,0.0003237166,0.00044185962,0.000108943525,0.00008847373],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018268712,0.00019031722,0.00031211978,0.00021965007,0.0002485779,0.000008634286,0.00040719385,0.00026977411,0.00008797707],"category_scores_gemma":[0.000021494776,0.00024824642,0.00023953925,0.00023666717,0.00007816039,0.00012151934,0.000038049635,0.00025033174,0.00014059518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082879014,0.0002618034,0.0026478579,0.0005048656,0.00017496262,0.000005595636,0.0012987196,4.154995e-7,0.0011599388,0.9752631,0.017530346,0.0010694917],"study_design_scores_gemma":[0.00067026983,0.00006342512,0.1458609,0.00027054086,0.0009701028,0.0000047916,0.06448926,0.000009801951,0.001118198,0.75509614,0.030738479,0.00070809136],"about_ca_topic_score_codex":0.0002214269,"about_ca_topic_score_gemma":0.099684015,"teacher_disagreement_score":0.22016697,"about_ca_system_score_codex":0.000030277259,"about_ca_system_score_gemma":0.000028979675,"threshold_uncertainty_score":0.99999696},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6719497,0.0001879299,0.12851664,0.0110142315,0.00021841603,0.0020204415,0.0000799619,0.00030163786,0.18571103],"genre_scores_gemma":[0.97728676,0.0000077313425,0.018562386,0.00031931043,0.000018229512,0.00005432889,0.0000039240676,0.00002162256,0.0037256829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917316,0.000044300054,0.00034487573,0.00013410016,0.00015869694,0.00014487818],"domain_scores_gemma":[0.9978562,0.0011903,0.000162074,0.0007153738,0.000039110266,0.000036970447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029430006,0.00015215612,0.00024493085,0.00008713551,0.00010649122,0.000021553105,0.00037160717,0.00006969596,0.00017054043],"category_scores_gemma":[0.00037868673,0.00008902493,0.00015657616,0.00044437477,0.00009585349,0.000022101003,0.000056527748,0.0001565556,0.000019294757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050864946,0.00007081515,0.000022011807,0.00013209028,0.00006610341,2.6767066e-7,0.0009635481,0.000002774445,0.0006602558,0.9842143,0.013617425,0.00024532777],"study_design_scores_gemma":[0.00016632241,0.000020185216,0.00003681461,0.00018460344,0.000085139276,0.000001334683,0.00058219384,0.00014656104,0.009611909,0.9877133,0.0013659049,0.00008572537],"about_ca_topic_score_codex":0.0000039110746,"about_ca_topic_score_gemma":0.000005112312,"teacher_disagreement_score":0.30533707,"about_ca_system_score_codex":0.0000075769026,"about_ca_system_score_gemma":0.000039486527,"threshold_uncertainty_score":0.36303315},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91477275,0.033349145,0.004258154,0.008384123,0.00045840323,0.005051199,0.0001317008,0.0002500858,0.03334447],"genre_scores_gemma":[0.9918991,0.0009180374,0.0015773934,0.00015037974,0.00003139215,0.0003244579,0.0000014440091,0.000048207803,0.005049612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964868,0.0002872282,0.0015647523,0.0005654029,0.000443752,0.0006520679],"domain_scores_gemma":[0.9952649,0.0019169046,0.00050465093,0.0019111825,0.00026012532,0.00014227815],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001760809,0.00053995295,0.00087984913,0.00030684168,0.0010805489,0.0001821128,0.00088222884,0.00026904859,0.000092683425],"category_scores_gemma":[0.0012362386,0.0003643399,0.00034573165,0.0008546292,0.0024167008,0.00021348917,0.0004841526,0.0004398857,0.00004799533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010598224,0.00064566697,0.00007926888,0.0038485432,0.000496701,9.694235e-7,0.0036711884,7.0206534e-7,0.0020405708,0.985022,0.0012801739,0.0028082272],"study_design_scores_gemma":[0.0005992887,0.000078118894,0.00028260952,0.00186126,0.0004788112,0.000010551378,0.0050844126,0.0012753773,0.00555885,0.9809207,0.0035362316,0.00031382177],"about_ca_topic_score_codex":0.000012457594,"about_ca_topic_score_gemma":0.000021010053,"teacher_disagreement_score":0.077126354,"about_ca_system_score_codex":0.000035367473,"about_ca_system_score_gemma":0.00018819488,"threshold_uncertainty_score":0.99988085},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1356562,0.0032546239,0.43912566,0.007325244,0.0016622872,0.0061029773,0.000336226,0.0010446188,0.4054922],"genre_scores_gemma":[0.97482616,0.00012248708,0.0046874788,0.00024333957,0.000063511434,0.0005330972,0.000024767223,0.00006553876,0.019433621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954823,0.00032521388,0.0019983065,0.00091567106,0.00053340616,0.0007450993],"domain_scores_gemma":[0.9942368,0.001880579,0.0005894648,0.0027448868,0.00034359327,0.00020466601],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0020852485,0.0006238841,0.0008491946,0.00071526924,0.00078525447,0.00028967616,0.0011265831,0.00044320905,0.0026067453],"category_scores_gemma":[0.0013873184,0.00063309335,0.0005781868,0.0021322763,0.0006747429,0.000278866,0.0003010628,0.0005533335,0.0015526682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035686127,0.0014088743,0.00010313017,0.0022189673,0.00037886924,0.0000020932537,0.0014978941,0.0000028409809,0.0007541723,0.9736199,0.016113944,0.003863645],"study_design_scores_gemma":[0.0005628328,0.00002898257,0.0008635101,0.0008078899,0.00067992014,0.000008163362,0.0021095527,0.0027442763,0.0024607617,0.9807895,0.008485753,0.00045888],"about_ca_topic_score_codex":0.000007128978,"about_ca_topic_score_gemma":0.0000066099847,"teacher_disagreement_score":0.83917,"about_ca_system_score_codex":0.000097264936,"about_ca_system_score_gemma":0.00017285343,"threshold_uncertainty_score":0.99961203},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70839757,0.0083344,0.013372897,0.0048216707,0.0004391474,0.004440258,0.00019339981,0.00015260057,0.25984803],"genre_scores_gemma":[0.98864067,0.00034812884,0.0064512827,0.00016965171,0.000025040295,0.0001665309,0.0000026010416,0.00003599445,0.0041601253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969048,0.00040278854,0.0013638422,0.00048650135,0.0003484751,0.00049361825],"domain_scores_gemma":[0.9926911,0.004862125,0.00044717127,0.0017421526,0.00014686499,0.0001105584],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002357726,0.0004524703,0.0010574925,0.00019232674,0.00040932908,0.00008415234,0.0006677997,0.00022144827,0.00091380015],"category_scores_gemma":[0.0010923994,0.00030842423,0.00043704078,0.0006897828,0.002426433,0.00009714306,0.000225031,0.00041999933,0.00007014633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018144627,0.00063851,0.000019917903,0.0015819983,0.00038887543,0.0000016089317,0.014309679,5.3059983e-7,0.00021389492,0.97976154,0.0021973893,0.0007046255],"study_design_scores_gemma":[0.0020080963,0.00006844638,0.00018207404,0.0007520167,0.00078700355,0.000016860122,0.00480309,0.0016399748,0.0021656246,0.98458475,0.0027519192,0.00024015828],"about_ca_topic_score_codex":0.000006898096,"about_ca_topic_score_gemma":0.0000033773422,"teacher_disagreement_score":0.28024307,"about_ca_system_score_codex":0.000032577624,"about_ca_system_score_gemma":0.00009852883,"threshold_uncertainty_score":0.9999995},"labels":[],"label_agreement":null},{"id":"W7117419254","doi":"10.61091/ars165-01","title":"Signless Laplacian spectral determinations of the starlike trees &lt;span class=\"math inline\"&gt;\\(ST(n, d_1)\\)&lt;/span&gt; and the double starlike trees &lt;span class=\"math inline\"&gt;\\(H_n(p, p)\\)&lt;/span&gt;","year":2025,"lang":"","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vertex (graph theory); Graph; Degree (music); Tree (set theory); Path graph; Path (computing); Simple graph","score_opus":0.014179583689053027,"score_gpt":0.25874359812753456,"score_spread":0.24456401443848153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117419254","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96141636,0.0030592096,0.0006177115,0.008777101,0.004076292,0.007068194,0.0019159338,0.00061047653,0.012458717],"genre_scores_gemma":[0.9869023,0.0032712228,0.0011702897,0.0006070759,0.00028439178,0.0012328541,0.00029715657,0.00042064773,0.0058140894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98476636,0.0022807866,0.004698561,0.0028341855,0.0025255524,0.0028945438],"domain_scores_gemma":[0.98298556,0.0052949856,0.003233556,0.005945238,0.0016016868,0.00093894993],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":["metaepi_narrow","sts","research_integrity"],"category_scores_codex":[0.0040740212,0.0028712347,0.0038462186,0.00200849,0.0037956918,0.0012460503,0.0050551645,0.0016729633,0.0002527829],"category_scores_gemma":[0.0011493276,0.0022600004,0.0019384316,0.0068754,0.0045312094,0.0012774084,0.0021665485,0.002882938,0.000121520716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013879874,0.0041211885,0.0018294905,0.0008626436,0.0015355567,0.000032831795,0.0056172227,0.00029366926,0.0076656784,0.9649354,0.010164221,0.0015540808],"study_design_scores_gemma":[0.021351771,0.0009622515,0.010941542,0.0018102849,0.0040141246,0.000084955616,0.0040135486,0.033585656,0.0063451314,0.8429694,0.070998006,0.002923312],"about_ca_topic_score_codex":0.0001482833,"about_ca_topic_score_gemma":0.005034182,"teacher_disagreement_score":0.12196602,"about_ca_system_score_codex":0.000570972,"about_ca_system_score_gemma":0.0013892477,"threshold_uncertainty_score":0.9997907},"labels":[],"label_agreement":null},{"id":"W7117419413","doi":"10.61091/ars165-04","title":"Combinatorial identities using the matrix tree theorem","year":2025,"lang":"","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Indian Institute of Science Education and Research Mohali; Indian Institute of Science","keywords":"Spanning tree; Bipartite graph; Minimum spanning tree; Complete bipartite graph; Trémaux tree; Graph; Tree (set theory); Combinatorial proof; Minimum degree spanning tree","score_opus":0.021477414684064017,"score_gpt":0.3131722221738988,"score_spread":0.2916948074898348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117419413","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9094958,0.0018068833,0.00063319085,0.0012241454,0.022555128,0.0020502827,0.00005169272,0.0002337315,0.061949152],"genre_scores_gemma":[0.99259895,0.00016622528,0.00022555573,0.00019310533,0.000097670694,0.000121089826,0.000008848536,0.00007723912,0.0065113404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995582,0.0010818794,0.0012356269,0.0006563553,0.0005832006,0.00086094707],"domain_scores_gemma":[0.9939195,0.002954947,0.0005880899,0.0019783808,0.00042725302,0.00013182359],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0022345474,0.00063233095,0.0007867309,0.0002920567,0.0024890841,0.00039919984,0.0016782974,0.0004960137,0.0003734309],"category_scores_gemma":[0.0006509592,0.00052833924,0.0005377264,0.0016722445,0.0010465519,0.00031788414,0.00069489115,0.0010702218,0.00016096937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009358485,0.0005537018,0.00047603692,0.00025993356,0.00047566294,0.000006423145,0.0017060318,0.000007792948,0.0006070492,0.9882089,0.007336441,0.00026844343],"study_design_scores_gemma":[0.0023852463,0.00006437129,0.00015051394,0.00033967313,0.00093668373,0.000007967723,0.0036688556,0.00074435014,0.0018288487,0.9846478,0.0047528693,0.00047279545],"about_ca_topic_score_codex":0.000043814805,"about_ca_topic_score_gemma":0.0000068296,"teacher_disagreement_score":0.083103135,"about_ca_system_score_codex":0.00025531818,"about_ca_system_score_gemma":0.00042121168,"threshold_uncertainty_score":0.9997168},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024385508,0.00039466546,0.00024837494,0.00077233656,0.00013552116,0.000843271,0.000024600677,0.0000474937,0.9950952],"genre_scores_gemma":[0.6582965,0.0034198884,0.06515533,0.0020023827,0.0030768332,0.0016195838,0.000029337083,0.00020419189,0.26619595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984222,0.000049677405,0.00046816224,0.00043712635,0.0003694363,0.0002534045],"domain_scores_gemma":[0.99520695,0.0042040837,0.00014043141,0.0003678484,0.000022533577,0.00005814426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029514423,0.000289481,0.00055082835,0.00012239882,0.00040224864,0.00016360584,0.0004655127,0.00023120592,0.0001251122],"category_scores_gemma":[0.00027685252,0.0001714976,0.00006876967,0.00012353464,0.0010878105,0.000042539683,0.00016029576,0.00029182425,0.00001703548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034300012,0.000034373083,0.0000014715675,0.00016332757,0.000015702983,0.0000011920015,0.00033858212,9.8390814e-8,0.00004335621,0.9969644,0.0009062269,0.0015278485],"study_design_scores_gemma":[0.000113799455,0.000021843282,0.0000046556947,0.00016695193,0.00009289163,0.000009300574,0.00017709764,0.000006543368,0.000027000448,0.97756463,0.02161721,0.00019808381],"about_ca_topic_score_codex":0.0000030574379,"about_ca_topic_score_gemma":0.000013080671,"teacher_disagreement_score":0.72889924,"about_ca_system_score_codex":0.000010390633,"about_ca_system_score_gemma":0.000052255964,"threshold_uncertainty_score":0.6993469},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04942515,0.00035307833,0.93549126,0.0028173514,0.00021674285,0.001777165,0.0011109144,0.0001489754,0.008659382],"genre_scores_gemma":[0.9830509,0.00006938493,0.015008444,0.00012170202,0.00007172132,0.00042302877,0.000062200794,0.00011211568,0.0010805483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99545354,0.0004144148,0.001654207,0.0006200049,0.0007745468,0.0010832846],"domain_scores_gemma":[0.99167794,0.002760913,0.0010129736,0.0024730498,0.0016096908,0.00046545974],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019655193,0.0007526128,0.0011286602,0.00026170662,0.0012983346,0.0002708441,0.0012467876,0.00030166464,0.00022323366],"category_scores_gemma":[0.0026014897,0.0004827709,0.0004867628,0.0016633444,0.0010518776,0.00016099305,0.00032214087,0.00049575354,0.00010112272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000996453,0.00065448333,0.000034066907,0.0001345482,0.0004949936,0.0000019030621,0.0015148503,0.00002818649,0.0013495944,0.99400663,0.0008781873,0.0008029225],"study_design_scores_gemma":[0.0012599771,0.00068371726,0.00012944225,0.0007283724,0.0009060064,0.000072923445,0.002159969,0.004461724,0.007052868,0.96445024,0.01728217,0.00081260625],"about_ca_topic_score_codex":0.000024750178,"about_ca_topic_score_gemma":0.000063815445,"teacher_disagreement_score":0.9336257,"about_ca_system_score_codex":0.00012908484,"about_ca_system_score_gemma":0.0002805169,"threshold_uncertainty_score":0.9997624},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25063232,0.00005358937,0.7116677,0.00094748416,0.00030062965,0.0019283115,0.00011329451,0.0001355338,0.034221113],"genre_scores_gemma":[0.9726389,0.00008131636,0.012845188,0.0003972204,0.00006648859,0.00014598282,0.00004963871,0.00002163644,0.01375365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990262,0.000053978118,0.00031976975,0.00032314777,0.00006953216,0.00020737831],"domain_scores_gemma":[0.9988295,0.00041629712,0.00009568527,0.0004426517,0.0001231158,0.00009276204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035355997,0.00018782713,0.00021579962,0.00012107947,0.00037199474,0.0001097461,0.00016419381,0.00016130709,0.0002821803],"category_scores_gemma":[0.00014020823,0.00016101898,0.00007387334,0.00028978314,0.00015492126,0.00022652831,0.0000604249,0.00008800819,0.000012949612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003894366,0.00021624326,0.00033414765,0.00020713736,0.00006933741,7.667762e-8,0.00077837013,0.0000022093927,0.001540444,0.9915023,0.0012430932,0.0040677204],"study_design_scores_gemma":[0.000566005,0.00007881809,0.00015050411,0.000039846065,0.00021440172,6.2306094e-7,0.0013461963,0.00444553,0.005618124,0.97867346,0.008691087,0.00017541143],"about_ca_topic_score_codex":0.0000062334284,"about_ca_topic_score_gemma":0.00005373811,"teacher_disagreement_score":0.72200656,"about_ca_system_score_codex":0.000019543566,"about_ca_system_score_gemma":0.00005056587,"threshold_uncertainty_score":0.65661633},"labels":[],"label_agreement":null},{"id":"W76135770","doi":"","title":"The Index of Tricyclic Hamiltonian Graphs with D(G)=3.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tricyclic; Mathematics; Hamiltonian (control theory); Index (typography); Combinatorics; Discrete mathematics; Chemistry; Stereochemistry; Mathematical optimization; Computer science","score_opus":0.014731859839388418,"score_gpt":0.26141076746257247,"score_spread":0.24667890762318406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W76135770","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9950492,0.00005585087,0.000085091866,0.00036238198,0.000119036966,0.00024845923,0.000002507711,0.000054686658,0.0040227813],"genre_scores_gemma":[0.99938977,0.000017096912,0.00037445416,0.000025122388,0.0000019695538,0.00005264718,9.669382e-7,0.000016590511,0.00012138431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992909,0.000036513735,0.00020182283,0.0001253235,0.00017540624,0.00017006429],"domain_scores_gemma":[0.998949,0.00030820767,0.00013372484,0.0004901347,0.00006985183,0.00004910244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002600885,0.000102524915,0.00014051482,0.000050532435,0.0002374459,0.000017814356,0.00028200113,0.000047680147,0.0000051232314],"category_scores_gemma":[0.00006704292,0.000064705215,0.000062568135,0.0004924361,0.0001945306,0.000046802114,0.000027738133,0.00012607953,0.000009292218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021464486,0.00015401836,0.0012769907,0.000010048022,0.00003543668,0.0000010517409,0.0002273419,0.000003382898,0.00014917747,0.99769866,0.00013638675,0.000286052],"study_design_scores_gemma":[0.00091583235,0.000080800055,0.0038189914,0.000022147855,0.000024889972,0.0000048383768,0.00014361406,0.0000019390127,0.0024038362,0.9917735,0.000723869,0.00008575857],"about_ca_topic_score_codex":0.000018158098,"about_ca_topic_score_gemma":0.000024911216,"teacher_disagreement_score":0.005925166,"about_ca_system_score_codex":0.000016548789,"about_ca_system_score_gemma":0.00004071547,"threshold_uncertainty_score":0.2638602},"labels":[],"label_agreement":null},{"id":"W87985346","doi":"","title":"Some lower bounds on the spectral radius of graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spectral radius; RADIUS; Combinatorics; Physics; Computer science; Eigenvalues and eigenvectors; Quantum mechanics","score_opus":0.022064633671120406,"score_gpt":0.2778792810301615,"score_spread":0.25581464735904114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W87985346","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9882483,0.00004583771,0.000012505347,0.0003728723,0.00061553234,0.00020364416,0.0000036503645,0.000050738432,0.010446925],"genre_scores_gemma":[0.9993851,0.000008145308,0.00014328638,0.00013376106,0.00001464263,0.000012099225,0.0000012500693,0.000016275053,0.00028540386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992027,0.000039544666,0.00023037315,0.00013177613,0.00018306405,0.0002125412],"domain_scores_gemma":[0.9985563,0.0007449577,0.00010660635,0.0005033905,0.00003843421,0.000050315284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007536923,0.0001084003,0.00014293265,0.000065925546,0.00013963683,0.000013646273,0.000275551,0.00005840824,0.00006769686],"category_scores_gemma":[0.00010265297,0.000077466735,0.000120355704,0.00027968592,0.00015442343,0.000046426278,0.000024449128,0.00016775145,0.000035616005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025314035,0.0003116443,0.00021258112,0.000007972854,0.000028545104,0.0000024715894,0.00017916333,1.4247986e-7,0.0010789527,0.99471706,0.0033717554,0.0000643671],"study_design_scores_gemma":[0.00027596205,0.00009363859,0.001495209,0.000014457969,0.000019861498,0.000002244083,0.00007321691,0.0000021553094,0.01744618,0.97934186,0.001148389,0.000086799075],"about_ca_topic_score_codex":0.0000038571275,"about_ca_topic_score_gemma":0.0000020999857,"teacher_disagreement_score":0.016367227,"about_ca_system_score_codex":0.000017373653,"about_ca_system_score_gemma":0.000013561813,"threshold_uncertainty_score":0.31590018},"labels":[],"label_agreement":null},{"id":"W92339428","doi":"","title":"PI and Szeged Indices of some Benzenoid Graphs Related to Nanostructures.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Statistics","score_opus":0.011424523319233175,"score_gpt":0.27565088236143764,"score_spread":0.2642263590422045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W92339428","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99769425,0.00013734626,0.000005304373,0.0001045298,0.00027673322,0.0002781095,0.000008091781,0.00006287675,0.0014327507],"genre_scores_gemma":[0.99904484,0.000010232372,0.0007544076,0.00006666282,0.0000022549973,0.000008901402,0.0000037238524,0.000018190734,0.00009079698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911857,0.000034063298,0.00031456523,0.00018423786,0.0001530723,0.00019547586],"domain_scores_gemma":[0.9990767,0.00030765258,0.00013898121,0.00030792845,0.000055091707,0.000113625254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004966946,0.0001207484,0.00020125169,0.0001659216,0.00011805879,0.000011721005,0.00018043042,0.000110155874,0.000024021949],"category_scores_gemma":[0.00013121466,0.00011315411,0.000049111182,0.00040479982,0.00008896812,0.000076319564,0.00006168562,0.00013610424,0.0000076005986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018614403,0.00007173114,0.0018130703,0.000030232555,0.00003335569,0.0000018600044,0.000925667,1.7078919e-7,0.012336376,0.9840213,0.0003960984,0.00035154074],"study_design_scores_gemma":[0.00044051008,0.000070044625,0.01025454,0.000023090644,0.000029571254,0.000004856543,0.00015303188,7.434573e-7,0.035603624,0.9529988,0.0003036652,0.000117519354],"about_ca_topic_score_codex":0.000008124523,"about_ca_topic_score_gemma":0.0000050022695,"teacher_disagreement_score":0.031022478,"about_ca_system_score_codex":0.000009518044,"about_ca_system_score_gemma":0.000010995099,"threshold_uncertainty_score":0.46142906},"labels":[],"label_agreement":null},{"id":"W94353364","doi":"","title":"On computing the dissociation number and the induced matching number of bipartite graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Matching (statistics); Combinatorics; 3-dimensional matching; Graph; Statistics","score_opus":0.017702087213756906,"score_gpt":0.29802106200989636,"score_spread":0.28031897479613943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W94353364","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99628097,0.000007129398,0.000049182498,0.0008566335,0.0001694709,0.00026605555,0.0000019979934,0.000035563302,0.0023329833],"genre_scores_gemma":[0.99964905,0.000004920636,0.00017512338,0.00011202631,0.0000051393376,0.000018657853,0.0000015082079,0.000012872058,0.000020709957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992436,0.00013055782,0.00022382943,0.000116081435,0.00016025706,0.00012565259],"domain_scores_gemma":[0.9983294,0.0011311313,0.00019710507,0.00027378005,0.000044708806,0.000023851042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007485838,0.0000955861,0.00015309395,0.000014459758,0.00033450467,0.000031431282,0.00015875576,0.000049025482,0.000010874046],"category_scores_gemma":[0.00015339967,0.00005667213,0.00006938174,0.00023197108,0.00012432247,0.000048223046,0.000050291197,0.00017872197,0.000018825514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014348728,0.000084303254,0.0011317933,0.000010354609,0.0000326506,1.6320925e-7,0.0029160988,0.0000067334536,0.00015070495,0.9954766,0.00008551558,0.000090731686],"study_design_scores_gemma":[0.0010838173,0.000007990755,0.0033429745,0.000047782138,0.00003505993,0.0000032056225,0.00031413604,0.000019971081,0.00078140147,0.99428445,0.000012835741,0.00006638162],"about_ca_topic_score_codex":0.0000453253,"about_ca_topic_score_gemma":0.000004365338,"teacher_disagreement_score":0.0033680587,"about_ca_system_score_codex":0.000015941014,"about_ca_system_score_gemma":0.0000106590305,"threshold_uncertainty_score":0.25727734},"labels":[],"label_agreement":null},{"id":"W98729622","doi":"","title":"INTERMEDIATE AND LIMITING BEHAVIOR OF POWERS OF SOME CIRCULANT MATRICES","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Circulant matrix; Aperiodic graph; Combinatorics; Matrix (chemical analysis); Tensor product; Sequence (biology); Markov chain; Binary number; Discrete mathematics; Pure mathematics; Arithmetic","score_opus":0.02841793501223058,"score_gpt":0.2771187826397894,"score_spread":0.2487008476275588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W98729622","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9992449,0.00012890907,0.0000038388803,0.000015115385,0.000121369405,0.00013532002,0.0000094285315,0.00002217889,0.00031888727],"genre_scores_gemma":[0.9995545,0.00008094445,0.0003064485,0.0000064992882,0.0000027466428,0.000017896775,0.0000019330676,0.00000977556,0.000019270472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994379,0.000026363543,0.00024419947,0.000097213015,0.00009942078,0.00009485751],"domain_scores_gemma":[0.99932146,0.0002266826,0.00018553056,0.00018245023,0.000046795725,0.000037074693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014758408,0.00007012117,0.00017981757,0.000066374945,0.00005284098,0.00000271019,0.00010926238,0.000040185405,0.0000094124025],"category_scores_gemma":[0.00007164419,0.000066967346,0.000048676953,0.000111592744,0.00014300813,0.000063824955,0.000043497424,0.00006243031,0.0000019120369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004858646,0.00017448573,0.014969365,0.00006593231,0.0000161539,0.000003895015,0.00071409415,7.3077935e-8,0.006392529,0.9774392,0.0000709918,0.00014840587],"study_design_scores_gemma":[0.00038716456,0.000055701013,0.016543882,0.000043144286,0.000053605392,0.000017195627,0.00023159382,0.000007778268,0.0164729,0.9660879,0.000019275198,0.000079907506],"about_ca_topic_score_codex":0.000005733419,"about_ca_topic_score_gemma":2.639511e-7,"teacher_disagreement_score":0.011351365,"about_ca_system_score_codex":0.0000055929127,"about_ca_system_score_gemma":0.000012694754,"threshold_uncertainty_score":0.2730849},"labels":[],"label_agreement":null},{"id":"W99733679","doi":"","title":"Resonance of Plane Bipartite Graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Plane (geometry); Combinatorics; Geometry; Graph","score_opus":0.024013511285043643,"score_gpt":0.2903899174885468,"score_spread":0.26637640620350317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W99733679","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9913056,0.0001484625,0.000058557267,0.00005051249,0.00022588184,0.00013054433,0.0000074315076,0.00006073309,0.008012306],"genre_scores_gemma":[0.99854803,0.000012614285,0.0011400342,0.00002724774,0.000003213899,0.000009304081,0.0000031095788,0.000011811612,0.00024461714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993,0.000022422973,0.0002502133,0.00012194575,0.00013262108,0.0001728054],"domain_scores_gemma":[0.999071,0.00036617185,0.00010763081,0.0003478838,0.000053827018,0.00005346075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005584867,0.0000795507,0.00014225747,0.00006814794,0.00006220586,0.0000046101345,0.00016924893,0.000054612177,0.000037149683],"category_scores_gemma":[0.0000920745,0.00007652499,0.000056715955,0.00033081262,0.000083886785,0.000040927298,0.000025638146,0.000087212335,0.000023716128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017963244,0.0001421814,0.0026981304,0.0000193675,0.0000098744285,0.0000021456203,0.00015431421,7.1020594e-8,0.002036077,0.99237096,0.0020165492,0.0005323591],"study_design_scores_gemma":[0.00029060955,0.000033143,0.005010015,0.00002150944,0.0000125134675,0.000002522666,0.000040097195,0.0000018291267,0.026127718,0.96261734,0.005764127,0.00007857387],"about_ca_topic_score_codex":0.0000057951024,"about_ca_topic_score_gemma":0.0000061142673,"teacher_disagreement_score":0.029753625,"about_ca_system_score_codex":0.000007238681,"about_ca_system_score_gemma":0.000009044539,"threshold_uncertainty_score":0.31205985},"labels":[],"label_agreement":null}]}