{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":889,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":889,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"b5fe1e382291","filters":{"topic":"Graph theory and applications"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02885101857384469,"gpt":0.2921779012327856,"spread":0.2633268826589409,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003841528,0.0001007628,0.0001711559,0.00005095984,0.0001349283,0.00001031464,0.0001629148,0.00004981128,0.0000369183],"category_scores_gemma":[0.0001364054,0.00009172514,0.00004765281,0.0003602851,0.00008836026,0.00004511872,0.00002877468,0.00008353324,0.00002467798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000295289,"about_ca_system_score_gemma":0.000009220508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007131432,"about_ca_topic_score_gemma":0.00003735801,"domain_scores_codex":[0.9992632,0.00006169387,0.0002533556,0.0002063171,0.00009018352,0.0001252181],"domain_scores_gemma":[0.9987512,0.0005940143,0.0001178075,0.0003753769,0.00009063976,0.00007095233],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004104022,0.00009804831,0.0008190008,0.00004106826,0.00001252392,1.632601e-8,0.0000676643,4.851343e-7,0.0009585248,0.9970366,0.0002174532,0.0007444798],"study_design_scores_gemma":[0.0001617689,0.00002304424,0.007059162,0.00001119762,0.00002804588,0.000001758787,0.00002871032,0.0005022453,0.003108838,0.9776142,0.01133818,0.0001228225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7419645,0.0003624521,0.2472942,0.0004718244,0.00002764454,0.00101565,0.0002012141,0.0001674729,0.008495035],"genre_scores_gemma":[0.9940476,0.00005959478,0.005240505,0.00005426716,0.00004073432,0.0001876021,0.00003260179,0.00001603653,0.0003210095],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2520832,"threshold_uncertainty_score":0.3740443,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02218523395327058,"gpt":0.3144036897424108,"spread":0.2922184557891402,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001336656,0.00009131915,0.0001243136,0.00003154511,0.0002684576,0.00001938846,0.000195993,0.00003538986,0.00006596531],"category_scores_gemma":[0.00004537535,0.00006362156,0.00007203234,0.0002376201,0.00009551367,0.0000611049,0.0000263914,0.00006334291,0.00002901574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002817625,"about_ca_system_score_gemma":0.00001030461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008692384,"about_ca_topic_score_gemma":0.00001259352,"domain_scores_codex":[0.9994077,0.00001382904,0.0002265236,0.0001548899,0.00006841641,0.000128642],"domain_scores_gemma":[0.9985947,0.000786988,0.0001093971,0.0003429429,0.000119361,0.00004661024],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002934447,0.00006286507,0.000025806,0.00004637682,0.0000223453,6.964153e-9,0.0001231399,0.000002505869,0.001577721,0.9958151,0.0009941204,0.001327056],"study_design_scores_gemma":[0.0002491448,0.00001568077,0.0001463683,0.000008519872,0.00006901226,0.00000184747,0.0002674107,0.001644916,0.001988377,0.9542289,0.04128619,0.00009360564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.160078,0.002077475,0.8191006,0.007514049,0.00005021087,0.007311083,0.0005563132,0.0001961941,0.003116088],"genre_scores_gemma":[0.9797865,0.0001538001,0.01402035,0.0001130223,0.00009647847,0.004342872,0.00002165751,0.00002198147,0.001443343],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8197085,"threshold_uncertainty_score":0.2594412,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Combinatorics; Rank (graph theory); Graph; Simple graph; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03118969790938455,"gpt":0.3016897495124434,"spread":0.2705000516030588,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001376799,0.000133746,0.0001811741,0.0001326657,0.0004228226,0.00002856046,0.0002960294,0.00008182303,0.00001259019],"category_scores_gemma":[0.0002724455,0.00009799538,0.00007160094,0.001414864,0.0001371782,0.00005491868,0.00005003939,0.0001232033,0.00001812476],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000600762,"about_ca_system_score_gemma":0.0000171562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001926712,"about_ca_topic_score_gemma":0.00005119175,"domain_scores_codex":[0.9988688,0.00007066882,0.0004420001,0.0002219835,0.0001627669,0.0002337506],"domain_scores_gemma":[0.996069,0.003046157,0.0002117483,0.0003993314,0.0001729154,0.0001008856],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002250741,0.0001718831,0.000505042,0.00003644202,0.00004362601,7.930494e-8,0.0001063313,1.208546e-7,0.00264457,0.9907371,0.002430929,0.003301352],"study_design_scores_gemma":[0.0007686998,0.00008046339,0.007371467,0.0000227381,0.0001745529,0.00001013058,0.0005104856,0.0003004421,0.01645203,0.930431,0.04348927,0.0003886925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9469641,0.005055892,0.04298107,0.0005403548,0.00003780701,0.001559977,0.0003073518,0.0001250783,0.002428318],"genre_scores_gemma":[0.9965568,0.0006254836,0.001905183,0.00005835285,0.00004443751,0.0002184515,0.00004536687,0.00002241556,0.0005234763],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06030608,"threshold_uncertainty_score":0.3996135,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03756122340035258,"gpt":0.2411246052498603,"spread":0.2035633818495078,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003635266,0.0001099803,0.0001392775,0.00004593172,0.0002816072,0.00003316992,0.0002410002,0.00006783591,0.000002868895],"category_scores_gemma":[0.00004784762,0.00007143708,0.00003927073,0.0003311306,0.000455635,0.0001097817,0.00007355041,0.0001289094,8.66117e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006204738,"about_ca_system_score_gemma":0.000009106853,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002026316,"about_ca_topic_score_gemma":0.000001085125,"domain_scores_codex":[0.9993591,0.000009110587,0.0001721117,0.0001958317,0.0001010781,0.0001627929],"domain_scores_gemma":[0.9994708,0.00008303217,0.00012205,0.0001301832,0.0001411625,0.00005276157],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000221168,0.0000454302,0.0001487282,0.00004094411,0.0000229958,5.685698e-9,0.0002308171,0.00000139805,0.004364308,0.9929892,0.0008345833,0.00129947],"study_design_scores_gemma":[0.0001179554,0.00003466529,0.00008253728,0.00003075544,0.00006390773,0.00001071957,0.00007687034,0.0027849,0.007730646,0.9886033,0.0003724012,0.00009133064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9795261,0.0006774897,0.01201745,0.0004578884,0.00003618712,0.001084212,0.000004277539,0.0001141365,0.006082254],"genre_scores_gemma":[0.9982743,0.00007096568,0.0009937813,0.00008957236,0.0001152234,0.0001768556,1.628893e-7,0.00001751585,0.0002616522],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01874817,"threshold_uncertainty_score":0.2913119,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02579778177367733,"gpt":0.2811280914133138,"spread":0.2553303096396365,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002055113,0.0001341396,0.0001511988,0.00005925448,0.0003253171,0.00004515516,0.00012594,0.00009706741,0.0000277493],"category_scores_gemma":[0.00007006133,0.0001204918,0.00003905524,0.0001849693,0.0001078685,0.0000935749,0.00005249938,0.0002153313,0.00002922108],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002358994,"about_ca_system_score_gemma":0.00001143676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003151167,"about_ca_topic_score_gemma":0.00001105462,"domain_scores_codex":[0.9992177,0.00001616106,0.00022956,0.0002795598,0.00007817691,0.0001787714],"domain_scores_gemma":[0.9990528,0.0003606412,0.00008508138,0.0003215939,0.00005244665,0.0001274189],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002663531,0.00006452276,0.0001011415,0.00005832087,0.00001667855,9.086612e-8,0.0002683006,8.297654e-7,0.02103812,0.9750798,0.0002543584,0.003115169],"study_design_scores_gemma":[0.0003286431,0.00002219378,0.0002120962,0.00001350733,0.00006683332,0.00001936328,0.00008829444,0.001515254,0.005085784,0.9685696,0.02387368,0.0002047571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9760076,0.0001471815,0.01970846,0.001006078,0.00003269396,0.001117002,0.00003198973,0.0001454377,0.001803538],"genre_scores_gemma":[0.9789301,0.00007316236,0.0195266,0.0001394291,0.00006554009,0.0007049121,0.00001617419,0.00002489122,0.0005191599],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02361932,"threshold_uncertainty_score":0.4913513,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01983445087669783,"gpt":0.291133383142799,"spread":0.2712989322661011,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001671371,0.0001675033,0.0004018682,0.0004653766,0.00009333948,0.00001250431,0.0003038762,0.0000928345,0.000116688],"category_scores_gemma":[0.0003063547,0.0001018256,0.0003625162,0.0003677304,0.0004303483,0.0002005053,0.00003734199,0.0001542573,0.000002870929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007424198,"about_ca_system_score_gemma":0.00002963403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.727452e-7,"about_ca_topic_score_gemma":0.000002360425,"domain_scores_codex":[0.9984385,0.0002807823,0.0007024696,0.0001333857,0.0002432523,0.000201597],"domain_scores_gemma":[0.9973019,0.001258689,0.0007598809,0.0003248139,0.0002064362,0.0001482171],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000146274,0.0001623657,0.001908656,0.00005654022,0.0001474621,0.000007047422,0.0002525225,8.329993e-8,0.02258279,0.9643288,0.0006491457,0.009758319],"study_design_scores_gemma":[0.0007972067,0.0001683352,0.003420675,0.0002284959,0.0001427437,0.0001388848,0.0003795004,1.360282e-7,0.01221446,0.9818894,0.0004902221,0.0001299969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9940233,0.001164594,0.002701401,0.0003430775,0.000150255,0.000137064,0.00002499531,0.00002219062,0.001433139],"genre_scores_gemma":[0.9967138,0.0005739019,0.002347733,0.00002667736,0.0000393258,0.000004846281,2.499133e-7,0.00002346191,0.0002699887],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01756055,"threshold_uncertainty_score":0.4152329,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01442548016866956,"gpt":0.2381827723223012,"spread":0.2237572921536317,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002036999,0.0009249045,0.0004134406,0.0006063473,0.00244957,0.001114988,0.002143396,0.002346403,0.3665301],"category_scores_gemma":[0.001109839,0.001601034,0.001563133,0.001598678,0.002146285,0.001020353,0.001458025,0.00180669,0.001027837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008336499,"about_ca_system_score_gemma":0.0009621494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009994215,"about_ca_topic_score_gemma":0.001719849,"domain_scores_codex":[0.9918491,0.0004621437,0.002013977,0.001784572,0.001890662,0.001999584],"domain_scores_gemma":[0.991246,0.002488149,0.002138589,0.002729347,0.0002571532,0.001140798],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0009246072,0.0004692604,0.00001334123,0.0007558052,0.001258208,0.0001060896,0.001635015,0.0002850262,0.007047366,0.7994109,0.1864462,0.001648161],"study_design_scores_gemma":[0.002522831,0.0009718343,0.0001174354,0.0005870775,0.001754611,0.0007164342,0.001397136,0.03531241,0.9397447,0.003932878,0.0113935,0.001549226],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5783156,0.001108966,0.001590359,0.001025043,0.0008758712,0.00009133579,0.0006073209,0.0002048867,0.4161806],"genre_scores_gemma":[0.9857825,0.002141213,0.002492472,0.002047777,0.001649758,0.003237366,0.001275846,0.0006836473,0.0006894149],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9326972,"threshold_uncertainty_score":0.999922,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01686434030436172,"gpt":0.283984919567014,"spread":0.2671205792626523,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007993645,0.0001040881,0.0001066314,0.00004464474,0.0002799759,0.00002749995,0.0000906985,0.00005064483,0.00002072099],"category_scores_gemma":[0.000032048,0.00009194142,0.00002406516,0.0002001213,0.00006217216,0.00006024895,0.00002480664,0.00009042629,0.00006150745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000754273,"about_ca_system_score_gemma":0.00001010745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001686182,"about_ca_topic_score_gemma":0.000007783775,"domain_scores_codex":[0.9994262,0.00001023019,0.0001462864,0.0002213528,0.00007424034,0.000121648],"domain_scores_gemma":[0.9994127,0.000202977,0.00005687877,0.0002176859,0.00002935707,0.00008036644],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004102642,0.00008883845,0.00001407374,0.00002991294,0.000007868731,2.082638e-7,0.0001448634,0.000003400005,0.0003007004,0.9983715,0.0001116689,0.0009228612],"study_design_scores_gemma":[0.0002504392,0.00002637778,0.0001786097,0.00001831689,0.0000266021,0.00000642742,0.00008135945,0.00006031289,0.001079383,0.9787042,0.01944907,0.0001188802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9131601,0.001106459,0.0699707,0.004331592,0.00002471909,0.001242118,0.0001504762,0.0002960339,0.00971776],"genre_scores_gemma":[0.9940565,0.0003268196,0.004534596,0.0002329348,0.00006380727,0.0003174489,0.00001208782,0.00001689411,0.0004389321],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08089633,"threshold_uncertainty_score":0.3749262,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02589419912243921,"gpt":0.2708285482288542,"spread":0.244934349106415,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001290153,0.0001591595,0.0004193983,0.0001747275,0.0001666608,0.00002239416,0.0003924062,0.000108095,0.000152491],"category_scores_gemma":[0.0004104753,0.0001359025,0.000204942,0.000282636,0.0002241877,0.000397303,0.00004480543,0.0003481004,0.00000723017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003394068,"about_ca_system_score_gemma":0.00006586299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006402628,"about_ca_topic_score_gemma":0.000001436176,"domain_scores_codex":[0.9983812,0.0003525503,0.0006576127,0.0001196984,0.0003066302,0.0001823224],"domain_scores_gemma":[0.9982625,0.0007379593,0.0004706219,0.0002944873,0.0001438966,0.00009051929],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005204166,0.000226609,0.0005892123,0.00000851296,0.00006036979,0.0000583432,0.002074482,0.000001993445,0.002195105,0.9933266,0.0008322029,0.0001061744],"study_design_scores_gemma":[0.0009852629,0.0001445525,0.0006666452,0.00006133792,0.00003591572,0.0001144301,0.0007064827,4.880001e-7,0.009965921,0.9838684,0.003312171,0.0001383979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9961672,0.0002416608,0.0002517735,0.0001994974,0.001291734,0.0001154643,0.00000687497,0.00002801969,0.001697718],"genre_scores_gemma":[0.9965851,0.0001428515,0.002685957,0.00004387433,0.0002936903,0.000005779499,0.000001563982,0.00002456519,0.0002166183],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009458183,"threshold_uncertainty_score":0.5541942,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02162383076554246,"gpt":0.2872560561172378,"spread":0.2656322253516953,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006960477,0.0001316884,0.0003212362,0.0002336412,0.00006505733,0.00005353695,0.0001382197,0.00006945674,0.0000071165],"category_scores_gemma":[0.0001318539,0.0001039318,0.00006209037,0.0001979319,0.00008917849,0.0001158894,0.00003796922,0.0001551422,0.000001492109],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000925593,"about_ca_system_score_gemma":0.0000156312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001139914,"about_ca_topic_score_gemma":0.00005684774,"domain_scores_codex":[0.9989138,0.00003973641,0.0006236685,0.00009104353,0.0001811983,0.0001505031],"domain_scores_gemma":[0.9986658,0.0006049582,0.0004527042,0.0001448723,0.00007550279,0.0000561343],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000009249609,0.0003209793,0.004687911,0.000263165,0.00002525324,0.00001921381,0.0007583625,0.000002800164,0.0009689864,0.9913015,0.0003494227,0.001293182],"study_design_scores_gemma":[0.000544799,0.00004228135,0.002435679,0.0001734338,0.00006200376,0.0003018083,0.001783755,0.0001335205,0.0003615608,0.9939093,0.0001405955,0.000111265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9966105,0.0009912234,0.001077949,0.0002237671,0.00002352357,0.000142455,0.000005812612,0.00001580482,0.0009089451],"genre_scores_gemma":[0.9411227,0.0002686139,0.05846711,0.0000218074,0.00003125875,0.000004883554,4.613733e-7,0.00001923433,0.00006395714],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05738916,"threshold_uncertainty_score":0.4238217,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02397068020351504,"gpt":0.3067599322323091,"spread":0.282789252028794,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001332555,0.0001017327,0.0001566517,0.00004035481,0.0001695672,0.00001325798,0.00006436109,0.0000640462,0.00001268679],"category_scores_gemma":[0.0000380294,0.00009567421,0.00005057985,0.0001763733,0.00008061339,0.00006333958,0.000021625,0.00005397146,0.00001006286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000489575,"about_ca_system_score_gemma":0.00001844725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003309506,"about_ca_topic_score_gemma":0.000001762985,"domain_scores_codex":[0.999364,0.00001377078,0.0002447803,0.0001950034,0.00006995309,0.000112453],"domain_scores_gemma":[0.9993324,0.0002595461,0.0001111653,0.0001362038,0.00009845686,0.00006221018],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001407917,0.0001311132,0.00009763869,0.0001104114,0.00002163195,4.438648e-8,0.0002815726,0.00001215256,0.001865567,0.996446,0.0001433416,0.0008764362],"study_design_scores_gemma":[0.0008377607,0.00003793665,0.0005332395,0.00002087275,0.00007062,0.000006455542,0.0001282015,0.0007691705,0.002914108,0.9920221,0.002539766,0.0001197631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8452337,0.0001645511,0.1517942,0.000584557,0.00001205713,0.001284637,0.0001538794,0.00005782416,0.0007145879],"genre_scores_gemma":[0.9736887,0.00005621766,0.02555738,0.00007169908,0.00003477511,0.0004411854,0.00004393825,0.00001650908,0.00008954286],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.128455,"threshold_uncertainty_score":0.3901481,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.042263211883094,"gpt":0.2846238917333784,"spread":0.2423606798502844,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001388636,0.0001467187,0.0001444627,0.00009451094,0.0003235009,0.00002745007,0.0001757856,0.00007738604,0.0001102187],"category_scores_gemma":[0.00006747112,0.0001318805,0.00006642593,0.0003275588,0.00006390671,0.0000835756,0.00002799185,0.0001688606,0.0005534385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007109162,"about_ca_system_score_gemma":0.000003843544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.306248e-7,"about_ca_topic_score_gemma":0.000001347179,"domain_scores_codex":[0.9990484,0.00002633127,0.000277867,0.0003271637,0.0001243745,0.0001959349],"domain_scores_gemma":[0.998932,0.0003406759,0.00009064739,0.0004774694,0.00004105799,0.0001181641],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005824187,0.0002638476,0.000003068239,0.00001405761,0.00001496236,3.356238e-7,0.0001462893,0.000001354,0.0005453041,0.9933666,0.004412244,0.001226116],"study_design_scores_gemma":[0.0003704042,0.00004895133,0.0001112063,0.00001185221,0.00003314917,0.00000628219,0.00004737221,0.0005322424,0.002900498,0.9349124,0.06084622,0.0001794331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7842824,0.004569405,0.009567995,0.02881277,0.0002372278,0.0064215,0.001136014,0.002137837,0.1628349],"genre_scores_gemma":[0.9883781,0.0008513484,0.004047922,0.0006087041,0.0005376592,0.0006054566,0.0000382798,0.00003995285,0.004892595],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2040957,"threshold_uncertainty_score":0.7113517,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Algorithm; Annotation; Computer science; Backtracking; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01111237755658651,"gpt":0.2551491402363759,"spread":0.2440367626797894,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006099335,0.0001351647,0.000348457,0.00001512684,0.0003717059,0.000008421792,0.0007761292,0.00004176746,0.0000593154],"category_scores_gemma":[0.00009838698,0.00006842176,0.0008777063,0.000711793,0.002187611,0.00004016135,0.00003332706,0.0002441764,0.000003456927],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002058962,"about_ca_system_score_gemma":0.00003859708,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003144218,"about_ca_topic_score_gemma":0.00000743435,"domain_scores_codex":[0.9987699,0.0001482524,0.0004412588,0.0001272267,0.0003202053,0.0001931169],"domain_scores_gemma":[0.996602,0.001829215,0.0005938324,0.0008661973,0.00007181287,0.00003692139],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003129915,0.0005369975,0.0001572485,0.0002354553,0.0004282826,1.778017e-8,0.003066714,0.0003471065,0.009939175,0.9838187,0.000555304,0.0008836716],"study_design_scores_gemma":[0.000246302,0.0000660635,0.001065925,0.0001051954,0.0003820822,0.000003505383,0.002618762,0.002490468,0.02906754,0.9636465,0.0001967793,0.0001108269],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6459889,0.000009809957,0.348207,0.002147946,0.0000600746,0.0005074712,0.0000361188,0.00002908614,0.003013573],"genre_scores_gemma":[0.9939156,0.00002035546,0.005675855,0.00004633459,0.00001196785,0.00001539254,1.539593e-7,0.00001782218,0.0002964829],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3479267,"threshold_uncertainty_score":0.8060343,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03212277417922123,"gpt":0.2675024210694715,"spread":0.2353796468902502,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001194206,0.0001679484,0.0001772099,0.00008002886,0.0003738172,0.00003373818,0.0001053659,0.00007391673,0.0001361723],"category_scores_gemma":[0.00005652431,0.000136467,0.00003289852,0.0003037939,0.0001264705,0.00008858028,0.0000334412,0.000162318,0.00007879148],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005754022,"about_ca_system_score_gemma":0.000005521015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001870738,"about_ca_topic_score_gemma":0.000007571666,"domain_scores_codex":[0.9991479,0.0000364298,0.0001673619,0.0003449645,0.0001182478,0.0001851228],"domain_scores_gemma":[0.9987269,0.000684555,0.00007355521,0.0003318715,0.00005037928,0.000132751],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000842142,0.0002020222,0.00005793136,0.00002758026,0.0000277383,4.031517e-7,0.0001805799,9.010644e-7,0.0003491025,0.9958363,0.00054165,0.002767398],"study_design_scores_gemma":[0.0005001741,0.000133685,0.0004166909,0.00002003072,0.00006476876,0.0000221413,0.00007864824,0.001449899,0.0008941105,0.9910335,0.005156578,0.000229789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9813362,0.0003671634,0.009981953,0.001044413,0.0000129027,0.0009287113,0.00005474328,0.0001946169,0.006079277],"genre_scores_gemma":[0.9974553,0.000121164,0.001232831,0.0002760439,0.0000307735,0.0004220071,0.000009315188,0.00002505047,0.0004275172],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01611908,"threshold_uncertainty_score":0.5564964,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.08588413040324633,"gpt":0.3603405379379723,"spread":0.2744564075347259,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006572507,0.00009599017,0.0003021064,0.0001134659,0.00006279198,0.00003687217,0.0001421669,0.0001165353,0.00002055928],"category_scores_gemma":[0.0001931295,0.00008089026,0.0001398097,0.00009684927,0.00004526184,0.0005856554,0.0000246994,0.0001505039,3.789677e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001809593,"about_ca_system_score_gemma":0.00004438928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.155e-7,"about_ca_topic_score_gemma":1.38781e-7,"domain_scores_codex":[0.9987203,0.0000103733,0.000876568,0.00005757044,0.0001891956,0.000145935],"domain_scores_gemma":[0.9986572,0.0003224514,0.0004129968,0.00008836408,0.0004270523,0.00009191405],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008321312,0.0004615664,0.00007788299,0.000599879,0.0001292099,3.432286e-8,0.002936923,0.003552424,0.07530315,0.899968,0.001105822,0.01503295],"study_design_scores_gemma":[0.001432478,0.00008206582,0.000001073899,0.00008122346,0.00009514184,0.00001594567,0.0005999008,0.5789453,0.1368871,0.2808144,0.0009307605,0.0001146014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.63375,0.00007689369,0.3653853,0.0002113948,0.00001528136,0.0002022629,0.00002246936,0.000009223562,0.0003272163],"genre_scores_gemma":[0.8841238,0.000005518812,0.1157226,0.00003529419,0.00006929805,0.00001375247,0.00001814568,0.000005623398,0.000005965459],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6191536,"threshold_uncertainty_score":0.3298609,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0166607335621283,"gpt":0.2614344763565729,"spread":0.2447737427944446,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002946775,0.000188404,0.0004004615,0.00006723432,0.0002099998,0.00005066294,0.0003115256,0.00005216682,0.00003602394],"category_scores_gemma":[0.0003399648,0.0001369289,0.0001502211,0.0005798434,0.0002798286,0.00007275998,0.00008279443,0.00009229356,0.00001198549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002412635,"about_ca_system_score_gemma":0.00005032641,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003366766,"about_ca_topic_score_gemma":0.000003300016,"domain_scores_codex":[0.9987901,0.00008056891,0.0003951491,0.0002855304,0.000186295,0.0002623066],"domain_scores_gemma":[0.9985912,0.0002368945,0.0003526375,0.0005787665,0.0001443689,0.00009612202],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002957117,0.0001790101,0.0007854034,0.0007465892,0.00009445784,4.199647e-7,0.0003917533,0.000006804049,0.006512874,0.9895581,0.001501184,0.0001938204],"study_design_scores_gemma":[0.0009114507,0.0001795572,0.008751106,0.0007235503,0.0003965836,0.00002515115,0.0006602823,0.0001491522,0.009051192,0.9776431,0.001032624,0.0004761998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9907945,0.0003395677,0.002939306,0.003119653,0.00003176806,0.001192841,0.0001298164,0.00009732538,0.001355172],"genre_scores_gemma":[0.991352,0.00007001517,0.007753158,0.00009140361,0.0000262158,0.0001453395,0.000005196392,0.00003798453,0.000518647],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01191496,"threshold_uncertainty_score":0.55838,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03238476641123778,"gpt":0.3083849609204666,"spread":0.2760001945092288,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001996523,0.0001067199,0.0001523812,0.0000822853,0.0001613876,0.000007862726,0.0001479994,0.0000664922,0.000107803],"category_scores_gemma":[0.00003825863,0.00009384001,0.0000614376,0.0003916797,0.00006323009,0.0001265612,0.00004316019,0.0000862386,0.00006456939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003272488,"about_ca_system_score_gemma":0.000009060683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002394579,"about_ca_topic_score_gemma":9.042323e-7,"domain_scores_codex":[0.99929,0.00002445529,0.0002624186,0.00013981,0.00009888726,0.0001844412],"domain_scores_gemma":[0.9991449,0.000246255,0.0001326993,0.0002954828,0.00006820355,0.0001124663],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001886265,0.0001979863,0.0006713214,0.00006463702,0.00001754773,1.591201e-8,0.0002483011,9.641992e-8,0.0028746,0.9942673,0.0003993585,0.001256911],"study_design_scores_gemma":[0.0001581642,0.00001715933,0.001520374,0.00001342439,0.00009269781,0.000005950872,0.0001746754,0.00003955805,0.01101639,0.9524117,0.03439006,0.0001598766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9706006,0.003761697,0.01293881,0.0004520373,0.00004584422,0.001048745,0.0001040964,0.000174795,0.01087338],"genre_scores_gemma":[0.9887189,0.0003209318,0.0101329,0.00004550293,0.0001006331,0.0003040077,0.00001506804,0.00001703066,0.0003450047],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04185567,"threshold_uncertainty_score":0.3826685,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03972558784374208,"gpt":0.2700413748783405,"spread":0.2303157870345984,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003108379,0.0000621796,0.0001562926,0.00002573862,0.0000304756,0.000007686709,0.0001952388,0.00008208564,0.00009853209],"category_scores_gemma":[0.0003480372,0.00005169929,0.00006059398,0.0001043182,0.0001018681,0.00001614037,0.000005039291,0.0001699607,9.12032e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004234771,"about_ca_system_score_gemma":0.0004415406,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008594773,"about_ca_topic_score_gemma":0.0001964521,"domain_scores_codex":[0.9994617,0.00001921739,0.0002300816,0.00005087442,0.0000989071,0.0001392596],"domain_scores_gemma":[0.999027,0.000122045,0.0002184886,0.0001301497,0.0001011718,0.0004011363],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002928105,0.0003713543,0.01777353,0.0004086345,0.0004695545,0.0005425184,0.00551948,0.0007645921,0.02237719,0.8687127,0.08070704,0.002060571],"study_design_scores_gemma":[0.0002807244,0.00006475391,0.00008976908,0.00009443446,0.00002641303,0.0001059851,0.000418306,0.000004954454,0.02562695,0.9703023,0.00290288,0.00008255216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9758968,0.0001920954,0.000012183,0.0002562878,0.00006104467,0.00002438347,0.000005063338,0.000002805593,0.02354932],"genre_scores_gemma":[0.9992329,0.000001475304,0.0003561302,0.00004702721,0.0001605712,0.000001158925,5.501439e-7,0.000005561417,0.0001945496],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1015895,"threshold_uncertainty_score":0.2108236,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01713236139613076,"gpt":0.2810271631251643,"spread":0.2638948017290335,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001292118,0.0001292604,0.0001433829,0.00004372087,0.0003461955,0.00003462121,0.0001558599,0.00007547386,0.0001857825],"category_scores_gemma":[0.00001927645,0.0001199058,0.00005452862,0.000188885,0.00003775223,0.0000830766,0.00005367092,0.0001110897,0.0002238702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006300736,"about_ca_system_score_gemma":0.00001032641,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002709574,"about_ca_topic_score_gemma":0.00002142823,"domain_scores_codex":[0.999181,0.00002376919,0.0002426583,0.0002664143,0.0001022583,0.0001839054],"domain_scores_gemma":[0.9992309,0.0002548301,0.00008365182,0.0003182298,0.00004824819,0.00006412634],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000018503,0.0001465727,0.000143859,0.00001175547,0.00001413211,1.647028e-7,0.0001328464,5.824809e-7,0.00261083,0.9950621,0.001587235,0.000288111],"study_design_scores_gemma":[0.0001754946,0.00000553657,0.0009127049,0.000006559818,0.0000507065,0.000001827342,0.0001004284,0.0003616928,0.003239638,0.9162763,0.07873209,0.0001370686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9334357,0.0008535172,0.05440338,0.001018515,0.00002436191,0.0007551499,0.0003890688,0.000343107,0.008777146],"genre_scores_gemma":[0.9875298,0.00004570034,0.009753379,0.0001935624,0.0003244294,0.0004153361,0.0001662552,0.00002855334,0.00154297],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07878581,"threshold_uncertainty_score":0.4889616,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02010410939671536,"gpt":0.2738195751573895,"spread":0.2537154657606742,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001700548,0.0001107034,0.000148446,0.00006915663,0.0001882665,0.00005101795,0.0005527231,0.00002839376,0.00006775791],"category_scores_gemma":[0.0005837439,0.00006592878,0.0001277025,0.0002109633,0.00008763045,0.00004622851,0.00003571631,0.001008723,0.00004405944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008492434,"about_ca_system_score_gemma":0.00002837517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.463214e-8,"about_ca_topic_score_gemma":4.108693e-7,"domain_scores_codex":[0.9988937,0.0003149612,0.0003421579,0.00007237602,0.000250442,0.0001263522],"domain_scores_gemma":[0.9983594,0.0006229376,0.0004055054,0.000365562,0.0001592862,0.00008728622],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001877547,0.000138757,0.0001281472,0.000005351571,0.00002401762,0.00002994459,0.0003038298,0.000002819954,0.0005166447,0.9901883,0.008103821,0.0005395699],"study_design_scores_gemma":[0.0006400105,0.0001666734,0.00273219,0.00002597619,0.00003127618,0.0001378887,0.00005792167,0.000007033322,0.000413019,0.9495197,0.04618246,0.00008583201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9603971,0.00003869163,0.001882326,0.001110645,0.0008709024,0.000104271,0.000002052434,0.00002510875,0.03556886],"genre_scores_gemma":[0.9990274,0.000007838732,0.0001831141,0.0002331285,0.0001552695,8.13453e-7,2.337032e-7,0.0000276216,0.0003645727],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04066861,"threshold_uncertainty_score":0.4382457,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02646983396851626,"gpt":0.2914175538317178,"spread":0.2649477198632015,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003345138,0.00008537697,0.0001321647,0.00002571202,0.0001670101,0.00000836362,0.0002202771,0.00004629057,0.00001868231],"category_scores_gemma":[0.0002695733,0.00006028341,0.00015111,0.0002115826,0.00009877131,0.00003422545,0.00001949716,0.00006172611,0.000003256144],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007193452,"about_ca_system_score_gemma":0.00001994264,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001472003,"about_ca_topic_score_gemma":0.000002122246,"domain_scores_codex":[0.9993854,0.00007652708,0.0001844404,0.0001160934,0.0001009703,0.0001366191],"domain_scores_gemma":[0.9990495,0.0003126505,0.0001136774,0.0004365832,0.00005710655,0.00003046114],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004115997,0.00007111548,0.0008678836,0.00002644892,0.00002230364,3.996976e-8,0.0002095416,2.835588e-7,0.0005724691,0.9966717,0.001510833,0.00004326018],"study_design_scores_gemma":[0.0003223915,0.00002528077,0.0004361102,0.00001456994,0.00003869464,9.176739e-7,0.0001031036,0.000004656295,0.02372898,0.9720381,0.003214027,0.00007316212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9902866,0.0000484201,0.0001554932,0.0001800513,0.0004931874,0.0005562825,0.0000198395,0.0000348652,0.008225245],"genre_scores_gemma":[0.9982172,0.000003813151,0.001252682,0.00003249511,0.0000016812,0.00009487112,0.000001392343,0.00001501024,0.0003809023],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0246336,"threshold_uncertainty_score":0.2458286,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02039042805831651,"gpt":0.2779599707815474,"spread":0.2575695427232309,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001843505,0.00007397333,0.0001079904,0.00002546829,0.0002877682,0.000007464312,0.0002862469,0.00003777677,0.00002070716],"category_scores_gemma":[0.00005350546,0.00004223536,0.00008005495,0.0004374198,0.0001832264,0.00002572544,0.00005795109,0.0000856906,0.000006609165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002348106,"about_ca_system_score_gemma":0.00001478077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000504354,"about_ca_topic_score_gemma":0.00002017497,"domain_scores_codex":[0.9993963,0.00003116189,0.0002517338,0.0001128624,0.0001006428,0.000107286],"domain_scores_gemma":[0.9988464,0.0004146401,0.0001610642,0.0004905151,0.00005614743,0.00003128461],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004074879,0.0000726766,0.0002645576,0.00001610626,0.00001853714,1.721935e-8,0.0001074262,9.798492e-7,0.002115481,0.9963734,0.0002013747,0.0008253242],"study_design_scores_gemma":[0.0001086841,0.00001306638,0.001537586,0.00001178249,0.000045789,0.000005655425,0.0001425029,0.0001073015,0.01365403,0.9592873,0.0250316,0.00005465017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9759313,0.0008426873,0.007323488,0.005017943,0.00003648983,0.001343367,0.00006171909,0.00005371882,0.009389323],"genre_scores_gemma":[0.9981571,0.0003437191,0.0004788233,0.00003782496,0.00004227326,0.0001722539,0.000001986188,0.000009859108,0.0007561759],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03708609,"threshold_uncertainty_score":0.2213309,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0516463126219221,"gpt":0.2780597385568273,"spread":0.2264134259349052,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001362179,0.0001253034,0.0002309879,0.00003249701,0.0004556183,0.00003075975,0.0004182349,0.00006324291,0.00001572766],"category_scores_gemma":[0.0009695332,0.00009018093,0.0001251533,0.0004423279,0.0002361089,0.00004571442,0.0001388923,0.0001890935,0.000006090098],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003462457,"about_ca_system_score_gemma":0.00001079884,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000334152,"about_ca_topic_score_gemma":0.000003744645,"domain_scores_codex":[0.998688,0.0001924774,0.0004663981,0.0002098438,0.0002140919,0.0002291274],"domain_scores_gemma":[0.9964745,0.002415067,0.000234616,0.0006488053,0.0001769313,0.00005007795],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008085162,0.0003073509,0.003806466,0.00004442246,0.0000184315,1.811841e-7,0.0004533374,0.00004861811,0.00004485809,0.9906207,0.0003404963,0.00430704],"study_design_scores_gemma":[0.0006532516,0.00002630579,0.000856251,0.00002008959,0.00001574932,0.000001880378,0.0000580081,0.01119891,0.0004188618,0.9858222,0.0008305536,0.00009793676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9846083,0.0002595784,0.007616933,0.0003898984,0.0002177249,0.0005497437,0.000001684289,0.0001246005,0.006231516],"genre_scores_gemma":[0.9990141,0.0000091389,0.0007556573,0.00001187548,0.00002381155,0.00001543136,4.790236e-7,0.00001239838,0.0001570965],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01440579,"threshold_uncertainty_score":0.3677471,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Bounding overwatch; Variable (mathematics); Combinatorics; Graph; Mathematics; Computer science; Artificial intelligence; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.03964920218428527,"gpt":0.3063905946128505,"spread":0.2667413924285653,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.004208002,0.0004130149,0.0006844946,0.0003498337,0.0005985248,0.0002242577,0.001120457,0.0002170819,0.00007046669],"category_scores_gemma":[0.0001797047,0.0002865879,0.0002065186,0.0004219431,0.007858342,0.0001821393,0.0006717776,0.0004567556,0.000001065514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003189153,"about_ca_system_score_gemma":0.00009485373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001545498,"about_ca_topic_score_gemma":0.000002741741,"domain_scores_codex":[0.9973024,0.00003492404,0.0008153719,0.0006106652,0.000665299,0.0005714107],"domain_scores_gemma":[0.9963578,0.00196704,0.0002993601,0.0009476977,0.0002720349,0.0001560482],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003188716,0.00007250073,0.000005433967,0.0005354519,0.00003392493,0.000002721953,0.0008669227,0.000003479792,0.00005862246,0.9976872,0.000008634521,0.0006931936],"study_design_scores_gemma":[0.0002307912,0.0001401694,0.000005416749,0.0004565449,0.00008316771,0.00005411364,0.00011595,0.007392158,0.0004190542,0.990586,0.0001908693,0.0003257302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003718812,0.0001712267,0.808218,0.0002575454,0.0002173647,0.0017096,0.0001440152,0.00006179861,0.1855016],"genre_scores_gemma":[0.3963723,0.00009614748,0.600789,0.00009070285,0.0001448135,0.0001156267,0.00002036318,0.000130768,0.002240338],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3926535,"threshold_uncertainty_score":0.9999586,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02818967378203269,"gpt":0.3161277883203332,"spread":0.2879381145383005,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000487533,0.0001161027,0.0002042435,0.0001268604,0.00008221789,0.00001023267,0.0001531452,0.00007607941,0.00004673336],"category_scores_gemma":[0.0001349499,0.0001033384,0.00004138316,0.000606771,0.0000700646,0.00004618839,0.00001579682,0.0001168366,0.00001179268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004992746,"about_ca_system_score_gemma":0.00002231758,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001318342,"about_ca_topic_score_gemma":0.00004562532,"domain_scores_codex":[0.9991492,0.0001075767,0.0003112031,0.0002000769,0.00007974259,0.000152188],"domain_scores_gemma":[0.9989436,0.0005506361,0.000103457,0.0002712409,0.00007431691,0.00005679756],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001497574,0.000211743,0.000398121,0.00001868338,0.00001270655,1.993075e-7,0.0002204235,0.000007521359,0.002267827,0.9956827,0.0002134037,0.0009516909],"study_design_scores_gemma":[0.0002867221,0.00004129495,0.08743746,0.00001419762,0.00002216679,0.000003590304,0.00006552223,0.001282328,0.003744311,0.9067329,0.0002371745,0.0001323073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9927539,0.000509971,0.00375747,0.0002316394,0.000008755704,0.000710357,0.0001262827,0.0002254386,0.001676135],"genre_scores_gemma":[0.9982798,0.00005928352,0.00128216,0.00009838,0.00001886631,0.000129066,0.0000453882,0.00001025614,0.00007682415],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08894978,"threshold_uncertainty_score":0.4214019,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Pure mathematics; Computer science; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.01437029627748487,"gpt":0.2601400983097861,"spread":0.2457698020323012,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001976591,0.0001097551,0.0001852223,0.00006926704,0.00007856883,0.000009340824,0.0002069379,0.00007715334,0.00006892707],"category_scores_gemma":[0.00004541977,0.0001065923,0.00008590676,0.0002740474,0.00008883858,0.00005299368,0.00004230217,0.00009686703,0.00003004674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001522746,"about_ca_system_score_gemma":0.00002153553,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005427718,"about_ca_topic_score_gemma":0.000006816008,"domain_scores_codex":[0.9992142,0.00003784442,0.0002747145,0.0001471607,0.000157125,0.0001689677],"domain_scores_gemma":[0.9991706,0.0001997767,0.0001235456,0.0004019858,0.00006684332,0.00003723653],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006517258,0.0003028881,0.002980603,0.00002388265,0.00001339889,9.785263e-7,0.00006302907,0.000001428583,0.002710645,0.9893924,0.004364473,0.0001397305],"study_design_scores_gemma":[0.000436957,0.00002548932,0.002914,0.00001649061,0.00001743454,0.000002374358,0.00003893352,0.00002207405,0.01831966,0.9764237,0.001673924,0.0001089497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9823533,0.00005920276,0.0001157098,0.0001326474,0.0002591238,0.0001735772,0.000008212503,0.00009080373,0.01680747],"genre_scores_gemma":[0.9987243,0.000002551364,0.0003806221,0.00002489584,0.000009197819,0.00002823129,0.000005272938,0.00001922535,0.0008056596],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01637109,"threshold_uncertainty_score":0.4346707,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03118045448873361,"gpt":0.275558406971572,"spread":0.2443779524828384,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001436086,0.0001072062,0.000113789,0.00001517271,0.0005835613,0.00002242693,0.0003294493,0.0000374823,0.0001832977],"category_scores_gemma":[0.00003141662,0.00006414943,0.00006865149,0.0002390737,0.0000921535,0.00003205509,0.00008011999,0.0001002505,0.00005027241],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006149658,"about_ca_system_score_gemma":0.00000585039,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001523946,"about_ca_topic_score_gemma":0.000004894728,"domain_scores_codex":[0.9992188,0.0000366736,0.0002806599,0.0001692943,0.000134337,0.0001602789],"domain_scores_gemma":[0.9989381,0.0003229936,0.0001489454,0.000490221,0.00004868564,0.00005106019],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001432369,0.0001175256,0.00003982481,0.00002038369,0.00002164706,2.117209e-8,0.0002802984,1.695479e-7,0.002849883,0.9819611,0.01341343,0.001294303],"study_design_scores_gemma":[0.0003749168,0.00003870407,0.0003056306,0.00001983334,0.00009636681,0.000006281015,0.0002191974,0.004433302,0.04313388,0.5390035,0.412165,0.0002033627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9047511,0.005558937,0.009859469,0.05351044,0.0001370499,0.007019178,0.001404301,0.0002736054,0.01748597],"genre_scores_gemma":[0.9953751,0.0003428937,0.0003726689,0.0002900654,0.00005589638,0.00040597,0.000006466164,0.00001593546,0.003134998],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4429576,"threshold_uncertainty_score":0.4488341,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05578229098441052,"gpt":0.3101216922915193,"spread":0.2543394013071087,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002600411,0.0001229251,0.0001789926,0.00007669113,0.0001471042,0.00001709916,0.0001461627,0.00006194752,0.0000162988],"category_scores_gemma":[0.00007388186,0.0001140825,0.00003866048,0.0002909985,0.00008041417,0.0001007811,0.00007195125,0.0001132089,0.00001328465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005102127,"about_ca_system_score_gemma":0.00002522273,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006220367,"about_ca_topic_score_gemma":0.00000922248,"domain_scores_codex":[0.9991822,0.00003363514,0.0002703285,0.0002388772,0.0001172773,0.0001576292],"domain_scores_gemma":[0.9991475,0.0001885772,0.0001247118,0.0003038752,0.00007068246,0.0001646182],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004331411,0.00008324997,0.0003261447,0.0000621396,0.00001468689,1.846175e-7,0.0003345168,5.382194e-7,0.003204028,0.9939449,0.0001242457,0.001901016],"study_design_scores_gemma":[0.0002708323,0.00003878901,0.0008386109,0.00002574971,0.00005172402,0.00001415393,0.0003713749,0.0003161053,0.006243427,0.9893798,0.0023058,0.0001436153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9827585,0.0009084007,0.01183453,0.0009948994,0.00002504916,0.0006354881,0.00003958859,0.00009862583,0.002704954],"genre_scores_gemma":[0.9945524,0.0001651244,0.004829893,0.00003952501,0.00004875865,0.0001452975,0.000008360296,0.0000172999,0.0001933079],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01179397,"threshold_uncertainty_score":0.465215,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01528840422355427,"gpt":0.2585444942038324,"spread":0.2432560899802781,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001088279,0.00008112933,0.0001143288,0.00002867489,0.0005885201,0.00001123046,0.0002885463,0.00004090182,0.0000124831],"category_scores_gemma":[0.00006841989,0.00005267485,0.0001215289,0.0001378662,0.0001180524,0.00004722035,0.00001934893,0.0009227321,0.00000699566],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008154298,"about_ca_system_score_gemma":0.0002884794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002903061,"about_ca_topic_score_gemma":0.00005269158,"domain_scores_codex":[0.9985104,0.00008328249,0.0002568804,0.00007331934,0.000140236,0.0009358674],"domain_scores_gemma":[0.9992231,0.0002641835,0.0001982253,0.0002141481,0.00006282877,0.00003753242],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002047007,0.00004229363,0.0002275779,0.00000123412,0.00006206605,5.70327e-7,0.00007841113,0.00003031047,0.0001535116,0.9972477,0.000484589,0.001651265],"study_design_scores_gemma":[0.0001958402,0.00007987454,0.0001479497,0.000005737042,0.00002346461,0.0003964743,0.0002772326,0.0001691963,0.0001680901,0.9959438,0.002536271,0.00005608128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9573473,0.002995455,0.03695521,0.000845983,0.0001420679,0.0001731533,9.498128e-7,0.00003510714,0.001504809],"genre_scores_gemma":[0.9920556,0.006093895,0.0001211313,0.00001929909,0.0001551418,0.0000065506,5.531297e-7,0.00001324774,0.001534564],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03683408,"threshold_uncertainty_score":0.4526481,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Wiener index; Polarity (international relations); Index (typography); Graph; Statistics; Combinatorics; Chemistry; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01753218901229056,"gpt":0.2644962159810108,"spread":0.2469640269687202,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008780154,0.00008092324,0.0001300136,0.00003252105,0.0001520489,0.00001698951,0.0003147413,0.00004781073,0.000004526706],"category_scores_gemma":[0.0006318356,0.00005475694,0.00005740122,0.000294727,0.0001307502,0.00005578646,0.0000454285,0.0001192986,0.00001040378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006996019,"about_ca_system_score_gemma":0.00001863258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008842341,"about_ca_topic_score_gemma":0.000004342249,"domain_scores_codex":[0.9992762,0.0001064112,0.0002137138,0.0001176222,0.0001524562,0.0001336526],"domain_scores_gemma":[0.9985802,0.0004976264,0.0001552823,0.0005767004,0.0001559102,0.00003427982],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007832375,0.0001107621,0.001534699,0.00001456371,0.00001790244,9.505251e-8,0.00009805111,2.101734e-7,0.0005750025,0.9953251,0.001854019,0.0004617283],"study_design_scores_gemma":[0.0002381561,0.0000334303,0.00255164,0.000007254187,0.00001936637,0.000001026294,0.00003088888,0.00001105998,0.003964701,0.9804858,0.012591,0.00006568305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9945451,0.00006013945,0.0001207853,0.0008497317,0.000515426,0.0001855083,0.000001686765,0.00004256467,0.003679031],"genre_scores_gemma":[0.9994525,0.000005178989,0.000261475,0.00004213666,0.0000113545,0.00001776735,8.755164e-7,0.00001134077,0.0001974036],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01483934,"threshold_uncertainty_score":0.2232923,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Combinatorics; Sums of powers; Graph; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02136883443742171,"gpt":0.2740425652291751,"spread":0.2526737307917534,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003168111,0.0001204982,0.0003317036,0.00006645325,0.00004239488,0.000003767279,0.0003725466,0.00005772653,0.0000401758],"category_scores_gemma":[0.0001419119,0.00007771752,0.0002645919,0.0003640258,0.000338617,0.00003122501,0.0000670002,0.00006806033,0.000001485727],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004582121,"about_ca_system_score_gemma":0.00001817091,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002428445,"about_ca_topic_score_gemma":0.00002113605,"domain_scores_codex":[0.9988661,0.00003992128,0.0006175489,0.00009404934,0.0002581321,0.0001242705],"domain_scores_gemma":[0.9982068,0.000404601,0.0006074558,0.0006599879,0.0001021912,0.0000189533],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004105859,0.0001734321,0.0006221337,0.0004992514,0.00003576697,8.79998e-8,0.0008283194,0.00002659104,0.0117271,0.9857363,0.00032799,0.0000189434],"study_design_scores_gemma":[0.0001675521,0.00002222404,0.000802642,0.0001704951,0.0001051327,0.000002347549,0.00086235,0.0001903296,0.0680093,0.9295462,0.00004079106,0.00008068358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9803874,0.0000562499,0.005762168,0.00006352748,0.00002969128,0.0003450834,0.00008495102,0.00002054466,0.01325036],"genre_scores_gemma":[0.9760631,0.000003893094,0.02361689,0.000002997792,0.000008212999,0.0000138143,0.000002909841,0.00001825575,0.0002698863],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05628219,"threshold_uncertainty_score":0.3169229,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03530198614291502,"gpt":0.2710003486580169,"spread":0.2356983625151019,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003312977,0.0001794109,0.000374353,0.00002590245,0.0002405703,0.000008964159,0.0003122636,0.00006973368,0.00001795634],"category_scores_gemma":[0.0002675691,0.0001213642,0.00008981569,0.000312718,0.0007405842,0.00003318939,0.00008586489,0.0001076684,0.000003197007],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005214458,"about_ca_system_score_gemma":0.00002329124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001569695,"about_ca_topic_score_gemma":0.000006547431,"domain_scores_codex":[0.9987896,0.0000194373,0.0005663967,0.0001723793,0.0002500813,0.0002021132],"domain_scores_gemma":[0.996753,0.002016708,0.0004265443,0.0006479995,0.0000991953,0.00005660293],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002213154,0.000116366,0.00005723255,0.0002911415,0.00005766887,4.970389e-7,0.00224346,7.666002e-7,0.005653867,0.9908715,0.0004219643,0.0002633451],"study_design_scores_gemma":[0.0003411294,0.00002543586,0.0002809832,0.0000468442,0.00007419045,0.000009691691,0.001570953,0.00009743974,0.008286616,0.9886718,0.0004503856,0.0001445165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9483125,0.0002271282,0.02163709,0.0001979198,0.00002834087,0.0008831387,0.00007086522,0.00006274277,0.02858026],"genre_scores_gemma":[0.9371871,0.0001593445,0.0622305,0.00001185714,0.000009232926,0.00009055663,0.000002532705,0.00002938455,0.0002794881],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04059341,"threshold_uncertainty_score":0.494909,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Thompson Rivers University","funders":"Nankai University","keywords":"Mathematics; Component (thermodynamics); Combinatorics; Graph; Connected component; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0350786003977944,"gpt":0.2583127908626447,"spread":0.2232341904648504,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003324358,0.0003083221,0.0004263597,0.0002159732,0.0001399893,0.00003861055,0.0003377965,0.00007319283,0.00003806707],"category_scores_gemma":[0.00001441976,0.0002456362,0.00008344925,0.0004062241,0.00007842139,0.00006517567,0.0000336917,0.0002566633,0.00003870349],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004081033,"about_ca_system_score_gemma":0.000007173584,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003294352,"about_ca_topic_score_gemma":0.000009928696,"domain_scores_codex":[0.9984176,0.00002219531,0.0004547177,0.0003115254,0.0003286635,0.0004653279],"domain_scores_gemma":[0.998767,0.0003327325,0.000201782,0.0005791315,0.00001762506,0.0001017554],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000177022,0.0009115309,0.0002967964,0.00006264453,0.00002951487,0.000006739144,0.001709477,0.00001287745,0.0379796,0.9581999,0.0007199462,0.000053334],"study_design_scores_gemma":[0.001439678,0.0000410404,0.005534846,0.0001063235,0.00006066444,0.00000979061,0.000812793,0.0001436819,0.005620968,0.9853472,0.0003861839,0.0004968679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9803348,0.000004033117,0.01338363,0.0007559912,0.00002029952,0.0007331498,0.00001222674,0.000180496,0.004575334],"genre_scores_gemma":[0.9600335,0.000002211538,0.03889872,0.0008968845,0.00001274312,0.00007107933,0.00003066855,0.00003600873,0.0000182248],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03235863,"threshold_uncertainty_score":0.9999996,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1057745998301974,"gpt":0.3979588401396671,"spread":0.2921842403094697,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0243838,0.0001288137,0.0002268923,0.000515685,0.0005841313,0.00009222646,0.0007524376,0.00004146219,0.0002624534],"category_scores_gemma":[0.001795066,0.00008573545,0.0001814698,0.0009585709,0.0002123277,0.0001672196,0.0001095265,0.0006506211,0.00002672515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004136107,"about_ca_system_score_gemma":0.0002541099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004327893,"about_ca_topic_score_gemma":0.000003271928,"domain_scores_codex":[0.9963825,0.001107737,0.000837842,0.00019069,0.001052844,0.0004284134],"domain_scores_gemma":[0.9946207,0.00275807,0.0001636415,0.0003403368,0.001907087,0.0002101035],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002737222,0.0002363619,0.0002320953,0.00002889848,0.0001030818,0.00001756099,0.0007555925,0.0004503138,0.0122551,0.9785454,0.00659947,0.0005023922],"study_design_scores_gemma":[0.001556324,0.001124881,0.00493131,0.0001517128,0.00004727472,0.0002550799,0.001095773,0.0001340929,0.01670977,0.9628754,0.0109155,0.0002028411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8531373,0.0008266697,0.1049642,0.00559658,0.0002808434,0.001975698,0.0001464868,0.00002595633,0.0330463],"genre_scores_gemma":[0.986367,0.00002092104,0.01226268,0.0001291743,0.0002175772,0.00001062666,0.000009031095,0.00004030375,0.0009426242],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1332297,"threshold_uncertainty_score":0.8450987,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01803250358319958,"gpt":0.240441319587934,"spread":0.2224088160047344,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001181752,0.00008084749,0.0001568881,0.00005276865,0.0001021532,0.00003696239,0.0002160383,0.00007477405,0.00001434204],"category_scores_gemma":[0.0001596987,0.00007867772,0.00006382259,0.00003274512,0.0002060693,0.00004312408,0.00000927274,0.0001481201,2.004525e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002146586,"about_ca_system_score_gemma":0.0001653304,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005610783,"about_ca_topic_score_gemma":0.0005075464,"domain_scores_codex":[0.9995045,0.00001120757,0.0002109099,0.00006958414,0.00008449396,0.0001193069],"domain_scores_gemma":[0.9989935,0.00001785486,0.0003703647,0.0002708031,0.0001016126,0.0002458725],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008954206,0.000007310696,0.006135431,0.0001358314,0.0000576095,0.00003996111,0.0002861792,0.000003840852,0.9835684,0.009553886,0.00004315672,0.0001593906],"study_design_scores_gemma":[0.0003108545,0.00001696054,0.003407293,0.0001037249,0.0000794724,0.00020802,0.0002110964,0.00001574086,0.4336734,0.5617058,0.0001498431,0.0001178689],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9953715,0.0002806689,0.00001578327,0.0001117224,0.00004148011,0.00003422072,0.00001058991,0.000002076848,0.004131995],"genre_scores_gemma":[0.999658,0.000007547539,0.0002188551,0.00000745322,0.00004812578,9.425718e-7,7.488213e-7,0.000009765906,0.00004853708],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5521519,"threshold_uncertainty_score":0.3208384,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Matching (statistics); Combinatorics; 3-dimensional matching; Graph; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01770208721375691,"gpt":0.2980210620098964,"spread":0.2803189747961394,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007485838,0.0000955861,0.0001530939,0.00001445976,0.0003345047,0.00003143128,0.0001587558,0.00004902548,0.00001087405],"category_scores_gemma":[0.0001533997,0.00005667213,0.00006938174,0.0002319711,0.0001243225,0.00004822305,0.0000502912,0.000178722,0.00001882551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001594101,"about_ca_system_score_gemma":0.00001065903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000453253,"about_ca_topic_score_gemma":0.000004365338,"domain_scores_codex":[0.9992436,0.0001305578,0.0002238294,0.0001160814,0.0001602571,0.0001256526],"domain_scores_gemma":[0.9983294,0.001131131,0.0001971051,0.0002737801,0.00004470881,0.00002385104],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001434873,0.00008430325,0.001131793,0.00001035461,0.0000326506,1.632093e-7,0.002916099,0.000006733454,0.0001507049,0.9954766,0.00008551558,0.00009073169],"study_design_scores_gemma":[0.001083817,0.000007990755,0.003342974,0.00004778214,0.00003505993,0.000003205623,0.000314136,0.00001997108,0.0007814015,0.9942845,0.00001283574,0.00006638162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.996281,0.000007129398,0.0000491825,0.0008566335,0.0001694709,0.0002660555,0.000001997993,0.0000355633,0.002332983],"genre_scores_gemma":[0.999649,0.000004920636,0.0001751234,0.0001120263,0.000005139338,0.00001865785,0.000001508208,0.00001287206,0.00002070996],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003368059,"threshold_uncertainty_score":0.2572773,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0261931885729084,"gpt":0.2752893651765035,"spread":0.2490961766035951,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005557075,0.000206053,0.0003541364,0.00006569384,0.0001884815,0.00001929275,0.0007290948,0.00009526491,0.00004464396],"category_scores_gemma":[0.0001162524,0.0001098717,0.0002225743,0.0005257641,0.0003109165,0.00002426764,0.00006243277,0.0002177428,0.000008217869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001053866,"about_ca_system_score_gemma":0.000026408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001121967,"about_ca_topic_score_gemma":0.000003204896,"domain_scores_codex":[0.9986373,0.00004010996,0.0005417942,0.0001671955,0.0004026964,0.0002109714],"domain_scores_gemma":[0.9974834,0.0007600628,0.0005097599,0.001149919,0.00005698479,0.00003992322],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001659819,0.0002789817,0.00001303645,0.0001015694,0.00003860539,1.101965e-7,0.001826855,0.000012046,0.008505768,0.9884322,0.0005259516,0.0002482219],"study_design_scores_gemma":[0.0002025343,0.00003796798,0.0002237317,0.00009906184,0.00007309022,0.000001631641,0.001455861,0.000114862,0.03292374,0.9646162,0.000129735,0.0001215585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8720897,0.00001804933,0.01269986,0.001354096,0.00004382579,0.001498801,0.0000580229,0.00007728286,0.1121604],"genre_scores_gemma":[0.9965162,0.000004097477,0.003037418,0.0001988204,0.00001927992,0.00006987727,0.00000222935,0.0000227577,0.0001293314],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1244265,"threshold_uncertainty_score":0.4480436,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02581874398230166,"gpt":0.2677072303653798,"spread":0.2418884863830781,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001714573,0.0001523582,0.0004254574,0.0001593063,0.0001103092,0.00002246607,0.000358455,0.00009426469,0.0001640454],"category_scores_gemma":[0.0002617056,0.0001255981,0.0003066245,0.0002761096,0.0002720589,0.0002663982,0.00003647733,0.0001810612,0.000002586714],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001820831,"about_ca_system_score_gemma":0.00005545769,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002146075,"about_ca_topic_score_gemma":7.293088e-7,"domain_scores_codex":[0.9983391,0.0002859559,0.0007777906,0.00009258593,0.0003377942,0.0001668428],"domain_scores_gemma":[0.9978877,0.0005478814,0.0008216336,0.0003074019,0.0003749326,0.000060465],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004063484,0.0003493569,0.0001261702,0.00003568661,0.0000771264,0.000006880567,0.0001740289,0.000004572728,0.01179958,0.9854619,0.001357159,0.0002012074],"study_design_scores_gemma":[0.0007237179,0.0002523673,0.000209984,0.00005095701,0.0001026563,0.00005548988,0.0002743331,6.022778e-7,0.04509342,0.9479572,0.005164393,0.0001149147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9881774,0.0004224435,0.00137879,0.0001291208,0.001533497,0.0001575031,0.000009626728,0.00002902486,0.00816262],"genre_scores_gemma":[0.9964369,0.00002894752,0.002644544,0.000009429322,0.0003775514,0.000003863167,0.000001323195,0.00002269916,0.0004747633],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03750472,"threshold_uncertainty_score":0.512174,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Conjecture; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.09291930515307462,"gpt":0.3474541012453438,"spread":0.2545347960922692,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00237939,0.0001038212,0.0002002225,0.00003813408,0.0001378935,0.00002541164,0.0002994545,0.0000722682,0.0001449151],"category_scores_gemma":[0.0008511991,0.00006066676,0.0001192001,0.0002783552,0.00004357864,0.00008736172,0.00002386069,0.0004133764,0.0000532579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003611427,"about_ca_system_score_gemma":0.00003494607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001736224,"about_ca_topic_score_gemma":0.000001092255,"domain_scores_codex":[0.9988754,0.0002934132,0.0003134841,0.00004540598,0.0002932581,0.0001790253],"domain_scores_gemma":[0.9966783,0.002370243,0.000391712,0.0002590894,0.0001952156,0.0001054266],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001853155,0.0003157913,0.007621862,0.000006812307,0.00004091323,0.000001183757,0.0003037393,5.706927e-7,0.00002560952,0.9525897,0.03903049,0.00004479813],"study_design_scores_gemma":[0.0003094661,0.00006929861,0.008769733,0.0000223335,0.00004182086,0.00007954225,0.0001086815,0.000001819083,0.0007937201,0.9709722,0.01874922,0.00008221196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9891684,0.0001217974,0.0004670267,0.001213644,0.0007077131,0.0001202174,0.000007327001,0.0000142384,0.008179619],"genre_scores_gemma":[0.9991472,0.00002731701,0.0001148279,0.0002121945,0.0001203137,0.000003432107,6.184424e-7,0.00001485471,0.0003592853],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02028127,"threshold_uncertainty_score":0.2473918,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03119739482223361,"gpt":0.2938382310710607,"spread":0.2626408362488271,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004065551,0.00009276081,0.0001989864,0.0000512262,0.0001570509,0.000006533367,0.0001281318,0.00005226722,0.00002066803],"category_scores_gemma":[0.00004558295,0.00006415848,0.00005279169,0.0002806295,0.0003148163,0.00007049191,0.0000492002,0.00007181273,0.00000546056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001557439,"about_ca_system_score_gemma":0.000009433559,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000509096,"about_ca_topic_score_gemma":0.000002374108,"domain_scores_codex":[0.9993338,0.00005736382,0.000274191,0.0001133938,0.0000898076,0.0001314613],"domain_scores_gemma":[0.9989713,0.0004414144,0.0001579836,0.0002842049,0.00007583499,0.00006923317],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001317051,0.0001190184,0.0008431302,0.00008423513,0.00002605467,8.344308e-9,0.0006759047,7.435715e-7,0.003088253,0.9943444,0.0000339032,0.0007711484],"study_design_scores_gemma":[0.0007681824,0.00002062158,0.003266198,0.00002799276,0.0002057923,0.000008381716,0.0008314188,0.0003368092,0.02862522,0.9608735,0.004873994,0.0001619201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9881597,0.001655099,0.007127074,0.0003954919,0.00001661097,0.0008405059,0.00007312879,0.00003034842,0.001702063],"genre_scores_gemma":[0.9982165,0.0001464306,0.001164714,0.000036061,0.00004314972,0.0002678471,0.000007110528,0.00001182165,0.0001063559],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03347096,"threshold_uncertainty_score":0.2616307,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06710359904325879,"gpt":0.265715689389827,"spread":0.1986120903465682,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002955462,0.00006327465,0.0001497186,0.00002311619,0.00004636323,0.00001154093,0.0001810537,0.00006945686,0.00006985536],"category_scores_gemma":[0.0006925354,0.00004891729,0.00005933823,0.00006311783,0.0001297446,0.00002802613,0.000006297586,0.000180881,7.974318e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004532103,"about_ca_system_score_gemma":0.0002929289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003419593,"about_ca_topic_score_gemma":0.00006184152,"domain_scores_codex":[0.9994804,0.0000213332,0.0002441964,0.00004996772,0.00007972585,0.0001243517],"domain_scores_gemma":[0.9991229,0.00007554268,0.0002029018,0.0001168926,0.0001606933,0.0003210883],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0005096091,0.0005425984,0.003020125,0.0007929691,0.0004920852,0.0004192734,0.01198784,0.00292975,0.6112707,0.3331698,0.02720802,0.007657245],"study_design_scores_gemma":[0.0007807494,0.0001010437,0.00006810418,0.0004205597,0.00004898357,0.0002606339,0.00246625,0.0001554098,0.537614,0.4569899,0.0008932045,0.0002011895],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9950261,0.0002175573,0.0002652404,0.0002678858,0.0000401833,0.00003173016,0.000002301105,0.000003124218,0.004145923],"genre_scores_gemma":[0.9991394,0.000001367445,0.0005674034,0.00003654849,0.00008789558,0.000001785381,3.903573e-7,0.000006183778,0.0001590307],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1238201,"threshold_uncertainty_score":0.1994789,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01986102366113922,"gpt":0.3019934772289365,"spread":0.2821324535677973,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001984255,0.00009365407,0.0001250275,0.00004318619,0.0003491532,0.00002494881,0.0001483337,0.00007949014,0.00001963435],"category_scores_gemma":[0.00006823691,0.00006550728,0.00004464577,0.0001577301,0.0002013543,0.00003694899,0.00003222776,0.0001354268,0.000001693411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":9.579975e-7,"about_ca_system_score_gemma":0.00001501779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003796123,"about_ca_topic_score_gemma":0.00004202417,"domain_scores_codex":[0.9994801,0.00001140296,0.000179315,0.0001595776,0.00006183026,0.0001077804],"domain_scores_gemma":[0.9986023,0.0008875849,0.00009288014,0.0002789891,0.00008532096,0.00005290223],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006564256,0.00004618728,0.000155026,0.00004442285,0.00002492748,1.224358e-8,0.0002082075,3.684342e-7,0.006641278,0.9899953,0.0002140036,0.002663697],"study_design_scores_gemma":[0.0002475064,0.00002024197,0.00114525,0.00000475337,0.00007293716,0.000005065193,0.0001933334,0.00083808,0.005507178,0.9595096,0.03236006,0.00009603221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9489784,0.0005815632,0.04487905,0.001891911,0.00005001983,0.002180222,0.0002136498,0.00008182232,0.001143333],"genre_scores_gemma":[0.9964525,0.00006353772,0.002405996,0.0001100582,0.00006780555,0.0007120042,0.00001072606,0.00001413739,0.0001632474],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04747406,"threshold_uncertainty_score":0.268544,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02776321990860775,"gpt":0.304062735224549,"spread":0.2762995153159412,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004301523,0.00009859421,0.0001140517,0.0000745369,0.0002689653,0.000009717898,0.0002036379,0.00005582133,0.00005647688],"category_scores_gemma":[0.00009997636,0.00006888239,0.00005613429,0.0004349688,0.0001074006,0.00002495976,0.0000329588,0.000119491,0.00005281981],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004066414,"about_ca_system_score_gemma":0.00000802131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001258054,"about_ca_topic_score_gemma":0.000004639737,"domain_scores_codex":[0.9992759,0.00002333323,0.0002513478,0.0001681197,0.0001285477,0.0001527101],"domain_scores_gemma":[0.9983771,0.001007335,0.0001106743,0.0003749015,0.00006525731,0.00006472052],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006726499,0.0001701557,0.00004011449,0.00001421969,0.00001405928,6.929884e-8,0.0001613046,8.946606e-7,0.001940159,0.9959348,0.0003681453,0.001349327],"study_design_scores_gemma":[0.0001639803,0.00003159629,0.0006415664,0.00001449307,0.00003396812,0.000002346048,0.000220044,0.0001200261,0.01447803,0.9715229,0.01266943,0.0001016186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9677037,0.00008566531,0.02058605,0.0007559446,0.00001939855,0.0008646894,0.00004424488,0.0000703836,0.009869909],"genre_scores_gemma":[0.9985124,0.00002365496,0.0006932383,0.0002468899,0.00003087283,0.0001274518,0.000009359556,0.00001383467,0.0003423233],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03080866,"threshold_uncertainty_score":0.2808942,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02853865488998119,"gpt":0.2194684393285982,"spread":0.190929784438617,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009592572,0.000287789,0.0003374144,0.0001218438,0.0004616858,0.00004637736,0.0003059625,0.0002880592,0.000006826707],"category_scores_gemma":[0.00001185182,0.0003144123,0.0001829675,0.00003133635,0.0002855088,0.00004701043,0.0002834196,0.000410118,0.00001021499],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009676167,"about_ca_system_score_gemma":0.0001797953,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007875787,"about_ca_topic_score_gemma":0.000002770142,"domain_scores_codex":[0.9990121,0.0000678617,0.0001618502,0.0004646661,0.00009733461,0.0001961927],"domain_scores_gemma":[0.9984147,0.000338583,0.0001676745,0.0007757334,0.0001553666,0.0001479502],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000004653092,0.00002518906,3.100558e-7,0.0001077577,0.0001098541,0.000006133826,0.00004333378,1.050131e-7,0.00005536888,0.8037194,0.1953007,0.0006271711],"study_design_scores_gemma":[0.0002167261,0.00001046267,0.000002129323,0.00007076949,0.0002626329,0.00002308933,0.000299854,0.000007156118,0.0001755028,0.008140028,0.9904914,0.0003002847],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0001104145,0.0002110772,0.01320589,0.00002801236,0.00006526097,0.0006839598,0.0008257399,0.0002045464,0.9846651],"genre_scores_gemma":[0.0003033346,0.00005646055,0.0003593277,0.00003290525,0.0001665148,0.00002473832,0.0002317279,0.00004219121,0.9987828],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.7955794,"threshold_uncertainty_score":0.9999308,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01709297968701093,"gpt":0.2824911254626855,"spread":0.2653981457756746,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003396361,0.0001002712,0.0001127845,0.00005022889,0.0001985976,0.00001073625,0.0001338975,0.00004616282,0.00009150618],"category_scores_gemma":[0.0000411128,0.0000644047,0.00004286259,0.0003765135,0.000110157,0.00004081084,0.00001501946,0.0001157287,0.00003271495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006407552,"about_ca_system_score_gemma":0.00001077986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000236087,"about_ca_topic_score_gemma":0.000009329309,"domain_scores_codex":[0.9993551,0.00002255813,0.000201789,0.0001610198,0.0001264847,0.0001329832],"domain_scores_gemma":[0.9987,0.0007660822,0.0001187981,0.0002871533,0.00007668011,0.00005125394],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002306567,0.0001351024,0.00009257946,0.00001583285,0.00002326781,1.735821e-7,0.0002609444,9.319312e-7,0.001195169,0.9973283,0.0002680415,0.0006565381],"study_design_scores_gemma":[0.0002687031,0.00004787928,0.001480331,0.00001675872,0.00005101127,0.00001088097,0.0002464495,0.00009702621,0.01578367,0.9791181,0.002775864,0.0001033097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9622431,0.00003261765,0.02301604,0.001116564,0.000008562271,0.000898744,0.00002531242,0.00005357861,0.01260542],"genre_scores_gemma":[0.9960727,0.00001733324,0.003241429,0.00009743923,0.00004038064,0.0001749125,0.000009226531,0.00001468489,0.0003318842],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03382955,"threshold_uncertainty_score":0.2626347,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Conjecture; Combinatorics; Bipartite graph; Mathematics; Graph; Vertex (graph theory); Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01548249841739554,"gpt":0.2446875353190324,"spread":0.2292050369016368,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.006199726,0.001042268,0.0005956627,0.0005001352,0.003640142,0.001914657,0.003265577,0.002592733,0.0751439],"category_scores_gemma":[0.004615697,0.001655442,0.00288273,0.001117541,0.00289184,0.001846379,0.001642088,0.002983061,0.001071827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002610008,"about_ca_system_score_gemma":0.001819057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002500137,"about_ca_topic_score_gemma":0.0005140413,"domain_scores_codex":[0.9901335,0.000911337,0.002739214,0.001342335,0.002529023,0.002344543],"domain_scores_gemma":[0.9863508,0.005089802,0.004056654,0.002663885,0.000569427,0.001269459],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.004526382,0.0005847458,0.000007002842,0.0007899318,0.001903343,0.0003989648,0.002470749,0.0001402705,0.004302559,0.790733,0.1928129,0.00133017],"study_design_scores_gemma":[0.003115276,0.002471025,0.00002772729,0.0008575764,0.00228083,0.001914109,0.003609165,0.002040497,0.8045479,0.1574577,0.02020273,0.001475455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.836641,0.0009714217,0.0008272163,0.001243283,0.01256266,0.0001137219,0.0003386351,0.000206412,0.1470956],"genre_scores_gemma":[0.9882417,0.001040577,0.002254796,0.0009044633,0.005228567,0.0007529298,0.0002559981,0.0007616553,0.0005592664],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8002453,"threshold_uncertainty_score":0.9998217,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01687846843122812,"gpt":0.2732245855259517,"spread":0.2563461170947237,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001118338,0.0001237377,0.0001197363,0.00008010246,0.0002886587,0.00002159906,0.0001342023,0.00006692697,0.00007065343],"category_scores_gemma":[0.00002396298,0.0001119162,0.00005501381,0.0003161981,0.00005594634,0.00004717106,0.00002522697,0.0001109406,0.0001481663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005715659,"about_ca_system_score_gemma":0.000008509021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004470693,"about_ca_topic_score_gemma":0.000004487976,"domain_scores_codex":[0.9992748,0.00002253233,0.0001997028,0.0002466411,0.0001016388,0.0001546343],"domain_scores_gemma":[0.9992188,0.0002571057,0.00006441747,0.0003460914,0.00005122858,0.00006235006],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002675832,0.0001594566,0.00002466728,0.0000143744,0.000008099279,1.900596e-7,0.0000177101,0.000004834005,0.001409657,0.996227,0.001609832,0.00052155],"study_design_scores_gemma":[0.0001592655,0.00001911276,0.0003081627,0.000006674956,0.000026572,0.000003330143,0.00001939657,0.0002844628,0.002770863,0.9655229,0.03075237,0.0001269106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9481041,0.0003237908,0.01978406,0.00142101,0.00002884562,0.001185891,0.00008660521,0.0003831716,0.02868254],"genre_scores_gemma":[0.9945898,0.00002993114,0.003053378,0.0001839679,0.0001004675,0.0004542295,0.00004404011,0.00002357296,0.001520604],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04648571,"threshold_uncertainty_score":0.4563812,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.08928013013114253,"gpt":0.2085455317124797,"spread":0.1192654015813372,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006930172,0.0002733115,0.0004827572,0.0001662,0.0002347014,0.0000475108,0.0003438432,0.0002118225,0.00005944978],"category_scores_gemma":[0.0001959682,0.000309232,0.0001944084,0.001114327,0.0005070398,0.0004881391,0.0001236459,0.0002131765,0.00002322862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004636685,"about_ca_system_score_gemma":0.0001238994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006359351,"about_ca_topic_score_gemma":0.00001831181,"domain_scores_codex":[0.9983509,0.0002848042,0.0004047487,0.0005313765,0.0001119681,0.0003162649],"domain_scores_gemma":[0.9979408,0.0003649349,0.0004984422,0.000580401,0.0003258801,0.0002895785],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002651713,0.0005150596,0.01725176,0.0002013038,0.0001341284,0.00001955412,0.001295292,0.0005534447,0.0006496751,0.9787332,0.000139396,0.000241968],"study_design_scores_gemma":[0.005489129,0.0001607565,0.00157369,0.0001802308,0.0009121367,0.000009874747,0.002857317,0.01402147,0.002727627,0.9710828,0.0004902614,0.0004946824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9718252,0.0007717552,0.02333036,0.00005868659,0.0001371718,0.0005406798,0.00004571502,0.00006318362,0.003227237],"genre_scores_gemma":[0.9979066,0.001112862,0.0005499783,0.00001615542,0.00003874955,7.071023e-7,0.000009418107,0.00001817835,0.0003473485],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0260814,"threshold_uncertainty_score":0.999936,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Harmonic; Combinatorics; Statistics; Computer science; Acoustics; Physics; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.0319056874760969,"gpt":0.2951569416950728,"spread":0.2632512542189759,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005550175,0.0001169091,0.0001050938,0.0000401887,0.0004321639,0.00003078784,0.0003174038,0.00006359928,0.00002751465],"category_scores_gemma":[0.0001141701,0.00008139486,0.00008530293,0.0002712528,0.00009651739,0.00007606471,0.00004877479,0.0002100065,0.0002020051],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002196683,"about_ca_system_score_gemma":0.00001110409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002834753,"about_ca_topic_score_gemma":0.000001528666,"domain_scores_codex":[0.9991382,0.00009853285,0.0001682082,0.0001135354,0.0001612009,0.0003202768],"domain_scores_gemma":[0.9983867,0.0008054457,0.00008304594,0.0005979157,0.00002921343,0.00009762513],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005937841,0.0001846722,0.001777137,0.000003146311,0.00002392495,1.884647e-7,0.0001343769,6.338092e-8,0.00006537778,0.9912043,0.005372252,0.001228655],"study_design_scores_gemma":[0.000261075,0.00002357252,0.004012501,0.000008060835,0.00001760308,0.000001934283,0.00007814869,0.000008703224,0.001144847,0.9778233,0.01651885,0.0001014182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9859647,0.0001718512,0.00001146179,0.0004645748,0.0007765111,0.0002225121,0.000001963994,0.0001069874,0.01227948],"genre_scores_gemma":[0.9990757,0.00003556707,0.0000478859,0.0001221746,0.00001100145,0.00008584813,0.000001552601,0.0000212188,0.0005991085],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01338098,"threshold_uncertainty_score":0.3323899,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06495913138480752,"gpt":0.3541669898065379,"spread":0.2892078584217304,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001136731,0.0001720063,0.0003126317,0.00002976651,0.0004374567,0.00007549754,0.000886701,0.00007631172,0.0002097785],"category_scores_gemma":[0.00224935,0.0001030726,0.000187493,0.00004015401,0.0003789001,0.00007522722,0.0001459899,0.0001554271,0.00005580725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001297765,"about_ca_system_score_gemma":0.00001878659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004864553,"about_ca_topic_score_gemma":0.000004656092,"domain_scores_codex":[0.9988359,0.00007055495,0.0004508073,0.0001876128,0.0002555565,0.0001995735],"domain_scores_gemma":[0.9955553,0.001515448,0.0006008404,0.002207478,0.00006426035,0.00005661394],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001123371,0.000179777,0.00005197763,0.0001328109,0.00003270882,0.000001095839,0.0005853985,0.000001424105,0.001075315,0.9960416,0.001780298,0.0001063572],"study_design_scores_gemma":[0.0001475413,0.00004014361,0.000519374,0.0001094976,0.00007648699,0.000005361192,0.0002627292,0.0003050584,0.006833032,0.9912527,0.0003241986,0.0001239262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9674948,0.000005419991,0.001626987,0.001747043,0.00006291868,0.0005188095,0.00005225435,0.0000420929,0.02844972],"genre_scores_gemma":[0.9924805,0.000003785296,0.006580347,0.0000633716,0.00003854777,0.0000655708,0.00000241969,0.00002473461,0.0007407059],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02770901,"threshold_uncertainty_score":0.4203178,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}