{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Mustapha Aouchiche","is_ca":true},{"name":"Pierre Hansen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001397239,0.001035271,0.001937282,0.007074636,0.001285238,0.004299067,0.002016588,0.001548915,0.003935435],"category_scores_gemma":[0.004642009,0.0008910971,0.0009685341,0.01090574,0.003029363,0.009552639,0.002583016,0.003008819,0.001222132],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001722193,"about_ca_system_score_gemma":0.001110465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008932772,"about_ca_topic_score_gemma":0.0006967364,"domain_scores_codex":[0.9986198,0.000309474,0.0001055192,0.0004393269,0.0004324343,0.00009348386],"domain_scores_gemma":[0.9963014,0.002394361,0.0002521562,0.0003560934,0.0004708629,0.0002250091],"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.0000651865,0.0002035343,0.001826097,0.002165581,0.00008208391,0.00009741665,0.0004948837,0.003799551,0.001247048,0.716114,0.009480393,0.2644242],"study_design_scores_gemma":[0.00001561259,0.00007336511,0.001302379,0.0003586676,0.00003344981,0.0007514995,0.0003899031,0.008855128,0.0007523249,0.9204647,0.06695273,0.00005019932],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.04905026,0.6081448,0.2704739,0.006576986,0.001197091,0.00008390876,0.0009019339,0.0004317352,0.06313941],"genre_scores_gemma":[0.3673087,0.4847443,0.1273601,0.002466898,0.006705242,0.0001735856,0.00158188,0.0003116435,0.009347705],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.007074636,"threshold_uncertainty_score":0.0131653,"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","authors":[{"name":"Mustapha Aouchiche","is_ca":true},{"name":"Pierre Hansen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009666018,0.0009492094,0.0006570228,0.003520368,0.0009526409,0.002853622,0.001711734,0.002372893,0.01147221],"category_scores_gemma":[0.004617556,0.0003131948,0.0009256958,0.001522322,0.002625006,0.003796356,0.00154603,0.003078977,0.001967136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001154948,"about_ca_system_score_gemma":0.0006411279,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008660982,"about_ca_topic_score_gemma":0.001012274,"domain_scores_codex":[0.9989734,0.0003080707,0.00005633352,0.0002783569,0.0002829022,0.0001009581],"domain_scores_gemma":[0.9976543,0.0009913616,0.000297955,0.0002246426,0.00046609,0.0003657688],"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.00002730559,0.00003201924,0.000155516,0.00005165138,0.00001112176,0.00008422778,0.0002717263,0.001469988,0.002312043,0.9793601,0.003323952,0.01290052],"study_design_scores_gemma":[0.00001028732,0.00002627986,0.0003485849,0.00002060899,0.00000876629,0.0003033776,0.0001776751,0.02051905,0.0006594414,0.9699724,0.007901069,0.00005250638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.092861,0.002758989,0.8432184,0.007369868,0.002242291,0.0001111032,0.001023879,0.0005354827,0.04987887],"genre_scores_gemma":[0.7005479,0.002763599,0.2151362,0.002355644,0.002230606,0.00034381,0.001173581,0.0005733624,0.07487538],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01147221,"threshold_uncertainty_score":0.0383783,"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","authors":[{"name":"Shaun Fallat","is_ca":true},{"name":"Leslie Hogben","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001750522,0.001344611,0.002640265,0.004517484,0.0009307395,0.004460299,0.002380486,0.002106996,0.003472058],"category_scores_gemma":[0.007803333,0.001158278,0.00118939,0.007267204,0.002521747,0.008386716,0.001463609,0.002383281,0.00108753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001032569,"about_ca_system_score_gemma":0.001143436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007733075,"about_ca_topic_score_gemma":0.0009233174,"domain_scores_codex":[0.9976993,0.0006482405,0.0001795439,0.0007285479,0.0005741833,0.0001701031],"domain_scores_gemma":[0.9924949,0.005222043,0.0006889732,0.0006837316,0.0006390793,0.0002711849],"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.0002368918,0.0002802469,0.004033891,0.004052335,0.0002491498,0.0001998359,0.0004971267,0.02651401,0.003117089,0.6439624,0.01848635,0.2983707],"study_design_scores_gemma":[0.00003124863,0.0001332458,0.001194557,0.0002205913,0.00006843192,0.0006240977,0.0002684123,0.03346081,0.001362225,0.942946,0.0196199,0.00007059093],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.1515607,0.2718756,0.5042764,0.008635337,0.00121189,0.0001231652,0.002975381,0.0007499256,0.05859154],"genre_scores_gemma":[0.6203633,0.1896487,0.1687053,0.001500795,0.007493878,0.0001796317,0.003792815,0.000407042,0.007908598],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.004517484,"threshold_uncertainty_score":0.01161522,"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","authors":[{"name":"Florian Dörfler","is_ca":false},{"name":"John W. Simpson-Porco","is_ca":true},{"name":"Francesco Bullo","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008067118,0.0004925355,0.0005218971,0.001893793,0.0009666737,0.002663304,0.0008254584,0.001101666,0.002872357],"category_scores_gemma":[0.003182863,0.0003129116,0.0005628979,0.002462981,0.003265878,0.005829273,0.001161738,0.001819968,0.0004547251],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001687131,"about_ca_system_score_gemma":0.0006612763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001819825,"about_ca_topic_score_gemma":0.001561043,"domain_scores_codex":[0.9993193,0.0002583825,0.0000336001,0.0001353872,0.0001997707,0.00005351888],"domain_scores_gemma":[0.9978718,0.001337311,0.0002434993,0.0001611456,0.0002831162,0.0001031692],"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.000001748416,0.000004794523,0.0001151308,0.00003955663,0.000003294869,0.00001702113,0.00005421238,0.003890314,0.0001000623,0.9911183,0.000694998,0.003960552],"study_design_scores_gemma":[0.000002347986,0.00000573287,0.000120565,0.00002428433,0.000003596987,0.00007059265,0.00005699369,0.01704306,0.00007129296,0.9721286,0.01046712,0.000005815547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05253366,0.03048112,0.7975728,0.01665031,0.0005019965,0.0001197036,0.0006904289,0.0002485753,0.1012015],"genre_scores_gemma":[0.7930731,0.04994169,0.1374046,0.001611152,0.002412106,0.0003825836,0.0007933208,0.0001040879,0.01427731],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002872357,"threshold_uncertainty_score":0.01224101,"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","authors":[{"name":"Francesco Barioli","is_ca":false},{"name":"Wayne Barrett","is_ca":false},{"name":"Shaun Fallat","is_ca":true},{"name":"H. Tracy Hall","is_ca":false},{"name":"Leslie Hogben","is_ca":false},{"name":"Bryan L. Shader","is_ca":false},{"name":"P. van den Driessche","is_ca":true},{"name":"Hein van der Holst","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001864509,0.0009880634,0.001742486,0.002124073,0.002576011,0.004837387,0.002202957,0.002753727,0.01310887],"category_scores_gemma":[0.01031881,0.0008295217,0.0007582841,0.001849474,0.006135713,0.009340695,0.003761659,0.006207178,0.00150876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001302126,"about_ca_system_score_gemma":0.001071254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006385418,"about_ca_topic_score_gemma":0.0007164631,"domain_scores_codex":[0.9985499,0.0005722637,0.00005953771,0.0002835941,0.0003362432,0.0001984189],"domain_scores_gemma":[0.9911135,0.005918724,0.0009021114,0.0008765922,0.0004560234,0.0007330452],"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.0000437071,0.0000185034,0.0000839935,0.00003703001,0.000005425741,0.00002202406,0.00008472471,0.001558093,0.0003759149,0.993002,0.001323633,0.003444983],"study_design_scores_gemma":[0.000009822497,0.000004328843,0.0000317764,0.000005673132,0.000001989207,0.00001651416,0.00002706686,0.002134419,0.0001200182,0.9970975,0.000544292,0.000006700642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3806006,0.004241692,0.4384217,0.01447915,0.000814404,0.0001000247,0.0008323903,0.000873633,0.1596364],"genre_scores_gemma":[0.9261565,0.001463923,0.0385244,0.001006574,0.001159476,0.0001913571,0.0006066678,0.0003171431,0.03057398],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01310887,"threshold_uncertainty_score":0.04385358,"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","authors":[{"name":"Krystal Guo","is_ca":true},{"name":"Bojan Mohar","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002785778,0.0003414,0.0002788055,0.002064675,0.0006150198,0.001144001,0.0004179085,0.000413079,0.005052464],"category_scores_gemma":[0.001487702,0.0002056142,0.0002080808,0.0009656837,0.001007225,0.001230201,0.0007005578,0.0005360811,0.0005376317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005815246,"about_ca_system_score_gemma":0.0002345545,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006752634,"about_ca_topic_score_gemma":0.0006043294,"domain_scores_codex":[0.9996167,0.0001056259,0.00002570741,0.000101364,0.00009546889,0.00005499399],"domain_scores_gemma":[0.999008,0.0003814491,0.0001806468,0.00009988687,0.0001690665,0.0001609681],"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.00002571165,0.0000147539,0.0004049255,0.00004216757,0.000008316307,0.0001183214,0.0001648003,0.002651533,0.00357216,0.981698,0.0009502069,0.01034911],"study_design_scores_gemma":[0.00000920107,0.00002993954,0.0008778266,0.00002009198,0.000007068558,0.0003199236,0.0001384547,0.03420577,0.001676543,0.9565681,0.006126587,0.00002038436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4789514,0.001679856,0.4653997,0.000792808,0.0002807642,0.00007919076,0.0007364525,0.0004068761,0.05167314],"genre_scores_gemma":[0.9585103,0.0003608906,0.03430191,0.000150325,0.0001029625,0.00005833896,0.0002143919,0.00004314077,0.00625773],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005052464,"threshold_uncertainty_score":0.01690221,"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","authors":[{"name":"Michael Cavers","is_ca":true},{"name":"Shaun Fallat","is_ca":true},{"name":"Steve Kirkland","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001230348,0.0006944977,0.0007203563,0.004324228,0.001331303,0.002296698,0.001689124,0.001279939,0.01534231],"category_scores_gemma":[0.006194443,0.0003079177,0.0005230513,0.001986908,0.002753943,0.005041604,0.001657246,0.001664229,0.002439781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001678671,"about_ca_system_score_gemma":0.0005977543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001623016,"about_ca_topic_score_gemma":0.002139543,"domain_scores_codex":[0.9995468,0.0001331802,0.00001816326,0.0001126169,0.0001310364,0.00005822158],"domain_scores_gemma":[0.9979774,0.0008452044,0.0002467724,0.0002904757,0.000383886,0.0002562095],"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.00001245968,0.000008946779,0.0001519954,0.00003232862,0.000005014655,0.00002363323,0.00004135761,0.002680515,0.0002318783,0.9866697,0.004201678,0.005940634],"study_design_scores_gemma":[0.000002536695,0.00000541158,0.0002376519,0.00001931062,0.000003470977,0.00006804842,0.00002974037,0.01783766,0.0001264128,0.9785573,0.003099561,0.00001302812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.201694,0.01308667,0.3429768,0.008780532,0.00193066,0.00007700796,0.001174251,0.0007913716,0.4294888],"genre_scores_gemma":[0.8695818,0.00575112,0.03908621,0.001366217,0.001970832,0.0001373765,0.0009018113,0.0009324076,0.0802723],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01534231,"threshold_uncertainty_score":0.05132508,"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","authors":[{"name":"R.B. Bapat","is_ca":false},{"name":"Steve Kirkland","is_ca":true},{"name":"Michael Neumann","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009864363,0.001036957,0.00109201,0.003731004,0.001509866,0.002662472,0.001440415,0.001696586,0.008395565],"category_scores_gemma":[0.005616637,0.0004758657,0.0006402486,0.004923947,0.003482206,0.007091619,0.002304232,0.002984541,0.001356171],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00126047,"about_ca_system_score_gemma":0.0004478406,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001519641,"about_ca_topic_score_gemma":0.001331499,"domain_scores_codex":[0.9992961,0.0002635763,0.00003376323,0.0001591174,0.0001885832,0.00005896234],"domain_scores_gemma":[0.9970415,0.001772247,0.000305421,0.0001967151,0.0004437941,0.0002402573],"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.000008272875,0.00001380008,0.00008913606,0.00004323397,0.000004909979,0.00002571868,0.0001688448,0.001100155,0.0002687311,0.9862345,0.002402372,0.009640293],"study_design_scores_gemma":[0.000001882925,0.000003836276,0.00006903214,0.000009313199,0.000002401285,0.00003348593,0.00004632955,0.002405709,0.00004823708,0.9939948,0.003379423,0.000005504754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1612478,0.04425231,0.5809661,0.02028626,0.004097133,0.00006808841,0.0008493623,0.0003606792,0.1878723],"genre_scores_gemma":[0.7928272,0.02677277,0.07015085,0.003499297,0.007788294,0.0001945323,0.0009254016,0.0003018627,0.0975398],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008395565,"threshold_uncertainty_score":0.02808595,"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","authors":[{"name":"Sebastian M. Cioabă","is_ca":true},{"name":"David A. Gregory","is_ca":true},{"name":"Willem H. Haemers","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008347391,0.000661601,0.001219153,0.004254862,0.001855033,0.003903618,0.001601777,0.00224074,0.01038982],"category_scores_gemma":[0.007033708,0.000793984,0.001046726,0.002087149,0.002338327,0.005723523,0.002387865,0.00249248,0.001506827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001000147,"about_ca_system_score_gemma":0.0005041341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007046578,"about_ca_topic_score_gemma":0.0008851135,"domain_scores_codex":[0.9991674,0.0001774316,0.00005598185,0.0001960622,0.000273649,0.0001294577],"domain_scores_gemma":[0.9967693,0.001493086,0.0005298688,0.000403294,0.0003850439,0.000419552],"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.00005683411,0.00004670457,0.0003376839,0.00006006842,0.00000902548,0.0001386634,0.0003894808,0.001458741,0.001478634,0.9859206,0.002127588,0.007975969],"study_design_scores_gemma":[0.00001127048,0.000006893201,0.0001534537,0.00001253121,0.000006114311,0.000102443,0.00008854832,0.00569139,0.0003046583,0.9926709,0.0009426622,0.000009242861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6434293,0.001163272,0.2402766,0.003370127,0.0009925042,0.0002351922,0.0008776558,0.001356962,0.1082984],"genre_scores_gemma":[0.9396207,0.0005813811,0.03403204,0.0005438727,0.0006766571,0.0001192032,0.0004711905,0.0003996502,0.0235552],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01038982,"threshold_uncertainty_score":0.03475744,"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","authors":[{"name":"János Pach","is_ca":false},{"name":"Gábor Tardos","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005861578,0.0007087708,0.000581793,0.002182366,0.001680862,0.002915651,0.00102388,0.001155781,0.005051565],"category_scores_gemma":[0.004551358,0.0005912543,0.0006334423,0.0027919,0.002605846,0.003887135,0.001137025,0.001743656,0.0005024577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001155623,"about_ca_system_score_gemma":0.0009451714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001889719,"about_ca_topic_score_gemma":0.002172014,"domain_scores_codex":[0.9993489,0.0002312734,0.00004197154,0.0001415502,0.0001502426,0.00008610768],"domain_scores_gemma":[0.996267,0.002474143,0.0005144851,0.0002253041,0.0002911825,0.0002278914],"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.00004860955,0.00001934877,0.0002981398,0.00005940898,0.000007644457,0.0001239555,0.0004560626,0.002485175,0.0007284552,0.9863898,0.001031483,0.008351875],"study_design_scores_gemma":[0.000007830962,0.000008135809,0.00006060611,0.000009576431,0.000005247396,0.00008878633,0.00008236978,0.004428021,0.0002421266,0.99336,0.001701593,0.000005647061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5197709,0.002929765,0.4176337,0.002825866,0.0004378038,0.0001403206,0.0007808985,0.0003552725,0.0551255],"genre_scores_gemma":[0.907597,0.001819287,0.06615461,0.0004218864,0.0003252127,0.0002683856,0.0005084332,0.0001306037,0.02277453],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005051565,"threshold_uncertainty_score":0.01689911,"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","authors":[{"name":"Francesco Barioli","is_ca":true},{"name":"Shaun Fallat","is_ca":true},{"name":"Leslie Hogben","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004197571,0.0004158752,0.0006576048,0.002032542,0.0006976494,0.001681729,0.0009391659,0.0005918626,0.005866372],"category_scores_gemma":[0.003762571,0.0002316226,0.0004582738,0.00139627,0.001077408,0.002654665,0.000616869,0.0007453709,0.0004470671],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008661362,"about_ca_system_score_gemma":0.0006372526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008776627,"about_ca_topic_score_gemma":0.001630197,"domain_scores_codex":[0.9996369,0.00005797864,0.00001490475,0.0001038428,0.0001069608,0.00007939234],"domain_scores_gemma":[0.9977308,0.00126858,0.0003168928,0.0002222063,0.0002038467,0.0002577485],"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.001210786,0.0003908416,0.01962134,0.0006635844,0.0001114627,0.0006755673,0.000928421,0.08537611,0.03521013,0.7452415,0.009656864,0.1009134],"study_design_scores_gemma":[0.00007801652,0.0001972144,0.007940371,0.00003654877,0.00008069264,0.0007001331,0.0004122289,0.3203405,0.02360174,0.6424918,0.004044199,0.00007648107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8901355,0.0001913356,0.09566198,0.0003848026,0.00002117354,0.00003686102,0.001154229,0.0005511196,0.01186292],"genre_scores_gemma":[0.967512,0.00008357806,0.02866595,0.00002440595,0.00004660897,0.00002270472,0.001088995,0.00007833453,0.002477487],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005866372,"threshold_uncertainty_score":0.01962501,"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","authors":[{"name":"Elias M. Hagos","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010235,0.001748216,0.001957314,0.007031214,0.003706087,0.003611707,0.00205931,0.001653542,0.02021173],"category_scores_gemma":[0.00306932,0.0009245626,0.002054517,0.01057047,0.003806504,0.009353796,0.003388664,0.005687449,0.003558944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001696006,"about_ca_system_score_gemma":0.0006548392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001282403,"about_ca_topic_score_gemma":0.001300218,"domain_scores_codex":[0.9991174,0.0001993909,0.00004467809,0.0002470562,0.0002742466,0.0001171724],"domain_scores_gemma":[0.9981394,0.0009796651,0.0001528373,0.000213017,0.0002359217,0.000279188],"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.00002465907,0.00003904298,0.00009113598,0.0001632205,0.00001776229,0.00006976612,0.0002636657,0.0005432779,0.0006278963,0.9782783,0.007832448,0.01204896],"study_design_scores_gemma":[0.000007050595,0.00000755098,0.0001458962,0.00002035051,0.00001730005,0.00006915368,0.00006897861,0.0008713304,0.0002185185,0.9900163,0.008546429,0.00001118132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1149593,0.03146987,0.2752233,0.02011816,0.005181443,0.0001324781,0.001966925,0.001300506,0.5496481],"genre_scores_gemma":[0.7225776,0.03225862,0.07200035,0.009622599,0.01202605,0.0003774165,0.0024181,0.001329068,0.1473903],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02021173,"threshold_uncertainty_score":0.06761497,"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","authors":[{"name":"Omer Angel","is_ca":true},{"name":"Joel Friedman","is_ca":true},{"name":"Shlomo Hoory","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003397499,0.0004490478,0.0004923145,0.002466583,0.001604896,0.001975406,0.0006690561,0.0007933714,0.009138422],"category_scores_gemma":[0.002617643,0.0004064646,0.0005909458,0.001366314,0.001683543,0.002640311,0.001275058,0.0007231788,0.001344496],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001062251,"about_ca_system_score_gemma":0.0004388748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002447737,"about_ca_topic_score_gemma":0.001857009,"domain_scores_codex":[0.9990857,0.0001229177,0.00004466542,0.0002874318,0.0002256792,0.0002336202],"domain_scores_gemma":[0.9982464,0.0007845444,0.0001866441,0.0002494534,0.0002237159,0.0003093162],"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.0001583024,0.00004332954,0.001737756,0.0001078481,0.00002200784,0.0005781869,0.001280771,0.005785339,0.01036527,0.9430771,0.004038571,0.03280542],"study_design_scores_gemma":[0.00002542953,0.00005981417,0.002324454,0.00008374792,0.00002610566,0.0006002368,0.0004863198,0.05761291,0.005725536,0.9229139,0.01010507,0.00003639976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.779467,0.000445935,0.1621288,0.000468773,0.0001019041,0.00005253094,0.0008632328,0.001078136,0.05539363],"genre_scores_gemma":[0.9620275,0.0002627661,0.02462798,0.0001511306,0.00008063091,0.00009942176,0.0007673689,0.0003482525,0.01163495],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009138422,"threshold_uncertainty_score":0.0305711,"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","authors":[{"name":"Stephen Kirkland","is_ca":true},{"name":"Jason J. Molitierno","is_ca":false},{"name":"Michael Neumann","is_ca":false},{"name":"Bryan L. Shader","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001114386,0.001448155,0.001687422,0.005671923,0.00328176,0.004749055,0.002176389,0.002121995,0.009126465],"category_scores_gemma":[0.009047129,0.0007580359,0.001124138,0.005364421,0.006059859,0.01208623,0.003586512,0.003348424,0.0009016439],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001654658,"about_ca_system_score_gemma":0.0007525338,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001952692,"about_ca_topic_score_gemma":0.00207393,"domain_scores_codex":[0.9984134,0.0004864094,0.0000722945,0.0004232619,0.0003261001,0.000278546],"domain_scores_gemma":[0.9911163,0.005395578,0.001260702,0.0006140051,0.0007465767,0.0008669325],"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.00002432109,0.00001506997,0.00012618,0.00003673211,0.00000445776,0.00003384873,0.0001563349,0.0008713537,0.0002211606,0.9933462,0.0007447996,0.004419518],"study_design_scores_gemma":[0.000007389398,0.00000769815,0.0001105214,0.00001343711,0.000008529889,0.0000674918,0.0000851307,0.002610126,0.0001363981,0.9958012,0.001144383,0.000007570955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5198303,0.002749604,0.3146151,0.00635011,0.0007111227,0.0001546871,0.001332644,0.0005191879,0.1537373],"genre_scores_gemma":[0.9328319,0.003088997,0.03674803,0.0009988596,0.001211627,0.0002070348,0.001148769,0.0002140072,0.02355075],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009126465,"threshold_uncertainty_score":0.03053105,"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","authors":[{"name":"İvan Gutman","is_ca":true},{"name":"Pierre Hansen","is_ca":true},{"name":"Hadrien Mélot","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001328061,0.0001791987,0.000522982,0.002043358,0.0007663688,0.0009008629,0.0007576932,0.0006565346,0.002172376],"category_scores_gemma":[0.009057673,0.000242769,0.0003736417,0.001088067,0.0009365924,0.001354244,0.0007263722,0.0004605337,0.0001307986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009266926,"about_ca_system_score_gemma":0.0004727983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001093272,"about_ca_topic_score_gemma":0.001779717,"domain_scores_codex":[0.9995744,0.0001780933,0.0000204493,0.0001022465,0.00007391944,0.00005087405],"domain_scores_gemma":[0.9939732,0.004460036,0.0005594973,0.0003855283,0.0003572593,0.0002645302],"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.0009002126,0.0002494443,0.03675242,0.0004885054,0.0002055603,0.0003346151,0.0005886302,0.4041534,0.007862738,0.4449461,0.005166009,0.0983523],"study_design_scores_gemma":[0.00005892855,0.0001054836,0.005945234,0.00003474789,0.00003993596,0.0002518795,0.0002062135,0.7902874,0.002182015,0.1991379,0.001728849,0.00002145417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7397928,0.001198272,0.2484275,0.0005028254,0.00002810479,0.00009120786,0.0005782789,0.0002209472,0.009160048],"genre_scores_gemma":[0.9403118,0.0002465961,0.05748584,0.00004889488,0.0000200453,0.00005952297,0.000655274,0.00005117702,0.001120827],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002172376,"threshold_uncertainty_score":0.007267356,"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","authors":[{"name":"Martin T. Barlow","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009522829,0.0005773858,0.0004806875,0.001078832,0.000709289,0.002144553,0.0009261522,0.001348389,0.002225189],"category_scores_gemma":[0.009297069,0.0003756568,0.0005096292,0.0004651794,0.00206689,0.004850103,0.0009299186,0.001347607,0.0003391558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009210966,"about_ca_system_score_gemma":0.0002618925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005082411,"about_ca_topic_score_gemma":0.0008186642,"domain_scores_codex":[0.9995528,0.00007051024,0.00002108494,0.0001474401,0.00006174413,0.000146453],"domain_scores_gemma":[0.9946262,0.003144953,0.0008999354,0.000449257,0.0002519568,0.0006277097],"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.0004629567,0.0000763501,0.008048405,0.0001885678,0.000047586,0.0004798008,0.0005739286,0.01326961,0.01272572,0.935157,0.002782608,0.02618742],"study_design_scores_gemma":[0.00005413135,0.0001116987,0.006306854,0.0001039831,0.00005143669,0.001305668,0.0004700755,0.05191062,0.01036958,0.9229805,0.00626172,0.00007366553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8993441,0.002766307,0.05508178,0.002842802,0.0001362378,0.00002736798,0.0004227985,0.0002469207,0.03913172],"genre_scores_gemma":[0.9885799,0.0007403432,0.007701725,0.0001302471,0.0001112572,0.00002241655,0.000112658,0.00005911631,0.002542363],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002225189,"threshold_uncertainty_score":0.007444024,"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","authors":[{"name":"Michael Cavers","is_ca":true},{"name":"Sebastian M. Cioabă","is_ca":false},{"name":"Shaun Fallat","is_ca":true},{"name":"David A. Gregory","is_ca":true},{"name":"Willem H. Haemers","is_ca":false},{"name":"Steve Kirkland","is_ca":false},{"name":"Judith J. McDonald","is_ca":false},{"name":"Michael J. Tsatsomeros","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008156683,0.0007978589,0.0006208529,0.002688196,0.0009557792,0.002178026,0.0009596911,0.0008114951,0.008034343],"category_scores_gemma":[0.003993458,0.0004600999,0.0004732445,0.00245501,0.001632137,0.003325138,0.0009800027,0.00116841,0.001175772],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006141154,"about_ca_system_score_gemma":0.000705695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007635403,"about_ca_topic_score_gemma":0.001067783,"domain_scores_codex":[0.9992749,0.0002531431,0.00004672006,0.000152401,0.0001830632,0.0000897401],"domain_scores_gemma":[0.9973499,0.001030232,0.0005538351,0.0002352796,0.0005117724,0.0003191242],"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.00002394523,0.00002985069,0.0002868085,0.00004092159,0.000008345922,0.00005861474,0.0003105984,0.003577823,0.001684007,0.9774339,0.001898477,0.01464684],"study_design_scores_gemma":[0.000003116659,0.000008524581,0.0001469218,0.000006544337,0.000002602269,0.00005293152,0.00005585204,0.00808823,0.0003476873,0.9894119,0.001865243,0.00001039345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3455026,0.002713841,0.5894633,0.001789869,0.0007489129,0.0001098027,0.001297699,0.0007060756,0.05766792],"genre_scores_gemma":[0.9045616,0.002536356,0.07024318,0.0006212902,0.001100896,0.0001881762,0.0008745911,0.0002278948,0.01964603],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008034343,"threshold_uncertainty_score":0.02687758,"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","authors":[{"name":"Martin Bača","is_ca":false},{"name":"Jarmila Horváthová","is_ca":false},{"name":"Martina Mokrišová","is_ca":false},{"name":"Andrea Semaničová–Feňovčíková","is_ca":false},{"name":"Alžbeta Suhányiová","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000387208,0.0003258562,0.0002825134,0.002255476,0.0005259163,0.001047872,0.0003891241,0.0004457223,0.001718648],"category_scores_gemma":[0.00290131,0.0001596062,0.0001645877,0.0008950265,0.001156048,0.00208979,0.0005014424,0.0005068009,0.0002370275],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005416899,"about_ca_system_score_gemma":0.0002421585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004258956,"about_ca_topic_score_gemma":0.0004719018,"domain_scores_codex":[0.9997924,0.00006063236,0.000009934522,0.00003105659,0.00007842611,0.00002766148],"domain_scores_gemma":[0.9986833,0.0005507381,0.0002916464,0.0000823716,0.0002259384,0.0001659493],"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.00005439051,0.00003064206,0.001577092,0.00006578027,0.00000881613,0.00015196,0.000153883,0.05225579,0.009889986,0.92478,0.001304647,0.009726971],"study_design_scores_gemma":[0.00001485874,0.0000824466,0.001858799,0.00005653997,0.00001181343,0.0002651716,0.0001434251,0.3657814,0.003008746,0.6230316,0.005710267,0.00003505291],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7510349,0.001743623,0.1814932,0.0006569832,0.000241102,0.00006332125,0.0003978467,0.0001581473,0.06421102],"genre_scores_gemma":[0.967548,0.000993525,0.02728216,0.00008376654,0.0001627149,0.00007795015,0.0002494785,0.00008090982,0.003521571],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002255476,"threshold_uncertainty_score":0.005749404,"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","authors":[{"name":"Sebastian M. Cioabă","is_ca":false},{"name":"David A. Gregory","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001254051,0.0007814394,0.00163921,0.004063679,0.001981545,0.003915253,0.001565379,0.002778768,0.015244],"category_scores_gemma":[0.01357043,0.0009244397,0.0008608199,0.002382115,0.002969835,0.008375311,0.003464637,0.003770085,0.001982797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001331687,"about_ca_system_score_gemma":0.0006028544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006402346,"about_ca_topic_score_gemma":0.0006733169,"domain_scores_codex":[0.9988105,0.0003119397,0.00004908139,0.0002932664,0.0003829825,0.0001521353],"domain_scores_gemma":[0.9928994,0.003919767,0.0009295231,0.0008546072,0.0006714708,0.0007252321],"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.00004104249,0.00002239404,0.0001263317,0.00003857968,0.0000082424,0.00004993668,0.0001148667,0.0012744,0.000741361,0.9895209,0.002849933,0.005211982],"study_design_scores_gemma":[0.000008542623,0.000004026266,0.00008308583,0.000006683788,0.000003097561,0.00003939122,0.00002981694,0.006135176,0.000171825,0.9926488,0.0008634259,0.000006101348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3929066,0.002683474,0.4240384,0.007938071,0.001171093,0.0001906124,0.001046364,0.001978282,0.1680472],"genre_scores_gemma":[0.9224612,0.0008571125,0.03013314,0.001238291,0.001278308,0.0001814467,0.0005774617,0.0006893213,0.04258363],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.015244,"threshold_uncertainty_score":0.0509963,"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","authors":[{"name":"Mustapha Aouchiche","is_ca":true},{"name":"Pierre Hansen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003636757,0.001018576,0.002802122,0.003327617,0.004787707,0.007983197,0.003229719,0.004805596,0.01588949],"category_scores_gemma":[0.01783291,0.0008325149,0.001966668,0.004279269,0.01192021,0.01916118,0.006268078,0.008909581,0.002117348],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003299741,"about_ca_system_score_gemma":0.001292557,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002004748,"about_ca_topic_score_gemma":0.001119207,"domain_scores_codex":[0.9975261,0.0005474826,0.0001522833,0.0007457173,0.0005539462,0.0004744655],"domain_scores_gemma":[0.988091,0.007695714,0.0009247469,0.00143913,0.0008468584,0.001002539],"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.0001086088,0.00002710662,0.0003931637,0.00005297878,0.000009980075,0.00005948277,0.0003046789,0.0005847503,0.0002765542,0.9905759,0.004321276,0.003285386],"study_design_scores_gemma":[0.00002434581,0.00001019864,0.0001600814,0.00001477904,0.000007441618,0.00004046981,0.00005782539,0.001116405,0.0001126494,0.9966857,0.001758835,0.0000112165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4688133,0.00399485,0.1088956,0.07138227,0.005037286,0.000103499,0.0016961,0.001033119,0.3390439],"genre_scores_gemma":[0.951427,0.001567276,0.01422638,0.004700206,0.003860764,0.0001404834,0.001105509,0.0003317085,0.02264065],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01588949,"threshold_uncertainty_score":0.05315566,"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","authors":[{"name":"S. Amghibech","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006722977,0.00126879,0.0007479136,0.002953613,0.001096575,0.002024826,0.001304051,0.001836364,0.03046196],"category_scores_gemma":[0.003928205,0.0003448949,0.00101154,0.001976623,0.001627506,0.002800514,0.001520251,0.002312048,0.006977292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001328479,"about_ca_system_score_gemma":0.0005940588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00242364,"about_ca_topic_score_gemma":0.002871198,"domain_scores_codex":[0.9993988,0.0001801429,0.00002827002,0.000155843,0.0001363803,0.0001005398],"domain_scores_gemma":[0.9980394,0.000992869,0.0003287534,0.0001775915,0.00027229,0.0001891062],"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.00003546404,0.00003567387,0.0005514952,0.0002089556,0.0000265221,0.0003195212,0.0003034052,0.008684508,0.001567748,0.9450983,0.02329007,0.01987822],"study_design_scores_gemma":[0.000007858825,0.000009740524,0.0005208206,0.00002779627,0.000006575318,0.000366742,0.00008844553,0.02724973,0.0001622634,0.952814,0.0187267,0.00001932332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08112663,0.0104452,0.649586,0.01516162,0.002687356,0.0003235107,0.006702565,0.001261743,0.2327054],"genre_scores_gemma":[0.7172735,0.01647456,0.1142269,0.003572635,0.00352413,0.001180685,0.004689255,0.001099267,0.1379591],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03046196,"threshold_uncertainty_score":0.1019054,"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","authors":[{"name":"DavidA. Gregory","is_ca":true},{"name":"Daniel Hershkowitz","is_ca":false},{"name":"StephenJ. Kirkland","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001511565,0.0005691967,0.001064686,0.004658629,0.001226308,0.003286902,0.001563781,0.001580066,0.005586507],"category_scores_gemma":[0.01139345,0.0005705449,0.0005849896,0.002307448,0.00496229,0.006934178,0.002383739,0.002402099,0.0006959441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009452624,"about_ca_system_score_gemma":0.0005009035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008291688,"about_ca_topic_score_gemma":0.0003773851,"domain_scores_codex":[0.998768,0.0004044558,0.00004146904,0.0003301324,0.0003233447,0.0001325066],"domain_scores_gemma":[0.9912649,0.005354499,0.0007429332,0.0009410222,0.0008092172,0.0008874118],"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.00006894663,0.0000209801,0.0003822955,0.00003739345,0.00001391336,0.0000751808,0.0003803293,0.003937951,0.002546119,0.981673,0.0007863451,0.01007763],"study_design_scores_gemma":[0.00001158167,0.00001748235,0.0003224766,0.00001999115,0.000008239094,0.0001088389,0.0001382351,0.01496545,0.0004634522,0.9828137,0.001115721,0.00001487336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5309796,0.00316145,0.4160367,0.004072967,0.0003178184,0.00005343902,0.000503713,0.0006111437,0.04426325],"genre_scores_gemma":[0.9731684,0.001310557,0.01905216,0.0002920405,0.0005720156,0.00006548039,0.000170147,0.0001442758,0.005224952],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005586507,"threshold_uncertainty_score":0.01868874,"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","authors":[{"name":"Ralph Neininger","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003506387,0.0006168325,0.001148083,0.002615098,0.001006655,0.003499311,0.001308947,0.001259139,0.002936803],"category_scores_gemma":[0.02311652,0.0006321504,0.0008818498,0.002053251,0.002948466,0.00648253,0.001896563,0.001858638,0.0008697622],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001726093,"about_ca_system_score_gemma":0.001090435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00114431,"about_ca_topic_score_gemma":0.001011319,"domain_scores_codex":[0.9985043,0.0004574158,0.00007333706,0.0002249228,0.0005047176,0.0002354053],"domain_scores_gemma":[0.9929314,0.004264341,0.0008753946,0.0006473743,0.0007916326,0.0004898171],"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.00001724092,0.00001117271,0.0006277405,0.00002926342,0.00001357575,0.00006049757,0.000117331,0.02668284,0.0007389459,0.9663798,0.0005282673,0.004793251],"study_design_scores_gemma":[0.000005947901,0.00001796565,0.0005335424,0.0000222837,0.000008529064,0.00006967619,0.00003212444,0.1832632,0.0003325751,0.8146525,0.001037922,0.0000237251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.207536,0.002881481,0.760775,0.0009666538,0.0001290895,0.00006386407,0.0002577472,0.0003072487,0.02708297],"genre_scores_gemma":[0.9462833,0.00219266,0.03952862,0.0001835037,0.000264502,0.0001516818,0.000315493,0.0002455265,0.01083462],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003506387,"threshold_uncertainty_score":0.01854378,"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","authors":[{"name":"Pierre Hansen","is_ca":true},{"name":"Hadrien Mélot","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004766324,0.0003704544,0.0007519553,0.0007563265,0.0005521102,0.001043471,0.001516751,0.001000462,0.01097222],"category_scores_gemma":[0.00423631,0.0003895402,0.0003364371,0.0008921951,0.0007432618,0.001735733,0.001056368,0.001510288,0.002280378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008584416,"about_ca_system_score_gemma":0.0003974515,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009166953,"about_ca_topic_score_gemma":0.001886033,"domain_scores_codex":[0.9997044,0.00006386152,0.000009459951,0.00006384186,0.0001260254,0.00003249814],"domain_scores_gemma":[0.9989024,0.0007231098,0.00006032255,0.0001297349,0.0001257168,0.00005854411],"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.0001535002,0.00008038368,0.001142897,0.0004520037,0.0000634707,0.0001783807,0.0001712412,0.09471752,0.003579101,0.5950604,0.08617191,0.2182292],"study_design_scores_gemma":[0.00003175468,0.00006877764,0.0008924232,0.0001176037,0.00003232206,0.0003029586,0.00008017161,0.2617998,0.00335041,0.6739774,0.05932085,0.00002548931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06948449,0.02169933,0.6894992,0.005010208,0.001319208,0.0001288107,0.0008452251,0.00119127,0.2108223],"genre_scores_gemma":[0.5724429,0.009335271,0.2727707,0.000826407,0.001144564,0.0002232494,0.001960422,0.0009706182,0.1403258],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01097222,"threshold_uncertainty_score":0.03670579,"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","authors":[{"name":"Mustapha Aouchiche","is_ca":true},{"name":"Pierre Hansen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007400383,0.001594993,0.003072158,0.007546573,0.003546406,0.00829074,0.003700067,0.004062195,0.01345415],"category_scores_gemma":[0.02562884,0.001707765,0.001936222,0.01187465,0.01107731,0.02786558,0.004565056,0.007904177,0.003616161],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003194446,"about_ca_system_score_gemma":0.0028836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001562911,"about_ca_topic_score_gemma":0.001258784,"domain_scores_codex":[0.9944263,0.002063114,0.0003972597,0.001203917,0.00162793,0.0002814515],"domain_scores_gemma":[0.9702504,0.02304628,0.0007161573,0.003334717,0.002249089,0.0004034344],"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.00004889905,0.0001642541,0.001204474,0.001264928,0.00004554582,0.00008778265,0.0003730051,0.002791714,0.0002219558,0.8968869,0.01670036,0.08021025],"study_design_scores_gemma":[0.00001733044,0.00002332206,0.0003274746,0.0002584294,0.00001639207,0.0001228948,0.0001174503,0.005317643,0.000225709,0.9719242,0.02162175,0.00002732829],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04429018,0.2136303,0.5299026,0.05110632,0.004046966,0.0002177664,0.001408267,0.001489102,0.1539085],"genre_scores_gemma":[0.4764176,0.2334465,0.2198211,0.0104415,0.02867549,0.0005461091,0.005352145,0.0009893677,0.02431018],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01345415,"threshold_uncertainty_score":0.0450086,"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","authors":[{"name":"Али Реза Ашрафи","is_ca":false},{"name":"Amir Loghman","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009996186,0.0003373615,0.0003385743,0.001491786,0.001286463,0.002153517,0.0004610419,0.0009005106,0.02514483],"category_scores_gemma":[0.0005071749,0.0001587691,0.0001209111,0.0008277888,0.0006722619,0.001407358,0.00106739,0.0007335904,0.003019758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005152345,"about_ca_system_score_gemma":0.0003461805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003741136,"about_ca_topic_score_gemma":0.0004993263,"domain_scores_codex":[0.9998223,0.00002095177,0.00001007994,0.00003085112,0.00006224553,0.00005351386],"domain_scores_gemma":[0.9997826,0.00004035004,0.00004267158,0.00003587538,0.00004211728,0.00005637426],"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.0001500113,0.00004166181,0.0004106437,0.00009591224,0.000007731629,0.0002196567,0.0001281933,0.0008848174,0.01359461,0.9559667,0.007178223,0.0213218],"study_design_scores_gemma":[0.0000266178,0.0001348245,0.002344246,0.0001032302,0.00002351413,0.0006216053,0.0004990837,0.02303322,0.03057472,0.8970405,0.045544,0.00005431602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.4646089,0.001045251,0.03032821,0.001179912,0.001332576,0.00006039058,0.001074485,0.0006367282,0.4997335],"genre_scores_gemma":[0.9467266,0.0006967005,0.005914775,0.0003433246,0.0001689824,0.0001132743,0.0005275588,0.0001625272,0.04534637],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02514483,"threshold_uncertainty_score":0.08411789,"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","authors":[{"name":"Michael Doob","is_ca":true},{"name":"Willem H. Haemers","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006788481,0.001058109,0.001185999,0.003900299,0.002767783,0.005688445,0.001501583,0.001714565,0.01253858],"category_scores_gemma":[0.002846204,0.0005223717,0.001033989,0.001389067,0.004850362,0.007393143,0.002566952,0.002723466,0.002522258],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001274297,"about_ca_system_score_gemma":0.001258427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001603442,"about_ca_topic_score_gemma":0.000816267,"domain_scores_codex":[0.9985959,0.0001609118,0.0000448401,0.0005177428,0.0003722936,0.0003082737],"domain_scores_gemma":[0.9973928,0.00100177,0.0002793791,0.0002167688,0.0006733437,0.0004359461],"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.0001239312,0.00005986539,0.0004070725,0.00004611574,0.00001738072,0.0001726945,0.0002388321,0.0004330359,0.005238432,0.9814626,0.001156342,0.0106436],"study_design_scores_gemma":[0.00002359363,0.00004324033,0.0006485746,0.00004062843,0.00002182066,0.0004066896,0.000283849,0.004871399,0.00368781,0.9856403,0.004292429,0.00003966593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5414863,0.0006095247,0.2990543,0.001732851,0.001247785,0.0001305127,0.001274274,0.001130824,0.1533337],"genre_scores_gemma":[0.9097914,0.0007483061,0.05066009,0.0003913947,0.000539082,0.0002142223,0.0008684365,0.0006430839,0.03614393],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01253858,"threshold_uncertainty_score":0.04194576,"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","authors":[{"name":"Bojan Mohar","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009647199,0.0005553724,0.0006308462,0.002602289,0.001483412,0.00268512,0.001220288,0.001123885,0.009775786],"category_scores_gemma":[0.003002353,0.0004643659,0.0006563903,0.001212205,0.003114256,0.004554944,0.001553562,0.001986373,0.000599309],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008206075,"about_ca_system_score_gemma":0.000519595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007467844,"about_ca_topic_score_gemma":0.0006738558,"domain_scores_codex":[0.9991227,0.000261734,0.00004141175,0.0002150891,0.0002121801,0.0001468967],"domain_scores_gemma":[0.9976783,0.000992181,0.000359932,0.0002266053,0.0003088142,0.0004341746],"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.00001566421,0.00002034233,0.0001138026,0.00001050867,0.000004049147,0.0000322807,0.000132731,0.0004521517,0.0007305829,0.9956422,0.0003225145,0.002523205],"study_design_scores_gemma":[0.000006845213,0.000008668011,0.0001421989,0.000003943439,0.000002184057,0.0000349916,0.00005874679,0.004590788,0.0002017006,0.9945478,0.0003959972,0.000006202942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6698411,0.0006477145,0.2407825,0.001650048,0.0003473484,0.00007742878,0.0003820118,0.0002857812,0.08598613],"genre_scores_gemma":[0.9762712,0.0002906967,0.01297525,0.0003656615,0.0003141793,0.00006711809,0.0002303463,0.00007389901,0.009411679],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009775786,"threshold_uncertainty_score":0.03270328,"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","authors":[{"name":"Filippo Passerini","is_ca":false},{"name":"Simone Severini","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00264835,0.0005101507,0.001068754,0.002719372,0.001253493,0.003773127,0.001092159,0.001647097,0.003887906],"category_scores_gemma":[0.01192657,0.000579762,0.0005634422,0.001457623,0.005494713,0.009696481,0.00229202,0.001958731,0.0003170641],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001664461,"about_ca_system_score_gemma":0.0009048807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008528031,"about_ca_topic_score_gemma":0.0006804419,"domain_scores_codex":[0.9985594,0.0005873623,0.00007091746,0.0001958286,0.0004180758,0.0001683829],"domain_scores_gemma":[0.9929107,0.004982299,0.0004872018,0.0006407533,0.0004580977,0.0005210356],"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.00001282536,0.000005645406,0.0001789879,0.0000162814,0.000005902742,0.00001354432,0.00006838448,0.003669884,0.0002000958,0.994518,0.0002434124,0.00106704],"study_design_scores_gemma":[0.000002265927,0.00000299718,0.0001198999,0.000005217089,0.000002193392,0.00001386753,0.00001504435,0.008647062,0.00007167682,0.9907178,0.0003961716,0.000005832992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6127344,0.004329388,0.2664173,0.01051293,0.0006520634,0.00007085832,0.0007368349,0.0002035814,0.1043427],"genre_scores_gemma":[0.9850048,0.001328598,0.006102737,0.0002485114,0.0007436954,0.00007479946,0.000166073,0.00004709286,0.006283684],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003887906,"threshold_uncertainty_score":0.01400602,"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","authors":[{"name":"Jing Ma","is_ca":false},{"name":"Yongtang Shi","is_ca":false},{"name":"Jun Yue","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006176335,0.0005397034,0.0005707886,0.004478958,0.001217231,0.00380787,0.0006101659,0.000815366,0.008098797],"category_scores_gemma":[0.003659162,0.0003096809,0.0003528797,0.001868943,0.002168987,0.007619707,0.00180418,0.001512251,0.002321502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009684731,"about_ca_system_score_gemma":0.0003443455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000493724,"about_ca_topic_score_gemma":0.0005497118,"domain_scores_codex":[0.9994473,0.0001113091,0.00003219509,0.0001016416,0.0001995124,0.0001080562],"domain_scores_gemma":[0.9987364,0.0004425741,0.0002217231,0.0001426338,0.0002445683,0.0002121337],"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.00002625011,0.000006779664,0.0002797297,0.0000291442,0.00000498173,0.00003953301,0.00008937715,0.00023565,0.001054787,0.9873716,0.001953802,0.008908387],"study_design_scores_gemma":[0.000004513981,0.000009140398,0.0005011982,0.0000202622,0.000006537066,0.0001428787,0.00007870567,0.002196169,0.0009202863,0.9899132,0.006195551,0.00001150496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3837409,0.005752184,0.1354363,0.003716628,0.001570365,0.00005646012,0.001277415,0.0003856455,0.4680642],"genre_scores_gemma":[0.9479287,0.002918926,0.01280183,0.0004668618,0.001142161,0.00006639322,0.0005315403,0.0002260367,0.03391761],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008098797,"threshold_uncertainty_score":0.02709323,"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","authors":[{"name":"Sebastian M. Cioabă","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001224922,0.0009824792,0.00122563,0.003428835,0.001152149,0.003404723,0.001555334,0.0007153095,0.00962353],"category_scores_gemma":[0.00725976,0.0006639998,0.0009804571,0.001613431,0.002880176,0.007487434,0.002298214,0.002207555,0.001670338],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005595987,"about_ca_system_score_gemma":0.0003083927,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001960895,"about_ca_topic_score_gemma":0.0003589049,"domain_scores_codex":[0.9982623,0.0004580219,0.0001276575,0.0003533439,0.0005774306,0.000221258],"domain_scores_gemma":[0.9947286,0.002983747,0.0004556972,0.0006423463,0.000540354,0.0006492348],"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.00008567225,0.00003066937,0.0004948265,0.0001118665,0.00004935519,0.0001961362,0.0003272538,0.002009076,0.002867854,0.9728023,0.002272822,0.01875221],"study_design_scores_gemma":[0.00000574621,0.00001475258,0.0002778543,0.00002219685,0.00002394393,0.0002756549,0.00006800273,0.005367923,0.001039889,0.9880649,0.004825727,0.00001340875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4236047,0.002870542,0.4185882,0.002183718,0.001524642,0.0001075728,0.001033476,0.0006432756,0.1494439],"genre_scores_gemma":[0.909945,0.001969617,0.04757557,0.0004094722,0.001532486,0.0001622817,0.000592759,0.0004643261,0.0373484],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00962353,"threshold_uncertainty_score":0.0321939,"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","authors":[{"name":"Orest Bucicovschi","is_ca":false},{"name":"Sebastian M. Cioabă","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009678348,0.0007894664,0.001540456,0.001929421,0.001488942,0.002795687,0.0024557,0.001955194,0.003421042],"category_scores_gemma":[0.0126459,0.0006769139,0.0006824242,0.001578423,0.002015511,0.004505428,0.001530213,0.001925176,0.0004836577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001703059,"about_ca_system_score_gemma":0.0007955525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008056904,"about_ca_topic_score_gemma":0.001323029,"domain_scores_codex":[0.9991278,0.0002429037,0.00005085511,0.0002621903,0.0001891224,0.0001270634],"domain_scores_gemma":[0.9863871,0.008869245,0.001349165,0.001089856,0.0007232894,0.001581353],"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.002911401,0.000365297,0.02272157,0.001501516,0.0003157351,0.0005239775,0.00218747,0.1415316,0.03227182,0.7104512,0.01276716,0.07245128],"study_design_scores_gemma":[0.0002057903,0.0003155303,0.009243074,0.0001265603,0.000132564,0.0009778667,0.0008817666,0.1252528,0.01144943,0.8447803,0.006564786,0.00006941666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9322833,0.001007846,0.04989603,0.002469486,0.0001266864,0.00004560498,0.001398824,0.0002039421,0.01256826],"genre_scores_gemma":[0.9630637,0.0008159216,0.03067703,0.0002202251,0.0001914046,0.00009282984,0.001025847,0.0001686368,0.003744361],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003421042,"threshold_uncertainty_score":0.01235658,"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","authors":[{"name":"Mikio Kano","is_ca":false},{"name":"Hongliang Lu","is_ca":false},{"name":"Qinglin Yu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008782449,0.001274166,0.001380035,0.003460727,0.002216901,0.003467618,0.001322777,0.001783107,0.01135423],"category_scores_gemma":[0.008051218,0.00128371,0.001029904,0.002841701,0.003305398,0.004876345,0.002275137,0.002776913,0.002091565],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00105063,"about_ca_system_score_gemma":0.000697789,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002534977,"about_ca_topic_score_gemma":0.002661925,"domain_scores_codex":[0.9991252,0.0002445955,0.00003854516,0.000238033,0.0002028918,0.0001507818],"domain_scores_gemma":[0.9937472,0.003067428,0.0005852226,0.0007629273,0.0008495896,0.0009875584],"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.00009899885,0.00004627653,0.000771582,0.0001637828,0.00003299718,0.0002559766,0.0006342719,0.003165526,0.001815816,0.9679747,0.007700897,0.01733934],"study_design_scores_gemma":[0.00002093116,0.00001262399,0.0003633708,0.00002339966,0.00002882866,0.0001961061,0.0001925462,0.007718513,0.0006383661,0.9856231,0.0051682,0.00001402689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4090477,0.004901494,0.4816486,0.003608429,0.001061703,0.0003812591,0.0006773713,0.002509992,0.09616353],"genre_scores_gemma":[0.8941538,0.002107306,0.06649767,0.000666424,0.000630101,0.000308475,0.0005870796,0.0009130862,0.03413617],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01135423,"threshold_uncertainty_score":0.03798372,"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","authors":[{"name":"Mustapha Aouchiche","is_ca":true},{"name":"F.K. Bell","is_ca":false},{"name":"Dragoš Cvetković","is_ca":false},{"name":"Pierre Hansen","is_ca":true},{"name":"Peter Rowlinson","is_ca":false},{"name":"Slavko Simić","is_ca":false},{"name":"Dragan Stevanović","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002221049,0.0003481545,0.001250383,0.001389442,0.001938667,0.002560522,0.001961913,0.002112371,0.008630263],"category_scores_gemma":[0.02256016,0.0005371158,0.0008514857,0.00126813,0.003042396,0.005475046,0.001836114,0.002159373,0.0005122733],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001273279,"about_ca_system_score_gemma":0.0007488457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001461275,"about_ca_topic_score_gemma":0.002432628,"domain_scores_codex":[0.999071,0.0004071816,0.00002974815,0.0002251235,0.0001315883,0.0001352689],"domain_scores_gemma":[0.9846986,0.01204156,0.0009556616,0.0007756577,0.0006971452,0.0008313818],"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.0002948276,0.0001310146,0.00300834,0.0002596455,0.0000547659,0.0001690835,0.0004420006,0.04361219,0.001111907,0.9228718,0.01298353,0.015061],"study_design_scores_gemma":[0.00006146187,0.00003758282,0.0008370736,0.00004288141,0.00001801925,0.00008209047,0.0002125045,0.1293027,0.0004265018,0.8674006,0.001559271,0.00001944813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6522619,0.003773288,0.2630852,0.0147624,0.0004585713,0.0001323934,0.0007482955,0.0004012775,0.06437658],"genre_scores_gemma":[0.9583517,0.0009034704,0.03085306,0.0006960928,0.0003478075,0.0001332945,0.0004657429,0.0001162624,0.008132447],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008630263,"threshold_uncertainty_score":0.02887112,"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","authors":[{"name":"Abdul Qudair Baig","is_ca":false},{"name":"Muhammad Imran","is_ca":false},{"name":"Waqas Khalid","is_ca":false},{"name":"Muhammad Naeem","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007888218,0.0002123536,0.0002210062,0.001248093,0.00046568,0.0005421697,0.0004730744,0.0005448371,0.003800621],"category_scores_gemma":[0.0003416724,0.00007335837,0.0002964033,0.001109938,0.0004893169,0.0006143448,0.0002283801,0.0004966101,0.0005193853],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000361404,"about_ca_system_score_gemma":0.0004036671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002483956,"about_ca_topic_score_gemma":0.002579868,"domain_scores_codex":[0.9998999,0.00001864708,0.000004377911,0.00001424078,0.00004810582,0.00001467956],"domain_scores_gemma":[0.9999014,0.00002265956,0.00001452252,0.00001705924,0.00003453543,0.000009791927],"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.00001698831,0.00001183397,0.0002800976,0.000119765,0.000005036172,0.0001792023,0.0000546535,0.02536827,0.004322999,0.9501855,0.002849287,0.0166065],"study_design_scores_gemma":[0.000007820575,0.00003777978,0.001056053,0.0000433132,0.000008291182,0.000744444,0.0001160889,0.2068248,0.002226526,0.7514175,0.03748676,0.00003056038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2407946,0.01022547,0.4776008,0.001806535,0.0006925659,0.0001424659,0.004236636,0.0009453492,0.2635555],"genre_scores_gemma":[0.8831989,0.002358907,0.09483584,0.0003031536,0.0001970471,0.00009747175,0.001343945,0.0001102954,0.01755439],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003800621,"threshold_uncertainty_score":0.01271439,"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","authors":[{"name":"Rodica Boliac","is_ca":false},{"name":"Kathie Cameron","is_ca":false},{"name":"Vadim Lozin","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00199664,0.001289157,0.001658732,0.003114948,0.00167908,0.002892433,0.003776922,0.001807839,0.01283525],"category_scores_gemma":[0.02068749,0.0006927467,0.0009159585,0.003319574,0.002879498,0.0102728,0.003186761,0.002684803,0.003064831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001975165,"about_ca_system_score_gemma":0.001316491,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00159107,"about_ca_topic_score_gemma":0.003417349,"domain_scores_codex":[0.998251,0.0005198051,0.00009181087,0.0004375793,0.0003740368,0.0003257273],"domain_scores_gemma":[0.9888877,0.007247736,0.0009886216,0.00166724,0.0004478098,0.00076086],"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.002600017,0.0009467722,0.01839506,0.0008531244,0.0002507076,0.0003622459,0.0005443039,0.1741062,0.008549937,0.4877056,0.04471805,0.2609679],"study_design_scores_gemma":[0.0001122976,0.00009606021,0.002496043,0.00004810747,0.0000438084,0.0002225632,0.0001466066,0.2512085,0.004062571,0.7366248,0.004898891,0.00003972397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4982349,0.002597113,0.4221818,0.003455496,0.000559016,0.000271183,0.003395878,0.003722007,0.06558254],"genre_scores_gemma":[0.7958079,0.0008943502,0.1835841,0.0005127357,0.0003941873,0.0002852464,0.004880321,0.0006770762,0.01296414],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01283525,"threshold_uncertainty_score":0.04293811,"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","authors":[{"name":"Carla Silva Oliveira","is_ca":false},{"name":"Nair Maria Maia de Abreu","is_ca":false},{"name":"Pierre Hansen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003294005,0.00209355,0.001941052,0.005097446,0.001576047,0.004768852,0.004360334,0.002346562,0.007350745],"category_scores_gemma":[0.02443576,0.0007706055,0.001123731,0.002531736,0.004756191,0.009598725,0.004195202,0.007272094,0.00173011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003181248,"about_ca_system_score_gemma":0.001161605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007376701,"about_ca_topic_score_gemma":0.001124895,"domain_scores_codex":[0.9982797,0.0003992395,0.00008304537,0.0003122601,0.0006745585,0.0002512824],"domain_scores_gemma":[0.9743395,0.01735566,0.001505768,0.001984848,0.002138548,0.002675618],"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.0004321162,0.0001475605,0.001648006,0.0003534048,0.00006583222,0.0003079977,0.0004542644,0.01760235,0.0106665,0.9383705,0.009318514,0.02063296],"study_design_scores_gemma":[0.00003173397,0.00008019667,0.001148943,0.0001222673,0.0000632619,0.0003053333,0.0001102824,0.1141378,0.002828033,0.8773068,0.003803612,0.00006162858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2915323,0.01018276,0.4803808,0.01154716,0.002072798,0.00009640238,0.001301683,0.001493395,0.2013927],"genre_scores_gemma":[0.9119196,0.005788569,0.05224199,0.001238857,0.002677548,0.0002613781,0.0009899816,0.001097082,0.02378502],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007350745,"threshold_uncertainty_score":0.02459067,"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","authors":[{"name":"Sebastian M. Cioabă","is_ca":false},{"name":"David A. Gregory","is_ca":true},{"name":"Vladimir Nikiforov","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006395497,0.0006402654,0.0007342565,0.00264114,0.001386148,0.002489324,0.0008602857,0.001286965,0.004884525],"category_scores_gemma":[0.003779105,0.0004964879,0.0003733627,0.0008935669,0.002076559,0.001870653,0.001308149,0.001420871,0.00057262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000600569,"about_ca_system_score_gemma":0.000266468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003279762,"about_ca_topic_score_gemma":0.0005727584,"domain_scores_codex":[0.999498,0.0001404085,0.0000220895,0.00007597139,0.0001661856,0.00009733527],"domain_scores_gemma":[0.9979353,0.0008639139,0.0003185788,0.0001791778,0.0002314759,0.0004714988],"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.000130493,0.0000882263,0.00118942,0.00004857639,0.00001969218,0.0003350424,0.0004823895,0.005175502,0.007658267,0.9758502,0.002327307,0.006695039],"study_design_scores_gemma":[0.00002550226,0.00001915872,0.0007756457,0.000009819983,0.000005713248,0.0001957803,0.0001798712,0.01880467,0.0006792186,0.978624,0.0006651403,0.00001541818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9012108,0.0003488839,0.06288882,0.0009268721,0.0002472379,0.00003397809,0.00009284553,0.0003086551,0.03394194],"genre_scores_gemma":[0.9885342,0.0001589527,0.00566518,0.0001154215,0.0001706243,0.00003698224,0.0000656412,0.00006926847,0.005183795],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004884525,"threshold_uncertainty_score":0.01634032,"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","authors":[{"name":"William Baird","is_ca":true},{"name":"Anthony Bonato","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003075264,0.001006468,0.001961863,0.004624989,0.002393344,0.005557641,0.001986376,0.00297416,0.006963344],"category_scores_gemma":[0.01026993,0.001002374,0.0009014163,0.006796853,0.007163789,0.01843905,0.002922174,0.004524274,0.001806681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004492492,"about_ca_system_score_gemma":0.002071545,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003474781,"about_ca_topic_score_gemma":0.001409718,"domain_scores_codex":[0.9982121,0.0002326026,0.0001116247,0.0007050736,0.0004790985,0.0002595028],"domain_scores_gemma":[0.9936013,0.004463285,0.0003129477,0.0004738207,0.0008320311,0.0003165557],"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.0000687321,0.00006814391,0.001500793,0.0007505763,0.00002869982,0.0001130518,0.0003356238,0.003143441,0.0004075727,0.8780615,0.01596816,0.09955363],"study_design_scores_gemma":[0.00002205514,0.00006359956,0.001176054,0.0003911332,0.00002267697,0.00037746,0.0004125194,0.005766827,0.0008679054,0.8467316,0.1440946,0.0000734296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.09276263,0.4208777,0.1179954,0.04550217,0.003663455,0.0001325554,0.00110547,0.0004037398,0.3175569],"genre_scores_gemma":[0.6384676,0.2746434,0.0349665,0.005920156,0.01059389,0.0002778417,0.00202017,0.0003829373,0.03272751],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.006963344,"threshold_uncertainty_score":0.03259546,"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","authors":[{"name":"Shaun Fallat","is_ca":true},{"name":"Yi-Zheng Fan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00119234,0.0007588324,0.0008854729,0.002365867,0.001139043,0.002514407,0.001227534,0.001715513,0.005453605],"category_scores_gemma":[0.008150658,0.0005048364,0.0004727089,0.001321132,0.003902572,0.003609815,0.001315798,0.001895806,0.0006473174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006607594,"about_ca_system_score_gemma":0.0006282931,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000851005,"about_ca_topic_score_gemma":0.000979131,"domain_scores_codex":[0.9991155,0.0003578408,0.00003661552,0.0001776363,0.0002014158,0.000110998],"domain_scores_gemma":[0.9941553,0.003345064,0.0008156433,0.0002821242,0.0006369012,0.0007649976],"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.00009462634,0.00007602962,0.0008723279,0.00008486006,0.00002071398,0.0001358434,0.0004390867,0.004140307,0.005323169,0.9783108,0.002529092,0.007973122],"study_design_scores_gemma":[0.00001386268,0.00001624309,0.0004505539,0.00001049207,0.000005732951,0.00009270637,0.00009974173,0.01491364,0.0004729088,0.9834366,0.0004667682,0.00002069518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7130401,0.001411397,0.236618,0.004766176,0.0004544273,0.00004392593,0.0003294629,0.0003472972,0.04298926],"genre_scores_gemma":[0.9776676,0.0005614812,0.01284731,0.0004251867,0.0006397685,0.00005534837,0.0002106759,0.00009627533,0.007496409],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005453605,"threshold_uncertainty_score":0.01824415,"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","authors":[{"name":"Muhammad Imran","is_ca":false},{"name":"Abdul Qudair Baig","is_ca":false},{"name":"Haidar Ali","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008384138,0.0004119704,0.000334578,0.003057357,0.0009191284,0.001793521,0.000769866,0.0005029157,0.002928768],"category_scores_gemma":[0.005380335,0.0002604602,0.0004053543,0.001285998,0.001305881,0.002148278,0.0008661044,0.0007334054,0.0003078927],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00147614,"about_ca_system_score_gemma":0.0003447871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008181499,"about_ca_topic_score_gemma":0.0009932356,"domain_scores_codex":[0.999496,0.0001781592,0.00002802555,0.0000982302,0.0001372731,0.0000623118],"domain_scores_gemma":[0.9969383,0.001720877,0.0004197785,0.0001543793,0.0004937304,0.000273027],"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.00004521515,0.00002505978,0.002742983,0.00009516853,0.00002082465,0.0001941016,0.0002789673,0.03980883,0.00272006,0.9370239,0.001901199,0.01514375],"study_design_scores_gemma":[0.00001693339,0.00007248361,0.002553838,0.00005167991,0.00003421442,0.0005792338,0.0003395899,0.2782976,0.002012638,0.7053321,0.01067821,0.00003149011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5320591,0.001567141,0.3936815,0.0007874289,0.0001035446,0.0001326004,0.0008674383,0.0001391742,0.07066208],"genre_scores_gemma":[0.956479,0.001201536,0.0339716,0.0001641501,0.0001021119,0.0001050946,0.000752851,0.00004330894,0.007180254],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003057357,"threshold_uncertainty_score":0.01071018,"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","authors":[{"name":"Pierre Hansen","is_ca":true},{"name":"Claire Lucas","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006247361,0.001896847,0.003052189,0.007068141,0.002997558,0.008271559,0.006318578,0.004186478,0.01354155],"category_scores_gemma":[0.04085436,0.001232636,0.00158617,0.005490139,0.01163249,0.02169033,0.00542087,0.01209629,0.001886988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003662577,"about_ca_system_score_gemma":0.001120299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001293584,"about_ca_topic_score_gemma":0.001331763,"domain_scores_codex":[0.996316,0.001113499,0.0001735848,0.0008253299,0.00106231,0.0005092312],"domain_scores_gemma":[0.9606271,0.02913995,0.001971425,0.003306837,0.002228334,0.00272639],"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.0001224806,0.00008411648,0.0005780373,0.0001349741,0.00001825103,0.00006343901,0.000314405,0.002952821,0.0007775594,0.983731,0.005238867,0.005984095],"study_design_scores_gemma":[0.000009966349,0.000006921994,0.0001107279,0.00001698162,0.000006261563,0.00002103158,0.00003491757,0.006060197,0.000126798,0.9930646,0.0005300519,0.00001157959],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3877392,0.0137847,0.3189315,0.0480301,0.003307209,0.00011464,0.001515685,0.00170911,0.2248679],"genre_scores_gemma":[0.9382489,0.003826474,0.03079775,0.003221147,0.005377089,0.0002598761,0.001036294,0.0005376855,0.01669485],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01354155,"threshold_uncertainty_score":0.04530102,"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","authors":[{"name":"Bojan Mohar","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001204858,0.001133951,0.0009420126,0.004808465,0.0008145125,0.001654241,0.001259345,0.00100021,0.008929287],"category_scores_gemma":[0.009433393,0.0004678879,0.0004324657,0.00365651,0.002328197,0.003924041,0.001391245,0.002398824,0.001288378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001065205,"about_ca_system_score_gemma":0.0006902477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002480341,"about_ca_topic_score_gemma":0.002714826,"domain_scores_codex":[0.9994185,0.0002100509,0.00001968557,0.00007619346,0.0001826321,0.00009295289],"domain_scores_gemma":[0.9954306,0.002958119,0.0003930109,0.0002049091,0.0006208424,0.0003925011],"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.00003632631,0.0000429689,0.0003903868,0.00007766941,0.00001056379,0.00009059498,0.0002779152,0.007546962,0.001472877,0.9702014,0.004879918,0.01497236],"study_design_scores_gemma":[0.0000129577,0.000008947952,0.00029179,0.00003248182,0.000008297819,0.00008879456,0.00009512631,0.03367577,0.0004013086,0.9627629,0.002596221,0.00002540298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4426194,0.006697945,0.3883634,0.006038039,0.001515208,0.00009884629,0.0008439349,0.0006544469,0.1531688],"genre_scores_gemma":[0.9276252,0.005861298,0.03101845,0.000872944,0.001602087,0.0001291594,0.0006340842,0.0003483406,0.03190825],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008929287,"threshold_uncertainty_score":0.0298714,"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","authors":[{"name":"J. Harnad","is_ca":true},{"name":"Ferenc Balogh","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003338018,0.0007740647,0.0004922752,0.002653312,0.001323903,0.002599047,0.0004624764,0.0007692075,0.009929262],"category_scores_gemma":[0.001251144,0.0002375096,0.0004050379,0.002443176,0.001823373,0.00303528,0.001093869,0.001563646,0.002921773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001147012,"about_ca_system_score_gemma":0.0004581583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005740476,"about_ca_topic_score_gemma":0.000464696,"domain_scores_codex":[0.9997867,0.00006053392,0.000008093602,0.00003563978,0.00008178359,0.0000272603],"domain_scores_gemma":[0.9997148,0.0001481229,0.00001695782,0.00003425806,0.00005914618,0.0000268021],"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.000004356963,0.00000542908,0.00004693961,0.00007726113,0.000002512442,0.00005227037,0.0002584277,0.0005447973,0.0003117427,0.9533784,0.01051878,0.034799],"study_design_scores_gemma":[0.000001264708,0.000009077111,0.0001487884,0.00008683576,0.000003206885,0.0002039231,0.0001172897,0.001407053,0.0002041457,0.8764405,0.1213718,0.000006178274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.02119647,0.1135852,0.06696015,0.004689238,0.002529435,0.00004163136,0.0002759828,0.0004192838,0.7903027],"genre_scores_gemma":[0.410928,0.1480862,0.0530347,0.002769638,0.005974677,0.0002152778,0.0005272498,0.0006237954,0.3778404],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.009929262,"threshold_uncertainty_score":0.03321671,"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","authors":[{"name":"Dragan Stevanović","is_ca":false},{"name":"Mustapha Aouchiche","is_ca":true},{"name":"Pierre Hansen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002928553,0.001090772,0.002042268,0.004925032,0.001790238,0.003385271,0.002612725,0.001866986,0.005341155],"category_scores_gemma":[0.02072331,0.0006949446,0.0006488808,0.003000242,0.004872859,0.006521007,0.002625178,0.001989381,0.0008668371],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001846358,"about_ca_system_score_gemma":0.0006445982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001068997,"about_ca_topic_score_gemma":0.0007014591,"domain_scores_codex":[0.9982408,0.000792351,0.0000654385,0.0003686484,0.0002965324,0.0002361969],"domain_scores_gemma":[0.9736008,0.01982103,0.002302922,0.001013277,0.001169524,0.00209238],"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.0004137224,0.00008654511,0.001901515,0.0002234229,0.00005058025,0.0001128038,0.0007061107,0.02652306,0.00545597,0.9476712,0.004136885,0.01271816],"study_design_scores_gemma":[0.00004669818,0.00005388847,0.00156149,0.00006734717,0.0000481516,0.0002943868,0.0003605329,0.101219,0.00201135,0.8919142,0.002363485,0.00005946484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7239153,0.003771639,0.2088466,0.003843143,0.0002011537,0.00006914844,0.0006962926,0.0006366461,0.05802013],"genre_scores_gemma":[0.9727041,0.00149786,0.01981514,0.0003288362,0.0004969367,0.0001265358,0.0003386596,0.0002301561,0.004461694],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005341155,"threshold_uncertainty_score":0.01786792,"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","authors":[{"name":"Maria Chudnovsky","is_ca":false},{"name":"Bruce Reed","is_ca":true},{"name":"Paul Seymour","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000983505,0.0007235149,0.0006555477,0.002967899,0.00138426,0.00303223,0.001966079,0.001128185,0.06797997],"category_scores_gemma":[0.01128915,0.0004809304,0.0006792552,0.002174015,0.001380211,0.004922978,0.001500854,0.002130817,0.0142675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001525452,"about_ca_system_score_gemma":0.0007818137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002102694,"about_ca_topic_score_gemma":0.002435534,"domain_scores_codex":[0.9992405,0.0001593953,0.00003817764,0.0001938989,0.0002613371,0.0001065786],"domain_scores_gemma":[0.9959123,0.002125199,0.0002751758,0.000529299,0.0008544527,0.0003035946],"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.0001005938,0.00006581919,0.001618698,0.0002623067,0.00002225787,0.0001070867,0.0003064239,0.003867791,0.001581754,0.8362569,0.1069839,0.04882652],"study_design_scores_gemma":[0.00002270606,0.00003137979,0.003271015,0.0001460023,0.000029315,0.0006832201,0.0002172956,0.03087248,0.003046143,0.8782838,0.08335227,0.00004433906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08757368,0.002836458,0.5347022,0.004629516,0.001156908,0.000268406,0.0159497,0.003451274,0.3494319],"genre_scores_gemma":[0.6612852,0.003856289,0.1742412,0.001162667,0.001387123,0.0006659231,0.0148257,0.004215797,0.1383601],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.06797997,"threshold_uncertainty_score":0.2274156,"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","authors":[{"name":"Saieed Akbari","is_ca":false},{"name":"Steve Kirkland","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008570738,0.001109432,0.00148084,0.003783753,0.002730351,0.003511997,0.002040561,0.001203989,0.01645586],"category_scores_gemma":[0.003635605,0.0006973642,0.0009500056,0.005106139,0.003090994,0.008193767,0.003541415,0.003621603,0.001966106],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001913277,"about_ca_system_score_gemma":0.0006929738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001685919,"about_ca_topic_score_gemma":0.002038276,"domain_scores_codex":[0.9989206,0.0003427032,0.00003640245,0.0002723106,0.0002517729,0.0001762659],"domain_scores_gemma":[0.997039,0.001462953,0.000472469,0.0002913415,0.0003307312,0.000403569],"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.00001604517,0.00002206654,0.00008079192,0.00003818627,0.000004428727,0.00002813148,0.0001388907,0.0005379596,0.0002274634,0.9891729,0.002253643,0.007479418],"study_design_scores_gemma":[0.000002942311,0.00000341288,0.00006213414,0.000008147483,0.00000325732,0.00003045809,0.00004391942,0.001738126,0.00008798693,0.9963898,0.001625353,0.000004396428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3363681,0.006626402,0.3066821,0.009444144,0.001121465,0.0001136879,0.001519288,0.0007110094,0.3374138],"genre_scores_gemma":[0.8333815,0.004791522,0.043283,0.00238467,0.001880605,0.0002053798,0.001269608,0.0003629806,0.1124407],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01645586,"threshold_uncertainty_score":0.05505031,"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","authors":[{"name":"Alexander E. Litvak","is_ca":true},{"name":"Anna Lytova","is_ca":true},{"name":"Konstantin Tikhomirov","is_ca":true},{"name":"Nicole Tomczak-Jaegermann","is_ca":true},{"name":"Pierre Youssef","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009556385,0.0006476896,0.0006201424,0.001530889,0.0008325113,0.001908807,0.001584682,0.001252505,0.003236674],"category_scores_gemma":[0.01402309,0.0007862209,0.0005802181,0.0008844399,0.002335575,0.002690445,0.001630033,0.001893188,0.0005337262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001291579,"about_ca_system_score_gemma":0.0006067883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001523457,"about_ca_topic_score_gemma":0.002169491,"domain_scores_codex":[0.9988353,0.0003545091,0.00005385979,0.0003716391,0.0002313433,0.0001533904],"domain_scores_gemma":[0.9887695,0.006983487,0.001629826,0.001049798,0.0006738909,0.0008935645],"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.0001981582,0.0001229541,0.005879291,0.0001994448,0.0000674164,0.0005539985,0.0005366998,0.08239453,0.009238369,0.8723226,0.006711355,0.02177531],"study_design_scores_gemma":[0.00005189317,0.00005993454,0.001812856,0.00003307344,0.00001989905,0.000462334,0.0001180943,0.495107,0.002700475,0.4971015,0.00248954,0.00004340876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4882671,0.0008545551,0.4850252,0.003023712,0.00007913256,0.0001659572,0.001061897,0.000599779,0.02092266],"genre_scores_gemma":[0.9578535,0.0005979399,0.03470302,0.0005473271,0.0001195184,0.0001869318,0.000643886,0.00009652958,0.005251424],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003236674,"threshold_uncertainty_score":0.01082778,"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","authors":[{"name":"Lingping Zhong","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003981742,0.0004112572,0.000618829,0.003541625,0.001058381,0.00237643,0.001086605,0.0009150085,0.01037684],"category_scores_gemma":[0.004100023,0.0002696943,0.0002408681,0.002409749,0.00195514,0.003811559,0.002123724,0.001420638,0.001690828],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001246551,"about_ca_system_score_gemma":0.0003384195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009787398,"about_ca_topic_score_gemma":0.001062998,"domain_scores_codex":[0.9995584,0.00008768857,0.00002058778,0.00008356704,0.0001590378,0.00009066238],"domain_scores_gemma":[0.998348,0.0007310463,0.0002882546,0.00018161,0.0001859366,0.0002652031],"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.00004133098,0.00001295961,0.0003880678,0.00006890885,0.000007864269,0.00005706869,0.0001755919,0.001047965,0.0008782493,0.9737235,0.005322992,0.01827553],"study_design_scores_gemma":[0.000007583456,0.00001005203,0.0005110902,0.00002681465,0.00000672339,0.0001442661,0.0001100568,0.004660646,0.0004328357,0.9877577,0.006321847,0.00001051909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.4409902,0.01046678,0.08897784,0.004400165,0.001848255,0.00007513991,0.001326116,0.0003817619,0.4515338],"genre_scores_gemma":[0.9543715,0.003537315,0.007431684,0.0003605451,0.0009356583,0.00006345586,0.0004474659,0.0001375028,0.03271492],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01037684,"threshold_uncertainty_score":0.03471398,"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","authors":[{"name":"Jason I. Brown","is_ca":true},{"name":"Lucas Mol","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001443669,0.0007465852,0.000912669,0.001515085,0.0009578303,0.001648383,0.001252275,0.0009870455,0.007716138],"category_scores_gemma":[0.01709533,0.0004419336,0.000588721,0.001196546,0.003178083,0.003693046,0.001570337,0.003844198,0.001279632],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001154865,"about_ca_system_score_gemma":0.000780221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0010817,"about_ca_topic_score_gemma":0.0009822049,"domain_scores_codex":[0.9991646,0.0003025842,0.00002292603,0.0001410458,0.0002077902,0.0001611265],"domain_scores_gemma":[0.9906906,0.00676101,0.0007319408,0.0005648814,0.0008124772,0.0004390299],"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.00003858281,0.00001521654,0.0001798079,0.00005337437,0.0000072104,0.00005602475,0.0001700977,0.01242036,0.0009045476,0.9762062,0.001563457,0.008385156],"study_design_scores_gemma":[0.00001079579,0.00001350322,0.0002000024,0.00002249729,0.000006025001,0.00005727445,0.00006359845,0.03390356,0.000333353,0.9640869,0.001289171,0.00001332853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2579986,0.00196614,0.6580624,0.002773002,0.0003413873,0.0000679524,0.0004134864,0.0003124234,0.07806452],"genre_scores_gemma":[0.9554434,0.001663433,0.02533607,0.000241248,0.0004090974,0.00006207596,0.0001627075,0.0001707924,0.01651115],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007716138,"threshold_uncertainty_score":0.0258131,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}